import { _getProvider as t, getApp as e, _removeServiceInstance as n, _registerComponent as r, registerVersion as s, SDK_VERSION as i } from "@firebase/app";
import { Component as o } from "@firebase/component";
import { createMockUserToken as u, getModularInstance as c } from "@firebase/util";
import { Logger as a, LogLevel as h } from "@firebase/logger";
/**
* @license
* Copyright 2017 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
let l = "8.8.1";
/**
* @license
* Copyright 2017 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/**
* Simple wrapper around a nullable UID. Mostly exists to make code more
* readable.
*/
class f {
constructor(t) {
this.uid = t;
}
isAuthenticated() {
return null != this.uid;
}
/**
* Returns a key representing this user, suitable for inclusion in a
* dictionary.
*/ toKey() {
return this.isAuthenticated() ? "uid:" + this.uid : "anonymous-user";
}
isEqual(t) {
return t.uid === this.uid;
}
}
/** A user with a null UID. */ f.UNAUTHENTICATED = new f(null),
// TODO(mikelehen): Look into getting a proper uid-equivalent for
// non-FirebaseAuth providers.
f.GOOGLE_CREDENTIALS = new f("google-credentials-uid"), f.FIRST_PARTY = new f("first-party-uid");
/**
* @license
* Copyright 2017 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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 d = new a("@firebase/firestore");
/**
* Sets the verbosity of Cloud Firestore logs (debug, error, or silent).
*
* @param logLevel - The verbosity you set for activity and error logging. Can
* be any of the following values:
*
* <ul>
* <li>`debug` for the most verbose logging level, primarily for
* debugging.</li>
* <li>`error` to log errors only.</li>
* <li><code>`silent` to turn off logging.</li>
* </ul>
*/ function w(t) {
d.setLogLevel(t);
}
function m(t, ...e) {
if (d.logLevel <= h.DEBUG) {
const n = e.map(_);
d.debug(`Firestore (${l}): ${t}`, ...n);
}
}
function p(t, ...e) {
if (d.logLevel <= h.ERROR) {
const n = e.map(_);
d.error(`Firestore (${l}): ${t}`, ...n);
}
}
function y(t, ...e) {
if (d.logLevel <= h.WARN) {
const n = e.map(_);
d.warn(`Firestore (${l}): ${t}`, ...n);
}
}
/**
* Converts an additional log parameter to a string representation.
*/ function _(t) {
if ("string" == typeof t) return t;
try {
return e = t, JSON.stringify(e);
} catch (e) {
// Converting to JSON failed, just log the object directly
return t;
}
/**
* @license
* Copyright 2020 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/** Formats an object as a JSON string, suitable for logging. */
var e;
}
/**
* @license
* Copyright 2017 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/**
* Unconditionally fails, throwing an Error with the given message.
* Messages are stripped in production builds.
*
* Returns `never` and can be used in expressions:
* @example
* let futureVar = fail('not implemented yet');
*/ function g(t = "Unexpected state") {
// Log the failure in addition to throw an exception, just in case the
// exception is swallowed.
const e = `FIRESTORE (${l}) INTERNAL ASSERTION FAILED: ` + t;
// NOTE: We don't use FirestoreError here because these are internal failures
// that cannot be handled by the user. (Also it would create a circular
// dependency between the error and assert modules which doesn't work.)
throw p(e), new Error(e);
}
/**
* Fails if the given assertion condition is false, throwing an Error with the
* given message if it did.
*
* Messages are stripped in production builds.
*/ function b(t, e) {
t || g();
}
/**
* Casts `obj` to `T`. In non-production builds, verifies that `obj` is an
* instance of `T` before casting.
*/ function v(t,
// eslint-disable-next-line @typescript-eslint/no-explicit-any
e) {
return t;
}
/**
* @license
* Copyright 2017 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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 E = "ok", T = "cancelled", I = "unknown", A = "invalid-argument", P = "deadline-exceeded", R = "not-found", V = "already-exists", N = "permission-denied", D = "unauthenticated", $ = "resource-exhausted", F = "failed-precondition", S = "aborted", q = "out-of-range", x = "unimplemented", O = "internal", C = "unavailable", L = "data-loss";
/** An error returned by a Firestore operation. */ class U extends Error {
/** @hideconstructor */
constructor(
/**
* The backend error code associated with this error.
*/
t,
/**
* A custom error description.
*/
e) {
super(e), this.code = t, this.message = e,
/** The custom name for all FirestoreErrors. */
this.name = "FirebaseError",
// HACK: We write a toString property directly because Error is not a real
// class and so inheritance does not work correctly. We could alternatively
// do the same "back-door inheritance" trick that FirebaseError does.
this.toString = () => `${this.name}: [code=${this.code}]: ${this.message}`;
}
}
/**
* @license
* Copyright 2017 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/ class j {
constructor() {
this.promise = new Promise(((t, e) => {
this.resolve = t, this.reject = e;
}));
}
}
/**
* @license
* Copyright 2017 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/ class k {
constructor(t, e) {
this.user = e, this.type = "OAuth", this.authHeaders = {},
// Set the headers using Object Literal notation to avoid minification
this.authHeaders.Authorization = `Bearer ${t}`;
}
}
/** A CredentialsProvider that always yields an empty token. */ class M {
constructor() {
/**
* Stores the listener registered with setChangeListener()
* This isn't actually necessary since the UID never changes, but we use this
* to verify the listen contract is adhered to in tests.
*/
this.changeListener = null;
}
getToken() {
return Promise.resolve(null);
}
invalidateToken() {}
setChangeListener(t, e) {
this.changeListener = e,
// Fire with initial user.
t.enqueueRetryable((() => e(f.UNAUTHENTICATED)));
}
removeChangeListener() {
this.changeListener = null;
}
}
/**
* A CredentialsProvider that always returns a constant token. Used for
* emulator token mocking.
*/ class B {
constructor(t) {
this.token = t,
/**
* Stores the listener registered with setChangeListener()
* This isn't actually necessary since the UID never changes, but we use this
* to verify the listen contract is adhered to in tests.
*/
this.changeListener = null;
}
getToken() {
return Promise.resolve(this.token);
}
invalidateToken() {}
setChangeListener(t, e) {
this.changeListener = e,
// Fire with initial user.
t.enqueueRetryable((() => e(this.token.user)));
}
removeChangeListener() {
this.changeListener = null;
}
}
class Q {
constructor(t) {
/** Tracks the current User. */
this.currentUser = f.UNAUTHENTICATED,
/** Promise that allows blocking on the initialization of Firebase Auth. */
this.t = new j,
/**
* Counter used to detect if the token changed while a getToken request was
* outstanding.
*/
this.i = 0, this.forceRefresh = !1, this.auth = null, this.asyncQueue = null, this.o = () => {
this.i++, this.currentUser = this.u(), this.t.resolve(), this.changeListener && this.asyncQueue.enqueueRetryable((() => this.changeListener(this.currentUser)));
};
const e = t => {
m("FirebaseCredentialsProvider", "Auth detected"), this.auth = t, this.auth.addAuthTokenListener(this.o);
};
t.onInit((t => e(t))),
// Our users can initialize Auth right after Firestore, so we give it
// a chance to register itself with the component framework before we
// determine whether to start up in unauthenticated mode.
setTimeout((() => {
if (!this.auth) {
const n = t.getImmediate({
optional: !0
});
n ? e(n) : (
// If auth is still not available, proceed with `null` user
m("FirebaseCredentialsProvider", "Auth not yet detected"), this.t.resolve());
}
}), 0);
}
getToken() {
// Take note of the current value of the tokenCounter so that this method
// can fail (with an ABORTED error) if there is a token change while the
// request is outstanding.
const t = this.i, e = this.forceRefresh;
return this.forceRefresh = !1, this.auth ? this.auth.getToken(e).then((e =>
// Cancel the request since the token changed while the request was
// outstanding so the response is potentially for a previous user (which
// user, we can't be sure).
this.i !== t ? (m("FirebaseCredentialsProvider", "getToken aborted due to token change."),
this.getToken()) : e ? (b("string" == typeof e.accessToken), new k(e.accessToken, this.currentUser)) : null)) : Promise.resolve(null);
}
invalidateToken() {
this.forceRefresh = !0;
}
setChangeListener(t, e) {
this.asyncQueue = t,
// Blocks the AsyncQueue until the next user is available.
this.asyncQueue.enqueueRetryable((async () => {
await this.t.promise, await e(this.currentUser), this.changeListener = e;
}));
}
removeChangeListener() {
this.auth && this.auth.removeAuthTokenListener(this.o), this.changeListener = () => Promise.resolve();
}
// Auth.getUid() can return null even with a user logged in. It is because
// getUid() is synchronous, but the auth code populating Uid is asynchronous.
// This method should only be called in the AuthTokenListener callback
// to guarantee to get the actual user.
u() {
const t = this.auth && this.auth.getUid();
return b(null === t || "string" == typeof t), new f(t);
}
}
/*
* FirstPartyToken provides a fresh token each time its value
* is requested, because if the token is too old, requests will be rejected.
* Technically this may no longer be necessary since the SDK should gracefully
* recover from unauthenticated errors (see b/33147818 for context), but it's
* safer to keep the implementation as-is.
*/ class z {
constructor(t, e, n) {
this.h = t, this.l = e, this.m = n, this.type = "FirstParty", this.user = f.FIRST_PARTY;
}
get authHeaders() {
const t = {
"X-Goog-AuthUser": this.l
}, e = this.h.auth.getAuthHeaderValueForFirstParty([]);
// Use array notation to prevent minification
return e && (t.Authorization = e), this.m && (t["X-Goog-Iam-Authorization-Token"] = this.m),
t;
}
}
/*
* Provides user credentials required for the Firestore JavaScript SDK
* to authenticate the user, using technique that is only available
* to applications hosted by Google.
*/ class W {
constructor(t, e, n) {
this.h = t, this.l = e, this.m = n;
}
getToken() {
return Promise.resolve(new z(this.h, this.l, this.m));
}
setChangeListener(t, e) {
// Fire with initial uid.
t.enqueueRetryable((() => e(f.FIRST_PARTY)));
}
removeChangeListener() {}
invalidateToken() {}
}
/**
* Builds a CredentialsProvider depending on the type of
* the credentials passed in.
*/
/**
* @license
* Copyright 2017 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
class G {
/**
* Constructs a DatabaseInfo using the provided host, databaseId and
* persistenceKey.
*
* @param databaseId - The database to use.
* @param appId - The Firebase App Id.
* @param persistenceKey - A unique identifier for this Firestore's local
* storage (used in conjunction with the databaseId).
* @param host - The Firestore backend host to connect to.
* @param ssl - Whether to use SSL when connecting.
* @param forceLongPolling - Whether to use the forceLongPolling option
* when using WebChannel as the network transport.
* @param autoDetectLongPolling - Whether to use the detectBufferingProxy
* option when using WebChannel as the network transport.
* @param useFetchStreams Whether to use the Fetch API instead of
* XMLHTTPRequest
*/
constructor(t, e, n, r, s, i, o, u) {
this.databaseId = t, this.appId = e, this.persistenceKey = n, this.host = r, this.ssl = s,
this.forceLongPolling = i, this.autoDetectLongPolling = o, this.useFetchStreams = u;
}
}
/** The default database name for a project. */
/** Represents the database ID a Firestore client is associated with. */
class H {
constructor(t, e) {
this.projectId = t, this.database = e || "(default)";
}
get isDefaultDatabase() {
return "(default)" === this.database;
}
isEqual(t) {
return t instanceof H && t.projectId === this.projectId && t.database === this.database;
}
}
/**
* @license
* Copyright 2017 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/**
* Path represents an ordered sequence of string segments.
*/
class Y {
constructor(t, e, n) {
void 0 === e ? e = 0 : e > t.length && g(), void 0 === n ? n = t.length - e : n > t.length - e && g(),
this.segments = t, this.offset = e, this.len = n;
}
get length() {
return this.len;
}
isEqual(t) {
return 0 === Y.comparator(this, t);
}
child(t) {
const e = this.segments.slice(this.offset, this.limit());
return t instanceof Y ? t.forEach((t => {
e.push(t);
})) : e.push(t), this.construct(e);
}
/** The index of one past the last segment of the path. */ limit() {
return this.offset + this.length;
}
popFirst(t) {
return t = void 0 === t ? 1 : t, this.construct(this.segments, this.offset + t, this.length - t);
}
popLast() {
return this.construct(this.segments, this.offset, this.length - 1);
}
firstSegment() {
return this.segments[this.offset];
}
lastSegment() {
return this.get(this.length - 1);
}
get(t) {
return this.segments[this.offset + t];
}
isEmpty() {
return 0 === this.length;
}
isPrefixOf(t) {
if (t.length < this.length) return !1;
for (let e = 0; e < this.length; e++) if (this.get(e) !== t.get(e)) return !1;
return !0;
}
isImmediateParentOf(t) {
if (this.length + 1 !== t.length) return !1;
for (let e = 0; e < this.length; e++) if (this.get(e) !== t.get(e)) return !1;
return !0;
}
forEach(t) {
for (let e = this.offset, n = this.limit(); e < n; e++) t(this.segments[e]);
}
toArray() {
return this.segments.slice(this.offset, this.limit());
}
static comparator(t, e) {
const n = Math.min(t.length, e.length);
for (let r = 0; r < n; r++) {
const n = t.get(r), s = e.get(r);
if (n < s) return -1;
if (n > s) return 1;
}
return t.length < e.length ? -1 : t.length > e.length ? 1 : 0;
}
}
/**
* A slash-separated path for navigating resources (documents and collections)
* within Firestore.
*/ class K extends Y {
construct(t, e, n) {
return new K(t, e, n);
}
canonicalString() {
// NOTE: The client is ignorant of any path segments containing escape
// sequences (e.g. __id123__) and just passes them through raw (they exist
// for legacy reasons and should not be used frequently).
return this.toArray().join("/");
}
toString() {
return this.canonicalString();
}
/**
* Creates a resource path from the given slash-delimited string. If multiple
* arguments are provided, all components are combined. Leading and trailing
* slashes from all components are ignored.
*/ static fromString(...t) {
// NOTE: The client is ignorant of any path segments containing escape
// sequences (e.g. __id123__) and just passes them through raw (they exist
// for legacy reasons and should not be used frequently).
const e = [];
for (const n of t) {
if (n.indexOf("//") >= 0) throw new U(A, `Invalid segment (${n}). Paths must not contain // in them.`);
// Strip leading and traling slashed.
e.push(...n.split("/").filter((t => t.length > 0)));
}
return new K(e);
}
static emptyPath() {
return new K([]);
}
}
const J = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
/** A dot-separated path for navigating sub-objects within a document. */ class Z extends Y {
construct(t, e, n) {
return new Z(t, e, n);
}
/**
* Returns true if the string could be used as a segment in a field path
* without escaping.
*/ static isValidIdentifier(t) {
return J.test(t);
}
canonicalString() {
return this.toArray().map((t => (t = t.replace(/\\/g, "\\\\").replace(/`/g, "\\`"),
Z.isValidIdentifier(t) || (t = "`" + t + "`"), t))).join(".");
}
toString() {
return this.canonicalString();
}
/**
* Returns true if this field references the key of a document.
*/ isKeyField() {
return 1 === this.length && "__name__" === this.get(0);
}
/**
* The field designating the key of a document.
*/ static keyField() {
return new Z([ "__name__" ]);
}
/**
* Parses a field string from the given server-formatted string.
*
* - Splitting the empty string is not allowed (for now at least).
* - Empty segments within the string (e.g. if there are two consecutive
* separators) are not allowed.
*
* TODO(b/37244157): we should make this more strict. Right now, it allows
* non-identifier path components, even if they aren't escaped.
*/ static fromServerFormat(t) {
const e = [];
let n = "", r = 0;
const s = () => {
if (0 === n.length) throw new U(A, `Invalid field path (${t}). Paths must not be empty, begin with '.', end with '.', or contain '..'`);
e.push(n), n = "";
};
let i = !1;
for (;r < t.length; ) {
const e = t[r];
if ("\\" === e) {
if (r + 1 === t.length) throw new U(A, "Path has trailing escape character: " + t);
const e = t[r + 1];
if ("\\" !== e && "." !== e && "`" !== e) throw new U(A, "Path has invalid escape sequence: " + t);
n += e, r += 2;
} else "`" === e ? (i = !i, r++) : "." !== e || i ? (n += e, r++) : (s(), r++);
}
if (s(), i) throw new U(A, "Unterminated ` in path: " + t);
return new Z(e);
}
static emptyPath() {
return new Z([]);
}
}
/**
* @license
* Copyright 2017 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/ class X {
constructor(t) {
this.path = t;
}
static fromPath(t) {
return new X(K.fromString(t));
}
static fromName(t) {
return new X(K.fromString(t).popFirst(5));
}
/** Returns true if the document is in the specified collectionId. */ hasCollectionId(t) {
return this.path.length >= 2 && this.path.get(this.path.length - 2) === t;
}
isEqual(t) {
return null !== t && 0 === K.comparator(this.path, t.path);
}
toString() {
return this.path.toString();
}
static comparator(t, e) {
return K.comparator(t.path, e.path);
}
static isDocumentKey(t) {
return t.length % 2 == 0;
}
/**
* Creates and returns a new document key with the given segments.
*
* @param segments - The segments of the path to the document
* @returns A new instance of DocumentKey
*/ static fromSegments(t) {
return new X(new K(t.slice()));
}
}
/**
* @license
* Copyright 2017 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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, e, n) {
if (!n) throw new U(A, `Function ${t}() cannot be called with an empty ${e}.`);
}
/**
* Validates that two boolean options are not set at the same time.
*/
/**
* Validates that `path` refers to a document (indicated by the fact it contains
* an even numbers of segments).
*/
function et(t) {
if (!X.isDocumentKey(t)) throw new U(A, `Invalid document reference. Document references must have an even number of segments, but ${t} has ${t.length}.`);
}
/**
* Validates that `path` refers to a collection (indicated by the fact it
* contains an odd numbers of segments).
*/ function nt(t) {
if (X.isDocumentKey(t)) throw new U(A, `Invalid collection reference. Collection references must have an odd number of segments, but ${t} has ${t.length}.`);
}
/**
* Returns true if it's a non-null object without a custom prototype
* (i.e. excludes Array, Date, etc.).
*/
/** Returns a string describing the type / value of the provided input. */
function rt(t) {
if (void 0 === t) return "undefined";
if (null === t) return "null";
if ("string" == typeof t) return t.length > 20 && (t = `${t.substring(0, 20)}...`),
JSON.stringify(t);
if ("number" == typeof t || "boolean" == typeof t) return "" + t;
if ("object" == typeof t) {
if (t instanceof Array) return "an array";
{
const e =
/** Hacky method to try to get the constructor name for an object. */
function(t) {
if (t.constructor) {
const e = /function\s+([^\s(]+)\s*\(/.exec(t.constructor.toString());
if (e && e.length > 1) return e[1];
}
return null;
}
/**
* Casts `obj` to `T`, optionally unwrapping Compat types to expose the
* underlying instance. Throws if `obj` is not an instance of `T`.
*
* This cast is used in the Lite and Full SDK to verify instance types for
* arguments passed to the public API.
*/ (t);
return e ? `a custom ${e} object` : "an object";
}
}
return "function" == typeof t ? "a function" : g();
}
function st(t,
// eslint-disable-next-line @typescript-eslint/no-explicit-any
e) {
if ("_delegate" in t && (
// Unwrap Compat types
// eslint-disable-next-line @typescript-eslint/no-explicit-any
t = t._delegate), !(t instanceof e)) {
if (e.name === t.constructor.name) throw new U(A, "Type does not match the expected instance. Did you pass a reference from a different Firestore SDK?");
{
const n = rt(t);
throw new U(A, `Expected type '${e.name}', but it was: ${n}`);
}
}
return t;
}
function it(t, e) {
if (e <= 0) throw new U(A, `Function ${t}() requires a positive number, but it was: ${e}.`);
}
/**
* @license
* Copyright 2017 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/**
* Returns whether a variable is either undefined or null.
*/ function ot(t) {
return null == t;
}
/** Returns whether the value represents -0. */ function ut(t) {
// Detect if the value is -0.0. Based on polyfill from
// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/is
return 0 === t && 1 / t == -1 / 0;
}
/**
* Returns whether a value is an integer and in the safe integer range
* @param value - The value to test for being an integer and in the safe range
*/
/**
* @license
* Copyright 2020 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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 ct = {
BatchGetDocuments: "batchGet",
Commit: "commit",
RunQuery: "runQuery"
};
/**
* Maps RPC names to the corresponding REST endpoint name.
*
* We use array notation to avoid mangling.
*/
/**
* @license
* Copyright 2017 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/**
* Error Codes describing the different ways GRPC can fail. These are copied
* directly from GRPC's sources here:
*
* https://github.com/grpc/grpc/blob/bceec94ea4fc5f0085d81235d8e1c06798dc341a/include/grpc%2B%2B/impl/codegen/status_code_enum.h
*
* Important! The names of these identifiers matter because the string forms
* are used for reverse lookups from the webchannel stream. Do NOT change the
* names of these identifiers or change this into a const enum.
*/
var at, ht;
/**
* Converts an HTTP Status Code to the equivalent error code.
*
* @param status - An HTTP Status Code, like 200, 404, 503, etc.
* @returns The equivalent Code. Unknown status codes are mapped to
* Code.UNKNOWN.
*/
function lt(t) {
if (void 0 === t) return p("RPC_ERROR", "HTTP error has no status"), I;
// The canonical error codes for Google APIs [1] specify mapping onto HTTP
// status codes but the mapping is not bijective. In each case of ambiguity
// this function chooses a primary error.
// [1]
// https://github.com/googleapis/googleapis/blob/master/google/rpc/code.proto
switch (t) {
case 200:
// OK
return E;
case 400:
// Bad Request
return F;
// Other possibilities based on the forward mapping
// return Code.INVALID_ARGUMENT;
// return Code.OUT_OF_RANGE;
case 401:
// Unauthorized
return D;
case 403:
// Forbidden
return N;
case 404:
// Not Found
return R;
case 409:
// Conflict
return S;
// Other possibilities:
// return Code.ALREADY_EXISTS;
case 416:
// Range Not Satisfiable
return q;
case 429:
// Too Many Requests
return $;
case 499:
// Client Closed Request
return T;
case 500:
// Internal Server Error
return I;
// Other possibilities:
// return Code.INTERNAL;
// return Code.DATA_LOSS;
case 501:
// Unimplemented
return x;
case 503:
// Service Unavailable
return C;
case 504:
// Gateway Timeout
return P;
default:
return t >= 200 && t < 300 ? E : t >= 400 && t < 500 ? F : t >= 500 && t < 600 ? O : I;
}
}
/**
* @license
* Copyright 2020 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/**
* A Rest-based connection that relies on the native HTTP stack
* (e.g. `fetch` or a polyfill).
*/ (ht = at || (at = {}))[ht.OK = 0] = "OK", ht[ht.CANCELLED = 1] = "CANCELLED",
ht[ht.UNKNOWN = 2] = "UNKNOWN", ht[ht.INVALID_ARGUMENT = 3] = "INVALID_ARGUMENT",
ht[ht.DEADLINE_EXCEEDED = 4] = "DEADLINE_EXCEEDED", ht[ht.NOT_FOUND = 5] = "NOT_FOUND",
ht[ht.ALREADY_EXISTS = 6] = "ALREADY_EXISTS", ht[ht.PERMISSION_DENIED = 7] = "PERMISSION_DENIED",
ht[ht.UNAUTHENTICATED = 16] = "UNAUTHENTICATED", ht[ht.RESOURCE_EXHAUSTED = 8] = "RESOURCE_EXHAUSTED",
ht[ht.FAILED_PRECONDITION = 9] = "FAILED_PRECONDITION", ht[ht.ABORTED = 10] = "ABORTED",
ht[ht.OUT_OF_RANGE = 11] = "OUT_OF_RANGE", ht[ht.UNIMPLEMENTED = 12] = "UNIMPLEMENTED",
ht[ht.INTERNAL = 13] = "INTERNAL", ht[ht.UNAVAILABLE = 14] = "UNAVAILABLE", ht[ht.DATA_LOSS = 15] = "DATA_LOSS";
class ft extends
/**
* Base class for all Rest-based connections to the backend (WebChannel and
* HTTP).
*/
class {
constructor(t) {
this.databaseInfo = t, this.databaseId = t.databaseId;
const e = t.ssl ? "https" : "http";
this.p = e + "://" + t.host, this.g = "projects/" + this.databaseId.projectId + "/databases/" + this.databaseId.database + "/documents";
}
v(t, e, n, r) {
const s = this.T(t, e);
m("RestConnection", "Sending: ", s, n);
const i = {};
return this.I(i, r), this.A(t, s, i, n).then((t => (m("RestConnection", "Received: ", t),
t)), (e => {
throw y("RestConnection", `${t} failed with error: `, e, "url: ", s, "request:", n),
e;
}));
}
P(t, e, n, r) {
// The REST API automatically aggregates all of the streamed results, so we
// can just use the normal invoke() method.
return this.v(t, e, n, r);
}
/**
* Modifies the headers for a request, adding any authorization token if
* present and any additional headers for the request.
*/ I(t, e) {
if (t["X-Goog-Api-Client"] = "gl-js/ fire/" + l,
// Content-Type: text/plain will avoid preflight requests which might
// mess with CORS and redirects by proxies. If we add custom headers
// we will need to change this code to potentially use the $httpOverwrite
// parameter supported by ESF to avoid triggering preflight requests.
t["Content-Type"] = "text/plain", this.databaseInfo.appId && (t["X-Firebase-GMPID"] = this.databaseInfo.appId),
e) for (const n in e.authHeaders) e.authHeaders.hasOwnProperty(n) && (t[n] = e.authHeaders[n]);
}
T(t, e) {
const n = ct[t];
return `${this.p}/v1/${e}:${n}`;
}
} {
/**
* @param databaseInfo - The connection info.
* @param fetchImpl - `fetch` or a Polyfill that implements the fetch API.
*/
constructor(t, e) {
super(t), this.R = e;
}
V(t, e) {
throw new Error("Not supported by FetchConnection");
}
async A(t, e, n, r) {
const s = JSON.stringify(r);
let i;
try {
i = await this.R(e, {
method: "POST",
headers: n,
body: s
});
} catch (t) {
throw new U(lt(t.status), "Request failed with error: " + t.statusText);
}
if (!i.ok) throw new U(lt(i.status), "Request failed with error: " + i.statusText);
return i.json();
}
}
/**
* @license
* Copyright 2020 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/** Initializes the HTTP connection for the REST API. */
/**
* @license
* Copyright 2020 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/**
* Generates `nBytes` of random bytes.
*
* If `nBytes < 0` , an error will be thrown.
*/
function dt(t) {
// Polyfills for IE and WebWorker by using `self` and `msCrypto` when `crypto` is not available.
const e =
// eslint-disable-next-line @typescript-eslint/no-explicit-any
"undefined" != typeof self && (self.crypto || self.msCrypto), n = new Uint8Array(t);
if (e && "function" == typeof e.getRandomValues) e.getRandomValues(n); else
// Falls back to Math.random
for (let e = 0; e < t; e++) n[e] = Math.floor(256 * Math.random());
return n;
}
/**
* @license
* Copyright 2017 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/ class wt {
static N() {
// Alphanumeric characters
const t = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789", e = Math.floor(256 / t.length) * t.length;
// The largest byte value that is a multiple of `char.length`.
let n = "";
for (;n.length < 20; ) {
const r = dt(40);
for (let s = 0; s < r.length; ++s)
// Only accept values that are [0, maxMultiple), this ensures they can
// be evenly mapped to indices of `chars` via a modulo operation.
n.length < 20 && r[s] < e && (n += t.charAt(r[s] % t.length));
}
return n;
}
}
function mt(t, e) {
return t < e ? -1 : t > e ? 1 : 0;
}
/** Helper to compare arrays using isEqual(). */ function pt(t, e, n) {
return t.length === e.length && t.every(((t, r) => n(t, e[r])));
}
/**
* @license
* Copyright 2017 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
// The earliest date supported by Firestore timestamps (0001-01-01T00:00:00Z).
/**
* A `Timestamp` represents a point in time independent of any time zone or
* calendar, represented as seconds and fractions of seconds at nanosecond
* resolution in UTC Epoch time.
*
* It is encoded using the Proleptic Gregorian Calendar which extends the
* Gregorian calendar backwards to year one. It is encoded assuming all minutes
* are 60 seconds long, i.e. leap seconds are "smeared" so that no leap second
* table is needed for interpretation. Range is from 0001-01-01T00:00:00Z to
* 9999-12-31T23:59:59.999999999Z.
*
* For examples and further specifications, refer to the
* {@link https://github.com/google/protobuf/blob/master/src/google/protobuf/timestamp.proto | Timestamp definition}.
*/
class yt {
/**
* Creates a new timestamp.
*
* @param seconds - The number of seconds of UTC time since Unix epoch
* 1970-01-01T00:00:00Z. Must be from 0001-01-01T00:00:00Z to
* 9999-12-31T23:59:59Z inclusive.
* @param nanoseconds - The non-negative fractions of a second at nanosecond
* resolution. Negative second values with fractions must still have
* non-negative nanoseconds values that count forward in time. Must be
* from 0 to 999,999,999 inclusive.
*/
constructor(
/**
* The number of seconds of UTC time since Unix epoch 1970-01-01T00:00:00Z.
*/
t,
/**
* The fractions of a second at nanosecond resolution.*
*/
e) {
if (this.seconds = t, this.nanoseconds = e, e < 0) throw new U(A, "Timestamp nanoseconds out of range: " + e);
if (e >= 1e9) throw new U(A, "Timestamp nanoseconds out of range: " + e);
if (t < -62135596800) throw new U(A, "Timestamp seconds out of range: " + t);
// This will break in the year 10,000.
if (t >= 253402300800) throw new U(A, "Timestamp seconds out of range: " + t);
}
/**
* Creates a new timestamp with the current date, with millisecond precision.
*
* @returns a new timestamp representing the current date.
*/ static now() {
return yt.fromMillis(Date.now());
}
/**
* Creates a new timestamp from the given date.
*
* @param date - The date to initialize the `Timestamp` from.
* @returns A new `Timestamp` representing the same point in time as the given
* date.
*/ static fromDate(t) {
return yt.fromMillis(t.getTime());
}
/**
* Creates a new timestamp from the given number of milliseconds.
*
* @param milliseconds - Number of milliseconds since Unix epoch
* 1970-01-01T00:00:00Z.
* @returns A new `Timestamp` representing the same point in time as the given
* number of milliseconds.
*/ static fromMillis(t) {
const e = Math.floor(t / 1e3), n = Math.floor(1e6 * (t - 1e3 * e));
return new yt(e, n);
}
/**
* Converts a `Timestamp` to a JavaScript `Date` object. This conversion
* causes a loss of precision since `Date` objects only support millisecond
* precision.
*
* @returns JavaScript `Date` object representing the same point in time as
* this `Timestamp`, with millisecond precision.
*/ toDate() {
return new Date(this.toMillis());
}
/**
* Converts a `Timestamp` to a numeric timestamp (in milliseconds since
* epoch). This operation causes a loss of precision.
*
* @returns The point in time corresponding to this timestamp, represented as
* the number of milliseconds since Unix epoch 1970-01-01T00:00:00Z.
*/ toMillis() {
return 1e3 * this.seconds + this.nanoseconds / 1e6;
}
_compareTo(t) {
return this.seconds === t.seconds ? mt(this.nanoseconds, t.nanoseconds) : mt(this.seconds, t.seconds);
}
/**
* Returns true if this `Timestamp` is equal to the provided one.
*
* @param other - The `Timestamp` to compare against.
* @returns true if this `Timestamp` is equal to the provided one.
*/ isEqual(t) {
return t.seconds === this.seconds && t.nanoseconds === this.nanoseconds;
}
/** Returns a textual representation of this Timestamp. */ toString() {
return "Timestamp(seconds=" + this.seconds + ", nanoseconds=" + this.nanoseconds + ")";
}
/** Returns a JSON-serializable representation of this Timestamp. */ toJSON() {
return {
seconds: this.seconds,
nanoseconds: this.nanoseconds
};
}
/**
* Converts this object to a primitive string, which allows Timestamp objects
* to be compared using the `>`, `<=`, `>=` and `>` operators.
*/ valueOf() {
// This method returns a string of the form <seconds>.<nanoseconds> where
// <seconds> is translated to have a non-negative value and both <seconds>
// and <nanoseconds> are left-padded with zeroes to be a consistent length.
// Strings with this format then have a lexiographical ordering that matches
// the expected ordering. The <seconds> translation is done to avoid having
// a leading negative sign (i.e. a leading '-' character) in its string
// representation, which would affect its lexiographical ordering.
const t = this.seconds - -62135596800;
// Note: Up to 12 decimal digits are required to represent all valid
// 'seconds' values.
return String(t).padStart(12, "0") + "." + String(this.nanoseconds).padStart(9, "0");
}
}
/**
* @license
* Copyright 2017 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/**
* A version of a document in Firestore. This corresponds to the version
* timestamp, such as update_time or read_time.
*/ class _t {
constructor(t) {
this.timestamp = t;
}
static fromTimestamp(t) {
return new _t(t);
}
static min() {
return new _t(new yt(0, 0));
}
compareTo(t) {
return this.timestamp._compareTo(t.timestamp);
}
isEqual(t) {
return this.timestamp.isEqual(t.timestamp);
}
/** Returns a number representation of the version for use in spec tests. */ toMicroseconds() {
// Convert to microseconds.
return 1e6 * this.timestamp.seconds + this.timestamp.nanoseconds / 1e3;
}
toString() {
return "SnapshotVersion(" + this.timestamp.toString() + ")";
}
toTimestamp() {
return this.timestamp;
}
}
/**
* @license
* Copyright 2017 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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 gt(t) {
let e = 0;
for (const n in t) Object.prototype.hasOwnProperty.call(t, n) && e++;
return e;
}
function bt(t, e) {
for (const n in t) Object.prototype.hasOwnProperty.call(t, n) && e(n, t[n]);
}
/**
* @license
* Copyright 2020 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/**
* Provides a set of fields that can be used to partially patch a document.
* FieldMask is used in conjunction with ObjectValue.
* Examples:
* foo - Overwrites foo entirely with the provided value. If foo is not
* present in the companion ObjectValue, the field is deleted.
* foo.bar - Overwrites only the field bar of the object foo.
* If foo is not an object, foo is replaced with an object
* containing foo
*/
class vt {
constructor(t) {
this.fields = t,
// TODO(dimond): validation of FieldMask
// Sort the field mask to support `FieldMask.isEqual()` and assert below.
t.sort(Z.comparator);
}
/**
* Verifies that `fieldPath` is included by at least one field in this field
* mask.
*
* This is an O(n) operation, where `n` is the size of the field mask.
*/ covers(t) {
for (const e of this.fields) if (e.isPrefixOf(t)) return !0;
return !1;
}
isEqual(t) {
return pt(this.fields, t.fields, ((t, e) => t.isEqual(e)));
}
}
/**
* @license
* Copyright 2020 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/** Converts a Base64 encoded string to a binary string. */
/**
* @license
* Copyright 2020 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/**
* Immutable class that represents a "proto" byte string.
*
* Proto byte strings can either be Base64-encoded strings or Uint8Arrays when
* sent on the wire. This class abstracts away this differentiation by holding
* the proto byte string in a common class that must be converted into a string
* before being sent as a proto.
*/
class Et {
constructor(t) {
this.binaryString = t;
}
static fromBase64String(t) {
const e = atob(t);
return new Et(e);
}
static fromUint8Array(t) {
const e =
/**
* Helper function to convert an Uint8array to a binary string.
*/
function(t) {
let e = "";
for (let n = 0; n < t.length; ++n) e += String.fromCharCode(t[n]);
return e;
}
/**
* Helper function to convert a binary string to an Uint8Array.
*/ (t);
return new Et(e);
}
toBase64() {
return t = this.binaryString, btoa(t);
/** Converts a binary string to a Base64 encoded string. */
var t;
}
toUint8Array() {
return function(t) {
const e = new Uint8Array(t.length);
for (let n = 0; n < t.length; n++) e[n] = t.charCodeAt(n);
return e;
}
/**
* @license
* Copyright 2020 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
// A RegExp matching ISO 8601 UTC timestamps with optional fraction.
(this.binaryString);
}
approximateByteSize() {
return 2 * this.binaryString.length;
}
compareTo(t) {
return mt(this.binaryString, t.binaryString);
}
isEqual(t) {
return this.binaryString === t.binaryString;
}
}
Et.EMPTY_BYTE_STRING = new Et("");
const Tt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
/**
* Converts the possible Proto values for a timestamp value into a "seconds and
* nanos" representation.
*/ function It(t) {
// The json interface (for the browser) will return an iso timestamp string,
// while the proto js library (for node) will return a
// google.protobuf.Timestamp instance.
if (b(!!t), "string" == typeof t) {
// The date string can have higher precision (nanos) than the Date class
// (millis), so we do some custom parsing here.
// Parse the nanos right out of the string.
let e = 0;
const n = Tt.exec(t);
if (b(!!n), n[1]) {
// Pad the fraction out to 9 digits (nanos).
let t = n[1];
t = (t + "000000000").substr(0, 9), e = Number(t);
}
// Parse the date to get the seconds.
const r = new Date(t);
return {
seconds: Math.floor(r.getTime() / 1e3),
nanos: e
};
}
return {
seconds: At(t.seconds),
nanos: At(t.nanos)
};
}
/**
* Converts the possible Proto types for numbers into a JavaScript number.
* Returns 0 if the value is not numeric.
*/ function At(t) {
// TODO(bjornick): Handle int64 greater than 53 bits.
return "number" == typeof t ? t : "string" == typeof t ? Number(t) : 0;
}
/** Converts the possible Proto types for Blobs into a ByteString. */ function Pt(t) {
return "string" == typeof t ? Et.fromBase64String(t) : Et.fromUint8Array(t);
}
/**
* @license
* Copyright 2020 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/**
* Represents a locally-applied ServerTimestamp.
*
* Server Timestamps are backed by MapValues that contain an internal field
* `__type__` with a value of `server_timestamp`. The previous value and local
* write time are stored in its `__previous_value__` and `__local_write_time__`
* fields respectively.
*
* Notes:
* - ServerTimestampValue instances are created as the result of applying a
* transform. They can only exist in the local view of a document. Therefore
* they do not need to be parsed or serialized.
* - When evaluated locally (e.g. for snapshot.data()), they by default
* evaluate to `null`. This behavior can be configured by passing custom
* FieldValueOptions to value().
* - With respect to other ServerTimestampValues, they sort by their
* localWriteTime.
*/ function Rt(t) {
var e, n;
return "server_timestamp" === (null === (n = ((null === (e = null == t ? void 0 : t.mapValue) || void 0 === e ? void 0 : e.fields) || {}).__type__) || void 0 === n ? void 0 : n.stringValue);
}
/**
* Returns the value of the field before this ServerTimestamp was set.
*
* Preserving the previous values allows the user to display the last resoled
* value until the backend responds with the timestamp.
*/ function Vt(t) {
const e = t.mapValue.fields.__previous_value__;
return Rt(e) ? Vt(e) : e;
}
/**
* Returns the local time at which this timestamp was first set.
*/ function Nt(t) {
const e = It(t.mapValue.fields.__local_write_time__.timestampValue);
return new yt(e.seconds, e.nanos);
}
/**
* @license
* Copyright 2020 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/** Extracts the backend's type order for the provided value. */ function Dt(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 ? Rt(t) ? 4 /* ServerTimestampValue */ : 10 /* ObjectValue */ : g();
}
/** Tests `left` and `right` for equality based on the backend semantics. */ function $t(t, e) {
const n = Dt(t);
if (n !== Dt(e)) return !1;
switch (n) {
case 0 /* NullValue */ :
return !0;
case 1 /* BooleanValue */ :
return t.booleanValue === e.booleanValue;
case 4 /* ServerTimestampValue */ :
return Nt(t).isEqual(Nt(e));
case 3 /* TimestampValue */ :
return function(t, e) {
if ("string" == typeof t.timestampValue && "string" == typeof e.timestampValue && t.timestampValue.length === e.timestampValue.length)
// Use string equality for ISO 8601 timestamps
return t.timestampValue === e.timestampValue;
const n = It(t.timestampValue), r = It(e.timestampValue);
return n.seconds === r.seconds && n.nanos === r.nanos;
}(t, e);
case 5 /* StringValue */ :
return t.stringValue === e.stringValue;
case 6 /* BlobValue */ :
return function(t, e) {
return Pt(t.bytesValue).isEqual(Pt(e.bytesValue));
}(t, e);
case 7 /* RefValue */ :
return t.referenceValue === e.referenceValue;
case 8 /* GeoPointValue */ :
return function(t, e) {
return At(t.geoPointValue.latitude) === At(e.geoPointValue.latitude) && At(t.geoPointValue.longitude) === At(e.geoPointValue.longitude);
}(t, e);
case 2 /* NumberValue */ :
return function(t, e) {
if ("integerValue" in t && "integerValue" in e) return At(t.integerValue) === At(e.integerValue);
if ("doubleValue" in t && "doubleValue" in e) {
const n = At(t.doubleValue), r = At(e.doubleValue);
return n === r ? ut(n) === ut(r) : isNaN(n) && isNaN(r);
}
return !1;
}(t, e);
case 9 /* ArrayValue */ :
return pt(t.arrayValue.values || [], e.arrayValue.values || [], $t);
case 10 /* ObjectValue */ :
return function(t, e) {
const n = t.mapValue.fields || {}, r = e.mapValue.fields || {};
if (gt(n) !== gt(r)) return !1;
for (const t in n) if (n.hasOwnProperty(t) && (void 0 === r[t] || !$t(n[t], r[t]))) return !1;
return !0;
}
/** Returns true if the ArrayValue contains the specified element. */ (t, e);
default:
return g();
}
}
function Ft(t, e) {
return void 0 !== (t.values || []).find((t => $t(t, e)));
}
function St(t, e) {
const n = Dt(t), r = Dt(e);
if (n !== r) return mt(n, r);
switch (n) {
case 0 /* NullValue */ :
return 0;
case 1 /* BooleanValue */ :
return mt(t.booleanValue, e.booleanValue);
case 2 /* NumberValue */ :
return function(t, e) {
const n = At(t.integerValue || t.doubleValue), r = At(e.integerValue || e.doubleValue);
return n < r ? -1 : n > r ? 1 : n === r ? 0 :
// one or both are NaN.
isNaN(n) ? isNaN(r) ? 0 : -1 : 1;
}(t, e);
case 3 /* TimestampValue */ :
return qt(t.timestampValue, e.timestampValue);
case 4 /* ServerTimestampValue */ :
return qt(Nt(t), Nt(e));
case 5 /* StringValue */ :
return mt(t.stringValue, e.stringValue);
case 6 /* BlobValue */ :
return function(t, e) {
const n = Pt(t), r = Pt(e);
return n.compareTo(r);
}(t.bytesValue, e.bytesValue);
case 7 /* RefValue */ :
return function(t, e) {
const n = t.split("/"), r = e.split("/");
for (let t = 0; t < n.length && t < r.length; t++) {
const e = mt(n[t], r[t]);
if (0 !== e) return e;
}
return mt(n.length, r.length);
}(t.referenceValue, e.referenceValue);
case 8 /* GeoPointValue */ :
return function(t, e) {
const n = mt(At(t.latitude), At(e.latitude));
if (0 !== n) return n;
return mt(At(t.longitude), At(e.longitude));
}(t.geoPointValue, e.geoPointValue);
case 9 /* ArrayValue */ :
return function(t, e) {
const n = t.values || [], r = e.values || [];
for (let t = 0; t < n.length && t < r.length; ++t) {
const e = St(n[t], r[t]);
if (e) return e;
}
return mt(n.length, r.length);
}(t.arrayValue, e.arrayValue);
case 10 /* ObjectValue */ :
return function(t, e) {
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
// elements out of order. We need to re-sort the elements to ensure that
// canonical IDs are independent of insertion order.
r.sort(), i.sort();
for (let t = 0; t < r.length && t < i.length; ++t) {
const e = mt(r[t], i[t]);
if (0 !== e) return e;
const o = St(n[r[t]], s[i[t]]);
if (0 !== o) return o;
}
return mt(r.length, i.length);
}
/** Returns a reference value for the provided database and key. */ (t.mapValue, e.mapValue);
default:
throw g();
}
}
function qt(t, e) {
if ("string" == typeof t && "string" == typeof e && t.length === e.length) return mt(t, e);
const n = It(t), r = It(e), s = mt(n.seconds, r.seconds);
return 0 !== s ? s : mt(n.nanos, r.nanos);
}
function xt(t, e) {
return {
referenceValue: `projects/${t.projectId}/databases/${t.database}/documents/${e.path.canonicalString()}`
};
}
/** Returns true if `value` is an ArrayValue. */ function Ot(t) {
return !!t && "arrayValue" in t;
}
/** Returns true if `value` is a NullValue. */ function Ct(t) {
return !!t && "nullValue" in t;
}
/** Returns true if `value` is NaN. */ function Lt(t) {
return !!t && "doubleValue" in t && isNaN(Number(t.doubleValue));
}
/** Returns true if `value` is a MapValue. */ function Ut(t) {
return !!t && "mapValue" in t;
}
/** Creates a deep copy of `source`. */ function jt(t) {
if (t.geoPointValue) return {
geoPointValue: Object.assign({}, t.geoPointValue)
};
if (t.timestampValue && "object" == typeof t.timestampValue) return {
timestampValue: Object.assign({}, t.timestampValue)
};
if (t.mapValue) {
const e = {
mapValue: {
fields: {}
}
};
return bt(t.mapValue.fields, ((t, n) => e.mapValue.fields[t] = jt(n))), e;
}
if (t.arrayValue) {
const e = {
arrayValue: {
values: []
}
};
for (let n = 0; n < (t.arrayValue.values || []).length; ++n) e.arrayValue.values[n] = jt(t.arrayValue.values[n]);
return e;
}
return Object.assign({}, t);
}
/**
* @license
* Copyright 2017 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/**
* An ObjectValue represents a MapValue in the Firestore Proto and offers the
* ability to add and remove fields (via the ObjectValueBuilder).
*/ class kt {
constructor(t) {
this.value = t;
}
static empty() {
return new kt({
mapValue: {}
});
}
/**
* Returns the value at the given path or null.
*
* @param path - the path to search
* @returns The value at the path or null if the path is not set.
*/ field(t) {
if (t.isEmpty()) return this.value;
{
let e = this.value;
for (let n = 0; n < t.length - 1; ++n) if (e = (e.mapValue.fields || {})[t.get(n)],
!Ut(e)) return null;
return e = (e.mapValue.fields || {})[t.lastSegment()], e || null;
}
}
/**
* Sets the field to the provided value.
*
* @param path - The field path to set.
* @param value - The value to set.
*/ set(t, e) {
this.getFieldsMap(t.popLast())[t.lastSegment()] = jt(e);
}
/**
* Sets the provided fields to the provided values.
*
* @param data - A map of fields to values (or null for deletes).
*/ setAll(t) {
let e = Z.emptyPath(), n = {}, r = [];
t.forEach(((t, s) => {
if (!e.isImmediateParentOf(s)) {
// Insert the accumulated changes at this parent location
const t = this.getFieldsMap(e);
this.applyChanges(t, n, r), n = {}, r = [], e = s.popLast();
}
t ? n[s.lastSegment()] = jt(t) : r.push(s.lastSegment());
}));
const s = this.getFieldsMap(e);
this.applyChanges(s, n, r);
}
/**
* Removes the field at the specified path. If there is no field at the
* specified path, nothing is changed.
*
* @param path - The field path to remove.
*/ delete(t) {
const e = this.field(t.popLast());
Ut(e) && e.mapValue.fields && delete e.mapValue.fields[t.lastSegment()];
}
isEqual(t) {
return $t(this.value, t.value);
}
/**
* Returns the map that contains the leaf element of `path`. If the parent
* entry does not yet exist, or if it is not a map, a new map will be created.
*/ getFieldsMap(t) {
let e = this.value;
e.mapValue.fields || (e.mapValue = {
fields: {}
});
for (let n = 0; n < t.length; ++n) {
let r = e.mapValue.fields[t.get(n)];
Ut(r) && r.mapValue.fields || (r = {
mapValue: {
fields: {}
}
}, e.mapValue.fields[t.get(n)] = r), e = r;
}
return e.mapValue.fields;
}
/**
* Modifies `fieldsMap` by adding, replacing or deleting the specified
* entries.
*/ applyChanges(t, e, n) {
bt(e, ((e, n) => t[e] = n));
for (const e of n) delete t[e];
}
clone() {
return new kt(jt(this.value));
}
}
/**
* @license
* Copyright 2017 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/**
* Represents a document in Firestore with a key, version, data and whether it
* has local mutations applied to it.
*
* Documents can transition between states via `convertToFoundDocument()`,
* `convertToNoDocument()` and `convertToUnknownDocument()`. If a document does
* 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 Mt {
constructor(t, e, n, r, s) {
this.key = t, this.documentType = e, this.version = n, this.data = r, this.documentState = s;
}
/**
* Creates a document with no known version or data, but which can serve as
* base document for mutations.
*/ static newInvalidDocument(t) {
return new Mt(t, 0 /* INVALID */ , _t.min(), kt.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 Mt(t, 1 /* FOUND_DOCUMENT */ , e, n, 0 /* SYNCED */);
}
/** Creates a new document that is known to not exist at the given version. */ static newNoDocument(t, e) {
return new Mt(t, 2 /* NO_DOCUMENT */ , e, kt.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 Mt(t, 3 /* UNKNOWN_DOCUMENT */ , e, kt.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
}
/**
* Changes the document type to indicate that it exists and that its version
* and data are known.
*/ convertToFoundDocument(t, e) {
return this.version = t, this.documentType = 1 /* FOUND_DOCUMENT */ , this.data = e,
this.documentState = 0 /* SYNCED */ , this;
}
/**
* 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 = kt.empty(),
this.documentState = 0 /* SYNCED */ , this;
}
/**
* Changes the document type to indicate that it exists at a given version but
* 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 = kt.empty(),
this.documentState = 2 /* HAS_COMMITTED_MUTATIONS */ , this;
}
setHasCommittedMutations() {
return this.documentState = 2 /* HAS_COMMITTED_MUTATIONS */ , this;
}
setHasLocalMutations() {
return this.documentState = 1 /* HAS_LOCAL_MUTATIONS */ , this;
}
get hasLocalMutations() {
return 1 /* HAS_LOCAL_MUTATIONS */ === this.documentState;
}
get hasCommittedMutations() {
return 2 /* HAS_COMMITTED_MUTATIONS */ === this.documentState;
}
get hasPendingWrites() {
return this.hasLocalMutations || this.hasCommittedMutations;
}
isValidDocument() {
return 0 /* INVALID */ !== this.documentType;
}
isFoundDocument() {
return 1 /* FOUND_DOCUMENT */ === this.documentType;
}
isNoDocument() {
return 2 /* NO_DOCUMENT */ === this.documentType;
}
isUnknownDocument() {
return 3 /* UNKNOWN_DOCUMENT */ === this.documentType;
}
isEqual(t) {
return t instanceof Mt && this.key.isEqual(t.key) && this.version.isEqual(t.version) && this.documentType === t.documentType && this.documentState === t.documentState && this.data.isEqual(t.data);
}
clone() {
return new Mt(this.key, this.documentType, this.version, this.data.clone(), this.documentState);
}
toString() {
return `Document(${this.key}, ${this.version}, ${JSON.stringify(this.data.value)}, {documentType: ${this.documentType}}), {documentState: ${this.documentState}})`;
}
}
/**
* @license
* Copyright 2019 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
// Visible for testing
class Bt {
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.D = null;
}
}
/**
* Initializes a Target with a path and optional additional query constraints.
* Path must currently be empty if this is a collection group query.
*
* 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 Bt(t, e, n, r, s, i, o);
}
class zt 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.$(t, e, n) : new Wt(t, e, n) : "array-contains" /* ARRAY_CONTAINS */ === e ? new Kt(t, n) : "in" /* IN */ === e ? new Jt(t, n) : "not-in" /* NOT_IN */ === e ? new Zt(t, n) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === e ? new Xt(t, n) : new zt(t, e, n);
}
static $(t, e, n) {
return "in" /* IN */ === e ? new Gt(t, n) : new Ht(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.F(St(e, this.value)) : null !== e && Dt(this.value) === Dt(e) && this.F(St(e, this.value));
// Only compare types with matching backend order (such as double and int).
}
F(t) {
switch (this.op) {
case "<" /* LESS_THAN */ :
return t < 0;
case "<=" /* LESS_THAN_OR_EQUAL */ :
return t <= 0;
case "==" /* EQUAL */ :
return 0 === t;
case "!=" /* NOT_EQUAL */ :
return 0 !== t;
case ">" /* GREATER_THAN */ :
return t > 0;
case ">=" /* GREATER_THAN_OR_EQUAL */ :
return t >= 0;
default:
return g();
}
}
S() {
return [ "<" /* LESS_THAN */ , "<=" /* LESS_THAN_OR_EQUAL */ , ">" /* GREATER_THAN */ , ">=" /* GREATER_THAN_OR_EQUAL */ , "!=" /* NOT_EQUAL */ , "not-in" /* NOT_IN */ ].indexOf(this.op) >= 0;
}
}
/** Filter that matches on key fields (i.e. '__name__'). */
class Wt extends zt {
constructor(t, e, n) {
super(t, e, n), this.key = X.fromName(n.referenceValue);
}
matches(t) {
const e = X.comparator(t.key, this.key);
return this.F(e);
}
}
/** Filter that matches on key fields within an array. */ class Gt extends zt {
constructor(t, e) {
super(t, "in" /* IN */ , e), this.keys = Yt("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 Ht extends zt {
constructor(t, e) {
super(t, "not-in" /* NOT_IN */ , e), this.keys = Yt("not-in" /* NOT_IN */ , e);
}
matches(t) {
return !this.keys.some((e => e.isEqual(t.key)));
}
}
function Yt(t, e) {
var n;
return ((null === (n = e.arrayValue) || void 0 === n ? void 0 : n.values) || []).map((t => X.fromName(t.referenceValue)));
}
/** A Filter that implements the array-contains operator. */ class Kt extends zt {
constructor(t, e) {
super(t, "array-contains" /* ARRAY_CONTAINS */ , e);
}
matches(t) {
const e = t.data.field(this.field);
return Ot(e) && Ft(e.arrayValue, this.value);
}
}
/** A Filter that implements the IN operator. */ class Jt extends zt {
constructor(t, e) {
super(t, "in" /* IN */ , e);
}
matches(t) {
const e = t.data.field(this.field);
return null !== e && Ft(this.value.arrayValue, e);
}
}
/** A Filter that implements the not-in operator. */ class Zt extends zt {
constructor(t, e) {
super(t, "not-in" /* NOT_IN */ , e);
}
matches(t) {
if (Ft(this.value.arrayValue, {
nullValue: "NULL_VALUE"
})) return !1;
const e = t.data.field(this.field);
return null !== e && !Ft(this.value.arrayValue, e);
}
}
/** A Filter that implements the array-contains-any operator. */ class Xt extends zt {
constructor(t, e) {
super(t, "array-contains-any" /* ARRAY_CONTAINS_ANY */ , e);
}
matches(t) {
const e = t.data.field(this.field);
return !(!Ot(e) || !e.arrayValue.values) && e.arrayValue.values.some((t => Ft(this.value.arrayValue, t)));
}
}
/**
* Represents a bound of a query.
*
* The bound is specified with the given components representing a position and
* whether it's just before or just after the position (relative to whatever the
* query order is).
*
* The position represents a logical index position for a query. It's a prefix
* of values for the (potentially implicit) order by clauses of a query.
*
* 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 te {
constructor(t, e) {
this.position = t, this.before = e;
}
}
/**
* An ordering on a field, in some Direction. Direction defaults to ASCENDING.
*/ class ee {
constructor(t, e = "asc" /* ASCENDING */) {
this.field = t, this.dir = e;
}
}
function ne(t, e) {
return t.dir === e.dir && t.field.isEqual(e.field);
}
function re(t, e) {
if (null === t) return null === e;
if (null === e) return !1;
if (t.before !== e.before || t.position.length !== e.position.length) return !1;
for (let n = 0; n < t.position.length; n++) {
if (!$t(t.position[n], e.position[n])) return !1;
}
return !0;
}
/**
* @license
* Copyright 2017 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/**
* Query encapsulates all the query attributes we support in the SDK. It can
* be run against the LocalStore, as well as be converted to a `Target` to
* query the RemoteStore results.
*
* Visible for testing.
*/ class se {
/**
* Initializes a Query with a path and optional additional query constraints.
* Path must currently be empty if this is a collection group query.
*/
constructor(t, e = null, n = [], r = [], s = null, i = "F" /* First */ , o = null, u = null) {
this.path = t, this.collectionGroup = e, this.explicitOrderBy = n, this.filters = r,
this.limit = s, this.limitType = i, this.startAt = o, this.endAt = u, this.q = null,
// The corresponding `Target` of this `Query` instance.
this.O = null, this.startAt, this.endAt;
}
}
/** Creates a new Query for a query that matches all documents at `path` */ function ie(t) {
return !ot(t.limit) && "L" /* Last */ === t.limitType;
}
function oe(t) {
return t.explicitOrderBy.length > 0 ? t.explicitOrderBy[0].field : null;
}
function ue(t) {
for (const e of t.filters) if (e.S()) return e.field;
return null;
}
/**
* Checks if any of the provided Operators are included in the query and
* returns the first one that is, or null if none are.
*/
/**
* Returns whether the query matches a collection group rather than a specific
* collection.
*/
function ce(t) {
return null !== t.collectionGroup;
}
/**
* Returns the implicit order by constraint that is used to execute the Query,
* which can be different from the order by constraints the user provided (e.g.
* the SDK and backend always orders by `__name__`).
*/ function ae(t) {
const e = v(t);
if (null === e.q) {
e.q = [];
const t = ue(e), n = oe(e);
if (null !== t && null === n)
// 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.q.push(new ee(t)), e.q.push(new ee(Z.keyField(), "asc" /* ASCENDING */)); else {
let t = !1;
for (const n of e.explicitOrderBy) e.q.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.q.push(new ee(Z.keyField(), t));
}
}
}
return e.q;
}
/**
* Converts this `Query` instance to it's corresponding `Target` representation.
*/ function he(t) {
const e = v(t);
if (!e.O) if ("F" /* First */ === e.limitType) e.O = Qt(e.path, e.collectionGroup, ae(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 ae(e)) {
const e = "desc" /* DESCENDING */ === n.dir ? "asc" /* ASCENDING */ : "desc" /* DESCENDING */;
t.push(new ee(n.field, e));
}
// We need to swap the cursors to match the now-flipped query ordering.
const n = e.endAt ? new te(e.endAt.position, !e.endAt.before) : null, r = e.startAt ? new te(e.startAt.position, !e.startAt.before) : null;
// Now return as a LimitType.First query.
e.O = Qt(e.path, e.collectionGroup, t, e.filters, e.limit, n, r);
}
return e.O;
}
function le(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 (!ne(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) || !$t(n.value, r.value)) return !1;
var n, r;
return t.collectionGroup === e.collectionGroup && !!t.path.isEqual(e.path) && !!re(t.startAt, e.startAt) && re(t.endAt, e.endAt);
}(he(t), he(e)) && t.limitType === e.limitType;
}
/**
* @license
* Copyright 2020 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/**
* Returns an DoubleValue for `value` that is encoded based the serializer's
* `useProto3Json` setting.
*/
/**
* Returns a value for a number that's appropriate to put into a proto.
* The return value is an IntegerValue if it can safely represent the value,
* otherwise a DoubleValue is returned.
*/
function fe(t, e) {
return function(t) {
return "number" == typeof t && Number.isInteger(t) && !ut(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
}(e) ?
/**
* Returns an IntegerValue for `value`.
*/
function(t) {
return {
integerValue: "" + t
};
}(e) : function(t, e) {
if (t.C) {
if (isNaN(e)) return {
doubleValue: "NaN"
};
if (e === 1 / 0) return {
doubleValue: "Infinity"
};
if (e === -1 / 0) return {
doubleValue: "-Infinity"
};
}
return {
doubleValue: ut(e) ? "-0" : e
};
}(t, e);
}
/**
* @license
* Copyright 2018 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/** Used to represent a field transform on a mutation. */ class de {
constructor() {
// Make sure that the structural type of `TransformOperation` is unique.
// See https://github.com/microsoft/TypeScript/issues/5451
this._ = void 0;
}
}
/** Transforms a value into a server-generated timestamp. */ class we extends de {}
/** Transforms an array value via a union operation. */ class me extends de {
constructor(t) {
super(), this.elements = t;
}
}
/** Transforms an array value via a remove operation. */ class pe extends de {
constructor(t) {
super(), this.elements = t;
}
}
/**
* Implements the backend semantics for locally computed NUMERIC_ADD (increment)
* 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 ye extends de {
constructor(t, e) {
super(), this.L = t, this.U = e;
}
}
/**
* @license
* Copyright 2017 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/** A field path and the TransformOperation to perform upon it. */ class _e {
constructor(t, e) {
this.field = t, this.transform = e;
}
}
/**
* Encodes a precondition for a mutation. This follows the model that the
* backend accepts with the special case of an explicit "empty" precondition
* (meaning no precondition).
*/ class ge {
constructor(t, e) {
this.updateTime = t, this.exists = e;
}
/** Creates a new empty Precondition. */ static none() {
return new ge;
}
/** Creates a new Precondition with an exists flag. */ static exists(t) {
return new ge(void 0, t);
}
/** Creates a new Precondition based on a version a document exists at. */ static updateTime(t) {
return new ge(t);
}
/** Returns whether this Precondition is empty. */ get isNone() {
return void 0 === this.updateTime && void 0 === this.exists;
}
isEqual(t) {
return this.exists === t.exists && (this.updateTime ? !!t.updateTime && this.updateTime.isEqual(t.updateTime) : !t.updateTime);
}
}
/**
* A mutation describes a self-contained change to a document. Mutations can
* create, replace, delete, and update subsets of documents.
*
* Mutations not only act on the value of the document but also its version.
*
* For local mutations (mutations that haven't been committed yet), we preserve
* the existing version for Set and Patch mutations. For Delete mutations, we
* reset the version to 0.
*
* Here's the expected transition table.
*
* MUTATION APPLIED TO RESULTS IN
*
* SetMutation Document(v3) Document(v3)
* SetMutation NoDocument(v3) Document(v0)
* SetMutation InvalidDocument(v0) Document(v0)
* PatchMutation Document(v3) Document(v3)
* PatchMutation NoDocument(v3) NoDocument(v3)
* PatchMutation InvalidDocument(v0) UnknownDocument(v3)
* DeleteMutation Document(v3) NoDocument(v0)
* DeleteMutation NoDocument(v3) NoDocument(v0)
* DeleteMutation InvalidDocument(v0) NoDocument(v0)
*
* For acknowledged mutations, we use the updateTime of the WriteResponse as
* the resulting version for Set and Patch mutations. As deletes have no
* explicit update time, we use the commitTime of the WriteResponse for
* Delete mutations.
*
* If a mutation is acknowledged by the backend but fails the precondition check
* locally, we transition to an `UnknownDocument` and rely on Watch to send us
* the updated version.
*
* Field transforms are used only with Patch and Set Mutations. We use the
* `updateTransforms` message to store transforms, rather than the `transforms`s
* messages.
*
* ## Subclassing Notes
*
* Every type of mutation needs to implement its own applyToRemoteDocument() and
* applyToLocalView() to implement the actual behavior of applying the mutation
* to some source document (see `applySetMutationToRemoteDocument()` for an
* example).
*/ class be {}
/**
* A mutation that creates or replaces the document at the given key with the
* object value contents.
*/ class ve extends be {
constructor(t, e, n, r = []) {
super(), this.key = t, this.value = e, this.precondition = n, this.fieldTransforms = r,
this.type = 0 /* Set */;
}
}
/**
* A mutation that modifies fields of the document at the given key with the
* given values. The values are applied through a field mask:
*
* * When a field is in both the mask and the values, the corresponding field
* is updated.
* * When a field is in neither the mask nor the values, the corresponding
* field is unmodified.
* * When a field is in the mask but not in the values, the corresponding field
* is deleted.
* * When a field is not in the mask but is in the values, the values map is
* ignored.
*/ class Ee extends be {
constructor(t, e, n, r, s = []) {
super(), this.key = t, this.data = e, this.fieldMask = n, this.precondition = r,
this.fieldTransforms = s, this.type = 1 /* Patch */;
}
}
/** A mutation that deletes the document at the given key. */ class Te extends be {
constructor(t, e) {
super(), this.key = t, this.precondition = e, this.type = 2 /* Delete */ , this.fieldTransforms = [];
}
}
/**
* A mutation that verifies the existence of the document at the given key with
* the provided precondition.
*
* The `verify` operation is only used in Transactions, and this class serves
* primarily to facilitate serialization into protos.
*/ class Ie extends be {
constructor(t, e) {
super(), this.key = t, this.precondition = e, this.type = 3 /* Verify */ , this.fieldTransforms = [];
}
}
/**
* @license
* Copyright 2017 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/ const Ae = (() => {
const t = {
asc: "ASCENDING",
desc: "DESCENDING"
};
return t;
})(), Pe = (() => {
const t = {
"<": "LESS_THAN",
"<=": "LESS_THAN_OR_EQUAL",
">": "GREATER_THAN",
">=": "GREATER_THAN_OR_EQUAL",
"==": "EQUAL",
"!=": "NOT_EQUAL",
"array-contains": "ARRAY_CONTAINS",
in: "IN",
"not-in": "NOT_IN",
"array-contains-any": "ARRAY_CONTAINS_ANY"
};
return t;
})();
/**
* This class generates JsonObject values for the Datastore API suitable for
* sending to either GRPC stub methods or via the JSON/HTTP REST API.
*
* The serializer supports both Protobuf.js and Proto3 JSON formats. By
* setting `useProto3Json` to true, the serializer will use the Proto3 JSON
* format.
*
* For a description of the Proto3 JSON format check
* https://developers.google.com/protocol-buffers/docs/proto3#json
*
* TODO(klimt): We can remove the databaseId argument if we keep the full
* resource name in documents.
*/
class Re {
constructor(t, e) {
this.databaseId = t, this.C = e;
}
}
/**
* Returns a value for a number (or null) that's appropriate to put into
* a google.protobuf.Int32Value proto.
* DO NOT USE THIS FOR ANYTHING ELSE.
* This method cheats. It's typed as returning "number" because that's what
* our generated proto interfaces say Int32Value must be. But GRPC actually
* expects a { value: <number> } struct.
*/
/**
* Returns a value for a Date that's appropriate to put into a proto.
*/
function Ve(t, e) {
if (t.C) {
return `${new Date(1e3 * e.seconds).toISOString().replace(/\.\d*/, "").replace("Z", "")}.${("000000000" + e.nanoseconds).slice(-9)}Z`;
}
return {
seconds: "" + e.seconds,
nanos: e.nanoseconds
};
}
/**
* Returns a value for bytes that's appropriate to put in a proto.
*
* Visible for testing.
*/
function Ne(t, e) {
return t.C ? e.toBase64() : e.toUint8Array();
}
function De(t, e) {
return Ve(t, e.toTimestamp());
}
function $e(t) {
return b(!!t), _t.fromTimestamp(function(t) {
const e = It(t);
return new yt(e.seconds, e.nanos);
}(t));
}
function Fe(t, e) {
return function(t) {
return new K([ "projects", t.projectId, "databases", t.database ]);
}(t).child("documents").child(e).canonicalString();
}
function Se(t, e) {
return Fe(t.databaseId, e.path);
}
function qe(t, e) {
const n = function(t) {
const e = K.fromString(t);
return b(We(e)), e;
}(e);
if (n.get(1) !== t.databaseId.projectId) throw new U(A, "Tried to deserialize key from different project: " + n.get(1) + " vs " + t.databaseId.projectId);
if (n.get(3) !== t.databaseId.database) throw new U(A, "Tried to deserialize key from different database: " + n.get(3) + " vs " + t.databaseId.database);
return new X((b((r = n).length > 4 && "documents" === r.get(4)), r.popFirst(5)));
var r;
/** Creates a Document proto from key and fields (but no create/update time) */}
function xe(t, e) {
return Fe(t.databaseId, e);
}
function Oe(t) {
return new K([ "projects", t.databaseId.projectId, "databases", t.databaseId.database ]).canonicalString();
}
function Ce(t, e, n) {
return {
name: Se(t, e),
fields: n.value.mapValue.fields
};
}
function Le(t, e) {
return "found" in e ? function(t, e) {
b(!!e.found), e.found.name, e.found.updateTime;
const n = qe(t, e.found.name), r = $e(e.found.updateTime), s = new kt({
mapValue: {
fields: e.found.fields
}
});
return Mt.newFoundDocument(n, r, s);
}(t, e) : "missing" in e ? function(t, e) {
b(!!e.missing), b(!!e.readTime);
const n = qe(t, e.missing), r = $e(e.readTime);
return Mt.newNoDocument(n, r);
}(t, e) : g();
}
function Ue(t, e) {
let n;
if (e instanceof ve) n = {
update: Ce(t, e.key, e.value)
}; else if (e instanceof Te) n = {
delete: Se(t, e.key)
}; else if (e instanceof Ee) n = {
update: Ce(t, e.key, e.data),
updateMask: ze(e.fieldMask)
}; else {
if (!(e instanceof Ie)) return g();
n = {
verify: Se(t, e.key)
};
}
return e.fieldTransforms.length > 0 && (n.updateTransforms = e.fieldTransforms.map((t => function(t, e) {
const n = e.transform;
if (n instanceof we) return {
fieldPath: e.field.canonicalString(),
setToServerValue: "REQUEST_TIME"
};
if (n instanceof me) return {
fieldPath: e.field.canonicalString(),
appendMissingElements: {
values: n.elements
}
};
if (n instanceof pe) return {
fieldPath: e.field.canonicalString(),
removeAllFromArray: {
values: n.elements
}
};
if (n instanceof ye) return {
fieldPath: e.field.canonicalString(),
increment: n.U
};
throw g();
}(0, t)))), e.precondition.isNone || (n.currentDocument = function(t, e) {
return void 0 !== e.updateTime ? {
updateTime: De(t, e.updateTime)
} : void 0 !== e.exists ? {
exists: e.exists
} : g();
}(t, e.precondition)), n;
}
function je(t, e) {
// Dissect the path into parent, collectionId, and optional key filter.
const n = {
structuredQuery: {}
}, r = e.path;
null !== e.collectionGroup ? (n.parent = xe(t, r), n.structuredQuery.from = [ {
collectionId: e.collectionGroup,
allDescendants: !0
} ]) : (n.parent = xe(t, r.popLast()), n.structuredQuery.from = [ {
collectionId: r.lastSegment()
} ]);
const s = function(t) {
if (0 === t.length) return;
const e = t.map((t =>
// visible for testing
function(t) {
if ("==" /* EQUAL */ === t.op) {
if (Lt(t.value)) return {
unaryFilter: {
field: Qe(t.field),
op: "IS_NAN"
}
};
if (Ct(t.value)) return {
unaryFilter: {
field: Qe(t.field),
op: "IS_NULL"
}
};
} else if ("!=" /* NOT_EQUAL */ === t.op) {
if (Lt(t.value)) return {
unaryFilter: {
field: Qe(t.field),
op: "IS_NOT_NAN"
}
};
if (Ct(t.value)) return {
unaryFilter: {
field: Qe(t.field),
op: "IS_NOT_NULL"
}
};
}
return {
fieldFilter: {
field: Qe(t.field),
op: Be(t.op),
value: t.value
}
};
}(t)));
if (1 === e.length) return e[0];
return {
compositeFilter: {
op: "AND",
filters: e
}
};
}(e.filters);
s && (n.structuredQuery.where = s);
const i = function(t) {
if (0 === t.length) return;
return t.map((t =>
// visible for testing
function(t) {
return {
field: Qe(t.field),
direction: Me(t.dir)
};
}(t)));
}(e.orderBy);
i && (n.structuredQuery.orderBy = i);
const o = function(t, e) {
return t.C || ot(e) ? e : {
value: e
};
}(t, e.limit);
return null !== o && (n.structuredQuery.limit = o), e.startAt && (n.structuredQuery.startAt = ke(e.startAt)),
e.endAt && (n.structuredQuery.endAt = ke(e.endAt)), n;
}
function ke(t) {
return {
before: t.before,
values: t.position
};
}
// visible for testing
function Me(t) {
return Ae[t];
}
// visible for testing
function Be(t) {
return Pe[t];
}
function Qe(t) {
return {
fieldPath: t.canonicalString()
};
}
function ze(t) {
const e = [];
return t.fields.forEach((t => e.push(t.canonicalString()))), {
fieldPaths: e
};
}
function We(t) {
// Resource names have at least 4 components (project ID, database ID)
return t.length >= 4 && "projects" === t.get(0) && "databases" === t.get(2);
}
/**
* @license
* Copyright 2020 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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 Ge(t) {
return new Re(t, /* useProto3Json= */ !0);
}
/**
* @license
* Copyright 2017 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/**
* A helper for running delayed tasks following an exponential backoff curve
* between attempts.
*
* Each delay is made up of a "base" delay which follows the exponential
* backoff curve, and a +/- 50% "jitter" that is calculated and added to the
* base delay. This prevents clients from accidentally synchronizing their
* delays causing spikes of load to the backend.
*/
class He {
constructor(
/**
* The AsyncQueue to run backoff operations on.
*/
t,
/**
* The ID to use when scheduling backoff operations on the AsyncQueue.
*/
e,
/**
* The initial delay (used as the base delay on the first retry attempt).
* Note that jitter will still be applied, so the actual delay could be as
* little as 0.5*initialDelayMs.
*/
n = 1e3
/**
* The multiplier to use to determine the extended base delay after each
* attempt.
*/ , r = 1.5
/**
* The maximum base delay after which no further backoff is performed.
* Note that jitter will still be applied, so the actual delay could be as
* much as 1.5*maxDelayMs.
*/ , s = 6e4) {
this.j = t, this.timerId = e, this.k = n, this.M = r, this.B = s, this.W = 0, this.G = null,
/** The last backoff attempt, as epoch milliseconds. */
this.H = Date.now(), this.reset();
}
/**
* Resets the backoff delay.
*
* The very next backoffAndWait() will have no delay. If it is called again
* (i.e. due to an error), initialDelayMs (plus jitter) will be used, and
* subsequent ones will increase according to the backoffFactor.
*/ reset() {
this.W = 0;
}
/**
* Resets the backoff delay to the maximum delay (e.g. for use after a
* RESOURCE_EXHAUSTED error).
*/ Y() {
this.W = this.B;
}
/**
* Returns a promise that resolves after currentDelayMs, and increases the
* delay for any subsequent attempts. If there was a pending backoff operation
* already, it will be canceled.
*/ K(t) {
// Cancel any pending backoff operation.
this.cancel();
// First schedule using the current base (which may be 0 and should be
// honored as such).
const e = Math.floor(this.W + this.J()), n = Math.max(0, Date.now() - this.H), r = Math.max(0, e - n);
// Guard against lastAttemptTime being in the future due to a clock change.
r > 0 && m("ExponentialBackoff", `Backing off for ${r} ms (base delay: ${this.W} ms, delay with jitter: ${e} ms, last attempt: ${n} ms ago)`),
this.G = this.j.enqueueAfterDelay(this.timerId, r, (() => (this.H = Date.now(),
t()))),
// Apply backoff factor to determine next delay and ensure it is within
// bounds.
this.W *= this.M, this.W < this.k && (this.W = this.k), this.W > this.B && (this.W = this.B);
}
Z() {
null !== this.G && (this.G.skipDelay(), this.G = null);
}
cancel() {
null !== this.G && (this.G.cancel(), this.G = null);
}
/** Returns a random value in the range [-currentBaseMs/2, currentBaseMs/2] */ J() {
return (Math.random() - .5) * this.W;
}
}
/**
* @license
* Copyright 2017 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/**
* Datastore and its related methods are a wrapper around the external Google
* Cloud Datastore grpc API, which provides an interface that is more convenient
* for the rest of the client SDK architecture to consume.
*/
/**
* An implementation of Datastore that exposes additional state for internal
* consumption.
*/
class Ye extends class {} {
constructor(t, e, n) {
super(), this.credentials = t, this.X = e, this.L = n, this.tt = !1;
}
et() {
if (this.tt) throw new U(F, "The client has already been terminated.");
}
/** Gets an auth token and invokes the provided RPC. */ v(t, e, n) {
return this.et(), this.credentials.getToken().then((r => this.X.v(t, e, n, r))).catch((t => {
throw "FirebaseError" === t.name ? (t.code === D && this.credentials.invalidateToken(),
t) : new U(I, t.toString());
}));
}
/** Gets an auth token and invokes the provided RPC with streamed results. */ P(t, e, n) {
return this.et(), this.credentials.getToken().then((r => this.X.P(t, e, n, r))).catch((t => {
throw "FirebaseError" === t.name ? (t.code === D && this.credentials.invalidateToken(),
t) : new U(I, t.toString());
}));
}
terminate() {
this.tt = !0;
}
}
// TODO(firestorexp): Make sure there is only one Datastore instance per
// firestore-exp client.
async function Ke(t, e) {
const n = v(t), r = Oe(n.L) + "/documents", s = {
writes: e.map((t => Ue(n.L, t)))
};
await n.v("Commit", r, s);
}
async function Je(t, e) {
const n = v(t), r = Oe(n.L) + "/documents", s = {
documents: e.map((t => Se(n.L, t)))
}, i = await n.P("BatchGetDocuments", r, s), o = new Map;
i.forEach((t => {
const e = Le(n.L, t);
o.set(e.key.toString(), e);
}));
const u = [];
return e.forEach((t => {
const e = o.get(t.toString());
b(!!e), u.push(e);
})), u;
}
async function Ze(t, e) {
const n = v(t), r = je(n.L, he(e));
return (await n.P("RunQuery", r.parent, {
structuredQuery: r.structuredQuery
})).filter((t => !!t.document)).map((t => function(t, e, n) {
const r = qe(t, e.name), s = $e(e.updateTime), i = new kt({
mapValue: {
fields: e.fields
}
}), o = Mt.newFoundDocument(r, s, i);
return n && o.setHasCommittedMutations(), n ? o.setHasCommittedMutations() : o;
}(n.L, t.document, void 0)));
}
/**
* @license
* Copyright 2020 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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 Xe = new Map;
/**
* An instance map that ensures only one Datastore exists per Firestore
* instance.
*/
/**
* Returns an initialized and started Datastore for the given Firestore
* instance. Callers must invoke removeComponents() when the Firestore
* instance is terminated.
*/
function tn(t) {
if (t._terminated) throw new U(F, "The client has already been terminated.");
if (!Xe.has(t)) {
m("ComponentProvider", "Initializing Datastore");
const i = function(t) {
return new ft(t, fetch.bind(null));
}((e = t._databaseId, n = t.app.options.appId || "", r = t._persistenceKey, s = t._freezeSettings(),
new G(e, n, r, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams))), o = Ge(t._databaseId), u = function(t, e, n) {
return new Ye(t, e, n);
}(t._credentials, i, o);
Xe.set(t, u);
}
var e, n, r, s;
/**
* @license
* Copyright 2018 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/ return Xe.get(t);
}
/**
* Removes all components associated with the provided instance. Must be called
* when the `Firestore` instance is terminated.
*/
/**
* A concrete type describing all the values that can be applied via a
* user-supplied firestore.Settings object. This is a separate type so that
* defaults can be supplied and the value can be checked for equality.
*/
class en {
constructor(t) {
var e;
if (void 0 === t.host) {
if (void 0 !== t.ssl) throw new U(A, "Can't provide ssl option if host option is not set");
this.host = "firestore.googleapis.com", this.ssl = true;
} else this.host = t.host, this.ssl = null === (e = t.ssl) || void 0 === e || e;
if (this.credentials = t.credentials, this.ignoreUndefinedProperties = !!t.ignoreUndefinedProperties,
void 0 === t.cacheSizeBytes) this.cacheSizeBytes = 41943040; else {
if (-1 !== t.cacheSizeBytes && t.cacheSizeBytes < 1048576) throw new U(A, "cacheSizeBytes must be at least 1048576");
this.cacheSizeBytes = t.cacheSizeBytes;
}
this.experimentalForceLongPolling = !!t.experimentalForceLongPolling, this.experimentalAutoDetectLongPolling = !!t.experimentalAutoDetectLongPolling,
this.useFetchStreams = !!t.useFetchStreams, function(t, e, n, r) {
if (!0 === e && !0 === r) throw new U(A, `${t} and ${n} cannot be used together.`);
}("experimentalForceLongPolling", t.experimentalForceLongPolling, "experimentalAutoDetectLongPolling", t.experimentalAutoDetectLongPolling);
}
isEqual(t) {
return this.host === t.host && this.ssl === t.ssl && this.credentials === t.credentials && this.cacheSizeBytes === t.cacheSizeBytes && this.experimentalForceLongPolling === t.experimentalForceLongPolling && this.experimentalAutoDetectLongPolling === t.experimentalAutoDetectLongPolling && this.ignoreUndefinedProperties === t.ignoreUndefinedProperties && this.useFetchStreams === t.useFetchStreams;
}
}
/**
* @license
* Copyright 2020 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/**
* The Cloud Firestore service interface.
*
* Do not call this constructor directly. Instead, use {@link getFirestore}.
*/ class nn {
/** @hideconstructor */
constructor(t, e) {
/**
* Whether it's a Firestore or Firestore Lite instance.
*/
this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new en({}),
this._settingsFrozen = !1, t instanceof H ? (this._databaseId = t, this._credentials = new M) : (this._app = t,
this._databaseId = function(t) {
if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new U(A, '"projectId" not provided in firebase.initializeApp.');
return new H(t.options.projectId);
}
/**
* Initializes a new instance of Cloud Firestore with the provided settings.
* Can only be called before any other functions, including
* {@link getFirestore}. If the custom settings are empty, this function is
* equivalent to calling {@link getFirestore}.
*
* @param app - The {@link @firebase/app#FirebaseApp} with which the `Firestore` instance will
* be associated.
* @param settings - A settings object to configure the `Firestore` instance.
* @returns A newly initialized Firestore instance.
*/ (t), this._credentials = new Q(e));
}
/**
* The {@link @firebase/app#FirebaseApp} associated with this `Firestore` service
* instance.
*/ get app() {
if (!this._app) throw new U(F, "Firestore was not initialized using the Firebase SDK. 'app' is not available");
return this._app;
}
get _initialized() {
return this._settingsFrozen;
}
get _terminated() {
return void 0 !== this._terminateTask;
}
_setSettings(t) {
if (this._settingsFrozen) throw new U(F, "Firestore has already been started and its settings can no longer be changed. You can only modify settings before calling any other methods on a Firestore object.");
this._settings = new en(t), void 0 !== t.credentials && (this._credentials = function(t) {
if (!t) return new M;
switch (t.type) {
case "gapi":
const e = t.client;
// Make sure this really is a Gapi client.
return b(!("object" != typeof e || null === e || !e.auth || !e.auth.getAuthHeaderValueForFirstParty)),
new W(e, t.sessionIndex || "0", t.iamToken || null);
case "provider":
return t.client;
default:
throw new U(A, "makeCredentialsProvider failed due to invalid credential type");
}
}(t.credentials));
}
_getSettings() {
return this._settings;
}
_freezeSettings() {
return this._settingsFrozen = !0, this._settings;
}
_delete() {
return this._terminateTask || (this._terminateTask = this._terminate()), this._terminateTask;
}
/** Returns a JSON-serializable representation of this Firestore instance. */ toJSON() {
return {
app: this._app,
databaseId: this._databaseId,
settings: this._settings
};
}
/**
* Terminates all components used by this client. Subclasses can override
* this method to clean up their own dependencies, but must also call this
* method.
*
* Only ever called once.
*/ _terminate() {
return function(t) {
const e = Xe.get(t);
e && (m("ComponentProvider", "Removing Datastore"), Xe.delete(t), e.terminate());
}(this), Promise.resolve();
}
}
function rn(e, n) {
const r = t(e, "firestore/lite");
if (r.isInitialized()) throw new U(F, "Firestore can only be initialized once per app.");
return r.initialize({
options: n
});
}
/**
* Returns the existing instance of Firestore that is associated with the
* provided {@link @firebase/app#FirebaseApp}. If no instance exists, initializes a new
* instance with default settings.
*
* @param app - The {@link @firebase/app#FirebaseApp} instance that the returned Firestore
* instance is associated with.
* @returns The `Firestore` instance of the provided app.
*/ function sn(n = e()) {
return t(n, "firestore/lite").getImmediate();
}
/**
* Modify this instance to communicate with the Cloud Firestore emulator.
*
* Note: This must be called before this instance has been used to do any
* operations.
*
* @param firestore - The Firestore instance to configure to connect to the
* emulator.
* @param host - the emulator host (ex: localhost).
* @param port - the emulator port (ex: 9000).
* @param options.mockUserToken - the mock auth token to use for unit testing
* Security Rules.
*/ function on(t, e, n, r = {}) {
const s = (t = st(t, nn))._getSettings();
if ("firestore.googleapis.com" !== s.host && s.host !== e && y("Host has been set in both settings() and useEmulator(), emulator host will be used"),
t._setSettings(Object.assign(Object.assign({}, s), {
host: `${e}:${n}`,
ssl: !1
})), r.mockUserToken) {
// Let createMockUserToken validate first (catches common mistakes like
// invalid field "uid" and missing field "sub" / "user_id".)
const e = u(r.mockUserToken), n = r.mockUserToken.sub || r.mockUserToken.user_id;
if (!n) throw new U(A, "mockUserToken must contain 'sub' or 'user_id' field!");
t._credentials = new B(new k(e, new f(n)));
}
}
/**
* Terminates the provided Firestore instance.
*
* After calling `terminate()` only the `clearIndexedDbPersistence()` functions
* may be used. Any other function will throw a `FirestoreError`. Termination
* does not cancel any pending writes, and any promises that are awaiting a
* response from the server will not be resolved.
*
* To restart after termination, create a new instance of FirebaseFirestore with
* {@link getFirestore}.
*
* Note: Under normal circumstances, calling `terminate()` is not required. This
* function is useful only when you want to force this instance to release all of
* its resources or in combination with {@link clearIndexedDbPersistence} to
* ensure that all local state is destroyed between test runs.
*
* @param firestore - The Firestore instance to terminate.
* @returns A promise that is resolved when the instance has been successfully
* terminated.
*/ function un(t) {
return t = st(t, nn), n(t.app, "firestore/lite"), t._delete();
}
/**
* @license
* Copyright 2020 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/**
* @license
* Copyright 2020 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/**
* A `DocumentReference` refers to a document location in a Firestore database
* and can be used to write, read, or listen to the location. The document at
* the referenced location may or may not exist.
*/
class cn {
/** @hideconstructor */
constructor(t,
/**
* If provided, the `FirestoreDataConverter` associated with this instance.
*/
e, n) {
this.converter = e, this._key = n,
/** The type of this Firestore reference. */
this.type = "document", this.firestore = t;
}
get _path() {
return this._key.path;
}
/**
* The document's identifier within its collection.
*/ get id() {
return this._key.path.lastSegment();
}
/**
* A string representing the path of the referenced document (relative
* to the root of the database).
*/ get path() {
return this._key.path.canonicalString();
}
/**
* The collection this `DocumentReference` belongs to.
*/ get parent() {
return new hn(this.firestore, this.converter, this._key.path.popLast());
}
withConverter(t) {
return new cn(this.firestore, t, this._key);
}
}
/**
* A `Query` refers to a Query which you can read or listen to. You can also
* construct refined `Query` objects by adding filters and ordering.
*/ class an {
// This is the lite version of the Query class in the main SDK.
/** @hideconstructor protected */
constructor(t,
/**
* If provided, the `FirestoreDataConverter` associated with this instance.
*/
e, n) {
this.converter = e, this._query = n,
/** The type of this Firestore reference. */
this.type = "query", this.firestore = t;
}
withConverter(t) {
return new an(this.firestore, t, this._query);
}
}
/**
* A `CollectionReference` object can be used for adding documents, getting
* document references, and querying for documents (using {@link query}).
*/ class hn extends an {
/** @hideconstructor */
constructor(t, e, n) {
super(t, e, new se(n)), this._path = n,
/** The type of this Firestore reference. */
this.type = "collection";
}
/** The collection's identifier. */ get id() {
return this._query.path.lastSegment();
}
/**
* A string representing the path of the referenced collection (relative
* to the root of the database).
*/ get path() {
return this._query.path.canonicalString();
}
/**
* A reference to the containing `DocumentReference` if this is a
* subcollection. If this isn't a subcollection, the reference is null.
*/ get parent() {
const t = this._path.popLast();
return t.isEmpty() ? null : new cn(this.firestore,
/* converter= */ null, new X(t));
}
withConverter(t) {
return new hn(this.firestore, t, this._path);
}
}
function ln(t, e, ...n) {
if (t = c(t), tt("collection", "path", e), t instanceof nn) {
const r = K.fromString(e, ...n);
return nt(r), new hn(t, /* converter= */ null, r);
}
{
if (!(t instanceof cn || t instanceof hn)) throw new U(A, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
const r = K.fromString(t.path, ...n).child(K.fromString(e));
return nt(r), new hn(t.firestore,
/* converter= */ null, r);
}
}
// TODO(firestorelite): Consider using ErrorFactory -
// https://github.com/firebase/firebase-js-sdk/blob/0131e1f/packages/util/src/errors.ts#L106
/**
* Creates and returns a new `Query` instance that includes all documents in the
* database that are contained in a collection or subcollection with the
* given `collectionId`.
*
* @param firestore - A reference to the root Firestore instance.
* @param collectionId - Identifies the collections to query over. Every
* collection or subcollection with this ID as the last segment of its path
* will be included. Cannot contain a slash.
* @returns The created `Query`.
*/ function fn(t, e) {
if (t = st(t, nn), tt("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new U(A, `Invalid collection ID '${e}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
return new an(t,
/* converter= */ null,
/**
* Creates a new Query for a collection group query that matches all documents
* within the provided collection group.
*/
function(t) {
return new se(K.emptyPath(), t);
}(e));
}
function dn(t, e, ...n) {
if (t = c(t),
// We allow omission of 'pathString' but explicitly prohibit passing in both
// 'undefined' and 'null'.
1 === arguments.length && (e = wt.N()), tt("doc", "path", e), t instanceof nn) {
const r = K.fromString(e, ...n);
return et(r), new cn(t,
/* converter= */ null, new X(r));
}
{
if (!(t instanceof cn || t instanceof hn)) throw new U(A, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
const r = t._path.child(K.fromString(e, ...n));
return et(r), new cn(t.firestore, t instanceof hn ? t.converter : null, new X(r));
}
}
/**
* Returns true if the provided references are equal.
*
* @param left - A reference to compare.
* @param right - A reference to compare.
* @returns true if the references point to the same location in the same
* Firestore database.
*/ function wn(t, e) {
return t = c(t), e = c(e), (t instanceof cn || t instanceof hn) && (e instanceof cn || e instanceof hn) && (t.firestore === e.firestore && t.path === e.path && t.converter === e.converter);
}
/**
* Returns true if the provided queries point to the same collection and apply
* the same constraints.
*
* @param left - A `Query` to compare.
* @param right - A `Query` to compare.
* @returns true if the references point to the same location in the same
* Firestore database.
*/ function mn(t, e) {
return t = c(t), e = c(e), t instanceof an && e instanceof an && (t.firestore === e.firestore && le(t._query, e._query) && t.converter === e.converter);
}
/**
* @license
* Copyright 2020 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/**
* A `FieldPath` refers to a field in a document. The path may consist of a
* single field name (referring to a top-level field in the document), or a
* list of field names (referring to a nested field in the document).
*
* Create a `FieldPath` by providing field names. If more than one field
* name is provided, the path will point to a nested field in a document.
*/ class pn {
/**
* Creates a FieldPath from the provided field names. If more than one field
* name is provided, the path will point to a nested field in a document.
*
* @param fieldNames - A list of field names.
*/
constructor(...t) {
for (let e = 0; e < t.length; ++e) if (0 === t[e].length) throw new U(A, "Invalid field name at argument $(i + 1). Field names must not be empty.");
this._internalPath = new Z(t);
}
/**
* Returns true if this `FieldPath` is equal to the provided one.
*
* @param other - The `FieldPath` to compare against.
* @returns true if this `FieldPath` is equal to the provided one.
*/ isEqual(t) {
return this._internalPath.isEqual(t._internalPath);
}
}
/**
* Returns a special sentinel `FieldPath` to refer to the ID of a document.
* It can be used in queries to sort or filter by the document ID.
*/ function yn() {
return new pn("__name__");
}
/**
* @license
* Copyright 2020 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/**
* An immutable object representing an array of bytes.
*/ class _n {
/** @hideconstructor */
constructor(t) {
this._byteString = t;
}
/**
* Creates a new `Bytes` object from the given Base64 string, converting it to
* bytes.
*
* @param base64 - The Base64 string used to create the `Bytes` object.
*/ static fromBase64String(t) {
try {
return new _n(Et.fromBase64String(t));
} catch (t) {
throw new U(A, "Failed to construct data from Base64 string: " + t);
}
}
/**
* Creates a new `Bytes` object from the given Uint8Array.
*
* @param array - The Uint8Array used to create the `Bytes` object.
*/ static fromUint8Array(t) {
return new _n(Et.fromUint8Array(t));
}
/**
* Returns the underlying bytes as a Base64-encoded string.
*
* @returns The Base64-encoded string created from the `Bytes` object.
*/ toBase64() {
return this._byteString.toBase64();
}
/**
* Returns the underlying bytes in a new `Uint8Array`.
*
* @returns The Uint8Array created from the `Bytes` object.
*/ toUint8Array() {
return this._byteString.toUint8Array();
}
/**
* Returns a string representation of the `Bytes` object.
*
* @returns A string representation of the `Bytes` object.
*/ toString() {
return "Bytes(base64: " + this.toBase64() + ")";
}
/**
* Returns true if this `Bytes` object is equal to the provided one.
*
* @param other - The `Bytes` object to compare against.
* @returns true if this `Bytes` object is equal to the provided one.
*/ isEqual(t) {
return this._byteString.isEqual(t._byteString);
}
}
/**
* @license
* Copyright 2020 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/**
* Sentinel values that can be used when writing document fields with `set()`
* or `update()`.
*/ class gn {
/**
* @param _methodName - The public API endpoint that returns this class.
* @hideconstructor
*/
constructor(t) {
this._methodName = t;
}
}
/**
* @license
* Copyright 2017 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/**
* An immutable object representing a geographic location in Firestore. The
* location is represented as latitude/longitude pair.
*
* Latitude values are in the range of [-90, 90].
* Longitude values are in the range of [-180, 180].
*/ class bn {
/**
* Creates a new immutable `GeoPoint` object with the provided latitude and
* longitude values.
* @param latitude - The latitude as number between -90 and 90.
* @param longitude - The longitude as number between -180 and 180.
*/
constructor(t, e) {
if (!isFinite(t) || t < -90 || t > 90) throw new U(A, "Latitude must be a number between -90 and 90, but was: " + t);
if (!isFinite(e) || e < -180 || e > 180) throw new U(A, "Longitude must be a number between -180 and 180, but was: " + e);
this._lat = t, this._long = e;
}
/**
* The latitude of this `GeoPoint` instance.
*/ get latitude() {
return this._lat;
}
/**
* The longitude of this `GeoPoint` instance.
*/ get longitude() {
return this._long;
}
/**
* Returns true if this `GeoPoint` is equal to the provided one.
*
* @param other - The `GeoPoint` to compare against.
* @returns true if this `GeoPoint` is equal to the provided one.
*/ isEqual(t) {
return this._lat === t._lat && this._long === t._long;
}
/** Returns a JSON-serializable representation of this GeoPoint. */ toJSON() {
return {
latitude: this._lat,
longitude: this._long
};
}
/**
* Actually private to JS consumers of our API, so this function is prefixed
* with an underscore.
*/ _compareTo(t) {
return mt(this._lat, t._lat) || mt(this._long, t._long);
}
}
/**
* @license
* Copyright 2017 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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 vn = /^__.*__$/;
/** The result of parsing document data (e.g. for a setData call). */ class En {
constructor(t, e, n) {
this.data = t, this.fieldMask = e, this.fieldTransforms = n;
}
toMutation(t, e) {
return null !== this.fieldMask ? new Ee(t, this.data, this.fieldMask, e, this.fieldTransforms) : new ve(t, this.data, e, this.fieldTransforms);
}
}
/** The result of parsing "update" data (i.e. for an updateData call). */ class Tn {
constructor(t,
// The fieldMask does not include document transforms.
e, n) {
this.data = t, this.fieldMask = e, this.fieldTransforms = n;
}
toMutation(t, e) {
return new Ee(t, this.data, this.fieldMask, e, this.fieldTransforms);
}
}
function In(t) {
switch (t) {
case 0 /* Set */ :
// fall through
case 2 /* MergeSet */ :
// fall through
case 1 /* Update */ :
return !0;
case 3 /* Argument */ :
case 4 /* ArrayArgument */ :
return !1;
default:
throw g();
}
}
/** A "context" object passed around while parsing user data. */ class An {
/**
* Initializes a ParseContext with the given source and path.
*
* @param settings - The settings for the parser.
* @param databaseId - The database ID of the Firestore instance.
* @param serializer - The serializer to use to generate the Value proto.
* @param ignoreUndefinedProperties - Whether to ignore undefined properties
* rather than throw.
* @param fieldTransforms - A mutable list of field transforms encountered
* while parsing the data.
* @param fieldMask - A mutable list of field paths encountered while parsing
* the data.
*
* TODO(b/34871131): We don't support array paths right now, so path can be
* null to indicate the context represents any location within an array (in
* which case certain features will not work and errors will be somewhat
* compromised).
*/
constructor(t, e, n, r, s, i) {
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.nt(), this.fieldTransforms = s || [], this.fieldMask = i || [];
}
get path() {
return this.settings.path;
}
get rt() {
return this.settings.rt;
}
/** Returns a new context with the specified settings overwritten. */ st(t) {
return new An(Object.assign(Object.assign({}, this.settings), t), this.databaseId, this.L, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
}
it(t) {
var e;
const n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), r = this.st({
path: n,
ot: !1
});
return r.ut(t), r;
}
ct(t) {
var e;
const n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), r = this.st({
path: n,
ot: !1
});
return r.nt(), r;
}
at(t) {
// TODO(b/34871131): We don't support array paths right now; so make path
// undefined.
return this.st({
path: void 0,
ot: !0
});
}
ht(t) {
return zn(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)));
}
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.ut(this.path.get(t));
}
ut(t) {
if (0 === t.length) throw this.ht("Document fields must not be empty");
if (In(this.rt) && vn.test(t)) throw this.ht('Document fields cannot begin and end with "__"');
}
}
/**
* Helper for parsing raw user input (provided via the API) into internal model
* classes.
*/ class Pn {
constructor(t, e, n) {
this.databaseId = t, this.ignoreUndefinedProperties = e, this.L = n || Ge(t);
}
/** Creates a new top-level parse context. */ dt(t, e, n, r = !1) {
return new An({
rt: t,
methodName: e,
ft: n,
path: Z.emptyPath(),
ot: !1,
lt: r
}, this.databaseId, this.L, this.ignoreUndefinedProperties);
}
}
function Rn(t) {
const e = t._freezeSettings(), n = Ge(t._databaseId);
return new Pn(t._databaseId, !!e.ignoreUndefinedProperties, n);
}
/** Parse document data from a set() call. */ function Vn(t, e, n, r, s, i = {}) {
const o = t.dt(i.merge || i.mergeFields ? 2 /* MergeSet */ : 0 /* Set */ , e, n, s);
kn("Data must be an object, but it was:", o, r);
const u = Un(r, o);
let c, a;
if (i.merge) c = new vt(o.fieldMask), a = o.fieldTransforms; else if (i.mergeFields) {
const t = [];
for (const r of i.mergeFields) {
const s = Mn(e, r, n);
if (!o.contains(s)) throw new U(A, `Field '${s}' is specified in your field mask but missing from your input data.`);
Wn(t, s) || t.push(s);
}
c = new vt(t), a = o.fieldTransforms.filter((t => c.covers(t.field)));
} else c = null, a = o.fieldTransforms;
return new En(new kt(u), c, a);
}
class Nn extends gn {
_toFieldTransform(t) {
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;
}
isEqual(t) {
return t instanceof Nn;
}
}
/**
* Creates a child context for parsing SerializableFieldValues.
*
* This is different than calling `ParseContext.contextWith` because it keeps
* the fieldTransforms and fieldMask separate.
*
* The created context has its `dataSource` set to `UserDataSource.Argument`.
* Although these values are used with writes, any elements in these FieldValues
* are not considered writes since they cannot contain any FieldValue sentinels,
* etc.
*
* @param fieldValue - The sentinel FieldValue for which to create a child
* context.
* @param context - The parent context.
* @param arrayElement - Whether or not the FieldValue has an array.
*/ function Dn(t, e, n) {
return new An({
rt: 3 /* Argument */ ,
ft: e.settings.ft,
methodName: t._methodName,
ot: n
}, e.databaseId, e.L, e.ignoreUndefinedProperties);
}
class $n extends gn {
_toFieldTransform(t) {
return new _e(t.path, new we);
}
isEqual(t) {
return t instanceof $n;
}
}
class Fn extends gn {
constructor(t, e) {
super(t), this.wt = e;
}
_toFieldTransform(t) {
const e = Dn(this, t,
/*array=*/ !0), n = this.wt.map((t => Ln(t, e))), r = new me(n);
return new _e(t.path, r);
}
isEqual(t) {
// TODO(mrschmidt): Implement isEquals
return this === t;
}
}
class Sn extends gn {
constructor(t, e) {
super(t), this.wt = e;
}
_toFieldTransform(t) {
const e = Dn(this, t,
/*array=*/ !0), n = this.wt.map((t => Ln(t, e))), r = new pe(n);
return new _e(t.path, r);
}
isEqual(t) {
// TODO(mrschmidt): Implement isEquals
return this === t;
}
}
class qn extends gn {
constructor(t, e) {
super(t), this.yt = e;
}
_toFieldTransform(t) {
const e = new ye(t.L, fe(t.L, this.yt));
return new _e(t.path, e);
}
isEqual(t) {
// TODO(mrschmidt): Implement isEquals
return this === t;
}
}
/** Parse update data from an update() call. */ function xn(t, e, n, r) {
const s = t.dt(1 /* Update */ , e, n);
kn("Data must be an object, but it was:", s, r);
const i = [], o = kt.empty();
bt(r, ((t, r) => {
const u = Qn(e, t, n);
// For Compat types, we have to "extract" the underlying types before
// performing validation.
r = c(r);
const a = s.ct(u);
if (r instanceof Nn)
// Add it to the field mask, but don't add anything to updateData.
i.push(u); else {
const t = Ln(r, a);
null != t && (i.push(u), o.set(u, t));
}
}));
const u = new vt(i);
return new Tn(o, u, s.fieldTransforms);
}
/** Parse update data from a list of field/value arguments. */ function On(t, e, n, r, s, i) {
const o = t.dt(1 /* Update */ , e, n), u = [ Mn(e, r, n) ], a = [ 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(Mn(e, i[t])), a.push(i[t + 1]);
const h = [], l = kt.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(h, u[t])) {
const e = u[t];
let n = a[t];
// For Compat types, we have to "extract" the underlying types before
// performing validation.
n = c(n);
const r = o.ct(e);
if (n instanceof Nn)
// Add it to the field mask, but don't add anything to updateData.
h.push(e); else {
const t = Ln(n, r);
null != t && (h.push(e), l.set(e, t));
}
}
const f = new vt(h);
return new Tn(l, f, o.fieldTransforms);
}
/**
* Parse a "query value" (e.g. value in a where filter or a value in a cursor
* bound).
*
* @param allowArrays - Whether the query value is an array that may directly
* contain additional arrays (e.g. the operand of an `in` query).
*/ function Cn(t, e, n, r = !1) {
return Ln(n, t.dt(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , e));
}
/**
* Parses user data to Protobuf Values.
*
* @param input - Data to be parsed.
* @param context - A context object representing the current path being parsed,
* the source of the data being parsed, etc.
* @returns The parsed value, or null if the value was a FieldValue sentinel
* that should not be included in the resulting parsed data.
*/ function Ln(t, e) {
if (jn(
// Unwrap the API type from the Compat SDK. This will return the API type
// from firestore-exp.
t = c(t))) return kn("Unsupported field value:", e, t), Un(t, e);
if (t instanceof gn)
// FieldValues usually parse into transforms (except FieldValue.delete())
// in which case we do not want to include this field in our parsed data
// (as doing so will overwrite the field directly prior to the transform
// trying to transform it). So we don't add this location to
// context.fieldMask and we return null as our parsing result.
/**
* "Parses" the provided FieldValueImpl, adding any necessary transforms to
* context.fieldTransforms.
*/
return function(t, e) {
// Sentinels are only supported with writes, and not within arrays.
if (!In(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);
}
/**
* Helper to parse a scalar value (i.e. not an Object, Array, or FieldValue)
*
* @returns The parsed value
*/ (t, e), null;
if (void 0 === t && e.ignoreUndefinedProperties)
// If the input is undefined it can never participate in the fieldMask, so
// don't handle this below. If `ignoreUndefinedProperties` is false,
// `parseScalarValue` will reject an undefined value.
return null;
if (
// If context.path is null we are inside an array and we don't support
// field mask paths more granular than the top-level array.
e.path && e.fieldMask.push(e.path), t instanceof Array) {
// TODO(b/34871131): Include the path containing the array in the error
// message.
// In the case of IN queries, the parsed data is an array (representing
// 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.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 = Ln(s, e.at(r));
null == t && (
// Just include nulls in the array for fields being replaced with a
// sentinel.
t = {
nullValue: "NULL_VALUE"
}), n.push(t), r++;
}
return {
arrayValue: {
values: n
}
};
}(t, e);
}
return function(t, e) {
if (null === (t = c(t))) return {
nullValue: "NULL_VALUE"
};
if ("number" == typeof t) return fe(e.L, t);
if ("boolean" == typeof t) return {
booleanValue: t
};
if ("string" == typeof t) return {
stringValue: t
};
if (t instanceof Date) {
const n = yt.fromDate(t);
return {
timestampValue: Ve(e.L, n)
};
}
if (t instanceof yt) {
// Firestore backend truncates precision down to microseconds. To ensure
// offline mode works the same with regards to truncation, perform the
// truncation immediately without waiting for the backend to do that.
const n = new yt(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
return {
timestampValue: Ve(e.L, n)
};
}
if (t instanceof bn) return {
geoPointValue: {
latitude: t.latitude,
longitude: t.longitude
}
};
if (t instanceof _n) return {
bytesValue: Ne(e.L, t._byteString)
};
if (t instanceof cn) {
const n = e.databaseId, r = t.firestore._databaseId;
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: Fe(t.firestore._databaseId || e.databaseId, t._key.path)
};
}
throw e.ht(`Unsupported field value: ${rt(t)}`);
}
/**
* Checks whether an object looks like a JSON object that should be converted
* into a struct. Normal class/prototype instances are considered to look like
* JSON objects since they should be converted to a struct value. Arrays, Dates,
* GeoPoints, etc. are not considered to look like JSON objects since they map
* to specific FieldValue types other than ObjectValue.
*/ (t, e);
}
function Un(t, e) {
const n = {};
return !function(t) {
for (const e in t) if (Object.prototype.hasOwnProperty.call(t, e)) return !1;
return !0;
}(t) ? bt(t, ((t, r) => {
const s = Ln(r, e.it(t));
null != s && (n[t] = s);
})) :
// If we encounter an empty object, we explicitly add it to the update
// mask to ensure that the server creates a map entry.
e.path && e.path.length > 0 && e.fieldMask.push(e.path), {
mapValue: {
fields: n
}
};
}
function jn(t) {
return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof yt || t instanceof bn || t instanceof _n || t instanceof cn || t instanceof gn);
}
function kn(t, e, n) {
if (!jn(n) || !function(t) {
return "object" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));
}(n)) {
const r = rt(n);
throw "an object" === r ? e.ht(t + " a custom object") : e.ht(t + " " + r);
}
}
/**
* Helper that calls fromDotSeparatedString() but wraps any error thrown.
*/ function Mn(t, e, n) {
if ((
// If required, replace the FieldPath Compat class with with the firestore-exp
// FieldPath.
e = c(e)) instanceof pn) return e._internalPath;
if ("string" == typeof e) return Qn(t, e);
throw zn("Field path arguments must be of type string or FieldPath.", t,
/* hasConverter= */ !1,
/* path= */ void 0, n);
}
/**
* Matches any characters in a field path string that are reserved.
*/ const Bn = new RegExp("[~\\*/\\[\\]]");
/**
* Wraps fromDotSeparatedString with an error message about the method that
* was thrown.
* @param methodName - The publicly visible method name
* @param path - The dot-separated string form of a field path which will be
* split on dots.
* @param targetDoc - The document against which the field path will be
* evaluated.
*/ function Qn(t, e, n) {
if (e.search(Bn) >= 0) throw zn(`Invalid field path (${e}). Paths must not contain '~', '*', '/', '[', or ']'`, t,
/* hasConverter= */ !1,
/* path= */ void 0, n);
try {
return new pn(...e.split("."))._internalPath;
} catch (r) {
throw zn(`Invalid field path (${e}). Paths must not be empty, begin with '.', end with '.', or contain '..'`, t,
/* hasConverter= */ !1,
/* path= */ void 0, n);
}
}
function zn(t, e, n, r, s) {
const i = r && !r.isEmpty(), o = void 0 !== s;
let u = `Function ${e}() called with invalid data`;
n && (u += " (via `toFirestore()`)"), u += ". ";
let c = "";
return (i || o) && (c += " (found", i && (c += ` in field ${r}`), o && (c += ` in document ${s}`),
c += ")"), new U(A, u + t + c);
}
/** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */ function Wn(t, e) {
return t.some((t => t.isEqual(e)));
}
/**
* @license
* Copyright 2020 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/**
* A `DocumentSnapshot` contains data read from a document in your Firestore
* database. The data can be extracted with `.data()` or `.get(<field>)` to
* get a specific field.
*
* For a `DocumentSnapshot` that points to a non-existing document, any data
* access will return 'undefined'. You can use the `exists()` method to
* explicitly verify a document's existence.
*/ class Gn {
// Note: This class is stripped down version of the DocumentSnapshot in
// the legacy SDK. The changes are:
// - No support for SnapshotMetadata.
// - No support for SnapshotOptions.
/** @hideconstructor protected */
constructor(t, e, n, r, s) {
this._firestore = t, this._userDataWriter = e, this._key = n, this._document = r,
this._converter = s;
}
/** Property of the `DocumentSnapshot` that provides the document's ID. */ get id() {
return this._key.path.lastSegment();
}
/**
* The `DocumentReference` for the document included in the `DocumentSnapshot`.
*/ get ref() {
return new cn(this._firestore, this._converter, this._key);
}
/**
* Signals whether or not the document at the snapshot's location exists.
*
* @returns true if the document exists.
*/ exists() {
return null !== this._document;
}
/**
* Retrieves all fields in the document as an `Object`. Returns `undefined` if
* the document doesn't exist.
*
* @returns An `Object` containing all fields in the document or `undefined`
* if the document doesn't exist.
*/ data() {
if (this._document) {
if (this._converter) {
// We only want to use the converter and create a new DocumentSnapshot
// if a converter has been provided.
const t = new Hn(this._firestore, this._userDataWriter, this._key, this._document,
/* converter= */ null);
return this._converter.fromFirestore(t);
}
return this._userDataWriter.convertValue(this._document.data.value);
}
}
/**
* Retrieves the field specified by `fieldPath`. Returns `undefined` if the
* document or field doesn't exist.
*
* @param fieldPath - The path (for example 'foo' or 'foo.bar') to a specific
* field.
* @returns The data at the specified field location or undefined if no such
* field exists in the document.
*/
// We are using `any` here to avoid an explicit cast by our users.
// eslint-disable-next-line @typescript-eslint/no-explicit-any
get(t) {
if (this._document) {
const e = this._document.data.field(Jn("DocumentSnapshot.get", t));
if (null !== e) return this._userDataWriter.convertValue(e);
}
}
}
/**
* A `QueryDocumentSnapshot` contains data read from a document in your
* Firestore database as part of a query. The document is guaranteed to exist
* and its data can be extracted with `.data()` or `.get(<field>)` to get a
* specific field.
*
* A `QueryDocumentSnapshot` offers the same API surface as a
* `DocumentSnapshot`. Since query results contain only existing documents, the
* `exists` property will always be true and `data()` will never return
* 'undefined'.
*/ class Hn extends Gn {
/**
* Retrieves all fields in the document as an `Object`.
*
* @override
* @returns An `Object` containing all fields in the document.
*/
data() {
return super.data();
}
}
/**
* A `QuerySnapshot` contains zero or more `DocumentSnapshot` objects
* representing the results of a query. The documents can be accessed as an
* array via the `docs` property or enumerated using the `forEach` method. The
* number of documents can be determined via the `empty` and `size`
* properties.
*/ class Yn {
/** @hideconstructor */
constructor(t, e) {
this._docs = e, this.query = t;
}
/** An array of all the documents in the `QuerySnapshot`. */ get docs() {
return [ ...this._docs ];
}
/** The number of documents in the `QuerySnapshot`. */ get size() {
return this.docs.length;
}
/** True if there are no documents in the `QuerySnapshot`. */ get empty() {
return 0 === this.docs.length;
}
/**
* Enumerates all of the documents in the `QuerySnapshot`.
*
* @param callback - A callback to be called with a `QueryDocumentSnapshot` for
* each document in the snapshot.
* @param thisArg - The `this` binding for the callback.
*/ forEach(t, e) {
this._docs.forEach(t, e);
}
}
/**
* Returns true if the provided snapshots are equal.
*
* @param left - A snapshot to compare.
* @param right - A snapshot to compare.
* @returns true if the snapshots are equal.
*/ function Kn(t, e) {
return t = c(t), e = c(e), t instanceof Gn && e instanceof Gn ? 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 Yn && e instanceof Yn && (mn(t.query, e.query) && pt(t.docs, e.docs, Kn));
}
/**
* Helper that calls fromDotSeparatedString() but wraps any error thrown.
*/ function Jn(t, e) {
return "string" == typeof e ? Qn(t, e) : e instanceof pn ? e._internalPath : e._delegate._internalPath;
}
/**
* @license
* Copyright 2020 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/**
* A `QueryConstraint` is used to narrow the set of documents returned by a
* Firestore query. `QueryConstraint`s are created by invoking {@link where},
* {@link orderBy}, {@link (startAt:1)}, {@link (startAfter:1)}, {@link
* endBefore:1}, {@link (endAt:1)}, {@link limit} or {@link limitToLast} and
* can then be passed to {@link query} to create a new query instance that
* also contains this `QueryConstraint`.
*/
class Zn {}
/**
* Creates a new immutable instance of `Query` that is extended to also include
* additional query constraints.
*
* @param query - The Query instance to use as a base for the new constraints.
* @param queryConstraints - The list of `QueryConstraint`s to apply.
* @throws if any of the provided query constraints cannot be combined with the
* existing or new constraints.
*/ function Xn(t, ...e) {
for (const n of e) t = n._apply(t);
return t;
}
class tr extends Zn {
constructor(t, e, n) {
super(), this._t = t, this.gt = e, this.bt = n, this.type = "where";
}
_apply(t) {
const e = Rn(t.firestore), n = function(t, e, n, r, s, i, o) {
let u;
if (s.isKeyField()) {
if ("array-contains" /* ARRAY_CONTAINS */ === i || "array-contains-any" /* ARRAY_CONTAINS_ANY */ === i) throw new U(A, `Invalid Query. You can't perform '${i}' queries on FieldPath.documentId().`);
if ("in" /* IN */ === i || "not-in" /* NOT_IN */ === i) {
mr(o, i);
const e = [];
for (const n of o) e.push(wr(r, t, n));
u = {
arrayValue: {
values: e
}
};
} else u = wr(r, t, o);
} else "in" /* IN */ !== i && "not-in" /* NOT_IN */ !== i && "array-contains-any" /* ARRAY_CONTAINS_ANY */ !== i || mr(o, i),
u = Cn(n, e, o,
/* allowArrays= */ "in" /* IN */ === i || "not-in" /* NOT_IN */ === i);
const c = zt.create(s, i, u);
return function(t, e) {
if (e.S()) {
const n = ue(t);
if (null !== n && !n.isEqual(e.field)) throw new U(A, `Invalid query. All where filters with an inequality (<, <=, !=, not-in, >, or >=) must be on the same field. But you have inequality filters on '${n.toString()}' and '${e.field.toString()}'`);
const r = oe(t);
null !== r && pr(t, e.field, r);
}
const n = function(t, e) {
for (const n of t.filters) if (e.indexOf(n.op) >= 0) return n.op;
return null;
}(t,
/**
* Given an operator, returns the set of operators that cannot be used with it.
*
* Operators in a query must adhere to the following set of rules:
* 1. Only one array operator is allowed.
* 2. Only one disjunctive operator is allowed.
* 3. NOT_EQUAL cannot be used with another NOT_EQUAL operator.
* 4. NOT_IN cannot be used with array, disjunctive, or NOT_EQUAL operators.
*
* Array operators: ARRAY_CONTAINS, ARRAY_CONTAINS_ANY
* Disjunctive operators: IN, ARRAY_CONTAINS_ANY, NOT_IN
*/
function(t) {
switch (t) {
case "!=" /* NOT_EQUAL */ :
return [ "!=" /* NOT_EQUAL */ , "not-in" /* NOT_IN */ ];
case "array-contains" /* ARRAY_CONTAINS */ :
return [ "array-contains" /* ARRAY_CONTAINS */ , "array-contains-any" /* ARRAY_CONTAINS_ANY */ , "not-in" /* NOT_IN */ ];
case "in" /* IN */ :
return [ "array-contains-any" /* ARRAY_CONTAINS_ANY */ , "in" /* IN */ , "not-in" /* NOT_IN */ ];
case "array-contains-any" /* ARRAY_CONTAINS_ANY */ :
return [ "array-contains" /* ARRAY_CONTAINS */ , "array-contains-any" /* ARRAY_CONTAINS_ANY */ , "in" /* IN */ , "not-in" /* NOT_IN */ ];
case "not-in" /* NOT_IN */ :
return [ "array-contains" /* ARRAY_CONTAINS */ , "array-contains-any" /* ARRAY_CONTAINS_ANY */ , "in" /* IN */ , "not-in" /* NOT_IN */ , "!=" /* NOT_EQUAL */ ];
default:
return [];
}
}(e.op));
if (null !== n)
// Special case when it's a duplicate op to give a slightly clearer error message.
throw n === e.op ? new U(A, `Invalid query. You cannot use more than one '${e.op.toString()}' filter.`) : new U(A, `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.gt, this.bt);
return new an(t.firestore, t.converter, function(t, e) {
const n = t.filters.concat([ e ]);
return new se(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
}(t._query, n));
}
}
/**
* Creates a `QueryConstraint` that enforces that documents must contain the
* specified field and that the value should satisfy the relation constraint
* provided.
*
* @param fieldPath - The path to compare
* @param opStr - The operation string (e.g "<", "<=", "==", "<",
* "<=", "!=").
* @param value - The value for comparison
* @returns The created `Query`.
*/ function er(t, e, n) {
const r = e, s = Jn("where", t);
return new tr(s, r, n);
}
class nr extends Zn {
constructor(t, e) {
super(), this._t = t, this.vt = e, this.type = "orderBy";
}
_apply(t) {
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 ee(e, n);
return function(t, e) {
if (null === oe(t)) {
// This is the first order by. It must match any inequality.
const n = ue(t);
null !== n && pr(t, n, e.field);
}
}(t, r), r;
}
/**
* Create a Bound from a query and a document.
*
* Note that the Bound will always include the key of the document
* and so only the provided document will compare equal to the returned
* position.
*
* 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.vt);
return new an(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 se(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
}(t._query, e));
}
}
/**
* Creates a `QueryConstraint` that sorts the query result by the
* specified field, optionally in descending order instead of ascending.
*
* @param fieldPath - The field to sort by.
* @param directionStr - Optional direction to sort by ('asc' or 'desc'). If
* not specified, order will be ascending.
* @returns The created `Query`.
*/ function rr(t, e = "asc") {
const n = e, r = Jn("orderBy", t);
return new nr(r, n);
}
class sr extends Zn {
constructor(t, e, n) {
super(), this.type = t, this.Et = e, this.Tt = n;
}
_apply(t) {
return new an(t.firestore, t.converter, function(t, e, n) {
return new se(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);
}(t._query, this.Et, this.Tt));
}
}
/**
* Creates a `QueryConstraint` that only returns the first matching documents.
*
* @param limit - The maximum number of items to return.
* @returns The created `Query`.
*/ function ir(t) {
return it("limit", t), new sr("limit", t, "F" /* First */);
}
/**
* Creates a `QueryConstraint` that only returns the last matching documents.
*
* You must specify at least one `orderBy` clause for `limitToLast` queries,
* otherwise an exception will be thrown during execution.
*
* @param limit - The maximum number of items to return.
* @returns The created `Query`.
*/ function or(t) {
return it("limitToLast", t), new sr("limitToLast", t, "L" /* Last */);
}
class ur extends Zn {
constructor(t, e, n) {
super(), this.type = t, this.It = e, this.At = n;
}
_apply(t) {
const e = dr(t, this.type, this.It, this.At);
return new an(t.firestore, t.converter, function(t, e) {
return new se(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
}(t._query, e));
}
}
function cr(...t) {
return new ur("startAt", t, /*before=*/ !0);
}
function ar(...t) {
return new ur("startAfter", t,
/*before=*/ !1);
}
class hr extends Zn {
constructor(t, e, n) {
super(), this.type = t, this.It = e, this.At = n;
}
_apply(t) {
const e = dr(t, this.type, this.It, this.At);
return new an(t.firestore, t.converter, function(t, e) {
return new se(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
}(t._query, e));
}
}
function lr(...t) {
return new hr("endBefore", t, /*before=*/ !0);
}
function fr(...t) {
return new hr("endAt", t, /*before=*/ !1);
}
/** Helper function to create a bound from a document or fields */ function dr(t, e, n, r) {
if (n[0] = c(n[0]), n[0] instanceof Gn) return function(t, e, n, r, s) {
if (!r) throw new U(R, `Can't use a DocumentSnapshot that doesn't exist for ${n}().`);
const i = [];
// Because people expect to continue/end a query at the exact document
// provided, we need to use the implicit sort order rather than the explicit
// sort order, because it's guaranteed to contain the document key. That way
// the position becomes unambiguous and the query continues/ends exactly at
// 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 ae(t)) if (n.field.isKeyField()) i.push(xt(e, r.key)); else {
const t = r.data.field(n.field);
if (Rt(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) {
const t = n.field.canonicalString();
throw new U(A, `Invalid query. You are trying to start or end a query using a document for which the field '${t}' (used as the orderBy) does not exist.`);
}
i.push(t);
}
return new te(i, s);
}
/**
* Converts a list of field values to a Bound for the given query.
*/ (t._query, t.firestore._databaseId, e, n[0]._document, r);
{
const s = Rn(t.firestore);
return function(t, e, n, r, s, i) {
// Use explicit order by's because it has to match the query the user made
const o = t.explicitOrderBy;
if (s.length > o.length) throw new U(A, `Too many arguments provided to ${r}(). The number of arguments must be less than or equal to the number of orderBy() clauses`);
const u = [];
for (let i = 0; i < s.length; i++) {
const c = s[i];
if (o[i].field.isKeyField()) {
if ("string" != typeof c) throw new U(A, `Invalid query. Expected a string for document ID in ${r}(), but got a ${typeof c}`);
if (!ce(t) && -1 !== c.indexOf("/")) throw new U(A, `Invalid query. When querying a collection and ordering by FieldPath.documentId(), the value passed to ${r}() must be a plain document ID, but '${c}' contains a slash.`);
const n = t.path.child(K.fromString(c));
if (!X.isDocumentKey(n)) throw new U(A, `Invalid query. When querying a collection group and ordering by FieldPath.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 X(n);
u.push(xt(e, s));
} else {
const t = Cn(n, r, c);
u.push(t);
}
}
return new te(u, i);
}
/**
* Parses the given documentIdValue into a ReferenceValue, throwing
* appropriate errors if the value is anything other than a DocumentReference
* or String, or if the string is malformed.
*/ (t._query, t.firestore._databaseId, s, e, n, r);
}
}
function wr(t, e, n) {
if ("string" == typeof (n = c(n))) {
if ("" === n) throw new U(A, "Invalid query. When querying with FieldPath.documentId(), you must provide a valid document ID, but it was an empty string.");
if (!ce(e) && -1 !== n.indexOf("/")) throw new U(A, `Invalid query. When querying a collection by FieldPath.documentId(), you must provide a plain document ID, but '${n}' contains a '/' character.`);
const r = e.path.child(K.fromString(n));
if (!X.isDocumentKey(r)) throw new U(A, `Invalid query. When querying a collection group by FieldPath.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 xt(t, new X(r));
}
if (n instanceof cn) return xt(t, n._key);
throw new U(A, `Invalid query. When querying with FieldPath.documentId(), you must provide a valid string or a DocumentReference, but it was: ${rt(n)}.`);
}
/**
* Validates that the value passed into a disjunctive filter satisfies all
* array requirements.
*/ function mr(t, e) {
if (!Array.isArray(t) || 0 === t.length) throw new U(A, `Invalid Query. A non-empty array is required for '${e.toString()}' filters.`);
if (t.length > 10) throw new U(A, `Invalid Query. '${e.toString()}' filters support a maximum of 10 elements in the value array.`);
}
function pr(t, e, n) {
if (!n.isEqual(e)) throw new U(A, `Invalid query. You have a where filter with an inequality (<, <=, !=, not-in, >, or >=) on field '${e.toString()}' and so you must also use '${e.toString()}' as your first argument to orderBy(), but your first orderBy() is on field '${n.toString()}' instead.`);
}
/**
* @license
* Copyright 2020 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/**
* Converts Firestore's internal types to the JavaScript types that we expose
* to the user.
*
* @internal
*/
/**
* @license
* Copyright 2020 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/**
* Converts custom model object of type T into DocumentData by applying the
* converter if it exists.
*
* This function is used when converting user objects to DocumentData
* because we want to provide the user with a more specific error message if
* their set() or fails due to invalid data originating from a toFirestore()
* call.
*/
function yr(t, e, n) {
let r;
// Cast to `any` in order to satisfy the union type constraint on
// toFirestore().
// eslint-disable-next-line @typescript-eslint/no-explicit-any
return r = t ? n && (n.merge || n.mergeFields) ? t.toFirestore(e, n) : t.toFirestore(e) : e,
r;
}
class _r extends class {
convertValue(t, e = "none") {
switch (Dt(t)) {
case 0 /* NullValue */ :
return null;
case 1 /* BooleanValue */ :
return t.booleanValue;
case 2 /* NumberValue */ :
return At(t.integerValue || t.doubleValue);
case 3 /* TimestampValue */ :
return this.convertTimestamp(t.timestampValue);
case 4 /* ServerTimestampValue */ :
return this.convertServerTimestamp(t, e);
case 5 /* StringValue */ :
return t.stringValue;
case 6 /* BlobValue */ :
return this.convertBytes(Pt(t.bytesValue));
case 7 /* RefValue */ :
return this.convertReference(t.referenceValue);
case 8 /* GeoPointValue */ :
return this.convertGeoPoint(t.geoPointValue);
case 9 /* ArrayValue */ :
return this.convertArray(t.arrayValue, e);
case 10 /* ObjectValue */ :
return this.convertObject(t.mapValue, e);
default:
throw g();
}
}
convertObject(t, e) {
const n = {};
return bt(t.fields, ((t, r) => {
n[t] = this.convertValue(r, e);
})), n;
}
convertGeoPoint(t) {
return new bn(At(t.latitude), At(t.longitude));
}
convertArray(t, e) {
return (t.values || []).map((t => this.convertValue(t, e)));
}
convertServerTimestamp(t, e) {
switch (e) {
case "previous":
const n = Vt(t);
return null == n ? null : this.convertValue(n, e);
case "estimate":
return this.convertTimestamp(Nt(t));
default:
return null;
}
}
convertTimestamp(t) {
const e = It(t);
return new yt(e.seconds, e.nanos);
}
convertDocumentKey(t, e) {
const n = K.fromString(t);
b(We(n));
const r = new H(n.get(1), n.get(3)), s = new X(n.popFirst(5));
return r.isEqual(e) ||
// TODO(b/64130202): Somehow support foreign references.
p(`Document ${s} contains a document reference within a different database (${r.projectId}/${r.database}) which is not supported. It will be treated as a reference in the current database (${e.projectId}/${e.database}) instead.`),
s;
}
} {
constructor(t) {
super(), this.firestore = t;
}
convertBytes(t) {
return new _n(t);
}
convertReference(t) {
const e = this.convertDocumentKey(t, this.firestore._databaseId);
return new cn(this.firestore, /* converter= */ null, e);
}
}
/**
* Reads the document referred to by the specified document reference.
*
* All documents are directly fetched from the server, even if the document was
* previously read or modified. Recent modifications are only reflected in the
* retrieved `DocumentSnapshot` if they have already been applied by the
* backend. If the client is offline, the read fails. If you like to use
* caching or see local modifications, please use the full Firestore SDK.
*
* @param reference - The reference of the document to fetch.
* @returns A Promise resolved with a `DocumentSnapshot` containing the current
* document contents.
*/ function gr(t) {
const e = tn((t = st(t, cn)).firestore), n = new _r(t.firestore);
return Je(e, [ t._key ]).then((e => {
b(1 === e.length);
const r = e[0];
return new Gn(t.firestore, n, t._key, r.isFoundDocument() ? r : null, t.converter);
}));
}
/**
* Executes the query and returns the results as a {@link QuerySnapshot}.
*
* All queries are executed directly by the server, even if the the query was
* previously executed. Recent modifications are only reflected in the retrieved
* results if they have already been applied by the backend. If the client is
* offline, the operation fails. To see previously cached result and local
* modifications, use the full Firestore SDK.
*
* @param query - The `Query` to execute.
* @returns A Promise that will be resolved with the results of the query.
*/ function br(t) {
!function(t) {
if (ie(t) && 0 === t.explicitOrderBy.length) throw new U(x, "limitToLast() queries require specifying at least one orderBy() clause");
}((t = st(t, an))._query);
const e = tn(t.firestore), n = new _r(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 ie(t._query) &&
// Limit to last queries reverse the orderBy constraint that was
// specified by the user. As such, we need to reverse the order of the
// results to return the documents in the expected order.
r.reverse(), new Yn(t, r);
}));
}
function vr(t, e, n) {
const r = yr((t = st(t, cn)).converter, e, n), s = Vn(Rn(t.firestore), "setDoc", t._key, r, null !== t.converter, n);
return Ke(tn(t.firestore), [ s.toMutation(t._key, ge.none()) ]);
}
function Er(t, e, n, ...r) {
const s = Rn((t = st(t, cn)).firestore);
// For Compat types, we have to "extract" the underlying types before
// performing validation.
let i;
i = "string" == typeof (e = c(e)) || e instanceof pn ? On(s, "updateDoc", t._key, e, n, r) : xn(s, "updateDoc", t._key, e);
return Ke(tn(t.firestore), [ i.toMutation(t._key, ge.exists(!0)) ]);
}
/**
* Deletes the document referred to by the specified `DocumentReference`.
*
* The deletion will only be reflected in document reads that occur after the
* returned Promise resolves. If the client is offline, the
* delete fails. If you would like to see local modifications or buffer writes
* until the client is online, use the full Firestore SDK.
*
* @param reference - A reference to the document to delete.
* @returns A Promise resolved once the document has been successfully
* deleted from the backend.
*/ function Tr(t) {
return Ke(tn((t = st(t, cn)).firestore), [ new Te(t._key, ge.none()) ]);
}
/**
* Add a new document to specified `CollectionReference` with the given data,
* assigning it a document ID automatically.
*
* The result of this write will only be reflected in document reads that occur
* after the returned Promise resolves. If the client is offline, the
* write fails. If you would like to see local modifications or buffer writes
* until the client is online, use the full Firestore SDK.
*
* @param reference - A reference to the collection to add this document to.
* @param data - An Object containing the data for the new document.
* @returns A Promise resolved with a `DocumentReference` pointing to the
* newly created document after it has been written to the backend.
*/ function Ir(t, e) {
const n = dn(t = st(t, hn)), r = yr(t.converter, e), s = Vn(Rn(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
return Ke(tn(t.firestore), [ s.toMutation(n._key, ge.exists(!1)) ]).then((() => n));
}
/**
* @license
* Copyright 2020 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/**
* Returns a sentinel for use with {@link @firebase/firestore/lite#(updateDoc:1)} or
* {@link @firebase/firestore/lite#(setDoc:1)} with `{merge: true}` to mark a field for deletion.
*/ function Ar() {
return new Nn("deleteField");
}
/**
* Returns a sentinel used with {@link @firebase/firestore/lite#(setDoc:1)} or {@link @firebase/firestore/lite#(updateDoc:1)} to
* include a server-generated timestamp in the written data.
*/ function Pr() {
return new $n("serverTimestamp");
}
/**
* Returns a special value that can be used with {@link @firebase/firestore/lite#(setDoc:1)} or {@link
* @firebase/firestore/lite#(updateDoc:1)} that tells the server to union the given elements with any array
* value that already exists on the server. Each specified element that doesn't
* already exist in the array will be added to the end. If the field being
* modified is not already an array it will be overwritten with an array
* containing exactly the specified elements.
*
* @param elements - The elements to union into the array.
* @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
* `updateDoc()`.
*/ function Rr(...t) {
// NOTE: We don't actually parse the data until it's used in set() or
// update() since we'd need the Firestore instance to do this.
return new Fn("arrayUnion", t);
}
/**
* Returns a special value that can be used with {@link (setDoc:1)} or {@link
* updateDoc:1} that tells the server to remove the given elements from any
* array value that already exists on the server. All instances of each element
* specified will be removed from the array. If the field being modified is not
* already an array it will be overwritten with an empty array.
*
* @param elements - The elements to remove from the array.
* @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
* `updateDoc()`
*/ function Vr(...t) {
// NOTE: We don't actually parse the data until it's used in set() or
// update() since we'd need the Firestore instance to do this.
return new Sn("arrayRemove", t);
}
/**
* Returns a special value that can be used with {@link @firebase/firestore/lite#(setDoc:1)} or {@link
* @firebase/firestore/lite#(updateDoc:1)} that tells the server to increment the field's current value by
* the given value.
*
* If either the operand or the current field value uses floating point
* precision, all arithmetic follows IEEE 754 semantics. If both values are
* integers, values outside of JavaScript's safe number range
* (`Number.MIN_SAFE_INTEGER` to `Number.MAX_SAFE_INTEGER`) are also subject to
* precision loss. Furthermore, once processed by the Firestore backend, all
* integer operations are capped between -2^63 and 2^63-1.
*
* If the current field value is not of type `number`, or if the field does not
* yet exist, the transformation sets the field to the given value.
*
* @param n - The value to increment by.
* @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
* `updateDoc()`
*/ function Nr(t) {
return new qn("increment", t);
}
/**
* @license
* Copyright 2020 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/**
* A write batch, used to perform multiple writes as a single atomic unit.
*
* A `WriteBatch` object can be acquired by calling {@link writeBatch}. It
* provides methods for adding writes to the write batch. None of the writes
* will be committed (or visible locally) until {@link WriteBatch.commit} is
* called.
*/ class Dr {
/** @hideconstructor */
constructor(t, e) {
this._firestore = t, this._commitHandler = e, this._mutations = [], this._committed = !1,
this._dataReader = Rn(t);
}
set(t, e, n) {
this._verifyNotCommitted();
const r = $r(t, this._firestore), s = yr(r.converter, e, n), i = Vn(this._dataReader, "WriteBatch.set", r._key, s, null !== r.converter, n);
return this._mutations.push(i.toMutation(r._key, ge.none())), this;
}
update(t, e, n, ...r) {
this._verifyNotCommitted();
const s = $r(t, this._firestore);
// For Compat types, we have to "extract" the underlying types before
// performing validation.
let i;
return i = "string" == typeof (e = c(e)) || e instanceof pn ? On(this._dataReader, "WriteBatch.update", s._key, e, n, r) : xn(this._dataReader, "WriteBatch.update", s._key, e),
this._mutations.push(i.toMutation(s._key, ge.exists(!0))), this;
}
/**
* Deletes the document referred to by the provided {@link DocumentReference}.
*
* @param documentRef - A reference to the document to be deleted.
* @returns This `WriteBatch` instance. Used for chaining method calls.
*/ delete(t) {
this._verifyNotCommitted();
const e = $r(t, this._firestore);
return this._mutations = this._mutations.concat(new Te(e._key, ge.none())), this;
}
/**
* Commits all of the writes in this write batch as a single atomic unit.
*
* The result of these writes will only be reflected in document reads that
* occur after the returned Promise resolves. If the client is offline, the
* write fails. If you would like to see local modifications or buffer writes
* until the client is online, use the full Firestore SDK.
*
* @returns A Promise resolved once all of the writes in the batch have been
* successfully written to the backend as an atomic unit (note that it won't
* resolve while you're offline).
*/ commit() {
return this._verifyNotCommitted(), this._committed = !0, this._mutations.length > 0 ? this._commitHandler(this._mutations) : Promise.resolve();
}
_verifyNotCommitted() {
if (this._committed) throw new U(F, "A write batch can no longer be used after commit() has been called.");
}
}
function $r(t, e) {
if ((t = c(t)).firestore !== e) throw new U(A, "Provided document reference is from a different Firestore instance.");
return t;
}
/**
* Creates a write batch, used for performing multiple writes as a single
* atomic operation. The maximum number of writes allowed in a single WriteBatch
* is 500.
*
* The result of these writes will only be reflected in document reads that
* occur after the returned Promise resolves. If the client is offline, the
* write fails. If you would like to see local modifications or buffer writes
* until the client is online, use the full Firestore SDK.
*
* @returns A `WriteBatch` that can be used to atomically execute multiple
* writes.
*/ function Fr(t) {
const e = tn(t = st(t, nn));
return new Dr(t, (t => Ke(e, t)));
}
/**
* @license
* Copyright 2017 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/**
* Internal transaction object responsible for accumulating the mutations to
* perform and the base versions for any documents read.
*/ class Sr {
constructor(t) {
this.datastore = t,
// The version of each document that was read during this transaction.
this.readVersions = new Map, this.mutations = [], this.committed = !1,
/**
* A deferred usage error that occurred previously in this transaction that
* will cause the transaction to fail once it actually commits.
*/
this.lastWriteError = null,
/**
* Set of documents that have been written in the transaction.
*
* When there's more than one write to the same key in a transaction, any
* writes after the first are handled differently.
*/
this.writtenDocs = new Set;
}
async lookup(t) {
if (this.ensureCommitNotCalled(), this.mutations.length > 0) throw new U(A, "Firestore transactions require all reads to be executed before all writes.");
const e = await Je(this.datastore, t);
return e.forEach((t => this.recordVersion(t))), e;
}
set(t, e) {
this.write(e.toMutation(t, this.precondition(t))), this.writtenDocs.add(t.toString());
}
update(t, e) {
try {
this.write(e.toMutation(t, this.preconditionForUpdate(t)));
} catch (t) {
this.lastWriteError = t;
}
this.writtenDocs.add(t.toString());
}
delete(t) {
this.write(new Te(t, this.precondition(t))), this.writtenDocs.add(t.toString());
}
async commit() {
if (this.ensureCommitNotCalled(), this.lastWriteError) throw this.lastWriteError;
const t = this.readVersions;
// For each mutation, note that the doc was written.
this.mutations.forEach((e => {
t.delete(e.key.toString());
})),
// For each document that was read but not written to, we want to perform
// a `verify` operation.
t.forEach(((t, e) => {
const n = X.fromPath(e);
this.mutations.push(new Ie(n, this.precondition(n)));
})), await Ke(this.datastore, this.mutations), this.committed = !0;
}
recordVersion(t) {
let e;
if (t.isFoundDocument()) e = t.version; else {
if (!t.isNoDocument()) throw g();
// For deleted docs, we must use baseVersion 0 when we overwrite them.
e = _t.min();
}
const n = this.readVersions.get(t.key.toString());
if (n) {
if (!e.isEqual(n))
// This transaction will fail no matter what.
throw new U(S, "Document version changed between two reads.");
} else this.readVersions.set(t.key.toString(), e);
}
/**
* Returns the version of this document when it was read in this transaction,
* as a precondition, or no precondition if it was not read.
*/ precondition(t) {
const e = this.readVersions.get(t.toString());
return !this.writtenDocs.has(t.toString()) && e ? ge.updateTime(e) : ge.none();
}
/**
* Returns the precondition for a document if the operation is an update.
*/ preconditionForUpdate(t) {
const e = this.readVersions.get(t.toString());
// The first time a document is written, we want to take into account the
// read time and existence
if (!this.writtenDocs.has(t.toString()) && e) {
if (e.isEqual(_t.min()))
// The document doesn't exist, so fail the transaction.
// This has to be validated locally because you can't send a
// precondition that a document does not exist without changing the
// semantics of the backend write to be an insert. This is the reverse
// of what we want, since we want to assert that the document doesn't
// exist but then send the update and have it fail. Since we can't
// express that to the backend, we have to validate locally.
// Note: this can change once we can send separate verify writes in the
// transaction.
throw new U(A, "Can't update a document that doesn't exist.");
// Document exists, base precondition on document update time.
return ge.updateTime(e);
}
// Document was not read, so we just use the preconditions for a blind
// update.
return ge.exists(!0);
}
write(t) {
this.ensureCommitNotCalled(), this.mutations.push(t);
}
ensureCommitNotCalled() {}
}
/**
* @license
* Copyright 2019 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/**
* TransactionRunner encapsulates the logic needed to run and retry transactions
* with backoff.
*/
class qr {
constructor(t, e, n, r) {
this.asyncQueue = t, this.datastore = e, this.updateFunction = n, this.deferred = r,
this.Pt = 5, this.Rt = new He(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
}
/** Runs the transaction and sets the result on deferred. */ run() {
this.Pt -= 1, this.Vt();
}
Vt() {
this.Rt.K((async () => {
const t = new Sr(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);
}))));
})).catch((t => {
this.Dt(t);
}));
}));
}
Nt(t) {
try {
const e = this.updateFunction(t);
return !ot(e) && e.catch && e.then ? e : (this.deferred.reject(Error("Transaction callback must return a Promise")),
null);
} catch (t) {
// Do not retry errors thrown by user provided updateFunction.
return this.deferred.reject(t), null;
}
}
Dt(t) {
this.Pt > 0 && this.$t(t) ? (this.Pt -= 1, this.asyncQueue.enqueueAndForget((() => (this.Vt(),
Promise.resolve())))) : this.deferred.reject(t);
}
$t(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 || !
/**
* Determines whether an error code represents a permanent error when received
* in response to a non-write operation.
*
* See isPermanentWriteError for classifying write errors.
*/
function(t) {
switch (t) {
case E:
return g();
case T:
case I:
case P:
case $:
case O:
case C:
// Unauthenticated means something went wrong with our token and we need
// to retry with new credentials which will happen automatically.
case D:
return !1;
case A:
case R:
case V:
case N:
case F:
// Aborted might be retried in some scenarios, but that is dependant on
// the context and should handled individually by the calling code.
// See https://cloud.google.com/apis/design/errors.
case S:
case q:
case x:
case L:
return !0;
default:
return g();
}
}(e);
}
return !1;
}
}
/**
* @license
* Copyright 2020 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/** The Platform's 'document' implementation or null if not available. */ function xr() {
// `document` is not always available, e.g. in ReactNative and WebWorkers.
// eslint-disable-next-line no-restricted-globals
return "undefined" != typeof document ? document : null;
}
/**
* @license
* Copyright 2017 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/**
* Represents an operation scheduled to be run in the future on an AsyncQueue.
*
* It is created via DelayedOperation.createAndSchedule().
*
* Supports cancellation (via cancel()) and early execution (via skipDelay()).
*
* Note: We implement `PromiseLike` instead of `Promise`, as the `Promise` type
* in newer versions of TypeScript defines `finally`, which is not available in
* IE.
*/ class Or {
constructor(t, e, n, r, s) {
this.asyncQueue = t, this.timerId = e, this.targetTimeMs = n, this.op = r, this.removalCallback = s,
this.deferred = new j, this.then = this.deferred.promise.then.bind(this.deferred.promise),
// It's normal for the deferred promise to be canceled (due to cancellation)
// and so we attach a dummy catch callback to avoid
// 'UnhandledPromiseRejectionWarning' log spam.
this.deferred.promise.catch((t => {}));
}
/**
* Creates and returns a DelayedOperation that has been scheduled to be
* executed on the provided asyncQueue after the provided delayMs.
*
* @param asyncQueue - The queue to schedule the operation on.
* @param id - A Timer ID identifying the type of operation this is.
* @param delayMs - The delay (ms) before the operation should be scheduled.
* @param op - The operation to run.
* @param removalCallback - A callback to be called synchronously once the
* operation is executed or canceled, notifying the AsyncQueue to remove it
* from its delayedOperations list.
* PORTING NOTE: This exists to prevent making removeDelayedOperation() and
* the DelayedOperation class public.
*/ static createAndSchedule(t, e, n, r, s) {
const i = Date.now() + n, o = new Or(t, e, i, r, s);
return o.start(n), o;
}
/**
* Starts the timer. This is called immediately after construction by
* createAndSchedule().
*/ start(t) {
this.timerHandle = setTimeout((() => this.handleDelayElapsed()), t);
}
/**
* Queues the operation to run immediately (if it hasn't already been run or
* canceled).
*/ skipDelay() {
return this.handleDelayElapsed();
}
/**
* Cancels the operation if it hasn't already been executed or canceled. The
* promise will be rejected.
*
* As long as the operation has not yet been run, calling cancel() provides a
* guarantee that the operation will not be run.
*/ cancel(t) {
null !== this.timerHandle && (this.clearTimeout(), this.deferred.reject(new U(T, "Operation cancelled" + (t ? ": " + t : ""))));
}
handleDelayElapsed() {
this.asyncQueue.enqueueAndForget((() => null !== this.timerHandle ? (this.clearTimeout(),
this.op().then((t => this.deferred.resolve(t)))) : Promise.resolve()));
}
clearTimeout() {
null !== this.timerHandle && (this.removalCallback(this), clearTimeout(this.timerHandle),
this.timerHandle = null);
}
}
/**
* @license
* Copyright 2020 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/ class Cr {
constructor() {
// The last promise in the queue.
this.Ft = Promise.resolve(),
// A list of retryable operations. Retryable operations are run in order and
// retried with backoff.
this.St = [],
// Is this AsyncQueue being shut down? Once it is set to true, it will not
// be changed again.
this.qt = !1,
// Operations scheduled to be queued in the future. Operations are
// automatically removed after they are run or canceled.
this.xt = [],
// visible for testing
this.Ot = null,
// Flag set while there's an outstanding AsyncQueue operation, used for
// assertion sanity-checks.
this.Ct = !1,
// Enabled during shutdown on Safari to prevent future access to IndexedDB.
this.Lt = !1,
// List of TimerIds to fast-forward delays for.
this.Ut = [],
// Backoff timer used to schedule retries for retryable operations
this.Rt = new He(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.jt = () => {
const t = xr();
t && m("AsyncQueue", "Visibility state changed to " + t.visibilityState), this.Rt.Z();
};
const t = xr();
t && "function" == typeof t.addEventListener && t.addEventListener("visibilitychange", this.jt);
}
get isShuttingDown() {
return this.qt;
}
/**
* Adds a new operation to the queue without waiting for it to complete (i.e.
* we ignore the Promise result).
*/ enqueueAndForget(t) {
// eslint-disable-next-line @typescript-eslint/no-floating-promises
this.enqueue(t);
}
enqueueAndForgetEvenWhileRestricted(t) {
this.kt(),
// eslint-disable-next-line @typescript-eslint/no-floating-promises
this.Mt(t);
}
enterRestrictedMode(t) {
if (!this.qt) {
this.qt = !0, this.Lt = t || !1;
const e = xr();
e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.jt);
}
}
enqueue(t) {
if (this.kt(), this.qt)
// 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 j;
return this.Mt((() => this.qt && this.Lt ? Promise.resolve() : (t().then(e.resolve, e.reject),
e.promise))).then((() => e.promise));
}
enqueueRetryable(t) {
this.enqueueAndForget((() => (this.St.push(t), this.Bt())));
}
/**
* Runs the next operation from the retryable queue. If the operation fails,
* reschedules with backoff.
*/ async Bt() {
if (0 !== this.St.length) {
try {
await this.St[0](), this.St.shift(), this.Rt.reset();
} catch (t) {
if (!
/**
* @license
* Copyright 2017 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
/** Verifies whether `e` is an IndexedDbTransactionError. */
function(t) {
// Use name equality, as instanceof checks on errors don't work with errors
// that wrap other errors.
return "IndexedDbTransactionError" === t.name;
}
/**
* @license
* Copyright 2020 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/ (t)) throw t;
// Failure will be handled by AsyncQueue
m("AsyncQueue", "Operation failed with retryable error: " + t);
}
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
// enqueued. If, for example, `op1`, `op2`, `op3` are enqueued and `op1`
// needs to be re-run, we will run `op1`, `op1`, `op2` using the
// already enqueued calls to `retryNextOp()`. `op3()` will then run in the
// call scheduled here.
// 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.Rt.K((() => this.Bt()));
}
}
Mt(t) {
const e = this.Ft.then((() => (this.Ct = !0, t().catch((t => {
this.Ot = t, this.Ct = !1;
// Re-throw the error so that this.tail becomes a rejected Promise and
// all further attempts to chain (via .then) will just short-circuit
// and return the rejected Promise.
throw p("INTERNAL UNHANDLED ERROR: ",
/**
* Chrome includes Error.message in Error.stack. Other browsers do not.
* This returns expected output of message + stack when available.
* @param error - Error or FirestoreError
*/
function(t) {
let e = t.message || "";
t.stack && (e = t.stack.includes(t.message) ? t.stack : t.message + "\n" + t.stack);
return e;
}
/**
* @license
* Copyright 2020 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* 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.
*/
// TODO(mrschmidt) Consider using `BaseTransaction` as the base class in the
// legacy SDK.
/**
* A reference to a transaction.
*
* The `Transaction` object passed to a transaction's `updateFunction` provides
* the methods to read and write data within the transaction context. See
* {@link runTransaction}.
*/ (t)), t;
})).then((t => (this.Ct = !1, t))))));
return this.Ft = e, e;
}
enqueueAfterDelay(t, e, n) {
this.kt(),
// Fast-forward delays for timerIds that have been overriden.
this.Ut.indexOf(t) > -1 && (e = 0);
const r = Or.createAndSchedule(this, t, e, n, (t => this.Qt(t)));
return this.xt.push(r), r;
}
kt() {
this.Ot && g();
}
verifyOperationInProgress() {}
/**
* Waits until all currently queued tasks are finished executing. Delayed
* operations are not run.
*/ 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.Ft, await t;
} while (t !== this.Ft);
}
/**
* For Tests: Determine if a delayed operation with a particular TimerId
* exists.
*/ Wt(t) {
for (const e of this.xt) if (e.timerId === t) return !0;
return !1;
}
/**
* For Tests: Runs some or all delayed operations early.
*
* @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.
*/ Gt(t) {
// Note that draining may generate more delayed ops, so we do that first.
return this.zt().then((() => {
// Run ops in the same order they'd run if they ran naturally.
this.xt.sort(((t, e) => t.targetTimeMs - e.targetTimeMs));
for (const e of this.xt) if (e.skipDelay(), "all" /* All */ !== t && e.timerId === t) break;
return this.zt();
}));
}
/**
* For Tests: Skip all subsequent delays for a timer id.
*/ Ht(t) {
this.Ut.push(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.xt.indexOf(t);
this.xt.splice(e, 1);
}
}
class Lr {
/** @hideconstructor */
constructor(t, e) {
this._firestore = t, this._transaction = e, this._dataReader = Rn(t);
}
/**
* Reads the document referenced by the provided {@link DocumentReference}.
*
* @param documentRef - A reference to the document to be read.
* @returns A `DocumentSnapshot` with the read data.
*/ get(t) {
const e = $r(t, this._firestore), n = new _r(this._firestore);
return this._transaction.lookup([ e._key ]).then((t => {
if (!t || 1 !== t.length) return g();
const r = t[0];
if (r.isFoundDocument()) return new Gn(this._firestore, n, r.key, r, e.converter);
if (r.isNoDocument()) return new Gn(this._firestore, n, e._key, null, e.converter);
throw g();
}));
}
set(t, e, n) {
const r = $r(t, this._firestore), s = yr(r.converter, e, n), i = Vn(this._dataReader, "Transaction.set", r._key, s, null !== r.converter, n);
return this._transaction.set(r._key, i), this;
}
update(t, e, n, ...r) {
const s = $r(t, this._firestore);
// For Compat types, we have to "extract" the underlying types before
// performing validation.
let i;
return i = "string" == typeof (e = c(e)) || e instanceof pn ? On(this._dataReader, "Transaction.update", s._key, e, n, r) : xn(this._dataReader, "Transaction.update", s._key, e),
this._transaction.update(s._key, i), this;
}
/**
* Deletes the document referred to by the provided {@link DocumentReference}.
*
* @param documentRef - A reference to the document to be deleted.
* @returns This `Transaction` instance. Used for chaining method calls.
*/ delete(t) {
const e = $r(t, this._firestore);
return this._transaction.delete(e._key), this;
}
}
/**
* Executes the given `updateFunction` and then attempts to commit the changes
* applied within the transaction. If any document read within the transaction
* has changed, Cloud Firestore retries the `updateFunction`. If it fails to
* commit after 5 attempts, the transaction fails.
*
* The maximum number of writes allowed in a single transaction is 500.
*
* @param firestore - A reference to the Firestore database to run this
* transaction against.
* @param updateFunction - The function to execute within the transaction
* context.
* @returns If the transaction completed successfully or was explicitly aborted
* (the `updateFunction` returned a failed promise), the promise returned by the
* `updateFunction `is returned here. Otherwise, if the transaction failed, a
* rejected promise with the corresponding failure error is returned.
*/ function Ur(t, e) {
const n = tn(t = st(t, nn)), r = new j;
return new qr(new Cr, n, (n => e(new Lr(t, n))), r).run(), r.promise;
}
/**
* Firestore Lite
*
* @remarks Firestore Lite is a small online-only SDK that allows read
* and write access to your Firestore database. All operations connect
* directly to the backend, and `onSnapshot()` APIs are not supported.
* @packageDocumentation
*/ !function(t) {
l = t;
}(`${i}_lite`), r(new o("firestore/lite", ((t, {options: e}) => {
const n = t.getProvider("app-exp").getImmediate(), r = new nn(n, t.getProvider("auth-internal"));
return e && r._setSettings(e), r;
}), "PUBLIC" /* PUBLIC */)), s("firestore-lite", "2.3.10", "node");
export { _n as Bytes, hn as CollectionReference, cn as DocumentReference, Gn as DocumentSnapshot, pn as FieldPath, gn as FieldValue, nn as Firestore, U as FirestoreError, bn as GeoPoint, an as Query, Zn as QueryConstraint, Hn as QueryDocumentSnapshot, Yn as QuerySnapshot, yt as Timestamp, Lr as Transaction, Dr as WriteBatch, Ir as addDoc, Vr as arrayRemove, Rr as arrayUnion, ln as collection, fn as collectionGroup, on as connectFirestoreEmulator, Tr as deleteDoc, Ar as deleteField, dn as doc, yn as documentId, fr as endAt, lr as endBefore, gr as getDoc, br as getDocs, sn as getFirestore, Nr as increment, rn as initializeFirestore, ir as limit, or as limitToLast, rr as orderBy, Xn as query, mn as queryEqual, wn as refEqual, Ur as runTransaction, Pr as serverTimestamp, vr as setDoc, w as setLogLevel, Kn as snapshotEqual, ar as startAfter, cr as startAt, un as terminate, Er as updateDoc, er as where, Fr as writeBatch };
//# sourceMappingURL=index.browser.esm2017.js.map