| 1 |
- {"version":3,"file":"index.browser.esm5.js","sources":["../../src/auth/user.ts","../../src/core/version.ts","../../src/util/log.ts","../../src/platform/browser/format_json.ts","../../src/util/assert.ts","../../src/util/error.ts","../../src/util/promise.ts","../../src/api/credentials.ts","../../src/core/database_info.ts","../../src/model/path.ts","../../src/model/document_key.ts","../../src/util/input_validation.ts","../../src/util/types.ts","../../src/remote/rest_connection.ts","../../src/remote/rpc_error.ts","../../src/platform/browser_lite/fetch_connection.ts","../../src/platform/browser/random_bytes.ts","../../src/util/misc.ts","../../src/util/obj.ts","../../src/util/byte_string.ts","../../src/platform/browser/base64.ts","../../src/model/normalize.ts","../../src/lite-api/timestamp.ts","../../src/model/server_timestamps.ts","../../src/model/values.ts","../../src/core/bound.ts","../../src/core/filter.ts","../../src/core/order_by.ts","../../src/core/snapshot_version.ts","../../src/util/sorted_map.ts","../../src/util/sorted_set.ts","../../src/model/field_mask.ts","../../src/model/object_value.ts","../../src/model/document.ts","../../src/core/target.ts","../../src/core/query.ts","../../src/remote/number_serializer.ts","../../src/model/transform_operation.ts","../../src/model/mutation.ts","../../src/remote/serializer.ts","../../src/platform/browser/serializer.ts","../../src/remote/backoff.ts","../../src/remote/datastore.ts","../../src/lite-api/components.ts","../../src/platform/browser_lite/connection.ts","../../src/lite-api/settings.ts","../../src/local/lru_garbage_collector.ts","../../src/local/lru_garbage_collector_impl.ts","../../src/lite-api/database.ts","../../src/lite-api/aggregate_types.ts","../../src/core/count_query_runner.ts","../../src/lite-api/reference.ts","../../src/lite-api/bytes.ts","../../src/lite-api/field_path.ts","../../src/lite-api/field_value.ts","../../src/lite-api/geo_point.ts","../../src/lite-api/user_data_reader.ts","../../src/lite-api/snapshot.ts","../../src/lite-api/query.ts","../../src/lite-api/reference_impl.ts","../../src/lite-api/user_data_writer.ts","../../src/lite-api/aggregate.ts","../../src/lite-api/field_value_impl.ts","../../src/lite-api/write_batch.ts","../../src/core/transaction.ts","../../src/core/transaction_options.ts","../../src/core/transaction_runner.ts","../../src/platform/browser/dom.ts","../../src/util/async_queue.ts","../../src/util/async_queue_impl.ts","../../src/local/simple_db.ts","../../src/lite-api/transaction.ts","../../lite/register.ts"],"sourcesContent":["/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * Simple wrapper around a nullable UID. Mostly exists to make code more\n * readable.\n */\nexport class User {\n /** A user with a null UID. */\n static readonly UNAUTHENTICATED = new User(null);\n\n // TODO(mikelehen): Look into getting a proper uid-equivalent for\n // non-FirebaseAuth providers.\n static readonly GOOGLE_CREDENTIALS = new User('google-credentials-uid');\n static readonly FIRST_PARTY = new User('first-party-uid');\n static readonly MOCK_USER = new User('mock-user');\n\n constructor(readonly uid: string | null) {}\n\n isAuthenticated(): boolean {\n return this.uid != null;\n }\n\n /**\n * Returns a key representing this user, suitable for inclusion in a\n * dictionary.\n */\n toKey(): string {\n if (this.isAuthenticated()) {\n return 'uid:' + this.uid;\n } else {\n return 'anonymous-user';\n }\n }\n\n isEqual(otherUser: User): boolean {\n return otherUser.uid === this.uid;\n }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/** The semver (www.semver.org) version of the SDK. */\nimport { version } from '../../../firebase/package.json';\nexport let SDK_VERSION = version;\nexport function setSDKVersion(version: string): void {\n SDK_VERSION = version;\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Logger, LogLevel, LogLevelString } from '@firebase/logger';\n\nimport { SDK_VERSION } from '../core/version';\nimport { formatJSON } from '../platform/format_json';\n\nexport { LogLevel, LogLevelString };\n\nconst logClient = new Logger('@firebase/firestore');\n\n// Helper methods are needed because variables can't be exported as read/write\nexport function getLogLevel(): LogLevel {\n return logClient.logLevel;\n}\n\n/**\n * Sets the verbosity of Cloud Firestore logs (debug, error, or silent).\n *\n * @param logLevel - The verbosity you set for activity and error logging. Can\n * be any of the following values:\n *\n * <ul>\n * <li>`debug` for the most verbose logging level, primarily for\n * debugging.</li>\n * <li>`error` to log errors only.</li>\n * <li><code>`silent` to turn off logging.</li>\n * </ul>\n */\nexport function setLogLevel(logLevel: LogLevelString): void {\n logClient.setLogLevel(logLevel);\n}\n\nexport function logDebug(msg: string, ...obj: unknown[]): void {\n if (logClient.logLevel <= LogLevel.DEBUG) {\n const args = obj.map(argToString);\n logClient.debug(`Firestore (${SDK_VERSION}): ${msg}`, ...args);\n }\n}\n\nexport function logError(msg: string, ...obj: unknown[]): void {\n if (logClient.logLevel <= LogLevel.ERROR) {\n const args = obj.map(argToString);\n logClient.error(`Firestore (${SDK_VERSION}): ${msg}`, ...args);\n }\n}\n\n/**\n * @internal\n */\nexport function logWarn(msg: string, ...obj: unknown[]): void {\n if (logClient.logLevel <= LogLevel.WARN) {\n const args = obj.map(argToString);\n logClient.warn(`Firestore (${SDK_VERSION}): ${msg}`, ...args);\n }\n}\n\n/**\n * Converts an additional log parameter to a string representation.\n */\nfunction argToString(obj: unknown): string | unknown {\n if (typeof obj === 'string') {\n return obj;\n } else {\n try {\n return formatJSON(obj);\n } catch (e) {\n // Converting to JSON failed, just log the object directly\n return obj;\n }\n }\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/** Formats an object as a JSON string, suitable for logging. */\nexport function formatJSON(value: unknown): string {\n return JSON.stringify(value);\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { SDK_VERSION } from '../core/version';\n\nimport { logError } from './log';\n\n/**\n * Unconditionally fails, throwing an Error with the given message.\n * Messages are stripped in production builds.\n *\n * Returns `never` and can be used in expressions:\n * @example\n * let futureVar = fail('not implemented yet');\n */\nexport function fail(failure: string = 'Unexpected state'): never {\n // Log the failure in addition to throw an exception, just in case the\n // exception is swallowed.\n const message =\n `FIRESTORE (${SDK_VERSION}) INTERNAL ASSERTION FAILED: ` + failure;\n logError(message);\n\n // NOTE: We don't use FirestoreError here because these are internal failures\n // that cannot be handled by the user. (Also it would create a circular\n // dependency between the error and assert modules which doesn't work.)\n throw new Error(message);\n}\n\n/**\n * Fails if the given assertion condition is false, throwing an Error with the\n * given message if it did.\n *\n * Messages are stripped in production builds.\n */\nexport function hardAssert(\n assertion: boolean,\n message?: string\n): asserts assertion {\n if (!assertion) {\n fail(message);\n }\n}\n\n/**\n * Fails if the given assertion condition is false, throwing an Error with the\n * given message if it did.\n *\n * The code of callsites invoking this function are stripped out in production\n * builds. Any side-effects of code within the debugAssert() invocation will not\n * happen in this case.\n *\n * @internal\n */\nexport function debugAssert(\n assertion: boolean,\n message: string\n): asserts assertion {\n if (!assertion) {\n fail(message);\n }\n}\n\n/**\n * Casts `obj` to `T`. In non-production builds, verifies that `obj` is an\n * instance of `T` before casting.\n */\nexport function debugCast<T>(\n obj: object,\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n constructor: { new (...args: any[]): T }\n): T | never {\n debugAssert(\n obj instanceof constructor,\n `Expected type '${constructor.name}', but was '${obj.constructor.name}'`\n );\n return obj as T;\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { FirebaseError } from '@firebase/util';\n\n/**\n * The set of Firestore status codes. The codes are the same at the ones\n * exposed by gRPC here:\n * https://github.com/grpc/grpc/blob/master/doc/statuscodes.md\n *\n * Possible values:\n * - 'cancelled': The operation was cancelled (typically by the caller).\n * - 'unknown': Unknown error or an error from a different error domain.\n * - 'invalid-argument': Client specified an invalid argument. Note that this\n * differs from 'failed-precondition'. 'invalid-argument' indicates\n * arguments that are problematic regardless of the state of the system\n * (e.g. an invalid field name).\n * - 'deadline-exceeded': Deadline expired before operation could complete.\n * For operations that change the state of the system, this error may be\n * returned even if the operation has completed successfully. For example,\n * a successful response from a server could have been delayed long enough\n * for the deadline to expire.\n * - 'not-found': Some requested document was not found.\n * - 'already-exists': Some document that we attempted to create already\n * exists.\n * - 'permission-denied': The caller does not have permission to execute the\n * specified operation.\n * - 'resource-exhausted': Some resource has been exhausted, perhaps a\n * per-user quota, or perhaps the entire file system is out of space.\n * - 'failed-precondition': Operation was rejected because the system is not\n * in a state required for the operation's execution.\n * - 'aborted': The operation was aborted, typically due to a concurrency\n * issue like transaction aborts, etc.\n * - 'out-of-range': Operation was attempted past the valid range.\n * - 'unimplemented': Operation is not implemented or not supported/enabled.\n * - 'internal': Internal errors. Means some invariants expected by\n * underlying system has been broken. If you see one of these errors,\n * something is very broken.\n * - 'unavailable': The service is currently unavailable. This is most likely\n * a transient condition and may be corrected by retrying with a backoff.\n * - 'data-loss': Unrecoverable data loss or corruption.\n * - 'unauthenticated': The request does not have valid authentication\n * credentials for the operation.\n */\nexport type FirestoreErrorCode =\n | 'cancelled'\n | 'unknown'\n | 'invalid-argument'\n | 'deadline-exceeded'\n | 'not-found'\n | 'already-exists'\n | 'permission-denied'\n | 'resource-exhausted'\n | 'failed-precondition'\n | 'aborted'\n | 'out-of-range'\n | 'unimplemented'\n | 'internal'\n | 'unavailable'\n | 'data-loss'\n | 'unauthenticated';\n\n/**\n * Error Codes describing the different ways Firestore can fail. These come\n * directly from GRPC.\n */\nexport type Code = FirestoreErrorCode;\n\nexport const Code = {\n // Causes are copied from:\n // https://github.com/grpc/grpc/blob/bceec94ea4fc5f0085d81235d8e1c06798dc341a/include/grpc%2B%2B/impl/codegen/status_code_enum.h\n /** Not an error; returned on success. */\n OK: 'ok' as FirestoreErrorCode,\n\n /** The operation was cancelled (typically by the caller). */\n CANCELLED: 'cancelled' as FirestoreErrorCode,\n\n /** Unknown error or an error from a different error domain. */\n UNKNOWN: 'unknown' as FirestoreErrorCode,\n\n /**\n * Client specified an invalid argument. Note that this differs from\n * FAILED_PRECONDITION. INVALID_ARGUMENT indicates arguments that are\n * problematic regardless of the state of the system (e.g., a malformed file\n * name).\n */\n INVALID_ARGUMENT: 'invalid-argument' as FirestoreErrorCode,\n\n /**\n * Deadline expired before operation could complete. For operations that\n * change the state of the system, this error may be returned even if the\n * operation has completed successfully. For example, a successful response\n * from a server could have been delayed long enough for the deadline to\n * expire.\n */\n DEADLINE_EXCEEDED: 'deadline-exceeded' as FirestoreErrorCode,\n\n /** Some requested entity (e.g., file or directory) was not found. */\n NOT_FOUND: 'not-found' as FirestoreErrorCode,\n\n /**\n * Some entity that we attempted to create (e.g., file or directory) already\n * exists.\n */\n ALREADY_EXISTS: 'already-exists' as FirestoreErrorCode,\n\n /**\n * The caller does not have permission to execute the specified operation.\n * PERMISSION_DENIED must not be used for rejections caused by exhausting\n * some resource (use RESOURCE_EXHAUSTED instead for those errors).\n * PERMISSION_DENIED must not be used if the caller can not be identified\n * (use UNAUTHENTICATED instead for those errors).\n */\n PERMISSION_DENIED: 'permission-denied' as FirestoreErrorCode,\n\n /**\n * The request does not have valid authentication credentials for the\n * operation.\n */\n UNAUTHENTICATED: 'unauthenticated' as FirestoreErrorCode,\n\n /**\n * Some resource has been exhausted, perhaps a per-user quota, or perhaps the\n * entire file system is out of space.\n */\n RESOURCE_EXHAUSTED: 'resource-exhausted' as FirestoreErrorCode,\n\n /**\n * Operation was rejected because the system is not in a state required for\n * the operation's execution. For example, directory to be deleted may be\n * non-empty, an rmdir operation is applied to a non-directory, etc.\n *\n * A litmus test that may help a service implementor in deciding\n * between FAILED_PRECONDITION, ABORTED, and UNAVAILABLE:\n * (a) Use UNAVAILABLE if the client can retry just the failing call.\n * (b) Use ABORTED if the client should retry at a higher-level\n * (e.g., restarting a read-modify-write sequence).\n * (c) Use FAILED_PRECONDITION if the client should not retry until\n * the system state has been explicitly fixed. E.g., if an \"rmdir\"\n * fails because the directory is non-empty, FAILED_PRECONDITION\n * should be returned since the client should not retry unless\n * they have first fixed up the directory by deleting files from it.\n * (d) Use FAILED_PRECONDITION if the client performs conditional\n * REST Get/Update/Delete on a resource and the resource on the\n * server does not match the condition. E.g., conflicting\n * read-modify-write on the same resource.\n */\n FAILED_PRECONDITION: 'failed-precondition' as FirestoreErrorCode,\n\n /**\n * The operation was aborted, typically due to a concurrency issue like\n * sequencer check failures, transaction aborts, etc.\n *\n * See litmus test above for deciding between FAILED_PRECONDITION, ABORTED,\n * and UNAVAILABLE.\n */\n ABORTED: 'aborted' as FirestoreErrorCode,\n\n /**\n * Operation was attempted past the valid range. E.g., seeking or reading\n * past end of file.\n *\n * Unlike INVALID_ARGUMENT, this error indicates a problem that may be fixed\n * if the system state changes. For example, a 32-bit file system will\n * generate INVALID_ARGUMENT if asked to read at an offset that is not in the\n * range [0,2^32-1], but it will generate OUT_OF_RANGE if asked to read from\n * an offset past the current file size.\n *\n * There is a fair bit of overlap between FAILED_PRECONDITION and\n * OUT_OF_RANGE. We recommend using OUT_OF_RANGE (the more specific error)\n * when it applies so that callers who are iterating through a space can\n * easily look for an OUT_OF_RANGE error to detect when they are done.\n */\n OUT_OF_RANGE: 'out-of-range' as FirestoreErrorCode,\n\n /** Operation is not implemented or not supported/enabled in this service. */\n UNIMPLEMENTED: 'unimplemented' as FirestoreErrorCode,\n\n /**\n * Internal errors. Means some invariants expected by underlying System has\n * been broken. If you see one of these errors, Something is very broken.\n */\n INTERNAL: 'internal' as FirestoreErrorCode,\n\n /**\n * The service is currently unavailable. This is a most likely a transient\n * condition and may be corrected by retrying with a backoff.\n *\n * See litmus test above for deciding between FAILED_PRECONDITION, ABORTED,\n * and UNAVAILABLE.\n */\n UNAVAILABLE: 'unavailable' as FirestoreErrorCode,\n\n /** Unrecoverable data loss or corruption. */\n DATA_LOSS: 'data-loss' as FirestoreErrorCode\n};\n\n/** An error returned by a Firestore operation. */\nexport class FirestoreError extends FirebaseError {\n /** The stack of the error. */\n readonly stack?: string;\n\n /** @hideconstructor */\n constructor(\n /**\n * The backend error code associated with this error.\n */\n readonly code: FirestoreErrorCode,\n /**\n * A custom error description.\n */\n readonly message: string\n ) {\n super(code, message);\n\n // HACK: We write a toString property directly because Error is not a real\n // class and so inheritance does not work correctly. We could alternatively\n // do the same \"back-door inheritance\" trick that FirebaseError does.\n this.toString = () => `${this.name}: [code=${this.code}]: ${this.message}`;\n }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nexport interface Resolver<R> {\n (value: R | Promise<R>): void;\n}\n\nexport interface Rejecter {\n (reason?: Error): void;\n}\n\nexport class Deferred<R = void> {\n promise: Promise<R>;\n // Assigned synchronously in constructor by Promise constructor callback.\n resolve!: Resolver<R>;\n reject!: Rejecter;\n\n constructor() {\n this.promise = new Promise((resolve: Resolver<R>, reject: Rejecter) => {\n this.resolve = resolve;\n this.reject = reject;\n });\n }\n}\n\n/**\n * Takes an array of values and a function from a value to a Promise. The function is run on each\n * value sequentially, waiting for the previous promise to resolve before starting the next one.\n * The returned promise resolves once the function has been run on all values.\n */\nexport function sequence<T>(\n values: T[],\n fn: (value: T) => Promise<void>\n): Promise<void> {\n let p = Promise.resolve();\n for (const value of values) {\n p = p.then(() => fn(value));\n }\n return p;\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport {\n AppCheckInternalComponentName,\n AppCheckTokenListener,\n AppCheckTokenResult,\n FirebaseAppCheckInternal\n} from '@firebase/app-check-interop-types';\nimport {\n FirebaseAuthInternal,\n FirebaseAuthInternalName\n} from '@firebase/auth-interop-types';\nimport { Provider } from '@firebase/component';\n\nimport { User } from '../auth/user';\nimport { debugAssert, hardAssert } from '../util/assert';\nimport { AsyncQueue } from '../util/async_queue';\nimport { Code, FirestoreError } from '../util/error';\nimport { logDebug } from '../util/log';\nimport { Deferred } from '../util/promise';\n\n// TODO(mikelehen): This should be split into multiple files and probably\n// moved to an auth/ folder to match other platforms.\n\nexport type AuthTokenFactory = () => string;\n\nexport interface FirstPartyCredentialsSettings {\n // These are external types. Prevent minification.\n ['type']: 'gapi';\n ['client']: unknown;\n ['sessionIndex']: string;\n ['iamToken']: string | null;\n ['authTokenFactory']: AuthTokenFactory | null;\n}\n\nexport interface ProviderCredentialsSettings {\n // These are external types. Prevent minification.\n ['type']: 'provider';\n ['client']: CredentialsProvider<User>;\n}\n\n/** Settings for private credentials */\nexport type CredentialsSettings =\n | FirstPartyCredentialsSettings\n | ProviderCredentialsSettings;\n\nexport type TokenType = 'OAuth' | 'FirstParty' | 'AppCheck';\nexport interface Token {\n /** Type of token. */\n type: TokenType;\n\n /**\n * The user with which the token is associated (used for persisting user\n * state on disk, etc.).\n * This will be null for Tokens of the type 'AppCheck'.\n */\n user?: User;\n\n /** Header values to set for this token */\n headers: Map<string, string>;\n}\n\nexport class OAuthToken implements Token {\n type = 'OAuth' as TokenType;\n headers = new Map();\n\n constructor(value: string, public user: User) {\n this.headers.set('Authorization', `Bearer ${value}`);\n }\n}\n\n/**\n * A Listener for credential change events. The listener should fetch a new\n * token and may need to invalidate other state if the current user has also\n * changed.\n */\nexport type CredentialChangeListener<T> = (credential: T) => Promise<void>;\n\n/**\n * Provides methods for getting the uid and token for the current user and\n * listening for changes.\n */\nexport interface CredentialsProvider<T> {\n /**\n * Starts the credentials provider and specifies a listener to be notified of\n * credential changes (sign-in / sign-out, token changes). It is immediately\n * called once with the initial user.\n *\n * The change listener is invoked on the provided AsyncQueue.\n */\n start(\n asyncQueue: AsyncQueue,\n changeListener: CredentialChangeListener<T>\n ): void;\n\n /** Requests a token for the current user. */\n getToken(): Promise<Token | null>;\n\n /**\n * Marks the last retrieved token as invalid, making the next GetToken request\n * force-refresh the token.\n */\n invalidateToken(): void;\n\n shutdown(): void;\n}\n\n/**\n * A CredentialsProvider that always yields an empty token.\n * @internal\n */\nexport class EmptyAuthCredentialsProvider implements CredentialsProvider<User> {\n getToken(): Promise<Token | null> {\n return Promise.resolve<Token | null>(null);\n }\n\n invalidateToken(): void {}\n\n start(\n asyncQueue: AsyncQueue,\n changeListener: CredentialChangeListener<User>\n ): void {\n // Fire with initial user.\n asyncQueue.enqueueRetryable(() => changeListener(User.UNAUTHENTICATED));\n }\n\n shutdown(): void {}\n}\n\n/**\n * A CredentialsProvider that always returns a constant token. Used for\n * emulator token mocking.\n */\nexport class EmulatorAuthCredentialsProvider\n implements CredentialsProvider<User>\n{\n constructor(private token: Token) {}\n\n /**\n * Stores the listener registered with setChangeListener()\n * This isn't actually necessary since the UID never changes, but we use this\n * to verify the listen contract is adhered to in tests.\n */\n private changeListener: CredentialChangeListener<User> | null = null;\n\n getToken(): Promise<Token | null> {\n return Promise.resolve(this.token);\n }\n\n invalidateToken(): void {}\n\n start(\n asyncQueue: AsyncQueue,\n changeListener: CredentialChangeListener<User>\n ): void {\n debugAssert(\n !this.changeListener,\n 'Can only call setChangeListener() once.'\n );\n this.changeListener = changeListener;\n // Fire with initial user.\n asyncQueue.enqueueRetryable(() => changeListener(this.token.user!));\n }\n\n shutdown(): void {\n this.changeListener = null;\n }\n}\n\n/** Credential provider for the Lite SDK. */\nexport class LiteAuthCredentialsProvider implements CredentialsProvider<User> {\n private auth: FirebaseAuthInternal | null = null;\n\n constructor(authProvider: Provider<FirebaseAuthInternalName>) {\n authProvider.onInit(auth => {\n this.auth = auth;\n });\n }\n\n getToken(): Promise<Token | null> {\n if (!this.auth) {\n return Promise.resolve(null);\n }\n\n return this.auth.getToken().then(tokenData => {\n if (tokenData) {\n hardAssert(\n typeof tokenData.accessToken === 'string',\n 'Invalid tokenData returned from getToken():' + tokenData\n );\n return new OAuthToken(\n tokenData.accessToken,\n new User(this.auth!.getUid())\n );\n } else {\n return null;\n }\n });\n }\n\n invalidateToken(): void {}\n\n start(\n asyncQueue: AsyncQueue,\n changeListener: CredentialChangeListener<User>\n ): void {}\n\n shutdown(): void {}\n}\n\nexport class FirebaseAuthCredentialsProvider\n implements CredentialsProvider<User>\n{\n /**\n * The auth token listener registered with FirebaseApp, retained here so we\n * can unregister it.\n */\n private tokenListener!: () => void;\n\n /** Tracks the current User. */\n private currentUser: User = User.UNAUTHENTICATED;\n\n /**\n * Counter used to detect if the token changed while a getToken request was\n * outstanding.\n */\n private tokenCounter = 0;\n\n private forceRefresh = false;\n\n private auth: FirebaseAuthInternal | null = null;\n\n constructor(private authProvider: Provider<FirebaseAuthInternalName>) {}\n\n start(\n asyncQueue: AsyncQueue,\n changeListener: CredentialChangeListener<User>\n ): void {\n let lastTokenId = this.tokenCounter;\n\n // A change listener that prevents double-firing for the same token change.\n const guardedChangeListener: (user: User) => Promise<void> = user => {\n if (this.tokenCounter !== lastTokenId) {\n lastTokenId = this.tokenCounter;\n return changeListener(user);\n } else {\n return Promise.resolve();\n }\n };\n\n // A promise that can be waited on to block on the next token change.\n // This promise is re-created after each change.\n let nextToken = new Deferred<void>();\n\n this.tokenListener = () => {\n this.tokenCounter++;\n this.currentUser = this.getUser();\n nextToken.resolve();\n nextToken = new Deferred<void>();\n asyncQueue.enqueueRetryable(() =>\n guardedChangeListener(this.currentUser)\n );\n };\n\n const awaitNextToken: () => void = () => {\n const currentTokenAttempt = nextToken;\n asyncQueue.enqueueRetryable(async () => {\n await currentTokenAttempt.promise;\n await guardedChangeListener(this.currentUser);\n });\n };\n\n const registerAuth = (auth: FirebaseAuthInternal): void => {\n logDebug('FirebaseAuthCredentialsProvider', 'Auth detected');\n this.auth = auth;\n this.auth.addAuthTokenListener(this.tokenListener);\n awaitNextToken();\n };\n\n this.authProvider.onInit(auth => registerAuth(auth));\n\n // Our users can initialize Auth right after Firestore, so we give it\n // a chance to register itself with the component framework before we\n // determine whether to start up in unauthenticated mode.\n setTimeout(() => {\n if (!this.auth) {\n const auth = this.authProvider.getImmediate({ optional: true });\n if (auth) {\n registerAuth(auth);\n } else {\n // If auth is still not available, proceed with `null` user\n logDebug('FirebaseAuthCredentialsProvider', 'Auth not yet detected');\n nextToken.resolve();\n nextToken = new Deferred<void>();\n }\n }\n }, 0);\n\n awaitNextToken();\n }\n\n getToken(): Promise<Token | null> {\n debugAssert(\n this.tokenListener != null,\n 'FirebaseAuthCredentialsProvider not started.'\n );\n\n // Take note of the current value of the tokenCounter so that this method\n // can fail (with an ABORTED error) if there is a token change while the\n // request is outstanding.\n const initialTokenCounter = this.tokenCounter;\n const forceRefresh = this.forceRefresh;\n this.forceRefresh = false;\n\n if (!this.auth) {\n return Promise.resolve(null);\n }\n\n return this.auth.getToken(forceRefresh).then(tokenData => {\n // Cancel the request since the token changed while the request was\n // outstanding so the response is potentially for a previous user (which\n // user, we can't be sure).\n if (this.tokenCounter !== initialTokenCounter) {\n logDebug(\n 'FirebaseAuthCredentialsProvider',\n 'getToken aborted due to token change.'\n );\n return this.getToken();\n } else {\n if (tokenData) {\n hardAssert(\n typeof tokenData.accessToken === 'string',\n 'Invalid tokenData returned from getToken():' + tokenData\n );\n return new OAuthToken(tokenData.accessToken, this.currentUser);\n } else {\n return null;\n }\n }\n });\n }\n\n invalidateToken(): void {\n this.forceRefresh = true;\n }\n\n shutdown(): void {\n if (this.auth) {\n this.auth.removeAuthTokenListener(this.tokenListener!);\n }\n }\n\n // Auth.getUid() can return null even with a user logged in. It is because\n // getUid() is synchronous, but the auth code populating Uid is asynchronous.\n // This method should only be called in the AuthTokenListener callback\n // to guarantee to get the actual user.\n private getUser(): User {\n const currentUid = this.auth && this.auth.getUid();\n hardAssert(\n currentUid === null || typeof currentUid === 'string',\n 'Received invalid UID: ' + currentUid\n );\n return new User(currentUid);\n }\n}\n\n// Manual type definition for the subset of Gapi we use.\ninterface Gapi {\n auth: {\n getAuthHeaderValueForFirstParty: (\n userIdentifiers: Array<{ [key: string]: string }>\n ) => string | null;\n };\n}\n\n/*\n * FirstPartyToken provides a fresh token each time its value\n * is requested, because if the token is too old, requests will be rejected.\n * Technically this may no longer be necessary since the SDK should gracefully\n * recover from unauthenticated errors (see b/33147818 for context), but it's\n * safer to keep the implementation as-is.\n */\nexport class FirstPartyToken implements Token {\n type = 'FirstParty' as TokenType;\n user = User.FIRST_PARTY;\n private _headers = new Map();\n\n constructor(\n private readonly gapi: Gapi | null,\n private readonly sessionIndex: string,\n private readonly iamToken: string | null,\n private readonly authTokenFactory: AuthTokenFactory | null\n ) {}\n\n /** Gets an authorization token, using a provided factory function, or falling back to First Party GAPI. */\n private getAuthToken(): string | null {\n if (this.authTokenFactory) {\n return this.authTokenFactory();\n } else {\n // Make sure this really is a Gapi client.\n hardAssert(\n !!(\n typeof this.gapi === 'object' &&\n this.gapi !== null &&\n this.gapi['auth'] &&\n this.gapi['auth']['getAuthHeaderValueForFirstParty']\n ),\n 'unexpected gapi interface'\n );\n return this.gapi!['auth']['getAuthHeaderValueForFirstParty']([]);\n }\n }\n\n get headers(): Map<string, string> {\n this._headers.set('X-Goog-AuthUser', this.sessionIndex);\n // Use array notation to prevent minification\n const authHeaderTokenValue = this.getAuthToken();\n if (authHeaderTokenValue) {\n this._headers.set('Authorization', authHeaderTokenValue);\n }\n if (this.iamToken) {\n this._headers.set('X-Goog-Iam-Authorization-Token', this.iamToken);\n }\n\n return this._headers;\n }\n}\n\n/*\n * Provides user credentials required for the Firestore JavaScript SDK\n * to authenticate the user, using technique that is only available\n * to applications hosted by Google.\n */\nexport class FirstPartyAuthCredentialsProvider\n implements CredentialsProvider<User>\n{\n constructor(\n private gapi: Gapi | null,\n private sessionIndex: string,\n private iamToken: string | null,\n private authTokenFactory: AuthTokenFactory | null\n ) {}\n\n getToken(): Promise<Token | null> {\n return Promise.resolve(\n new FirstPartyToken(\n this.gapi,\n this.sessionIndex,\n this.iamToken,\n this.authTokenFactory\n )\n );\n }\n\n start(\n asyncQueue: AsyncQueue,\n changeListener: CredentialChangeListener<User>\n ): void {\n // Fire with initial uid.\n asyncQueue.enqueueRetryable(() => changeListener(User.FIRST_PARTY));\n }\n\n shutdown(): void {}\n\n invalidateToken(): void {}\n}\n\nexport class AppCheckToken implements Token {\n type = 'AppCheck' as TokenType;\n headers = new Map();\n\n constructor(private value: string) {\n if (value && value.length > 0) {\n this.headers.set('x-firebase-appcheck', this.value);\n }\n }\n}\n\nexport class FirebaseAppCheckTokenProvider\n implements CredentialsProvider<string>\n{\n /**\n * The AppCheck token listener registered with FirebaseApp, retained here so\n * we can unregister it.\n */\n private tokenListener!: AppCheckTokenListener;\n private forceRefresh = false;\n private appCheck: FirebaseAppCheckInternal | null = null;\n private latestAppCheckToken: string | null = null;\n\n constructor(\n private appCheckProvider: Provider<AppCheckInternalComponentName>\n ) {}\n\n start(\n asyncQueue: AsyncQueue,\n changeListener: CredentialChangeListener<string>\n ): void {\n const onTokenChanged: (\n tokenResult: AppCheckTokenResult\n ) => Promise<void> = tokenResult => {\n if (tokenResult.error != null) {\n logDebug(\n 'FirebaseAppCheckTokenProvider',\n `Error getting App Check token; using placeholder token instead. Error: ${tokenResult.error.message}`\n );\n }\n const tokenUpdated = tokenResult.token !== this.latestAppCheckToken;\n this.latestAppCheckToken = tokenResult.token;\n logDebug(\n 'FirebaseAppCheckTokenProvider',\n `Received ${tokenUpdated ? 'new' : 'existing'} token.`\n );\n return tokenUpdated\n ? changeListener(tokenResult.token)\n : Promise.resolve();\n };\n\n this.tokenListener = (tokenResult: AppCheckTokenResult) => {\n asyncQueue.enqueueRetryable(() => onTokenChanged(tokenResult));\n };\n\n const registerAppCheck = (appCheck: FirebaseAppCheckInternal): void => {\n logDebug('FirebaseAppCheckTokenProvider', 'AppCheck detected');\n this.appCheck = appCheck;\n this.appCheck.addTokenListener(this.tokenListener);\n };\n\n this.appCheckProvider.onInit(appCheck => registerAppCheck(appCheck));\n\n // Our users can initialize AppCheck after Firestore, so we give it\n // a chance to register itself with the component framework.\n setTimeout(() => {\n if (!this.appCheck) {\n const appCheck = this.appCheckProvider.getImmediate({ optional: true });\n if (appCheck) {\n registerAppCheck(appCheck);\n } else {\n // If AppCheck is still not available, proceed without it.\n logDebug(\n 'FirebaseAppCheckTokenProvider',\n 'AppCheck not yet detected'\n );\n }\n }\n }, 0);\n }\n\n getToken(): Promise<Token | null> {\n debugAssert(\n this.tokenListener != null,\n 'FirebaseAppCheckTokenProvider not started.'\n );\n\n const forceRefresh = this.forceRefresh;\n this.forceRefresh = false;\n\n if (!this.appCheck) {\n return Promise.resolve(null);\n }\n\n return this.appCheck.getToken(forceRefresh).then(tokenResult => {\n if (tokenResult) {\n hardAssert(\n typeof tokenResult.token === 'string',\n 'Invalid tokenResult returned from getToken():' + tokenResult\n );\n this.latestAppCheckToken = tokenResult.token;\n return new AppCheckToken(tokenResult.token);\n } else {\n return null;\n }\n });\n }\n\n invalidateToken(): void {\n this.forceRefresh = true;\n }\n\n shutdown(): void {\n if (this.appCheck) {\n this.appCheck.removeTokenListener(this.tokenListener!);\n }\n }\n}\n\n/**\n * An AppCheck token provider that always yields an empty token.\n * @internal\n */\nexport class EmptyAppCheckTokenProvider implements CredentialsProvider<string> {\n getToken(): Promise<Token | null> {\n return Promise.resolve<Token | null>(new AppCheckToken(''));\n }\n\n invalidateToken(): void {}\n\n start(\n asyncQueue: AsyncQueue,\n changeListener: CredentialChangeListener<string>\n ): void {}\n\n shutdown(): void {}\n}\n\n/** AppCheck token provider for the Lite SDK. */\nexport class LiteAppCheckTokenProvider implements CredentialsProvider<string> {\n private appCheck: FirebaseAppCheckInternal | null = null;\n\n constructor(\n private appCheckProvider: Provider<AppCheckInternalComponentName>\n ) {\n appCheckProvider.onInit(appCheck => {\n this.appCheck = appCheck;\n });\n }\n\n getToken(): Promise<Token | null> {\n if (!this.appCheck) {\n return Promise.resolve(null);\n }\n\n return this.appCheck.getToken().then(tokenResult => {\n if (tokenResult) {\n hardAssert(\n typeof tokenResult.token === 'string',\n 'Invalid tokenResult returned from getToken():' + tokenResult\n );\n return new AppCheckToken(tokenResult.token);\n } else {\n return null;\n }\n });\n }\n\n invalidateToken(): void {}\n\n start(\n asyncQueue: AsyncQueue,\n changeListener: CredentialChangeListener<string>\n ): void {}\n\n shutdown(): void {}\n}\n\n/**\n * Builds a CredentialsProvider depending on the type of\n * the credentials passed in.\n */\nexport function makeAuthCredentialsProvider(\n credentials?: CredentialsSettings\n): CredentialsProvider<User> {\n if (!credentials) {\n return new EmptyAuthCredentialsProvider();\n }\n\n switch (credentials['type']) {\n case 'gapi':\n const client = credentials['client'] as Gapi;\n return new FirstPartyAuthCredentialsProvider(\n client,\n credentials['sessionIndex'] || '0',\n credentials['iamToken'] || null,\n credentials['authTokenFactory'] || null\n );\n\n case 'provider':\n return credentials['client'];\n\n default:\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n 'makeAuthCredentialsProvider failed due to invalid credential type'\n );\n }\n}\n","import { FirebaseApp } from '@firebase/app';\n\nimport { Code, FirestoreError } from '../util/error';\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nexport class DatabaseInfo {\n /**\n * Constructs a DatabaseInfo using the provided host, databaseId and\n * persistenceKey.\n *\n * @param databaseId - The database to use.\n * @param appId - The Firebase App Id.\n * @param persistenceKey - A unique identifier for this Firestore's local\n * storage (used in conjunction with the databaseId).\n * @param host - The Firestore backend host to connect to.\n * @param ssl - Whether to use SSL when connecting.\n * @param forceLongPolling - Whether to use the forceLongPolling option\n * when using WebChannel as the network transport.\n * @param autoDetectLongPolling - Whether to use the detectBufferingProxy\n * option when using WebChannel as the network transport.\n * @param useFetchStreams Whether to use the Fetch API instead of\n * XMLHTTPRequest\n */\n constructor(\n readonly databaseId: DatabaseId,\n readonly appId: string,\n readonly persistenceKey: string,\n readonly host: string,\n readonly ssl: boolean,\n readonly forceLongPolling: boolean,\n readonly autoDetectLongPolling: boolean,\n readonly useFetchStreams: boolean\n ) {}\n}\n\n/** The default database name for a project. */\nexport const DEFAULT_DATABASE_NAME = '(default)';\n\n/**\n * Represents the database ID a Firestore client is associated with.\n * @internal\n */\nexport class DatabaseId {\n readonly database: string;\n constructor(readonly projectId: string, database?: string) {\n this.database = database ? database : DEFAULT_DATABASE_NAME;\n }\n\n static empty(): DatabaseId {\n return new DatabaseId('', '');\n }\n\n get isDefaultDatabase(): boolean {\n return this.database === DEFAULT_DATABASE_NAME;\n }\n\n isEqual(other: {}): boolean {\n return (\n other instanceof DatabaseId &&\n other.projectId === this.projectId &&\n other.database === this.database\n );\n }\n}\n\nexport function databaseIdFromApp(\n app: FirebaseApp,\n database?: string\n): DatabaseId {\n if (!Object.prototype.hasOwnProperty.apply(app.options, ['projectId'])) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n '\"projectId\" not provided in firebase.initializeApp.'\n );\n }\n\n return new DatabaseId(app.options.projectId!, database);\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { debugAssert, fail } from '../util/assert';\nimport { Code, FirestoreError } from '../util/error';\n\nexport const DOCUMENT_KEY_NAME = '__name__';\n\n/**\n * Path represents an ordered sequence of string segments.\n */\nabstract class BasePath<B extends BasePath<B>> {\n private segments: string[];\n private offset: number;\n private len: number;\n\n constructor(segments: string[], offset?: number, length?: number) {\n if (offset === undefined) {\n offset = 0;\n } else if (offset > segments.length) {\n fail('offset ' + offset + ' out of range ' + segments.length);\n }\n\n if (length === undefined) {\n length = segments.length - offset;\n } else if (length > segments.length - offset) {\n fail('length ' + length + ' out of range ' + (segments.length - offset));\n }\n this.segments = segments;\n this.offset = offset;\n this.len = length;\n }\n\n /**\n * Abstract constructor method to construct an instance of B with the given\n * parameters.\n */\n protected abstract construct(\n segments: string[],\n offset?: number,\n length?: number\n ): B;\n\n /**\n * Returns a String representation.\n *\n * Implementing classes are required to provide deterministic implementations as\n * the String representation is used to obtain canonical Query IDs.\n */\n abstract toString(): string;\n\n get length(): number {\n return this.len;\n }\n\n isEqual(other: B): boolean {\n return BasePath.comparator(this, other) === 0;\n }\n\n child(nameOrPath: string | B): B {\n const segments = this.segments.slice(this.offset, this.limit());\n if (nameOrPath instanceof BasePath) {\n nameOrPath.forEach(segment => {\n segments.push(segment);\n });\n } else {\n segments.push(nameOrPath);\n }\n return this.construct(segments);\n }\n\n /** The index of one past the last segment of the path. */\n private limit(): number {\n return this.offset + this.length;\n }\n\n popFirst(size?: number): B {\n size = size === undefined ? 1 : size;\n debugAssert(\n this.length >= size,\n \"Can't call popFirst() with less segments\"\n );\n return this.construct(\n this.segments,\n this.offset + size,\n this.length - size\n );\n }\n\n popLast(): B {\n debugAssert(!this.isEmpty(), \"Can't call popLast() on empty path\");\n return this.construct(this.segments, this.offset, this.length - 1);\n }\n\n firstSegment(): string {\n debugAssert(!this.isEmpty(), \"Can't call firstSegment() on empty path\");\n return this.segments[this.offset];\n }\n\n lastSegment(): string {\n debugAssert(!this.isEmpty(), \"Can't call lastSegment() on empty path\");\n return this.get(this.length - 1);\n }\n\n get(index: number): string {\n debugAssert(index < this.length, 'Index out of range');\n return this.segments[this.offset + index];\n }\n\n isEmpty(): boolean {\n return this.length === 0;\n }\n\n isPrefixOf(other: this): boolean {\n if (other.length < this.length) {\n return false;\n }\n\n for (let i = 0; i < this.length; i++) {\n if (this.get(i) !== other.get(i)) {\n return false;\n }\n }\n\n return true;\n }\n\n isImmediateParentOf(potentialChild: this): boolean {\n if (this.length + 1 !== potentialChild.length) {\n return false;\n }\n\n for (let i = 0; i < this.length; i++) {\n if (this.get(i) !== potentialChild.get(i)) {\n return false;\n }\n }\n\n return true;\n }\n\n forEach(fn: (segment: string) => void): void {\n for (let i = this.offset, end = this.limit(); i < end; i++) {\n fn(this.segments[i]);\n }\n }\n\n toArray(): string[] {\n return this.segments.slice(this.offset, this.limit());\n }\n\n static comparator<T extends BasePath<T>>(\n p1: BasePath<T>,\n p2: BasePath<T>\n ): number {\n const len = Math.min(p1.length, p2.length);\n for (let i = 0; i < len; i++) {\n const left = p1.get(i);\n const right = p2.get(i);\n if (left < right) {\n return -1;\n }\n if (left > right) {\n return 1;\n }\n }\n if (p1.length < p2.length) {\n return -1;\n }\n if (p1.length > p2.length) {\n return 1;\n }\n return 0;\n }\n}\n\n/**\n * A slash-separated path for navigating resources (documents and collections)\n * within Firestore.\n *\n * @internal\n */\nexport class ResourcePath extends BasePath<ResourcePath> {\n protected construct(\n segments: string[],\n offset?: number,\n length?: number\n ): ResourcePath {\n return new ResourcePath(segments, offset, length);\n }\n\n canonicalString(): string {\n // NOTE: The client is ignorant of any path segments containing escape\n // sequences (e.g. __id123__) and just passes them through raw (they exist\n // for legacy reasons and should not be used frequently).\n\n return this.toArray().join('/');\n }\n\n toString(): string {\n return this.canonicalString();\n }\n\n /**\n * Creates a resource path from the given slash-delimited string. If multiple\n * arguments are provided, all components are combined. Leading and trailing\n * slashes from all components are ignored.\n */\n static fromString(...pathComponents: string[]): ResourcePath {\n // NOTE: The client is ignorant of any path segments containing escape\n // sequences (e.g. __id123__) and just passes them through raw (they exist\n // for legacy reasons and should not be used frequently).\n\n const segments: string[] = [];\n for (const path of pathComponents) {\n if (path.indexOf('//') >= 0) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n `Invalid segment (${path}). Paths must not contain // in them.`\n );\n }\n // Strip leading and traling slashed.\n segments.push(...path.split('/').filter(segment => segment.length > 0));\n }\n\n return new ResourcePath(segments);\n }\n\n static emptyPath(): ResourcePath {\n return new ResourcePath([]);\n }\n}\n\nconst identifierRegExp = /^[_a-zA-Z][_a-zA-Z0-9]*$/;\n\n/**\n * A dot-separated path for navigating sub-objects within a document.\n * @internal\n */\nexport class FieldPath extends BasePath<FieldPath> {\n protected construct(\n segments: string[],\n offset?: number,\n length?: number\n ): FieldPath {\n return new FieldPath(segments, offset, length);\n }\n\n /**\n * Returns true if the string could be used as a segment in a field path\n * without escaping.\n */\n private static isValidIdentifier(segment: string): boolean {\n return identifierRegExp.test(segment);\n }\n\n canonicalString(): string {\n return this.toArray()\n .map(str => {\n str = str.replace(/\\\\/g, '\\\\\\\\').replace(/`/g, '\\\\`');\n if (!FieldPath.isValidIdentifier(str)) {\n str = '`' + str + '`';\n }\n return str;\n })\n .join('.');\n }\n\n toString(): string {\n return this.canonicalString();\n }\n\n /**\n * Returns true if this field references the key of a document.\n */\n isKeyField(): boolean {\n return this.length === 1 && this.get(0) === DOCUMENT_KEY_NAME;\n }\n\n /**\n * The field designating the key of a document.\n */\n static keyField(): FieldPath {\n return new FieldPath([DOCUMENT_KEY_NAME]);\n }\n\n /**\n * Parses a field string from the given server-formatted string.\n *\n * - Splitting the empty string is not allowed (for now at least).\n * - Empty segments within the string (e.g. if there are two consecutive\n * separators) are not allowed.\n *\n * TODO(b/37244157): we should make this more strict. Right now, it allows\n * non-identifier path components, even if they aren't escaped.\n */\n static fromServerFormat(path: string): FieldPath {\n const segments: string[] = [];\n let current = '';\n let i = 0;\n\n const addCurrentSegment = (): void => {\n if (current.length === 0) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n `Invalid field path (${path}). Paths must not be empty, begin ` +\n `with '.', end with '.', or contain '..'`\n );\n }\n segments.push(current);\n current = '';\n };\n\n let inBackticks = false;\n\n while (i < path.length) {\n const c = path[i];\n if (c === '\\\\') {\n if (i + 1 === path.length) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n 'Path has trailing escape character: ' + path\n );\n }\n const next = path[i + 1];\n if (!(next === '\\\\' || next === '.' || next === '`')) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n 'Path has invalid escape sequence: ' + path\n );\n }\n current += next;\n i += 2;\n } else if (c === '`') {\n inBackticks = !inBackticks;\n i++;\n } else if (c === '.' && !inBackticks) {\n addCurrentSegment();\n i++;\n } else {\n current += c;\n i++;\n }\n }\n addCurrentSegment();\n\n if (inBackticks) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n 'Unterminated ` in path: ' + path\n );\n }\n\n return new FieldPath(segments);\n }\n\n static emptyPath(): FieldPath {\n return new FieldPath([]);\n }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { debugAssert } from '../util/assert';\n\nimport { ResourcePath } from './path';\n\n/**\n * @internal\n */\nexport class DocumentKey {\n constructor(readonly path: ResourcePath) {\n debugAssert(\n DocumentKey.isDocumentKey(path),\n 'Invalid DocumentKey with an odd number of segments: ' +\n path.toArray().join('/')\n );\n }\n\n static fromPath(path: string): DocumentKey {\n return new DocumentKey(ResourcePath.fromString(path));\n }\n\n static fromName(name: string): DocumentKey {\n return new DocumentKey(ResourcePath.fromString(name).popFirst(5));\n }\n\n static empty(): DocumentKey {\n return new DocumentKey(ResourcePath.emptyPath());\n }\n\n get collectionGroup(): string {\n debugAssert(\n !this.path.isEmpty(),\n 'Cannot get collection group for empty key'\n );\n return this.path.popLast().lastSegment();\n }\n\n /** Returns true if the document is in the specified collectionId. */\n hasCollectionId(collectionId: string): boolean {\n return (\n this.path.length >= 2 &&\n this.path.get(this.path.length - 2) === collectionId\n );\n }\n\n /** Returns the collection group (i.e. the name of the parent collection) for this key. */\n getCollectionGroup(): string {\n debugAssert(\n !this.path.isEmpty(),\n 'Cannot get collection group for empty key'\n );\n return this.path.get(this.path.length - 2);\n }\n\n /** Returns the fully qualified path to the parent collection. */\n getCollectionPath(): ResourcePath {\n return this.path.popLast();\n }\n\n isEqual(other: DocumentKey | null): boolean {\n return (\n other !== null && ResourcePath.comparator(this.path, other.path) === 0\n );\n }\n\n toString(): string {\n return this.path.toString();\n }\n\n static comparator(k1: DocumentKey, k2: DocumentKey): number {\n return ResourcePath.comparator(k1.path, k2.path);\n }\n\n static isDocumentKey(path: ResourcePath): boolean {\n return path.length % 2 === 0;\n }\n\n /**\n * Creates and returns a new document key with the given segments.\n *\n * @param segments - The segments of the path to the document\n * @returns A new instance of DocumentKey\n */\n static fromSegments(segments: string[]): DocumentKey {\n return new DocumentKey(new ResourcePath(segments.slice()));\n }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { DocumentKey } from '../model/document_key';\nimport { ResourcePath } from '../model/path';\n\nimport { fail } from './assert';\nimport { Code, FirestoreError } from './error';\n\n/** Types accepted by validateType() and related methods for validation. */\nexport type ValidationType =\n | 'undefined'\n | 'object'\n | 'function'\n | 'boolean'\n | 'number'\n | 'string'\n | 'non-empty string';\n\nexport function validateNonEmptyArgument(\n functionName: string,\n argumentName: string,\n argument?: string\n): asserts argument is string {\n if (!argument) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n `Function ${functionName}() cannot be called with an empty ${argumentName}.`\n );\n }\n}\n\n/**\n * Validates that two boolean options are not set at the same time.\n * @internal\n */\nexport function validateIsNotUsedTogether(\n optionName1: string,\n argument1: boolean | undefined,\n optionName2: string,\n argument2: boolean | undefined\n): void {\n if (argument1 === true && argument2 === true) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n `${optionName1} and ${optionName2} cannot be used together.`\n );\n }\n}\n\n/**\n * Validates that `path` refers to a document (indicated by the fact it contains\n * an even numbers of segments).\n */\nexport function validateDocumentPath(path: ResourcePath): void {\n if (!DocumentKey.isDocumentKey(path)) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n `Invalid document reference. Document references must have an even number of segments, but ${path} has ${path.length}.`\n );\n }\n}\n\n/**\n * Validates that `path` refers to a collection (indicated by the fact it\n * contains an odd numbers of segments).\n */\nexport function validateCollectionPath(path: ResourcePath): void {\n if (DocumentKey.isDocumentKey(path)) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n `Invalid collection reference. Collection references must have an odd number of segments, but ${path} has ${path.length}.`\n );\n }\n}\n\n/**\n * Returns true if it's a non-null object without a custom prototype\n * (i.e. excludes Array, Date, etc.).\n */\nexport function isPlainObject(input: unknown): boolean {\n return (\n typeof input === 'object' &&\n input !== null &&\n (Object.getPrototypeOf(input) === Object.prototype ||\n Object.getPrototypeOf(input) === null)\n );\n}\n\n/** Returns a string describing the type / value of the provided input. */\nexport function valueDescription(input: unknown): string {\n if (input === undefined) {\n return 'undefined';\n } else if (input === null) {\n return 'null';\n } else if (typeof input === 'string') {\n if (input.length > 20) {\n input = `${input.substring(0, 20)}...`;\n }\n return JSON.stringify(input);\n } else if (typeof input === 'number' || typeof input === 'boolean') {\n return '' + input;\n } else if (typeof input === 'object') {\n if (input instanceof Array) {\n return 'an array';\n } else {\n const customObjectName = tryGetCustomObjectType(input!);\n if (customObjectName) {\n return `a custom ${customObjectName} object`;\n } else {\n return 'an object';\n }\n }\n } else if (typeof input === 'function') {\n return 'a function';\n } else {\n return fail('Unknown wrong type: ' + typeof input);\n }\n}\n\n/** try to get the constructor name for an object. */\nexport function tryGetCustomObjectType(input: object): string | null {\n if (input.constructor) {\n return input.constructor.name;\n }\n return null;\n}\n\n/**\n * Casts `obj` to `T`, optionally unwrapping Compat types to expose the\n * underlying instance. Throws if `obj` is not an instance of `T`.\n *\n * This cast is used in the Lite and Full SDK to verify instance types for\n * arguments passed to the public API.\n * @internal\n */\nexport function cast<T>(\n obj: object,\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n constructor: { new (...args: any[]): T }\n): T | never {\n if ('_delegate' in obj) {\n // Unwrap Compat types\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n obj = (obj as any)._delegate;\n }\n\n if (!(obj instanceof constructor)) {\n if (constructor.name === obj.constructor.name) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n 'Type does not match the expected instance. Did you pass a ' +\n `reference from a different Firestore SDK?`\n );\n } else {\n const description = valueDescription(obj);\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n `Expected type '${constructor.name}', but it was: ${description}`\n );\n }\n }\n return obj as T;\n}\n\nexport function validatePositiveNumber(functionName: string, n: number): void {\n if (n <= 0) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n `Function ${functionName}() requires a positive number, but it was: ${n}.`\n );\n }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/** Sentinel value that sorts before any Mutation Batch ID. */\nexport const BATCHID_UNKNOWN = -1;\n\n// An Object whose keys and values are strings.\nexport interface StringMap {\n [key: string]: string;\n}\n\n/**\n * Returns whether a variable is either undefined or null.\n */\nexport function isNullOrUndefined(value: unknown): value is null | undefined {\n return value === null || value === undefined;\n}\n\n/** Returns whether the value represents -0. */\nexport function isNegativeZero(value: number): boolean {\n // Detect if the value is -0.0. Based on polyfill from\n // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/is\n return value === 0 && 1 / value === 1 / -0;\n}\n\n/**\n * Returns whether a value is an integer and in the safe integer range\n * @param value - The value to test for being an integer and in the safe range\n */\nexport function isSafeInteger(value: unknown): boolean {\n return (\n typeof value === 'number' &&\n Number.isInteger(value) &&\n !isNegativeZero(value) &&\n value <= Number.MAX_SAFE_INTEGER &&\n value >= Number.MIN_SAFE_INTEGER\n );\n}\n\n/** The subset of the browser's Window interface used by the SDK. */\nexport interface WindowLike {\n readonly localStorage: Storage;\n readonly indexedDB: IDBFactory | null;\n addEventListener(type: string, listener: EventListener): void;\n removeEventListener(type: string, listener: EventListener): void;\n}\n\n/** The subset of the browser's Document interface used by the SDK. */\nexport interface DocumentLike {\n readonly visibilityState: DocumentVisibilityState;\n addEventListener(type: string, listener: EventListener): void;\n removeEventListener(type: string, listener: EventListener): void;\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { SDK_VERSION } from '../../src/core/version';\nimport { Token } from '../api/credentials';\nimport { DatabaseId, DatabaseInfo } from '../core/database_info';\nimport { debugAssert } from '../util/assert';\nimport { FirestoreError } from '../util/error';\nimport { logDebug, logWarn } from '../util/log';\nimport { StringMap } from '../util/types';\n\nimport { Connection, Stream } from './connection';\n\nconst LOG_TAG = 'RestConnection';\n\n/**\n * Maps RPC names to the corresponding REST endpoint name.\n *\n * We use array notation to avoid mangling.\n */\nconst RPC_NAME_URL_MAPPING: StringMap = {};\n\nRPC_NAME_URL_MAPPING['BatchGetDocuments'] = 'batchGet';\nRPC_NAME_URL_MAPPING['Commit'] = 'commit';\nRPC_NAME_URL_MAPPING['RunQuery'] = 'runQuery';\nRPC_NAME_URL_MAPPING['RunAggregationQuery'] = 'runAggregationQuery';\n\nconst RPC_URL_VERSION = 'v1';\n\n// SDK_VERSION is updated to different value at runtime depending on the entry point,\n// so we need to get its value when we need it in a function.\nfunction getGoogApiClientValue(): string {\n return 'gl-js/ fire/' + SDK_VERSION;\n}\n/**\n * Base class for all Rest-based connections to the backend (WebChannel and\n * HTTP).\n */\nexport abstract class RestConnection implements Connection {\n protected readonly databaseId: DatabaseId;\n protected readonly baseUrl: string;\n private readonly databaseRoot: string;\n\n get shouldResourcePathBeIncludedInRequest(): boolean {\n // Both `invokeRPC()` and `invokeStreamingRPC()` use their `path` arguments to determine\n // where to run the query, and expect the `request` to NOT specify the \"path\".\n return false;\n }\n\n constructor(private readonly databaseInfo: DatabaseInfo) {\n this.databaseId = databaseInfo.databaseId;\n const proto = databaseInfo.ssl ? 'https' : 'http';\n this.baseUrl = proto + '://' + databaseInfo.host;\n this.databaseRoot =\n 'projects/' +\n this.databaseId.projectId +\n '/databases/' +\n this.databaseId.database +\n '/documents';\n }\n\n invokeRPC<Req, Resp>(\n rpcName: string,\n path: string,\n req: Req,\n authToken: Token | null,\n appCheckToken: Token | null\n ): Promise<Resp> {\n const url = this.makeUrl(rpcName, path);\n logDebug(LOG_TAG, 'Sending: ', url, req);\n\n const headers = {};\n this.modifyHeadersForRequest(headers, authToken, appCheckToken);\n\n return this.performRPCRequest<Req, Resp>(rpcName, url, headers, req).then(\n response => {\n logDebug(LOG_TAG, 'Received: ', response);\n return response;\n },\n (err: FirestoreError) => {\n logWarn(\n LOG_TAG,\n `${rpcName} failed with error: `,\n err,\n 'url: ',\n url,\n 'request:',\n req\n );\n throw err;\n }\n );\n }\n\n invokeStreamingRPC<Req, Resp>(\n rpcName: string,\n path: string,\n request: Req,\n authToken: Token | null,\n appCheckToken: Token | null,\n expectedResponseCount?: number\n ): Promise<Resp[]> {\n // The REST API automatically aggregates all of the streamed results, so we\n // can just use the normal invoke() method.\n return this.invokeRPC<Req, Resp[]>(\n rpcName,\n path,\n request,\n authToken,\n appCheckToken\n );\n }\n\n abstract openStream<Req, Resp>(\n rpcName: string,\n authToken: Token | null,\n appCheckToken: Token | null\n ): Stream<Req, Resp>;\n\n /**\n * Modifies the headers for a request, adding any authorization token if\n * present and any additional headers for the request.\n */\n protected modifyHeadersForRequest(\n headers: StringMap,\n authToken: Token | null,\n appCheckToken: Token | null\n ): void {\n headers['X-Goog-Api-Client'] = getGoogApiClientValue();\n\n // Content-Type: text/plain will avoid preflight requests which might\n // mess with CORS and redirects by proxies. If we add custom headers\n // we will need to change this code to potentially use the $httpOverwrite\n // parameter supported by ESF to avoid triggering preflight requests.\n headers['Content-Type'] = 'text/plain';\n\n if (this.databaseInfo.appId) {\n headers['X-Firebase-GMPID'] = this.databaseInfo.appId;\n }\n\n if (authToken) {\n authToken.headers.forEach((value, key) => (headers[key] = value));\n }\n if (appCheckToken) {\n appCheckToken.headers.forEach((value, key) => (headers[key] = value));\n }\n }\n\n /**\n * Performs an RPC request using an implementation specific networking layer.\n */\n protected abstract performRPCRequest<Req, Resp>(\n rpcName: string,\n url: string,\n headers: StringMap,\n body: Req\n ): Promise<Resp>;\n\n private makeUrl(rpcName: string, path: string): string {\n const urlRpcName = RPC_NAME_URL_MAPPING[rpcName];\n debugAssert(\n urlRpcName !== undefined,\n 'Unknown REST mapping for: ' + rpcName\n );\n return `${this.baseUrl}/${RPC_URL_VERSION}/${path}:${urlRpcName}`;\n }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { fail } from '../util/assert';\nimport { Code } from '../util/error';\nimport { logError } from '../util/log';\n\n/**\n * Error Codes describing the different ways GRPC can fail. These are copied\n * directly from GRPC's sources here:\n *\n * https://github.com/grpc/grpc/blob/bceec94ea4fc5f0085d81235d8e1c06798dc341a/include/grpc%2B%2B/impl/codegen/status_code_enum.h\n *\n * Important! The names of these identifiers matter because the string forms\n * are used for reverse lookups from the webchannel stream. Do NOT change the\n * names of these identifiers or change this into a const enum.\n */\nenum RpcCode {\n OK = 0,\n CANCELLED = 1,\n UNKNOWN = 2,\n INVALID_ARGUMENT = 3,\n DEADLINE_EXCEEDED = 4,\n NOT_FOUND = 5,\n ALREADY_EXISTS = 6,\n PERMISSION_DENIED = 7,\n UNAUTHENTICATED = 16,\n RESOURCE_EXHAUSTED = 8,\n FAILED_PRECONDITION = 9,\n ABORTED = 10,\n OUT_OF_RANGE = 11,\n UNIMPLEMENTED = 12,\n INTERNAL = 13,\n UNAVAILABLE = 14,\n DATA_LOSS = 15\n}\n\n/**\n * Determines whether an error code represents a permanent error when received\n * in response to a non-write operation.\n *\n * See isPermanentWriteError for classifying write errors.\n */\nexport function isPermanentError(code: Code): boolean {\n switch (code) {\n case Code.OK:\n return fail('Treated status OK as error');\n case Code.CANCELLED:\n case Code.UNKNOWN:\n case Code.DEADLINE_EXCEEDED:\n case Code.RESOURCE_EXHAUSTED:\n case Code.INTERNAL:\n case Code.UNAVAILABLE:\n // Unauthenticated means something went wrong with our token and we need\n // to retry with new credentials which will happen automatically.\n case Code.UNAUTHENTICATED:\n return false;\n case Code.INVALID_ARGUMENT:\n case Code.NOT_FOUND:\n case Code.ALREADY_EXISTS:\n case Code.PERMISSION_DENIED:\n case Code.FAILED_PRECONDITION:\n // Aborted might be retried in some scenarios, but that is dependant on\n // the context and should handled individually by the calling code.\n // See https://cloud.google.com/apis/design/errors.\n case Code.ABORTED:\n case Code.OUT_OF_RANGE:\n case Code.UNIMPLEMENTED:\n case Code.DATA_LOSS:\n return true;\n default:\n return fail('Unknown status code: ' + code);\n }\n}\n\n/**\n * Determines whether an error code represents a permanent error when received\n * in response to a write operation.\n *\n * Write operations must be handled specially because as of b/119437764, ABORTED\n * errors on the write stream should be retried too (even though ABORTED errors\n * are not generally retryable).\n *\n * Note that during the initial handshake on the write stream an ABORTED error\n * signals that we should discard our stream token (i.e. it is permanent). This\n * means a handshake error should be classified with isPermanentError, above.\n */\nexport function isPermanentWriteError(code: Code): boolean {\n return isPermanentError(code) && code !== Code.ABORTED;\n}\n\n/**\n * Maps an error Code from a GRPC status identifier like 'NOT_FOUND'.\n *\n * @returns The Code equivalent to the given status string or undefined if\n * there is no match.\n */\nexport function mapCodeFromRpcStatus(status: string): Code | undefined {\n // lookup by string\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n const code: RpcCode = RpcCode[status as any] as any;\n if (code === undefined) {\n return undefined;\n }\n\n return mapCodeFromRpcCode(code);\n}\n\n/**\n * Maps an error Code from GRPC status code number, like 0, 1, or 14. These\n * are not the same as HTTP status codes.\n *\n * @returns The Code equivalent to the given GRPC status code. Fails if there\n * is no match.\n */\nexport function mapCodeFromRpcCode(code: number | undefined): Code {\n if (code === undefined) {\n // This shouldn't normally happen, but in certain error cases (like trying\n // to send invalid proto messages) we may get an error with no GRPC code.\n logError('GRPC error has no .code');\n return Code.UNKNOWN;\n }\n\n switch (code) {\n case RpcCode.OK:\n return Code.OK;\n case RpcCode.CANCELLED:\n return Code.CANCELLED;\n case RpcCode.UNKNOWN:\n return Code.UNKNOWN;\n case RpcCode.DEADLINE_EXCEEDED:\n return Code.DEADLINE_EXCEEDED;\n case RpcCode.RESOURCE_EXHAUSTED:\n return Code.RESOURCE_EXHAUSTED;\n case RpcCode.INTERNAL:\n return Code.INTERNAL;\n case RpcCode.UNAVAILABLE:\n return Code.UNAVAILABLE;\n case RpcCode.UNAUTHENTICATED:\n return Code.UNAUTHENTICATED;\n case RpcCode.INVALID_ARGUMENT:\n return Code.INVALID_ARGUMENT;\n case RpcCode.NOT_FOUND:\n return Code.NOT_FOUND;\n case RpcCode.ALREADY_EXISTS:\n return Code.ALREADY_EXISTS;\n case RpcCode.PERMISSION_DENIED:\n return Code.PERMISSION_DENIED;\n case RpcCode.FAILED_PRECONDITION:\n return Code.FAILED_PRECONDITION;\n case RpcCode.ABORTED:\n return Code.ABORTED;\n case RpcCode.OUT_OF_RANGE:\n return Code.OUT_OF_RANGE;\n case RpcCode.UNIMPLEMENTED:\n return Code.UNIMPLEMENTED;\n case RpcCode.DATA_LOSS:\n return Code.DATA_LOSS;\n default:\n return fail('Unknown status code: ' + code);\n }\n}\n\n/**\n * Maps an RPC code from a Code. This is the reverse operation from\n * mapCodeFromRpcCode and should really only be used in tests.\n */\nexport function mapRpcCodeFromCode(code: Code | undefined): number {\n if (code === undefined) {\n return RpcCode.OK;\n }\n\n switch (code) {\n case Code.OK:\n return RpcCode.OK;\n case Code.CANCELLED:\n return RpcCode.CANCELLED;\n case Code.UNKNOWN:\n return RpcCode.UNKNOWN;\n case Code.DEADLINE_EXCEEDED:\n return RpcCode.DEADLINE_EXCEEDED;\n case Code.RESOURCE_EXHAUSTED:\n return RpcCode.RESOURCE_EXHAUSTED;\n case Code.INTERNAL:\n return RpcCode.INTERNAL;\n case Code.UNAVAILABLE:\n return RpcCode.UNAVAILABLE;\n case Code.UNAUTHENTICATED:\n return RpcCode.UNAUTHENTICATED;\n case Code.INVALID_ARGUMENT:\n return RpcCode.INVALID_ARGUMENT;\n case Code.NOT_FOUND:\n return RpcCode.NOT_FOUND;\n case Code.ALREADY_EXISTS:\n return RpcCode.ALREADY_EXISTS;\n case Code.PERMISSION_DENIED:\n return RpcCode.PERMISSION_DENIED;\n case Code.FAILED_PRECONDITION:\n return RpcCode.FAILED_PRECONDITION;\n case Code.ABORTED:\n return RpcCode.ABORTED;\n case Code.OUT_OF_RANGE:\n return RpcCode.OUT_OF_RANGE;\n case Code.UNIMPLEMENTED:\n return RpcCode.UNIMPLEMENTED;\n case Code.DATA_LOSS:\n return RpcCode.DATA_LOSS;\n default:\n return fail('Unknown status code: ' + code);\n }\n}\n\n/**\n * Converts an HTTP Status Code to the equivalent error code.\n *\n * @param status - An HTTP Status Code, like 200, 404, 503, etc.\n * @returns The equivalent Code. Unknown status codes are mapped to\n * Code.UNKNOWN.\n */\nexport function mapCodeFromHttpStatus(status?: number): Code {\n if (status === undefined) {\n logError('RPC_ERROR', 'HTTP error has no status');\n return Code.UNKNOWN;\n }\n\n // The canonical error codes for Google APIs [1] specify mapping onto HTTP\n // status codes but the mapping is not bijective. In each case of ambiguity\n // this function chooses a primary error.\n //\n // [1]\n // https://github.com/googleapis/googleapis/blob/master/google/rpc/code.proto\n switch (status) {\n case 200: // OK\n return Code.OK;\n\n case 400: // Bad Request\n return Code.FAILED_PRECONDITION;\n // Other possibilities based on the forward mapping\n // return Code.INVALID_ARGUMENT;\n // return Code.OUT_OF_RANGE;\n\n case 401: // Unauthorized\n return Code.UNAUTHENTICATED;\n\n case 403: // Forbidden\n return Code.PERMISSION_DENIED;\n\n case 404: // Not Found\n return Code.NOT_FOUND;\n\n case 409: // Conflict\n return Code.ABORTED;\n // Other possibilities:\n // return Code.ALREADY_EXISTS;\n\n case 416: // Range Not Satisfiable\n return Code.OUT_OF_RANGE;\n\n case 429: // Too Many Requests\n return Code.RESOURCE_EXHAUSTED;\n\n case 499: // Client Closed Request\n return Code.CANCELLED;\n\n case 500: // Internal Server Error\n return Code.UNKNOWN;\n // Other possibilities:\n // return Code.INTERNAL;\n // return Code.DATA_LOSS;\n\n case 501: // Unimplemented\n return Code.UNIMPLEMENTED;\n\n case 503: // Service Unavailable\n return Code.UNAVAILABLE;\n\n case 504: // Gateway Timeout\n return Code.DEADLINE_EXCEEDED;\n\n default:\n if (status >= 200 && status < 300) {\n return Code.OK;\n }\n if (status >= 400 && status < 500) {\n return Code.FAILED_PRECONDITION;\n }\n if (status >= 500 && status < 600) {\n return Code.INTERNAL;\n }\n return Code.UNKNOWN;\n }\n}\n\n/**\n * Converts an HTTP response's error status to the equivalent error code.\n *\n * @param status - An HTTP error response status (\"FAILED_PRECONDITION\",\n * \"UNKNOWN\", etc.)\n * @returns The equivalent Code. Non-matching responses are mapped to\n * Code.UNKNOWN.\n */\nexport function mapCodeFromHttpResponseErrorStatus(status: string): Code {\n const serverError = status.toLowerCase().replace(/_/g, '-');\n return Object.values(Code).indexOf(serverError as Code) >= 0\n ? (serverError as Code)\n : Code.UNKNOWN;\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Token } from '../../api/credentials';\nimport { DatabaseInfo } from '../../core/database_info';\nimport { Stream } from '../../remote/connection';\nimport { RestConnection } from '../../remote/rest_connection';\nimport { mapCodeFromHttpStatus } from '../../remote/rpc_error';\nimport { FirestoreError } from '../../util/error';\nimport { StringMap } from '../../util/types';\n\n/**\n * A Rest-based connection that relies on the native HTTP stack\n * (e.g. `fetch` or a polyfill).\n */\nexport class FetchConnection extends RestConnection {\n /**\n * @param databaseInfo - The connection info.\n * @param fetchImpl - `fetch` or a Polyfill that implements the fetch API.\n */\n constructor(\n databaseInfo: DatabaseInfo,\n private readonly fetchImpl: typeof fetch\n ) {\n super(databaseInfo);\n }\n\n openStream<Req, Resp>(\n rpcName: string,\n token: Token | null\n ): Stream<Req, Resp> {\n throw new Error('Not supported by FetchConnection');\n }\n\n protected async performRPCRequest<Req, Resp>(\n rpcName: string,\n url: string,\n headers: StringMap,\n body: Req\n ): Promise<Resp> {\n const requestJson = JSON.stringify(body);\n let response: Response;\n\n try {\n response = await this.fetchImpl(url, {\n method: 'POST',\n headers,\n body: requestJson\n });\n } catch (e) {\n const err = e as { status: number | undefined; statusText: string };\n throw new FirestoreError(\n mapCodeFromHttpStatus(err.status),\n 'Request failed with error: ' + err.statusText\n );\n }\n\n if (!response.ok) {\n let errorResponse = await response.json();\n if (Array.isArray(errorResponse)) {\n errorResponse = errorResponse[0];\n }\n const errorMessage = errorResponse?.error?.message;\n throw new FirestoreError(\n mapCodeFromHttpStatus(response.status),\n `Request failed with error: ${errorMessage ?? response.statusText}`\n );\n }\n\n return response.json();\n }\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { debugAssert } from '../../util/assert';\n\n/**\n * Generates `nBytes` of random bytes.\n *\n * If `nBytes < 0` , an error will be thrown.\n */\nexport function randomBytes(nBytes: number): Uint8Array {\n debugAssert(nBytes >= 0, `Expecting non-negative nBytes, got: ${nBytes}`);\n\n // Polyfills for IE and WebWorker by using `self` and `msCrypto` when `crypto` is not available.\n const crypto =\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n typeof self !== 'undefined' && (self.crypto || (self as any)['msCrypto']);\n const bytes = new Uint8Array(nBytes);\n if (crypto && typeof crypto.getRandomValues === 'function') {\n crypto.getRandomValues(bytes);\n } else {\n // Falls back to Math.random\n for (let i = 0; i < nBytes; i++) {\n bytes[i] = Math.floor(Math.random() * 256);\n }\n }\n return bytes;\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { randomBytes } from '../platform/random_bytes';\n\nimport { debugAssert } from './assert';\n\nexport type EventHandler<E> = (value: E) => void;\nexport interface Indexable {\n [k: string]: unknown;\n}\n\nexport class AutoId {\n static newId(): string {\n // Alphanumeric characters\n const chars =\n 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789';\n // The largest byte value that is a multiple of `char.length`.\n const maxMultiple = Math.floor(256 / chars.length) * chars.length;\n debugAssert(\n 0 < maxMultiple && maxMultiple < 256,\n `Expect maxMultiple to be (0, 256), but got ${maxMultiple}`\n );\n\n let autoId = '';\n const targetLength = 20;\n while (autoId.length < targetLength) {\n const bytes = randomBytes(40);\n for (let i = 0; i < bytes.length; ++i) {\n // Only accept values that are [0, maxMultiple), this ensures they can\n // be evenly mapped to indices of `chars` via a modulo operation.\n if (autoId.length < targetLength && bytes[i] < maxMultiple) {\n autoId += chars.charAt(bytes[i] % chars.length);\n }\n }\n }\n debugAssert(autoId.length === targetLength, 'Invalid auto ID: ' + autoId);\n\n return autoId;\n }\n}\n\nexport function primitiveComparator<T>(left: T, right: T): number {\n if (left < right) {\n return -1;\n }\n if (left > right) {\n return 1;\n }\n return 0;\n}\n\nexport interface Equatable<T> {\n isEqual(other: T): boolean;\n}\n\nexport interface Iterable<V> {\n forEach: (cb: (v: V) => void) => void;\n}\n\n/** Helper to compare arrays using isEqual(). */\nexport function arrayEquals<T>(\n left: T[],\n right: T[],\n comparator: (l: T, r: T) => boolean\n): boolean {\n if (left.length !== right.length) {\n return false;\n }\n return left.every((value, index) => comparator(value, right[index]));\n}\n/**\n * Returns the immediate lexicographically-following string. This is useful to\n * construct an inclusive range for indexeddb iterators.\n */\nexport function immediateSuccessor(s: string): string {\n // Return the input string, with an additional NUL byte appended.\n return s + '\\0';\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { debugAssert } from './assert';\n\nexport interface Dict<V> {\n [stringKey: string]: V;\n}\n\nexport function objectSize(obj: object): number {\n let count = 0;\n for (const key in obj) {\n if (Object.prototype.hasOwnProperty.call(obj, key)) {\n count++;\n }\n }\n return count;\n}\n\nexport function forEach<V>(\n obj: Dict<V> | undefined,\n fn: (key: string, val: V) => void\n): void {\n for (const key in obj) {\n if (Object.prototype.hasOwnProperty.call(obj, key)) {\n fn(key, obj[key]);\n }\n }\n}\n\nexport function isEmpty<V>(obj: Dict<V>): boolean {\n debugAssert(\n obj != null && typeof obj === 'object',\n 'isEmpty() expects object parameter.'\n );\n for (const key in obj) {\n if (Object.prototype.hasOwnProperty.call(obj, key)) {\n return false;\n }\n }\n return true;\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { decodeBase64, encodeBase64 } from '../platform/base64';\n\nimport { primitiveComparator } from './misc';\n\n/**\n * Immutable class that represents a \"proto\" byte string.\n *\n * Proto byte strings can either be Base64-encoded strings or Uint8Arrays when\n * sent on the wire. This class abstracts away this differentiation by holding\n * the proto byte string in a common class that must be converted into a string\n * before being sent as a proto.\n * @internal\n */\nexport class ByteString {\n static readonly EMPTY_BYTE_STRING = new ByteString('');\n\n private constructor(private readonly binaryString: string) {}\n\n static fromBase64String(base64: string): ByteString {\n const binaryString = decodeBase64(base64);\n return new ByteString(binaryString);\n }\n\n static fromUint8Array(array: Uint8Array): ByteString {\n // TODO(indexing); Remove the copy of the byte string here as this method\n // is frequently called during indexing.\n const binaryString = binaryStringFromUint8Array(array);\n return new ByteString(binaryString);\n }\n\n [Symbol.iterator](): Iterator<number> {\n let i = 0;\n return {\n next: () => {\n if (i < this.binaryString.length) {\n return { value: this.binaryString.charCodeAt(i++), done: false };\n } else {\n return { value: undefined, done: true };\n }\n }\n };\n }\n\n toBase64(): string {\n return encodeBase64(this.binaryString);\n }\n\n toUint8Array(): Uint8Array {\n return uint8ArrayFromBinaryString(this.binaryString);\n }\n\n approximateByteSize(): number {\n return this.binaryString.length * 2;\n }\n\n compareTo(other: ByteString): number {\n return primitiveComparator(this.binaryString, other.binaryString);\n }\n\n isEqual(other: ByteString): boolean {\n return this.binaryString === other.binaryString;\n }\n}\n\n/**\n * Helper function to convert an Uint8array to a binary string.\n */\nexport function binaryStringFromUint8Array(array: Uint8Array): string {\n let binaryString = '';\n for (let i = 0; i < array.length; ++i) {\n binaryString += String.fromCharCode(array[i]);\n }\n return binaryString;\n}\n\n/**\n * Helper function to convert a binary string to an Uint8Array.\n */\nexport function uint8ArrayFromBinaryString(binaryString: string): Uint8Array {\n const buffer = new Uint8Array(binaryString.length);\n for (let i = 0; i < binaryString.length; i++) {\n buffer[i] = binaryString.charCodeAt(i);\n }\n return buffer;\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/** Converts a Base64 encoded string to a binary string. */\nexport function decodeBase64(encoded: string): string {\n return atob(encoded);\n}\n\n/** Converts a binary string to a Base64 encoded string. */\nexport function encodeBase64(raw: string): string {\n return btoa(raw);\n}\n\n/** True if and only if the Base64 conversion functions are available. */\nexport function isBase64Available(): boolean {\n return typeof atob !== 'undefined';\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Timestamp } from '../protos/firestore_proto_api';\nimport { hardAssert } from '../util/assert';\nimport { ByteString } from '../util/byte_string';\n\n// A RegExp matching ISO 8601 UTC timestamps with optional fraction.\nconst ISO_TIMESTAMP_REG_EXP = new RegExp(\n /^\\d{4}-\\d\\d-\\d\\dT\\d\\d:\\d\\d:\\d\\d(?:\\.(\\d+))?Z$/\n);\n\n/**\n * Converts the possible Proto values for a timestamp value into a \"seconds and\n * nanos\" representation.\n */\nexport function normalizeTimestamp(date: Timestamp): {\n seconds: number;\n nanos: number;\n} {\n hardAssert(!!date, 'Cannot normalize null or undefined timestamp.');\n\n // The json interface (for the browser) will return an iso timestamp string,\n // while the proto js library (for node) will return a\n // google.protobuf.Timestamp instance.\n if (typeof date === 'string') {\n // The date string can have higher precision (nanos) than the Date class\n // (millis), so we do some custom parsing here.\n\n // Parse the nanos right out of the string.\n let nanos = 0;\n const fraction = ISO_TIMESTAMP_REG_EXP.exec(date);\n hardAssert(!!fraction, 'invalid timestamp: ' + date);\n if (fraction[1]) {\n // Pad the fraction out to 9 digits (nanos).\n let nanoStr = fraction[1];\n nanoStr = (nanoStr + '000000000').substr(0, 9);\n nanos = Number(nanoStr);\n }\n\n // Parse the date to get the seconds.\n const parsedDate = new Date(date);\n const seconds = Math.floor(parsedDate.getTime() / 1000);\n\n return { seconds, nanos };\n } else {\n // TODO(b/37282237): Use strings for Proto3 timestamps\n // assert(!this.options.useProto3Json,\n // 'The timestamp instance format requires Proto JS.');\n const seconds = normalizeNumber(date.seconds);\n const nanos = normalizeNumber(date.nanos);\n return { seconds, nanos };\n }\n}\n\n/**\n * Converts the possible Proto types for numbers into a JavaScript number.\n * Returns 0 if the value is not numeric.\n */\nexport function normalizeNumber(value: number | string | undefined): number {\n // TODO(bjornick): Handle int64 greater than 53 bits.\n if (typeof value === 'number') {\n return value;\n } else if (typeof value === 'string') {\n return Number(value);\n } else {\n return 0;\n }\n}\n\n/** Converts the possible Proto types for Blobs into a ByteString. */\nexport function normalizeByteString(blob: string | Uint8Array): ByteString {\n if (typeof blob === 'string') {\n return ByteString.fromBase64String(blob);\n } else {\n return ByteString.fromUint8Array(blob);\n }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Code, FirestoreError } from '../util/error';\nimport { primitiveComparator } from '../util/misc';\n\n// The earliest date supported by Firestore timestamps (0001-01-01T00:00:00Z).\nconst MIN_SECONDS = -62135596800;\n\n// Number of nanoseconds in a millisecond.\nconst MS_TO_NANOS = 1e6;\n\n/**\n * A `Timestamp` represents a point in time independent of any time zone or\n * calendar, represented as seconds and fractions of seconds at nanosecond\n * resolution in UTC Epoch time.\n *\n * It is encoded using the Proleptic Gregorian Calendar which extends the\n * Gregorian calendar backwards to year one. It is encoded assuming all minutes\n * are 60 seconds long, i.e. leap seconds are \"smeared\" so that no leap second\n * table is needed for interpretation. Range is from 0001-01-01T00:00:00Z to\n * 9999-12-31T23:59:59.999999999Z.\n *\n * For examples and further specifications, refer to the\n * {@link https://github.com/google/protobuf/blob/master/src/google/protobuf/timestamp.proto | Timestamp definition}.\n */\nexport class Timestamp {\n /**\n * Creates a new timestamp with the current date, with millisecond precision.\n *\n * @returns a new timestamp representing the current date.\n */\n static now(): Timestamp {\n return Timestamp.fromMillis(Date.now());\n }\n\n /**\n * Creates a new timestamp from the given date.\n *\n * @param date - The date to initialize the `Timestamp` from.\n * @returns A new `Timestamp` representing the same point in time as the given\n * date.\n */\n static fromDate(date: Date): Timestamp {\n return Timestamp.fromMillis(date.getTime());\n }\n\n /**\n * Creates a new timestamp from the given number of milliseconds.\n *\n * @param milliseconds - Number of milliseconds since Unix epoch\n * 1970-01-01T00:00:00Z.\n * @returns A new `Timestamp` representing the same point in time as the given\n * number of milliseconds.\n */\n static fromMillis(milliseconds: number): Timestamp {\n const seconds = Math.floor(milliseconds / 1000);\n const nanos = Math.floor((milliseconds - seconds * 1000) * MS_TO_NANOS);\n return new Timestamp(seconds, nanos);\n }\n\n /**\n * Creates a new timestamp.\n *\n * @param seconds - The number of seconds of UTC time since Unix epoch\n * 1970-01-01T00:00:00Z. Must be from 0001-01-01T00:00:00Z to\n * 9999-12-31T23:59:59Z inclusive.\n * @param nanoseconds - The non-negative fractions of a second at nanosecond\n * resolution. Negative second values with fractions must still have\n * non-negative nanoseconds values that count forward in time. Must be\n * from 0 to 999,999,999 inclusive.\n */\n constructor(\n /**\n * The number of seconds of UTC time since Unix epoch 1970-01-01T00:00:00Z.\n */\n readonly seconds: number,\n /**\n * The fractions of a second at nanosecond resolution.*\n */\n readonly nanoseconds: number\n ) {\n if (nanoseconds < 0) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n 'Timestamp nanoseconds out of range: ' + nanoseconds\n );\n }\n if (nanoseconds >= 1e9) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n 'Timestamp nanoseconds out of range: ' + nanoseconds\n );\n }\n if (seconds < MIN_SECONDS) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n 'Timestamp seconds out of range: ' + seconds\n );\n }\n // This will break in the year 10,000.\n if (seconds >= 253402300800) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n 'Timestamp seconds out of range: ' + seconds\n );\n }\n }\n\n /**\n * Converts a `Timestamp` to a JavaScript `Date` object. This conversion\n * causes a loss of precision since `Date` objects only support millisecond\n * precision.\n *\n * @returns JavaScript `Date` object representing the same point in time as\n * this `Timestamp`, with millisecond precision.\n */\n toDate(): Date {\n return new Date(this.toMillis());\n }\n\n /**\n * Converts a `Timestamp` to a numeric timestamp (in milliseconds since\n * epoch). This operation causes a loss of precision.\n *\n * @returns The point in time corresponding to this timestamp, represented as\n * the number of milliseconds since Unix epoch 1970-01-01T00:00:00Z.\n */\n toMillis(): number {\n return this.seconds * 1000 + this.nanoseconds / MS_TO_NANOS;\n }\n\n _compareTo(other: Timestamp): number {\n if (this.seconds === other.seconds) {\n return primitiveComparator(this.nanoseconds, other.nanoseconds);\n }\n return primitiveComparator(this.seconds, other.seconds);\n }\n\n /**\n * Returns true if this `Timestamp` is equal to the provided one.\n *\n * @param other - The `Timestamp` to compare against.\n * @returns true if this `Timestamp` is equal to the provided one.\n */\n isEqual(other: Timestamp): boolean {\n return (\n other.seconds === this.seconds && other.nanoseconds === this.nanoseconds\n );\n }\n\n /** Returns a textual representation of this `Timestamp`. */\n toString(): string {\n return (\n 'Timestamp(seconds=' +\n this.seconds +\n ', nanoseconds=' +\n this.nanoseconds +\n ')'\n );\n }\n\n /** Returns a JSON-serializable representation of this `Timestamp`. */\n toJSON(): { seconds: number; nanoseconds: number } {\n return { seconds: this.seconds, nanoseconds: this.nanoseconds };\n }\n\n /**\n * Converts this object to a primitive string, which allows `Timestamp` objects\n * to be compared using the `>`, `<=`, `>=` and `>` operators.\n */\n valueOf(): string {\n // This method returns a string of the form <seconds>.<nanoseconds> where\n // <seconds> is translated to have a non-negative value and both <seconds>\n // and <nanoseconds> are left-padded with zeroes to be a consistent length.\n // Strings with this format then have a lexiographical ordering that matches\n // the expected ordering. The <seconds> translation is done to avoid having\n // a leading negative sign (i.e. a leading '-' character) in its string\n // representation, which would affect its lexiographical ordering.\n const adjustedSeconds = this.seconds - MIN_SECONDS;\n // Note: Up to 12 decimal digits are required to represent all valid\n // 'seconds' values.\n const formattedSeconds = String(adjustedSeconds).padStart(12, '0');\n const formattedNanoseconds = String(this.nanoseconds).padStart(9, '0');\n return formattedSeconds + '.' + formattedNanoseconds;\n }\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Timestamp } from '../lite-api/timestamp';\nimport {\n Value as ProtoValue,\n MapValue as ProtoMapValue\n} from '../protos/firestore_proto_api';\n\nimport { normalizeTimestamp } from './normalize';\n\n/**\n * Represents a locally-applied ServerTimestamp.\n *\n * Server Timestamps are backed by MapValues that contain an internal field\n * `__type__` with a value of `server_timestamp`. The previous value and local\n * write time are stored in its `__previous_value__` and `__local_write_time__`\n * fields respectively.\n *\n * Notes:\n * - ServerTimestampValue instances are created as the result of applying a\n * transform. They can only exist in the local view of a document. Therefore\n * they do not need to be parsed or serialized.\n * - When evaluated locally (e.g. for snapshot.data()), they by default\n * evaluate to `null`. This behavior can be configured by passing custom\n * FieldValueOptions to value().\n * - With respect to other ServerTimestampValues, they sort by their\n * localWriteTime.\n */\n\nconst SERVER_TIMESTAMP_SENTINEL = 'server_timestamp';\nconst TYPE_KEY = '__type__';\nconst PREVIOUS_VALUE_KEY = '__previous_value__';\nconst LOCAL_WRITE_TIME_KEY = '__local_write_time__';\n\nexport function isServerTimestamp(value: ProtoValue | null): boolean {\n const type = (value?.mapValue?.fields || {})[TYPE_KEY]?.stringValue;\n return type === SERVER_TIMESTAMP_SENTINEL;\n}\n\n/**\n * Creates a new ServerTimestamp proto value (using the internal format).\n */\nexport function serverTimestamp(\n localWriteTime: Timestamp,\n previousValue: ProtoValue | null\n): ProtoValue {\n const mapValue: ProtoMapValue = {\n fields: {\n [TYPE_KEY]: {\n stringValue: SERVER_TIMESTAMP_SENTINEL\n },\n [LOCAL_WRITE_TIME_KEY]: {\n timestampValue: {\n seconds: localWriteTime.seconds,\n nanos: localWriteTime.nanoseconds\n }\n }\n }\n };\n\n if (previousValue) {\n mapValue.fields![PREVIOUS_VALUE_KEY] = previousValue;\n }\n\n return { mapValue };\n}\n\n/**\n * Returns the value of the field before this ServerTimestamp was set.\n *\n * Preserving the previous values allows the user to display the last resoled\n * value until the backend responds with the timestamp.\n */\nexport function getPreviousValue(value: ProtoValue): ProtoValue | null {\n const previousValue = value.mapValue!.fields![PREVIOUS_VALUE_KEY];\n\n if (isServerTimestamp(previousValue)) {\n return getPreviousValue(previousValue);\n }\n return previousValue;\n}\n\n/**\n * Returns the local time at which this timestamp was first set.\n */\nexport function getLocalWriteTime(value: ProtoValue): Timestamp {\n const localWriteTime = normalizeTimestamp(\n value.mapValue!.fields![LOCAL_WRITE_TIME_KEY].timestampValue!\n );\n return new Timestamp(localWriteTime.seconds, localWriteTime.nanos);\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { DatabaseId } from '../core/database_info';\nimport {\n ArrayValue,\n LatLng,\n MapValue,\n Timestamp,\n Value\n} from '../protos/firestore_proto_api';\nimport { fail } from '../util/assert';\nimport { arrayEquals, primitiveComparator } from '../util/misc';\nimport { forEach, objectSize } from '../util/obj';\nimport { isNegativeZero } from '../util/types';\n\nimport { DocumentKey } from './document_key';\nimport {\n normalizeByteString,\n normalizeNumber,\n normalizeTimestamp\n} from './normalize';\nimport {\n getLocalWriteTime,\n getPreviousValue,\n isServerTimestamp\n} from './server_timestamps';\nimport { TypeOrder } from './type_order';\n\nconst MAX_VALUE_TYPE = '__max__';\nexport const MAX_VALUE: Value = {\n mapValue: {\n fields: {\n '__type__': { stringValue: MAX_VALUE_TYPE }\n }\n }\n};\n\nexport const MIN_VALUE: Value = {\n nullValue: 'NULL_VALUE'\n};\n\n/** Extracts the backend's type order for the provided value. */\nexport function typeOrder(value: Value): TypeOrder {\n if ('nullValue' in value) {\n return TypeOrder.NullValue;\n } else if ('booleanValue' in value) {\n return TypeOrder.BooleanValue;\n } else if ('integerValue' in value || 'doubleValue' in value) {\n return TypeOrder.NumberValue;\n } else if ('timestampValue' in value) {\n return TypeOrder.TimestampValue;\n } else if ('stringValue' in value) {\n return TypeOrder.StringValue;\n } else if ('bytesValue' in value) {\n return TypeOrder.BlobValue;\n } else if ('referenceValue' in value) {\n return TypeOrder.RefValue;\n } else if ('geoPointValue' in value) {\n return TypeOrder.GeoPointValue;\n } else if ('arrayValue' in value) {\n return TypeOrder.ArrayValue;\n } else if ('mapValue' in value) {\n if (isServerTimestamp(value)) {\n return TypeOrder.ServerTimestampValue;\n } else if (isMaxValue(value)) {\n return TypeOrder.MaxValue;\n }\n return TypeOrder.ObjectValue;\n } else {\n return fail('Invalid value type: ' + JSON.stringify(value));\n }\n}\n\n/** Tests `left` and `right` for equality based on the backend semantics. */\nexport function valueEquals(left: Value, right: Value): boolean {\n if (left === right) {\n return true;\n }\n\n const leftType = typeOrder(left);\n const rightType = typeOrder(right);\n if (leftType !== rightType) {\n return false;\n }\n\n switch (leftType) {\n case TypeOrder.NullValue:\n return true;\n case TypeOrder.BooleanValue:\n return left.booleanValue === right.booleanValue;\n case TypeOrder.ServerTimestampValue:\n return getLocalWriteTime(left).isEqual(getLocalWriteTime(right));\n case TypeOrder.TimestampValue:\n return timestampEquals(left, right);\n case TypeOrder.StringValue:\n return left.stringValue === right.stringValue;\n case TypeOrder.BlobValue:\n return blobEquals(left, right);\n case TypeOrder.RefValue:\n return left.referenceValue === right.referenceValue;\n case TypeOrder.GeoPointValue:\n return geoPointEquals(left, right);\n case TypeOrder.NumberValue:\n return numberEquals(left, right);\n case TypeOrder.ArrayValue:\n return arrayEquals(\n left.arrayValue!.values || [],\n right.arrayValue!.values || [],\n valueEquals\n );\n case TypeOrder.ObjectValue:\n return objectEquals(left, right);\n case TypeOrder.MaxValue:\n return true;\n default:\n return fail('Unexpected value type: ' + JSON.stringify(left));\n }\n}\n\nfunction timestampEquals(left: Value, right: Value): boolean {\n if (\n typeof left.timestampValue === 'string' &&\n typeof right.timestampValue === 'string' &&\n left.timestampValue.length === right.timestampValue.length\n ) {\n // Use string equality for ISO 8601 timestamps\n return left.timestampValue === right.timestampValue;\n }\n\n const leftTimestamp = normalizeTimestamp(left.timestampValue!);\n const rightTimestamp = normalizeTimestamp(right.timestampValue!);\n return (\n leftTimestamp.seconds === rightTimestamp.seconds &&\n leftTimestamp.nanos === rightTimestamp.nanos\n );\n}\n\nfunction geoPointEquals(left: Value, right: Value): boolean {\n return (\n normalizeNumber(left.geoPointValue!.latitude) ===\n normalizeNumber(right.geoPointValue!.latitude) &&\n normalizeNumber(left.geoPointValue!.longitude) ===\n normalizeNumber(right.geoPointValue!.longitude)\n );\n}\n\nfunction blobEquals(left: Value, right: Value): boolean {\n return normalizeByteString(left.bytesValue!).isEqual(\n normalizeByteString(right.bytesValue!)\n );\n}\n\nexport function numberEquals(left: Value, right: Value): boolean {\n if ('integerValue' in left && 'integerValue' in right) {\n return (\n normalizeNumber(left.integerValue) === normalizeNumber(right.integerValue)\n );\n } else if ('doubleValue' in left && 'doubleValue' in right) {\n const n1 = normalizeNumber(left.doubleValue!);\n const n2 = normalizeNumber(right.doubleValue!);\n\n if (n1 === n2) {\n return isNegativeZero(n1) === isNegativeZero(n2);\n } else {\n return isNaN(n1) && isNaN(n2);\n }\n }\n\n return false;\n}\n\nfunction objectEquals(left: Value, right: Value): boolean {\n const leftMap = left.mapValue!.fields || {};\n const rightMap = right.mapValue!.fields || {};\n\n if (objectSize(leftMap) !== objectSize(rightMap)) {\n return false;\n }\n\n for (const key in leftMap) {\n if (leftMap.hasOwnProperty(key)) {\n if (\n rightMap[key] === undefined ||\n !valueEquals(leftMap[key], rightMap[key])\n ) {\n return false;\n }\n }\n }\n return true;\n}\n\n/** Returns true if the ArrayValue contains the specified element. */\nexport function arrayValueContains(\n haystack: ArrayValue,\n needle: Value\n): boolean {\n return (\n (haystack.values || []).find(v => valueEquals(v, needle)) !== undefined\n );\n}\n\nexport function valueCompare(left: Value, right: Value): number {\n if (left === right) {\n return 0;\n }\n\n const leftType = typeOrder(left);\n const rightType = typeOrder(right);\n\n if (leftType !== rightType) {\n return primitiveComparator(leftType, rightType);\n }\n\n switch (leftType) {\n case TypeOrder.NullValue:\n case TypeOrder.MaxValue:\n return 0;\n case TypeOrder.BooleanValue:\n return primitiveComparator(left.booleanValue!, right.booleanValue!);\n case TypeOrder.NumberValue:\n return compareNumbers(left, right);\n case TypeOrder.TimestampValue:\n return compareTimestamps(left.timestampValue!, right.timestampValue!);\n case TypeOrder.ServerTimestampValue:\n return compareTimestamps(\n getLocalWriteTime(left),\n getLocalWriteTime(right)\n );\n case TypeOrder.StringValue:\n return primitiveComparator(left.stringValue!, right.stringValue!);\n case TypeOrder.BlobValue:\n return compareBlobs(left.bytesValue!, right.bytesValue!);\n case TypeOrder.RefValue:\n return compareReferences(left.referenceValue!, right.referenceValue!);\n case TypeOrder.GeoPointValue:\n return compareGeoPoints(left.geoPointValue!, right.geoPointValue!);\n case TypeOrder.ArrayValue:\n return compareArrays(left.arrayValue!, right.arrayValue!);\n case TypeOrder.ObjectValue:\n return compareMaps(left.mapValue!, right.mapValue!);\n default:\n throw fail('Invalid value type: ' + leftType);\n }\n}\n\nfunction compareNumbers(left: Value, right: Value): number {\n const leftNumber = normalizeNumber(left.integerValue || left.doubleValue);\n const rightNumber = normalizeNumber(right.integerValue || right.doubleValue);\n\n if (leftNumber < rightNumber) {\n return -1;\n } else if (leftNumber > rightNumber) {\n return 1;\n } else if (leftNumber === rightNumber) {\n return 0;\n } else {\n // one or both are NaN.\n if (isNaN(leftNumber)) {\n return isNaN(rightNumber) ? 0 : -1;\n } else {\n return 1;\n }\n }\n}\n\nfunction compareTimestamps(left: Timestamp, right: Timestamp): number {\n if (\n typeof left === 'string' &&\n typeof right === 'string' &&\n left.length === right.length\n ) {\n return primitiveComparator(left, right);\n }\n\n const leftTimestamp = normalizeTimestamp(left);\n const rightTimestamp = normalizeTimestamp(right);\n\n const comparison = primitiveComparator(\n leftTimestamp.seconds,\n rightTimestamp.seconds\n );\n if (comparison !== 0) {\n return comparison;\n }\n return primitiveComparator(leftTimestamp.nanos, rightTimestamp.nanos);\n}\n\nfunction compareReferences(leftPath: string, rightPath: string): number {\n const leftSegments = leftPath.split('/');\n const rightSegments = rightPath.split('/');\n for (let i = 0; i < leftSegments.length && i < rightSegments.length; i++) {\n const comparison = primitiveComparator(leftSegments[i], rightSegments[i]);\n if (comparison !== 0) {\n return comparison;\n }\n }\n return primitiveComparator(leftSegments.length, rightSegments.length);\n}\n\nfunction compareGeoPoints(left: LatLng, right: LatLng): number {\n const comparison = primitiveComparator(\n normalizeNumber(left.latitude),\n normalizeNumber(right.latitude)\n );\n if (comparison !== 0) {\n return comparison;\n }\n return primitiveComparator(\n normalizeNumber(left.longitude),\n normalizeNumber(right.longitude)\n );\n}\n\nfunction compareBlobs(\n left: string | Uint8Array,\n right: string | Uint8Array\n): number {\n const leftBytes = normalizeByteString(left);\n const rightBytes = normalizeByteString(right);\n return leftBytes.compareTo(rightBytes);\n}\n\nfunction compareArrays(left: ArrayValue, right: ArrayValue): number {\n const leftArray = left.values || [];\n const rightArray = right.values || [];\n\n for (let i = 0; i < leftArray.length && i < rightArray.length; ++i) {\n const compare = valueCompare(leftArray[i], rightArray[i]);\n if (compare) {\n return compare;\n }\n }\n return primitiveComparator(leftArray.length, rightArray.length);\n}\n\nfunction compareMaps(left: MapValue, right: MapValue): number {\n if (left === MAX_VALUE.mapValue && right === MAX_VALUE.mapValue) {\n return 0;\n } else if (left === MAX_VALUE.mapValue) {\n return 1;\n } else if (right === MAX_VALUE.mapValue) {\n return -1;\n }\n\n const leftMap = left.fields || {};\n const leftKeys = Object.keys(leftMap);\n const rightMap = right.fields || {};\n const rightKeys = Object.keys(rightMap);\n\n // Even though MapValues are likely sorted correctly based on their insertion\n // order (e.g. when received from the backend), local modifications can bring\n // elements out of order. We need to re-sort the elements to ensure that\n // canonical IDs are independent of insertion order.\n leftKeys.sort();\n rightKeys.sort();\n\n for (let i = 0; i < leftKeys.length && i < rightKeys.length; ++i) {\n const keyCompare = primitiveComparator(leftKeys[i], rightKeys[i]);\n if (keyCompare !== 0) {\n return keyCompare;\n }\n const compare = valueCompare(leftMap[leftKeys[i]], rightMap[rightKeys[i]]);\n if (compare !== 0) {\n return compare;\n }\n }\n\n return primitiveComparator(leftKeys.length, rightKeys.length);\n}\n\n/**\n * Generates the canonical ID for the provided field value (as used in Target\n * serialization).\n */\nexport function canonicalId(value: Value): string {\n return canonifyValue(value);\n}\n\nfunction canonifyValue(value: Value): string {\n if ('nullValue' in value) {\n return 'null';\n } else if ('booleanValue' in value) {\n return '' + value.booleanValue!;\n } else if ('integerValue' in value) {\n return '' + value.integerValue!;\n } else if ('doubleValue' in value) {\n return '' + value.doubleValue!;\n } else if ('timestampValue' in value) {\n return canonifyTimestamp(value.timestampValue!);\n } else if ('stringValue' in value) {\n return value.stringValue!;\n } else if ('bytesValue' in value) {\n return canonifyByteString(value.bytesValue!);\n } else if ('referenceValue' in value) {\n return canonifyReference(value.referenceValue!);\n } else if ('geoPointValue' in value) {\n return canonifyGeoPoint(value.geoPointValue!);\n } else if ('arrayValue' in value) {\n return canonifyArray(value.arrayValue!);\n } else if ('mapValue' in value) {\n return canonifyMap(value.mapValue!);\n } else {\n return fail('Invalid value type: ' + JSON.stringify(value));\n }\n}\n\nfunction canonifyByteString(byteString: string | Uint8Array): string {\n return normalizeByteString(byteString).toBase64();\n}\n\nfunction canonifyTimestamp(timestamp: Timestamp): string {\n const normalizedTimestamp = normalizeTimestamp(timestamp);\n return `time(${normalizedTimestamp.seconds},${normalizedTimestamp.nanos})`;\n}\n\nfunction canonifyGeoPoint(geoPoint: LatLng): string {\n return `geo(${geoPoint.latitude},${geoPoint.longitude})`;\n}\n\nfunction canonifyReference(referenceValue: string): string {\n return DocumentKey.fromName(referenceValue).toString();\n}\n\nfunction canonifyMap(mapValue: MapValue): string {\n // Iteration order in JavaScript is not guaranteed. To ensure that we generate\n // matching canonical IDs for identical maps, we need to sort the keys.\n const sortedKeys = Object.keys(mapValue.fields || {}).sort();\n\n let result = '{';\n let first = true;\n for (const key of sortedKeys) {\n if (!first) {\n result += ',';\n } else {\n first = false;\n }\n result += `${key}:${canonifyValue(mapValue.fields![key])}`;\n }\n return result + '}';\n}\n\nfunction canonifyArray(arrayValue: ArrayValue): string {\n let result = '[';\n let first = true;\n for (const value of arrayValue.values || []) {\n if (!first) {\n result += ',';\n } else {\n first = false;\n }\n result += canonifyValue(value);\n }\n return result + ']';\n}\n\n/**\n * Returns an approximate (and wildly inaccurate) in-memory size for the field\n * value.\n *\n * The memory size takes into account only the actual user data as it resides\n * in memory and ignores object overhead.\n */\nexport function estimateByteSize(value: Value): number {\n switch (typeOrder(value)) {\n case TypeOrder.NullValue:\n return 4;\n case TypeOrder.BooleanValue:\n return 4;\n case TypeOrder.NumberValue:\n return 8;\n case TypeOrder.TimestampValue:\n // Timestamps are made up of two distinct numbers (seconds + nanoseconds)\n return 16;\n case TypeOrder.ServerTimestampValue:\n const previousValue = getPreviousValue(value);\n return previousValue ? 16 + estimateByteSize(previousValue) : 16;\n case TypeOrder.StringValue:\n // See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Data_structures:\n // \"JavaScript's String type is [...] a set of elements of 16-bit unsigned\n // integer values\"\n return value.stringValue!.length * 2;\n case TypeOrder.BlobValue:\n return normalizeByteString(value.bytesValue!).approximateByteSize();\n case TypeOrder.RefValue:\n return value.referenceValue!.length;\n case TypeOrder.GeoPointValue:\n // GeoPoints are made up of two distinct numbers (latitude + longitude)\n return 16;\n case TypeOrder.ArrayValue:\n return estimateArrayByteSize(value.arrayValue!);\n case TypeOrder.ObjectValue:\n return estimateMapByteSize(value.mapValue!);\n default:\n throw fail('Invalid value type: ' + JSON.stringify(value));\n }\n}\n\nfunction estimateMapByteSize(mapValue: MapValue): number {\n let size = 0;\n forEach(mapValue.fields, (key, val) => {\n size += key.length + estimateByteSize(val);\n });\n return size;\n}\n\nfunction estimateArrayByteSize(arrayValue: ArrayValue): number {\n return (arrayValue.values || []).reduce(\n (previousSize, value) => previousSize + estimateByteSize(value),\n 0\n );\n}\n\n/** Returns a reference value for the provided database and key. */\nexport function refValue(databaseId: DatabaseId, key: DocumentKey): Value {\n return {\n referenceValue: `projects/${databaseId.projectId}/databases/${\n databaseId.database\n }/documents/${key.path.canonicalString()}`\n };\n}\n\n/** Returns true if `value` is an IntegerValue . */\nexport function isInteger(\n value?: Value | null\n): value is { integerValue: string | number } {\n return !!value && 'integerValue' in value;\n}\n\n/** Returns true if `value` is a DoubleValue. */\nexport function isDouble(\n value?: Value | null\n): value is { doubleValue: string | number } {\n return !!value && 'doubleValue' in value;\n}\n\n/** Returns true if `value` is either an IntegerValue or a DoubleValue. */\nexport function isNumber(value?: Value | null): boolean {\n return isInteger(value) || isDouble(value);\n}\n\n/** Returns true if `value` is an ArrayValue. */\nexport function isArray(\n value?: Value | null\n): value is { arrayValue: ArrayValue } {\n return !!value && 'arrayValue' in value;\n}\n\n/** Returns true if `value` is a ReferenceValue. */\nexport function isReferenceValue(\n value?: Value | null\n): value is { referenceValue: string } {\n return !!value && 'referenceValue' in value;\n}\n\n/** Returns true if `value` is a NullValue. */\nexport function isNullValue(\n value?: Value | null\n): value is { nullValue: 'NULL_VALUE' } {\n return !!value && 'nullValue' in value;\n}\n\n/** Returns true if `value` is NaN. */\nexport function isNanValue(\n value?: Value | null\n): value is { doubleValue: 'NaN' | number } {\n return !!value && 'doubleValue' in value && isNaN(Number(value.doubleValue));\n}\n\n/** Returns true if `value` is a MapValue. */\nexport function isMapValue(\n value?: Value | null\n): value is { mapValue: MapValue } {\n return !!value && 'mapValue' in value;\n}\n\n/** Creates a deep copy of `source`. */\nexport function deepClone(source: Value): Value {\n if (source.geoPointValue) {\n return { geoPointValue: { ...source.geoPointValue } };\n } else if (\n source.timestampValue &&\n typeof source.timestampValue === 'object'\n ) {\n return { timestampValue: { ...source.timestampValue } };\n } else if (source.mapValue) {\n const target: Value = { mapValue: { fields: {} } };\n forEach(\n source.mapValue.fields,\n (key, val) => (target.mapValue!.fields![key] = deepClone(val))\n );\n return target;\n } else if (source.arrayValue) {\n const target: Value = { arrayValue: { values: [] } };\n for (let i = 0; i < (source.arrayValue.values || []).length; ++i) {\n target.arrayValue!.values![i] = deepClone(source.arrayValue.values![i]);\n }\n return target;\n } else {\n return { ...source };\n }\n}\n\n/** Returns true if the Value represents the canonical {@link #MAX_VALUE} . */\nexport function isMaxValue(value: Value): boolean {\n return (\n (((value.mapValue || {}).fields || {})['__type__'] || {}).stringValue ===\n MAX_VALUE_TYPE\n );\n}\n\n/** Returns the lowest value for the given value type (inclusive). */\nexport function valuesGetLowerBound(value: Value): Value {\n if ('nullValue' in value) {\n return MIN_VALUE;\n } else if ('booleanValue' in value) {\n return { booleanValue: false };\n } else if ('integerValue' in value || 'doubleValue' in value) {\n return { doubleValue: NaN };\n } else if ('timestampValue' in value) {\n return { timestampValue: { seconds: Number.MIN_SAFE_INTEGER } };\n } else if ('stringValue' in value) {\n return { stringValue: '' };\n } else if ('bytesValue' in value) {\n return { bytesValue: '' };\n } else if ('referenceValue' in value) {\n return refValue(DatabaseId.empty(), DocumentKey.empty());\n } else if ('geoPointValue' in value) {\n return { geoPointValue: { latitude: -90, longitude: -180 } };\n } else if ('arrayValue' in value) {\n return { arrayValue: {} };\n } else if ('mapValue' in value) {\n return { mapValue: {} };\n } else {\n return fail('Invalid value type: ' + JSON.stringify(value));\n }\n}\n\n/** Returns the largest value for the given value type (exclusive). */\nexport function valuesGetUpperBound(value: Value): Value {\n if ('nullValue' in value) {\n return { booleanValue: false };\n } else if ('booleanValue' in value) {\n return { doubleValue: NaN };\n } else if ('integerValue' in value || 'doubleValue' in value) {\n return { timestampValue: { seconds: Number.MIN_SAFE_INTEGER } };\n } else if ('timestampValue' in value) {\n return { stringValue: '' };\n } else if ('stringValue' in value) {\n return { bytesValue: '' };\n } else if ('bytesValue' in value) {\n return refValue(DatabaseId.empty(), DocumentKey.empty());\n } else if ('referenceValue' in value) {\n return { geoPointValue: { latitude: -90, longitude: -180 } };\n } else if ('geoPointValue' in value) {\n return { arrayValue: {} };\n } else if ('arrayValue' in value) {\n return { mapValue: {} };\n } else if ('mapValue' in value) {\n return MAX_VALUE;\n } else {\n return fail('Invalid value type: ' + JSON.stringify(value));\n }\n}\n\nexport function lowerBoundCompare(\n left: { value: Value; inclusive: boolean },\n right: { value: Value; inclusive: boolean }\n): number {\n const cmp = valueCompare(left.value, right.value);\n if (cmp !== 0) {\n return cmp;\n }\n\n if (left.inclusive && !right.inclusive) {\n return -1;\n } else if (!left.inclusive && right.inclusive) {\n return 1;\n }\n\n return 0;\n}\n\nexport function upperBoundCompare(\n left: { value: Value; inclusive: boolean },\n right: { value: Value; inclusive: boolean }\n): number {\n const cmp = valueCompare(left.value, right.value);\n if (cmp !== 0) {\n return cmp;\n }\n\n if (left.inclusive && !right.inclusive) {\n return 1;\n } else if (!left.inclusive && right.inclusive) {\n return -1;\n }\n\n return 0;\n}\n","/**\n * @license\n * Copyright 2022 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Document } from '../model/document';\nimport { DocumentKey } from '../model/document_key';\nimport { isReferenceValue, valueCompare, valueEquals } from '../model/values';\nimport { Value as ProtoValue } from '../protos/firestore_proto_api';\nimport { debugAssert } from '../util/assert';\n\nimport { Direction, OrderBy } from './order_by';\n\n/**\n * Represents a bound of a query.\n *\n * The bound is specified with the given components representing a position and\n * whether it's just before or just after the position (relative to whatever the\n * query order is).\n *\n * The position represents a logical index position for a query. It's a prefix\n * of values for the (potentially implicit) order by clauses of a query.\n *\n * Bound provides a function to determine whether a document comes before or\n * after a bound. This is influenced by whether the position is just before or\n * just after the provided values.\n */\nexport class Bound {\n constructor(readonly position: ProtoValue[], readonly inclusive: boolean) {}\n}\n\nfunction boundCompareToDocument(\n bound: Bound,\n orderBy: OrderBy[],\n doc: Document\n): number {\n debugAssert(\n bound.position.length <= orderBy.length,\n \"Bound has more components than query's orderBy\"\n );\n let comparison = 0;\n for (let i = 0; i < bound.position.length; i++) {\n const orderByComponent = orderBy[i];\n const component = bound.position[i];\n if (orderByComponent.field.isKeyField()) {\n debugAssert(\n isReferenceValue(component),\n 'Bound has a non-key value where the key path is being used.'\n );\n comparison = DocumentKey.comparator(\n DocumentKey.fromName(component.referenceValue),\n doc.key\n );\n } else {\n const docValue = doc.data.field(orderByComponent.field);\n debugAssert(\n docValue !== null,\n 'Field should exist since document matched the orderBy already.'\n );\n comparison = valueCompare(component, docValue);\n }\n if (orderByComponent.dir === Direction.DESCENDING) {\n comparison = comparison * -1;\n }\n if (comparison !== 0) {\n break;\n }\n }\n return comparison;\n}\n\n/**\n * Returns true if a document sorts after a bound using the provided sort\n * order.\n */\nexport function boundSortsAfterDocument(\n bound: Bound,\n orderBy: OrderBy[],\n doc: Document\n): boolean {\n const comparison = boundCompareToDocument(bound, orderBy, doc);\n return bound.inclusive ? comparison >= 0 : comparison > 0;\n}\n\n/**\n * Returns true if a document sorts before a bound using the provided sort\n * order.\n */\nexport function boundSortsBeforeDocument(\n bound: Bound,\n orderBy: OrderBy[],\n doc: Document\n): boolean {\n const comparison = boundCompareToDocument(bound, orderBy, doc);\n return bound.inclusive ? comparison <= 0 : comparison < 0;\n}\n\nexport function boundEquals(left: Bound | null, right: Bound | null): boolean {\n if (left === null) {\n return right === null;\n } else if (right === null) {\n return false;\n }\n\n if (\n left.inclusive !== right.inclusive ||\n left.position.length !== right.position.length\n ) {\n return false;\n }\n for (let i = 0; i < left.position.length; i++) {\n const leftPosition = left.position[i];\n const rightPosition = right.position[i];\n if (!valueEquals(leftPosition, rightPosition)) {\n return false;\n }\n }\n return true;\n}\n","/**\n * @license\n * Copyright 2022 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Document } from '../model/document';\nimport { DocumentKey } from '../model/document_key';\nimport { FieldPath } from '../model/path';\nimport {\n arrayValueContains,\n canonicalId,\n isArray,\n isReferenceValue,\n typeOrder,\n valueCompare,\n valueEquals\n} from '../model/values';\nimport { Value as ProtoValue } from '../protos/firestore_proto_api';\nimport { debugAssert, fail } from '../util/assert';\n\n// The operator of a FieldFilter\nexport const enum Operator {\n LESS_THAN = '<',\n LESS_THAN_OR_EQUAL = '<=',\n EQUAL = '==',\n NOT_EQUAL = '!=',\n GREATER_THAN = '>',\n GREATER_THAN_OR_EQUAL = '>=',\n ARRAY_CONTAINS = 'array-contains',\n IN = 'in',\n NOT_IN = 'not-in',\n ARRAY_CONTAINS_ANY = 'array-contains-any'\n}\n\n// The operator of a CompositeFilter\nexport const enum CompositeOperator {\n OR = 'or',\n AND = 'and'\n}\n\nexport abstract class Filter {\n abstract matches(doc: Document): boolean;\n\n abstract getFlattenedFilters(): readonly FieldFilter[];\n\n abstract getFilters(): Filter[];\n\n abstract getFirstInequalityField(): FieldPath | null;\n}\n\nexport class FieldFilter extends Filter {\n protected constructor(\n public readonly field: FieldPath,\n public readonly op: Operator,\n public readonly value: ProtoValue\n ) {\n super();\n }\n\n /**\n * Creates a filter based on the provided arguments.\n */\n static create(\n field: FieldPath,\n op: Operator,\n value: ProtoValue\n ): FieldFilter {\n if (field.isKeyField()) {\n if (op === Operator.IN || op === Operator.NOT_IN) {\n return this.createKeyFieldInFilter(field, op, value);\n } else {\n debugAssert(\n isReferenceValue(value),\n 'Comparing on key, but filter value not a RefValue'\n );\n debugAssert(\n op !== Operator.ARRAY_CONTAINS && op !== Operator.ARRAY_CONTAINS_ANY,\n `'${op.toString()}' queries don't make sense on document keys.`\n );\n return new KeyFieldFilter(field, op, value);\n }\n } else if (op === Operator.ARRAY_CONTAINS) {\n return new ArrayContainsFilter(field, value);\n } else if (op === Operator.IN) {\n debugAssert(\n isArray(value),\n 'IN filter has invalid value: ' + value.toString()\n );\n return new InFilter(field, value);\n } else if (op === Operator.NOT_IN) {\n debugAssert(\n isArray(value),\n 'NOT_IN filter has invalid value: ' + value.toString()\n );\n return new NotInFilter(field, value);\n } else if (op === Operator.ARRAY_CONTAINS_ANY) {\n debugAssert(\n isArray(value),\n 'ARRAY_CONTAINS_ANY filter has invalid value: ' + value.toString()\n );\n return new ArrayContainsAnyFilter(field, value);\n } else {\n return new FieldFilter(field, op, value);\n }\n }\n\n private static createKeyFieldInFilter(\n field: FieldPath,\n op: Operator.IN | Operator.NOT_IN,\n value: ProtoValue\n ): FieldFilter {\n debugAssert(\n isArray(value),\n `Comparing on key with ${op.toString()}` +\n ', but filter value not an ArrayValue'\n );\n debugAssert(\n (value.arrayValue.values || []).every(elem => isReferenceValue(elem)),\n `Comparing on key with ${op.toString()}` +\n ', but an array value was not a RefValue'\n );\n\n return op === Operator.IN\n ? new KeyFieldInFilter(field, value)\n : new KeyFieldNotInFilter(field, value);\n }\n\n matches(doc: Document): boolean {\n const other = doc.data.field(this.field);\n // Types do not have to match in NOT_EQUAL filters.\n if (this.op === Operator.NOT_EQUAL) {\n return (\n other !== null &&\n this.matchesComparison(valueCompare(other!, this.value))\n );\n }\n\n // Only compare types with matching backend order (such as double and int).\n return (\n other !== null &&\n typeOrder(this.value) === typeOrder(other) &&\n this.matchesComparison(valueCompare(other, this.value))\n );\n }\n\n protected matchesComparison(comparison: number): boolean {\n switch (this.op) {\n case Operator.LESS_THAN:\n return comparison < 0;\n case Operator.LESS_THAN_OR_EQUAL:\n return comparison <= 0;\n case Operator.EQUAL:\n return comparison === 0;\n case Operator.NOT_EQUAL:\n return comparison !== 0;\n case Operator.GREATER_THAN:\n return comparison > 0;\n case Operator.GREATER_THAN_OR_EQUAL:\n return comparison >= 0;\n default:\n return fail('Unknown FieldFilter operator: ' + this.op);\n }\n }\n\n isInequality(): boolean {\n return (\n [\n Operator.LESS_THAN,\n Operator.LESS_THAN_OR_EQUAL,\n Operator.GREATER_THAN,\n Operator.GREATER_THAN_OR_EQUAL,\n Operator.NOT_EQUAL,\n Operator.NOT_IN\n ].indexOf(this.op) >= 0\n );\n }\n\n getFlattenedFilters(): readonly FieldFilter[] {\n return [this];\n }\n\n getFilters(): Filter[] {\n return [this];\n }\n\n getFirstInequalityField(): FieldPath | null {\n if (this.isInequality()) {\n return this.field;\n }\n return null;\n }\n}\n\nexport class CompositeFilter extends Filter {\n private memoizedFlattenedFilters: FieldFilter[] | null = null;\n\n protected constructor(\n public readonly filters: readonly Filter[],\n public readonly op: CompositeOperator\n ) {\n super();\n }\n\n /**\n * Creates a filter based on the provided arguments.\n */\n static create(filters: Filter[], op: CompositeOperator): CompositeFilter {\n return new CompositeFilter(filters, op);\n }\n\n matches(doc: Document): boolean {\n if (compositeFilterIsConjunction(this)) {\n // For conjunctions, all filters must match, so return false if any filter doesn't match.\n return this.filters.find(filter => !filter.matches(doc)) === undefined;\n } else {\n // For disjunctions, at least one filter should match.\n return this.filters.find(filter => filter.matches(doc)) !== undefined;\n }\n }\n\n getFlattenedFilters(): readonly FieldFilter[] {\n if (this.memoizedFlattenedFilters !== null) {\n return this.memoizedFlattenedFilters;\n }\n\n this.memoizedFlattenedFilters = this.filters.reduce((result, subfilter) => {\n return result.concat(subfilter.getFlattenedFilters());\n }, [] as FieldFilter[]);\n\n return this.memoizedFlattenedFilters;\n }\n\n // Returns a mutable copy of `this.filters`\n getFilters(): Filter[] {\n return Object.assign([], this.filters);\n }\n\n getFirstInequalityField(): FieldPath | null {\n const found = this.findFirstMatchingFilter(filter => filter.isInequality());\n\n if (found !== null) {\n return found.field;\n }\n return null;\n }\n\n // Performs a depth-first search to find and return the first FieldFilter in the composite filter\n // that satisfies the predicate. Returns `null` if none of the FieldFilters satisfy the\n // predicate.\n private findFirstMatchingFilter(\n predicate: (filter: FieldFilter) => boolean\n ): FieldFilter | null {\n for (const fieldFilter of this.getFlattenedFilters()) {\n if (predicate(fieldFilter)) {\n return fieldFilter;\n }\n }\n\n return null;\n }\n}\n\nexport function compositeFilterIsConjunction(\n compositeFilter: CompositeFilter\n): boolean {\n return compositeFilter.op === CompositeOperator.AND;\n}\n\nexport function compositeFilterIsDisjunction(\n compositeFilter: CompositeFilter\n): boolean {\n return compositeFilter.op === CompositeOperator.OR;\n}\n\n/**\n * Returns true if this filter is a conjunction of field filters only. Returns false otherwise.\n */\nexport function compositeFilterIsFlatConjunction(\n compositeFilter: CompositeFilter\n): boolean {\n return (\n compositeFilterIsFlat(compositeFilter) &&\n compositeFilterIsConjunction(compositeFilter)\n );\n}\n\n/**\n * Returns true if this filter does not contain any composite filters. Returns false otherwise.\n */\nexport function compositeFilterIsFlat(\n compositeFilter: CompositeFilter\n): boolean {\n for (const filter of compositeFilter.filters) {\n if (filter instanceof CompositeFilter) {\n return false;\n }\n }\n return true;\n}\n\nexport function canonifyFilter(filter: Filter): string {\n debugAssert(\n filter instanceof FieldFilter || filter instanceof CompositeFilter,\n 'canonifyFilter() only supports FieldFilters and CompositeFilters'\n );\n\n if (filter instanceof FieldFilter) {\n // TODO(b/29183165): Technically, this won't be unique if two values have\n // the same description, such as the int 3 and the string \"3\". So we should\n // add the types in here somehow, too.\n return (\n filter.field.canonicalString() +\n filter.op.toString() +\n canonicalId(filter.value)\n );\n } else if (compositeFilterIsFlatConjunction(filter)) {\n // Older SDK versions use an implicit AND operation between their filters.\n // In the new SDK versions, the developer may use an explicit AND filter.\n // To stay consistent with the old usages, we add a special case to ensure\n // the canonical ID for these two are the same. For example:\n // `col.whereEquals(\"a\", 1).whereEquals(\"b\", 2)` should have the same\n // canonical ID as `col.where(and(equals(\"a\",1), equals(\"b\",2)))`.\n return filter.filters.map(filter => canonifyFilter(filter)).join(',');\n } else {\n // filter instanceof CompositeFilter\n const canonicalIdsString = filter.filters\n .map(filter => canonifyFilter(filter))\n .join(',');\n return `${filter.op}(${canonicalIdsString})`;\n }\n}\n\nexport function filterEquals(f1: Filter, f2: Filter): boolean {\n if (f1 instanceof FieldFilter) {\n return fieldFilterEquals(f1, f2);\n } else if (f1 instanceof CompositeFilter) {\n return compositeFilterEquals(f1, f2);\n } else {\n fail('Only FieldFilters and CompositeFilters can be compared');\n }\n}\n\nexport function fieldFilterEquals(f1: FieldFilter, f2: Filter): boolean {\n return (\n f2 instanceof FieldFilter &&\n f1.op === f2.op &&\n f1.field.isEqual(f2.field) &&\n valueEquals(f1.value, f2.value)\n );\n}\n\nexport function compositeFilterEquals(\n f1: CompositeFilter,\n f2: Filter\n): boolean {\n if (\n f2 instanceof CompositeFilter &&\n f1.op === f2.op &&\n f1.filters.length === f2.filters.length\n ) {\n const subFiltersMatch: boolean = f1.filters.reduce(\n (result: boolean, f1Filter: Filter, index: number): boolean =>\n result && filterEquals(f1Filter, f2.filters[index]),\n true\n );\n\n return subFiltersMatch;\n }\n\n return false;\n}\n\n/**\n * Returns a new composite filter that contains all filter from\n * `compositeFilter` plus all the given filters in `otherFilters`.\n */\nexport function compositeFilterWithAddedFilters(\n compositeFilter: CompositeFilter,\n otherFilters: Filter[]\n): CompositeFilter {\n const mergedFilters = compositeFilter.filters.concat(otherFilters);\n return CompositeFilter.create(mergedFilters, compositeFilter.op);\n}\n\n/** Returns a debug description for `filter`. */\nexport function stringifyFilter(filter: Filter): string {\n debugAssert(\n filter instanceof FieldFilter || filter instanceof CompositeFilter,\n 'stringifyFilter() only supports FieldFilters and CompositeFilters'\n );\n if (filter instanceof FieldFilter) {\n return stringifyFieldFilter(filter);\n } else if (filter instanceof CompositeFilter) {\n return stringifyCompositeFilter(filter);\n } else {\n return 'Filter';\n }\n}\n\nexport function stringifyCompositeFilter(filter: CompositeFilter): string {\n return (\n filter.op.toString() +\n ` {` +\n filter.getFilters().map(stringifyFilter).join(' ,') +\n '}'\n );\n}\n\nexport function stringifyFieldFilter(filter: FieldFilter): string {\n return `${filter.field.canonicalString()} ${filter.op} ${canonicalId(\n filter.value\n )}`;\n}\n\n/** Filter that matches on key fields (i.e. '__name__'). */\nexport class KeyFieldFilter extends FieldFilter {\n private readonly key: DocumentKey;\n\n constructor(field: FieldPath, op: Operator, value: ProtoValue) {\n super(field, op, value);\n debugAssert(\n isReferenceValue(value),\n 'KeyFieldFilter expects a ReferenceValue'\n );\n this.key = DocumentKey.fromName(value.referenceValue);\n }\n\n matches(doc: Document): boolean {\n const comparison = DocumentKey.comparator(doc.key, this.key);\n return this.matchesComparison(comparison);\n }\n}\n\n/** Filter that matches on key fields within an array. */\nexport class KeyFieldInFilter extends FieldFilter {\n private readonly keys: DocumentKey[];\n\n constructor(field: FieldPath, value: ProtoValue) {\n super(field, Operator.IN, value);\n this.keys = extractDocumentKeysFromArrayValue(Operator.IN, value);\n }\n\n matches(doc: Document): boolean {\n return this.keys.some(key => key.isEqual(doc.key));\n }\n}\n\n/** Filter that matches on key fields not present within an array. */\nexport class KeyFieldNotInFilter extends FieldFilter {\n private readonly keys: DocumentKey[];\n\n constructor(field: FieldPath, value: ProtoValue) {\n super(field, Operator.NOT_IN, value);\n this.keys = extractDocumentKeysFromArrayValue(Operator.NOT_IN, value);\n }\n\n matches(doc: Document): boolean {\n return !this.keys.some(key => key.isEqual(doc.key));\n }\n}\n\nfunction extractDocumentKeysFromArrayValue(\n op: Operator.IN | Operator.NOT_IN,\n value: ProtoValue\n): DocumentKey[] {\n debugAssert(\n isArray(value),\n 'KeyFieldInFilter/KeyFieldNotInFilter expects an ArrayValue'\n );\n return (value.arrayValue?.values || []).map(v => {\n debugAssert(\n isReferenceValue(v),\n `Comparing on key with ${op.toString()}, but an array value was not ` +\n `a ReferenceValue`\n );\n return DocumentKey.fromName(v.referenceValue);\n });\n}\n\n/** A Filter that implements the array-contains operator. */\nexport class ArrayContainsFilter extends FieldFilter {\n constructor(field: FieldPath, value: ProtoValue) {\n super(field, Operator.ARRAY_CONTAINS, value);\n }\n\n matches(doc: Document): boolean {\n const other = doc.data.field(this.field);\n return isArray(other) && arrayValueContains(other.arrayValue, this.value);\n }\n}\n\n/** A Filter that implements the IN operator. */\nexport class InFilter extends FieldFilter {\n constructor(field: FieldPath, value: ProtoValue) {\n super(field, Operator.IN, value);\n debugAssert(isArray(value), 'InFilter expects an ArrayValue');\n }\n\n matches(doc: Document): boolean {\n const other = doc.data.field(this.field);\n return other !== null && arrayValueContains(this.value.arrayValue!, other);\n }\n}\n\n/** A Filter that implements the not-in operator. */\nexport class NotInFilter extends FieldFilter {\n constructor(field: FieldPath, value: ProtoValue) {\n super(field, Operator.NOT_IN, value);\n debugAssert(isArray(value), 'NotInFilter expects an ArrayValue');\n }\n\n matches(doc: Document): boolean {\n if (\n arrayValueContains(this.value.arrayValue!, { nullValue: 'NULL_VALUE' })\n ) {\n return false;\n }\n const other = doc.data.field(this.field);\n return other !== null && !arrayValueContains(this.value.arrayValue!, other);\n }\n}\n\n/** A Filter that implements the array-contains-any operator. */\nexport class ArrayContainsAnyFilter extends FieldFilter {\n constructor(field: FieldPath, value: ProtoValue) {\n super(field, Operator.ARRAY_CONTAINS_ANY, value);\n debugAssert(isArray(value), 'ArrayContainsAnyFilter expects an ArrayValue');\n }\n\n matches(doc: Document): boolean {\n const other = doc.data.field(this.field);\n if (!isArray(other) || !other.arrayValue.values) {\n return false;\n }\n return other.arrayValue.values.some(val =>\n arrayValueContains(this.value.arrayValue!, val)\n );\n }\n}\n","/**\n * @license\n * Copyright 2022 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { FieldPath } from '../model/path';\n\n/**\n * The direction of sorting in an order by.\n */\nexport const enum Direction {\n ASCENDING = 'asc',\n DESCENDING = 'desc'\n}\n\n/**\n * An ordering on a field, in some Direction. Direction defaults to ASCENDING.\n */\nexport class OrderBy {\n constructor(\n readonly field: FieldPath,\n readonly dir: Direction = Direction.ASCENDING\n ) {}\n}\n\nexport function canonifyOrderBy(orderBy: OrderBy): string {\n // TODO(b/29183165): Make this collision robust.\n return orderBy.field.canonicalString() + orderBy.dir;\n}\n\nexport function stringifyOrderBy(orderBy: OrderBy): string {\n return `${orderBy.field.canonicalString()} (${orderBy.dir})`;\n}\n\nexport function orderByEquals(left: OrderBy, right: OrderBy): boolean {\n return left.dir === right.dir && left.field.isEqual(right.field);\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Timestamp } from '../lite-api/timestamp';\n\n/**\n * A version of a document in Firestore. This corresponds to the version\n * timestamp, such as update_time or read_time.\n */\nexport class SnapshotVersion {\n static fromTimestamp(value: Timestamp): SnapshotVersion {\n return new SnapshotVersion(value);\n }\n\n static min(): SnapshotVersion {\n return new SnapshotVersion(new Timestamp(0, 0));\n }\n\n static max(): SnapshotVersion {\n return new SnapshotVersion(new Timestamp(253402300799, 1e9 - 1));\n }\n\n private constructor(private timestamp: Timestamp) {}\n\n compareTo(other: SnapshotVersion): number {\n return this.timestamp._compareTo(other.timestamp);\n }\n\n isEqual(other: SnapshotVersion): boolean {\n return this.timestamp.isEqual(other.timestamp);\n }\n\n /** Returns a number representation of the version for use in spec tests. */\n toMicroseconds(): number {\n // Convert to microseconds.\n return this.timestamp.seconds * 1e6 + this.timestamp.nanoseconds / 1000;\n }\n\n toString(): string {\n return 'SnapshotVersion(' + this.timestamp.toString() + ')';\n }\n\n toTimestamp(): Timestamp {\n return this.timestamp;\n }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { debugAssert, fail } from './assert';\n\n/*\n * Implementation of an immutable SortedMap using a Left-leaning\n * Red-Black Tree, adapted from the implementation in Mugs\n * (http://mads379.github.com/mugs/) by Mads Hartmann Jensen\n * (mads379@gmail.com).\n *\n * Original paper on Left-leaning Red-Black Trees:\n * http://www.cs.princeton.edu/~rs/talks/LLRB/LLRB.pdf\n *\n * Invariant 1: No red node has a red child\n * Invariant 2: Every leaf path has the same number of black nodes\n * Invariant 3: Only the left child can be red (left leaning)\n */\n\nexport type Comparator<K> = (key1: K, key2: K) => number;\n\nexport interface Entry<K, V> {\n key: K;\n value: V;\n}\n\n// An immutable sorted map implementation, based on a Left-leaning Red-Black\n// tree.\nexport class SortedMap<K, V> {\n // visible for testing\n root: LLRBNode<K, V> | LLRBEmptyNode<K, V>;\n\n constructor(\n public comparator: Comparator<K>,\n root?: LLRBNode<K, V> | LLRBEmptyNode<K, V>\n ) {\n this.root = root ? root : LLRBNode.EMPTY;\n }\n\n // Returns a copy of the map, with the specified key/value added or replaced.\n insert(key: K, value: V): SortedMap<K, V> {\n return new SortedMap<K, V>(\n this.comparator,\n this.root\n .insert(key, value, this.comparator)\n .copy(null, null, LLRBNode.BLACK, null, null)\n );\n }\n\n // Returns a copy of the map, with the specified key removed.\n remove(key: K): SortedMap<K, V> {\n return new SortedMap<K, V>(\n this.comparator,\n this.root\n .remove(key, this.comparator)\n .copy(null, null, LLRBNode.BLACK, null, null)\n );\n }\n\n // Returns the value of the node with the given key, or null.\n get(key: K): V | null {\n let node = this.root;\n while (!node.isEmpty()) {\n const cmp = this.comparator(key, node.key);\n if (cmp === 0) {\n return node.value;\n } else if (cmp < 0) {\n node = node.left;\n } else if (cmp > 0) {\n node = node.right;\n }\n }\n return null;\n }\n\n // Returns the index of the element in this sorted map, or -1 if it doesn't\n // exist.\n indexOf(key: K): number {\n // Number of nodes that were pruned when descending right\n let prunedNodes = 0;\n let node = this.root;\n while (!node.isEmpty()) {\n const cmp = this.comparator(key, node.key);\n if (cmp === 0) {\n return prunedNodes + node.left.size;\n } else if (cmp < 0) {\n node = node.left;\n } else {\n // Count all nodes left of the node plus the node itself\n prunedNodes += node.left.size + 1;\n node = node.right;\n }\n }\n // Node not found\n return -1;\n }\n\n isEmpty(): boolean {\n return this.root.isEmpty();\n }\n\n // Returns the total number of nodes in the map.\n get size(): number {\n return this.root.size;\n }\n\n // Returns the minimum key in the map.\n minKey(): K | null {\n return this.root.minKey();\n }\n\n // Returns the maximum key in the map.\n maxKey(): K | null {\n return this.root.maxKey();\n }\n\n // Traverses the map in key order and calls the specified action function\n // for each key/value pair. If action returns true, traversal is aborted.\n // Returns the first truthy value returned by action, or the last falsey\n // value returned by action.\n inorderTraversal<T>(action: (k: K, v: V) => T): T {\n return (this.root as LLRBNode<K, V>).inorderTraversal(action);\n }\n\n forEach(fn: (k: K, v: V) => void): void {\n this.inorderTraversal((k, v) => {\n fn(k, v);\n return false;\n });\n }\n\n toString(): string {\n const descriptions: string[] = [];\n this.inorderTraversal((k, v) => {\n descriptions.push(`${k}:${v}`);\n return false;\n });\n return `{${descriptions.join(', ')}}`;\n }\n\n // Traverses the map in reverse key order and calls the specified action\n // function for each key/value pair. If action returns true, traversal is\n // aborted.\n // Returns the first truthy value returned by action, or the last falsey\n // value returned by action.\n reverseTraversal<T>(action: (k: K, v: V) => T): T {\n return (this.root as LLRBNode<K, V>).reverseTraversal(action);\n }\n\n // Returns an iterator over the SortedMap.\n getIterator(): SortedMapIterator<K, V> {\n return new SortedMapIterator<K, V>(this.root, null, this.comparator, false);\n }\n\n getIteratorFrom(key: K): SortedMapIterator<K, V> {\n return new SortedMapIterator<K, V>(this.root, key, this.comparator, false);\n }\n\n getReverseIterator(): SortedMapIterator<K, V> {\n return new SortedMapIterator<K, V>(this.root, null, this.comparator, true);\n }\n\n getReverseIteratorFrom(key: K): SortedMapIterator<K, V> {\n return new SortedMapIterator<K, V>(this.root, key, this.comparator, true);\n }\n} // end SortedMap\n\n// An iterator over an LLRBNode.\nexport class SortedMapIterator<K, V> {\n private isReverse: boolean;\n private nodeStack: Array<LLRBNode<K, V> | LLRBEmptyNode<K, V>>;\n\n constructor(\n node: LLRBNode<K, V> | LLRBEmptyNode<K, V>,\n startKey: K | null,\n comparator: Comparator<K>,\n isReverse: boolean\n ) {\n this.isReverse = isReverse;\n this.nodeStack = [];\n\n let cmp = 1;\n while (!node.isEmpty()) {\n cmp = startKey ? comparator(node.key, startKey) : 1;\n // flip the comparison if we're going in reverse\n if (startKey && isReverse) {\n cmp *= -1;\n }\n\n if (cmp < 0) {\n // This node is less than our start key. ignore it\n if (this.isReverse) {\n node = node.left;\n } else {\n node = node.right;\n }\n } else if (cmp === 0) {\n // This node is exactly equal to our start key. Push it on the stack,\n // but stop iterating;\n this.nodeStack.push(node);\n break;\n } else {\n // This node is greater than our start key, add it to the stack and move\n // to the next one\n this.nodeStack.push(node);\n if (this.isReverse) {\n node = node.right;\n } else {\n node = node.left;\n }\n }\n }\n }\n\n getNext(): Entry<K, V> {\n debugAssert(\n this.nodeStack.length > 0,\n 'getNext() called on iterator when hasNext() is false.'\n );\n\n let node = this.nodeStack.pop()!;\n const result = { key: node.key, value: node.value };\n\n if (this.isReverse) {\n node = node.left;\n while (!node.isEmpty()) {\n this.nodeStack.push(node);\n node = node.right;\n }\n } else {\n node = node.right;\n while (!node.isEmpty()) {\n this.nodeStack.push(node);\n node = node.left;\n }\n }\n\n return result;\n }\n\n hasNext(): boolean {\n return this.nodeStack.length > 0;\n }\n\n peek(): Entry<K, V> | null {\n if (this.nodeStack.length === 0) {\n return null;\n }\n\n const node = this.nodeStack[this.nodeStack.length - 1];\n return { key: node.key, value: node.value };\n }\n} // end SortedMapIterator\n\n// Represents a node in a Left-leaning Red-Black tree.\nexport class LLRBNode<K, V> {\n readonly color: boolean;\n readonly left: LLRBNode<K, V> | LLRBEmptyNode<K, V>;\n readonly right: LLRBNode<K, V> | LLRBEmptyNode<K, V>;\n readonly size: number;\n\n // Empty node is shared between all LLRB trees.\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n static EMPTY: LLRBEmptyNode<any, any> = null as any;\n\n static RED = true;\n static BLACK = false;\n\n constructor(\n public key: K,\n public value: V,\n color?: boolean,\n left?: LLRBNode<K, V> | LLRBEmptyNode<K, V>,\n right?: LLRBNode<K, V> | LLRBEmptyNode<K, V>\n ) {\n this.color = color != null ? color : LLRBNode.RED;\n this.left = left != null ? left : LLRBNode.EMPTY;\n this.right = right != null ? right : LLRBNode.EMPTY;\n this.size = this.left.size + 1 + this.right.size;\n }\n\n // Returns a copy of the current node, optionally replacing pieces of it.\n copy(\n key: K | null,\n value: V | null,\n color: boolean | null,\n left: LLRBNode<K, V> | LLRBEmptyNode<K, V> | null,\n right: LLRBNode<K, V> | LLRBEmptyNode<K, V> | null\n ): LLRBNode<K, V> {\n return new LLRBNode<K, V>(\n key != null ? key : this.key,\n value != null ? value : this.value,\n color != null ? color : this.color,\n left != null ? left : this.left,\n right != null ? right : this.right\n );\n }\n\n isEmpty(): boolean {\n return false;\n }\n\n // Traverses the tree in key order and calls the specified action function\n // for each node. If action returns true, traversal is aborted.\n // Returns the first truthy value returned by action, or the last falsey\n // value returned by action.\n inorderTraversal<T>(action: (k: K, v: V) => T): T {\n return (\n (this.left as LLRBNode<K, V>).inorderTraversal(action) ||\n action(this.key, this.value) ||\n (this.right as LLRBNode<K, V>).inorderTraversal(action)\n );\n }\n\n // Traverses the tree in reverse key order and calls the specified action\n // function for each node. If action returns true, traversal is aborted.\n // Returns the first truthy value returned by action, or the last falsey\n // value returned by action.\n reverseTraversal<T>(action: (k: K, v: V) => T): T {\n return (\n (this.right as LLRBNode<K, V>).reverseTraversal(action) ||\n action(this.key, this.value) ||\n (this.left as LLRBNode<K, V>).reverseTraversal(action)\n );\n }\n\n // Returns the minimum node in the tree.\n private min(): LLRBNode<K, V> {\n if (this.left.isEmpty()) {\n return this;\n } else {\n return (this.left as LLRBNode<K, V>).min();\n }\n }\n\n // Returns the maximum key in the tree.\n minKey(): K | null {\n return this.min().key;\n }\n\n // Returns the maximum key in the tree.\n maxKey(): K | null {\n if (this.right.isEmpty()) {\n return this.key;\n } else {\n return this.right.maxKey();\n }\n }\n\n // Returns new tree, with the key/value added.\n insert(key: K, value: V, comparator: Comparator<K>): LLRBNode<K, V> {\n let n: LLRBNode<K, V> = this;\n const cmp = comparator(key, n.key);\n if (cmp < 0) {\n n = n.copy(null, null, null, n.left.insert(key, value, comparator), null);\n } else if (cmp === 0) {\n n = n.copy(null, value, null, null, null);\n } else {\n n = n.copy(\n null,\n null,\n null,\n null,\n n.right.insert(key, value, comparator)\n );\n }\n return n.fixUp();\n }\n\n private removeMin(): LLRBNode<K, V> | LLRBEmptyNode<K, V> {\n if (this.left.isEmpty()) {\n return LLRBNode.EMPTY;\n }\n let n: LLRBNode<K, V> = this;\n if (!n.left.isRed() && !n.left.left.isRed()) {\n n = n.moveRedLeft();\n }\n n = n.copy(null, null, null, (n.left as LLRBNode<K, V>).removeMin(), null);\n return n.fixUp();\n }\n\n // Returns new tree, with the specified item removed.\n remove(\n key: K,\n comparator: Comparator<K>\n ): LLRBNode<K, V> | LLRBEmptyNode<K, V> {\n let smallest: LLRBNode<K, V>;\n let n: LLRBNode<K, V> = this;\n if (comparator(key, n.key) < 0) {\n if (!n.left.isEmpty() && !n.left.isRed() && !n.left.left.isRed()) {\n n = n.moveRedLeft();\n }\n n = n.copy(null, null, null, n.left.remove(key, comparator), null);\n } else {\n if (n.left.isRed()) {\n n = n.rotateRight();\n }\n if (!n.right.isEmpty() && !n.right.isRed() && !n.right.left.isRed()) {\n n = n.moveRedRight();\n }\n if (comparator(key, n.key) === 0) {\n if (n.right.isEmpty()) {\n return LLRBNode.EMPTY;\n } else {\n smallest = (n.right as LLRBNode<K, V>).min();\n n = n.copy(\n smallest.key,\n smallest.value,\n null,\n null,\n (n.right as LLRBNode<K, V>).removeMin()\n );\n }\n }\n n = n.copy(null, null, null, null, n.right.remove(key, comparator));\n }\n return n.fixUp();\n }\n\n isRed(): boolean {\n return this.color;\n }\n\n // Returns new tree after performing any needed rotations.\n private fixUp(): LLRBNode<K, V> {\n let n: LLRBNode<K, V> = this;\n if (n.right.isRed() && !n.left.isRed()) {\n n = n.rotateLeft();\n }\n if (n.left.isRed() && n.left.left.isRed()) {\n n = n.rotateRight();\n }\n if (n.left.isRed() && n.right.isRed()) {\n n = n.colorFlip();\n }\n return n;\n }\n\n private moveRedLeft(): LLRBNode<K, V> {\n let n = this.colorFlip();\n if (n.right.left.isRed()) {\n n = n.copy(\n null,\n null,\n null,\n null,\n (n.right as LLRBNode<K, V>).rotateRight()\n );\n n = n.rotateLeft();\n n = n.colorFlip();\n }\n return n;\n }\n\n private moveRedRight(): LLRBNode<K, V> {\n let n = this.colorFlip();\n if (n.left.left.isRed()) {\n n = n.rotateRight();\n n = n.colorFlip();\n }\n return n;\n }\n\n private rotateLeft(): LLRBNode<K, V> {\n const nl = this.copy(null, null, LLRBNode.RED, null, this.right.left);\n return (this.right as LLRBNode<K, V>).copy(\n null,\n null,\n this.color,\n nl,\n null\n );\n }\n\n private rotateRight(): LLRBNode<K, V> {\n const nr = this.copy(null, null, LLRBNode.RED, this.left.right, null);\n return (this.left as LLRBNode<K, V>).copy(null, null, this.color, null, nr);\n }\n\n private colorFlip(): LLRBNode<K, V> {\n const left = this.left.copy(null, null, !this.left.color, null, null);\n const right = this.right.copy(null, null, !this.right.color, null, null);\n return this.copy(null, null, !this.color, left, right);\n }\n\n // For testing.\n checkMaxDepth(): boolean {\n const blackDepth = this.check();\n if (Math.pow(2.0, blackDepth) <= this.size + 1) {\n return true;\n } else {\n return false;\n }\n }\n\n // In a balanced RB tree, the black-depth (number of black nodes) from root to\n // leaves is equal on both sides. This function verifies that or asserts.\n protected check(): number {\n if (this.isRed() && this.left.isRed()) {\n throw fail('Red node has red child(' + this.key + ',' + this.value + ')');\n }\n if (this.right.isRed()) {\n throw fail('Right child of (' + this.key + ',' + this.value + ') is red');\n }\n const blackDepth = (this.left as LLRBNode<K, V>).check();\n if (blackDepth !== (this.right as LLRBNode<K, V>).check()) {\n throw fail('Black depths differ');\n } else {\n return blackDepth + (this.isRed() ? 0 : 1);\n }\n }\n} // end LLRBNode\n\n// Represents an empty node (a leaf node in the Red-Black Tree).\nexport class LLRBEmptyNode<K, V> {\n get key(): never {\n throw fail('LLRBEmptyNode has no key.');\n }\n get value(): never {\n throw fail('LLRBEmptyNode has no value.');\n }\n get color(): never {\n throw fail('LLRBEmptyNode has no color.');\n }\n get left(): never {\n throw fail('LLRBEmptyNode has no left child.');\n }\n get right(): never {\n throw fail('LLRBEmptyNode has no right child.');\n }\n size = 0;\n\n // Returns a copy of the current node.\n copy(\n key: K | null,\n value: V | null,\n color: boolean | null,\n left: LLRBNode<K, V> | LLRBEmptyNode<K, V> | null,\n right: LLRBNode<K, V> | LLRBEmptyNode<K, V> | null\n ): LLRBEmptyNode<K, V> {\n return this;\n }\n\n // Returns a copy of the tree, with the specified key/value added.\n insert(key: K, value: V, comparator: Comparator<K>): LLRBNode<K, V> {\n return new LLRBNode<K, V>(key, value);\n }\n\n // Returns a copy of the tree, with the specified key removed.\n remove(key: K, comparator: Comparator<K>): LLRBEmptyNode<K, V> {\n return this;\n }\n\n isEmpty(): boolean {\n return true;\n }\n\n inorderTraversal(action: (k: K, v: V) => boolean): boolean {\n return false;\n }\n\n reverseTraversal(action: (k: K, v: V) => boolean): boolean {\n return false;\n }\n\n minKey(): K | null {\n return null;\n }\n\n maxKey(): K | null {\n return null;\n }\n\n isRed(): boolean {\n return false;\n }\n\n // For testing.\n checkMaxDepth(): boolean {\n return true;\n }\n\n protected check(): 0 {\n return 0;\n }\n} // end LLRBEmptyNode\n\nLLRBNode.EMPTY = new LLRBEmptyNode<unknown, unknown>();\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { SortedMap, SortedMapIterator } from './sorted_map';\n\n/**\n * SortedSet is an immutable (copy-on-write) collection that holds elements\n * in order specified by the provided comparator.\n *\n * NOTE: if provided comparator returns 0 for two elements, we consider them to\n * be equal!\n */\nexport class SortedSet<T> {\n private data: SortedMap<T, boolean>;\n\n constructor(private comparator: (left: T, right: T) => number) {\n this.data = new SortedMap<T, boolean>(this.comparator);\n }\n\n has(elem: T): boolean {\n return this.data.get(elem) !== null;\n }\n\n first(): T | null {\n return this.data.minKey();\n }\n\n last(): T | null {\n return this.data.maxKey();\n }\n\n get size(): number {\n return this.data.size;\n }\n\n indexOf(elem: T): number {\n return this.data.indexOf(elem);\n }\n\n /** Iterates elements in order defined by \"comparator\" */\n forEach(cb: (elem: T) => void): void {\n this.data.inorderTraversal((k: T, v: boolean) => {\n cb(k);\n return false;\n });\n }\n\n /** Iterates over `elem`s such that: range[0] <= elem < range[1]. */\n forEachInRange(range: [T, T], cb: (elem: T) => void): void {\n const iter = this.data.getIteratorFrom(range[0]);\n while (iter.hasNext()) {\n const elem = iter.getNext();\n if (this.comparator(elem.key, range[1]) >= 0) {\n return;\n }\n cb(elem.key);\n }\n }\n\n /**\n * Iterates over `elem`s such that: start <= elem until false is returned.\n */\n forEachWhile(cb: (elem: T) => boolean, start?: T): void {\n let iter: SortedMapIterator<T, boolean>;\n if (start !== undefined) {\n iter = this.data.getIteratorFrom(start);\n } else {\n iter = this.data.getIterator();\n }\n while (iter.hasNext()) {\n const elem = iter.getNext();\n const result = cb(elem.key);\n if (!result) {\n return;\n }\n }\n }\n\n /** Finds the least element greater than or equal to `elem`. */\n firstAfterOrEqual(elem: T): T | null {\n const iter = this.data.getIteratorFrom(elem);\n return iter.hasNext() ? iter.getNext().key : null;\n }\n\n getIterator(): SortedSetIterator<T> {\n return new SortedSetIterator<T>(this.data.getIterator());\n }\n\n getIteratorFrom(key: T): SortedSetIterator<T> {\n return new SortedSetIterator<T>(this.data.getIteratorFrom(key));\n }\n\n /** Inserts or updates an element */\n add(elem: T): SortedSet<T> {\n return this.copy(this.data.remove(elem).insert(elem, true));\n }\n\n /** Deletes an element */\n delete(elem: T): SortedSet<T> {\n if (!this.has(elem)) {\n return this;\n }\n return this.copy(this.data.remove(elem));\n }\n\n isEmpty(): boolean {\n return this.data.isEmpty();\n }\n\n unionWith(other: SortedSet<T>): SortedSet<T> {\n let result: SortedSet<T> = this;\n\n // Make sure `result` always refers to the larger one of the two sets.\n if (result.size < other.size) {\n result = other;\n other = this;\n }\n\n other.forEach(elem => {\n result = result.add(elem);\n });\n return result;\n }\n\n isEqual(other: SortedSet<T>): boolean {\n if (!(other instanceof SortedSet)) {\n return false;\n }\n if (this.size !== other.size) {\n return false;\n }\n\n const thisIt = this.data.getIterator();\n const otherIt = other.data.getIterator();\n while (thisIt.hasNext()) {\n const thisElem = thisIt.getNext().key;\n const otherElem = otherIt.getNext().key;\n if (this.comparator(thisElem, otherElem) !== 0) {\n return false;\n }\n }\n return true;\n }\n\n toArray(): T[] {\n const res: T[] = [];\n this.forEach(targetId => {\n res.push(targetId);\n });\n return res;\n }\n\n toString(): string {\n const result: T[] = [];\n this.forEach(elem => result.push(elem));\n return 'SortedSet(' + result.toString() + ')';\n }\n\n private copy(data: SortedMap<T, boolean>): SortedSet<T> {\n const result = new SortedSet(this.comparator);\n result.data = data;\n return result;\n }\n}\n\nexport class SortedSetIterator<T> {\n constructor(private iter: SortedMapIterator<T, boolean>) {}\n\n getNext(): T {\n return this.iter.getNext().key;\n }\n\n hasNext(): boolean {\n return this.iter.hasNext();\n }\n}\n\n/**\n * Compares two sorted sets for equality using their natural ordering. The\n * method computes the intersection and invokes `onAdd` for every element that\n * is in `after` but not `before`. `onRemove` is invoked for every element in\n * `before` but missing from `after`.\n *\n * The method creates a copy of both `before` and `after` and runs in O(n log\n * n), where n is the size of the two lists.\n *\n * @param before - The elements that exist in the original set.\n * @param after - The elements to diff against the original set.\n * @param comparator - The comparator for the elements in before and after.\n * @param onAdd - A function to invoke for every element that is part of `\n * after` but not `before`.\n * @param onRemove - A function to invoke for every element that is part of\n * `before` but not `after`.\n */\nexport function diffSortedSets<T>(\n before: SortedSet<T>,\n after: SortedSet<T>,\n comparator: (l: T, r: T) => number,\n onAdd: (entry: T) => void,\n onRemove: (entry: T) => void\n): void {\n const beforeIt = before.getIterator();\n const afterIt = after.getIterator();\n\n let beforeValue = advanceIterator(beforeIt);\n let afterValue = advanceIterator(afterIt);\n\n // Walk through the two sets at the same time, using the ordering defined by\n // `comparator`.\n while (beforeValue || afterValue) {\n let added = false;\n let removed = false;\n\n if (beforeValue && afterValue) {\n const cmp = comparator(beforeValue, afterValue);\n if (cmp < 0) {\n // The element was removed if the next element in our ordered\n // walkthrough is only in `before`.\n removed = true;\n } else if (cmp > 0) {\n // The element was added if the next element in our ordered walkthrough\n // is only in `after`.\n added = true;\n }\n } else if (beforeValue != null) {\n removed = true;\n } else {\n added = true;\n }\n\n if (added) {\n onAdd(afterValue!);\n afterValue = advanceIterator(afterIt);\n } else if (removed) {\n onRemove(beforeValue!);\n beforeValue = advanceIterator(beforeIt);\n } else {\n beforeValue = advanceIterator(beforeIt);\n afterValue = advanceIterator(afterIt);\n }\n }\n}\n\n/**\n * Returns the next element from the iterator or `undefined` if none available.\n */\nfunction advanceIterator<T>(it: SortedSetIterator<T>): T | undefined {\n return it.hasNext() ? it.getNext() : undefined;\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { debugAssert } from '../util/assert';\nimport { arrayEquals } from '../util/misc';\nimport { SortedSet } from '../util/sorted_set';\n\nimport { FieldPath } from './path';\n\n/**\n * Provides a set of fields that can be used to partially patch a document.\n * FieldMask is used in conjunction with ObjectValue.\n * Examples:\n * foo - Overwrites foo entirely with the provided value. If foo is not\n * present in the companion ObjectValue, the field is deleted.\n * foo.bar - Overwrites only the field bar of the object foo.\n * If foo is not an object, foo is replaced with an object\n * containing foo\n */\nexport class FieldMask {\n constructor(readonly fields: FieldPath[]) {\n // TODO(dimond): validation of FieldMask\n // Sort the field mask to support `FieldMask.isEqual()` and assert below.\n fields.sort(FieldPath.comparator);\n debugAssert(\n !fields.some((v, i) => i !== 0 && v.isEqual(fields[i - 1])),\n 'FieldMask contains field that is not unique: ' +\n fields.find((v, i) => i !== 0 && v.isEqual(fields[i - 1]))!\n );\n }\n\n static empty(): FieldMask {\n return new FieldMask([]);\n }\n\n /**\n * Returns a new FieldMask object that is the result of adding all the given\n * fields paths to this field mask.\n */\n unionWith(extraFields: FieldPath[]): FieldMask {\n let mergedMaskSet = new SortedSet<FieldPath>(FieldPath.comparator);\n for (const fieldPath of this.fields) {\n mergedMaskSet = mergedMaskSet.add(fieldPath);\n }\n for (const fieldPath of extraFields) {\n mergedMaskSet = mergedMaskSet.add(fieldPath);\n }\n return new FieldMask(mergedMaskSet.toArray());\n }\n\n /**\n * Verifies that `fieldPath` is included by at least one field in this field\n * mask.\n *\n * This is an O(n) operation, where `n` is the size of the field mask.\n */\n covers(fieldPath: FieldPath): boolean {\n for (const fieldMaskPath of this.fields) {\n if (fieldMaskPath.isPrefixOf(fieldPath)) {\n return true;\n }\n }\n return false;\n }\n\n isEqual(other: FieldMask): boolean {\n return arrayEquals(this.fields, other.fields, (l, r) => l.isEqual(r));\n }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport {\n MapValue as ProtoMapValue,\n Value as ProtoValue\n} from '../protos/firestore_proto_api';\nimport { debugAssert } from '../util/assert';\nimport { forEach } from '../util/obj';\n\nimport { FieldMask } from './field_mask';\nimport { FieldPath } from './path';\nimport { isServerTimestamp } from './server_timestamps';\nimport { deepClone, isMapValue, valueEquals } from './values';\n\nexport interface JsonObject<T> {\n [name: string]: T;\n}\n/**\n * An ObjectValue represents a MapValue in the Firestore Proto and offers the\n * ability to add and remove fields (via the ObjectValueBuilder).\n */\nexport class ObjectValue {\n constructor(readonly value: { mapValue: ProtoMapValue }) {\n debugAssert(\n !isServerTimestamp(value),\n 'ServerTimestamps should be converted to ServerTimestampValue'\n );\n }\n\n static empty(): ObjectValue {\n return new ObjectValue({ mapValue: {} });\n }\n\n /**\n * Returns the value at the given path or null.\n *\n * @param path - the path to search\n * @returns The value at the path or null if the path is not set.\n */\n field(path: FieldPath): ProtoValue | null {\n if (path.isEmpty()) {\n return this.value;\n } else {\n let currentLevel: ProtoValue = this.value;\n for (let i = 0; i < path.length - 1; ++i) {\n currentLevel = (currentLevel.mapValue!.fields || {})[path.get(i)];\n if (!isMapValue(currentLevel)) {\n return null;\n }\n }\n currentLevel = (currentLevel.mapValue!.fields! || {})[path.lastSegment()];\n return currentLevel || null;\n }\n }\n\n /**\n * Sets the field to the provided value.\n *\n * @param path - The field path to set.\n * @param value - The value to set.\n */\n set(path: FieldPath, value: ProtoValue): void {\n debugAssert(\n !path.isEmpty(),\n 'Cannot set field for empty path on ObjectValue'\n );\n const fieldsMap = this.getFieldsMap(path.popLast());\n fieldsMap[path.lastSegment()] = deepClone(value);\n }\n\n /**\n * Sets the provided fields to the provided values.\n *\n * @param data - A map of fields to values (or null for deletes).\n */\n setAll(data: Map<FieldPath, ProtoValue | null>): void {\n let parent = FieldPath.emptyPath();\n\n let upserts: { [key: string]: ProtoValue } = {};\n let deletes: string[] = [];\n\n data.forEach((value, path) => {\n if (!parent.isImmediateParentOf(path)) {\n // Insert the accumulated changes at this parent location\n const fieldsMap = this.getFieldsMap(parent);\n this.applyChanges(fieldsMap, upserts, deletes);\n upserts = {};\n deletes = [];\n parent = path.popLast();\n }\n\n if (value) {\n upserts[path.lastSegment()] = deepClone(value);\n } else {\n deletes.push(path.lastSegment());\n }\n });\n\n const fieldsMap = this.getFieldsMap(parent);\n this.applyChanges(fieldsMap, upserts, deletes);\n }\n\n /**\n * Removes the field at the specified path. If there is no field at the\n * specified path, nothing is changed.\n *\n * @param path - The field path to remove.\n */\n delete(path: FieldPath): void {\n debugAssert(\n !path.isEmpty(),\n 'Cannot delete field for empty path on ObjectValue'\n );\n const nestedValue = this.field(path.popLast());\n if (isMapValue(nestedValue) && nestedValue.mapValue.fields) {\n delete nestedValue.mapValue.fields[path.lastSegment()];\n }\n }\n\n isEqual(other: ObjectValue): boolean {\n return valueEquals(this.value, other.value);\n }\n\n /**\n * Returns the map that contains the leaf element of `path`. If the parent\n * entry does not yet exist, or if it is not a map, a new map will be created.\n */\n private getFieldsMap(path: FieldPath): Record<string, ProtoValue> {\n let current = this.value;\n\n if (!current.mapValue!.fields) {\n current.mapValue = { fields: {} };\n }\n\n for (let i = 0; i < path.length; ++i) {\n let next = current.mapValue!.fields![path.get(i)];\n if (!isMapValue(next) || !next.mapValue.fields) {\n next = { mapValue: { fields: {} } };\n current.mapValue!.fields![path.get(i)] = next;\n }\n current = next as { mapValue: ProtoMapValue };\n }\n\n return current.mapValue!.fields!;\n }\n\n /**\n * Modifies `fieldsMap` by adding, replacing or deleting the specified\n * entries.\n */\n private applyChanges(\n fieldsMap: Record<string, ProtoValue>,\n inserts: { [key: string]: ProtoValue },\n deletes: string[]\n ): void {\n forEach(inserts, (key, val) => (fieldsMap[key] = val));\n for (const field of deletes) {\n delete fieldsMap[field];\n }\n }\n\n clone(): ObjectValue {\n return new ObjectValue(\n deepClone(this.value) as { mapValue: ProtoMapValue }\n );\n }\n}\n\n/**\n * Returns a FieldMask built from all fields in a MapValue.\n */\nexport function extractFieldMask(value: ProtoMapValue): FieldMask {\n const fields: FieldPath[] = [];\n forEach(value!.fields, (key, value) => {\n const currentPath = new FieldPath([key]);\n if (isMapValue(value)) {\n const nestedMask = extractFieldMask(value.mapValue!);\n const nestedFields = nestedMask.fields;\n if (nestedFields.length === 0) {\n // Preserve the empty map by adding it to the FieldMask.\n fields.push(currentPath);\n } else {\n // For nested and non-empty ObjectValues, add the FieldPath of the\n // leaf nodes.\n for (const nestedPath of nestedFields) {\n fields.push(currentPath.child(nestedPath));\n }\n }\n } else {\n // For nested and non-empty ObjectValues, add the FieldPath of the leaf\n // nodes.\n fields.push(currentPath);\n }\n });\n return new FieldMask(fields);\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { SnapshotVersion } from '../core/snapshot_version';\nimport { debugAssert, fail } from '../util/assert';\n\nimport { DocumentKey } from './document_key';\nimport { ObjectValue } from './object_value';\nimport { FieldPath } from './path';\nimport { valueCompare } from './values';\n\n/**\n * Whether the document represents an existing document, a document that is\n * known to exist or a document whose state or existence is unknown.\n */\nconst enum DocumentType {\n /**\n * Represents the initial state of a MutableDocument when only the document\n * key is known. Invalid documents transition to other states as mutations are\n * applied. If a document remains invalid after applying mutations, it should\n * be discarded.\n *\n * Invalid documents can have neither local nor committed mutations.\n */\n INVALID,\n /**\n * Represents a document in Firestore with a key, version, data and whether\n * the data has local mutations applied to it.\n *\n * Found documents can be sycned or have or committed mutations applied.\n */\n FOUND_DOCUMENT,\n /**\n * Represents that no documents exists for the key at the given version.\n *\n * Documents that are deleted based on a local mutation do not raise snapshots\n * with `hasPendingWrites`. As such, deleted documents never have\n * `HAS_LOCAL_MUTATIONS` set. Once a delete is committed, we store them with\n * `HAS_COMMITTED_MUTATIONS` until we received the delete from the Watch\n * stream.\n */\n NO_DOCUMENT,\n /**\n * Represents an existing document whose data is unknown (e.g. a document that\n * was updated without a known base document).\n *\n * An unknown document always has `HAS_COMMITTED_MUTATIONS` set, since unknown\n * documents can only be generated by applying a patch mutation from a write\n * acknowledgement.\n */\n UNKNOWN_DOCUMENT\n}\n\n/** Describes whether a document has latency-compensated edits applied. */\nconst enum DocumentState {\n /** No mutations applied. Document was sent to us by Watch. */\n SYNCED,\n /**\n * Local mutations applied via the mutation queue. Document is potentially\n * inconsistent.\n */\n HAS_LOCAL_MUTATIONS,\n /**\n * Mutations applied based on a write acknowledgment. Document is potentially\n * inconsistent.\n */\n HAS_COMMITTED_MUTATIONS\n}\n\n/**\n * Represents a document in Firestore with a key, version, data and whether the\n * data has local mutations applied to it.\n */\nexport interface Document {\n /** The key for this document */\n readonly key: DocumentKey;\n\n /**\n * The version of this document if it exists or a version at which this\n * document was guaranteed to not exist.\n */\n readonly version: SnapshotVersion;\n\n /**\n * The timestamp at which this document was read from the remote server. Uses\n * `SnapshotVersion.min()` for documents created by the user.\n */\n readonly readTime: SnapshotVersion;\n\n /**\n * The timestamp at which the document was created. This value increases\n * monotonically when a document is deleted then recreated. It can also be\n * compared to `createTime` of other documents and the `readTime` of a query.\n */\n readonly createTime: SnapshotVersion;\n\n /** The underlying data of this document or an empty value if no data exists. */\n readonly data: ObjectValue;\n\n /** Returns whether local mutations were applied via the mutation queue. */\n readonly hasLocalMutations: boolean;\n\n /** Returns whether mutations were applied based on a write acknowledgment. */\n readonly hasCommittedMutations: boolean;\n\n /**\n * Whether this document had a local mutation applied that has not yet been\n * acknowledged by Watch.\n */\n readonly hasPendingWrites: boolean;\n\n /**\n * Returns whether this document is valid (i.e. it is an entry in the\n * RemoteDocumentCache, was created by a mutation or read from the backend).\n */\n isValidDocument(): boolean;\n\n /**\n * Returns whether the document exists and its data is known at the current\n * version.\n */\n isFoundDocument(): boolean;\n\n /**\n * Returns whether the document is known to not exist at the current version.\n */\n isNoDocument(): boolean;\n\n /**\n * Returns whether the document exists and its data is unknown at the current\n * version.\n */\n isUnknownDocument(): boolean;\n\n isEqual(other: Document | null | undefined): boolean;\n\n /** Creates a mutable copy of this document. */\n mutableCopy(): MutableDocument;\n\n toString(): string;\n}\n\n/**\n * Represents a document in Firestore with a key, version, data and whether it\n * has local mutations applied to it.\n *\n * Documents can transition between states via `convertToFoundDocument()`,\n * `convertToNoDocument()` and `convertToUnknownDocument()`. If a document does\n * not transition to one of these states even after all mutations have been\n * applied, `isValidDocument()` returns false and the document should be removed\n * from all views.\n */\nexport class MutableDocument implements Document {\n private constructor(\n readonly key: DocumentKey,\n private documentType: DocumentType,\n public version: SnapshotVersion,\n public readTime: SnapshotVersion,\n public createTime: SnapshotVersion,\n public data: ObjectValue,\n private documentState: DocumentState\n ) {}\n\n /**\n * Creates a document with no known version or data, but which can serve as\n * base document for mutations.\n */\n static newInvalidDocument(documentKey: DocumentKey): MutableDocument {\n return new MutableDocument(\n documentKey,\n DocumentType.INVALID,\n /* version */ SnapshotVersion.min(),\n /* readTime */ SnapshotVersion.min(),\n /* createTime */ SnapshotVersion.min(),\n ObjectValue.empty(),\n DocumentState.SYNCED\n );\n }\n\n /**\n * Creates a new document that is known to exist with the given data at the\n * given version.\n */\n static newFoundDocument(\n documentKey: DocumentKey,\n version: SnapshotVersion,\n createTime: SnapshotVersion,\n value: ObjectValue\n ): MutableDocument {\n return new MutableDocument(\n documentKey,\n DocumentType.FOUND_DOCUMENT,\n /* version */ version,\n /* readTime */ SnapshotVersion.min(),\n /* createTime */ createTime,\n value,\n DocumentState.SYNCED\n );\n }\n\n /** Creates a new document that is known to not exist at the given version. */\n static newNoDocument(\n documentKey: DocumentKey,\n version: SnapshotVersion\n ): MutableDocument {\n return new MutableDocument(\n documentKey,\n DocumentType.NO_DOCUMENT,\n /* version */ version,\n /* readTime */ SnapshotVersion.min(),\n /* createTime */ SnapshotVersion.min(),\n ObjectValue.empty(),\n DocumentState.SYNCED\n );\n }\n\n /**\n * Creates a new document that is known to exist at the given version but\n * whose data is not known (e.g. a document that was updated without a known\n * base document).\n */\n static newUnknownDocument(\n documentKey: DocumentKey,\n version: SnapshotVersion\n ): MutableDocument {\n return new MutableDocument(\n documentKey,\n DocumentType.UNKNOWN_DOCUMENT,\n /* version */ version,\n /* readTime */ SnapshotVersion.min(),\n /* createTime */ SnapshotVersion.min(),\n ObjectValue.empty(),\n DocumentState.HAS_COMMITTED_MUTATIONS\n );\n }\n\n /**\n * Changes the document type to indicate that it exists and that its version\n * and data are known.\n */\n convertToFoundDocument(\n version: SnapshotVersion,\n value: ObjectValue\n ): MutableDocument {\n // If a document is switching state from being an invalid or deleted\n // document to a valid (FOUND_DOCUMENT) document, either due to receiving an\n // update from Watch or due to applying a local set mutation on top\n // of a deleted document, our best guess about its createTime would be the\n // version at which the document transitioned to a FOUND_DOCUMENT.\n if (\n this.createTime.isEqual(SnapshotVersion.min()) &&\n (this.documentType === DocumentType.NO_DOCUMENT ||\n this.documentType === DocumentType.INVALID)\n ) {\n this.createTime = version;\n }\n this.version = version;\n this.documentType = DocumentType.FOUND_DOCUMENT;\n this.data = value;\n this.documentState = DocumentState.SYNCED;\n return this;\n }\n\n /**\n * Changes the document type to indicate that it doesn't exist at the given\n * version.\n */\n convertToNoDocument(version: SnapshotVersion): MutableDocument {\n this.version = version;\n this.documentType = DocumentType.NO_DOCUMENT;\n this.data = ObjectValue.empty();\n this.documentState = DocumentState.SYNCED;\n return this;\n }\n\n /**\n * Changes the document type to indicate that it exists at a given version but\n * that its data is not known (e.g. a document that was updated without a known\n * base document).\n */\n convertToUnknownDocument(version: SnapshotVersion): MutableDocument {\n this.version = version;\n this.documentType = DocumentType.UNKNOWN_DOCUMENT;\n this.data = ObjectValue.empty();\n this.documentState = DocumentState.HAS_COMMITTED_MUTATIONS;\n return this;\n }\n\n setHasCommittedMutations(): MutableDocument {\n debugAssert(\n this.isValidDocument(),\n 'Invalid documents cannot have committed mutations'\n );\n this.documentState = DocumentState.HAS_COMMITTED_MUTATIONS;\n return this;\n }\n\n setHasLocalMutations(): MutableDocument {\n this.documentState = DocumentState.HAS_LOCAL_MUTATIONS;\n this.version = SnapshotVersion.min();\n return this;\n }\n\n setReadTime(readTime: SnapshotVersion): MutableDocument {\n this.readTime = readTime;\n return this;\n }\n\n get hasLocalMutations(): boolean {\n return this.documentState === DocumentState.HAS_LOCAL_MUTATIONS;\n }\n\n get hasCommittedMutations(): boolean {\n return this.documentState === DocumentState.HAS_COMMITTED_MUTATIONS;\n }\n\n get hasPendingWrites(): boolean {\n return this.hasLocalMutations || this.hasCommittedMutations;\n }\n\n isValidDocument(): boolean {\n return this.documentType !== DocumentType.INVALID;\n }\n\n isFoundDocument(): boolean {\n return this.documentType === DocumentType.FOUND_DOCUMENT;\n }\n\n isNoDocument(): boolean {\n return this.documentType === DocumentType.NO_DOCUMENT;\n }\n\n isUnknownDocument(): boolean {\n return this.documentType === DocumentType.UNKNOWN_DOCUMENT;\n }\n\n isEqual(other: Document | null | undefined): boolean {\n return (\n other instanceof MutableDocument &&\n this.key.isEqual(other.key) &&\n this.version.isEqual(other.version) &&\n this.documentType === other.documentType &&\n this.documentState === other.documentState &&\n this.data.isEqual(other.data)\n );\n }\n\n mutableCopy(): MutableDocument {\n return new MutableDocument(\n this.key,\n this.documentType,\n this.version,\n this.readTime,\n this.createTime,\n this.data.clone(),\n this.documentState\n );\n }\n\n toString(): string {\n return (\n `Document(${this.key}, ${this.version}, ${JSON.stringify(\n this.data.value\n )}, ` +\n `{createTime: ${this.createTime}}), ` +\n `{documentType: ${this.documentType}}), ` +\n `{documentState: ${this.documentState}})`\n );\n }\n}\n\n/**\n * Compares the value for field `field` in the provided documents. Throws if\n * the field does not exist in both documents.\n */\nexport function compareDocumentsByField(\n field: FieldPath,\n d1: Document,\n d2: Document\n): number {\n const v1 = d1.data.field(field);\n const v2 = d2.data.field(field);\n if (v1 !== null && v2 !== null) {\n return valueCompare(v1, v2);\n } else {\n return fail(\"Trying to compare documents on fields that don't exist\");\n }\n}\n","/**\n * @license\n * Copyright 2019 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { DocumentKey } from '../model/document_key';\nimport {\n FieldIndex,\n fieldIndexGetArraySegment,\n fieldIndexGetDirectionalSegments,\n IndexKind\n} from '../model/field_index';\nimport { FieldPath, ResourcePath } from '../model/path';\nimport {\n canonicalId,\n MAX_VALUE,\n MIN_VALUE,\n lowerBoundCompare,\n upperBoundCompare,\n valuesGetLowerBound,\n valuesGetUpperBound\n} from '../model/values';\nimport { Value as ProtoValue } from '../protos/firestore_proto_api';\nimport { debugCast } from '../util/assert';\nimport { SortedSet } from '../util/sorted_set';\nimport { isNullOrUndefined } from '../util/types';\n\nimport { Bound, boundEquals } from './bound';\nimport {\n Filter,\n FieldFilter,\n canonifyFilter,\n stringifyFilter,\n filterEquals,\n Operator\n} from './filter';\nimport {\n canonifyOrderBy,\n OrderBy,\n orderByEquals,\n stringifyOrderBy\n} from './order_by';\n\n/**\n * A Target represents the WatchTarget representation of a Query, which is used\n * by the LocalStore and the RemoteStore to keep track of and to execute\n * backend queries. While a Query can represent multiple Targets, each Targets\n * maps to a single WatchTarget in RemoteStore and a single TargetData entry\n * in persistence.\n */\nexport interface Target {\n readonly path: ResourcePath;\n readonly collectionGroup: string | null;\n readonly orderBy: OrderBy[];\n readonly filters: Filter[];\n readonly limit: number | null;\n readonly startAt: Bound | null;\n readonly endAt: Bound | null;\n}\n\n// Visible for testing\nexport class TargetImpl implements Target {\n memoizedCanonicalId: string | null = null;\n constructor(\n readonly path: ResourcePath,\n readonly collectionGroup: string | null = null,\n readonly orderBy: OrderBy[] = [],\n readonly filters: Filter[] = [],\n readonly limit: number | null = null,\n readonly startAt: Bound | null = null,\n readonly endAt: Bound | null = null\n ) {}\n}\n\n/**\n * Initializes a Target with a path and optional additional query constraints.\n * Path must currently be empty if this is a collection group query.\n *\n * NOTE: you should always construct `Target` from `Query.toTarget` instead of\n * using this factory method, because `Query` provides an implicit `orderBy`\n * property.\n */\nexport function newTarget(\n path: ResourcePath,\n collectionGroup: string | null = null,\n orderBy: OrderBy[] = [],\n filters: Filter[] = [],\n limit: number | null = null,\n startAt: Bound | null = null,\n endAt: Bound | null = null\n): Target {\n return new TargetImpl(\n path,\n collectionGroup,\n orderBy,\n filters,\n limit,\n startAt,\n endAt\n );\n}\n\nexport function canonifyTarget(target: Target): string {\n const targetImpl = debugCast(target, TargetImpl);\n\n if (targetImpl.memoizedCanonicalId === null) {\n let str = targetImpl.path.canonicalString();\n if (targetImpl.collectionGroup !== null) {\n str += '|cg:' + targetImpl.collectionGroup;\n }\n str += '|f:';\n str += targetImpl.filters.map(f => canonifyFilter(f)).join(',');\n str += '|ob:';\n str += targetImpl.orderBy.map(o => canonifyOrderBy(o)).join(',');\n\n if (!isNullOrUndefined(targetImpl.limit)) {\n str += '|l:';\n str += targetImpl.limit!;\n }\n if (targetImpl.startAt) {\n str += '|lb:';\n str += targetImpl.startAt.inclusive ? 'b:' : 'a:';\n str += targetImpl.startAt.position.map(p => canonicalId(p)).join(',');\n }\n if (targetImpl.endAt) {\n str += '|ub:';\n str += targetImpl.endAt.inclusive ? 'a:' : 'b:';\n str += targetImpl.endAt.position.map(p => canonicalId(p)).join(',');\n }\n targetImpl.memoizedCanonicalId = str;\n }\n return targetImpl.memoizedCanonicalId;\n}\n\nexport function stringifyTarget(target: Target): string {\n let str = target.path.canonicalString();\n if (target.collectionGroup !== null) {\n str += ' collectionGroup=' + target.collectionGroup;\n }\n if (target.filters.length > 0) {\n str += `, filters: [${target.filters\n .map(f => stringifyFilter(f))\n .join(', ')}]`;\n }\n if (!isNullOrUndefined(target.limit)) {\n str += ', limit: ' + target.limit;\n }\n if (target.orderBy.length > 0) {\n str += `, orderBy: [${target.orderBy\n .map(o => stringifyOrderBy(o))\n .join(', ')}]`;\n }\n if (target.startAt) {\n str += ', startAt: ';\n str += target.startAt.inclusive ? 'b:' : 'a:';\n str += target.startAt.position.map(p => canonicalId(p)).join(',');\n }\n if (target.endAt) {\n str += ', endAt: ';\n str += target.endAt.inclusive ? 'a:' : 'b:';\n str += target.endAt.position.map(p => canonicalId(p)).join(',');\n }\n return `Target(${str})`;\n}\n\nexport function targetEquals(left: Target, right: Target): boolean {\n if (left.limit !== right.limit) {\n return false;\n }\n\n if (left.orderBy.length !== right.orderBy.length) {\n return false;\n }\n\n for (let i = 0; i < left.orderBy.length; i++) {\n if (!orderByEquals(left.orderBy[i], right.orderBy[i])) {\n return false;\n }\n }\n\n if (left.filters.length !== right.filters.length) {\n return false;\n }\n\n for (let i = 0; i < left.filters.length; i++) {\n if (!filterEquals(left.filters[i], right.filters[i])) {\n return false;\n }\n }\n\n if (left.collectionGroup !== right.collectionGroup) {\n return false;\n }\n\n if (!left.path.isEqual(right.path)) {\n return false;\n }\n\n if (!boundEquals(left.startAt, right.startAt)) {\n return false;\n }\n\n return boundEquals(left.endAt, right.endAt);\n}\n\nexport function targetIsDocumentTarget(target: Target): boolean {\n return (\n DocumentKey.isDocumentKey(target.path) &&\n target.collectionGroup === null &&\n target.filters.length === 0\n );\n}\n\n/** Returns the field filters that target the given field path. */\nexport function targetGetFieldFiltersForPath(\n target: Target,\n path: FieldPath\n): FieldFilter[] {\n return target.filters.filter(\n f => f instanceof FieldFilter && f.field.isEqual(path)\n ) as FieldFilter[];\n}\n\n/**\n * Returns the values that are used in ARRAY_CONTAINS or ARRAY_CONTAINS_ANY\n * filters. Returns `null` if there are no such filters.\n */\nexport function targetGetArrayValues(\n target: Target,\n fieldIndex: FieldIndex\n): ProtoValue[] | null {\n const segment = fieldIndexGetArraySegment(fieldIndex);\n if (segment === undefined) {\n return null;\n }\n\n for (const fieldFilter of targetGetFieldFiltersForPath(\n target,\n segment.fieldPath\n )) {\n switch (fieldFilter.op) {\n case Operator.ARRAY_CONTAINS_ANY:\n return fieldFilter.value.arrayValue!.values || [];\n case Operator.ARRAY_CONTAINS:\n return [fieldFilter.value];\n default:\n // Remaining filters are not array filters.\n }\n }\n return null;\n}\n\n/**\n * Returns the list of values that are used in != or NOT_IN filters. Returns\n * `null` if there are no such filters.\n */\nexport function targetGetNotInValues(\n target: Target,\n fieldIndex: FieldIndex\n): ProtoValue[] | null {\n const values = new Map</* fieldPath = */ string, ProtoValue>();\n\n for (const segment of fieldIndexGetDirectionalSegments(fieldIndex)) {\n for (const fieldFilter of targetGetFieldFiltersForPath(\n target,\n segment.fieldPath\n )) {\n switch (fieldFilter.op) {\n case Operator.EQUAL:\n case Operator.IN:\n // Encode equality prefix, which is encoded in the index value before\n // the inequality (e.g. `a == 'a' && b != 'b'` is encoded to\n // `value != 'ab'`).\n values.set(segment.fieldPath.canonicalString(), fieldFilter.value);\n break;\n case Operator.NOT_IN:\n case Operator.NOT_EQUAL:\n // NotIn/NotEqual is always a suffix. There cannot be any remaining\n // segments and hence we can return early here.\n values.set(segment.fieldPath.canonicalString(), fieldFilter.value);\n return Array.from(values.values());\n default:\n // Remaining filters cannot be used as notIn bounds.\n }\n }\n }\n\n return null;\n}\n\n/**\n * Returns a lower bound of field values that can be used as a starting point to\n * scan the index defined by `fieldIndex`. Returns `MIN_VALUE` if no lower bound\n * exists.\n */\nexport function targetGetLowerBound(\n target: Target,\n fieldIndex: FieldIndex\n): Bound {\n const values: ProtoValue[] = [];\n let inclusive = true;\n\n // For each segment, retrieve a lower bound if there is a suitable filter or\n // startAt.\n for (const segment of fieldIndexGetDirectionalSegments(fieldIndex)) {\n const segmentBound =\n segment.kind === IndexKind.ASCENDING\n ? targetGetAscendingBound(target, segment.fieldPath, target.startAt)\n : targetGetDescendingBound(target, segment.fieldPath, target.startAt);\n\n values.push(segmentBound.value);\n inclusive &&= segmentBound.inclusive;\n }\n return new Bound(values, inclusive);\n}\n\n/**\n * Returns an upper bound of field values that can be used as an ending point\n * when scanning the index defined by `fieldIndex`. Returns `MAX_VALUE` if no\n * upper bound exists.\n */\nexport function targetGetUpperBound(\n target: Target,\n fieldIndex: FieldIndex\n): Bound {\n const values: ProtoValue[] = [];\n let inclusive = true;\n\n // For each segment, retrieve an upper bound if there is a suitable filter or\n // endAt.\n for (const segment of fieldIndexGetDirectionalSegments(fieldIndex)) {\n const segmentBound =\n segment.kind === IndexKind.ASCENDING\n ? targetGetDescendingBound(target, segment.fieldPath, target.endAt)\n : targetGetAscendingBound(target, segment.fieldPath, target.endAt);\n\n values.push(segmentBound.value);\n inclusive &&= segmentBound.inclusive;\n }\n\n return new Bound(values, inclusive);\n}\n\n/**\n * Returns the value to use as the lower bound for ascending index segment at\n * the provided `fieldPath` (or the upper bound for an descending segment).\n */\nfunction targetGetAscendingBound(\n target: Target,\n fieldPath: FieldPath,\n bound: Bound | null\n): { value: ProtoValue; inclusive: boolean } {\n let value: ProtoValue = MIN_VALUE;\n\n let inclusive = true;\n\n // Process all filters to find a value for the current field segment\n for (const fieldFilter of targetGetFieldFiltersForPath(target, fieldPath)) {\n let filterValue: ProtoValue = MIN_VALUE;\n let filterInclusive = true;\n\n switch (fieldFilter.op) {\n case Operator.LESS_THAN:\n case Operator.LESS_THAN_OR_EQUAL:\n filterValue = valuesGetLowerBound(fieldFilter.value);\n break;\n case Operator.EQUAL:\n case Operator.IN:\n case Operator.GREATER_THAN_OR_EQUAL:\n filterValue = fieldFilter.value;\n break;\n case Operator.GREATER_THAN:\n filterValue = fieldFilter.value;\n filterInclusive = false;\n break;\n case Operator.NOT_EQUAL:\n case Operator.NOT_IN:\n filterValue = MIN_VALUE;\n break;\n default:\n // Remaining filters cannot be used as lower bounds.\n }\n\n if (\n lowerBoundCompare(\n { value, inclusive },\n { value: filterValue, inclusive: filterInclusive }\n ) < 0\n ) {\n value = filterValue;\n inclusive = filterInclusive;\n }\n }\n\n // If there is an additional bound, compare the values against the existing\n // range to see if we can narrow the scope.\n if (bound !== null) {\n for (let i = 0; i < target.orderBy.length; ++i) {\n const orderBy = target.orderBy[i];\n if (orderBy.field.isEqual(fieldPath)) {\n const cursorValue = bound.position[i];\n if (\n lowerBoundCompare(\n { value, inclusive },\n { value: cursorValue, inclusive: bound.inclusive }\n ) < 0\n ) {\n value = cursorValue;\n inclusive = bound.inclusive;\n }\n break;\n }\n }\n }\n\n return { value, inclusive };\n}\n\n/**\n * Returns the value to use as the upper bound for ascending index segment at\n * the provided `fieldPath` (or the lower bound for a descending segment).\n */\nfunction targetGetDescendingBound(\n target: Target,\n fieldPath: FieldPath,\n bound: Bound | null\n): { value: ProtoValue; inclusive: boolean } {\n let value: ProtoValue = MAX_VALUE;\n let inclusive = true;\n\n // Process all filters to find a value for the current field segment\n for (const fieldFilter of targetGetFieldFiltersForPath(target, fieldPath)) {\n let filterValue: ProtoValue = MAX_VALUE;\n let filterInclusive = true;\n\n switch (fieldFilter.op) {\n case Operator.GREATER_THAN_OR_EQUAL:\n case Operator.GREATER_THAN:\n filterValue = valuesGetUpperBound(fieldFilter.value);\n filterInclusive = false;\n break;\n case Operator.EQUAL:\n case Operator.IN:\n case Operator.LESS_THAN_OR_EQUAL:\n filterValue = fieldFilter.value;\n break;\n case Operator.LESS_THAN:\n filterValue = fieldFilter.value;\n filterInclusive = false;\n break;\n case Operator.NOT_EQUAL:\n case Operator.NOT_IN:\n filterValue = MAX_VALUE;\n break;\n default:\n // Remaining filters cannot be used as upper bounds.\n }\n\n if (\n upperBoundCompare(\n { value, inclusive },\n { value: filterValue, inclusive: filterInclusive }\n ) > 0\n ) {\n value = filterValue;\n inclusive = filterInclusive;\n }\n }\n\n // If there is an additional bound, compare the values against the existing\n // range to see if we can narrow the scope.\n if (bound !== null) {\n for (let i = 0; i < target.orderBy.length; ++i) {\n const orderBy = target.orderBy[i];\n if (orderBy.field.isEqual(fieldPath)) {\n const cursorValue = bound.position[i];\n if (\n upperBoundCompare(\n { value, inclusive },\n { value: cursorValue, inclusive: bound.inclusive }\n ) > 0\n ) {\n value = cursorValue;\n inclusive = bound.inclusive;\n }\n break;\n }\n }\n }\n\n return { value, inclusive };\n}\n\n/** Returns the number of segments of a perfect index for this target. */\nexport function targetGetSegmentCount(target: Target): number {\n let fields = new SortedSet<FieldPath>(FieldPath.comparator);\n let hasArraySegment = false;\n\n for (const filter of target.filters) {\n for (const subFilter of filter.getFlattenedFilters()) {\n // __name__ is not an explicit segment of any index, so we don't need to\n // count it.\n if (subFilter.field.isKeyField()) {\n continue;\n }\n\n // ARRAY_CONTAINS or ARRAY_CONTAINS_ANY filters must be counted separately.\n // For instance, it is possible to have an index for \"a ARRAY a ASC\". Even\n // though these are on the same field, they should be counted as two\n // separate segments in an index.\n if (\n subFilter.op === Operator.ARRAY_CONTAINS ||\n subFilter.op === Operator.ARRAY_CONTAINS_ANY\n ) {\n hasArraySegment = true;\n } else {\n fields = fields.add(subFilter.field);\n }\n }\n }\n\n for (const orderBy of target.orderBy) {\n // __name__ is not an explicit segment of any index, so we don't need to\n // count it.\n if (!orderBy.field.isKeyField()) {\n fields = fields.add(orderBy.field);\n }\n }\n\n return fields.size + (hasArraySegment ? 1 : 0);\n}\n\nexport function targetHasLimit(target: Target): boolean {\n return target.limit !== null;\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { compareDocumentsByField, Document } from '../model/document';\nimport { DocumentKey } from '../model/document_key';\nimport { FieldPath, ResourcePath } from '../model/path';\nimport { debugAssert, debugCast, fail } from '../util/assert';\n\nimport {\n Bound,\n boundSortsAfterDocument,\n boundSortsBeforeDocument\n} from './bound';\nimport { CompositeFilter, Filter } from './filter';\nimport { Direction, OrderBy } from './order_by';\nimport {\n canonifyTarget,\n newTarget,\n stringifyTarget,\n Target,\n targetEquals\n} from './target';\n\nexport const enum LimitType {\n First = 'F',\n Last = 'L'\n}\n\n/**\n * The Query interface defines all external properties of a query.\n *\n * QueryImpl implements this interface to provide memoization for `queryOrderBy`\n * and `queryToTarget`.\n */\nexport interface Query {\n readonly path: ResourcePath;\n readonly collectionGroup: string | null;\n readonly explicitOrderBy: OrderBy[];\n readonly filters: Filter[];\n readonly limit: number | null;\n readonly limitType: LimitType;\n readonly startAt: Bound | null;\n readonly endAt: Bound | null;\n}\n\n/**\n * Query encapsulates all the query attributes we support in the SDK. It can\n * be run against the LocalStore, as well as be converted to a `Target` to\n * query the RemoteStore results.\n *\n * Visible for testing.\n */\nexport class QueryImpl implements Query {\n memoizedOrderBy: OrderBy[] | null = null;\n\n // The corresponding `Target` of this `Query` instance.\n memoizedTarget: Target | null = null;\n\n /**\n * Initializes a Query with a path and optional additional query constraints.\n * Path must currently be empty if this is a collection group query.\n */\n constructor(\n readonly path: ResourcePath,\n readonly collectionGroup: string | null = null,\n readonly explicitOrderBy: OrderBy[] = [],\n readonly filters: Filter[] = [],\n readonly limit: number | null = null,\n readonly limitType: LimitType = LimitType.First,\n readonly startAt: Bound | null = null,\n readonly endAt: Bound | null = null\n ) {\n if (this.startAt) {\n debugAssert(\n this.startAt.position.length <= queryOrderBy(this).length,\n 'Bound is longer than orderBy'\n );\n }\n if (this.endAt) {\n debugAssert(\n this.endAt.position.length <= queryOrderBy(this).length,\n 'Bound is longer than orderBy'\n );\n }\n }\n}\n\n/** Creates a new Query instance with the options provided. */\nexport function newQuery(\n path: ResourcePath,\n collectionGroup: string | null,\n explicitOrderBy: OrderBy[],\n filters: Filter[],\n limit: number | null,\n limitType: LimitType,\n startAt: Bound | null,\n endAt: Bound | null\n): Query {\n return new QueryImpl(\n path,\n collectionGroup,\n explicitOrderBy,\n filters,\n limit,\n limitType,\n startAt,\n endAt\n );\n}\n\n/** Creates a new Query for a query that matches all documents at `path` */\nexport function newQueryForPath(path: ResourcePath): Query {\n return new QueryImpl(path);\n}\n\n/**\n * Helper to convert a collection group query into a collection query at a\n * specific path. This is used when executing collection group queries, since\n * we have to split the query into a set of collection queries at multiple\n * paths.\n */\nexport function asCollectionQueryAtPath(\n query: Query,\n path: ResourcePath\n): Query {\n return new QueryImpl(\n path,\n /*collectionGroup=*/ null,\n query.explicitOrderBy.slice(),\n query.filters.slice(),\n query.limit,\n query.limitType,\n query.startAt,\n query.endAt\n );\n}\n\n/**\n * Returns true if this query does not specify any query constraints that\n * could remove results.\n */\nexport function queryMatchesAllDocuments(query: Query): boolean {\n return (\n query.filters.length === 0 &&\n query.limit === null &&\n query.startAt == null &&\n query.endAt == null &&\n (query.explicitOrderBy.length === 0 ||\n (query.explicitOrderBy.length === 1 &&\n query.explicitOrderBy[0].field.isKeyField()))\n );\n}\n\nexport function queryContainsCompositeFilters(query: Query): boolean {\n return (\n query.filters.find(filter => filter instanceof CompositeFilter) !==\n undefined\n );\n}\n\nexport function getFirstOrderByField(query: Query): FieldPath | null {\n return query.explicitOrderBy.length > 0\n ? query.explicitOrderBy[0].field\n : null;\n}\n\nexport function getInequalityFilterField(query: Query): FieldPath | null {\n for (const filter of query.filters) {\n const result = filter.getFirstInequalityField();\n if (result !== null) {\n return result;\n }\n }\n\n return null;\n}\n\n/**\n * Creates a new Query for a collection group query that matches all documents\n * within the provided collection group.\n */\nexport function newQueryForCollectionGroup(collectionId: string): Query {\n return new QueryImpl(ResourcePath.emptyPath(), collectionId);\n}\n\n/**\n * Returns whether the query matches a single document by path (rather than a\n * collection).\n */\nexport function isDocumentQuery(query: Query): boolean {\n return (\n DocumentKey.isDocumentKey(query.path) &&\n query.collectionGroup === null &&\n query.filters.length === 0\n );\n}\n\n/**\n * Returns whether the query matches a collection group rather than a specific\n * collection.\n */\nexport function isCollectionGroupQuery(query: Query): boolean {\n return query.collectionGroup !== null;\n}\n\n/**\n * Returns the implicit order by constraint that is used to execute the Query,\n * which can be different from the order by constraints the user provided (e.g.\n * the SDK and backend always orders by `__name__`).\n */\nexport function queryOrderBy(query: Query): OrderBy[] {\n const queryImpl = debugCast(query, QueryImpl);\n if (queryImpl.memoizedOrderBy === null) {\n queryImpl.memoizedOrderBy = [];\n\n const inequalityField = getInequalityFilterField(queryImpl);\n const firstOrderByField = getFirstOrderByField(queryImpl);\n if (inequalityField !== null && firstOrderByField === null) {\n // In order to implicitly add key ordering, we must also add the\n // inequality filter field for it to be a valid query.\n // Note that the default inequality field and key ordering is ascending.\n if (!inequalityField.isKeyField()) {\n queryImpl.memoizedOrderBy.push(new OrderBy(inequalityField));\n }\n queryImpl.memoizedOrderBy.push(\n new OrderBy(FieldPath.keyField(), Direction.ASCENDING)\n );\n } else {\n debugAssert(\n inequalityField === null ||\n (firstOrderByField !== null &&\n inequalityField.isEqual(firstOrderByField)),\n 'First orderBy should match inequality field.'\n );\n let foundKeyOrdering = false;\n for (const orderBy of queryImpl.explicitOrderBy) {\n queryImpl.memoizedOrderBy.push(orderBy);\n if (orderBy.field.isKeyField()) {\n foundKeyOrdering = true;\n }\n }\n if (!foundKeyOrdering) {\n // The order of the implicit key ordering always matches the last\n // explicit order by\n const lastDirection =\n queryImpl.explicitOrderBy.length > 0\n ? queryImpl.explicitOrderBy[queryImpl.explicitOrderBy.length - 1]\n .dir\n : Direction.ASCENDING;\n queryImpl.memoizedOrderBy.push(\n new OrderBy(FieldPath.keyField(), lastDirection)\n );\n }\n }\n }\n return queryImpl.memoizedOrderBy;\n}\n\n/**\n * Converts this `Query` instance to it's corresponding `Target` representation.\n */\nexport function queryToTarget(query: Query): Target {\n const queryImpl = debugCast(query, QueryImpl);\n if (!queryImpl.memoizedTarget) {\n if (queryImpl.limitType === LimitType.First) {\n queryImpl.memoizedTarget = newTarget(\n queryImpl.path,\n queryImpl.collectionGroup,\n queryOrderBy(queryImpl),\n queryImpl.filters,\n queryImpl.limit,\n queryImpl.startAt,\n queryImpl.endAt\n );\n } else {\n // Flip the orderBy directions since we want the last results\n const orderBys = [] as OrderBy[];\n for (const orderBy of queryOrderBy(queryImpl)) {\n const dir =\n orderBy.dir === Direction.DESCENDING\n ? Direction.ASCENDING\n : Direction.DESCENDING;\n orderBys.push(new OrderBy(orderBy.field, dir));\n }\n\n // We need to swap the cursors to match the now-flipped query ordering.\n const startAt = queryImpl.endAt\n ? new Bound(queryImpl.endAt.position, queryImpl.endAt.inclusive)\n : null;\n const endAt = queryImpl.startAt\n ? new Bound(queryImpl.startAt.position, queryImpl.startAt.inclusive)\n : null;\n\n // Now return as a LimitType.First query.\n queryImpl.memoizedTarget = newTarget(\n queryImpl.path,\n queryImpl.collectionGroup,\n orderBys,\n queryImpl.filters,\n queryImpl.limit,\n startAt,\n endAt\n );\n }\n }\n return queryImpl.memoizedTarget!;\n}\n\nexport function queryWithAddedFilter(query: Query, filter: Filter): Query {\n const newInequalityField = filter.getFirstInequalityField();\n const queryInequalityField = getInequalityFilterField(query);\n\n debugAssert(\n queryInequalityField == null ||\n newInequalityField == null ||\n newInequalityField.isEqual(queryInequalityField),\n 'Query must only have one inequality field.'\n );\n\n debugAssert(\n !isDocumentQuery(query),\n 'No filtering allowed for document query'\n );\n\n const newFilters = query.filters.concat([filter]);\n return new QueryImpl(\n query.path,\n query.collectionGroup,\n query.explicitOrderBy.slice(),\n newFilters,\n query.limit,\n query.limitType,\n query.startAt,\n query.endAt\n );\n}\n\nexport function queryWithAddedOrderBy(query: Query, orderBy: OrderBy): Query {\n debugAssert(\n !query.startAt && !query.endAt,\n 'Bounds must be set after orderBy'\n );\n // TODO(dimond): validate that orderBy does not list the same key twice.\n const newOrderBy = query.explicitOrderBy.concat([orderBy]);\n return new QueryImpl(\n query.path,\n query.collectionGroup,\n newOrderBy,\n query.filters.slice(),\n query.limit,\n query.limitType,\n query.startAt,\n query.endAt\n );\n}\n\nexport function queryWithLimit(\n query: Query,\n limit: number | null,\n limitType: LimitType\n): Query {\n return new QueryImpl(\n query.path,\n query.collectionGroup,\n query.explicitOrderBy.slice(),\n query.filters.slice(),\n limit,\n limitType,\n query.startAt,\n query.endAt\n );\n}\n\nexport function queryWithStartAt(query: Query, bound: Bound): Query {\n return new QueryImpl(\n query.path,\n query.collectionGroup,\n query.explicitOrderBy.slice(),\n query.filters.slice(),\n query.limit,\n query.limitType,\n bound,\n query.endAt\n );\n}\n\nexport function queryWithEndAt(query: Query, bound: Bound): Query {\n return new QueryImpl(\n query.path,\n query.collectionGroup,\n query.explicitOrderBy.slice(),\n query.filters.slice(),\n query.limit,\n query.limitType,\n query.startAt,\n bound\n );\n}\n\nexport function queryEquals(left: Query, right: Query): boolean {\n return (\n targetEquals(queryToTarget(left), queryToTarget(right)) &&\n left.limitType === right.limitType\n );\n}\n\n// TODO(b/29183165): This is used to get a unique string from a query to, for\n// example, use as a dictionary key, but the implementation is subject to\n// collisions. Make it collision-free.\nexport function canonifyQuery(query: Query): string {\n return `${canonifyTarget(queryToTarget(query))}|lt:${query.limitType}`;\n}\n\nexport function stringifyQuery(query: Query): string {\n return `Query(target=${stringifyTarget(queryToTarget(query))}; limitType=${\n query.limitType\n })`;\n}\n\n/** Returns whether `doc` matches the constraints of `query`. */\nexport function queryMatches(query: Query, doc: Document): boolean {\n return (\n doc.isFoundDocument() &&\n queryMatchesPathAndCollectionGroup(query, doc) &&\n queryMatchesOrderBy(query, doc) &&\n queryMatchesFilters(query, doc) &&\n queryMatchesBounds(query, doc)\n );\n}\n\nfunction queryMatchesPathAndCollectionGroup(\n query: Query,\n doc: Document\n): boolean {\n const docPath = doc.key.path;\n if (query.collectionGroup !== null) {\n // NOTE: this.path is currently always empty since we don't expose Collection\n // Group queries rooted at a document path yet.\n return (\n doc.key.hasCollectionId(query.collectionGroup) &&\n query.path.isPrefixOf(docPath)\n );\n } else if (DocumentKey.isDocumentKey(query.path)) {\n // exact match for document queries\n return query.path.isEqual(docPath);\n } else {\n // shallow ancestor queries by default\n return query.path.isImmediateParentOf(docPath);\n }\n}\n\n/**\n * A document must have a value for every ordering clause in order to show up\n * in the results.\n */\nfunction queryMatchesOrderBy(query: Query, doc: Document): boolean {\n // We must use `queryOrderBy()` to get the list of all orderBys (both implicit and explicit).\n // Note that for OR queries, orderBy applies to all disjunction terms and implicit orderBys must\n // be taken into account. For example, the query \"a > 1 || b==1\" has an implicit \"orderBy a\" due\n // to the inequality, and is evaluated as \"a > 1 orderBy a || b==1 orderBy a\".\n // A document with content of {b:1} matches the filters, but does not match the orderBy because\n // it's missing the field 'a'.\n for (const orderBy of queryOrderBy(query)) {\n // order by key always matches\n if (!orderBy.field.isKeyField() && doc.data.field(orderBy.field) === null) {\n return false;\n }\n }\n return true;\n}\n\nfunction queryMatchesFilters(query: Query, doc: Document): boolean {\n for (const filter of query.filters) {\n if (!filter.matches(doc)) {\n return false;\n }\n }\n return true;\n}\n\n/** Makes sure a document is within the bounds, if provided. */\nfunction queryMatchesBounds(query: Query, doc: Document): boolean {\n if (\n query.startAt &&\n !boundSortsBeforeDocument(query.startAt, queryOrderBy(query), doc)\n ) {\n return false;\n }\n if (\n query.endAt &&\n !boundSortsAfterDocument(query.endAt, queryOrderBy(query), doc)\n ) {\n return false;\n }\n return true;\n}\n\n/**\n * Returns the collection group that this query targets.\n *\n * PORTING NOTE: This is only used in the Web SDK to facilitate multi-tab\n * synchronization for query results.\n */\nexport function queryCollectionGroup(query: Query): string {\n return (\n query.collectionGroup ||\n (query.path.length % 2 === 1\n ? query.path.lastSegment()\n : query.path.get(query.path.length - 2))\n );\n}\n\n/**\n * Returns a new comparator function that can be used to compare two documents\n * based on the Query's ordering constraint.\n */\nexport function newQueryComparator(\n query: Query\n): (d1: Document, d2: Document) => number {\n return (d1: Document, d2: Document): number => {\n let comparedOnKeyField = false;\n for (const orderBy of queryOrderBy(query)) {\n const comp = compareDocs(orderBy, d1, d2);\n if (comp !== 0) {\n return comp;\n }\n comparedOnKeyField = comparedOnKeyField || orderBy.field.isKeyField();\n }\n // Assert that we actually compared by key\n debugAssert(\n comparedOnKeyField,\n \"orderBy used that doesn't compare on key field\"\n );\n return 0;\n };\n}\n\nexport function compareDocs(\n orderBy: OrderBy,\n d1: Document,\n d2: Document\n): number {\n const comparison = orderBy.field.isKeyField()\n ? DocumentKey.comparator(d1.key, d2.key)\n : compareDocumentsByField(orderBy.field, d1, d2);\n switch (orderBy.dir) {\n case Direction.ASCENDING:\n return comparison;\n case Direction.DESCENDING:\n return -1 * comparison;\n default:\n return fail('Unknown direction: ' + orderBy.dir);\n }\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Value as ProtoValue } from '../protos/firestore_proto_api';\nimport { isNegativeZero, isSafeInteger } from '../util/types';\n\n/** Base interface for the Serializer implementation. */\nexport interface Serializer {\n readonly useProto3Json: boolean;\n}\n\n/**\n * Returns an DoubleValue for `value` that is encoded based the serializer's\n * `useProto3Json` setting.\n */\nexport function toDouble(serializer: Serializer, value: number): ProtoValue {\n if (serializer.useProto3Json) {\n if (isNaN(value)) {\n return { doubleValue: 'NaN' };\n } else if (value === Infinity) {\n return { doubleValue: 'Infinity' };\n } else if (value === -Infinity) {\n return { doubleValue: '-Infinity' };\n }\n }\n return { doubleValue: isNegativeZero(value) ? '-0' : value };\n}\n\n/**\n * Returns an IntegerValue for `value`.\n */\nexport function toInteger(value: number): ProtoValue {\n return { integerValue: '' + value };\n}\n\n/**\n * Returns a value for a number that's appropriate to put into a proto.\n * The return value is an IntegerValue if it can safely represent the value,\n * otherwise a DoubleValue is returned.\n */\nexport function toNumber(serializer: Serializer, value: number): ProtoValue {\n return isSafeInteger(value) ? toInteger(value) : toDouble(serializer, value);\n}\n","/**\n * @license\n * Copyright 2018 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Timestamp } from '../lite-api/timestamp';\nimport { Value as ProtoValue } from '../protos/firestore_proto_api';\nimport { Serializer, toDouble, toInteger } from '../remote/number_serializer';\nimport { debugAssert } from '../util/assert';\nimport { arrayEquals } from '../util/misc';\n\nimport { normalizeNumber } from './normalize';\nimport { serverTimestamp } from './server_timestamps';\nimport { isArray, isInteger, isNumber, valueEquals } from './values';\n\n/** Used to represent a field transform on a mutation. */\nexport class TransformOperation {\n // Make sure that the structural type of `TransformOperation` is unique.\n // See https://github.com/microsoft/TypeScript/issues/5451\n private _ = undefined;\n}\n\n/**\n * Computes the local transform result against the provided `previousValue`,\n * optionally using the provided localWriteTime.\n */\nexport function applyTransformOperationToLocalView(\n transform: TransformOperation,\n previousValue: ProtoValue | null,\n localWriteTime: Timestamp\n): ProtoValue {\n if (transform instanceof ServerTimestampTransform) {\n return serverTimestamp(localWriteTime, previousValue);\n } else if (transform instanceof ArrayUnionTransformOperation) {\n return applyArrayUnionTransformOperation(transform, previousValue);\n } else if (transform instanceof ArrayRemoveTransformOperation) {\n return applyArrayRemoveTransformOperation(transform, previousValue);\n } else {\n debugAssert(\n transform instanceof NumericIncrementTransformOperation,\n 'Expected NumericIncrementTransformOperation but was: ' + transform\n );\n return applyNumericIncrementTransformOperationToLocalView(\n transform,\n previousValue\n );\n }\n}\n\n/**\n * Computes a final transform result after the transform has been acknowledged\n * by the server, potentially using the server-provided transformResult.\n */\nexport function applyTransformOperationToRemoteDocument(\n transform: TransformOperation,\n previousValue: ProtoValue | null,\n transformResult: ProtoValue | null\n): ProtoValue {\n // The server just sends null as the transform result for array operations,\n // so we have to calculate a result the same as we do for local\n // applications.\n if (transform instanceof ArrayUnionTransformOperation) {\n return applyArrayUnionTransformOperation(transform, previousValue);\n } else if (transform instanceof ArrayRemoveTransformOperation) {\n return applyArrayRemoveTransformOperation(transform, previousValue);\n }\n\n debugAssert(\n transformResult !== null,\n \"Didn't receive transformResult for non-array transform\"\n );\n return transformResult;\n}\n\n/**\n * If this transform operation is not idempotent, returns the base value to\n * persist for this transform. If a base value is returned, the transform\n * operation is always applied to this base value, even if document has\n * already been updated.\n *\n * Base values provide consistent behavior for non-idempotent transforms and\n * allow us to return the same latency-compensated value even if the backend\n * has already applied the transform operation. The base value is null for\n * idempotent transforms, as they can be re-played even if the backend has\n * already applied them.\n *\n * @returns a base value to store along with the mutation, or null for\n * idempotent transforms.\n */\nexport function computeTransformOperationBaseValue(\n transform: TransformOperation,\n previousValue: ProtoValue | null\n): ProtoValue | null {\n if (transform instanceof NumericIncrementTransformOperation) {\n return isNumber(previousValue) ? previousValue! : { integerValue: 0 };\n }\n return null;\n}\n\nexport function transformOperationEquals(\n left: TransformOperation,\n right: TransformOperation\n): boolean {\n if (\n left instanceof ArrayUnionTransformOperation &&\n right instanceof ArrayUnionTransformOperation\n ) {\n return arrayEquals(left.elements, right.elements, valueEquals);\n } else if (\n left instanceof ArrayRemoveTransformOperation &&\n right instanceof ArrayRemoveTransformOperation\n ) {\n return arrayEquals(left.elements, right.elements, valueEquals);\n } else if (\n left instanceof NumericIncrementTransformOperation &&\n right instanceof NumericIncrementTransformOperation\n ) {\n return valueEquals(left.operand, right.operand);\n }\n\n return (\n left instanceof ServerTimestampTransform &&\n right instanceof ServerTimestampTransform\n );\n}\n\n/** Transforms a value into a server-generated timestamp. */\nexport class ServerTimestampTransform extends TransformOperation {}\n\n/** Transforms an array value via a union operation. */\nexport class ArrayUnionTransformOperation extends TransformOperation {\n constructor(readonly elements: ProtoValue[]) {\n super();\n }\n}\n\nfunction applyArrayUnionTransformOperation(\n transform: ArrayUnionTransformOperation,\n previousValue: ProtoValue | null\n): ProtoValue {\n const values = coercedFieldValuesArray(previousValue);\n for (const toUnion of transform.elements) {\n if (!values.some(element => valueEquals(element, toUnion))) {\n values.push(toUnion);\n }\n }\n return { arrayValue: { values } };\n}\n\n/** Transforms an array value via a remove operation. */\nexport class ArrayRemoveTransformOperation extends TransformOperation {\n constructor(readonly elements: ProtoValue[]) {\n super();\n }\n}\n\nfunction applyArrayRemoveTransformOperation(\n transform: ArrayRemoveTransformOperation,\n previousValue: ProtoValue | null\n): ProtoValue {\n let values = coercedFieldValuesArray(previousValue);\n for (const toRemove of transform.elements) {\n values = values.filter(element => !valueEquals(element, toRemove));\n }\n return { arrayValue: { values } };\n}\n\n/**\n * Implements the backend semantics for locally computed NUMERIC_ADD (increment)\n * transforms. Converts all field values to integers or doubles, but unlike the\n * backend does not cap integer values at 2^63. Instead, JavaScript number\n * arithmetic is used and precision loss can occur for values greater than 2^53.\n */\nexport class NumericIncrementTransformOperation extends TransformOperation {\n constructor(readonly serializer: Serializer, readonly operand: ProtoValue) {\n super();\n debugAssert(\n isNumber(operand),\n 'NumericIncrementTransform transform requires a NumberValue'\n );\n }\n}\n\nexport function applyNumericIncrementTransformOperationToLocalView(\n transform: NumericIncrementTransformOperation,\n previousValue: ProtoValue | null\n): ProtoValue {\n // PORTING NOTE: Since JavaScript's integer arithmetic is limited to 53 bit\n // precision and resolves overflows by reducing precision, we do not\n // manually cap overflows at 2^63.\n const baseValue = computeTransformOperationBaseValue(\n transform,\n previousValue\n )!;\n const sum = asNumber(baseValue) + asNumber(transform.operand);\n if (isInteger(baseValue) && isInteger(transform.operand)) {\n return toInteger(sum);\n } else {\n return toDouble(transform.serializer, sum);\n }\n}\n\nfunction asNumber(value: ProtoValue): number {\n return normalizeNumber(value.integerValue || value.doubleValue);\n}\n\nfunction coercedFieldValuesArray(value: ProtoValue | null): ProtoValue[] {\n return isArray(value) && value.arrayValue.values\n ? value.arrayValue.values.slice()\n : [];\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { SnapshotVersion } from '../core/snapshot_version';\nimport { Timestamp } from '../lite-api/timestamp';\nimport { Value as ProtoValue } from '../protos/firestore_proto_api';\nimport { debugAssert, hardAssert } from '../util/assert';\nimport { arrayEquals } from '../util/misc';\nimport { SortedSet } from '../util/sorted_set';\n\nimport { Document, MutableDocument } from './document';\nimport { DocumentKey } from './document_key';\nimport { FieldMask } from './field_mask';\nimport { ObjectValue } from './object_value';\nimport { FieldPath } from './path';\nimport {\n applyTransformOperationToLocalView,\n applyTransformOperationToRemoteDocument,\n computeTransformOperationBaseValue,\n TransformOperation,\n transformOperationEquals\n} from './transform_operation';\n\n/** A field path and the TransformOperation to perform upon it. */\nexport class FieldTransform {\n constructor(\n readonly field: FieldPath,\n readonly transform: TransformOperation\n ) {}\n}\n\nexport function fieldTransformEquals(\n left: FieldTransform,\n right: FieldTransform\n): boolean {\n return (\n left.field.isEqual(right.field) &&\n transformOperationEquals(left.transform, right.transform)\n );\n}\n\nexport function fieldTransformsAreEqual(\n left?: FieldTransform[],\n right?: FieldTransform[]\n): boolean {\n if (left === undefined && right === undefined) {\n return true;\n }\n\n if (left && right) {\n return arrayEquals(left, right, (l, r) => fieldTransformEquals(l, r));\n }\n\n return false;\n}\n\n/** The result of successfully applying a mutation to the backend. */\nexport class MutationResult {\n constructor(\n /**\n * The version at which the mutation was committed:\n *\n * - For most operations, this is the updateTime in the WriteResult.\n * - For deletes, the commitTime of the WriteResponse (because deletes are\n * not stored and have no updateTime).\n *\n * Note that these versions can be different: No-op writes will not change\n * the updateTime even though the commitTime advances.\n */\n readonly version: SnapshotVersion,\n /**\n * The resulting fields returned from the backend after a mutation\n * containing field transforms has been committed. Contains one FieldValue\n * for each FieldTransform that was in the mutation.\n *\n * Will be empty if the mutation did not contain any field transforms.\n */\n readonly transformResults: Array<ProtoValue | null>\n ) {}\n}\n\nexport const enum MutationType {\n Set,\n Patch,\n Delete,\n Verify\n}\n\n/**\n * Encodes a precondition for a mutation. This follows the model that the\n * backend accepts with the special case of an explicit \"empty\" precondition\n * (meaning no precondition).\n */\nexport class Precondition {\n private constructor(\n readonly updateTime?: SnapshotVersion,\n readonly exists?: boolean\n ) {\n debugAssert(\n updateTime === undefined || exists === undefined,\n 'Precondition can specify \"exists\" or \"updateTime\" but not both'\n );\n }\n\n /** Creates a new empty Precondition. */\n static none(): Precondition {\n return new Precondition();\n }\n\n /** Creates a new Precondition with an exists flag. */\n static exists(exists: boolean): Precondition {\n return new Precondition(undefined, exists);\n }\n\n /** Creates a new Precondition based on a version a document exists at. */\n static updateTime(version: SnapshotVersion): Precondition {\n return new Precondition(version);\n }\n\n /** Returns whether this Precondition is empty. */\n get isNone(): boolean {\n return this.updateTime === undefined && this.exists === undefined;\n }\n\n isEqual(other: Precondition): boolean {\n return (\n this.exists === other.exists &&\n (this.updateTime\n ? !!other.updateTime && this.updateTime.isEqual(other.updateTime)\n : !other.updateTime)\n );\n }\n}\n\n/** Returns true if the preconditions is valid for the given document. */\nexport function preconditionIsValidForDocument(\n precondition: Precondition,\n document: MutableDocument\n): boolean {\n if (precondition.updateTime !== undefined) {\n return (\n document.isFoundDocument() &&\n document.version.isEqual(precondition.updateTime)\n );\n } else if (precondition.exists !== undefined) {\n return precondition.exists === document.isFoundDocument();\n } else {\n debugAssert(precondition.isNone, 'Precondition should be empty');\n return true;\n }\n}\n\n/**\n * A mutation describes a self-contained change to a document. Mutations can\n * create, replace, delete, and update subsets of documents.\n *\n * Mutations not only act on the value of the document but also its version.\n *\n * For local mutations (mutations that haven't been committed yet), we preserve\n * the existing version for Set and Patch mutations. For Delete mutations, we\n * reset the version to 0.\n *\n * Here's the expected transition table.\n *\n * MUTATION APPLIED TO RESULTS IN\n *\n * SetMutation Document(v3) Document(v3)\n * SetMutation NoDocument(v3) Document(v0)\n * SetMutation InvalidDocument(v0) Document(v0)\n * PatchMutation Document(v3) Document(v3)\n * PatchMutation NoDocument(v3) NoDocument(v3)\n * PatchMutation InvalidDocument(v0) UnknownDocument(v3)\n * DeleteMutation Document(v3) NoDocument(v0)\n * DeleteMutation NoDocument(v3) NoDocument(v0)\n * DeleteMutation InvalidDocument(v0) NoDocument(v0)\n *\n * For acknowledged mutations, we use the updateTime of the WriteResponse as\n * the resulting version for Set and Patch mutations. As deletes have no\n * explicit update time, we use the commitTime of the WriteResponse for\n * Delete mutations.\n *\n * If a mutation is acknowledged by the backend but fails the precondition check\n * locally, we transition to an `UnknownDocument` and rely on Watch to send us\n * the updated version.\n *\n * Field transforms are used only with Patch and Set Mutations. We use the\n * `updateTransforms` message to store transforms, rather than the `transforms`s\n * messages.\n *\n * ## Subclassing Notes\n *\n * Every type of mutation needs to implement its own applyToRemoteDocument() and\n * applyToLocalView() to implement the actual behavior of applying the mutation\n * to some source document (see `setMutationApplyToRemoteDocument()` for an\n * example).\n */\nexport abstract class Mutation {\n abstract readonly type: MutationType;\n abstract readonly key: DocumentKey;\n abstract readonly precondition: Precondition;\n abstract readonly fieldTransforms: FieldTransform[];\n /**\n * Returns a `FieldMask` representing the fields that will be changed by\n * applying this mutation. Returns `null` if the mutation will overwrite the\n * entire document.\n */\n abstract getFieldMask(): FieldMask | null;\n}\n\n/**\n * A utility method to calculate a `Mutation` representing the overlay from the\n * final state of the document, and a `FieldMask` representing the fields that\n * are mutated by the local mutations.\n */\nexport function calculateOverlayMutation(\n doc: MutableDocument,\n mask: FieldMask | null\n): Mutation | null {\n if (!doc.hasLocalMutations || (mask && mask!.fields.length === 0)) {\n return null;\n }\n\n // mask is null when sets or deletes are applied to the current document.\n if (mask === null) {\n if (doc.isNoDocument()) {\n return new DeleteMutation(doc.key, Precondition.none());\n } else {\n return new SetMutation(doc.key, doc.data, Precondition.none());\n }\n } else {\n const docValue = doc.data;\n const patchValue = ObjectValue.empty();\n let maskSet = new SortedSet<FieldPath>(FieldPath.comparator);\n for (let path of mask.fields) {\n if (!maskSet.has(path)) {\n let value = docValue.field(path);\n // If we are deleting a nested field, we take the immediate parent as\n // the mask used to construct the resulting mutation.\n // Justification: Nested fields can create parent fields implicitly. If\n // only a leaf entry is deleted in later mutations, the parent field\n // should still remain, but we may have lost this information.\n // Consider mutation (foo.bar 1), then mutation (foo.bar delete()).\n // This leaves the final result (foo, {}). Despite the fact that `doc`\n // has the correct result, `foo` is not in `mask`, and the resulting\n // mutation would miss `foo`.\n if (value === null && path.length > 1) {\n path = path.popLast();\n value = docValue.field(path);\n }\n if (value === null) {\n patchValue.delete(path);\n } else {\n patchValue.set(path, value);\n }\n maskSet = maskSet.add(path);\n }\n }\n return new PatchMutation(\n doc.key,\n patchValue,\n new FieldMask(maskSet.toArray()),\n Precondition.none()\n );\n }\n}\n\n/**\n * Applies this mutation to the given document for the purposes of computing a\n * new remote document. If the input document doesn't match the expected state\n * (e.g. it is invalid or outdated), the document type may transition to\n * unknown.\n *\n * @param mutation - The mutation to apply.\n * @param document - The document to mutate. The input document can be an\n * invalid document if the client has no knowledge of the pre-mutation state\n * of the document.\n * @param mutationResult - The result of applying the mutation from the backend.\n */\nexport function mutationApplyToRemoteDocument(\n mutation: Mutation,\n document: MutableDocument,\n mutationResult: MutationResult\n): void {\n mutationVerifyKeyMatches(mutation, document);\n if (mutation instanceof SetMutation) {\n setMutationApplyToRemoteDocument(mutation, document, mutationResult);\n } else if (mutation instanceof PatchMutation) {\n patchMutationApplyToRemoteDocument(mutation, document, mutationResult);\n } else {\n debugAssert(\n mutation instanceof DeleteMutation,\n 'Unexpected mutation type: ' + mutation\n );\n deleteMutationApplyToRemoteDocument(mutation, document, mutationResult);\n }\n}\n\n/**\n * Applies this mutation to the given document for the purposes of computing\n * the new local view of a document. If the input document doesn't match the\n * expected state, the document is not modified.\n *\n * @param mutation - The mutation to apply.\n * @param document - The document to mutate. The input document can be an\n * invalid document if the client has no knowledge of the pre-mutation state\n * of the document.\n * @param previousMask - The fields that have been updated before applying this mutation.\n * @param localWriteTime - A timestamp indicating the local write time of the\n * batch this mutation is a part of.\n * @returns A `FieldMask` representing the fields that are changed by applying this mutation.\n */\nexport function mutationApplyToLocalView(\n mutation: Mutation,\n document: MutableDocument,\n previousMask: FieldMask | null,\n localWriteTime: Timestamp\n): FieldMask | null {\n mutationVerifyKeyMatches(mutation, document);\n\n if (mutation instanceof SetMutation) {\n return setMutationApplyToLocalView(\n mutation,\n document,\n previousMask,\n localWriteTime\n );\n } else if (mutation instanceof PatchMutation) {\n return patchMutationApplyToLocalView(\n mutation,\n document,\n previousMask,\n localWriteTime\n );\n } else {\n debugAssert(\n mutation instanceof DeleteMutation,\n 'Unexpected mutation type: ' + mutation\n );\n return deleteMutationApplyToLocalView(mutation, document, previousMask);\n }\n}\n\n/**\n * If this mutation is not idempotent, returns the base value to persist with\n * this mutation. If a base value is returned, the mutation is always applied\n * to this base value, even if document has already been updated.\n *\n * The base value is a sparse object that consists of only the document\n * fields for which this mutation contains a non-idempotent transformation\n * (e.g. a numeric increment). The provided value guarantees consistent\n * behavior for non-idempotent transforms and allow us to return the same\n * latency-compensated value even if the backend has already applied the\n * mutation. The base value is null for idempotent mutations, as they can be\n * re-played even if the backend has already applied them.\n *\n * @returns a base value to store along with the mutation, or null for\n * idempotent mutations.\n */\nexport function mutationExtractBaseValue(\n mutation: Mutation,\n document: Document\n): ObjectValue | null {\n let baseObject: ObjectValue | null = null;\n for (const fieldTransform of mutation.fieldTransforms) {\n const existingValue = document.data.field(fieldTransform.field);\n const coercedValue = computeTransformOperationBaseValue(\n fieldTransform.transform,\n existingValue || null\n );\n\n if (coercedValue != null) {\n if (baseObject === null) {\n baseObject = ObjectValue.empty();\n }\n baseObject.set(fieldTransform.field, coercedValue);\n }\n }\n return baseObject ? baseObject : null;\n}\n\nexport function mutationEquals(left: Mutation, right: Mutation): boolean {\n if (left.type !== right.type) {\n return false;\n }\n\n if (!left.key.isEqual(right.key)) {\n return false;\n }\n\n if (!left.precondition.isEqual(right.precondition)) {\n return false;\n }\n\n if (!fieldTransformsAreEqual(left.fieldTransforms, right.fieldTransforms)) {\n return false;\n }\n\n if (left.type === MutationType.Set) {\n return (left as SetMutation).value.isEqual((right as SetMutation).value);\n }\n\n if (left.type === MutationType.Patch) {\n return (\n (left as PatchMutation).data.isEqual((right as PatchMutation).data) &&\n (left as PatchMutation).fieldMask.isEqual(\n (right as PatchMutation).fieldMask\n )\n );\n }\n\n return true;\n}\n\nfunction mutationVerifyKeyMatches(\n mutation: Mutation,\n document: MutableDocument\n): void {\n debugAssert(\n document.key.isEqual(mutation.key),\n 'Can only apply a mutation to a document with the same key'\n );\n}\n\n/**\n * A mutation that creates or replaces the document at the given key with the\n * object value contents.\n */\nexport class SetMutation extends Mutation {\n constructor(\n readonly key: DocumentKey,\n readonly value: ObjectValue,\n readonly precondition: Precondition,\n readonly fieldTransforms: FieldTransform[] = []\n ) {\n super();\n }\n\n readonly type: MutationType = MutationType.Set;\n\n getFieldMask(): FieldMask | null {\n return null;\n }\n}\n\nfunction setMutationApplyToRemoteDocument(\n mutation: SetMutation,\n document: MutableDocument,\n mutationResult: MutationResult\n): void {\n // Unlike setMutationApplyToLocalView, if we're applying a mutation to a\n // remote document the server has accepted the mutation so the precondition\n // must have held.\n const newData = mutation.value.clone();\n const transformResults = serverTransformResults(\n mutation.fieldTransforms,\n document,\n mutationResult.transformResults\n );\n newData.setAll(transformResults);\n document\n .convertToFoundDocument(mutationResult.version, newData)\n .setHasCommittedMutations();\n}\n\nfunction setMutationApplyToLocalView(\n mutation: SetMutation,\n document: MutableDocument,\n previousMask: FieldMask | null,\n localWriteTime: Timestamp\n): FieldMask | null {\n if (!preconditionIsValidForDocument(mutation.precondition, document)) {\n // The mutation failed to apply (e.g. a document ID created with add()\n // caused a name collision).\n return previousMask;\n }\n\n const newData = mutation.value.clone();\n const transformResults = localTransformResults(\n mutation.fieldTransforms,\n localWriteTime,\n document\n );\n newData.setAll(transformResults);\n document\n .convertToFoundDocument(document.version, newData)\n .setHasLocalMutations();\n return null; // SetMutation overwrites all fields.\n}\n\n/**\n * A mutation that modifies fields of the document at the given key with the\n * given values. The values are applied through a field mask:\n *\n * * When a field is in both the mask and the values, the corresponding field\n * is updated.\n * * When a field is in neither the mask nor the values, the corresponding\n * field is unmodified.\n * * When a field is in the mask but not in the values, the corresponding field\n * is deleted.\n * * When a field is not in the mask but is in the values, the values map is\n * ignored.\n */\nexport class PatchMutation extends Mutation {\n constructor(\n readonly key: DocumentKey,\n readonly data: ObjectValue,\n readonly fieldMask: FieldMask,\n readonly precondition: Precondition,\n readonly fieldTransforms: FieldTransform[] = []\n ) {\n super();\n }\n\n readonly type: MutationType = MutationType.Patch;\n\n getFieldMask(): FieldMask | null {\n return this.fieldMask;\n }\n}\n\nfunction patchMutationApplyToRemoteDocument(\n mutation: PatchMutation,\n document: MutableDocument,\n mutationResult: MutationResult\n): void {\n if (!preconditionIsValidForDocument(mutation.precondition, document)) {\n // Since the mutation was not rejected, we know that the precondition\n // matched on the backend. We therefore must not have the expected version\n // of the document in our cache and convert to an UnknownDocument with a\n // known updateTime.\n document.convertToUnknownDocument(mutationResult.version);\n return;\n }\n\n const transformResults = serverTransformResults(\n mutation.fieldTransforms,\n document,\n mutationResult.transformResults\n );\n const newData = document.data;\n newData.setAll(getPatch(mutation));\n newData.setAll(transformResults);\n document\n .convertToFoundDocument(mutationResult.version, newData)\n .setHasCommittedMutations();\n}\n\nfunction patchMutationApplyToLocalView(\n mutation: PatchMutation,\n document: MutableDocument,\n previousMask: FieldMask | null,\n localWriteTime: Timestamp\n): FieldMask | null {\n if (!preconditionIsValidForDocument(mutation.precondition, document)) {\n return previousMask;\n }\n\n const transformResults = localTransformResults(\n mutation.fieldTransforms,\n localWriteTime,\n document\n );\n const newData = document.data;\n newData.setAll(getPatch(mutation));\n newData.setAll(transformResults);\n document\n .convertToFoundDocument(document.version, newData)\n .setHasLocalMutations();\n\n if (previousMask === null) {\n return null;\n }\n\n return previousMask\n .unionWith(mutation.fieldMask.fields)\n .unionWith(mutation.fieldTransforms.map(transform => transform.field));\n}\n\n/**\n * Returns a FieldPath/Value map with the content of the PatchMutation.\n */\nfunction getPatch(mutation: PatchMutation): Map<FieldPath, ProtoValue | null> {\n const result = new Map<FieldPath, ProtoValue | null>();\n mutation.fieldMask.fields.forEach(fieldPath => {\n if (!fieldPath.isEmpty()) {\n const newValue = mutation.data.field(fieldPath);\n result.set(fieldPath, newValue);\n }\n });\n return result;\n}\n\n/**\n * Creates a list of \"transform results\" (a transform result is a field value\n * representing the result of applying a transform) for use after a mutation\n * containing transforms has been acknowledged by the server.\n *\n * @param fieldTransforms - The field transforms to apply the result to.\n * @param mutableDocument - The current state of the document after applying all\n * previous mutations.\n * @param serverTransformResults - The transform results received by the server.\n * @returns The transform results list.\n */\nfunction serverTransformResults(\n fieldTransforms: FieldTransform[],\n mutableDocument: MutableDocument,\n serverTransformResults: Array<ProtoValue | null>\n): Map<FieldPath, ProtoValue> {\n const transformResults = new Map<FieldPath, ProtoValue>();\n hardAssert(\n fieldTransforms.length === serverTransformResults.length,\n `server transform result count (${serverTransformResults.length}) ` +\n `should match field transform count (${fieldTransforms.length})`\n );\n\n for (let i = 0; i < serverTransformResults.length; i++) {\n const fieldTransform = fieldTransforms[i];\n const transform = fieldTransform.transform;\n const previousValue = mutableDocument.data.field(fieldTransform.field);\n transformResults.set(\n fieldTransform.field,\n applyTransformOperationToRemoteDocument(\n transform,\n previousValue,\n serverTransformResults[i]\n )\n );\n }\n return transformResults;\n}\n\n/**\n * Creates a list of \"transform results\" (a transform result is a field value\n * representing the result of applying a transform) for use when applying a\n * transform locally.\n *\n * @param fieldTransforms - The field transforms to apply the result to.\n * @param localWriteTime - The local time of the mutation (used to\n * generate ServerTimestampValues).\n * @param mutableDocument - The document to apply transforms on.\n * @returns The transform results list.\n */\nfunction localTransformResults(\n fieldTransforms: FieldTransform[],\n localWriteTime: Timestamp,\n mutableDocument: MutableDocument\n): Map<FieldPath, ProtoValue> {\n const transformResults = new Map<FieldPath, ProtoValue>();\n for (const fieldTransform of fieldTransforms) {\n const transform = fieldTransform.transform;\n\n const previousValue = mutableDocument.data.field(fieldTransform.field);\n transformResults.set(\n fieldTransform.field,\n applyTransformOperationToLocalView(\n transform,\n previousValue,\n localWriteTime\n )\n );\n }\n return transformResults;\n}\n\n/** A mutation that deletes the document at the given key. */\nexport class DeleteMutation extends Mutation {\n constructor(readonly key: DocumentKey, readonly precondition: Precondition) {\n super();\n }\n\n readonly type: MutationType = MutationType.Delete;\n readonly fieldTransforms: FieldTransform[] = [];\n\n getFieldMask(): FieldMask | null {\n return null;\n }\n}\n\nfunction deleteMutationApplyToRemoteDocument(\n mutation: DeleteMutation,\n document: MutableDocument,\n mutationResult: MutationResult\n): void {\n debugAssert(\n mutationResult.transformResults.length === 0,\n 'Transform results received by DeleteMutation.'\n );\n\n // Unlike applyToLocalView, if we're applying a mutation to a remote\n // document the server has accepted the mutation so the precondition must\n // have held.\n document\n .convertToNoDocument(mutationResult.version)\n .setHasCommittedMutations();\n}\n\nfunction deleteMutationApplyToLocalView(\n mutation: DeleteMutation,\n document: MutableDocument,\n previousMask: FieldMask | null\n): FieldMask | null {\n debugAssert(\n document.key.isEqual(mutation.key),\n 'Can only apply mutation to document with same key'\n );\n if (preconditionIsValidForDocument(mutation.precondition, document)) {\n document.convertToNoDocument(document.version).setHasLocalMutations();\n return null;\n }\n return previousMask;\n}\n\n/**\n * A mutation that verifies the existence of the document at the given key with\n * the provided precondition.\n *\n * The `verify` operation is only used in Transactions, and this class serves\n * primarily to facilitate serialization into protos.\n */\nexport class VerifyMutation extends Mutation {\n constructor(readonly key: DocumentKey, readonly precondition: Precondition) {\n super();\n }\n\n readonly type: MutationType = MutationType.Verify;\n readonly fieldTransforms: FieldTransform[] = [];\n\n getFieldMask(): FieldMask | null {\n return null;\n }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Bound } from '../core/bound';\nimport { DatabaseId } from '../core/database_info';\nimport {\n CompositeFilter,\n compositeFilterIsFlatConjunction,\n CompositeOperator,\n FieldFilter,\n Filter,\n Operator\n} from '../core/filter';\nimport { Direction, OrderBy } from '../core/order_by';\nimport {\n LimitType,\n newQuery,\n newQueryForPath,\n Query,\n queryToTarget\n} from '../core/query';\nimport { SnapshotVersion } from '../core/snapshot_version';\nimport { targetIsDocumentTarget, Target } from '../core/target';\nimport { TargetId } from '../core/types';\nimport { Timestamp } from '../lite-api/timestamp';\nimport { TargetData, TargetPurpose } from '../local/target_data';\nimport { MutableDocument } from '../model/document';\nimport { DocumentKey } from '../model/document_key';\nimport { FieldMask } from '../model/field_mask';\nimport {\n DeleteMutation,\n FieldTransform,\n Mutation,\n MutationResult,\n PatchMutation,\n Precondition,\n SetMutation,\n VerifyMutation\n} from '../model/mutation';\nimport { normalizeTimestamp } from '../model/normalize';\nimport { ObjectValue } from '../model/object_value';\nimport { FieldPath, ResourcePath } from '../model/path';\nimport {\n ArrayRemoveTransformOperation,\n ArrayUnionTransformOperation,\n NumericIncrementTransformOperation,\n ServerTimestampTransform,\n TransformOperation\n} from '../model/transform_operation';\nimport { isNanValue, isNullValue } from '../model/values';\nimport {\n ApiClientObjectMap as ProtoApiClientObjectMap,\n BatchGetDocumentsResponse as ProtoBatchGetDocumentsResponse,\n CompositeFilterOp as ProtoCompositeFilterOp,\n Cursor as ProtoCursor,\n Document as ProtoDocument,\n DocumentMask as ProtoDocumentMask,\n DocumentsTarget as ProtoDocumentsTarget,\n FieldFilterOp as ProtoFieldFilterOp,\n FieldReference as ProtoFieldReference,\n FieldTransform as ProtoFieldTransform,\n Filter as ProtoFilter,\n ListenResponse as ProtoListenResponse,\n Order as ProtoOrder,\n OrderDirection as ProtoOrderDirection,\n Precondition as ProtoPrecondition,\n QueryTarget as ProtoQueryTarget,\n RunAggregationQueryRequest as ProtoRunAggregationQueryRequest,\n Status as ProtoStatus,\n Target as ProtoTarget,\n TargetChangeTargetChangeType as ProtoTargetChangeTargetChangeType,\n Timestamp as ProtoTimestamp,\n Write as ProtoWrite,\n WriteResult as ProtoWriteResult\n} from '../protos/firestore_proto_api';\nimport { debugAssert, fail, hardAssert } from '../util/assert';\nimport { ByteString } from '../util/byte_string';\nimport { Code, FirestoreError } from '../util/error';\nimport { isNullOrUndefined } from '../util/types';\n\nimport { ExistenceFilter } from './existence_filter';\nimport { Serializer } from './number_serializer';\nimport { mapCodeFromRpcCode } from './rpc_error';\nimport {\n DocumentWatchChange,\n ExistenceFilterChange,\n WatchChange,\n WatchTargetChange,\n WatchTargetChangeState\n} from './watch_change';\n\nconst DIRECTIONS = (() => {\n const dirs: { [dir: string]: ProtoOrderDirection } = {};\n dirs[Direction.ASCENDING] = 'ASCENDING';\n dirs[Direction.DESCENDING] = 'DESCENDING';\n return dirs;\n})();\n\nconst OPERATORS = (() => {\n const ops: { [op: string]: ProtoFieldFilterOp } = {};\n ops[Operator.LESS_THAN] = 'LESS_THAN';\n ops[Operator.LESS_THAN_OR_EQUAL] = 'LESS_THAN_OR_EQUAL';\n ops[Operator.GREATER_THAN] = 'GREATER_THAN';\n ops[Operator.GREATER_THAN_OR_EQUAL] = 'GREATER_THAN_OR_EQUAL';\n ops[Operator.EQUAL] = 'EQUAL';\n ops[Operator.NOT_EQUAL] = 'NOT_EQUAL';\n ops[Operator.ARRAY_CONTAINS] = 'ARRAY_CONTAINS';\n ops[Operator.IN] = 'IN';\n ops[Operator.NOT_IN] = 'NOT_IN';\n ops[Operator.ARRAY_CONTAINS_ANY] = 'ARRAY_CONTAINS_ANY';\n return ops;\n})();\n\nconst COMPOSITE_OPERATORS = (() => {\n const ops: { [op: string]: ProtoCompositeFilterOp } = {};\n ops[CompositeOperator.AND] = 'AND';\n ops[CompositeOperator.OR] = 'OR';\n return ops;\n})();\n\nfunction assertPresent(value: unknown, description: string): asserts value {\n debugAssert(!isNullOrUndefined(value), description + ' is missing');\n}\n\n/**\n * This class generates JsonObject values for the Datastore API suitable for\n * sending to either GRPC stub methods or via the JSON/HTTP REST API.\n *\n * The serializer supports both Protobuf.js and Proto3 JSON formats. By\n * setting `useProto3Json` to true, the serializer will use the Proto3 JSON\n * format.\n *\n * For a description of the Proto3 JSON format check\n * https://developers.google.com/protocol-buffers/docs/proto3#json\n *\n * TODO(klimt): We can remove the databaseId argument if we keep the full\n * resource name in documents.\n */\nexport class JsonProtoSerializer implements Serializer {\n constructor(\n readonly databaseId: DatabaseId,\n readonly useProto3Json: boolean\n ) {}\n}\n\nfunction fromRpcStatus(status: ProtoStatus): FirestoreError {\n const code =\n status.code === undefined ? Code.UNKNOWN : mapCodeFromRpcCode(status.code);\n return new FirestoreError(code, status.message || '');\n}\n\n/**\n * Returns a value for a number (or null) that's appropriate to put into\n * a google.protobuf.Int32Value proto.\n * DO NOT USE THIS FOR ANYTHING ELSE.\n * This method cheats. It's typed as returning \"number\" because that's what\n * our generated proto interfaces say Int32Value must be. But GRPC actually\n * expects a { value: <number> } struct.\n */\nfunction toInt32Proto(\n serializer: JsonProtoSerializer,\n val: number | null\n): number | { value: number } | null {\n if (serializer.useProto3Json || isNullOrUndefined(val)) {\n return val;\n } else {\n return { value: val };\n }\n}\n\n/**\n * Returns a number (or null) from a google.protobuf.Int32Value proto.\n */\nfunction fromInt32Proto(\n val: number | { value: number } | undefined\n): number | null {\n let result;\n if (typeof val === 'object') {\n result = val.value;\n } else {\n result = val;\n }\n return isNullOrUndefined(result) ? null : result;\n}\n\n/**\n * Returns a value for a Date that's appropriate to put into a proto.\n */\nexport function toTimestamp(\n serializer: JsonProtoSerializer,\n timestamp: Timestamp\n): ProtoTimestamp {\n if (serializer.useProto3Json) {\n // Serialize to ISO-8601 date format, but with full nano resolution.\n // Since JS Date has only millis, let's only use it for the seconds and\n // then manually add the fractions to the end.\n const jsDateStr = new Date(timestamp.seconds * 1000).toISOString();\n // Remove .xxx frac part and Z in the end.\n const strUntilSeconds = jsDateStr.replace(/\\.\\d*/, '').replace('Z', '');\n // Pad the fraction out to 9 digits (nanos).\n const nanoStr = ('000000000' + timestamp.nanoseconds).slice(-9);\n\n return `${strUntilSeconds}.${nanoStr}Z`;\n } else {\n return {\n seconds: '' + timestamp.seconds,\n nanos: timestamp.nanoseconds\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n } as any;\n }\n}\n\nfunction fromTimestamp(date: ProtoTimestamp): Timestamp {\n const timestamp = normalizeTimestamp(date);\n return new Timestamp(timestamp.seconds, timestamp.nanos);\n}\n\n/**\n * Returns a value for bytes that's appropriate to put in a proto.\n *\n * Visible for testing.\n */\nexport function toBytes(\n serializer: JsonProtoSerializer,\n bytes: ByteString\n): string | Uint8Array {\n if (serializer.useProto3Json) {\n return bytes.toBase64();\n } else {\n return bytes.toUint8Array();\n }\n}\n\n/**\n * Returns a ByteString based on the proto string value.\n */\nexport function fromBytes(\n serializer: JsonProtoSerializer,\n value: string | Uint8Array | undefined\n): ByteString {\n if (serializer.useProto3Json) {\n hardAssert(\n value === undefined || typeof value === 'string',\n 'value must be undefined or a string when using proto3 Json'\n );\n return ByteString.fromBase64String(value ? value : '');\n } else {\n hardAssert(\n value === undefined || value instanceof Uint8Array,\n 'value must be undefined or Uint8Array'\n );\n return ByteString.fromUint8Array(value ? value : new Uint8Array());\n }\n}\n\nexport function toVersion(\n serializer: JsonProtoSerializer,\n version: SnapshotVersion\n): ProtoTimestamp {\n return toTimestamp(serializer, version.toTimestamp());\n}\n\nexport function fromVersion(version: ProtoTimestamp): SnapshotVersion {\n hardAssert(!!version, \"Trying to deserialize version that isn't set\");\n return SnapshotVersion.fromTimestamp(fromTimestamp(version));\n}\n\nexport function toResourceName(\n databaseId: DatabaseId,\n path: ResourcePath\n): string {\n return fullyQualifiedPrefixPath(databaseId)\n .child('documents')\n .child(path)\n .canonicalString();\n}\n\nfunction fromResourceName(name: string): ResourcePath {\n const resource = ResourcePath.fromString(name);\n hardAssert(\n isValidResourceName(resource),\n 'Tried to deserialize invalid key ' + resource.toString()\n );\n return resource;\n}\n\nexport function toName(\n serializer: JsonProtoSerializer,\n key: DocumentKey\n): string {\n return toResourceName(serializer.databaseId, key.path);\n}\n\nexport function fromName(\n serializer: JsonProtoSerializer,\n name: string\n): DocumentKey {\n const resource = fromResourceName(name);\n\n if (resource.get(1) !== serializer.databaseId.projectId) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n 'Tried to deserialize key from different project: ' +\n resource.get(1) +\n ' vs ' +\n serializer.databaseId.projectId\n );\n }\n\n if (resource.get(3) !== serializer.databaseId.database) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n 'Tried to deserialize key from different database: ' +\n resource.get(3) +\n ' vs ' +\n serializer.databaseId.database\n );\n }\n return new DocumentKey(extractLocalPathFromResourceName(resource));\n}\n\nfunction toQueryPath(\n serializer: JsonProtoSerializer,\n path: ResourcePath\n): string {\n return toResourceName(serializer.databaseId, path);\n}\n\nfunction fromQueryPath(name: string): ResourcePath {\n const resourceName = fromResourceName(name);\n // In v1beta1 queries for collections at the root did not have a trailing\n // \"/documents\". In v1 all resource paths contain \"/documents\". Preserve the\n // ability to read the v1beta1 form for compatibility with queries persisted\n // in the local target cache.\n if (resourceName.length === 4) {\n return ResourcePath.emptyPath();\n }\n return extractLocalPathFromResourceName(resourceName);\n}\n\nexport function getEncodedDatabaseId(serializer: JsonProtoSerializer): string {\n const path = new ResourcePath([\n 'projects',\n serializer.databaseId.projectId,\n 'databases',\n serializer.databaseId.database\n ]);\n return path.canonicalString();\n}\n\nfunction fullyQualifiedPrefixPath(databaseId: DatabaseId): ResourcePath {\n return new ResourcePath([\n 'projects',\n databaseId.projectId,\n 'databases',\n databaseId.database\n ]);\n}\n\nfunction extractLocalPathFromResourceName(\n resourceName: ResourcePath\n): ResourcePath {\n hardAssert(\n resourceName.length > 4 && resourceName.get(4) === 'documents',\n 'tried to deserialize invalid key ' + resourceName.toString()\n );\n return resourceName.popFirst(5);\n}\n\n/** Creates a Document proto from key and fields (but no create/update time) */\nexport function toMutationDocument(\n serializer: JsonProtoSerializer,\n key: DocumentKey,\n fields: ObjectValue\n): ProtoDocument {\n return {\n name: toName(serializer, key),\n fields: fields.value.mapValue.fields\n };\n}\n\nexport function toDocument(\n serializer: JsonProtoSerializer,\n document: MutableDocument\n): ProtoDocument {\n debugAssert(\n !document.hasLocalMutations,\n \"Can't serialize documents with mutations.\"\n );\n return {\n name: toName(serializer, document.key),\n fields: document.data.value.mapValue.fields,\n updateTime: toTimestamp(serializer, document.version.toTimestamp()),\n createTime: toTimestamp(serializer, document.createTime.toTimestamp())\n };\n}\n\nexport function fromDocument(\n serializer: JsonProtoSerializer,\n document: ProtoDocument,\n hasCommittedMutations?: boolean\n): MutableDocument {\n const key = fromName(serializer, document.name!);\n const version = fromVersion(document.updateTime!);\n // If we read a document from persistence that is missing createTime, it's due\n // to older SDK versions not storing this information. In such cases, we'll\n // set the createTime to zero. This can be removed in the long term.\n const createTime = document.createTime\n ? fromVersion(document.createTime)\n : SnapshotVersion.min();\n const data = new ObjectValue({ mapValue: { fields: document.fields } });\n const result = MutableDocument.newFoundDocument(\n key,\n version,\n createTime,\n data\n );\n if (hasCommittedMutations) {\n result.setHasCommittedMutations();\n }\n return hasCommittedMutations ? result.setHasCommittedMutations() : result;\n}\n\nfunction fromFound(\n serializer: JsonProtoSerializer,\n doc: ProtoBatchGetDocumentsResponse\n): MutableDocument {\n hardAssert(\n !!doc.found,\n 'Tried to deserialize a found document from a missing document.'\n );\n assertPresent(doc.found.name, 'doc.found.name');\n assertPresent(doc.found.updateTime, 'doc.found.updateTime');\n const key = fromName(serializer, doc.found.name);\n const version = fromVersion(doc.found.updateTime);\n const createTime = doc.found.createTime\n ? fromVersion(doc.found.createTime)\n : SnapshotVersion.min();\n const data = new ObjectValue({ mapValue: { fields: doc.found.fields } });\n return MutableDocument.newFoundDocument(key, version, createTime, data);\n}\n\nfunction fromMissing(\n serializer: JsonProtoSerializer,\n result: ProtoBatchGetDocumentsResponse\n): MutableDocument {\n hardAssert(\n !!result.missing,\n 'Tried to deserialize a missing document from a found document.'\n );\n hardAssert(\n !!result.readTime,\n 'Tried to deserialize a missing document without a read time.'\n );\n const key = fromName(serializer, result.missing);\n const version = fromVersion(result.readTime);\n return MutableDocument.newNoDocument(key, version);\n}\n\nexport function fromBatchGetDocumentsResponse(\n serializer: JsonProtoSerializer,\n result: ProtoBatchGetDocumentsResponse\n): MutableDocument {\n if ('found' in result) {\n return fromFound(serializer, result);\n } else if ('missing' in result) {\n return fromMissing(serializer, result);\n }\n return fail('invalid batch get response: ' + JSON.stringify(result));\n}\n\nexport function fromWatchChange(\n serializer: JsonProtoSerializer,\n change: ProtoListenResponse\n): WatchChange {\n let watchChange: WatchChange;\n if ('targetChange' in change) {\n assertPresent(change.targetChange, 'targetChange');\n // proto3 default value is unset in JSON (undefined), so use 'NO_CHANGE'\n // if unset\n const state = fromWatchTargetChangeState(\n change.targetChange.targetChangeType || 'NO_CHANGE'\n );\n const targetIds: TargetId[] = change.targetChange.targetIds || [];\n\n const resumeToken = fromBytes(serializer, change.targetChange.resumeToken);\n const causeProto = change.targetChange!.cause;\n const cause = causeProto && fromRpcStatus(causeProto);\n watchChange = new WatchTargetChange(\n state,\n targetIds,\n resumeToken,\n cause || null\n );\n } else if ('documentChange' in change) {\n assertPresent(change.documentChange, 'documentChange');\n const entityChange = change.documentChange;\n assertPresent(entityChange.document, 'documentChange.name');\n assertPresent(entityChange.document.name, 'documentChange.document.name');\n assertPresent(\n entityChange.document.updateTime,\n 'documentChange.document.updateTime'\n );\n const key = fromName(serializer, entityChange.document.name);\n const version = fromVersion(entityChange.document.updateTime);\n const createTime = entityChange.document.createTime\n ? fromVersion(entityChange.document.createTime)\n : SnapshotVersion.min();\n const data = new ObjectValue({\n mapValue: { fields: entityChange.document.fields }\n });\n const doc = MutableDocument.newFoundDocument(\n key,\n version,\n createTime,\n data\n );\n const updatedTargetIds = entityChange.targetIds || [];\n const removedTargetIds = entityChange.removedTargetIds || [];\n watchChange = new DocumentWatchChange(\n updatedTargetIds,\n removedTargetIds,\n doc.key,\n doc\n );\n } else if ('documentDelete' in change) {\n assertPresent(change.documentDelete, 'documentDelete');\n const docDelete = change.documentDelete;\n assertPresent(docDelete.document, 'documentDelete.document');\n const key = fromName(serializer, docDelete.document);\n const version = docDelete.readTime\n ? fromVersion(docDelete.readTime)\n : SnapshotVersion.min();\n const doc = MutableDocument.newNoDocument(key, version);\n const removedTargetIds = docDelete.removedTargetIds || [];\n watchChange = new DocumentWatchChange([], removedTargetIds, doc.key, doc);\n } else if ('documentRemove' in change) {\n assertPresent(change.documentRemove, 'documentRemove');\n const docRemove = change.documentRemove;\n assertPresent(docRemove.document, 'documentRemove');\n const key = fromName(serializer, docRemove.document);\n const removedTargetIds = docRemove.removedTargetIds || [];\n watchChange = new DocumentWatchChange([], removedTargetIds, key, null);\n } else if ('filter' in change) {\n // TODO(dimond): implement existence filter parsing with strategy.\n assertPresent(change.filter, 'filter');\n const filter = change.filter;\n assertPresent(filter.targetId, 'filter.targetId');\n const count = filter.count || 0;\n const existenceFilter = new ExistenceFilter(count);\n const targetId = filter.targetId;\n watchChange = new ExistenceFilterChange(targetId, existenceFilter);\n } else {\n return fail('Unknown change type ' + JSON.stringify(change));\n }\n return watchChange;\n}\n\nfunction fromWatchTargetChangeState(\n state: ProtoTargetChangeTargetChangeType\n): WatchTargetChangeState {\n if (state === 'NO_CHANGE') {\n return WatchTargetChangeState.NoChange;\n } else if (state === 'ADD') {\n return WatchTargetChangeState.Added;\n } else if (state === 'REMOVE') {\n return WatchTargetChangeState.Removed;\n } else if (state === 'CURRENT') {\n return WatchTargetChangeState.Current;\n } else if (state === 'RESET') {\n return WatchTargetChangeState.Reset;\n } else {\n return fail('Got unexpected TargetChange.state: ' + state);\n }\n}\n\nexport function versionFromListenResponse(\n change: ProtoListenResponse\n): SnapshotVersion {\n // We have only reached a consistent snapshot for the entire stream if there\n // is a read_time set and it applies to all targets (i.e. the list of\n // targets is empty). The backend is guaranteed to send such responses.\n if (!('targetChange' in change)) {\n return SnapshotVersion.min();\n }\n const targetChange = change.targetChange!;\n if (targetChange.targetIds && targetChange.targetIds.length) {\n return SnapshotVersion.min();\n }\n if (!targetChange.readTime) {\n return SnapshotVersion.min();\n }\n return fromVersion(targetChange.readTime);\n}\n\nexport function toMutation(\n serializer: JsonProtoSerializer,\n mutation: Mutation\n): ProtoWrite {\n let result: ProtoWrite;\n if (mutation instanceof SetMutation) {\n result = {\n update: toMutationDocument(serializer, mutation.key, mutation.value)\n };\n } else if (mutation instanceof DeleteMutation) {\n result = { delete: toName(serializer, mutation.key) };\n } else if (mutation instanceof PatchMutation) {\n result = {\n update: toMutationDocument(serializer, mutation.key, mutation.data),\n updateMask: toDocumentMask(mutation.fieldMask)\n };\n } else if (mutation instanceof VerifyMutation) {\n result = {\n verify: toName(serializer, mutation.key)\n };\n } else {\n return fail('Unknown mutation type ' + mutation.type);\n }\n\n if (mutation.fieldTransforms.length > 0) {\n result.updateTransforms = mutation.fieldTransforms.map(transform =>\n toFieldTransform(serializer, transform)\n );\n }\n\n if (!mutation.precondition.isNone) {\n result.currentDocument = toPrecondition(serializer, mutation.precondition);\n }\n\n return result;\n}\n\nexport function fromMutation(\n serializer: JsonProtoSerializer,\n proto: ProtoWrite\n): Mutation {\n const precondition = proto.currentDocument\n ? fromPrecondition(proto.currentDocument)\n : Precondition.none();\n\n const fieldTransforms = proto.updateTransforms\n ? proto.updateTransforms.map(transform =>\n fromFieldTransform(serializer, transform)\n )\n : [];\n\n if (proto.update) {\n assertPresent(proto.update.name, 'name');\n const key = fromName(serializer, proto.update.name);\n const value = new ObjectValue({\n mapValue: { fields: proto.update.fields }\n });\n\n if (proto.updateMask) {\n const fieldMask = fromDocumentMask(proto.updateMask);\n return new PatchMutation(\n key,\n value,\n fieldMask,\n precondition,\n fieldTransforms\n );\n } else {\n return new SetMutation(key, value, precondition, fieldTransforms);\n }\n } else if (proto.delete) {\n const key = fromName(serializer, proto.delete);\n return new DeleteMutation(key, precondition);\n } else if (proto.verify) {\n const key = fromName(serializer, proto.verify);\n return new VerifyMutation(key, precondition);\n } else {\n return fail('unknown mutation proto: ' + JSON.stringify(proto));\n }\n}\n\nfunction toPrecondition(\n serializer: JsonProtoSerializer,\n precondition: Precondition\n): ProtoPrecondition {\n debugAssert(!precondition.isNone, \"Can't serialize an empty precondition\");\n if (precondition.updateTime !== undefined) {\n return {\n updateTime: toVersion(serializer, precondition.updateTime)\n };\n } else if (precondition.exists !== undefined) {\n return { exists: precondition.exists };\n } else {\n return fail('Unknown precondition');\n }\n}\n\nfunction fromPrecondition(precondition: ProtoPrecondition): Precondition {\n if (precondition.updateTime !== undefined) {\n return Precondition.updateTime(fromVersion(precondition.updateTime));\n } else if (precondition.exists !== undefined) {\n return Precondition.exists(precondition.exists);\n } else {\n return Precondition.none();\n }\n}\n\nfunction fromWriteResult(\n proto: ProtoWriteResult,\n commitTime: ProtoTimestamp\n): MutationResult {\n // NOTE: Deletes don't have an updateTime.\n let version = proto.updateTime\n ? fromVersion(proto.updateTime)\n : fromVersion(commitTime);\n\n if (version.isEqual(SnapshotVersion.min())) {\n // The Firestore Emulator currently returns an update time of 0 for\n // deletes of non-existing documents (rather than null). This breaks the\n // test \"get deleted doc while offline with source=cache\" as NoDocuments\n // with version 0 are filtered by IndexedDb's RemoteDocumentCache.\n // TODO(#2149): Remove this when Emulator is fixed\n version = fromVersion(commitTime);\n }\n\n return new MutationResult(version, proto.transformResults || []);\n}\n\nexport function fromWriteResults(\n protos: ProtoWriteResult[] | undefined,\n commitTime?: ProtoTimestamp\n): MutationResult[] {\n if (protos && protos.length > 0) {\n hardAssert(\n commitTime !== undefined,\n 'Received a write result without a commit time'\n );\n return protos.map(proto => fromWriteResult(proto, commitTime));\n } else {\n return [];\n }\n}\n\nfunction toFieldTransform(\n serializer: JsonProtoSerializer,\n fieldTransform: FieldTransform\n): ProtoFieldTransform {\n const transform = fieldTransform.transform;\n if (transform instanceof ServerTimestampTransform) {\n return {\n fieldPath: fieldTransform.field.canonicalString(),\n setToServerValue: 'REQUEST_TIME'\n };\n } else if (transform instanceof ArrayUnionTransformOperation) {\n return {\n fieldPath: fieldTransform.field.canonicalString(),\n appendMissingElements: {\n values: transform.elements\n }\n };\n } else if (transform instanceof ArrayRemoveTransformOperation) {\n return {\n fieldPath: fieldTransform.field.canonicalString(),\n removeAllFromArray: {\n values: transform.elements\n }\n };\n } else if (transform instanceof NumericIncrementTransformOperation) {\n return {\n fieldPath: fieldTransform.field.canonicalString(),\n increment: transform.operand\n };\n } else {\n throw fail('Unknown transform: ' + fieldTransform.transform);\n }\n}\n\nfunction fromFieldTransform(\n serializer: JsonProtoSerializer,\n proto: ProtoFieldTransform\n): FieldTransform {\n let transform: TransformOperation | null = null;\n if ('setToServerValue' in proto) {\n hardAssert(\n proto.setToServerValue === 'REQUEST_TIME',\n 'Unknown server value transform proto: ' + JSON.stringify(proto)\n );\n transform = new ServerTimestampTransform();\n } else if ('appendMissingElements' in proto) {\n const values = proto.appendMissingElements!.values || [];\n transform = new ArrayUnionTransformOperation(values);\n } else if ('removeAllFromArray' in proto) {\n const values = proto.removeAllFromArray!.values || [];\n transform = new ArrayRemoveTransformOperation(values);\n } else if ('increment' in proto) {\n transform = new NumericIncrementTransformOperation(\n serializer,\n proto.increment!\n );\n } else {\n fail('Unknown transform proto: ' + JSON.stringify(proto));\n }\n const fieldPath = FieldPath.fromServerFormat(proto.fieldPath!);\n return new FieldTransform(fieldPath, transform!);\n}\n\nexport function toDocumentsTarget(\n serializer: JsonProtoSerializer,\n target: Target\n): ProtoDocumentsTarget {\n return { documents: [toQueryPath(serializer, target.path)] };\n}\n\nexport function fromDocumentsTarget(\n documentsTarget: ProtoDocumentsTarget\n): Target {\n const count = documentsTarget.documents!.length;\n hardAssert(\n count === 1,\n 'DocumentsTarget contained other than 1 document: ' + count\n );\n const name = documentsTarget.documents![0];\n return queryToTarget(newQueryForPath(fromQueryPath(name)));\n}\n\nexport function toQueryTarget(\n serializer: JsonProtoSerializer,\n target: Target\n): ProtoQueryTarget {\n // Dissect the path into parent, collectionId, and optional key filter.\n const result: ProtoQueryTarget = { structuredQuery: {} };\n const path = target.path;\n if (target.collectionGroup !== null) {\n debugAssert(\n path.length % 2 === 0,\n 'Collection Group queries should be within a document path or root.'\n );\n result.parent = toQueryPath(serializer, path);\n result.structuredQuery!.from = [\n {\n collectionId: target.collectionGroup,\n allDescendants: true\n }\n ];\n } else {\n debugAssert(\n path.length % 2 !== 0,\n 'Document queries with filters are not supported.'\n );\n result.parent = toQueryPath(serializer, path.popLast());\n result.structuredQuery!.from = [{ collectionId: path.lastSegment() }];\n }\n\n const where = toFilters(target.filters);\n if (where) {\n result.structuredQuery!.where = where;\n }\n\n const orderBy = toOrder(target.orderBy);\n if (orderBy) {\n result.structuredQuery!.orderBy = orderBy;\n }\n\n const limit = toInt32Proto(serializer, target.limit);\n if (limit !== null) {\n result.structuredQuery!.limit = limit;\n }\n\n if (target.startAt) {\n result.structuredQuery!.startAt = toStartAtCursor(target.startAt);\n }\n if (target.endAt) {\n result.structuredQuery!.endAt = toEndAtCursor(target.endAt);\n }\n\n return result;\n}\n\nexport function toRunAggregationQueryRequest(\n serializer: JsonProtoSerializer,\n target: Target\n): ProtoRunAggregationQueryRequest {\n const queryTarget = toQueryTarget(serializer, target);\n\n return {\n structuredAggregationQuery: {\n aggregations: [\n {\n count: {},\n alias: 'count_alias'\n }\n ],\n structuredQuery: queryTarget.structuredQuery\n },\n parent: queryTarget.parent\n };\n}\n\nexport function convertQueryTargetToQuery(target: ProtoQueryTarget): Query {\n let path = fromQueryPath(target.parent!);\n\n const query = target.structuredQuery!;\n const fromCount = query.from ? query.from.length : 0;\n let collectionGroup: string | null = null;\n if (fromCount > 0) {\n hardAssert(\n fromCount === 1,\n 'StructuredQuery.from with more than one collection is not supported.'\n );\n const from = query.from![0];\n if (from.allDescendants) {\n collectionGroup = from.collectionId!;\n } else {\n path = path.child(from.collectionId!);\n }\n }\n\n let filterBy: Filter[] = [];\n if (query.where) {\n filterBy = fromFilters(query.where);\n }\n\n let orderBy: OrderBy[] = [];\n if (query.orderBy) {\n orderBy = fromOrder(query.orderBy);\n }\n\n let limit: number | null = null;\n if (query.limit) {\n limit = fromInt32Proto(query.limit);\n }\n\n let startAt: Bound | null = null;\n if (query.startAt) {\n startAt = fromStartAtCursor(query.startAt);\n }\n\n let endAt: Bound | null = null;\n if (query.endAt) {\n endAt = fromEndAtCursor(query.endAt);\n }\n\n return newQuery(\n path,\n collectionGroup,\n orderBy,\n filterBy,\n limit,\n LimitType.First,\n startAt,\n endAt\n );\n}\n\nexport function fromQueryTarget(target: ProtoQueryTarget): Target {\n return queryToTarget(convertQueryTargetToQuery(target));\n}\n\nexport function toListenRequestLabels(\n serializer: JsonProtoSerializer,\n targetData: TargetData\n): ProtoApiClientObjectMap<string> | null {\n const value = toLabel(serializer, targetData.purpose);\n if (value == null) {\n return null;\n } else {\n return {\n 'goog-listen-tags': value\n };\n }\n}\n\nfunction toLabel(\n serializer: JsonProtoSerializer,\n purpose: TargetPurpose\n): string | null {\n switch (purpose) {\n case TargetPurpose.Listen:\n return null;\n case TargetPurpose.ExistenceFilterMismatch:\n return 'existence-filter-mismatch';\n case TargetPurpose.LimboResolution:\n return 'limbo-document';\n default:\n return fail('Unrecognized query purpose: ' + purpose);\n }\n}\n\nexport function toTarget(\n serializer: JsonProtoSerializer,\n targetData: TargetData\n): ProtoTarget {\n let result: ProtoTarget;\n const target = targetData.target;\n\n if (targetIsDocumentTarget(target)) {\n result = { documents: toDocumentsTarget(serializer, target) };\n } else {\n result = { query: toQueryTarget(serializer, target) };\n }\n\n result.targetId = targetData.targetId;\n\n if (targetData.resumeToken.approximateByteSize() > 0) {\n result.resumeToken = toBytes(serializer, targetData.resumeToken);\n } else if (targetData.snapshotVersion.compareTo(SnapshotVersion.min()) > 0) {\n // TODO(wuandy): Consider removing above check because it is most likely true.\n // Right now, many tests depend on this behaviour though (leaving min() out\n // of serialization).\n result.readTime = toTimestamp(\n serializer,\n targetData.snapshotVersion.toTimestamp()\n );\n }\n\n return result;\n}\n\nfunction toFilters(filters: Filter[]): ProtoFilter | undefined {\n if (filters.length === 0) {\n return;\n }\n\n return toFilter(CompositeFilter.create(filters, CompositeOperator.AND));\n}\n\nfunction fromFilters(filter: ProtoFilter): Filter[] {\n const result = fromFilter(filter);\n\n if (\n result instanceof CompositeFilter &&\n compositeFilterIsFlatConjunction(result)\n ) {\n return result.getFilters();\n }\n\n return [result];\n}\n\nfunction fromFilter(filter: ProtoFilter): Filter {\n if (filter.unaryFilter !== undefined) {\n return fromUnaryFilter(filter);\n } else if (filter.fieldFilter !== undefined) {\n return fromFieldFilter(filter);\n } else if (filter.compositeFilter !== undefined) {\n return fromCompositeFilter(filter);\n } else {\n return fail('Unknown filter: ' + JSON.stringify(filter));\n }\n}\n\nfunction toOrder(orderBys: OrderBy[]): ProtoOrder[] | undefined {\n if (orderBys.length === 0) {\n return;\n }\n return orderBys.map(order => toPropertyOrder(order));\n}\n\nfunction fromOrder(orderBys: ProtoOrder[]): OrderBy[] {\n return orderBys.map(order => fromPropertyOrder(order));\n}\n\nfunction toStartAtCursor(cursor: Bound): ProtoCursor {\n return {\n before: cursor.inclusive,\n values: cursor.position\n };\n}\n\nfunction toEndAtCursor(cursor: Bound): ProtoCursor {\n return {\n before: !cursor.inclusive,\n values: cursor.position\n };\n}\n\nfunction fromStartAtCursor(cursor: ProtoCursor): Bound {\n const inclusive = !!cursor.before;\n const position = cursor.values || [];\n return new Bound(position, inclusive);\n}\n\nfunction fromEndAtCursor(cursor: ProtoCursor): Bound {\n const inclusive = !cursor.before;\n const position = cursor.values || [];\n return new Bound(position, inclusive);\n}\n\n// visible for testing\nexport function toDirection(dir: Direction): ProtoOrderDirection {\n return DIRECTIONS[dir];\n}\n\n// visible for testing\nexport function fromDirection(\n dir: ProtoOrderDirection | undefined\n): Direction | undefined {\n switch (dir) {\n case 'ASCENDING':\n return Direction.ASCENDING;\n case 'DESCENDING':\n return Direction.DESCENDING;\n default:\n return undefined;\n }\n}\n\n// visible for testing\nexport function toOperatorName(op: Operator): ProtoFieldFilterOp {\n return OPERATORS[op];\n}\n\nexport function toCompositeOperatorName(\n op: CompositeOperator\n): ProtoCompositeFilterOp {\n return COMPOSITE_OPERATORS[op];\n}\n\nexport function fromOperatorName(op: ProtoFieldFilterOp): Operator {\n switch (op) {\n case 'EQUAL':\n return Operator.EQUAL;\n case 'NOT_EQUAL':\n return Operator.NOT_EQUAL;\n case 'GREATER_THAN':\n return Operator.GREATER_THAN;\n case 'GREATER_THAN_OR_EQUAL':\n return Operator.GREATER_THAN_OR_EQUAL;\n case 'LESS_THAN':\n return Operator.LESS_THAN;\n case 'LESS_THAN_OR_EQUAL':\n return Operator.LESS_THAN_OR_EQUAL;\n case 'ARRAY_CONTAINS':\n return Operator.ARRAY_CONTAINS;\n case 'IN':\n return Operator.IN;\n case 'NOT_IN':\n return Operator.NOT_IN;\n case 'ARRAY_CONTAINS_ANY':\n return Operator.ARRAY_CONTAINS_ANY;\n case 'OPERATOR_UNSPECIFIED':\n return fail('Unspecified operator');\n default:\n return fail('Unknown operator');\n }\n}\n\nexport function fromCompositeOperatorName(\n op: ProtoCompositeFilterOp\n): CompositeOperator {\n switch (op) {\n case 'AND':\n return CompositeOperator.AND;\n case 'OR':\n return CompositeOperator.OR;\n default:\n return fail('Unknown operator');\n }\n}\n\nexport function toFieldPathReference(path: FieldPath): ProtoFieldReference {\n return { fieldPath: path.canonicalString() };\n}\n\nexport function fromFieldPathReference(\n fieldReference: ProtoFieldReference\n): FieldPath {\n return FieldPath.fromServerFormat(fieldReference.fieldPath!);\n}\n\n// visible for testing\nexport function toPropertyOrder(orderBy: OrderBy): ProtoOrder {\n return {\n field: toFieldPathReference(orderBy.field),\n direction: toDirection(orderBy.dir)\n };\n}\n\nexport function fromPropertyOrder(orderBy: ProtoOrder): OrderBy {\n return new OrderBy(\n fromFieldPathReference(orderBy.field!),\n fromDirection(orderBy.direction)\n );\n}\n\n// visible for testing\nexport function toFilter(filter: Filter): ProtoFilter {\n if (filter instanceof FieldFilter) {\n return toUnaryOrFieldFilter(filter);\n } else if (filter instanceof CompositeFilter) {\n return toCompositeFilter(filter);\n } else {\n return fail('Unrecognized filter type ' + JSON.stringify(filter));\n }\n}\n\nexport function toCompositeFilter(filter: CompositeFilter): ProtoFilter {\n const protos = filter.getFilters().map(filter => toFilter(filter));\n\n if (protos.length === 1) {\n return protos[0];\n }\n\n return {\n compositeFilter: {\n op: toCompositeOperatorName(filter.op),\n filters: protos\n }\n };\n}\n\nexport function toUnaryOrFieldFilter(filter: FieldFilter): ProtoFilter {\n if (filter.op === Operator.EQUAL) {\n if (isNanValue(filter.value)) {\n return {\n unaryFilter: {\n field: toFieldPathReference(filter.field),\n op: 'IS_NAN'\n }\n };\n } else if (isNullValue(filter.value)) {\n return {\n unaryFilter: {\n field: toFieldPathReference(filter.field),\n op: 'IS_NULL'\n }\n };\n }\n } else if (filter.op === Operator.NOT_EQUAL) {\n if (isNanValue(filter.value)) {\n return {\n unaryFilter: {\n field: toFieldPathReference(filter.field),\n op: 'IS_NOT_NAN'\n }\n };\n } else if (isNullValue(filter.value)) {\n return {\n unaryFilter: {\n field: toFieldPathReference(filter.field),\n op: 'IS_NOT_NULL'\n }\n };\n }\n }\n return {\n fieldFilter: {\n field: toFieldPathReference(filter.field),\n op: toOperatorName(filter.op),\n value: filter.value\n }\n };\n}\n\nexport function fromUnaryFilter(filter: ProtoFilter): Filter {\n switch (filter.unaryFilter!.op!) {\n case 'IS_NAN':\n const nanField = fromFieldPathReference(filter.unaryFilter!.field!);\n return FieldFilter.create(nanField, Operator.EQUAL, {\n doubleValue: NaN\n });\n case 'IS_NULL':\n const nullField = fromFieldPathReference(filter.unaryFilter!.field!);\n return FieldFilter.create(nullField, Operator.EQUAL, {\n nullValue: 'NULL_VALUE'\n });\n case 'IS_NOT_NAN':\n const notNanField = fromFieldPathReference(filter.unaryFilter!.field!);\n return FieldFilter.create(notNanField, Operator.NOT_EQUAL, {\n doubleValue: NaN\n });\n case 'IS_NOT_NULL':\n const notNullField = fromFieldPathReference(filter.unaryFilter!.field!);\n return FieldFilter.create(notNullField, Operator.NOT_EQUAL, {\n nullValue: 'NULL_VALUE'\n });\n case 'OPERATOR_UNSPECIFIED':\n return fail('Unspecified filter');\n default:\n return fail('Unknown filter');\n }\n}\n\nexport function fromFieldFilter(filter: ProtoFilter): FieldFilter {\n return FieldFilter.create(\n fromFieldPathReference(filter.fieldFilter!.field!),\n fromOperatorName(filter.fieldFilter!.op!),\n filter.fieldFilter!.value!\n );\n}\n\nexport function fromCompositeFilter(filter: ProtoFilter): CompositeFilter {\n return CompositeFilter.create(\n filter.compositeFilter!.filters!.map(filter => fromFilter(filter)),\n fromCompositeOperatorName(filter.compositeFilter!.op!)\n );\n}\n\nexport function toDocumentMask(fieldMask: FieldMask): ProtoDocumentMask {\n const canonicalFields: string[] = [];\n fieldMask.fields.forEach(field =>\n canonicalFields.push(field.canonicalString())\n );\n return {\n fieldPaths: canonicalFields\n };\n}\n\nexport function fromDocumentMask(proto: ProtoDocumentMask): FieldMask {\n const paths = proto.fieldPaths || [];\n return new FieldMask(paths.map(path => FieldPath.fromServerFormat(path)));\n}\n\nexport function isValidResourceName(path: ResourcePath): boolean {\n // Resource names have at least 4 components (project ID, database ID)\n return (\n path.length >= 4 &&\n path.get(0) === 'projects' &&\n path.get(2) === 'databases'\n );\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/** Return the Platform-specific serializer monitor. */\nimport { DatabaseId } from '../../core/database_info';\nimport { JsonProtoSerializer } from '../../remote/serializer';\n\nexport function newSerializer(databaseId: DatabaseId): JsonProtoSerializer {\n return new JsonProtoSerializer(databaseId, /* useProto3Json= */ true);\n}\n\n/**\n * An instance of the Platform's 'TextEncoder' implementation.\n */\nexport function newTextEncoder(): TextEncoder {\n return new TextEncoder();\n}\n\n/**\n * An instance of the Platform's 'TextDecoder' implementation.\n */\nexport function newTextDecoder(): TextDecoder {\n return new TextDecoder('utf-8');\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { AsyncQueue, DelayedOperation, TimerId } from '../util/async_queue';\nimport { logDebug } from '../util/log';\n\nconst LOG_TAG = 'ExponentialBackoff';\n\n/**\n * Initial backoff time in milliseconds after an error.\n * Set to 1s according to https://cloud.google.com/apis/design/errors.\n */\nconst DEFAULT_BACKOFF_INITIAL_DELAY_MS = 1000;\n\nconst DEFAULT_BACKOFF_FACTOR = 1.5;\n\n/** Maximum backoff time in milliseconds */\nconst DEFAULT_BACKOFF_MAX_DELAY_MS = 60 * 1000;\n\n/**\n * A helper for running delayed tasks following an exponential backoff curve\n * between attempts.\n *\n * Each delay is made up of a \"base\" delay which follows the exponential\n * backoff curve, and a +/- 50% \"jitter\" that is calculated and added to the\n * base delay. This prevents clients from accidentally synchronizing their\n * delays causing spikes of load to the backend.\n */\nexport class ExponentialBackoff {\n private currentBaseMs: number = 0;\n private timerPromise: DelayedOperation<void> | null = null;\n /** The last backoff attempt, as epoch milliseconds. */\n private lastAttemptTime = Date.now();\n\n constructor(\n /**\n * The AsyncQueue to run backoff operations on.\n */\n private readonly queue: AsyncQueue,\n /**\n * The ID to use when scheduling backoff operations on the AsyncQueue.\n */\n private readonly timerId: TimerId,\n /**\n * The initial delay (used as the base delay on the first retry attempt).\n * Note that jitter will still be applied, so the actual delay could be as\n * little as 0.5*initialDelayMs.\n */\n private readonly initialDelayMs: number = DEFAULT_BACKOFF_INITIAL_DELAY_MS,\n /**\n * The multiplier to use to determine the extended base delay after each\n * attempt.\n */\n private readonly backoffFactor: number = DEFAULT_BACKOFF_FACTOR,\n /**\n * The maximum base delay after which no further backoff is performed.\n * Note that jitter will still be applied, so the actual delay could be as\n * much as 1.5*maxDelayMs.\n */\n private readonly maxDelayMs: number = DEFAULT_BACKOFF_MAX_DELAY_MS\n ) {\n this.reset();\n }\n\n /**\n * Resets the backoff delay.\n *\n * The very next backoffAndWait() will have no delay. If it is called again\n * (i.e. due to an error), initialDelayMs (plus jitter) will be used, and\n * subsequent ones will increase according to the backoffFactor.\n */\n reset(): void {\n this.currentBaseMs = 0;\n }\n\n /**\n * Resets the backoff delay to the maximum delay (e.g. for use after a\n * RESOURCE_EXHAUSTED error).\n */\n resetToMax(): void {\n this.currentBaseMs = this.maxDelayMs;\n }\n\n /**\n * Returns a promise that resolves after currentDelayMs, and increases the\n * delay for any subsequent attempts. If there was a pending backoff operation\n * already, it will be canceled.\n */\n backoffAndRun(op: () => Promise<void>): void {\n // Cancel any pending backoff operation.\n this.cancel();\n\n // First schedule using the current base (which may be 0 and should be\n // honored as such).\n const desiredDelayWithJitterMs = Math.floor(\n this.currentBaseMs + this.jitterDelayMs()\n );\n\n // Guard against lastAttemptTime being in the future due to a clock change.\n const delaySoFarMs = Math.max(0, Date.now() - this.lastAttemptTime);\n\n // Guard against the backoff delay already being past.\n const remainingDelayMs = Math.max(\n 0,\n desiredDelayWithJitterMs - delaySoFarMs\n );\n\n if (remainingDelayMs > 0) {\n logDebug(\n LOG_TAG,\n `Backing off for ${remainingDelayMs} ms ` +\n `(base delay: ${this.currentBaseMs} ms, ` +\n `delay with jitter: ${desiredDelayWithJitterMs} ms, ` +\n `last attempt: ${delaySoFarMs} ms ago)`\n );\n }\n\n this.timerPromise = this.queue.enqueueAfterDelay(\n this.timerId,\n remainingDelayMs,\n () => {\n this.lastAttemptTime = Date.now();\n return op();\n }\n );\n\n // Apply backoff factor to determine next delay and ensure it is within\n // bounds.\n this.currentBaseMs *= this.backoffFactor;\n if (this.currentBaseMs < this.initialDelayMs) {\n this.currentBaseMs = this.initialDelayMs;\n }\n if (this.currentBaseMs > this.maxDelayMs) {\n this.currentBaseMs = this.maxDelayMs;\n }\n }\n\n skipBackoff(): void {\n if (this.timerPromise !== null) {\n this.timerPromise.skipDelay();\n this.timerPromise = null;\n }\n }\n\n cancel(): void {\n if (this.timerPromise !== null) {\n this.timerPromise.cancel();\n this.timerPromise = null;\n }\n }\n\n /** Returns a random value in the range [-currentBaseMs/2, currentBaseMs/2] */\n private jitterDelayMs(): number {\n return (Math.random() - 0.5) * this.currentBaseMs;\n }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { CredentialsProvider } from '../api/credentials';\nimport { User } from '../auth/user';\nimport { Query, queryToTarget } from '../core/query';\nimport { Document } from '../model/document';\nimport { DocumentKey } from '../model/document_key';\nimport { Mutation } from '../model/mutation';\nimport {\n BatchGetDocumentsRequest as ProtoBatchGetDocumentsRequest,\n BatchGetDocumentsResponse as ProtoBatchGetDocumentsResponse,\n RunAggregationQueryRequest as ProtoRunAggregationQueryRequest,\n RunAggregationQueryResponse as ProtoRunAggregationQueryResponse,\n RunQueryRequest as ProtoRunQueryRequest,\n RunQueryResponse as ProtoRunQueryResponse,\n Value as ProtoValue\n} from '../protos/firestore_proto_api';\nimport { debugAssert, debugCast, hardAssert } from '../util/assert';\nimport { AsyncQueue } from '../util/async_queue';\nimport { Code, FirestoreError } from '../util/error';\n\nimport { Connection } from './connection';\nimport {\n PersistentListenStream,\n PersistentWriteStream,\n WatchStreamListener,\n WriteStreamListener\n} from './persistent_stream';\nimport {\n fromDocument,\n fromBatchGetDocumentsResponse,\n getEncodedDatabaseId,\n JsonProtoSerializer,\n toMutation,\n toName,\n toQueryTarget,\n toRunAggregationQueryRequest\n} from './serializer';\n\n/**\n * Datastore and its related methods are a wrapper around the external Google\n * Cloud Datastore grpc API, which provides an interface that is more convenient\n * for the rest of the client SDK architecture to consume.\n */\nexport abstract class Datastore {\n abstract terminate(): void;\n}\n\n/**\n * An implementation of Datastore that exposes additional state for internal\n * consumption.\n */\nclass DatastoreImpl extends Datastore {\n terminated = false;\n\n constructor(\n readonly authCredentials: CredentialsProvider<User>,\n readonly appCheckCredentials: CredentialsProvider<string>,\n readonly connection: Connection,\n readonly serializer: JsonProtoSerializer\n ) {\n super();\n }\n\n verifyInitialized(): void {\n debugAssert(!!this.connection, 'Datastore.start() not called');\n if (this.terminated) {\n throw new FirestoreError(\n Code.FAILED_PRECONDITION,\n 'The client has already been terminated.'\n );\n }\n }\n\n /** Invokes the provided RPC with auth and AppCheck tokens. */\n invokeRPC<Req, Resp>(\n rpcName: string,\n path: string,\n request: Req\n ): Promise<Resp> {\n this.verifyInitialized();\n return Promise.all([\n this.authCredentials.getToken(),\n this.appCheckCredentials.getToken()\n ])\n .then(([authToken, appCheckToken]) => {\n return this.connection.invokeRPC<Req, Resp>(\n rpcName,\n path,\n request,\n authToken,\n appCheckToken\n );\n })\n .catch((error: FirestoreError) => {\n if (error.name === 'FirebaseError') {\n if (error.code === Code.UNAUTHENTICATED) {\n this.authCredentials.invalidateToken();\n this.appCheckCredentials.invalidateToken();\n }\n throw error;\n } else {\n throw new FirestoreError(Code.UNKNOWN, error.toString());\n }\n });\n }\n\n /** Invokes the provided RPC with streamed results with auth and AppCheck tokens. */\n invokeStreamingRPC<Req, Resp>(\n rpcName: string,\n path: string,\n request: Req,\n expectedResponseCount?: number\n ): Promise<Resp[]> {\n this.verifyInitialized();\n return Promise.all([\n this.authCredentials.getToken(),\n this.appCheckCredentials.getToken()\n ])\n .then(([authToken, appCheckToken]) => {\n return this.connection.invokeStreamingRPC<Req, Resp>(\n rpcName,\n path,\n request,\n authToken,\n appCheckToken,\n expectedResponseCount\n );\n })\n .catch((error: FirestoreError) => {\n if (error.name === 'FirebaseError') {\n if (error.code === Code.UNAUTHENTICATED) {\n this.authCredentials.invalidateToken();\n this.appCheckCredentials.invalidateToken();\n }\n throw error;\n } else {\n throw new FirestoreError(Code.UNKNOWN, error.toString());\n }\n });\n }\n\n terminate(): void {\n this.terminated = true;\n }\n}\n\n// TODO(firestorexp): Make sure there is only one Datastore instance per\n// firestore-exp client.\nexport function newDatastore(\n authCredentials: CredentialsProvider<User>,\n appCheckCredentials: CredentialsProvider<string>,\n connection: Connection,\n serializer: JsonProtoSerializer\n): Datastore {\n return new DatastoreImpl(\n authCredentials,\n appCheckCredentials,\n connection,\n serializer\n );\n}\n\nexport async function invokeCommitRpc(\n datastore: Datastore,\n mutations: Mutation[]\n): Promise<void> {\n const datastoreImpl = debugCast(datastore, DatastoreImpl);\n const path = getEncodedDatabaseId(datastoreImpl.serializer) + '/documents';\n const request = {\n writes: mutations.map(m => toMutation(datastoreImpl.serializer, m))\n };\n await datastoreImpl.invokeRPC('Commit', path, request);\n}\n\nexport async function invokeBatchGetDocumentsRpc(\n datastore: Datastore,\n keys: DocumentKey[]\n): Promise<Document[]> {\n const datastoreImpl = debugCast(datastore, DatastoreImpl);\n const path = getEncodedDatabaseId(datastoreImpl.serializer) + '/documents';\n const request = {\n documents: keys.map(k => toName(datastoreImpl.serializer, k))\n };\n const response = await datastoreImpl.invokeStreamingRPC<\n ProtoBatchGetDocumentsRequest,\n ProtoBatchGetDocumentsResponse\n >('BatchGetDocuments', path, request, keys.length);\n\n const docs = new Map<string, Document>();\n response.forEach(proto => {\n const doc = fromBatchGetDocumentsResponse(datastoreImpl.serializer, proto);\n docs.set(doc.key.toString(), doc);\n });\n const result: Document[] = [];\n keys.forEach(key => {\n const doc = docs.get(key.toString());\n hardAssert(!!doc, 'Missing entity in write response for ' + key);\n result.push(doc);\n });\n return result;\n}\n\nexport async function invokeRunQueryRpc(\n datastore: Datastore,\n query: Query\n): Promise<Document[]> {\n const datastoreImpl = debugCast(datastore, DatastoreImpl);\n const request = toQueryTarget(datastoreImpl.serializer, queryToTarget(query));\n const response = await datastoreImpl.invokeStreamingRPC<\n ProtoRunQueryRequest,\n ProtoRunQueryResponse\n >('RunQuery', request.parent!, { structuredQuery: request.structuredQuery });\n return (\n response\n // Omit RunQueryResponses that only contain readTimes.\n .filter(proto => !!proto.document)\n .map(proto =>\n fromDocument(datastoreImpl.serializer, proto.document!, undefined)\n )\n );\n}\n\nexport async function invokeRunAggregationQueryRpc(\n datastore: Datastore,\n query: Query\n): Promise<ProtoValue[]> {\n const datastoreImpl = debugCast(datastore, DatastoreImpl);\n const request = toRunAggregationQueryRequest(\n datastoreImpl.serializer,\n queryToTarget(query)\n );\n\n const parent = request.parent;\n if (!datastoreImpl.connection.shouldResourcePathBeIncludedInRequest) {\n delete request.parent;\n }\n const response = await datastoreImpl.invokeStreamingRPC<\n ProtoRunAggregationQueryRequest,\n ProtoRunAggregationQueryResponse\n >('RunAggregationQuery', parent!, request, /*expectedResponseCount=*/ 1);\n return (\n response\n // Omit RunAggregationQueryResponse that only contain readTimes.\n .filter(proto => !!proto.result)\n .map(proto => proto.result!.aggregateFields!)\n );\n}\n\nexport function newPersistentWriteStream(\n datastore: Datastore,\n queue: AsyncQueue,\n listener: WriteStreamListener\n): PersistentWriteStream {\n const datastoreImpl = debugCast(datastore, DatastoreImpl);\n datastoreImpl.verifyInitialized();\n return new PersistentWriteStream(\n queue,\n datastoreImpl.connection,\n datastoreImpl.authCredentials,\n datastoreImpl.appCheckCredentials,\n datastoreImpl.serializer,\n listener\n );\n}\n\nexport function newPersistentWatchStream(\n datastore: Datastore,\n queue: AsyncQueue,\n listener: WatchStreamListener\n): PersistentListenStream {\n const datastoreImpl = debugCast(datastore, DatastoreImpl);\n datastoreImpl.verifyInitialized();\n return new PersistentListenStream(\n queue,\n datastoreImpl.connection,\n datastoreImpl.authCredentials,\n datastoreImpl.appCheckCredentials,\n datastoreImpl.serializer,\n listener\n );\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n// eslint-disable-next-line import/no-extraneous-dependencies\nimport { _FirebaseService } from '@firebase/app';\n\nimport { CredentialsProvider } from '../api/credentials';\nimport { User } from '../auth/user';\nimport { DatabaseId, DatabaseInfo } from '../core/database_info';\nimport { newConnection } from '../platform/connection';\nimport { newSerializer } from '../platform/serializer';\nimport { Datastore, newDatastore } from '../remote/datastore';\nimport { Code, FirestoreError } from '../util/error';\nimport { logDebug } from '../util/log';\n\nimport { FirestoreSettingsImpl } from './settings';\n\nexport const LOG_TAG = 'ComponentProvider';\n\n// The components module manages the lifetime of dependencies of the Firestore\n// client. Dependencies can be lazily constructed and only one exists per\n// Firestore instance.\n\n/**\n * An interface implemented by FirebaseFirestore that provides compatibility\n * with the usage in this file.\n *\n * This interface mainly exists to remove a cyclic dependency.\n */\nexport interface FirestoreService extends _FirebaseService {\n _authCredentials: CredentialsProvider<User>;\n _appCheckCredentials: CredentialsProvider<string>;\n _persistenceKey: string;\n _databaseId: DatabaseId;\n _terminated: boolean;\n\n _freezeSettings(): FirestoreSettingsImpl;\n}\n/**\n * An instance map that ensures only one Datastore exists per Firestore\n * instance.\n */\nconst datastoreInstances = new Map<FirestoreService, Datastore>();\n\n/**\n * Returns an initialized and started Datastore for the given Firestore\n * instance. Callers must invoke removeComponents() when the Firestore\n * instance is terminated.\n */\nexport function getDatastore(firestore: FirestoreService): Datastore {\n if (firestore._terminated) {\n throw new FirestoreError(\n Code.FAILED_PRECONDITION,\n 'The client has already been terminated.'\n );\n }\n if (!datastoreInstances.has(firestore)) {\n logDebug(LOG_TAG, 'Initializing Datastore');\n const databaseInfo = makeDatabaseInfo(\n firestore._databaseId,\n firestore.app.options.appId || '',\n firestore._persistenceKey,\n firestore._freezeSettings()\n );\n const connection = newConnection(databaseInfo);\n const serializer = newSerializer(firestore._databaseId);\n const datastore = newDatastore(\n firestore._authCredentials,\n firestore._appCheckCredentials,\n connection,\n serializer\n );\n\n datastoreInstances.set(firestore, datastore);\n }\n return datastoreInstances.get(firestore)!;\n}\n\n/**\n * Removes all components associated with the provided instance. Must be called\n * when the `Firestore` instance is terminated.\n */\nexport function removeComponents(firestore: FirestoreService): void {\n const datastore = datastoreInstances.get(firestore);\n if (datastore) {\n logDebug(LOG_TAG, 'Removing Datastore');\n datastoreInstances.delete(firestore);\n datastore.terminate();\n }\n}\n\nexport function makeDatabaseInfo(\n databaseId: DatabaseId,\n appId: string,\n persistenceKey: string,\n settings: FirestoreSettingsImpl\n): DatabaseInfo {\n return new DatabaseInfo(\n databaseId,\n appId,\n persistenceKey,\n settings.host,\n settings.ssl,\n settings.experimentalForceLongPolling,\n settings.experimentalAutoDetectLongPolling,\n settings.useFetchStreams\n );\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { DatabaseInfo } from '../../core/database_info';\nimport { Connection } from '../../remote/connection';\n\nimport { FetchConnection } from './fetch_connection';\n\nexport { newConnectivityMonitor } from '../browser/connection';\n\n/** Initializes the HTTP connection for the REST API. */\nexport function newConnection(databaseInfo: DatabaseInfo): Connection {\n return new FetchConnection(databaseInfo, fetch.bind(null));\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { CredentialsSettings } from '../api/credentials';\nimport {\n LRU_COLLECTION_DISABLED,\n LRU_DEFAULT_CACHE_SIZE_BYTES\n} from '../local/lru_garbage_collector';\nimport { LRU_MINIMUM_CACHE_SIZE_BYTES } from '../local/lru_garbage_collector_impl';\nimport { Code, FirestoreError } from '../util/error';\nimport { validateIsNotUsedTogether } from '../util/input_validation';\n\n// settings() defaults:\nexport const DEFAULT_HOST = 'firestore.googleapis.com';\nexport const DEFAULT_SSL = true;\n\n/**\n * Specifies custom configurations for your Cloud Firestore instance.\n * You must set these before invoking any other methods.\n */\nexport interface FirestoreSettings {\n /** The hostname to connect to. */\n host?: string;\n\n /** Whether to use SSL when connecting. */\n ssl?: boolean;\n\n /**\n * Whether to skip nested properties that are set to `undefined` during\n * object serialization. If set to `true`, these properties are skipped\n * and not written to Firestore. If set to `false` or omitted, the SDK\n * throws an exception when it encounters properties of type `undefined`.\n */\n ignoreUndefinedProperties?: boolean;\n}\n\n/** Undocumented, private additional settings not exposed in our public API. */\nexport interface PrivateSettings extends FirestoreSettings {\n // Can be a google-auth-library or gapi client.\n credentials?: CredentialsSettings;\n // Used in firestore@exp\n cacheSizeBytes?: number;\n // Used in firestore@exp\n experimentalForceLongPolling?: boolean;\n // Used in firestore@exp\n experimentalAutoDetectLongPolling?: boolean;\n // Used in firestore@exp\n useFetchStreams?: boolean;\n}\n\n/**\n * A concrete type describing all the values that can be applied via a\n * user-supplied `FirestoreSettings` object. This is a separate type so that\n * defaults can be supplied and the value can be checked for equality.\n */\nexport class FirestoreSettingsImpl {\n /** The hostname to connect to. */\n readonly host: string;\n\n /** Whether to use SSL when connecting. */\n readonly ssl: boolean;\n\n readonly cacheSizeBytes: number;\n\n readonly experimentalForceLongPolling: boolean;\n\n readonly experimentalAutoDetectLongPolling: boolean;\n\n readonly ignoreUndefinedProperties: boolean;\n\n readonly useFetchStreams: boolean;\n\n // Can be a google-auth-library or gapi client.\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n credentials?: any;\n\n constructor(settings: PrivateSettings) {\n if (settings.host === undefined) {\n if (settings.ssl !== undefined) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n \"Can't provide ssl option if host option is not set\"\n );\n }\n this.host = DEFAULT_HOST;\n this.ssl = DEFAULT_SSL;\n } else {\n this.host = settings.host;\n this.ssl = settings.ssl ?? DEFAULT_SSL;\n }\n\n this.credentials = settings.credentials;\n this.ignoreUndefinedProperties = !!settings.ignoreUndefinedProperties;\n\n if (settings.cacheSizeBytes === undefined) {\n this.cacheSizeBytes = LRU_DEFAULT_CACHE_SIZE_BYTES;\n } else {\n if (\n settings.cacheSizeBytes !== LRU_COLLECTION_DISABLED &&\n settings.cacheSizeBytes < LRU_MINIMUM_CACHE_SIZE_BYTES\n ) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n `cacheSizeBytes must be at least ${LRU_MINIMUM_CACHE_SIZE_BYTES}`\n );\n } else {\n this.cacheSizeBytes = settings.cacheSizeBytes;\n }\n }\n\n this.experimentalForceLongPolling = !!settings.experimentalForceLongPolling;\n this.experimentalAutoDetectLongPolling =\n !!settings.experimentalAutoDetectLongPolling;\n this.useFetchStreams = !!settings.useFetchStreams;\n\n validateIsNotUsedTogether(\n 'experimentalForceLongPolling',\n settings.experimentalForceLongPolling,\n 'experimentalAutoDetectLongPolling',\n settings.experimentalAutoDetectLongPolling\n );\n }\n\n isEqual(other: FirestoreSettingsImpl): boolean {\n return (\n this.host === other.host &&\n this.ssl === other.ssl &&\n this.credentials === other.credentials &&\n this.cacheSizeBytes === other.cacheSizeBytes &&\n this.experimentalForceLongPolling ===\n other.experimentalForceLongPolling &&\n this.experimentalAutoDetectLongPolling ===\n other.experimentalAutoDetectLongPolling &&\n this.ignoreUndefinedProperties === other.ignoreUndefinedProperties &&\n this.useFetchStreams === other.useFetchStreams\n );\n }\n}\n","/**\n * @license\n * Copyright 2018 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { ListenSequenceNumber, TargetId } from '../core/types';\nimport { SortedMap } from '../util/sorted_map';\n\nimport { PersistencePromise } from './persistence_promise';\nimport { PersistenceTransaction } from './persistence_transaction';\nimport { TargetData } from './target_data';\n\n/**\n * Describes a map whose keys are active target ids. We do not care about the type of the\n * values.\n */\nexport type ActiveTargets = SortedMap<TargetId, unknown>;\n\nexport const GC_DID_NOT_RUN: LruResults = {\n didRun: false,\n sequenceNumbersCollected: 0,\n targetsRemoved: 0,\n documentsRemoved: 0\n};\n\nexport const LRU_COLLECTION_DISABLED = -1;\nexport const LRU_DEFAULT_CACHE_SIZE_BYTES = 40 * 1024 * 1024;\n\nexport class LruParams {\n private static readonly DEFAULT_COLLECTION_PERCENTILE = 10;\n private static readonly DEFAULT_MAX_SEQUENCE_NUMBERS_TO_COLLECT = 1000;\n\n static withCacheSize(cacheSize: number): LruParams {\n return new LruParams(\n cacheSize,\n LruParams.DEFAULT_COLLECTION_PERCENTILE,\n LruParams.DEFAULT_MAX_SEQUENCE_NUMBERS_TO_COLLECT\n );\n }\n\n static readonly DEFAULT: LruParams = new LruParams(\n LRU_DEFAULT_CACHE_SIZE_BYTES,\n LruParams.DEFAULT_COLLECTION_PERCENTILE,\n LruParams.DEFAULT_MAX_SEQUENCE_NUMBERS_TO_COLLECT\n );\n\n static readonly DISABLED: LruParams = new LruParams(\n LRU_COLLECTION_DISABLED,\n 0,\n 0\n );\n\n constructor(\n // When we attempt to collect, we will only do so if the cache size is greater than this\n // threshold. Passing `COLLECTION_DISABLED` here will cause collection to always be skipped.\n readonly cacheSizeCollectionThreshold: number,\n // The percentage of sequence numbers that we will attempt to collect\n readonly percentileToCollect: number,\n // A cap on the total number of sequence numbers that will be collected. This prevents\n // us from collecting a huge number of sequence numbers if the cache has grown very large.\n readonly maximumSequenceNumbersToCollect: number\n ) {}\n}\n\nexport interface LruGarbageCollector {\n readonly params: LruParams;\n\n collect(\n txn: PersistenceTransaction,\n activeTargetIds: ActiveTargets\n ): PersistencePromise<LruResults>;\n\n /** Given a percentile of target to collect, returns the number of targets to collect. */\n calculateTargetCount(\n txn: PersistenceTransaction,\n percentile: number\n ): PersistencePromise<number>;\n\n /** Returns the nth sequence number, counting in order from the smallest. */\n nthSequenceNumber(\n txn: PersistenceTransaction,\n n: number\n ): PersistencePromise<number>;\n\n /**\n * Removes documents that have a sequence number equal to or less than the\n * upper bound and are not otherwise pinned.\n */\n removeOrphanedDocuments(\n txn: PersistenceTransaction,\n upperBound: ListenSequenceNumber\n ): PersistencePromise<number>;\n\n getCacheSize(txn: PersistenceTransaction): PersistencePromise<number>;\n\n /**\n * Removes targets with a sequence number equal to or less than the given\n * upper bound, and removes document associations with those targets.\n */\n removeTargets(\n txn: PersistenceTransaction,\n upperBound: ListenSequenceNumber,\n activeTargetIds: ActiveTargets\n ): PersistencePromise<number>;\n}\n\n/**\n * Describes the results of a garbage collection run. `didRun` will be set to\n * `false` if collection was skipped (either it is disabled or the cache size\n * has not hit the threshold). If collection ran, the other fields will be\n * filled in with the details of the results.\n */\nexport interface LruResults {\n readonly didRun: boolean;\n readonly sequenceNumbersCollected: number;\n readonly targetsRemoved: number;\n readonly documentsRemoved: number;\n}\n\n/**\n * Persistence layers intending to use LRU Garbage collection should have\n * reference delegates that implement this interface. This interface defines the\n * operations that the LRU garbage collector needs from the persistence layer.\n */\nexport interface LruDelegate {\n readonly garbageCollector: LruGarbageCollector;\n\n /** Enumerates all the targets in the TargetCache. */\n forEachTarget(\n txn: PersistenceTransaction,\n f: (target: TargetData) => void\n ): PersistencePromise<void>;\n\n getSequenceNumberCount(\n txn: PersistenceTransaction\n ): PersistencePromise<number>;\n\n /**\n * Enumerates sequence numbers for documents not associated with a target.\n * Note that this may include duplicate sequence numbers.\n */\n forEachOrphanedDocumentSequenceNumber(\n txn: PersistenceTransaction,\n f: (sequenceNumber: ListenSequenceNumber) => void\n ): PersistencePromise<void>;\n\n /**\n * Removes all targets that have a sequence number less than or equal to\n * `upperBound`, and are not present in the `activeTargetIds` set.\n *\n * @returns the number of targets removed.\n */\n removeTargets(\n txn: PersistenceTransaction,\n upperBound: ListenSequenceNumber,\n activeTargetIds: ActiveTargets\n ): PersistencePromise<number>;\n\n /**\n * Removes all unreferenced documents from the cache that have a sequence\n * number less than or equal to the given `upperBound`.\n *\n * @returns the number of documents removed.\n */\n removeOrphanedDocuments(\n txn: PersistenceTransaction,\n upperBound: ListenSequenceNumber\n ): PersistencePromise<number>;\n\n getCacheSize(txn: PersistenceTransaction): PersistencePromise<number>;\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { FirestoreError } from '../api';\nimport { ListenSequence } from '../core/listen_sequence';\nimport { ListenSequenceNumber } from '../core/types';\nimport { debugAssert } from '../util/assert';\nimport { AsyncQueue, DelayedOperation, TimerId } from '../util/async_queue';\nimport { getLogLevel, logDebug, LogLevel } from '../util/log';\nimport { primitiveComparator } from '../util/misc';\nimport { SortedSet } from '../util/sorted_set';\n\nimport { ignoreIfPrimaryLeaseLoss, LocalStore } from './local_store';\nimport {\n ActiveTargets,\n GC_DID_NOT_RUN,\n LRU_COLLECTION_DISABLED,\n LruDelegate,\n LruGarbageCollector,\n LruParams,\n LruResults\n} from './lru_garbage_collector';\nimport { Scheduler } from './persistence';\nimport { PersistencePromise } from './persistence_promise';\nimport { PersistenceTransaction } from './persistence_transaction';\nimport { isIndexedDbTransactionError } from './simple_db';\n\nconst LOG_TAG = 'LruGarbageCollector';\n\nexport const LRU_MINIMUM_CACHE_SIZE_BYTES = 1 * 1024 * 1024;\n\n/** How long we wait to try running LRU GC after SDK initialization. */\nconst INITIAL_GC_DELAY_MS = 1 * 60 * 1000;\n/** Minimum amount of time between GC checks, after the first one. */\nconst REGULAR_GC_DELAY_MS = 5 * 60 * 1000;\n\n// The type and comparator for the items contained in the SortedSet used in\n// place of a priority queue for the RollingSequenceNumberBuffer.\ntype BufferEntry = [ListenSequenceNumber, number];\n\nfunction bufferEntryComparator(\n [aSequence, aIndex]: BufferEntry,\n [bSequence, bIndex]: BufferEntry\n): number {\n const seqCmp = primitiveComparator(aSequence, bSequence);\n if (seqCmp === 0) {\n // This order doesn't matter, but we can bias against churn by sorting\n // entries created earlier as less than newer entries.\n return primitiveComparator(aIndex, bIndex);\n } else {\n return seqCmp;\n }\n}\n\n/**\n * Used to calculate the nth sequence number. Keeps a rolling buffer of the\n * lowest n values passed to `addElement`, and finally reports the largest of\n * them in `maxValue`.\n */\nclass RollingSequenceNumberBuffer {\n private buffer: SortedSet<BufferEntry> = new SortedSet<BufferEntry>(\n bufferEntryComparator\n );\n\n private previousIndex = 0;\n\n constructor(private readonly maxElements: number) {}\n\n private nextIndex(): number {\n return ++this.previousIndex;\n }\n\n addElement(sequenceNumber: ListenSequenceNumber): void {\n const entry: BufferEntry = [sequenceNumber, this.nextIndex()];\n if (this.buffer.size < this.maxElements) {\n this.buffer = this.buffer.add(entry);\n } else {\n const highestValue = this.buffer.last()!;\n if (bufferEntryComparator(entry, highestValue) < 0) {\n this.buffer = this.buffer.delete(highestValue).add(entry);\n }\n }\n }\n\n get maxValue(): ListenSequenceNumber {\n // Guaranteed to be non-empty. If we decide we are not collecting any\n // sequence numbers, nthSequenceNumber below short-circuits. If we have\n // decided that we are collecting n sequence numbers, it's because n is some\n // percentage of the existing sequence numbers. That means we should never\n // be in a situation where we are collecting sequence numbers but don't\n // actually have any.\n return this.buffer.last()![0];\n }\n}\n\n/**\n * This class is responsible for the scheduling of LRU garbage collection. It handles checking\n * whether or not GC is enabled, as well as which delay to use before the next run.\n */\nexport class LruScheduler implements Scheduler {\n private gcTask: DelayedOperation<void> | null;\n\n constructor(\n private readonly garbageCollector: LruGarbageCollector,\n private readonly asyncQueue: AsyncQueue,\n private readonly localStore: LocalStore\n ) {\n this.gcTask = null;\n }\n\n start(): void {\n debugAssert(\n this.gcTask === null,\n 'Cannot start an already started LruScheduler'\n );\n if (\n this.garbageCollector.params.cacheSizeCollectionThreshold !==\n LRU_COLLECTION_DISABLED\n ) {\n this.scheduleGC(INITIAL_GC_DELAY_MS);\n }\n }\n\n stop(): void {\n if (this.gcTask) {\n this.gcTask.cancel();\n this.gcTask = null;\n }\n }\n\n get started(): boolean {\n return this.gcTask !== null;\n }\n\n private scheduleGC(delay: number): void {\n debugAssert(\n this.gcTask === null,\n 'Cannot schedule GC while a task is pending'\n );\n logDebug(LOG_TAG, `Garbage collection scheduled in ${delay}ms`);\n this.gcTask = this.asyncQueue.enqueueAfterDelay(\n TimerId.LruGarbageCollection,\n delay,\n async () => {\n this.gcTask = null;\n try {\n await this.localStore.collectGarbage(this.garbageCollector);\n } catch (e) {\n if (isIndexedDbTransactionError(e as Error)) {\n logDebug(\n LOG_TAG,\n 'Ignoring IndexedDB error during garbage collection: ',\n e\n );\n } else {\n await ignoreIfPrimaryLeaseLoss(e as FirestoreError);\n }\n }\n await this.scheduleGC(REGULAR_GC_DELAY_MS);\n }\n );\n }\n}\n\n/** Implements the steps for LRU garbage collection. */\nclass LruGarbageCollectorImpl implements LruGarbageCollector {\n constructor(\n private readonly delegate: LruDelegate,\n readonly params: LruParams\n ) {}\n\n calculateTargetCount(\n txn: PersistenceTransaction,\n percentile: number\n ): PersistencePromise<number> {\n return this.delegate.getSequenceNumberCount(txn).next(targetCount => {\n return Math.floor((percentile / 100.0) * targetCount);\n });\n }\n\n nthSequenceNumber(\n txn: PersistenceTransaction,\n n: number\n ): PersistencePromise<ListenSequenceNumber> {\n if (n === 0) {\n return PersistencePromise.resolve(ListenSequence.INVALID);\n }\n\n const buffer = new RollingSequenceNumberBuffer(n);\n return this.delegate\n .forEachTarget(txn, target => buffer.addElement(target.sequenceNumber))\n .next(() => {\n return this.delegate.forEachOrphanedDocumentSequenceNumber(\n txn,\n sequenceNumber => buffer.addElement(sequenceNumber)\n );\n })\n .next(() => buffer.maxValue);\n }\n\n removeTargets(\n txn: PersistenceTransaction,\n upperBound: ListenSequenceNumber,\n activeTargetIds: ActiveTargets\n ): PersistencePromise<number> {\n return this.delegate.removeTargets(txn, upperBound, activeTargetIds);\n }\n\n removeOrphanedDocuments(\n txn: PersistenceTransaction,\n upperBound: ListenSequenceNumber\n ): PersistencePromise<number> {\n return this.delegate.removeOrphanedDocuments(txn, upperBound);\n }\n\n collect(\n txn: PersistenceTransaction,\n activeTargetIds: ActiveTargets\n ): PersistencePromise<LruResults> {\n if (this.params.cacheSizeCollectionThreshold === LRU_COLLECTION_DISABLED) {\n logDebug('LruGarbageCollector', 'Garbage collection skipped; disabled');\n return PersistencePromise.resolve(GC_DID_NOT_RUN);\n }\n\n return this.getCacheSize(txn).next(cacheSize => {\n if (cacheSize < this.params.cacheSizeCollectionThreshold) {\n logDebug(\n 'LruGarbageCollector',\n `Garbage collection skipped; Cache size ${cacheSize} ` +\n `is lower than threshold ${this.params.cacheSizeCollectionThreshold}`\n );\n return GC_DID_NOT_RUN;\n } else {\n return this.runGarbageCollection(txn, activeTargetIds);\n }\n });\n }\n\n getCacheSize(txn: PersistenceTransaction): PersistencePromise<number> {\n return this.delegate.getCacheSize(txn);\n }\n\n private runGarbageCollection(\n txn: PersistenceTransaction,\n activeTargetIds: ActiveTargets\n ): PersistencePromise<LruResults> {\n let upperBoundSequenceNumber: number;\n let sequenceNumbersToCollect: number, targetsRemoved: number;\n // Timestamps for various pieces of the process\n let countedTargetsTs: number,\n foundUpperBoundTs: number,\n removedTargetsTs: number,\n removedDocumentsTs: number;\n const startTs = Date.now();\n return this.calculateTargetCount(txn, this.params.percentileToCollect)\n .next(sequenceNumbers => {\n // Cap at the configured max\n if (sequenceNumbers > this.params.maximumSequenceNumbersToCollect) {\n logDebug(\n 'LruGarbageCollector',\n 'Capping sequence numbers to collect down ' +\n `to the maximum of ${this.params.maximumSequenceNumbersToCollect} ` +\n `from ${sequenceNumbers}`\n );\n sequenceNumbersToCollect =\n this.params.maximumSequenceNumbersToCollect;\n } else {\n sequenceNumbersToCollect = sequenceNumbers;\n }\n countedTargetsTs = Date.now();\n\n return this.nthSequenceNumber(txn, sequenceNumbersToCollect);\n })\n .next(upperBound => {\n upperBoundSequenceNumber = upperBound;\n foundUpperBoundTs = Date.now();\n\n return this.removeTargets(\n txn,\n upperBoundSequenceNumber,\n activeTargetIds\n );\n })\n .next(numTargetsRemoved => {\n targetsRemoved = numTargetsRemoved;\n removedTargetsTs = Date.now();\n\n return this.removeOrphanedDocuments(txn, upperBoundSequenceNumber);\n })\n .next(documentsRemoved => {\n removedDocumentsTs = Date.now();\n\n if (getLogLevel() <= LogLevel.DEBUG) {\n const desc =\n 'LRU Garbage Collection\\n' +\n `\\tCounted targets in ${countedTargetsTs - startTs}ms\\n` +\n `\\tDetermined least recently used ${sequenceNumbersToCollect} in ` +\n `${foundUpperBoundTs - countedTargetsTs}ms\\n` +\n `\\tRemoved ${targetsRemoved} targets in ` +\n `${removedTargetsTs - foundUpperBoundTs}ms\\n` +\n `\\tRemoved ${documentsRemoved} documents in ` +\n `${removedDocumentsTs - removedTargetsTs}ms\\n` +\n `Total Duration: ${removedDocumentsTs - startTs}ms`;\n logDebug('LruGarbageCollector', desc);\n }\n\n return PersistencePromise.resolve<LruResults>({\n didRun: true,\n sequenceNumbersCollected: sequenceNumbersToCollect,\n targetsRemoved,\n documentsRemoved\n });\n });\n }\n}\n\nexport function newLruGarbageCollector(\n delegate: LruDelegate,\n params: LruParams\n): LruGarbageCollector {\n return new LruGarbageCollectorImpl(delegate, params);\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n// eslint-disable-next-line import/no-extraneous-dependencies\nimport {\n _getProvider,\n _removeServiceInstance,\n FirebaseApp,\n getApp\n} from '@firebase/app';\nimport {\n createMockUserToken,\n EmulatorMockTokenOptions,\n getDefaultEmulatorHostnameAndPort\n} from '@firebase/util';\n\nimport {\n CredentialsProvider,\n EmulatorAuthCredentialsProvider,\n makeAuthCredentialsProvider,\n OAuthToken\n} from '../api/credentials';\nimport { User } from '../auth/user';\nimport { DatabaseId, DEFAULT_DATABASE_NAME } from '../core/database_info';\nimport { Code, FirestoreError } from '../util/error';\nimport { cast } from '../util/input_validation';\nimport { logWarn } from '../util/log';\n\nimport { FirestoreService, removeComponents } from './components';\nimport {\n DEFAULT_HOST,\n FirestoreSettingsImpl,\n PrivateSettings,\n FirestoreSettings\n} from './settings';\n\nexport { EmulatorMockTokenOptions } from '@firebase/util';\n\ndeclare module '@firebase/component' {\n interface NameServiceMapping {\n 'firestore/lite': Firestore;\n }\n}\n\n/**\n * The Cloud Firestore service interface.\n *\n * Do not call this constructor directly. Instead, use {@link (getFirestore:1)}.\n */\nexport class Firestore implements FirestoreService {\n /**\n * Whether it's a Firestore or Firestore Lite instance.\n */\n type: 'firestore-lite' | 'firestore' = 'firestore-lite';\n\n readonly _persistenceKey: string = '(lite)';\n\n private _settings = new FirestoreSettingsImpl({});\n private _settingsFrozen = false;\n\n // A task that is assigned when the terminate() is invoked and resolved when\n // all components have shut down.\n private _terminateTask?: Promise<void>;\n\n /** @hideconstructor */\n constructor(\n public _authCredentials: CredentialsProvider<User>,\n public _appCheckCredentials: CredentialsProvider<string>,\n readonly _databaseId: DatabaseId,\n readonly _app?: FirebaseApp\n ) {}\n\n /**\n * The {@link @firebase/app#FirebaseApp} associated with this `Firestore` service\n * instance.\n */\n get app(): FirebaseApp {\n if (!this._app) {\n throw new FirestoreError(\n Code.FAILED_PRECONDITION,\n \"Firestore was not initialized using the Firebase SDK. 'app' is \" +\n 'not available'\n );\n }\n return this._app;\n }\n\n get _initialized(): boolean {\n return this._settingsFrozen;\n }\n\n get _terminated(): boolean {\n return this._terminateTask !== undefined;\n }\n\n _setSettings(settings: PrivateSettings): void {\n if (this._settingsFrozen) {\n throw new FirestoreError(\n Code.FAILED_PRECONDITION,\n 'Firestore has already been started and its settings can no longer ' +\n 'be changed. You can only modify settings before calling any other ' +\n 'methods on a Firestore object.'\n );\n }\n this._settings = new FirestoreSettingsImpl(settings);\n if (settings.credentials !== undefined) {\n this._authCredentials = makeAuthCredentialsProvider(settings.credentials);\n }\n }\n\n _getSettings(): FirestoreSettingsImpl {\n return this._settings;\n }\n\n _freezeSettings(): FirestoreSettingsImpl {\n this._settingsFrozen = true;\n return this._settings;\n }\n\n _delete(): Promise<void> {\n if (!this._terminateTask) {\n this._terminateTask = this._terminate();\n }\n return this._terminateTask;\n }\n\n /** Returns a JSON-serializable representation of this `Firestore` instance. */\n toJSON(): object {\n return {\n app: this._app,\n databaseId: this._databaseId,\n settings: this._settings\n };\n }\n\n /**\n * Terminates all components used by this client. Subclasses can override\n * this method to clean up their own dependencies, but must also call this\n * method.\n *\n * Only ever called once.\n */\n protected _terminate(): Promise<void> {\n removeComponents(this);\n return Promise.resolve();\n }\n}\n\n/**\n * Initializes a new instance of Cloud Firestore with the provided settings.\n * Can only be called before any other functions, including\n * {@link (getFirestore:1)}. If the custom settings are empty, this function is\n * equivalent to calling {@link (getFirestore:1)}.\n *\n * @param app - The {@link @firebase/app#FirebaseApp} with which the `Firestore` instance will\n * be associated.\n * @param settings - A settings object to configure the `Firestore` instance.\n * @returns A newly initialized `Firestore` instance.\n */\nexport function initializeFirestore(\n app: FirebaseApp,\n settings: FirestoreSettings\n): Firestore;\n/**\n * Initializes a new instance of Cloud Firestore with the provided settings.\n * Can only be called before any other functions, including\n * {@link (getFirestore:1)}. If the custom settings are empty, this function is\n * equivalent to calling {@link (getFirestore:1)}.\n *\n * @param app - The {@link @firebase/app#FirebaseApp} with which the `Firestore` instance will\n * be associated.\n * @param settings - A settings object to configure the `Firestore` instance.\n * @param databaseId - The name of database.\n * @returns A newly initialized `Firestore` instance.\n * @internal\n */\nexport function initializeFirestore(\n app: FirebaseApp,\n settings: FirestoreSettings,\n databaseId?: string\n): Firestore;\nexport function initializeFirestore(\n app: FirebaseApp,\n settings: FirestoreSettings,\n databaseId?: string\n): Firestore {\n if (!databaseId) {\n databaseId = DEFAULT_DATABASE_NAME;\n }\n const provider = _getProvider(app, 'firestore/lite');\n\n if (provider.isInitialized(databaseId)) {\n throw new FirestoreError(\n Code.FAILED_PRECONDITION,\n 'Firestore can only be initialized once per app.'\n );\n }\n\n return provider.initialize({\n options: settings,\n instanceIdentifier: databaseId\n });\n}\n\n/**\n * Returns the existing default {@link Firestore} instance that is associated with the\n * default {@link @firebase/app#FirebaseApp}. If no instance exists, initializes a new\n * instance with default settings.\n *\n * @returns The {@link Firestore} instance of the provided app.\n */\nexport function getFirestore(): Firestore;\n/**\n * Returns the existing default {@link Firestore} instance that is associated with the\n * provided {@link @firebase/app#FirebaseApp}. If no instance exists, initializes a new\n * instance with default settings.\n *\n * @param app - The {@link @firebase/app#FirebaseApp} instance that the returned {@link Firestore}\n * instance is associated with.\n * @returns The {@link Firestore} instance of the provided app.\n */\nexport function getFirestore(app: FirebaseApp): Firestore;\n/**\n * Returns the existing {@link Firestore} instance that is associated with the\n * default {@link @firebase/app#FirebaseApp}. If no instance exists, initializes a new\n * instance with default settings.\n *\n * @param databaseId - The name of database.\n * @returns The {@link Firestore} instance of the provided app.\n * @internal\n */\nexport function getFirestore(databaseId: string): Firestore;\n/**\n * Returns the existing {@link Firestore} instance that is associated with the\n * provided {@link @firebase/app#FirebaseApp}. If no instance exists, initializes a new\n * instance with default settings.\n *\n * @param app - The {@link @firebase/app#FirebaseApp} instance that the returned {@link Firestore}\n * instance is associated with.\n * @param databaseId - The name of database.\n * @returns The {@link Firestore} instance of the provided app.\n * @internal\n */\nexport function getFirestore(app: FirebaseApp, databaseId: string): Firestore;\nexport function getFirestore(\n appOrDatabaseId?: FirebaseApp | string,\n optionalDatabaseId?: string\n): Firestore {\n const app: FirebaseApp =\n typeof appOrDatabaseId === 'object' ? appOrDatabaseId : getApp();\n const databaseId =\n typeof appOrDatabaseId === 'string'\n ? appOrDatabaseId\n : optionalDatabaseId || '(default)';\n const db = _getProvider(app, 'firestore/lite').getImmediate({\n identifier: databaseId\n }) as Firestore;\n if (!db._initialized) {\n const emulator = getDefaultEmulatorHostnameAndPort('firestore');\n if (emulator) {\n connectFirestoreEmulator(db, ...emulator);\n }\n }\n return db;\n}\n\n/**\n * Modify this instance to communicate with the Cloud Firestore emulator.\n *\n * Note: This must be called before this instance has been used to do any\n * operations.\n *\n * @param firestore - The `Firestore` instance to configure to connect to the\n * emulator.\n * @param host - the emulator host (ex: localhost).\n * @param port - the emulator port (ex: 9000).\n * @param options.mockUserToken - the mock auth token to use for unit testing\n * Security Rules.\n */\nexport function connectFirestoreEmulator(\n firestore: Firestore,\n host: string,\n port: number,\n options: {\n mockUserToken?: EmulatorMockTokenOptions | string;\n } = {}\n): void {\n firestore = cast(firestore, Firestore);\n const settings = firestore._getSettings();\n\n if (settings.host !== DEFAULT_HOST && settings.host !== host) {\n logWarn(\n 'Host has been set in both settings() and useEmulator(), emulator host ' +\n 'will be used'\n );\n }\n\n firestore._setSettings({\n ...settings,\n host: `${host}:${port}`,\n ssl: false\n });\n\n if (options.mockUserToken) {\n let token: string;\n let user: User;\n if (typeof options.mockUserToken === 'string') {\n token = options.mockUserToken;\n user = User.MOCK_USER;\n } else {\n // Let createMockUserToken validate first (catches common mistakes like\n // invalid field \"uid\" and missing field \"sub\" / \"user_id\".)\n token = createMockUserToken(\n options.mockUserToken,\n firestore._app?.options.projectId\n );\n const uid = options.mockUserToken.sub || options.mockUserToken.user_id;\n if (!uid) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n \"mockUserToken must contain 'sub' or 'user_id' field!\"\n );\n }\n user = new User(uid);\n }\n\n firestore._authCredentials = new EmulatorAuthCredentialsProvider(\n new OAuthToken(token, user)\n );\n }\n}\n\n/**\n * Terminates the provided `Firestore` instance.\n *\n * After calling `terminate()` only the `clearIndexedDbPersistence()` functions\n * may be used. Any other function will throw a `FirestoreError`. Termination\n * does not cancel any pending writes, and any promises that are awaiting a\n * response from the server will not be resolved.\n *\n * To restart after termination, create a new instance of `Firestore` with\n * {@link (getFirestore:1)}.\n *\n * Note: Under normal circumstances, calling `terminate()` is not required. This\n * function is useful only when you want to force this instance to release all of\n * its resources or in combination with {@link clearIndexedDbPersistence} to\n * ensure that all local state is destroyed between test runs.\n *\n * @param firestore - The `Firestore` instance to terminate.\n * @returns A `Promise` that is resolved when the instance has been successfully\n * terminated.\n */\nexport function terminate(firestore: Firestore): Promise<void> {\n firestore = cast(firestore, Firestore);\n _removeServiceInstance(firestore.app, 'firestore/lite');\n return firestore._delete();\n}\n","/**\n * @license\n * Copyright 2022 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Query } from './reference';\n\n/**\n * Represents an aggregation that can be performed by Firestore.\n */\n// eslint-disable-next-line @typescript-eslint/no-unused-vars\nexport class AggregateField<T> {\n /** A type string to uniquely identify instances of this class. */\n type = 'AggregateField';\n}\n\n/**\n * The union of all `AggregateField` types that are supported by Firestore.\n */\nexport type AggregateFieldType = AggregateField<number>;\n\n/**\n * A type whose property values are all `AggregateField` objects.\n */\nexport interface AggregateSpec {\n [field: string]: AggregateFieldType;\n}\n\n/**\n * A type whose keys are taken from an `AggregateSpec`, and whose values are the\n * result of the aggregation performed by the corresponding `AggregateField`\n * from the input `AggregateSpec`.\n */\nexport type AggregateSpecData<T extends AggregateSpec> = {\n [P in keyof T]: T[P] extends AggregateField<infer U> ? U : never;\n};\n\n/**\n * The results of executing an aggregation query.\n */\nexport class AggregateQuerySnapshot<T extends AggregateSpec> {\n /** A type string to uniquely identify instances of this class. */\n readonly type = 'AggregateQuerySnapshot';\n\n /**\n * The underlying query over which the aggregations recorded in this\n * `AggregateQuerySnapshot` were performed.\n */\n readonly query: Query<unknown>;\n\n /** @hideconstructor */\n constructor(\n query: Query<unknown>,\n private readonly _data: AggregateSpecData<T>\n ) {\n this.query = query;\n }\n\n /**\n * Returns the results of the aggregations performed over the underlying\n * query.\n *\n * The keys of the returned object will be the same as those of the\n * `AggregateSpec` object specified to the aggregation method, and the values\n * will be the corresponding aggregation result.\n *\n * @returns The results of the aggregations performed over the underlying\n * query.\n */\n data(): AggregateSpecData<T> {\n return this._data;\n }\n}\n","/**\n * @license\n * Copyright 2022 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { AbstractUserDataWriter, Query } from '../api';\nimport {\n AggregateField,\n AggregateQuerySnapshot\n} from '../lite-api/aggregate_types';\nimport { Value } from '../protos/firestore_proto_api';\nimport { Datastore, invokeRunAggregationQueryRpc } from '../remote/datastore';\nimport { hardAssert } from '../util/assert';\n\n/**\n * CountQueryRunner encapsulates the logic needed to run the count aggregation\n * queries.\n */\nexport class CountQueryRunner {\n constructor(\n private readonly query: Query<unknown>,\n private readonly datastore: Datastore,\n private readonly userDataWriter: AbstractUserDataWriter\n ) {}\n\n run(): Promise<AggregateQuerySnapshot<{ count: AggregateField<number> }>> {\n return invokeRunAggregationQueryRpc(this.datastore, this.query._query).then(\n result => {\n hardAssert(\n result[0] !== undefined,\n 'Aggregation fields are missing from result.'\n );\n\n const counts = Object.entries(result[0])\n .filter(([key, value]) => key === 'count_alias')\n .map(([key, value]) =>\n this.userDataWriter.convertValue(value as Value)\n );\n\n const countValue = counts[0];\n\n hardAssert(\n typeof countValue === 'number',\n 'Count aggregate field value is not a number: ' + countValue\n );\n\n return Promise.resolve(\n new AggregateQuerySnapshot<{ count: AggregateField<number> }>(\n this.query,\n {\n count: countValue\n }\n )\n );\n }\n );\n }\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { getModularInstance } from '@firebase/util';\n\nimport {\n newQueryForCollectionGroup,\n newQueryForPath,\n Query as InternalQuery,\n queryEquals\n} from '../core/query';\nimport { DocumentKey } from '../model/document_key';\nimport { ResourcePath } from '../model/path';\nimport { Code, FirestoreError } from '../util/error';\nimport {\n cast,\n validateCollectionPath,\n validateDocumentPath,\n validateNonEmptyArgument\n} from '../util/input_validation';\nimport { AutoId } from '../util/misc';\n\nimport { Firestore } from './database';\nimport { FieldPath } from './field_path';\nimport { FieldValue } from './field_value';\nimport { FirestoreDataConverter } from './snapshot';\nimport { NestedUpdateFields, Primitive } from './types';\n\n/**\n * Document data (for use with {@link @firebase/firestore/lite#(setDoc:1)}) consists of fields mapped to\n * values.\n */\nexport interface DocumentData {\n /** A mapping between a field and its value. */\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n [field: string]: any;\n}\n\n/**\n * Similar to Typescript's `Partial<T>`, but allows nested fields to be\n * omitted and FieldValues to be passed in as property values.\n */\nexport type PartialWithFieldValue<T> =\n | Partial<T>\n | (T extends Primitive\n ? T\n : T extends {}\n ? { [K in keyof T]?: PartialWithFieldValue<T[K]> | FieldValue }\n : never);\n\n/**\n * Allows FieldValues to be passed in as a property value while maintaining\n * type safety.\n */\nexport type WithFieldValue<T> =\n | T\n | (T extends Primitive\n ? T\n : T extends {}\n ? { [K in keyof T]: WithFieldValue<T[K]> | FieldValue }\n : never);\n\n/**\n * Update data (for use with {@link (updateDoc:1)}) that consists of field paths\n * (e.g. 'foo' or 'foo.baz') mapped to values. Fields that contain dots\n * reference nested fields within the document. FieldValues can be passed in\n * as property values.\n */\nexport type UpdateData<T> = T extends Primitive\n ? T\n : T extends {}\n ? { [K in keyof T]?: UpdateData<T[K]> | FieldValue } & NestedUpdateFields<T>\n : Partial<T>;\n/**\n * An options object that configures the behavior of {@link @firebase/firestore/lite#(setDoc:1)}, {@link\n * @firebase/firestore/lite#(WriteBatch.set:1)} and {@link @firebase/firestore/lite#(Transaction.set:1)} calls. These calls can be\n * configured to perform granular merges instead of overwriting the target\n * documents in their entirety by providing a `SetOptions` with `merge: true`.\n *\n * @param merge - Changes the behavior of a `setDoc()` call to only replace the\n * values specified in its data argument. Fields omitted from the `setDoc()`\n * call remain untouched. If your input sets any field to an empty map, all\n * nested fields are overwritten.\n * @param mergeFields - Changes the behavior of `setDoc()` calls to only replace\n * the specified field paths. Any field path that is not specified is ignored\n * and remains untouched. If your input sets any field to an empty map, all\n * nested fields are overwritten.\n */\nexport type SetOptions =\n | {\n readonly merge?: boolean;\n }\n | {\n readonly mergeFields?: Array<string | FieldPath>;\n };\n\n/**\n * A `DocumentReference` refers to a document location in a Firestore database\n * and can be used to write, read, or listen to the location. The document at\n * the referenced location may or may not exist.\n */\nexport class DocumentReference<T = DocumentData> {\n /** The type of this Firestore reference. */\n readonly type = 'document';\n\n /**\n * The {@link Firestore} instance the document is in.\n * This is useful for performing transactions, for example.\n */\n readonly firestore: Firestore;\n\n /** @hideconstructor */\n constructor(\n firestore: Firestore,\n /**\n * If provided, the `FirestoreDataConverter` associated with this instance.\n */\n readonly converter: FirestoreDataConverter<T> | null,\n readonly _key: DocumentKey\n ) {\n this.firestore = firestore;\n }\n\n get _path(): ResourcePath {\n return this._key.path;\n }\n\n /**\n * The document's identifier within its collection.\n */\n get id(): string {\n return this._key.path.lastSegment();\n }\n\n /**\n * A string representing the path of the referenced document (relative\n * to the root of the database).\n */\n get path(): string {\n return this._key.path.canonicalString();\n }\n\n /**\n * The collection this `DocumentReference` belongs to.\n */\n get parent(): CollectionReference<T> {\n return new CollectionReference<T>(\n this.firestore,\n this.converter,\n this._key.path.popLast()\n );\n }\n\n /**\n * Applies a custom data converter to this `DocumentReference`, allowing you\n * to use your own custom model objects with Firestore. When you call {@link\n * @firebase/firestore/lite#(setDoc:1)}, {@link @firebase/firestore/lite#getDoc}, etc. with the returned `DocumentReference`\n * instance, the provided converter will convert between Firestore data and\n * your custom type `U`.\n *\n * @param converter - Converts objects to and from Firestore.\n * @returns A `DocumentReference<U>` that uses the provided converter.\n */\n withConverter<U>(converter: FirestoreDataConverter<U>): DocumentReference<U>;\n /**\n * Removes the current converter.\n *\n * @param converter - `null` removes the current converter.\n * @returns A `DocumentReference<DocumentData>` that does not use a converter.\n */\n withConverter(converter: null): DocumentReference<DocumentData>;\n withConverter<U>(\n converter: FirestoreDataConverter<U> | null\n ): DocumentReference<U> {\n return new DocumentReference<U>(this.firestore, converter, this._key);\n }\n}\n\n/**\n * A `Query` refers to a query which you can read or listen to. You can also\n * construct refined `Query` objects by adding filters and ordering.\n */\nexport class Query<T = DocumentData> {\n /** The type of this Firestore reference. */\n readonly type: 'query' | 'collection' = 'query';\n\n /**\n * The `Firestore` instance for the Firestore database (useful for performing\n * transactions, etc.).\n */\n readonly firestore: Firestore;\n\n // This is the lite version of the Query class in the main SDK.\n\n /** @hideconstructor protected */\n constructor(\n firestore: Firestore,\n /**\n * If provided, the `FirestoreDataConverter` associated with this instance.\n */\n readonly converter: FirestoreDataConverter<T> | null,\n readonly _query: InternalQuery\n ) {\n this.firestore = firestore;\n }\n\n /**\n * Removes the current converter.\n *\n * @param converter - `null` removes the current converter.\n * @returns A `Query<DocumentData>` that does not use a converter.\n */\n withConverter(converter: null): Query<DocumentData>;\n /**\n * Applies a custom data converter to this query, allowing you to use your own\n * custom model objects with Firestore. When you call {@link getDocs} with\n * the returned query, the provided converter will convert between Firestore\n * data and your custom type `U`.\n *\n * @param converter - Converts objects to and from Firestore.\n * @returns A `Query<U>` that uses the provided converter.\n */\n withConverter<U>(converter: FirestoreDataConverter<U>): Query<U>;\n withConverter<U>(converter: FirestoreDataConverter<U> | null): Query<U> {\n return new Query<U>(this.firestore, converter, this._query);\n }\n}\n\n/**\n * A `CollectionReference` object can be used for adding documents, getting\n * document references, and querying for documents (using {@link query}).\n */\nexport class CollectionReference<T = DocumentData> extends Query<T> {\n /** The type of this Firestore reference. */\n readonly type = 'collection';\n\n /** @hideconstructor */\n constructor(\n firestore: Firestore,\n converter: FirestoreDataConverter<T> | null,\n readonly _path: ResourcePath\n ) {\n super(firestore, converter, newQueryForPath(_path));\n }\n\n /** The collection's identifier. */\n get id(): string {\n return this._query.path.lastSegment();\n }\n\n /**\n * A string representing the path of the referenced collection (relative\n * to the root of the database).\n */\n get path(): string {\n return this._query.path.canonicalString();\n }\n\n /**\n * A reference to the containing `DocumentReference` if this is a\n * subcollection. If this isn't a subcollection, the reference is null.\n */\n get parent(): DocumentReference<DocumentData> | null {\n const parentPath = this._path.popLast();\n if (parentPath.isEmpty()) {\n return null;\n } else {\n return new DocumentReference(\n this.firestore,\n /* converter= */ null,\n new DocumentKey(parentPath)\n );\n }\n }\n\n /**\n * Applies a custom data converter to this `CollectionReference`, allowing you\n * to use your own custom model objects with Firestore. When you call {@link\n * addDoc} with the returned `CollectionReference` instance, the provided\n * converter will convert between Firestore data and your custom type `U`.\n *\n * @param converter - Converts objects to and from Firestore.\n * @returns A `CollectionReference<U>` that uses the provided converter.\n */\n withConverter<U>(\n converter: FirestoreDataConverter<U>\n ): CollectionReference<U>;\n /**\n * Removes the current converter.\n *\n * @param converter - `null` removes the current converter.\n * @returns A `CollectionReference<DocumentData>` that does not use a\n * converter.\n */\n withConverter(converter: null): CollectionReference<DocumentData>;\n withConverter<U>(\n converter: FirestoreDataConverter<U> | null\n ): CollectionReference<U> {\n return new CollectionReference<U>(this.firestore, converter, this._path);\n }\n}\n\n/**\n * Gets a `CollectionReference` instance that refers to the collection at\n * the specified absolute path.\n *\n * @param firestore - A reference to the root `Firestore` instance.\n * @param path - A slash-separated path to a collection.\n * @param pathSegments - Additional path segments to apply relative to the first\n * argument.\n * @throws If the final path has an even number of segments and does not point\n * to a collection.\n * @returns The `CollectionReference` instance.\n */\nexport function collection(\n firestore: Firestore,\n path: string,\n ...pathSegments: string[]\n): CollectionReference<DocumentData>;\n/**\n * Gets a `CollectionReference` instance that refers to a subcollection of\n * `reference` at the the specified relative path.\n *\n * @param reference - A reference to a collection.\n * @param path - A slash-separated path to a collection.\n * @param pathSegments - Additional path segments to apply relative to the first\n * argument.\n * @throws If the final path has an even number of segments and does not point\n * to a collection.\n * @returns The `CollectionReference` instance.\n */\nexport function collection(\n reference: CollectionReference<unknown>,\n path: string,\n ...pathSegments: string[]\n): CollectionReference<DocumentData>;\n/**\n * Gets a `CollectionReference` instance that refers to a subcollection of\n * `reference` at the the specified relative path.\n *\n * @param reference - A reference to a Firestore document.\n * @param path - A slash-separated path to a collection.\n * @param pathSegments - Additional path segments that will be applied relative\n * to the first argument.\n * @throws If the final path has an even number of segments and does not point\n * to a collection.\n * @returns The `CollectionReference` instance.\n */\nexport function collection(\n reference: DocumentReference,\n path: string,\n ...pathSegments: string[]\n): CollectionReference<DocumentData>;\nexport function collection(\n parent: Firestore | DocumentReference<unknown> | CollectionReference<unknown>,\n path: string,\n ...pathSegments: string[]\n): CollectionReference<DocumentData> {\n parent = getModularInstance(parent);\n\n validateNonEmptyArgument('collection', 'path', path);\n if (parent instanceof Firestore) {\n const absolutePath = ResourcePath.fromString(path, ...pathSegments);\n validateCollectionPath(absolutePath);\n return new CollectionReference(parent, /* converter= */ null, absolutePath);\n } else {\n if (\n !(parent instanceof DocumentReference) &&\n !(parent instanceof CollectionReference)\n ) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n 'Expected first argument to collection() to be a CollectionReference, ' +\n 'a DocumentReference or FirebaseFirestore'\n );\n }\n const absolutePath = parent._path.child(\n ResourcePath.fromString(path, ...pathSegments)\n );\n validateCollectionPath(absolutePath);\n return new CollectionReference(\n parent.firestore,\n /* converter= */ null,\n absolutePath\n );\n }\n}\n\n// TODO(firestorelite): Consider using ErrorFactory -\n// https://github.com/firebase/firebase-js-sdk/blob/0131e1f/packages/util/src/errors.ts#L106\n\n/**\n * Creates and returns a new `Query` instance that includes all documents in the\n * database that are contained in a collection or subcollection with the\n * given `collectionId`.\n *\n * @param firestore - A reference to the root `Firestore` instance.\n * @param collectionId - Identifies the collections to query over. Every\n * collection or subcollection with this ID as the last segment of its path\n * will be included. Cannot contain a slash.\n * @returns The created `Query`.\n */\nexport function collectionGroup(\n firestore: Firestore,\n collectionId: string\n): Query<DocumentData> {\n firestore = cast(firestore, Firestore);\n\n validateNonEmptyArgument('collectionGroup', 'collection id', collectionId);\n if (collectionId.indexOf('/') >= 0) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n `Invalid collection ID '${collectionId}' passed to function ` +\n `collectionGroup(). Collection IDs must not contain '/'.`\n );\n }\n\n return new Query(\n firestore,\n /* converter= */ null,\n newQueryForCollectionGroup(collectionId)\n );\n}\n\n/**\n * Gets a `DocumentReference` instance that refers to the document at the\n * specified absolute path.\n *\n * @param firestore - A reference to the root `Firestore` instance.\n * @param path - A slash-separated path to a document.\n * @param pathSegments - Additional path segments that will be applied relative\n * to the first argument.\n * @throws If the final path has an odd number of segments and does not point to\n * a document.\n * @returns The `DocumentReference` instance.\n */\nexport function doc(\n firestore: Firestore,\n path: string,\n ...pathSegments: string[]\n): DocumentReference<DocumentData>;\n/**\n * Gets a `DocumentReference` instance that refers to a document within\n * `reference` at the specified relative path. If no path is specified, an\n * automatically-generated unique ID will be used for the returned\n * `DocumentReference`.\n *\n * @param reference - A reference to a collection.\n * @param path - A slash-separated path to a document. Has to be omitted to use\n * auto-genrated IDs.\n * @param pathSegments - Additional path segments that will be applied relative\n * to the first argument.\n * @throws If the final path has an odd number of segments and does not point to\n * a document.\n * @returns The `DocumentReference` instance.\n */\nexport function doc<T>(\n reference: CollectionReference<T>,\n path?: string,\n ...pathSegments: string[]\n): DocumentReference<T>;\n/**\n * Gets a `DocumentReference` instance that refers to a document within\n * `reference` at the specified relative path.\n *\n * @param reference - A reference to a Firestore document.\n * @param path - A slash-separated path to a document.\n * @param pathSegments - Additional path segments that will be applied relative\n * to the first argument.\n * @throws If the final path has an odd number of segments and does not point to\n * a document.\n * @returns The `DocumentReference` instance.\n */\nexport function doc(\n reference: DocumentReference<unknown>,\n path: string,\n ...pathSegments: string[]\n): DocumentReference<DocumentData>;\nexport function doc<T>(\n parent: Firestore | CollectionReference<T> | DocumentReference<unknown>,\n path?: string,\n ...pathSegments: string[]\n): DocumentReference {\n parent = getModularInstance(parent);\n\n // We allow omission of 'pathString' but explicitly prohibit passing in both\n // 'undefined' and 'null'.\n if (arguments.length === 1) {\n path = AutoId.newId();\n }\n validateNonEmptyArgument('doc', 'path', path);\n\n if (parent instanceof Firestore) {\n const absolutePath = ResourcePath.fromString(path, ...pathSegments);\n validateDocumentPath(absolutePath);\n return new DocumentReference(\n parent,\n /* converter= */ null,\n new DocumentKey(absolutePath)\n );\n } else {\n if (\n !(parent instanceof DocumentReference) &&\n !(parent instanceof CollectionReference)\n ) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n 'Expected first argument to collection() to be a CollectionReference, ' +\n 'a DocumentReference or FirebaseFirestore'\n );\n }\n const absolutePath = parent._path.child(\n ResourcePath.fromString(path, ...pathSegments)\n );\n validateDocumentPath(absolutePath);\n return new DocumentReference(\n parent.firestore,\n parent instanceof CollectionReference ? parent.converter : null,\n new DocumentKey(absolutePath)\n );\n }\n}\n\n/**\n * Returns true if the provided references are equal.\n *\n * @param left - A reference to compare.\n * @param right - A reference to compare.\n * @returns true if the references point to the same location in the same\n * Firestore database.\n */\nexport function refEqual<T>(\n left: DocumentReference<T> | CollectionReference<T>,\n right: DocumentReference<T> | CollectionReference<T>\n): boolean {\n left = getModularInstance(left);\n right = getModularInstance(right);\n\n if (\n (left instanceof DocumentReference ||\n left instanceof CollectionReference) &&\n (right instanceof DocumentReference || right instanceof CollectionReference)\n ) {\n return (\n left.firestore === right.firestore &&\n left.path === right.path &&\n left.converter === right.converter\n );\n }\n return false;\n}\n\n/**\n * Returns true if the provided queries point to the same collection and apply\n * the same constraints.\n *\n * @param left - A `Query` to compare.\n * @param right - A `Query` to compare.\n * @returns true if the references point to the same location in the same\n * Firestore database.\n */\nexport function queryEqual<T>(left: Query<T>, right: Query<T>): boolean {\n left = getModularInstance(left);\n right = getModularInstance(right);\n\n if (left instanceof Query && right instanceof Query) {\n return (\n left.firestore === right.firestore &&\n queryEquals(left._query, right._query) &&\n left.converter === right.converter\n );\n }\n return false;\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { ByteString } from '../util/byte_string';\nimport { Code, FirestoreError } from '../util/error';\n\n/**\n * An immutable object representing an array of bytes.\n */\nexport class Bytes {\n _byteString: ByteString;\n\n /** @hideconstructor */\n constructor(byteString: ByteString) {\n this._byteString = byteString;\n }\n\n /**\n * Creates a new `Bytes` object from the given Base64 string, converting it to\n * bytes.\n *\n * @param base64 - The Base64 string used to create the `Bytes` object.\n */\n static fromBase64String(base64: string): Bytes {\n try {\n return new Bytes(ByteString.fromBase64String(base64));\n } catch (e) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n 'Failed to construct data from Base64 string: ' + e\n );\n }\n }\n\n /**\n * Creates a new `Bytes` object from the given Uint8Array.\n *\n * @param array - The Uint8Array used to create the `Bytes` object.\n */\n static fromUint8Array(array: Uint8Array): Bytes {\n return new Bytes(ByteString.fromUint8Array(array));\n }\n\n /**\n * Returns the underlying bytes as a Base64-encoded string.\n *\n * @returns The Base64-encoded string created from the `Bytes` object.\n */\n toBase64(): string {\n return this._byteString.toBase64();\n }\n\n /**\n * Returns the underlying bytes in a new `Uint8Array`.\n *\n * @returns The Uint8Array created from the `Bytes` object.\n */\n toUint8Array(): Uint8Array {\n return this._byteString.toUint8Array();\n }\n\n /**\n * Returns a string representation of the `Bytes` object.\n *\n * @returns A string representation of the `Bytes` object.\n */\n toString(): string {\n return 'Bytes(base64: ' + this.toBase64() + ')';\n }\n\n /**\n * Returns true if this `Bytes` object is equal to the provided one.\n *\n * @param other - The `Bytes` object to compare against.\n * @returns true if this `Bytes` object is equal to the provided one.\n */\n isEqual(other: Bytes): boolean {\n return this._byteString.isEqual(other._byteString);\n }\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport {\n DOCUMENT_KEY_NAME,\n FieldPath as InternalFieldPath\n} from '../model/path';\nimport { Code, FirestoreError } from '../util/error';\n\n/**\n * A `FieldPath` refers to a field in a document. The path may consist of a\n * single field name (referring to a top-level field in the document), or a\n * list of field names (referring to a nested field in the document).\n *\n * Create a `FieldPath` by providing field names. If more than one field\n * name is provided, the path will point to a nested field in a document.\n */\nexport class FieldPath {\n /** Internal representation of a Firestore field path. */\n readonly _internalPath: InternalFieldPath;\n\n /**\n * Creates a `FieldPath` from the provided field names. If more than one field\n * name is provided, the path will point to a nested field in a document.\n *\n * @param fieldNames - A list of field names.\n */\n constructor(...fieldNames: string[]) {\n for (let i = 0; i < fieldNames.length; ++i) {\n if (fieldNames[i].length === 0) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n `Invalid field name at argument $(i + 1). ` +\n 'Field names must not be empty.'\n );\n }\n }\n\n this._internalPath = new InternalFieldPath(fieldNames);\n }\n\n /**\n * Returns true if this `FieldPath` is equal to the provided one.\n *\n * @param other - The `FieldPath` to compare against.\n * @returns true if this `FieldPath` is equal to the provided one.\n */\n isEqual(other: FieldPath): boolean {\n return this._internalPath.isEqual(other._internalPath);\n }\n}\n\n/**\n * Returns a special sentinel `FieldPath` to refer to the ID of a document.\n * It can be used in queries to sort or filter by the document ID.\n */\nexport function documentId(): FieldPath {\n return new FieldPath(DOCUMENT_KEY_NAME);\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { ParseContext } from '../api/parse_context';\nimport { FieldTransform } from '../model/mutation';\n\n/**\n * Sentinel values that can be used when writing document fields with `set()`\n * or `update()`.\n */\nexport abstract class FieldValue {\n /**\n * @param _methodName - The public API endpoint that returns this class.\n * @hideconstructor\n */\n constructor(public _methodName: string) {}\n\n /** Compares `FieldValue`s for equality. */\n abstract isEqual(other: FieldValue): boolean;\n abstract _toFieldTransform(context: ParseContext): FieldTransform | null;\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Code, FirestoreError } from '../util/error';\nimport { primitiveComparator } from '../util/misc';\n\n/**\n * An immutable object representing a geographic location in Firestore. The\n * location is represented as latitude/longitude pair.\n *\n * Latitude values are in the range of [-90, 90].\n * Longitude values are in the range of [-180, 180].\n */\nexport class GeoPoint {\n // Prefix with underscore to signal this is a private variable in JS and\n // prevent it showing up for autocompletion when typing latitude or longitude.\n private _lat: number;\n private _long: number;\n\n /**\n * Creates a new immutable `GeoPoint` object with the provided latitude and\n * longitude values.\n * @param latitude - The latitude as number between -90 and 90.\n * @param longitude - The longitude as number between -180 and 180.\n */\n constructor(latitude: number, longitude: number) {\n if (!isFinite(latitude) || latitude < -90 || latitude > 90) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n 'Latitude must be a number between -90 and 90, but was: ' + latitude\n );\n }\n if (!isFinite(longitude) || longitude < -180 || longitude > 180) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n 'Longitude must be a number between -180 and 180, but was: ' + longitude\n );\n }\n\n this._lat = latitude;\n this._long = longitude;\n }\n\n /**\n * The latitude of this `GeoPoint` instance.\n */\n get latitude(): number {\n return this._lat;\n }\n\n /**\n * The longitude of this `GeoPoint` instance.\n */\n get longitude(): number {\n return this._long;\n }\n\n /**\n * Returns true if this `GeoPoint` is equal to the provided one.\n *\n * @param other - The `GeoPoint` to compare against.\n * @returns true if this `GeoPoint` is equal to the provided one.\n */\n isEqual(other: GeoPoint): boolean {\n return this._lat === other._lat && this._long === other._long;\n }\n\n /** Returns a JSON-serializable representation of this GeoPoint. */\n toJSON(): { latitude: number; longitude: number } {\n return { latitude: this._lat, longitude: this._long };\n }\n\n /**\n * Actually private to JS consumers of our API, so this function is prefixed\n * with an underscore.\n */\n _compareTo(other: GeoPoint): number {\n return (\n primitiveComparator(this._lat, other._lat) ||\n primitiveComparator(this._long, other._long)\n );\n }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport {\n DocumentData,\n FieldPath as PublicFieldPath,\n SetOptions\n} from '@firebase/firestore-types';\nimport { Compat, getModularInstance } from '@firebase/util';\n\nimport { ParseContext } from '../api/parse_context';\nimport { DatabaseId } from '../core/database_info';\nimport { DocumentKey } from '../model/document_key';\nimport { FieldMask } from '../model/field_mask';\nimport {\n FieldTransform,\n Mutation,\n PatchMutation,\n Precondition,\n SetMutation\n} from '../model/mutation';\nimport { ObjectValue } from '../model/object_value';\nimport { FieldPath as InternalFieldPath } from '../model/path';\nimport {\n ArrayRemoveTransformOperation,\n ArrayUnionTransformOperation,\n NumericIncrementTransformOperation,\n ServerTimestampTransform\n} from '../model/transform_operation';\nimport { newSerializer } from '../platform/serializer';\nimport {\n MapValue as ProtoMapValue,\n Value as ProtoValue\n} from '../protos/firestore_proto_api';\nimport { toNumber } from '../remote/number_serializer';\nimport {\n JsonProtoSerializer,\n toBytes,\n toResourceName,\n toTimestamp\n} from '../remote/serializer';\nimport { debugAssert, fail } from '../util/assert';\nimport { Code, FirestoreError } from '../util/error';\nimport { isPlainObject, valueDescription } from '../util/input_validation';\nimport { Dict, forEach, isEmpty } from '../util/obj';\n\nimport { Bytes } from './bytes';\nimport { Firestore } from './database';\nimport { FieldPath } from './field_path';\nimport { FieldValue } from './field_value';\nimport { GeoPoint } from './geo_point';\nimport {\n DocumentReference,\n PartialWithFieldValue,\n WithFieldValue\n} from './reference';\nimport { Timestamp } from './timestamp';\n\nconst RESERVED_FIELD_REGEX = /^__.*__$/;\n\n/**\n * An untyped Firestore Data Converter interface that is shared between the\n * lite, firestore-exp and classic SDK.\n */\nexport interface UntypedFirestoreDataConverter<T> {\n toFirestore(modelObject: WithFieldValue<T>): DocumentData;\n toFirestore(\n modelObject: PartialWithFieldValue<T>,\n options: SetOptions\n ): DocumentData;\n fromFirestore(snapshot: unknown, options?: unknown): T;\n}\n\n/** The result of parsing document data (e.g. for a setData call). */\nexport class ParsedSetData {\n constructor(\n readonly data: ObjectValue,\n readonly fieldMask: FieldMask | null,\n readonly fieldTransforms: FieldTransform[]\n ) {}\n\n toMutation(key: DocumentKey, precondition: Precondition): Mutation {\n if (this.fieldMask !== null) {\n return new PatchMutation(\n key,\n this.data,\n this.fieldMask,\n precondition,\n this.fieldTransforms\n );\n } else {\n return new SetMutation(\n key,\n this.data,\n precondition,\n this.fieldTransforms\n );\n }\n }\n}\n\n/** The result of parsing \"update\" data (i.e. for an updateData call). */\nexport class ParsedUpdateData {\n constructor(\n readonly data: ObjectValue,\n // The fieldMask does not include document transforms.\n readonly fieldMask: FieldMask,\n readonly fieldTransforms: FieldTransform[]\n ) {}\n\n toMutation(key: DocumentKey, precondition: Precondition): Mutation {\n return new PatchMutation(\n key,\n this.data,\n this.fieldMask,\n precondition,\n this.fieldTransforms\n );\n }\n}\n\n/*\n * Represents what type of API method provided the data being parsed; useful\n * for determining which error conditions apply during parsing and providing\n * better error messages.\n */\nexport const enum UserDataSource {\n Set,\n Update,\n MergeSet,\n /**\n * Indicates the source is a where clause, cursor bound, arrayUnion()\n * element, etc. Of note, isWrite(source) will return false.\n */\n Argument,\n /**\n * Indicates that the source is an Argument that may directly contain nested\n * arrays (e.g. the operand of an `in` query).\n */\n ArrayArgument\n}\n\nfunction isWrite(dataSource: UserDataSource): boolean {\n switch (dataSource) {\n case UserDataSource.Set: // fall through\n case UserDataSource.MergeSet: // fall through\n case UserDataSource.Update:\n return true;\n case UserDataSource.Argument:\n case UserDataSource.ArrayArgument:\n return false;\n default:\n throw fail(`Unexpected case for UserDataSource: ${dataSource}`);\n }\n}\n\n/** Contains the settings that are mutated as we parse user data. */\ninterface ContextSettings {\n /** Indicates what kind of API method this data came from. */\n readonly dataSource: UserDataSource;\n /** The name of the method the user called to create the ParseContext. */\n readonly methodName: string;\n /** The document the user is attempting to modify, if that applies. */\n readonly targetDoc?: DocumentKey;\n /**\n * A path within the object being parsed. This could be an empty path (in\n * which case the context represents the root of the data being parsed), or a\n * nonempty path (indicating the context represents a nested location within\n * the data).\n */\n readonly path?: InternalFieldPath;\n /**\n * Whether or not this context corresponds to an element of an array.\n * If not set, elements are treated as if they were outside of arrays.\n */\n readonly arrayElement?: boolean;\n /**\n * Whether or not a converter was specified in this context. If true, error\n * messages will reference the converter when invalid data is provided.\n */\n readonly hasConverter?: boolean;\n}\n\n/** A \"context\" object passed around while parsing user data. */\nclass ParseContextImpl implements ParseContext {\n readonly fieldTransforms: FieldTransform[];\n readonly fieldMask: InternalFieldPath[];\n /**\n * Initializes a ParseContext with the given source and path.\n *\n * @param settings - The settings for the parser.\n * @param databaseId - The database ID of the Firestore instance.\n * @param serializer - The serializer to use to generate the Value proto.\n * @param ignoreUndefinedProperties - Whether to ignore undefined properties\n * rather than throw.\n * @param fieldTransforms - A mutable list of field transforms encountered\n * while parsing the data.\n * @param fieldMask - A mutable list of field paths encountered while parsing\n * the data.\n *\n * TODO(b/34871131): We don't support array paths right now, so path can be\n * null to indicate the context represents any location within an array (in\n * which case certain features will not work and errors will be somewhat\n * compromised).\n */\n constructor(\n readonly settings: ContextSettings,\n readonly databaseId: DatabaseId,\n readonly serializer: JsonProtoSerializer,\n readonly ignoreUndefinedProperties: boolean,\n fieldTransforms?: FieldTransform[],\n fieldMask?: InternalFieldPath[]\n ) {\n // Minor hack: If fieldTransforms is undefined, we assume this is an\n // external call and we need to validate the entire path.\n if (fieldTransforms === undefined) {\n this.validatePath();\n }\n this.fieldTransforms = fieldTransforms || [];\n this.fieldMask = fieldMask || [];\n }\n\n get path(): InternalFieldPath | undefined {\n return this.settings.path;\n }\n\n get dataSource(): UserDataSource {\n return this.settings.dataSource;\n }\n\n /** Returns a new context with the specified settings overwritten. */\n contextWith(configuration: Partial<ContextSettings>): ParseContextImpl {\n return new ParseContextImpl(\n { ...this.settings, ...configuration },\n this.databaseId,\n this.serializer,\n this.ignoreUndefinedProperties,\n this.fieldTransforms,\n this.fieldMask\n );\n }\n\n childContextForField(field: string): ParseContextImpl {\n const childPath = this.path?.child(field);\n const context = this.contextWith({ path: childPath, arrayElement: false });\n context.validatePathSegment(field);\n return context;\n }\n\n childContextForFieldPath(field: InternalFieldPath): ParseContextImpl {\n const childPath = this.path?.child(field);\n const context = this.contextWith({ path: childPath, arrayElement: false });\n context.validatePath();\n return context;\n }\n\n childContextForArray(index: number): ParseContextImpl {\n // TODO(b/34871131): We don't support array paths right now; so make path\n // undefined.\n return this.contextWith({ path: undefined, arrayElement: true });\n }\n\n createError(reason: string): FirestoreError {\n return createError(\n reason,\n this.settings.methodName,\n this.settings.hasConverter || false,\n this.path,\n this.settings.targetDoc\n );\n }\n\n /** Returns 'true' if 'fieldPath' was traversed when creating this context. */\n contains(fieldPath: InternalFieldPath): boolean {\n return (\n this.fieldMask.find(field => fieldPath.isPrefixOf(field)) !== undefined ||\n this.fieldTransforms.find(transform =>\n fieldPath.isPrefixOf(transform.field)\n ) !== undefined\n );\n }\n\n private validatePath(): void {\n // TODO(b/34871131): Remove null check once we have proper paths for fields\n // within arrays.\n if (!this.path) {\n return;\n }\n for (let i = 0; i < this.path.length; i++) {\n this.validatePathSegment(this.path.get(i));\n }\n }\n\n private validatePathSegment(segment: string): void {\n if (segment.length === 0) {\n throw this.createError('Document fields must not be empty');\n }\n if (isWrite(this.dataSource) && RESERVED_FIELD_REGEX.test(segment)) {\n throw this.createError('Document fields cannot begin and end with \"__\"');\n }\n }\n}\n\n/**\n * Helper for parsing raw user input (provided via the API) into internal model\n * classes.\n */\nexport class UserDataReader {\n private readonly serializer: JsonProtoSerializer;\n\n constructor(\n private readonly databaseId: DatabaseId,\n private readonly ignoreUndefinedProperties: boolean,\n serializer?: JsonProtoSerializer\n ) {\n this.serializer = serializer || newSerializer(databaseId);\n }\n\n /** Creates a new top-level parse context. */\n createContext(\n dataSource: UserDataSource,\n methodName: string,\n targetDoc?: DocumentKey,\n hasConverter = false\n ): ParseContextImpl {\n return new ParseContextImpl(\n {\n dataSource,\n methodName,\n targetDoc,\n path: InternalFieldPath.emptyPath(),\n arrayElement: false,\n hasConverter\n },\n this.databaseId,\n this.serializer,\n this.ignoreUndefinedProperties\n );\n }\n}\n\nexport function newUserDataReader(firestore: Firestore): UserDataReader {\n const settings = firestore._freezeSettings();\n const serializer = newSerializer(firestore._databaseId);\n return new UserDataReader(\n firestore._databaseId,\n !!settings.ignoreUndefinedProperties,\n serializer\n );\n}\n\n/** Parse document data from a set() call. */\nexport function parseSetData(\n userDataReader: UserDataReader,\n methodName: string,\n targetDoc: DocumentKey,\n input: unknown,\n hasConverter: boolean,\n options: SetOptions = {}\n): ParsedSetData {\n const context = userDataReader.createContext(\n options.merge || options.mergeFields\n ? UserDataSource.MergeSet\n : UserDataSource.Set,\n methodName,\n targetDoc,\n hasConverter\n );\n validatePlainObject('Data must be an object, but it was:', context, input);\n const updateData = parseObject(input, context)!;\n\n let fieldMask: FieldMask | null;\n let fieldTransforms: FieldTransform[];\n\n if (options.merge) {\n fieldMask = new FieldMask(context.fieldMask);\n fieldTransforms = context.fieldTransforms;\n } else if (options.mergeFields) {\n const validatedFieldPaths: InternalFieldPath[] = [];\n\n for (const stringOrFieldPath of options.mergeFields) {\n const fieldPath = fieldPathFromArgument(\n methodName,\n stringOrFieldPath,\n targetDoc\n );\n if (!context.contains(fieldPath)) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n `Field '${fieldPath}' is specified in your field mask but missing from your input data.`\n );\n }\n\n if (!fieldMaskContains(validatedFieldPaths, fieldPath)) {\n validatedFieldPaths.push(fieldPath);\n }\n }\n\n fieldMask = new FieldMask(validatedFieldPaths);\n fieldTransforms = context.fieldTransforms.filter(transform =>\n fieldMask!.covers(transform.field)\n );\n } else {\n fieldMask = null;\n fieldTransforms = context.fieldTransforms;\n }\n\n return new ParsedSetData(\n new ObjectValue(updateData),\n fieldMask,\n fieldTransforms\n );\n}\n\nexport class DeleteFieldValueImpl extends FieldValue {\n _toFieldTransform(context: ParseContextImpl): null {\n if (context.dataSource === UserDataSource.MergeSet) {\n // No transform to add for a delete, but we need to add it to our\n // fieldMask so it gets deleted.\n context.fieldMask.push(context.path!);\n } else if (context.dataSource === UserDataSource.Update) {\n debugAssert(\n context.path!.length > 0,\n `${this._methodName}() at the top level should have already ` +\n 'been handled.'\n );\n throw context.createError(\n `${this._methodName}() can only appear at the top level ` +\n 'of your update data'\n );\n } else {\n // We shouldn't encounter delete sentinels for queries or non-merge set() calls.\n throw context.createError(\n `${this._methodName}() cannot be used with set() unless you pass ` +\n '{merge:true}'\n );\n }\n return null;\n }\n\n isEqual(other: FieldValue): boolean {\n return other instanceof DeleteFieldValueImpl;\n }\n}\n\n/**\n * Creates a child context for parsing SerializableFieldValues.\n *\n * This is different than calling `ParseContext.contextWith` because it keeps\n * the fieldTransforms and fieldMask separate.\n *\n * The created context has its `dataSource` set to `UserDataSource.Argument`.\n * Although these values are used with writes, any elements in these FieldValues\n * are not considered writes since they cannot contain any FieldValue sentinels,\n * etc.\n *\n * @param fieldValue - The sentinel FieldValue for which to create a child\n * context.\n * @param context - The parent context.\n * @param arrayElement - Whether or not the FieldValue has an array.\n */\nfunction createSentinelChildContext(\n fieldValue: FieldValue,\n context: ParseContextImpl,\n arrayElement: boolean\n): ParseContextImpl {\n return new ParseContextImpl(\n {\n dataSource: UserDataSource.Argument,\n targetDoc: context.settings.targetDoc,\n methodName: fieldValue._methodName,\n arrayElement\n },\n context.databaseId,\n context.serializer,\n context.ignoreUndefinedProperties\n );\n}\n\nexport class ServerTimestampFieldValueImpl extends FieldValue {\n _toFieldTransform(context: ParseContextImpl): FieldTransform {\n return new FieldTransform(context.path!, new ServerTimestampTransform());\n }\n\n isEqual(other: FieldValue): boolean {\n return other instanceof ServerTimestampFieldValueImpl;\n }\n}\n\nexport class ArrayUnionFieldValueImpl extends FieldValue {\n constructor(methodName: string, private readonly _elements: unknown[]) {\n super(methodName);\n }\n\n _toFieldTransform(context: ParseContextImpl): FieldTransform {\n const parseContext = createSentinelChildContext(\n this,\n context,\n /*array=*/ true\n );\n const parsedElements = this._elements.map(\n element => parseData(element, parseContext)!\n );\n const arrayUnion = new ArrayUnionTransformOperation(parsedElements);\n return new FieldTransform(context.path!, arrayUnion);\n }\n\n isEqual(other: FieldValue): boolean {\n // TODO(mrschmidt): Implement isEquals\n return this === other;\n }\n}\n\nexport class ArrayRemoveFieldValueImpl extends FieldValue {\n constructor(methodName: string, readonly _elements: unknown[]) {\n super(methodName);\n }\n\n _toFieldTransform(context: ParseContextImpl): FieldTransform {\n const parseContext = createSentinelChildContext(\n this,\n context,\n /*array=*/ true\n );\n const parsedElements = this._elements.map(\n element => parseData(element, parseContext)!\n );\n const arrayUnion = new ArrayRemoveTransformOperation(parsedElements);\n return new FieldTransform(context.path!, arrayUnion);\n }\n\n isEqual(other: FieldValue): boolean {\n // TODO(mrschmidt): Implement isEquals\n return this === other;\n }\n}\n\nexport class NumericIncrementFieldValueImpl extends FieldValue {\n constructor(methodName: string, private readonly _operand: number) {\n super(methodName);\n }\n\n _toFieldTransform(context: ParseContextImpl): FieldTransform {\n const numericIncrement = new NumericIncrementTransformOperation(\n context.serializer,\n toNumber(context.serializer, this._operand)\n );\n return new FieldTransform(context.path!, numericIncrement);\n }\n\n isEqual(other: FieldValue): boolean {\n // TODO(mrschmidt): Implement isEquals\n return this === other;\n }\n}\n\n/** Parse update data from an update() call. */\nexport function parseUpdateData(\n userDataReader: UserDataReader,\n methodName: string,\n targetDoc: DocumentKey,\n input: unknown\n): ParsedUpdateData {\n const context = userDataReader.createContext(\n UserDataSource.Update,\n methodName,\n targetDoc\n );\n validatePlainObject('Data must be an object, but it was:', context, input);\n\n const fieldMaskPaths: InternalFieldPath[] = [];\n const updateData = ObjectValue.empty();\n forEach(input as Dict<unknown>, (key, value) => {\n const path = fieldPathFromDotSeparatedString(methodName, key, targetDoc);\n\n // For Compat types, we have to \"extract\" the underlying types before\n // performing validation.\n value = getModularInstance(value);\n\n const childContext = context.childContextForFieldPath(path);\n if (value instanceof DeleteFieldValueImpl) {\n // Add it to the field mask, but don't add anything to updateData.\n fieldMaskPaths.push(path);\n } else {\n const parsedValue = parseData(value, childContext);\n if (parsedValue != null) {\n fieldMaskPaths.push(path);\n updateData.set(path, parsedValue);\n }\n }\n });\n\n const mask = new FieldMask(fieldMaskPaths);\n return new ParsedUpdateData(updateData, mask, context.fieldTransforms);\n}\n\n/** Parse update data from a list of field/value arguments. */\nexport function parseUpdateVarargs(\n userDataReader: UserDataReader,\n methodName: string,\n targetDoc: DocumentKey,\n field: string | PublicFieldPath | Compat<PublicFieldPath>,\n value: unknown,\n moreFieldsAndValues: unknown[]\n): ParsedUpdateData {\n const context = userDataReader.createContext(\n UserDataSource.Update,\n methodName,\n targetDoc\n );\n const keys = [fieldPathFromArgument(methodName, field, targetDoc)];\n const values = [value];\n\n if (moreFieldsAndValues.length % 2 !== 0) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n `Function ${methodName}() needs to be called with an even number ` +\n 'of arguments that alternate between field names and values.'\n );\n }\n\n for (let i = 0; i < moreFieldsAndValues.length; i += 2) {\n keys.push(\n fieldPathFromArgument(\n methodName,\n moreFieldsAndValues[i] as string | PublicFieldPath\n )\n );\n values.push(moreFieldsAndValues[i + 1]);\n }\n\n const fieldMaskPaths: InternalFieldPath[] = [];\n const updateData = ObjectValue.empty();\n\n // We iterate in reverse order to pick the last value for a field if the\n // user specified the field multiple times.\n for (let i = keys.length - 1; i >= 0; --i) {\n if (!fieldMaskContains(fieldMaskPaths, keys[i])) {\n const path = keys[i];\n let value = values[i];\n\n // For Compat types, we have to \"extract\" the underlying types before\n // performing validation.\n value = getModularInstance(value);\n\n const childContext = context.childContextForFieldPath(path);\n if (value instanceof DeleteFieldValueImpl) {\n // Add it to the field mask, but don't add anything to updateData.\n fieldMaskPaths.push(path);\n } else {\n const parsedValue = parseData(value, childContext);\n if (parsedValue != null) {\n fieldMaskPaths.push(path);\n updateData.set(path, parsedValue);\n }\n }\n }\n }\n\n const mask = new FieldMask(fieldMaskPaths);\n return new ParsedUpdateData(updateData, mask, context.fieldTransforms);\n}\n\n/**\n * Parse a \"query value\" (e.g. value in a where filter or a value in a cursor\n * bound).\n *\n * @param allowArrays - Whether the query value is an array that may directly\n * contain additional arrays (e.g. the operand of an `in` query).\n */\nexport function parseQueryValue(\n userDataReader: UserDataReader,\n methodName: string,\n input: unknown,\n allowArrays = false\n): ProtoValue {\n const context = userDataReader.createContext(\n allowArrays ? UserDataSource.ArrayArgument : UserDataSource.Argument,\n methodName\n );\n const parsed = parseData(input, context);\n debugAssert(parsed != null, 'Parsed data should not be null.');\n debugAssert(\n context.fieldTransforms.length === 0,\n 'Field transforms should have been disallowed.'\n );\n return parsed;\n}\n\n/**\n * Parses user data to Protobuf Values.\n *\n * @param input - Data to be parsed.\n * @param context - A context object representing the current path being parsed,\n * the source of the data being parsed, etc.\n * @returns The parsed value, or null if the value was a FieldValue sentinel\n * that should not be included in the resulting parsed data.\n */\nexport function parseData(\n input: unknown,\n context: ParseContextImpl\n): ProtoValue | null {\n // Unwrap the API type from the Compat SDK. This will return the API type\n // from firestore-exp.\n input = getModularInstance(input);\n\n if (looksLikeJsonObject(input)) {\n validatePlainObject('Unsupported field value:', context, input);\n return parseObject(input, context);\n } else if (input instanceof FieldValue) {\n // FieldValues usually parse into transforms (except deleteField())\n // in which case we do not want to include this field in our parsed data\n // (as doing so will overwrite the field directly prior to the transform\n // trying to transform it). So we don't add this location to\n // context.fieldMask and we return null as our parsing result.\n parseSentinelFieldValue(input, context);\n return null;\n } else if (input === undefined && context.ignoreUndefinedProperties) {\n // If the input is undefined it can never participate in the fieldMask, so\n // don't handle this below. If `ignoreUndefinedProperties` is false,\n // `parseScalarValue` will reject an undefined value.\n return null;\n } else {\n // If context.path is null we are inside an array and we don't support\n // field mask paths more granular than the top-level array.\n if (context.path) {\n context.fieldMask.push(context.path);\n }\n\n if (input instanceof Array) {\n // TODO(b/34871131): Include the path containing the array in the error\n // message.\n // In the case of IN queries, the parsed data is an array (representing\n // the set of values to be included for the IN query) that may directly\n // contain additional arrays (each representing an individual field\n // value), so we disable this validation.\n if (\n context.settings.arrayElement &&\n context.dataSource !== UserDataSource.ArrayArgument\n ) {\n throw context.createError('Nested arrays are not supported');\n }\n return parseArray(input as unknown[], context);\n } else {\n return parseScalarValue(input, context);\n }\n }\n}\n\nfunction parseObject(\n obj: Dict<unknown>,\n context: ParseContextImpl\n): { mapValue: ProtoMapValue } {\n const fields: Dict<ProtoValue> = {};\n\n if (isEmpty(obj)) {\n // If we encounter an empty object, we explicitly add it to the update\n // mask to ensure that the server creates a map entry.\n if (context.path && context.path.length > 0) {\n context.fieldMask.push(context.path);\n }\n } else {\n forEach(obj, (key: string, val: unknown) => {\n const parsedValue = parseData(val, context.childContextForField(key));\n if (parsedValue != null) {\n fields[key] = parsedValue;\n }\n });\n }\n\n return { mapValue: { fields } };\n}\n\nfunction parseArray(array: unknown[], context: ParseContextImpl): ProtoValue {\n const values: ProtoValue[] = [];\n let entryIndex = 0;\n for (const entry of array) {\n let parsedEntry = parseData(\n entry,\n context.childContextForArray(entryIndex)\n );\n if (parsedEntry == null) {\n // Just include nulls in the array for fields being replaced with a\n // sentinel.\n parsedEntry = { nullValue: 'NULL_VALUE' };\n }\n values.push(parsedEntry);\n entryIndex++;\n }\n return { arrayValue: { values } };\n}\n\n/**\n * \"Parses\" the provided FieldValueImpl, adding any necessary transforms to\n * context.fieldTransforms.\n */\nfunction parseSentinelFieldValue(\n value: FieldValue,\n context: ParseContextImpl\n): void {\n // Sentinels are only supported with writes, and not within arrays.\n if (!isWrite(context.dataSource)) {\n throw context.createError(\n `${value._methodName}() can only be used with update() and set()`\n );\n }\n if (!context.path) {\n throw context.createError(\n `${value._methodName}() is not currently supported inside arrays`\n );\n }\n\n const fieldTransform = value._toFieldTransform(context);\n if (fieldTransform) {\n context.fieldTransforms.push(fieldTransform);\n }\n}\n\n/**\n * Helper to parse a scalar value (i.e. not an Object, Array, or FieldValue)\n *\n * @returns The parsed value\n */\nfunction parseScalarValue(\n value: unknown,\n context: ParseContextImpl\n): ProtoValue | null {\n value = getModularInstance(value);\n\n if (value === null) {\n return { nullValue: 'NULL_VALUE' };\n } else if (typeof value === 'number') {\n return toNumber(context.serializer, value);\n } else if (typeof value === 'boolean') {\n return { booleanValue: value };\n } else if (typeof value === 'string') {\n return { stringValue: value };\n } else if (value instanceof Date) {\n const timestamp = Timestamp.fromDate(value);\n return {\n timestampValue: toTimestamp(context.serializer, timestamp)\n };\n } else if (value instanceof Timestamp) {\n // Firestore backend truncates precision down to microseconds. To ensure\n // offline mode works the same with regards to truncation, perform the\n // truncation immediately without waiting for the backend to do that.\n const timestamp = new Timestamp(\n value.seconds,\n Math.floor(value.nanoseconds / 1000) * 1000\n );\n return {\n timestampValue: toTimestamp(context.serializer, timestamp)\n };\n } else if (value instanceof GeoPoint) {\n return {\n geoPointValue: {\n latitude: value.latitude,\n longitude: value.longitude\n }\n };\n } else if (value instanceof Bytes) {\n return { bytesValue: toBytes(context.serializer, value._byteString) };\n } else if (value instanceof DocumentReference) {\n const thisDb = context.databaseId;\n const otherDb = value.firestore._databaseId;\n if (!otherDb.isEqual(thisDb)) {\n throw context.createError(\n 'Document reference is for database ' +\n `${otherDb.projectId}/${otherDb.database} but should be ` +\n `for database ${thisDb.projectId}/${thisDb.database}`\n );\n }\n return {\n referenceValue: toResourceName(\n value.firestore._databaseId || context.databaseId,\n value._key.path\n )\n };\n } else {\n throw context.createError(\n `Unsupported field value: ${valueDescription(value)}`\n );\n }\n}\n\n/**\n * Checks whether an object looks like a JSON object that should be converted\n * into a struct. Normal class/prototype instances are considered to look like\n * JSON objects since they should be converted to a struct value. Arrays, Dates,\n * GeoPoints, etc. are not considered to look like JSON objects since they map\n * to specific FieldValue types other than ObjectValue.\n */\nfunction looksLikeJsonObject(input: unknown): boolean {\n return (\n typeof input === 'object' &&\n input !== null &&\n !(input instanceof Array) &&\n !(input instanceof Date) &&\n !(input instanceof Timestamp) &&\n !(input instanceof GeoPoint) &&\n !(input instanceof Bytes) &&\n !(input instanceof DocumentReference) &&\n !(input instanceof FieldValue)\n );\n}\n\nfunction validatePlainObject(\n message: string,\n context: ParseContextImpl,\n input: unknown\n): asserts input is Dict<unknown> {\n if (!looksLikeJsonObject(input) || !isPlainObject(input)) {\n const description = valueDescription(input);\n if (description === 'an object') {\n // Massage the error if it was an object.\n throw context.createError(message + ' a custom object');\n } else {\n throw context.createError(message + ' ' + description);\n }\n }\n}\n\n/**\n * Helper that calls fromDotSeparatedString() but wraps any error thrown.\n */\nexport function fieldPathFromArgument(\n methodName: string,\n path: string | PublicFieldPath | Compat<PublicFieldPath>,\n targetDoc?: DocumentKey\n): InternalFieldPath {\n // If required, replace the FieldPath Compat class with with the firestore-exp\n // FieldPath.\n path = getModularInstance(path);\n\n if (path instanceof FieldPath) {\n return path._internalPath;\n } else if (typeof path === 'string') {\n return fieldPathFromDotSeparatedString(methodName, path);\n } else {\n const message = 'Field path arguments must be of type string or ';\n throw createError(\n message,\n methodName,\n /* hasConverter= */ false,\n /* path= */ undefined,\n targetDoc\n );\n }\n}\n\n/**\n * Matches any characters in a field path string that are reserved.\n */\nconst FIELD_PATH_RESERVED = new RegExp('[~\\\\*/\\\\[\\\\]]');\n\n/**\n * Wraps fromDotSeparatedString with an error message about the method that\n * was thrown.\n * @param methodName - The publicly visible method name\n * @param path - The dot-separated string form of a field path which will be\n * split on dots.\n * @param targetDoc - The document against which the field path will be\n * evaluated.\n */\nexport function fieldPathFromDotSeparatedString(\n methodName: string,\n path: string,\n targetDoc?: DocumentKey\n): InternalFieldPath {\n const found = path.search(FIELD_PATH_RESERVED);\n if (found >= 0) {\n throw createError(\n `Invalid field path (${path}). Paths must not contain ` +\n `'~', '*', '/', '[', or ']'`,\n methodName,\n /* hasConverter= */ false,\n /* path= */ undefined,\n targetDoc\n );\n }\n\n try {\n return new FieldPath(...path.split('.'))._internalPath;\n } catch (e) {\n throw createError(\n `Invalid field path (${path}). Paths must not be empty, ` +\n `begin with '.', end with '.', or contain '..'`,\n methodName,\n /* hasConverter= */ false,\n /* path= */ undefined,\n targetDoc\n );\n }\n}\n\nfunction createError(\n reason: string,\n methodName: string,\n hasConverter: boolean,\n path?: InternalFieldPath,\n targetDoc?: DocumentKey\n): FirestoreError {\n const hasPath = path && !path.isEmpty();\n const hasDocument = targetDoc !== undefined;\n let message = `Function ${methodName}() called with invalid data`;\n if (hasConverter) {\n message += ' (via `toFirestore()`)';\n }\n message += '. ';\n\n let description = '';\n if (hasPath || hasDocument) {\n description += ' (found';\n\n if (hasPath) {\n description += ` in field ${path}`;\n }\n if (hasDocument) {\n description += ` in document ${targetDoc}`;\n }\n description += ')';\n }\n\n return new FirestoreError(\n Code.INVALID_ARGUMENT,\n message + reason + description\n );\n}\n\n/** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */\nfunction fieldMaskContains(\n haystack: InternalFieldPath[],\n needle: InternalFieldPath\n): boolean {\n return haystack.some(v => v.isEqual(needle));\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Compat, getModularInstance } from '@firebase/util';\n\nimport { Document } from '../model/document';\nimport { DocumentKey } from '../model/document_key';\nimport { FieldPath as InternalFieldPath } from '../model/path';\nimport { arrayEquals } from '../util/misc';\n\nimport { Firestore } from './database';\nimport { FieldPath } from './field_path';\nimport {\n DocumentData,\n DocumentReference,\n PartialWithFieldValue,\n Query,\n queryEqual,\n SetOptions,\n WithFieldValue\n} from './reference';\nimport {\n fieldPathFromDotSeparatedString,\n UntypedFirestoreDataConverter\n} from './user_data_reader';\nimport { AbstractUserDataWriter } from './user_data_writer';\n\n/**\n * Converter used by `withConverter()` to transform user objects of type `T`\n * into Firestore data.\n *\n * Using the converter allows you to specify generic type arguments when\n * storing and retrieving objects from Firestore.\n *\n * @example\n * ```typescript\n * class Post {\n * constructor(readonly title: string, readonly author: string) {}\n *\n * toString(): string {\n * return this.title + ', by ' + this.author;\n * }\n * }\n *\n * const postConverter = {\n * toFirestore(post: WithFieldValue<Post>): DocumentData {\n * return {title: post.title, author: post.author};\n * },\n * fromFirestore(snapshot: QueryDocumentSnapshot): Post {\n * const data = snapshot.data(options)!;\n * return new Post(data.title, data.author);\n * }\n * };\n *\n * const postSnap = await firebase.firestore()\n * .collection('posts')\n * .withConverter(postConverter)\n * .doc().get();\n * const post = postSnap.data();\n * if (post !== undefined) {\n * post.title; // string\n * post.toString(); // Should be defined\n * post.someNonExistentProperty; // TS error\n * }\n * ```\n */\nexport interface FirestoreDataConverter<T> {\n /**\n * Called by the Firestore SDK to convert a custom model object of type `T`\n * into a plain Javascript object (suitable for writing directly to the\n * Firestore database). Used with {@link @firebase/firestore/lite#(setDoc:1)}, {@link @firebase/firestore/lite#(WriteBatch.set:1)}\n * and {@link @firebase/firestore/lite#(Transaction.set:1)}.\n *\n * The `WithFieldValue<T>` type extends `T` to also allow FieldValues such as\n * {@link (deleteField:1)} to be used as property values.\n */\n toFirestore(modelObject: WithFieldValue<T>): DocumentData;\n\n /**\n * Called by the Firestore SDK to convert a custom model object of type `T`\n * into a plain Javascript object (suitable for writing directly to the\n * Firestore database). Used with {@link @firebase/firestore/lite#(setDoc:1)}, {@link @firebase/firestore/lite#(WriteBatch.set:1)}\n * and {@link @firebase/firestore/lite#(Transaction.set:1)} with `merge:true` or `mergeFields`.\n *\n * The `PartialWithFieldValue<T>` type extends `Partial<T>` to allow\n * FieldValues such as {@link (arrayUnion:1)} to be used as property values.\n * It also supports nested `Partial` by allowing nested fields to be\n * omitted.\n */\n toFirestore(\n modelObject: PartialWithFieldValue<T>,\n options: SetOptions\n ): DocumentData;\n\n /**\n * Called by the Firestore SDK to convert Firestore data into an object of\n * type T. You can access your data by calling: `snapshot.data()`.\n *\n * @param snapshot - A `QueryDocumentSnapshot` containing your data and\n * metadata.\n */\n fromFirestore(snapshot: QueryDocumentSnapshot<DocumentData>): T;\n}\n\n/**\n * A `DocumentSnapshot` contains data read from a document in your Firestore\n * database. The data can be extracted with `.data()` or `.get(<field>)` to\n * get a specific field.\n *\n * For a `DocumentSnapshot` that points to a non-existing document, any data\n * access will return 'undefined'. You can use the `exists()` method to\n * explicitly verify a document's existence.\n */\nexport class DocumentSnapshot<T = DocumentData> {\n // Note: This class is stripped down version of the DocumentSnapshot in\n // the legacy SDK. The changes are:\n // - No support for SnapshotMetadata.\n // - No support for SnapshotOptions.\n\n /** @hideconstructor protected */\n constructor(\n public _firestore: Firestore,\n public _userDataWriter: AbstractUserDataWriter,\n public _key: DocumentKey,\n public _document: Document | null,\n public _converter: UntypedFirestoreDataConverter<T> | null\n ) {}\n\n /** Property of the `DocumentSnapshot` that provides the document's ID. */\n get id(): string {\n return this._key.path.lastSegment();\n }\n\n /**\n * The `DocumentReference` for the document included in the `DocumentSnapshot`.\n */\n get ref(): DocumentReference<T> {\n return new DocumentReference<T>(\n this._firestore,\n this._converter,\n this._key\n );\n }\n\n /**\n * Signals whether or not the document at the snapshot's location exists.\n *\n * @returns true if the document exists.\n */\n exists(): this is QueryDocumentSnapshot<T> {\n return this._document !== null;\n }\n\n /**\n * Retrieves all fields in the document as an `Object`. Returns `undefined` if\n * the document doesn't exist.\n *\n * @returns An `Object` containing all fields in the document or `undefined`\n * if the document doesn't exist.\n */\n data(): T | undefined {\n if (!this._document) {\n return undefined;\n } else if (this._converter) {\n // We only want to use the converter and create a new DocumentSnapshot\n // if a converter has been provided.\n const snapshot = new QueryDocumentSnapshot(\n this._firestore,\n this._userDataWriter,\n this._key,\n this._document,\n /* converter= */ null\n );\n return this._converter.fromFirestore(snapshot);\n } else {\n return this._userDataWriter.convertValue(this._document.data.value) as T;\n }\n }\n\n /**\n * Retrieves the field specified by `fieldPath`. Returns `undefined` if the\n * document or field doesn't exist.\n *\n * @param fieldPath - The path (for example 'foo' or 'foo.bar') to a specific\n * field.\n * @returns The data at the specified field location or undefined if no such\n * field exists in the document.\n */\n // We are using `any` here to avoid an explicit cast by our users.\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n get(fieldPath: string | FieldPath): any {\n if (this._document) {\n const value = this._document.data.field(\n fieldPathFromArgument('DocumentSnapshot.get', fieldPath)\n );\n if (value !== null) {\n return this._userDataWriter.convertValue(value);\n }\n }\n return undefined;\n }\n}\n\n/**\n * A `QueryDocumentSnapshot` contains data read from a document in your\n * Firestore database as part of a query. The document is guaranteed to exist\n * and its data can be extracted with `.data()` or `.get(<field>)` to get a\n * specific field.\n *\n * A `QueryDocumentSnapshot` offers the same API surface as a\n * `DocumentSnapshot`. Since query results contain only existing documents, the\n * `exists` property will always be true and `data()` will never return\n * 'undefined'.\n */\nexport class QueryDocumentSnapshot<\n T = DocumentData\n> extends DocumentSnapshot<T> {\n /**\n * Retrieves all fields in the document as an `Object`.\n *\n * @override\n * @returns An `Object` containing all fields in the document.\n */\n data(): T {\n return super.data() as T;\n }\n}\n\n/**\n * A `QuerySnapshot` contains zero or more `DocumentSnapshot` objects\n * representing the results of a query. The documents can be accessed as an\n * array via the `docs` property or enumerated using the `forEach` method. The\n * number of documents can be determined via the `empty` and `size`\n * properties.\n */\nexport class QuerySnapshot<T = DocumentData> {\n /**\n * The query on which you called {@link getDocs} in order to get this\n * `QuerySnapshot`.\n */\n readonly query: Query<T>;\n\n /** @hideconstructor */\n constructor(\n _query: Query<T>,\n readonly _docs: Array<QueryDocumentSnapshot<T>>\n ) {\n this.query = _query;\n }\n\n /** An array of all the documents in the `QuerySnapshot`. */\n get docs(): Array<QueryDocumentSnapshot<T>> {\n return [...this._docs];\n }\n\n /** The number of documents in the `QuerySnapshot`. */\n get size(): number {\n return this.docs.length;\n }\n\n /** True if there are no documents in the `QuerySnapshot`. */\n get empty(): boolean {\n return this.docs.length === 0;\n }\n\n /**\n * Enumerates all of the documents in the `QuerySnapshot`.\n *\n * @param callback - A callback to be called with a `QueryDocumentSnapshot` for\n * each document in the snapshot.\n * @param thisArg - The `this` binding for the callback.\n */\n forEach(\n callback: (result: QueryDocumentSnapshot<T>) => void,\n thisArg?: unknown\n ): void {\n this._docs.forEach(callback, thisArg);\n }\n}\n\n/**\n * Returns true if the provided snapshots are equal.\n *\n * @param left - A snapshot to compare.\n * @param right - A snapshot to compare.\n * @returns true if the snapshots are equal.\n */\nexport function snapshotEqual<T>(\n left: DocumentSnapshot<T> | QuerySnapshot<T>,\n right: DocumentSnapshot<T> | QuerySnapshot<T>\n): boolean {\n left = getModularInstance(left);\n right = getModularInstance(right);\n\n if (left instanceof DocumentSnapshot && right instanceof DocumentSnapshot) {\n return (\n left._firestore === right._firestore &&\n left._key.isEqual(right._key) &&\n (left._document === null\n ? right._document === null\n : left._document.isEqual(right._document)) &&\n left._converter === right._converter\n );\n } else if (left instanceof QuerySnapshot && right instanceof QuerySnapshot) {\n return (\n queryEqual(left.query, right.query) &&\n arrayEquals(left.docs, right.docs, snapshotEqual)\n );\n }\n\n return false;\n}\n\n/**\n * Helper that calls `fromDotSeparatedString()` but wraps any error thrown.\n */\nexport function fieldPathFromArgument(\n methodName: string,\n arg: string | FieldPath | Compat<FieldPath>\n): InternalFieldPath {\n if (typeof arg === 'string') {\n return fieldPathFromDotSeparatedString(methodName, arg);\n } else if (arg instanceof FieldPath) {\n return arg._internalPath;\n } else {\n return arg._delegate._internalPath;\n }\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { getModularInstance } from '@firebase/util';\n\nimport { Bound } from '../core/bound';\nimport { DatabaseId } from '../core/database_info';\nimport {\n CompositeFilter,\n CompositeOperator,\n FieldFilter,\n Filter,\n Operator\n} from '../core/filter';\nimport { Direction, OrderBy } from '../core/order_by';\nimport {\n getFirstOrderByField,\n getInequalityFilterField,\n isCollectionGroupQuery,\n LimitType,\n Query as InternalQuery,\n queryOrderBy,\n queryWithAddedFilter,\n queryWithAddedOrderBy,\n queryWithEndAt,\n queryWithLimit,\n queryWithStartAt\n} from '../core/query';\nimport { Document } from '../model/document';\nimport { DocumentKey } from '../model/document_key';\nimport { FieldPath as InternalFieldPath, ResourcePath } from '../model/path';\nimport { isServerTimestamp } from '../model/server_timestamps';\nimport { refValue } from '../model/values';\nimport { Value as ProtoValue } from '../protos/firestore_proto_api';\nimport { Code, FirestoreError } from '../util/error';\nimport {\n validatePositiveNumber,\n valueDescription\n} from '../util/input_validation';\n\nimport { FieldPath } from './field_path';\nimport { DocumentReference, Query } from './reference';\nimport { DocumentSnapshot, fieldPathFromArgument } from './snapshot';\nimport {\n newUserDataReader,\n parseQueryValue,\n UserDataReader\n} from './user_data_reader';\n\nexport function validateHasExplicitOrderByForLimitToLast(\n query: InternalQuery\n): void {\n if (\n query.limitType === LimitType.Last &&\n query.explicitOrderBy.length === 0\n ) {\n throw new FirestoreError(\n Code.UNIMPLEMENTED,\n 'limitToLast() queries require specifying at least one orderBy() clause'\n );\n }\n}\n\n/** Describes the different query constraints available in this SDK. */\nexport type QueryConstraintType =\n | 'where'\n | 'orderBy'\n | 'limit'\n | 'limitToLast'\n | 'startAt'\n | 'startAfter'\n | 'endAt'\n | 'endBefore';\n\n/**\n * An `AppliableConstraint` is an abstraction of a constraint that can be applied\n * to a Firestore query.\n */\nexport abstract class AppliableConstraint {\n /**\n * Takes the provided {@link Query} and returns a copy of the {@link Query} with this\n * {@link AppliableConstraint} applied.\n */\n abstract _apply<T>(query: Query<T>): Query<T>;\n}\n\n/**\n * A `QueryConstraint` is used to narrow the set of documents returned by a\n * Firestore query. `QueryConstraint`s are created by invoking {@link where},\n * {@link orderBy}, {@link startAt}, {@link startAfter}, {@link\n * endBefore}, {@link endAt}, {@link limit}, {@link limitToLast} and\n * can then be passed to {@link query} to create a new query instance that\n * also contains this `QueryConstraint`.\n */\nexport abstract class QueryConstraint extends AppliableConstraint {\n /** The type of this query constraint */\n abstract readonly type: QueryConstraintType;\n\n /**\n * Takes the provided {@link Query} and returns a copy of the {@link Query} with this\n * {@link AppliableConstraint} applied.\n */\n abstract _apply<T>(query: Query<T>): Query<T>;\n}\n\n/**\n * Creates a new immutable instance of {@link Query} that is extended to also\n * include additional query constraints.\n *\n * @param query - The {@link Query} instance to use as a base for the new\n * constraints.\n * @param compositeFilter - The {@link QueryCompositeFilterConstraint} to\n * apply. Create {@link QueryCompositeFilterConstraint} using {@link and} or\n * {@link or}.\n * @param queryConstraints - Additional {@link QueryNonFilterConstraint}s to\n * apply (e.g. {@link orderBy}, {@link limit}).\n * @throws if any of the provided query constraints cannot be combined with the\n * existing or new constraints.\n * @internal TODO remove this internal tag with OR Query support in the server\n */\nexport function query<T>(\n query: Query<T>,\n compositeFilter: QueryCompositeFilterConstraint,\n ...queryConstraints: QueryNonFilterConstraint[]\n): Query<T>;\n\n/**\n * Creates a new immutable instance of {@link Query} that is extended to also\n * include additional query constraints.\n *\n * @param query - The {@link Query} instance to use as a base for the new\n * constraints.\n * @param queryConstraints - The list of {@link QueryConstraint}s to apply.\n * @throws if any of the provided query constraints cannot be combined with the\n * existing or new constraints.\n */\nexport function query<T>(\n query: Query<T>,\n ...queryConstraints: QueryConstraint[]\n): Query<T>;\n\nexport function query<T>(\n query: Query<T>,\n queryConstraint: QueryCompositeFilterConstraint | QueryConstraint | undefined,\n ...additionalQueryConstraints: Array<\n QueryConstraint | QueryNonFilterConstraint\n >\n): Query<T> {\n let queryConstraints: AppliableConstraint[] = [];\n\n if (queryConstraint instanceof AppliableConstraint) {\n queryConstraints.push(queryConstraint);\n }\n\n queryConstraints = queryConstraints.concat(additionalQueryConstraints);\n\n validateQueryConstraintArray(queryConstraints);\n\n for (const constraint of queryConstraints) {\n query = constraint._apply(query);\n }\n return query;\n}\n\n/**\n * A `QueryFieldFilterConstraint` is used to narrow the set of documents returned by\n * a Firestore query by filtering on one or more document fields.\n * `QueryFieldFilterConstraint`s are created by invoking {@link where} and can then\n * be passed to {@link query} to create a new query instance that also contains\n * this `QueryFieldFilterConstraint`.\n */\nexport class QueryFieldFilterConstraint extends QueryConstraint {\n /** The type of this query constraint */\n readonly type = 'where';\n\n /**\n * @internal\n */\n protected constructor(\n private readonly _field: InternalFieldPath,\n private _op: Operator,\n private _value: unknown\n ) {\n super();\n }\n\n static _create(\n _field: InternalFieldPath,\n _op: Operator,\n _value: unknown\n ): QueryFieldFilterConstraint {\n return new QueryFieldFilterConstraint(_field, _op, _value);\n }\n\n _apply<T>(query: Query<T>): Query<T> {\n const filter = this._parse(query);\n validateNewFieldFilter(query._query, filter);\n return new Query(\n query.firestore,\n query.converter,\n queryWithAddedFilter(query._query, filter)\n );\n }\n\n _parse<T>(query: Query<T>): FieldFilter {\n const reader = newUserDataReader(query.firestore);\n const filter = newQueryFilter(\n query._query,\n 'where',\n reader,\n query.firestore._databaseId,\n this._field,\n this._op,\n this._value\n );\n return filter;\n }\n}\n\n/**\n * Filter conditions in a {@link where} clause are specified using the\n * strings '<', '<=', '==', '!=', '>=', '>', 'array-contains', 'in',\n * 'array-contains-any', and 'not-in'.\n */\nexport type WhereFilterOp =\n | '<'\n | '<='\n | '=='\n | '!='\n | '>='\n | '>'\n | 'array-contains'\n | 'in'\n | 'array-contains-any'\n | 'not-in';\n\n/**\n * Creates a {@link QueryFieldFilterConstraint} that enforces that documents\n * must contain the specified field and that the value should satisfy the\n * relation constraint provided.\n *\n * @param fieldPath - The path to compare\n * @param opStr - The operation string (e.g \"<\", \"<=\", \"==\", \"<\",\n * \"<=\", \"!=\").\n * @param value - The value for comparison\n * @returns The created {@link QueryFieldFilterConstraint}.\n */\nexport function where(\n fieldPath: string | FieldPath,\n opStr: WhereFilterOp,\n value: unknown\n): QueryFieldFilterConstraint {\n const op = opStr as Operator;\n const field = fieldPathFromArgument('where', fieldPath);\n return QueryFieldFilterConstraint._create(field, op, value);\n}\n\n/**\n * A `QueryCompositeFilterConstraint` is used to narrow the set of documents\n * returned by a Firestore query by performing the logical OR or AND of multiple\n * {@link QueryFieldFilterConstraint}s or {@link QueryCompositeFilterConstraint}s.\n * `QueryCompositeFilterConstraint`s are created by invoking {@link or} or\n * {@link and} and can then be passed to {@link query} to create a new query\n * instance that also contains the `QueryCompositeFilterConstraint`.\n * @internal TODO remove this internal tag with OR Query support in the server\n */\nexport class QueryCompositeFilterConstraint extends AppliableConstraint {\n /**\n * @internal\n */\n protected constructor(\n /** The type of this query constraint */\n readonly type: 'or' | 'and',\n private readonly _queryConstraints: QueryFilterConstraint[]\n ) {\n super();\n }\n\n static _create(\n type: 'or' | 'and',\n _queryConstraints: QueryFilterConstraint[]\n ): QueryCompositeFilterConstraint {\n return new QueryCompositeFilterConstraint(type, _queryConstraints);\n }\n\n _parse<T>(query: Query<T>): Filter {\n const parsedFilters = this._queryConstraints\n .map(queryConstraint => {\n return queryConstraint._parse(query);\n })\n .filter(parsedFilter => parsedFilter.getFilters().length > 0);\n\n if (parsedFilters.length === 1) {\n return parsedFilters[0];\n }\n\n return CompositeFilter.create(parsedFilters, this._getOperator());\n }\n\n _apply<T>(query: Query<T>): Query<T> {\n const parsedFilter = this._parse(query);\n if (parsedFilter.getFilters().length === 0) {\n // Return the existing query if not adding any more filters (e.g. an empty\n // composite filter).\n return query;\n }\n validateNewFilter(query._query, parsedFilter);\n\n return new Query(\n query.firestore,\n query.converter,\n queryWithAddedFilter(query._query, parsedFilter)\n );\n }\n\n _getQueryConstraints(): readonly AppliableConstraint[] {\n return this._queryConstraints;\n }\n\n _getOperator(): CompositeOperator {\n return this.type === 'and' ? CompositeOperator.AND : CompositeOperator.OR;\n }\n}\n\n/**\n * `QueryNonFilterConstraint` is a helper union type that represents\n * QueryConstraints which are used to narrow or order the set of documents,\n * but that do not explicitly filter on a document field.\n * `QueryNonFilterConstraint`s are created by invoking {@link orderBy},\n * {@link startAt}, {@link startAfter}, {@link endBefore}, {@link endAt},\n * {@link limit} or {@link limitToLast} and can then be passed to {@link query}\n * to create a new query instance that also contains the `QueryConstraint`.\n */\nexport type QueryNonFilterConstraint =\n | QueryOrderByConstraint\n | QueryLimitConstraint\n | QueryStartAtConstraint\n | QueryEndAtConstraint;\n\n/**\n * `QueryFilterConstraint` is a helper union type that represents\n * {@link QueryFieldFilterConstraint} and {@link QueryCompositeFilterConstraint}.\n * `QueryFilterConstraint`s are created by invoking {@link or} or {@link and}\n * and can then be passed to {@link query} to create a new query instance that\n * also contains the `QueryConstraint`.\n * @internal TODO remove this internal tag with OR Query support in the server\n */\nexport type QueryFilterConstraint =\n | QueryFieldFilterConstraint\n | QueryCompositeFilterConstraint;\n\n/**\n * Creates a new {@link QueryCompositeFilterConstraint} that is a disjunction of\n * the given filter constraints. A disjunction filter includes a document if it\n * satisfies any of the given filters.\n *\n * @param queryConstraints - Optional. The list of\n * {@link QueryFilterConstraint}s to perform a disjunction for. These must be\n * created with calls to {@link where}, {@link or}, or {@link and}.\n * @returns The newly created {@link QueryCompositeFilterConstraint}.\n * @internal TODO remove this internal tag with OR Query support in the server\n */\nexport function or(\n ...queryConstraints: QueryFilterConstraint[]\n): QueryCompositeFilterConstraint {\n // Only support QueryFilterConstraints\n queryConstraints.forEach(queryConstraint =>\n validateQueryFilterConstraint('or', queryConstraint)\n );\n\n return QueryCompositeFilterConstraint._create(\n CompositeOperator.OR,\n queryConstraints as QueryFilterConstraint[]\n );\n}\n\n/**\n * Creates a new {@link QueryCompositeFilterConstraint} that is a conjunction of\n * the given filter constraints. A conjunction filter includes a document if it\n * satisfies all of the given filters.\n *\n * @param queryConstraints - Optional. The list of\n * {@link QueryFilterConstraint}s to perform a conjunction for. These must be\n * created with calls to {@link where}, {@link or}, or {@link and}.\n * @returns The newly created {@link QueryCompositeFilterConstraint}.\n * @internal TODO remove this internal tag with OR Query support in the server\n */\nexport function and(\n ...queryConstraints: QueryFilterConstraint[]\n): QueryCompositeFilterConstraint {\n // Only support QueryFilterConstraints\n queryConstraints.forEach(queryConstraint =>\n validateQueryFilterConstraint('and', queryConstraint)\n );\n\n return QueryCompositeFilterConstraint._create(\n CompositeOperator.AND,\n queryConstraints as QueryFilterConstraint[]\n );\n}\n\n/**\n * A `QueryOrderByConstraint` is used to sort the set of documents returned by a\n * Firestore query. `QueryOrderByConstraint`s are created by invoking\n * {@link orderBy} and can then be passed to {@link query} to create a new query\n * instance that also contains this `QueryOrderByConstraint`.\n *\n * Note: Documents that do not contain the orderBy field will not be present in\n * the query result.\n */\nexport class QueryOrderByConstraint extends QueryConstraint {\n /** The type of this query constraint */\n readonly type = 'orderBy';\n\n /**\n * @internal\n */\n protected constructor(\n private readonly _field: InternalFieldPath,\n private _direction: Direction\n ) {\n super();\n }\n\n static _create(\n _field: InternalFieldPath,\n _direction: Direction\n ): QueryOrderByConstraint {\n return new QueryOrderByConstraint(_field, _direction);\n }\n\n _apply<T>(query: Query<T>): Query<T> {\n const orderBy = newQueryOrderBy(query._query, this._field, this._direction);\n return new Query(\n query.firestore,\n query.converter,\n queryWithAddedOrderBy(query._query, orderBy)\n );\n }\n}\n\n/**\n * The direction of a {@link orderBy} clause is specified as 'desc' or 'asc'\n * (descending or ascending).\n */\nexport type OrderByDirection = 'desc' | 'asc';\n\n/**\n * Creates a {@link QueryOrderByConstraint} that sorts the query result by the\n * specified field, optionally in descending order instead of ascending.\n *\n * Note: Documents that do not contain the specified field will not be present\n * in the query result.\n *\n * @param fieldPath - The field to sort by.\n * @param directionStr - Optional direction to sort by ('asc' or 'desc'). If\n * not specified, order will be ascending.\n * @returns The created {@link QueryOrderByConstraint}.\n */\nexport function orderBy(\n fieldPath: string | FieldPath,\n directionStr: OrderByDirection = 'asc'\n): QueryOrderByConstraint {\n const direction = directionStr as Direction;\n const path = fieldPathFromArgument('orderBy', fieldPath);\n return QueryOrderByConstraint._create(path, direction);\n}\n\n/**\n * A `QueryLimitConstraint` is used to limit the number of documents returned by\n * a Firestore query.\n * `QueryLimitConstraint`s are created by invoking {@link limit} or\n * {@link limitToLast} and can then be passed to {@link query} to create a new\n * query instance that also contains this `QueryLimitConstraint`.\n */\nexport class QueryLimitConstraint extends QueryConstraint {\n /**\n * @internal\n */\n protected constructor(\n /** The type of this query constraint */\n readonly type: 'limit' | 'limitToLast',\n private readonly _limit: number,\n private readonly _limitType: LimitType\n ) {\n super();\n }\n\n static _create(\n type: 'limit' | 'limitToLast',\n _limit: number,\n _limitType: LimitType\n ): QueryLimitConstraint {\n return new QueryLimitConstraint(type, _limit, _limitType);\n }\n\n _apply<T>(query: Query<T>): Query<T> {\n return new Query(\n query.firestore,\n query.converter,\n queryWithLimit(query._query, this._limit, this._limitType)\n );\n }\n}\n\n/**\n * Creates a {@link QueryLimitConstraint} that only returns the first matching\n * documents.\n *\n * @param limit - The maximum number of items to return.\n * @returns The created {@link QueryLimitConstraint}.\n */\nexport function limit(limit: number): QueryLimitConstraint {\n validatePositiveNumber('limit', limit);\n return QueryLimitConstraint._create('limit', limit, LimitType.First);\n}\n\n/**\n * Creates a {@link QueryLimitConstraint} that only returns the last matching\n * documents.\n *\n * You must specify at least one `orderBy` clause for `limitToLast` queries,\n * otherwise an exception will be thrown during execution.\n *\n * @param limit - The maximum number of items to return.\n * @returns The created {@link QueryLimitConstraint}.\n */\nexport function limitToLast(limit: number): QueryLimitConstraint {\n validatePositiveNumber('limitToLast', limit);\n return QueryLimitConstraint._create('limitToLast', limit, LimitType.Last);\n}\n\n/**\n * A `QueryStartAtConstraint` is used to exclude documents from the start of a\n * result set returned by a Firestore query.\n * `QueryStartAtConstraint`s are created by invoking {@link (startAt:1)} or\n * {@link (startAfter:1)} and can then be passed to {@link query} to create a\n * new query instance that also contains this `QueryStartAtConstraint`.\n */\nexport class QueryStartAtConstraint extends QueryConstraint {\n /**\n * @internal\n */\n protected constructor(\n /** The type of this query constraint */\n readonly type: 'startAt' | 'startAfter',\n private readonly _docOrFields: Array<unknown | DocumentSnapshot<unknown>>,\n private readonly _inclusive: boolean\n ) {\n super();\n }\n\n static _create(\n type: 'startAt' | 'startAfter',\n _docOrFields: Array<unknown | DocumentSnapshot<unknown>>,\n _inclusive: boolean\n ): QueryStartAtConstraint {\n return new QueryStartAtConstraint(type, _docOrFields, _inclusive);\n }\n\n _apply<T>(query: Query<T>): Query<T> {\n const bound = newQueryBoundFromDocOrFields(\n query,\n this.type,\n this._docOrFields,\n this._inclusive\n );\n return new Query(\n query.firestore,\n query.converter,\n queryWithStartAt(query._query, bound)\n );\n }\n}\n\n/**\n * Creates a {@link QueryStartAtConstraint} that modifies the result set to\n * start at the provided document (inclusive). The starting position is relative\n * to the order of the query. The document must contain all of the fields\n * provided in the `orderBy` of this query.\n *\n * @param snapshot - The snapshot of the document to start at.\n * @returns A {@link QueryStartAtConstraint} to pass to `query()`.\n */\nexport function startAt(\n snapshot: DocumentSnapshot<unknown>\n): QueryStartAtConstraint;\n/**\n * Creates a {@link QueryStartAtConstraint} that modifies the result set to\n * start at the provided fields relative to the order of the query. The order of\n * the field values must match the order of the order by clauses of the query.\n *\n * @param fieldValues - The field values to start this query at, in order\n * of the query's order by.\n * @returns A {@link QueryStartAtConstraint} to pass to `query()`.\n */\nexport function startAt(...fieldValues: unknown[]): QueryStartAtConstraint;\nexport function startAt(\n ...docOrFields: Array<unknown | DocumentSnapshot<unknown>>\n): QueryStartAtConstraint {\n return QueryStartAtConstraint._create(\n 'startAt',\n docOrFields,\n /*inclusive=*/ true\n );\n}\n\n/**\n * Creates a {@link QueryStartAtConstraint} that modifies the result set to\n * start after the provided document (exclusive). The starting position is\n * relative to the order of the query. The document must contain all of the\n * fields provided in the orderBy of the query.\n *\n * @param snapshot - The snapshot of the document to start after.\n * @returns A {@link QueryStartAtConstraint} to pass to `query()`\n */\nexport function startAfter(\n snapshot: DocumentSnapshot<unknown>\n): QueryStartAtConstraint;\n/**\n * Creates a {@link QueryStartAtConstraint} that modifies the result set to\n * start after the provided fields relative to the order of the query. The order\n * of the field values must match the order of the order by clauses of the query.\n *\n * @param fieldValues - The field values to start this query after, in order\n * of the query's order by.\n * @returns A {@link QueryStartAtConstraint} to pass to `query()`\n */\nexport function startAfter(...fieldValues: unknown[]): QueryStartAtConstraint;\nexport function startAfter(\n ...docOrFields: Array<unknown | DocumentSnapshot<unknown>>\n): QueryStartAtConstraint {\n return QueryStartAtConstraint._create(\n 'startAfter',\n docOrFields,\n /*inclusive=*/ false\n );\n}\n\n/**\n * A `QueryEndAtConstraint` is used to exclude documents from the end of a\n * result set returned by a Firestore query.\n * `QueryEndAtConstraint`s are created by invoking {@link (endAt:1)} or\n * {@link (endBefore:1)} and can then be passed to {@link query} to create a new\n * query instance that also contains this `QueryEndAtConstraint`.\n */\nexport class QueryEndAtConstraint extends QueryConstraint {\n /**\n * @internal\n */\n protected constructor(\n /** The type of this query constraint */\n readonly type: 'endBefore' | 'endAt',\n private readonly _docOrFields: Array<unknown | DocumentSnapshot<unknown>>,\n private readonly _inclusive: boolean\n ) {\n super();\n }\n\n static _create(\n type: 'endBefore' | 'endAt',\n _docOrFields: Array<unknown | DocumentSnapshot<unknown>>,\n _inclusive: boolean\n ): QueryEndAtConstraint {\n return new QueryEndAtConstraint(type, _docOrFields, _inclusive);\n }\n\n _apply<T>(query: Query<T>): Query<T> {\n const bound = newQueryBoundFromDocOrFields(\n query,\n this.type,\n this._docOrFields,\n this._inclusive\n );\n return new Query(\n query.firestore,\n query.converter,\n queryWithEndAt(query._query, bound)\n );\n }\n}\n\n/**\n * Creates a {@link QueryEndAtConstraint} that modifies the result set to end\n * before the provided document (exclusive). The end position is relative to the\n * order of the query. The document must contain all of the fields provided in\n * the orderBy of the query.\n *\n * @param snapshot - The snapshot of the document to end before.\n * @returns A {@link QueryEndAtConstraint} to pass to `query()`\n */\nexport function endBefore(\n snapshot: DocumentSnapshot<unknown>\n): QueryEndAtConstraint;\n/**\n * Creates a {@link QueryEndAtConstraint} that modifies the result set to end\n * before the provided fields relative to the order of the query. The order of\n * the field values must match the order of the order by clauses of the query.\n *\n * @param fieldValues - The field values to end this query before, in order\n * of the query's order by.\n * @returns A {@link QueryEndAtConstraint} to pass to `query()`\n */\nexport function endBefore(...fieldValues: unknown[]): QueryEndAtConstraint;\nexport function endBefore(\n ...docOrFields: Array<unknown | DocumentSnapshot<unknown>>\n): QueryEndAtConstraint {\n return QueryEndAtConstraint._create(\n 'endBefore',\n docOrFields,\n /*inclusive=*/ false\n );\n}\n\n/**\n * Creates a {@link QueryEndAtConstraint} that modifies the result set to end at\n * the provided document (inclusive). The end position is relative to the order\n * of the query. The document must contain all of the fields provided in the\n * orderBy of the query.\n *\n * @param snapshot - The snapshot of the document to end at.\n * @returns A {@link QueryEndAtConstraint} to pass to `query()`\n */\nexport function endAt(\n snapshot: DocumentSnapshot<unknown>\n): QueryEndAtConstraint;\n/**\n * Creates a {@link QueryEndAtConstraint} that modifies the result set to end at\n * the provided fields relative to the order of the query. The order of the field\n * values must match the order of the order by clauses of the query.\n *\n * @param fieldValues - The field values to end this query at, in order\n * of the query's order by.\n * @returns A {@link QueryEndAtConstraint} to pass to `query()`\n */\nexport function endAt(...fieldValues: unknown[]): QueryEndAtConstraint;\nexport function endAt(\n ...docOrFields: Array<unknown | DocumentSnapshot<unknown>>\n): QueryEndAtConstraint {\n return QueryEndAtConstraint._create(\n 'endAt',\n docOrFields,\n /*inclusive=*/ true\n );\n}\n\n/** Helper function to create a bound from a document or fields */\nfunction newQueryBoundFromDocOrFields<T>(\n query: Query,\n methodName: string,\n docOrFields: Array<unknown | DocumentSnapshot<T>>,\n inclusive: boolean\n): Bound {\n docOrFields[0] = getModularInstance(docOrFields[0]);\n\n if (docOrFields[0] instanceof DocumentSnapshot) {\n return newQueryBoundFromDocument(\n query._query,\n query.firestore._databaseId,\n methodName,\n docOrFields[0]._document,\n inclusive\n );\n } else {\n const reader = newUserDataReader(query.firestore);\n return newQueryBoundFromFields(\n query._query,\n query.firestore._databaseId,\n reader,\n methodName,\n docOrFields,\n inclusive\n );\n }\n}\n\nexport function newQueryFilter(\n query: InternalQuery,\n methodName: string,\n dataReader: UserDataReader,\n databaseId: DatabaseId,\n fieldPath: InternalFieldPath,\n op: Operator,\n value: unknown\n): FieldFilter {\n let fieldValue: ProtoValue;\n if (fieldPath.isKeyField()) {\n if (op === Operator.ARRAY_CONTAINS || op === Operator.ARRAY_CONTAINS_ANY) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n `Invalid Query. You can't perform '${op}' queries on documentId().`\n );\n } else if (op === Operator.IN || op === Operator.NOT_IN) {\n validateDisjunctiveFilterElements(value, op);\n const referenceList: ProtoValue[] = [];\n for (const arrayValue of value as ProtoValue[]) {\n referenceList.push(parseDocumentIdValue(databaseId, query, arrayValue));\n }\n fieldValue = { arrayValue: { values: referenceList } };\n } else {\n fieldValue = parseDocumentIdValue(databaseId, query, value);\n }\n } else {\n if (\n op === Operator.IN ||\n op === Operator.NOT_IN ||\n op === Operator.ARRAY_CONTAINS_ANY\n ) {\n validateDisjunctiveFilterElements(value, op);\n }\n fieldValue = parseQueryValue(\n dataReader,\n methodName,\n value,\n /* allowArrays= */ op === Operator.IN || op === Operator.NOT_IN\n );\n }\n const filter = FieldFilter.create(fieldPath, op, fieldValue);\n return filter;\n}\n\nexport function newQueryOrderBy(\n query: InternalQuery,\n fieldPath: InternalFieldPath,\n direction: Direction\n): OrderBy {\n if (query.startAt !== null) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n 'Invalid query. You must not call startAt() or startAfter() before ' +\n 'calling orderBy().'\n );\n }\n if (query.endAt !== null) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n 'Invalid query. You must not call endAt() or endBefore() before ' +\n 'calling orderBy().'\n );\n }\n const orderBy = new OrderBy(fieldPath, direction);\n validateNewOrderBy(query, orderBy);\n return orderBy;\n}\n\n/**\n * Create a `Bound` from a query and a document.\n *\n * Note that the `Bound` will always include the key of the document\n * and so only the provided document will compare equal to the returned\n * position.\n *\n * Will throw if the document does not contain all fields of the order by\n * of the query or if any of the fields in the order by are an uncommitted\n * server timestamp.\n */\nexport function newQueryBoundFromDocument(\n query: InternalQuery,\n databaseId: DatabaseId,\n methodName: string,\n doc: Document | null,\n inclusive: boolean\n): Bound {\n if (!doc) {\n throw new FirestoreError(\n Code.NOT_FOUND,\n `Can't use a DocumentSnapshot that doesn't exist for ` +\n `${methodName}().`\n );\n }\n\n const components: ProtoValue[] = [];\n\n // Because people expect to continue/end a query at the exact document\n // provided, we need to use the implicit sort order rather than the explicit\n // sort order, because it's guaranteed to contain the document key. That way\n // the position becomes unambiguous and the query continues/ends exactly at\n // the provided document. Without the key (by using the explicit sort\n // orders), multiple documents could match the position, yielding duplicate\n // results.\n for (const orderBy of queryOrderBy(query)) {\n if (orderBy.field.isKeyField()) {\n components.push(refValue(databaseId, doc.key));\n } else {\n const value = doc.data.field(orderBy.field);\n if (isServerTimestamp(value)) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n 'Invalid query. You are trying to start or end a query using a ' +\n 'document for which the field \"' +\n orderBy.field +\n '\" is an uncommitted server timestamp. (Since the value of ' +\n 'this field is unknown, you cannot start/end a query with it.)'\n );\n } else if (value !== null) {\n components.push(value);\n } else {\n const field = orderBy.field.canonicalString();\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n `Invalid query. You are trying to start or end a query using a ` +\n `document for which the field '${field}' (used as the ` +\n `orderBy) does not exist.`\n );\n }\n }\n }\n return new Bound(components, inclusive);\n}\n\n/**\n * Converts a list of field values to a `Bound` for the given query.\n */\nexport function newQueryBoundFromFields(\n query: InternalQuery,\n databaseId: DatabaseId,\n dataReader: UserDataReader,\n methodName: string,\n values: unknown[],\n inclusive: boolean\n): Bound {\n // Use explicit order by's because it has to match the query the user made\n const orderBy = query.explicitOrderBy;\n if (values.length > orderBy.length) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n `Too many arguments provided to ${methodName}(). ` +\n `The number of arguments must be less than or equal to the ` +\n `number of orderBy() clauses`\n );\n }\n\n const components: ProtoValue[] = [];\n for (let i = 0; i < values.length; i++) {\n const rawValue = values[i];\n const orderByComponent = orderBy[i];\n if (orderByComponent.field.isKeyField()) {\n if (typeof rawValue !== 'string') {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n `Invalid query. Expected a string for document ID in ` +\n `${methodName}(), but got a ${typeof rawValue}`\n );\n }\n if (!isCollectionGroupQuery(query) && rawValue.indexOf('/') !== -1) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n `Invalid query. When querying a collection and ordering by documentId(), ` +\n `the value passed to ${methodName}() must be a plain document ID, but ` +\n `'${rawValue}' contains a slash.`\n );\n }\n const path = query.path.child(ResourcePath.fromString(rawValue));\n if (!DocumentKey.isDocumentKey(path)) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n `Invalid query. When querying a collection group and ordering by ` +\n `documentId(), the value passed to ${methodName}() must result in a ` +\n `valid document path, but '${path}' is not because it contains an odd number ` +\n `of segments.`\n );\n }\n const key = new DocumentKey(path);\n components.push(refValue(databaseId, key));\n } else {\n const wrapped = parseQueryValue(dataReader, methodName, rawValue);\n components.push(wrapped);\n }\n }\n\n return new Bound(components, inclusive);\n}\n\n/**\n * Parses the given `documentIdValue` into a `ReferenceValue`, throwing\n * appropriate errors if the value is anything other than a `DocumentReference`\n * or `string`, or if the string is malformed.\n */\nfunction parseDocumentIdValue(\n databaseId: DatabaseId,\n query: InternalQuery,\n documentIdValue: unknown\n): ProtoValue {\n documentIdValue = getModularInstance(documentIdValue);\n\n if (typeof documentIdValue === 'string') {\n if (documentIdValue === '') {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n 'Invalid query. When querying with documentId(), you ' +\n 'must provide a valid document ID, but it was an empty string.'\n );\n }\n if (!isCollectionGroupQuery(query) && documentIdValue.indexOf('/') !== -1) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n `Invalid query. When querying a collection by ` +\n `documentId(), you must provide a plain document ID, but ` +\n `'${documentIdValue}' contains a '/' character.`\n );\n }\n const path = query.path.child(ResourcePath.fromString(documentIdValue));\n if (!DocumentKey.isDocumentKey(path)) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n `Invalid query. When querying a collection group by ` +\n `documentId(), the value provided must result in a valid document path, ` +\n `but '${path}' is not because it has an odd number of segments (${path.length}).`\n );\n }\n return refValue(databaseId, new DocumentKey(path));\n } else if (documentIdValue instanceof DocumentReference) {\n return refValue(databaseId, documentIdValue._key);\n } else {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n `Invalid query. When querying with documentId(), you must provide a valid ` +\n `string or a DocumentReference, but it was: ` +\n `${valueDescription(documentIdValue)}.`\n );\n }\n}\n\n/**\n * Validates that the value passed into a disjunctive filter satisfies all\n * array requirements.\n */\nfunction validateDisjunctiveFilterElements(\n value: unknown,\n operator: Operator\n): void {\n if (!Array.isArray(value) || value.length === 0) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n 'Invalid Query. A non-empty array is required for ' +\n `'${operator.toString()}' filters.`\n );\n }\n if (value.length > 10) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n `Invalid Query. '${operator.toString()}' filters support a ` +\n 'maximum of 10 elements in the value array.'\n );\n }\n}\n\n/**\n * Given an operator, returns the set of operators that cannot be used with it.\n *\n * Operators in a query must adhere to the following set of rules:\n * 1. Only one array operator is allowed.\n * 2. Only one disjunctive operator is allowed.\n * 3. `NOT_EQUAL` cannot be used with another `NOT_EQUAL` operator.\n * 4. `NOT_IN` cannot be used with array, disjunctive, or `NOT_EQUAL` operators.\n *\n * Array operators: `ARRAY_CONTAINS`, `ARRAY_CONTAINS_ANY`\n * Disjunctive operators: `IN`, `ARRAY_CONTAINS_ANY`, `NOT_IN`\n */\nfunction conflictingOps(op: Operator): Operator[] {\n switch (op) {\n case Operator.NOT_EQUAL:\n return [Operator.NOT_EQUAL, Operator.NOT_IN];\n case Operator.ARRAY_CONTAINS:\n return [\n Operator.ARRAY_CONTAINS,\n Operator.ARRAY_CONTAINS_ANY,\n Operator.NOT_IN\n ];\n case Operator.IN:\n return [Operator.ARRAY_CONTAINS_ANY, Operator.IN, Operator.NOT_IN];\n case Operator.ARRAY_CONTAINS_ANY:\n return [\n Operator.ARRAY_CONTAINS,\n Operator.ARRAY_CONTAINS_ANY,\n Operator.IN,\n Operator.NOT_IN\n ];\n case Operator.NOT_IN:\n return [\n Operator.ARRAY_CONTAINS,\n Operator.ARRAY_CONTAINS_ANY,\n Operator.IN,\n Operator.NOT_IN,\n Operator.NOT_EQUAL\n ];\n default:\n return [];\n }\n}\n\nfunction validateNewFieldFilter(\n query: InternalQuery,\n fieldFilter: FieldFilter\n): void {\n if (fieldFilter.isInequality()) {\n const existingInequality = getInequalityFilterField(query);\n const newInequality = fieldFilter.field;\n\n if (\n existingInequality !== null &&\n !existingInequality.isEqual(newInequality)\n ) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n 'Invalid query. All where filters with an inequality' +\n ' (<, <=, !=, not-in, >, or >=) must be on the same field. But you have' +\n ` inequality filters on '${existingInequality.toString()}'` +\n ` and '${newInequality.toString()}'`\n );\n }\n\n const firstOrderByField = getFirstOrderByField(query);\n if (firstOrderByField !== null) {\n validateOrderByAndInequalityMatch(\n query,\n newInequality,\n firstOrderByField\n );\n }\n }\n\n const conflictingOp = findOpInsideFilters(\n query.filters,\n conflictingOps(fieldFilter.op)\n );\n if (conflictingOp !== null) {\n // Special case when it's a duplicate op to give a slightly clearer error message.\n if (conflictingOp === fieldFilter.op) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n 'Invalid query. You cannot use more than one ' +\n `'${fieldFilter.op.toString()}' filter.`\n );\n } else {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n `Invalid query. You cannot use '${fieldFilter.op.toString()}' filters ` +\n `with '${conflictingOp.toString()}' filters.`\n );\n }\n }\n}\n\nfunction validateNewFilter(query: InternalQuery, filter: Filter): void {\n let testQuery = query;\n const subFilters = filter.getFlattenedFilters();\n for (const subFilter of subFilters) {\n validateNewFieldFilter(testQuery, subFilter);\n testQuery = queryWithAddedFilter(testQuery, subFilter);\n }\n}\n\n// Checks if any of the provided filter operators are included in the given list of filters and\n// returns the first one that is, or null if none are.\nfunction findOpInsideFilters(\n filters: Filter[],\n operators: Operator[]\n): Operator | null {\n for (const filter of filters) {\n for (const fieldFilter of filter.getFlattenedFilters()) {\n if (operators.indexOf(fieldFilter.op) >= 0) {\n return fieldFilter.op;\n }\n }\n }\n return null;\n}\n\nfunction validateNewOrderBy(query: InternalQuery, orderBy: OrderBy): void {\n if (getFirstOrderByField(query) === null) {\n // This is the first order by. It must match any inequality.\n const inequalityField = getInequalityFilterField(query);\n if (inequalityField !== null) {\n validateOrderByAndInequalityMatch(query, inequalityField, orderBy.field);\n }\n }\n}\n\nfunction validateOrderByAndInequalityMatch(\n baseQuery: InternalQuery,\n inequality: InternalFieldPath,\n orderBy: InternalFieldPath\n): void {\n if (!orderBy.isEqual(inequality)) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n `Invalid query. You have a where filter with an inequality ` +\n `(<, <=, !=, not-in, >, or >=) on field '${inequality.toString()}' ` +\n `and so you must also use '${inequality.toString()}' ` +\n `as your first argument to orderBy(), but your first orderBy() ` +\n `is on field '${orderBy.toString()}' instead.`\n );\n }\n}\n\nexport function validateQueryFilterConstraint(\n functionName: string,\n queryConstraint: AppliableConstraint\n): void {\n if (\n !(queryConstraint instanceof QueryFieldFilterConstraint) &&\n !(queryConstraint instanceof QueryCompositeFilterConstraint)\n ) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n `Function ${functionName}() requires AppliableConstraints created with a call to 'where(...)', 'or(...)', or 'and(...)'.`\n );\n }\n}\n\nfunction validateQueryConstraintArray(\n queryConstraint: AppliableConstraint[]\n): void {\n const compositeFilterCount = queryConstraint.filter(\n filter => filter instanceof QueryCompositeFilterConstraint\n ).length;\n const fieldFilterCount = queryConstraint.filter(\n filter => filter instanceof QueryFieldFilterConstraint\n ).length;\n\n if (\n compositeFilterCount > 1 ||\n (compositeFilterCount > 0 && fieldFilterCount > 0)\n ) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n 'InvalidQuery. When using composite filters, you cannot use ' +\n 'more than one filter at the top level. Consider nesting the multiple ' +\n 'filters within an `and(...)` statement. For example: ' +\n 'change `query(query, where(...), or(...))` to ' +\n '`query(query, and(where(...), or(...)))`.'\n );\n }\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport {\n DocumentData as PublicDocumentData,\n SetOptions as PublicSetOptions\n} from '@firebase/firestore-types';\nimport { getModularInstance } from '@firebase/util';\n\nimport { LimitType } from '../core/query';\nimport { DeleteMutation, Precondition } from '../model/mutation';\nimport {\n invokeBatchGetDocumentsRpc,\n invokeCommitRpc,\n invokeRunQueryRpc\n} from '../remote/datastore';\nimport { hardAssert } from '../util/assert';\nimport { ByteString } from '../util/byte_string';\nimport { cast } from '../util/input_validation';\n\nimport { Bytes } from './bytes';\nimport { getDatastore } from './components';\nimport { Firestore } from './database';\nimport { FieldPath } from './field_path';\nimport { validateHasExplicitOrderByForLimitToLast } from './query';\nimport {\n CollectionReference,\n doc,\n DocumentReference,\n PartialWithFieldValue,\n Query,\n SetOptions,\n UpdateData,\n WithFieldValue\n} from './reference';\nimport {\n DocumentSnapshot,\n QueryDocumentSnapshot,\n QuerySnapshot\n} from './snapshot';\nimport {\n newUserDataReader,\n ParsedUpdateData,\n parseSetData,\n parseUpdateData,\n parseUpdateVarargs,\n UntypedFirestoreDataConverter\n} from './user_data_reader';\nimport { AbstractUserDataWriter } from './user_data_writer';\n\n/**\n * Converts custom model object of type T into `DocumentData` by applying the\n * converter if it exists.\n *\n * This function is used when converting user objects to `DocumentData`\n * because we want to provide the user with a more specific error message if\n * their `set()` or fails due to invalid data originating from a `toFirestore()`\n * call.\n */\nexport function applyFirestoreDataConverter<T>(\n converter: UntypedFirestoreDataConverter<T> | null,\n value: WithFieldValue<T> | PartialWithFieldValue<T>,\n options?: PublicSetOptions\n): PublicDocumentData {\n let convertedValue;\n if (converter) {\n if (options && (options.merge || options.mergeFields)) {\n // Cast to `any` in order to satisfy the union type constraint on\n // toFirestore().\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n convertedValue = (converter as any).toFirestore(value, options);\n } else {\n convertedValue = converter.toFirestore(value as WithFieldValue<T>);\n }\n } else {\n convertedValue = value as PublicDocumentData;\n }\n return convertedValue;\n}\n\nexport class LiteUserDataWriter extends AbstractUserDataWriter {\n constructor(protected firestore: Firestore) {\n super();\n }\n\n protected convertBytes(bytes: ByteString): Bytes {\n return new Bytes(bytes);\n }\n\n protected convertReference(name: string): DocumentReference {\n const key = this.convertDocumentKey(name, this.firestore._databaseId);\n return new DocumentReference(this.firestore, /* converter= */ null, key);\n }\n}\n\n/**\n * Reads the document referred to by the specified document reference.\n *\n * All documents are directly fetched from the server, even if the document was\n * previously read or modified. Recent modifications are only reflected in the\n * retrieved `DocumentSnapshot` if they have already been applied by the\n * backend. If the client is offline, the read fails. If you like to use\n * caching or see local modifications, please use the full Firestore SDK.\n *\n * @param reference - The reference of the document to fetch.\n * @returns A Promise resolved with a `DocumentSnapshot` containing the current\n * document contents.\n */\nexport function getDoc<T>(\n reference: DocumentReference<T>\n): Promise<DocumentSnapshot<T>> {\n reference = cast<DocumentReference<T>>(reference, DocumentReference);\n const datastore = getDatastore(reference.firestore);\n const userDataWriter = new LiteUserDataWriter(reference.firestore);\n\n return invokeBatchGetDocumentsRpc(datastore, [reference._key]).then(\n result => {\n hardAssert(result.length === 1, 'Expected a single document result');\n const document = result[0];\n return new DocumentSnapshot<T>(\n reference.firestore,\n userDataWriter,\n reference._key,\n document.isFoundDocument() ? document : null,\n reference.converter\n );\n }\n );\n}\n\n/**\n * Executes the query and returns the results as a {@link QuerySnapshot}.\n *\n * All queries are executed directly by the server, even if the the query was\n * previously executed. Recent modifications are only reflected in the retrieved\n * results if they have already been applied by the backend. If the client is\n * offline, the operation fails. To see previously cached result and local\n * modifications, use the full Firestore SDK.\n *\n * @param query - The `Query` to execute.\n * @returns A Promise that will be resolved with the results of the query.\n */\nexport function getDocs<T>(query: Query<T>): Promise<QuerySnapshot<T>> {\n query = cast<Query<T>>(query, Query);\n validateHasExplicitOrderByForLimitToLast(query._query);\n\n const datastore = getDatastore(query.firestore);\n const userDataWriter = new LiteUserDataWriter(query.firestore);\n return invokeRunQueryRpc(datastore, query._query).then(result => {\n const docs = result.map(\n doc =>\n new QueryDocumentSnapshot<T>(\n query.firestore,\n userDataWriter,\n doc.key,\n doc,\n query.converter\n )\n );\n\n if (query._query.limitType === LimitType.Last) {\n // Limit to last queries reverse the orderBy constraint that was\n // specified by the user. As such, we need to reverse the order of the\n // results to return the documents in the expected order.\n docs.reverse();\n }\n\n return new QuerySnapshot<T>(query, docs);\n });\n}\n\n/**\n * Writes to the document referred to by the specified `DocumentReference`. If\n * the document does not yet exist, it will be created.\n *\n * The result of this write will only be reflected in document reads that occur\n * after the returned promise resolves. If the client is offline, the\n * write fails. If you would like to see local modifications or buffer writes\n * until the client is online, use the full Firestore SDK.\n *\n * @param reference - A reference to the document to write.\n * @param data - A map of the fields and values for the document.\n * @throws Error - If the provided input is not a valid Firestore document.\n * @returns A `Promise` resolved once the data has been successfully written\n * to the backend.\n */\nexport function setDoc<T>(\n reference: DocumentReference<T>,\n data: WithFieldValue<T>\n): Promise<void>;\n/**\n * Writes to the document referred to by the specified `DocumentReference`. If\n * the document does not yet exist, it will be created. If you provide `merge`\n * or `mergeFields`, the provided data can be merged into an existing document.\n *\n * The result of this write will only be reflected in document reads that occur\n * after the returned promise resolves. If the client is offline, the\n * write fails. If you would like to see local modifications or buffer writes\n * until the client is online, use the full Firestore SDK.\n *\n * @param reference - A reference to the document to write.\n * @param data - A map of the fields and values for the document.\n * @param options - An object to configure the set behavior.\n * @throws Error - If the provided input is not a valid Firestore document.\n * @returns A `Promise` resolved once the data has been successfully written\n * to the backend.\n */\nexport function setDoc<T>(\n reference: DocumentReference<T>,\n data: PartialWithFieldValue<T>,\n options: SetOptions\n): Promise<void>;\nexport function setDoc<T>(\n reference: DocumentReference<T>,\n data: PartialWithFieldValue<T>,\n options?: SetOptions\n): Promise<void> {\n reference = cast<DocumentReference<T>>(reference, DocumentReference);\n const convertedValue = applyFirestoreDataConverter(\n reference.converter,\n data,\n options\n );\n const dataReader = newUserDataReader(reference.firestore);\n const parsed = parseSetData(\n dataReader,\n 'setDoc',\n reference._key,\n convertedValue,\n reference.converter !== null,\n options\n );\n\n const datastore = getDatastore(reference.firestore);\n return invokeCommitRpc(datastore, [\n parsed.toMutation(reference._key, Precondition.none())\n ]);\n}\n\n/**\n * Updates fields in the document referred to by the specified\n * `DocumentReference`. The update will fail if applied to a document that does\n * not exist.\n *\n * The result of this update will only be reflected in document reads that occur\n * after the returned promise resolves. If the client is offline, the\n * update fails. If you would like to see local modifications or buffer writes\n * until the client is online, use the full Firestore SDK.\n *\n * @param reference - A reference to the document to update.\n * @param data - An object containing the fields and values with which to\n * update the document. Fields can contain dots to reference nested fields\n * within the document.\n * @throws Error - If the provided input is not valid Firestore data.\n * @returns A `Promise` resolved once the data has been successfully written\n * to the backend.\n */\nexport function updateDoc<T>(\n reference: DocumentReference<T>,\n data: UpdateData<T>\n): Promise<void>;\n/**\n * Updates fields in the document referred to by the specified\n * `DocumentReference` The update will fail if applied to a document that does\n * not exist.\n *\n * Nested fields can be updated by providing dot-separated field path\n * strings or by providing `FieldPath` objects.\n *\n * The result of this update will only be reflected in document reads that occur\n * after the returned promise resolves. If the client is offline, the\n * update fails. If you would like to see local modifications or buffer writes\n * until the client is online, use the full Firestore SDK.\n *\n * @param reference - A reference to the document to update.\n * @param field - The first field to update.\n * @param value - The first value.\n * @param moreFieldsAndValues - Additional key value pairs.\n * @throws Error - If the provided input is not valid Firestore data.\n * @returns A `Promise` resolved once the data has been successfully written\n * to the backend.\n */\nexport function updateDoc(\n reference: DocumentReference<unknown>,\n field: string | FieldPath,\n value: unknown,\n ...moreFieldsAndValues: unknown[]\n): Promise<void>;\nexport function updateDoc<T>(\n reference: DocumentReference<unknown>,\n fieldOrUpdateData: string | FieldPath | UpdateData<T>,\n value?: unknown,\n ...moreFieldsAndValues: unknown[]\n): Promise<void> {\n reference = cast<DocumentReference<unknown>>(reference, DocumentReference);\n const dataReader = newUserDataReader(reference.firestore);\n\n // For Compat types, we have to \"extract\" the underlying types before\n // performing validation.\n fieldOrUpdateData = getModularInstance(fieldOrUpdateData);\n\n let parsed: ParsedUpdateData;\n if (\n typeof fieldOrUpdateData === 'string' ||\n fieldOrUpdateData instanceof FieldPath\n ) {\n parsed = parseUpdateVarargs(\n dataReader,\n 'updateDoc',\n reference._key,\n fieldOrUpdateData,\n value,\n moreFieldsAndValues\n );\n } else {\n parsed = parseUpdateData(\n dataReader,\n 'updateDoc',\n reference._key,\n fieldOrUpdateData\n );\n }\n\n const datastore = getDatastore(reference.firestore);\n return invokeCommitRpc(datastore, [\n parsed.toMutation(reference._key, Precondition.exists(true))\n ]);\n}\n\n/**\n * Deletes the document referred to by the specified `DocumentReference`.\n *\n * The deletion will only be reflected in document reads that occur after the\n * returned promise resolves. If the client is offline, the\n * delete fails. If you would like to see local modifications or buffer writes\n * until the client is online, use the full Firestore SDK.\n *\n * @param reference - A reference to the document to delete.\n * @returns A `Promise` resolved once the document has been successfully\n * deleted from the backend.\n */\nexport function deleteDoc(\n reference: DocumentReference<unknown>\n): Promise<void> {\n reference = cast<DocumentReference<unknown>>(reference, DocumentReference);\n const datastore = getDatastore(reference.firestore);\n return invokeCommitRpc(datastore, [\n new DeleteMutation(reference._key, Precondition.none())\n ]);\n}\n\n/**\n * Add a new document to specified `CollectionReference` with the given data,\n * assigning it a document ID automatically.\n *\n * The result of this write will only be reflected in document reads that occur\n * after the returned promise resolves. If the client is offline, the\n * write fails. If you would like to see local modifications or buffer writes\n * until the client is online, use the full Firestore SDK.\n *\n * @param reference - A reference to the collection to add this document to.\n * @param data - An Object containing the data for the new document.\n * @throws Error - If the provided input is not a valid Firestore document.\n * @returns A `Promise` resolved with a `DocumentReference` pointing to the\n * newly created document after it has been written to the backend.\n */\nexport function addDoc<T>(\n reference: CollectionReference<T>,\n data: WithFieldValue<T>\n): Promise<DocumentReference<T>> {\n reference = cast<CollectionReference<T>>(reference, CollectionReference);\n const docRef = doc(reference);\n\n const convertedValue = applyFirestoreDataConverter(\n reference.converter,\n data as PartialWithFieldValue<T>\n );\n\n const dataReader = newUserDataReader(reference.firestore);\n const parsed = parseSetData(\n dataReader,\n 'addDoc',\n docRef._key,\n convertedValue,\n docRef.converter !== null,\n {}\n );\n\n const datastore = getDatastore(reference.firestore);\n return invokeCommitRpc(datastore, [\n parsed.toMutation(docRef._key, Precondition.exists(false))\n ]).then(() => docRef);\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { DocumentData } from '@firebase/firestore-types';\n\nimport { DatabaseId } from '../core/database_info';\nimport { DocumentKey } from '../model/document_key';\nimport {\n normalizeByteString,\n normalizeNumber,\n normalizeTimestamp\n} from '../model/normalize';\nimport { ResourcePath } from '../model/path';\nimport {\n getLocalWriteTime,\n getPreviousValue\n} from '../model/server_timestamps';\nimport { TypeOrder } from '../model/type_order';\nimport { typeOrder } from '../model/values';\nimport {\n ArrayValue as ProtoArrayValue,\n LatLng as ProtoLatLng,\n MapValue as ProtoMapValue,\n Timestamp as ProtoTimestamp,\n Value as ProtoValue\n} from '../protos/firestore_proto_api';\nimport { isValidResourceName } from '../remote/serializer';\nimport { fail, hardAssert } from '../util/assert';\nimport { ByteString } from '../util/byte_string';\nimport { logError } from '../util/log';\nimport { forEach } from '../util/obj';\n\nimport { GeoPoint } from './geo_point';\nimport { Timestamp } from './timestamp';\n\nexport type ServerTimestampBehavior = 'estimate' | 'previous' | 'none';\n\n/**\n * Converts Firestore's internal types to the JavaScript types that we expose\n * to the user.\n *\n * @internal\n */\nexport abstract class AbstractUserDataWriter {\n convertValue(\n value: ProtoValue,\n serverTimestampBehavior: ServerTimestampBehavior = 'none'\n ): unknown {\n switch (typeOrder(value)) {\n case TypeOrder.NullValue:\n return null;\n case TypeOrder.BooleanValue:\n return value.booleanValue!;\n case TypeOrder.NumberValue:\n return normalizeNumber(value.integerValue || value.doubleValue);\n case TypeOrder.TimestampValue:\n return this.convertTimestamp(value.timestampValue!);\n case TypeOrder.ServerTimestampValue:\n return this.convertServerTimestamp(value, serverTimestampBehavior);\n case TypeOrder.StringValue:\n return value.stringValue!;\n case TypeOrder.BlobValue:\n return this.convertBytes(normalizeByteString(value.bytesValue!));\n case TypeOrder.RefValue:\n return this.convertReference(value.referenceValue!);\n case TypeOrder.GeoPointValue:\n return this.convertGeoPoint(value.geoPointValue!);\n case TypeOrder.ArrayValue:\n return this.convertArray(value.arrayValue!, serverTimestampBehavior);\n case TypeOrder.ObjectValue:\n return this.convertObject(value.mapValue!, serverTimestampBehavior);\n default:\n throw fail('Invalid value type: ' + JSON.stringify(value));\n }\n }\n\n private convertObject(\n mapValue: ProtoMapValue,\n serverTimestampBehavior: ServerTimestampBehavior\n ): DocumentData {\n const result: DocumentData = {};\n forEach(mapValue.fields, (key, value) => {\n result[key] = this.convertValue(value, serverTimestampBehavior);\n });\n return result;\n }\n\n private convertGeoPoint(value: ProtoLatLng): GeoPoint {\n return new GeoPoint(\n normalizeNumber(value.latitude),\n normalizeNumber(value.longitude)\n );\n }\n\n private convertArray(\n arrayValue: ProtoArrayValue,\n serverTimestampBehavior: ServerTimestampBehavior\n ): unknown[] {\n return (arrayValue.values || []).map(value =>\n this.convertValue(value, serverTimestampBehavior)\n );\n }\n\n private convertServerTimestamp(\n value: ProtoValue,\n serverTimestampBehavior: ServerTimestampBehavior\n ): unknown {\n switch (serverTimestampBehavior) {\n case 'previous':\n const previousValue = getPreviousValue(value);\n if (previousValue == null) {\n return null;\n }\n return this.convertValue(previousValue, serverTimestampBehavior);\n case 'estimate':\n return this.convertTimestamp(getLocalWriteTime(value));\n default:\n return null;\n }\n }\n\n private convertTimestamp(value: ProtoTimestamp): Timestamp {\n const normalizedValue = normalizeTimestamp(value);\n return new Timestamp(normalizedValue.seconds, normalizedValue.nanos);\n }\n\n protected convertDocumentKey(\n name: string,\n expectedDatabaseId: DatabaseId\n ): DocumentKey {\n const resourcePath = ResourcePath.fromString(name);\n hardAssert(\n isValidResourceName(resourcePath),\n 'ReferenceValue is not valid ' + name\n );\n const databaseId = new DatabaseId(resourcePath.get(1), resourcePath.get(3));\n const key = new DocumentKey(resourcePath.popFirst(5));\n\n if (!databaseId.isEqual(expectedDatabaseId)) {\n // TODO(b/64130202): Somehow support foreign references.\n logError(\n `Document ${key} contains a document ` +\n `reference within a different database (` +\n `${databaseId.projectId}/${databaseId.database}) which is not ` +\n `supported. It will be treated as a reference in the current ` +\n `database (${expectedDatabaseId.projectId}/${expectedDatabaseId.database}) ` +\n `instead.`\n );\n }\n return key;\n }\n\n protected abstract convertReference(name: string): unknown;\n\n protected abstract convertBytes(bytes: ByteString): unknown;\n}\n","/**\n * @license\n * Copyright 2022 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { deepEqual } from '@firebase/util';\n\nimport { CountQueryRunner } from '../core/count_query_runner';\nimport { cast } from '../util/input_validation';\n\nimport {\n AggregateField,\n AggregateQuerySnapshot,\n AggregateSpec\n} from './aggregate_types';\nimport { getDatastore } from './components';\nimport { Firestore } from './database';\nimport { Query, queryEqual } from './reference';\nimport { LiteUserDataWriter } from './reference_impl';\n\n/**\n * Calculates the number of documents in the result set of the given query,\n * without actually downloading the documents.\n *\n * Using this function to count the documents is efficient because only the\n * final count, not the documents' data, is downloaded. This function can even\n * count the documents if the result set would be prohibitively large to\n * download entirely (e.g. thousands of documents).\n *\n * @param query - The query whose result set size to calculate.\n * @returns A Promise that will be resolved with the count; the count can be\n * retrieved from `snapshot.data().count`, where `snapshot` is the\n * `AggregateQuerySnapshot` to which the returned Promise resolves.\n */\nexport function getCount(\n query: Query<unknown>\n): Promise<AggregateQuerySnapshot<{ count: AggregateField<number> }>> {\n const firestore = cast(query.firestore, Firestore);\n const datastore = getDatastore(firestore);\n const userDataWriter = new LiteUserDataWriter(firestore);\n return new CountQueryRunner(query, datastore, userDataWriter).run();\n}\n\n/**\n * Compares two `AggregateQuerySnapshot` instances for equality.\n *\n * Two `AggregateQuerySnapshot` instances are considered \"equal\" if they have\n * underlying queries that compare equal, and the same data.\n *\n * @param left - The first `AggregateQuerySnapshot` to compare.\n * @param right - The second `AggregateQuerySnapshot` to compare.\n *\n * @returns `true` if the objects are \"equal\", as defined above, or `false`\n * otherwise.\n */\nexport function aggregateQuerySnapshotEqual<T extends AggregateSpec>(\n left: AggregateQuerySnapshot<T>,\n right: AggregateQuerySnapshot<T>\n): boolean {\n return (\n queryEqual(left.query, right.query) && deepEqual(left.data(), right.data())\n );\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { FieldValue } from './field_value';\nimport {\n ArrayRemoveFieldValueImpl,\n ArrayUnionFieldValueImpl,\n DeleteFieldValueImpl,\n NumericIncrementFieldValueImpl,\n ServerTimestampFieldValueImpl\n} from './user_data_reader';\n\n/**\n * Returns a sentinel for use with {@link @firebase/firestore/lite#(updateDoc:1)} or\n * {@link @firebase/firestore/lite#(setDoc:1)} with `{merge: true}` to mark a field for deletion.\n */\nexport function deleteField(): FieldValue {\n return new DeleteFieldValueImpl('deleteField');\n}\n\n/**\n * Returns a sentinel used with {@link @firebase/firestore/lite#(setDoc:1)} or {@link @firebase/firestore/lite#(updateDoc:1)} to\n * include a server-generated timestamp in the written data.\n */\nexport function serverTimestamp(): FieldValue {\n return new ServerTimestampFieldValueImpl('serverTimestamp');\n}\n\n/**\n * Returns a special value that can be used with {@link @firebase/firestore/lite#(setDoc:1)} or {@link\n * @firebase/firestore/lite#(updateDoc:1)} that tells the server to union the given elements with any array\n * value that already exists on the server. Each specified element that doesn't\n * already exist in the array will be added to the end. If the field being\n * modified is not already an array it will be overwritten with an array\n * containing exactly the specified elements.\n *\n * @param elements - The elements to union into the array.\n * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or\n * `updateDoc()`.\n */\nexport function arrayUnion(...elements: unknown[]): FieldValue {\n // NOTE: We don't actually parse the data until it's used in set() or\n // update() since we'd need the Firestore instance to do this.\n return new ArrayUnionFieldValueImpl('arrayUnion', elements);\n}\n\n/**\n * Returns a special value that can be used with {@link (setDoc:1)} or {@link\n * updateDoc:1} that tells the server to remove the given elements from any\n * array value that already exists on the server. All instances of each element\n * specified will be removed from the array. If the field being modified is not\n * already an array it will be overwritten with an empty array.\n *\n * @param elements - The elements to remove from the array.\n * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or\n * `updateDoc()`\n */\nexport function arrayRemove(...elements: unknown[]): FieldValue {\n // NOTE: We don't actually parse the data until it's used in set() or\n // update() since we'd need the Firestore instance to do this.\n return new ArrayRemoveFieldValueImpl('arrayRemove', elements);\n}\n\n/**\n * Returns a special value that can be used with {@link @firebase/firestore/lite#(setDoc:1)} or {@link\n * @firebase/firestore/lite#(updateDoc:1)} that tells the server to increment the field's current value by\n * the given value.\n *\n * If either the operand or the current field value uses floating point\n * precision, all arithmetic follows IEEE 754 semantics. If both values are\n * integers, values outside of JavaScript's safe number range\n * (`Number.MIN_SAFE_INTEGER` to `Number.MAX_SAFE_INTEGER`) are also subject to\n * precision loss. Furthermore, once processed by the Firestore backend, all\n * integer operations are capped between -2^63 and 2^63-1.\n *\n * If the current field value is not of type `number`, or if the field does not\n * yet exist, the transformation sets the field to the given value.\n *\n * @param n - The value to increment by.\n * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or\n * `updateDoc()`\n */\nexport function increment(n: number): FieldValue {\n return new NumericIncrementFieldValueImpl('increment', n);\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Compat, getModularInstance } from '@firebase/util';\n\nimport { DeleteMutation, Mutation, Precondition } from '../model/mutation';\nimport { invokeCommitRpc } from '../remote/datastore';\nimport { Code, FirestoreError } from '../util/error';\nimport { cast } from '../util/input_validation';\n\nimport { getDatastore } from './components';\nimport { Firestore } from './database';\nimport { FieldPath } from './field_path';\nimport {\n DocumentReference,\n PartialWithFieldValue,\n SetOptions,\n UpdateData,\n WithFieldValue\n} from './reference';\nimport { applyFirestoreDataConverter } from './reference_impl';\nimport {\n newUserDataReader,\n parseSetData,\n parseUpdateData,\n parseUpdateVarargs,\n UserDataReader\n} from './user_data_reader';\n\n/**\n * A write batch, used to perform multiple writes as a single atomic unit.\n *\n * A `WriteBatch` object can be acquired by calling {@link writeBatch}. It\n * provides methods for adding writes to the write batch. None of the writes\n * will be committed (or visible locally) until {@link WriteBatch.commit} is\n * called.\n */\nexport class WriteBatch {\n // This is the lite version of the WriteBatch API used in the legacy SDK. The\n // class is a close copy but takes different input types.\n\n private readonly _dataReader: UserDataReader;\n private _mutations = [] as Mutation[];\n private _committed = false;\n\n /** @hideconstructor */\n constructor(\n private readonly _firestore: Firestore,\n private readonly _commitHandler: (m: Mutation[]) => Promise<void>\n ) {\n this._dataReader = newUserDataReader(_firestore);\n }\n\n /**\n * Writes to the document referred to by the provided {@link\n * DocumentReference}. If the document does not exist yet, it will be created.\n *\n * @param documentRef - A reference to the document to be set.\n * @param data - An object of the fields and values for the document.\n * @returns This `WriteBatch` instance. Used for chaining method calls.\n */\n set<T>(\n documentRef: DocumentReference<T>,\n data: WithFieldValue<T>\n ): WriteBatch;\n /**\n * Writes to the document referred to by the provided {@link\n * DocumentReference}. If the document does not exist yet, it will be created.\n * If you provide `merge` or `mergeFields`, the provided data can be merged\n * into an existing document.\n *\n * @param documentRef - A reference to the document to be set.\n * @param data - An object of the fields and values for the document.\n * @param options - An object to configure the set behavior.\n * @throws Error - If the provided input is not a valid Firestore document.\n * @returns This `WriteBatch` instance. Used for chaining method calls.\n */\n set<T>(\n documentRef: DocumentReference<T>,\n data: PartialWithFieldValue<T>,\n options: SetOptions\n ): WriteBatch;\n set<T>(\n documentRef: DocumentReference<T>,\n data: WithFieldValue<T> | PartialWithFieldValue<T>,\n options?: SetOptions\n ): WriteBatch {\n this._verifyNotCommitted();\n const ref = validateReference(documentRef, this._firestore);\n\n const convertedValue = applyFirestoreDataConverter(\n ref.converter,\n data,\n options\n );\n const parsed = parseSetData(\n this._dataReader,\n 'WriteBatch.set',\n ref._key,\n convertedValue,\n ref.converter !== null,\n options\n );\n this._mutations.push(parsed.toMutation(ref._key, Precondition.none()));\n return this;\n }\n\n /**\n * Updates fields in the document referred to by the provided {@link\n * DocumentReference}. The update will fail if applied to a document that does\n * not exist.\n *\n * @param documentRef - A reference to the document to be updated.\n * @param data - An object containing the fields and values with which to\n * update the document. Fields can contain dots to reference nested fields\n * within the document.\n * @throws Error - If the provided input is not valid Firestore data.\n * @returns This `WriteBatch` instance. Used for chaining method calls.\n */\n update<T>(documentRef: DocumentReference<T>, data: UpdateData<T>): WriteBatch;\n /**\n * Updates fields in the document referred to by this {@link\n * DocumentReference}. The update will fail if applied to a document that does\n * not exist.\n *\n * Nested fields can be update by providing dot-separated field path strings\n * or by providing `FieldPath` objects.\n *\n * @param documentRef - A reference to the document to be updated.\n * @param field - The first field to update.\n * @param value - The first value.\n * @param moreFieldsAndValues - Additional key value pairs.\n * @throws Error - If the provided input is not valid Firestore data.\n * @returns This `WriteBatch` instance. Used for chaining method calls.\n */\n update(\n documentRef: DocumentReference<unknown>,\n field: string | FieldPath,\n value: unknown,\n ...moreFieldsAndValues: unknown[]\n ): WriteBatch;\n update<T>(\n documentRef: DocumentReference<T>,\n fieldOrUpdateData: string | FieldPath | UpdateData<T>,\n value?: unknown,\n ...moreFieldsAndValues: unknown[]\n ): WriteBatch {\n this._verifyNotCommitted();\n const ref = validateReference(documentRef, this._firestore);\n\n // For Compat types, we have to \"extract\" the underlying types before\n // performing validation.\n fieldOrUpdateData = getModularInstance(fieldOrUpdateData);\n\n let parsed;\n if (\n typeof fieldOrUpdateData === 'string' ||\n fieldOrUpdateData instanceof FieldPath\n ) {\n parsed = parseUpdateVarargs(\n this._dataReader,\n 'WriteBatch.update',\n ref._key,\n fieldOrUpdateData,\n value,\n moreFieldsAndValues\n );\n } else {\n parsed = parseUpdateData(\n this._dataReader,\n 'WriteBatch.update',\n ref._key,\n fieldOrUpdateData\n );\n }\n\n this._mutations.push(\n parsed.toMutation(ref._key, Precondition.exists(true))\n );\n return this;\n }\n\n /**\n * Deletes the document referred to by the provided {@link DocumentReference}.\n *\n * @param documentRef - A reference to the document to be deleted.\n * @returns This `WriteBatch` instance. Used for chaining method calls.\n */\n delete(documentRef: DocumentReference<unknown>): WriteBatch {\n this._verifyNotCommitted();\n const ref = validateReference(documentRef, this._firestore);\n this._mutations = this._mutations.concat(\n new DeleteMutation(ref._key, Precondition.none())\n );\n return this;\n }\n\n /**\n * Commits all of the writes in this write batch as a single atomic unit.\n *\n * The result of these writes will only be reflected in document reads that\n * occur after the returned promise resolves. If the client is offline, the\n * write fails. If you would like to see local modifications or buffer writes\n * until the client is online, use the full Firestore SDK.\n *\n * @returns A `Promise` resolved once all of the writes in the batch have been\n * successfully written to the backend as an atomic unit (note that it won't\n * resolve while you're offline).\n */\n commit(): Promise<void> {\n this._verifyNotCommitted();\n this._committed = true;\n if (this._mutations.length > 0) {\n return this._commitHandler(this._mutations);\n }\n\n return Promise.resolve();\n }\n\n private _verifyNotCommitted(): void {\n if (this._committed) {\n throw new FirestoreError(\n Code.FAILED_PRECONDITION,\n 'A write batch can no longer be used after commit() ' +\n 'has been called.'\n );\n }\n }\n}\n\nexport function validateReference<T>(\n documentRef: DocumentReference<T> | Compat<DocumentReference<T>>,\n firestore: Firestore\n): DocumentReference<T> {\n documentRef = getModularInstance(documentRef);\n\n if (documentRef.firestore !== firestore) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n 'Provided document reference is from a different Firestore instance.'\n );\n } else {\n return documentRef as DocumentReference<T>;\n }\n}\n\n/**\n * Creates a write batch, used for performing multiple writes as a single\n * atomic operation. The maximum number of writes allowed in a single WriteBatch\n * is 500.\n *\n * The result of these writes will only be reflected in document reads that\n * occur after the returned promise resolves. If the client is offline, the\n * write fails. If you would like to see local modifications or buffer writes\n * until the client is online, use the full Firestore SDK.\n *\n * @returns A `WriteBatch` that can be used to atomically execute multiple\n * writes.\n */\nexport function writeBatch(firestore: Firestore): WriteBatch {\n firestore = cast(firestore, Firestore);\n const datastore = getDatastore(firestore);\n return new WriteBatch(firestore, writes =>\n invokeCommitRpc(datastore, writes)\n );\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { ParsedSetData, ParsedUpdateData } from '../lite-api/user_data_reader';\nimport { Document } from '../model/document';\nimport { DocumentKey } from '../model/document_key';\nimport {\n DeleteMutation,\n Mutation,\n Precondition,\n VerifyMutation\n} from '../model/mutation';\nimport {\n Datastore,\n invokeBatchGetDocumentsRpc,\n invokeCommitRpc\n} from '../remote/datastore';\nimport { fail, debugAssert } from '../util/assert';\nimport { Code, FirestoreError } from '../util/error';\n\nimport { SnapshotVersion } from './snapshot_version';\n\n/**\n * Internal transaction object responsible for accumulating the mutations to\n * perform and the base versions for any documents read.\n */\nexport class Transaction {\n // The version of each document that was read during this transaction.\n private readVersions = new Map</* path */ string, SnapshotVersion>();\n private mutations: Mutation[] = [];\n private committed = false;\n\n /**\n * A deferred usage error that occurred previously in this transaction that\n * will cause the transaction to fail once it actually commits.\n */\n private lastWriteError: FirestoreError | null = null;\n\n /**\n * Set of documents that have been written in the transaction.\n *\n * When there's more than one write to the same key in a transaction, any\n * writes after the first are handled differently.\n */\n private writtenDocs: Set</* path= */ string> = new Set();\n\n constructor(private datastore: Datastore) {}\n\n async lookup(keys: DocumentKey[]): Promise<Document[]> {\n this.ensureCommitNotCalled();\n\n if (this.mutations.length > 0) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n 'Firestore transactions require all reads to be executed before all writes.'\n );\n }\n const docs = await invokeBatchGetDocumentsRpc(this.datastore, keys);\n docs.forEach(doc => this.recordVersion(doc));\n return docs;\n }\n\n set(key: DocumentKey, data: ParsedSetData): void {\n this.write(data.toMutation(key, this.precondition(key)));\n this.writtenDocs.add(key.toString());\n }\n\n update(key: DocumentKey, data: ParsedUpdateData): void {\n try {\n this.write(data.toMutation(key, this.preconditionForUpdate(key)));\n } catch (e) {\n this.lastWriteError = e as FirestoreError | null;\n }\n this.writtenDocs.add(key.toString());\n }\n\n delete(key: DocumentKey): void {\n this.write(new DeleteMutation(key, this.precondition(key)));\n this.writtenDocs.add(key.toString());\n }\n\n async commit(): Promise<void> {\n this.ensureCommitNotCalled();\n\n if (this.lastWriteError) {\n throw this.lastWriteError;\n }\n const unwritten = this.readVersions;\n // For each mutation, note that the doc was written.\n this.mutations.forEach(mutation => {\n unwritten.delete(mutation.key.toString());\n });\n // For each document that was read but not written to, we want to perform\n // a `verify` operation.\n unwritten.forEach((_, path) => {\n const key = DocumentKey.fromPath(path);\n this.mutations.push(new VerifyMutation(key, this.precondition(key)));\n });\n await invokeCommitRpc(this.datastore, this.mutations);\n this.committed = true;\n }\n\n private recordVersion(doc: Document): void {\n let docVersion: SnapshotVersion;\n\n if (doc.isFoundDocument()) {\n docVersion = doc.version;\n } else if (doc.isNoDocument()) {\n // Represent a deleted doc using SnapshotVersion.min().\n docVersion = SnapshotVersion.min();\n } else {\n throw fail('Document in a transaction was a ' + doc.constructor.name);\n }\n\n const existingVersion = this.readVersions.get(doc.key.toString());\n if (existingVersion) {\n if (!docVersion.isEqual(existingVersion)) {\n // This transaction will fail no matter what.\n throw new FirestoreError(\n Code.ABORTED,\n 'Document version changed between two reads.'\n );\n }\n } else {\n this.readVersions.set(doc.key.toString(), docVersion);\n }\n }\n\n /**\n * Returns the version of this document when it was read in this transaction,\n * as a precondition, or no precondition if it was not read.\n */\n private precondition(key: DocumentKey): Precondition {\n const version = this.readVersions.get(key.toString());\n if (!this.writtenDocs.has(key.toString()) && version) {\n if (version.isEqual(SnapshotVersion.min())) {\n return Precondition.exists(false);\n } else {\n return Precondition.updateTime(version);\n }\n } else {\n return Precondition.none();\n }\n }\n\n /**\n * Returns the precondition for a document if the operation is an update.\n */\n private preconditionForUpdate(key: DocumentKey): Precondition {\n const version = this.readVersions.get(key.toString());\n // The first time a document is written, we want to take into account the\n // read time and existence\n if (!this.writtenDocs.has(key.toString()) && version) {\n if (version.isEqual(SnapshotVersion.min())) {\n // The document doesn't exist, so fail the transaction.\n\n // This has to be validated locally because you can't send a\n // precondition that a document does not exist without changing the\n // semantics of the backend write to be an insert. This is the reverse\n // of what we want, since we want to assert that the document doesn't\n // exist but then send the update and have it fail. Since we can't\n // express that to the backend, we have to validate locally.\n\n // Note: this can change once we can send separate verify writes in the\n // transaction.\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n \"Can't update a document that doesn't exist.\"\n );\n }\n // Document exists, base precondition on document update time.\n return Precondition.updateTime(version);\n } else {\n // Document was not read, so we just use the preconditions for a blind\n // update.\n return Precondition.exists(true);\n }\n }\n\n private write(mutation: Mutation): void {\n this.ensureCommitNotCalled();\n this.mutations.push(mutation);\n }\n\n private ensureCommitNotCalled(): void {\n debugAssert(\n !this.committed,\n 'A transaction object cannot be used after its update callback has been invoked.'\n );\n }\n}\n","/**\n * @license\n * Copyright 2022 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Code, FirestoreError } from '../util/error';\n\nexport const DEFAULT_TRANSACTION_OPTIONS: TransactionOptions = {\n maxAttempts: 5\n};\n\n/**\n * Options to customize transaction behavior.\n */\nexport declare interface TransactionOptions {\n /** Maximum number of attempts to commit, after which transaction fails. Default is 5. */\n readonly maxAttempts: number;\n}\n\nexport function validateTransactionOptions(options: TransactionOptions): void {\n if (options.maxAttempts < 1) {\n throw new FirestoreError(\n Code.INVALID_ARGUMENT,\n 'Max attempts must be at least 1'\n );\n }\n}\n","/**\n * @license\n * Copyright 2019 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { ExponentialBackoff } from '../remote/backoff';\nimport { Datastore } from '../remote/datastore';\nimport { isPermanentError } from '../remote/rpc_error';\nimport { AsyncQueue, TimerId } from '../util/async_queue';\nimport { FirestoreError } from '../util/error';\nimport { Deferred } from '../util/promise';\nimport { isNullOrUndefined } from '../util/types';\n\nimport { Transaction } from './transaction';\nimport { TransactionOptions } from './transaction_options';\n\n/**\n * TransactionRunner encapsulates the logic needed to run and retry transactions\n * with backoff.\n */\nexport class TransactionRunner<T> {\n private attemptsRemaining: number;\n private backoff: ExponentialBackoff;\n\n constructor(\n private readonly asyncQueue: AsyncQueue,\n private readonly datastore: Datastore,\n private readonly options: TransactionOptions,\n private readonly updateFunction: (transaction: Transaction) => Promise<T>,\n private readonly deferred: Deferred<T>\n ) {\n this.attemptsRemaining = options.maxAttempts;\n this.backoff = new ExponentialBackoff(\n this.asyncQueue,\n TimerId.TransactionRetry\n );\n }\n\n /** Runs the transaction and sets the result on deferred. */\n run(): void {\n this.attemptsRemaining -= 1;\n this.runWithBackOff();\n }\n\n private runWithBackOff(): void {\n this.backoff.backoffAndRun(async () => {\n const transaction = new Transaction(this.datastore);\n const userPromise = this.tryRunUpdateFunction(transaction);\n if (userPromise) {\n userPromise\n .then(result => {\n this.asyncQueue.enqueueAndForget(() => {\n return transaction\n .commit()\n .then(() => {\n this.deferred.resolve(result);\n })\n .catch(commitError => {\n this.handleTransactionError(commitError);\n });\n });\n })\n .catch(userPromiseError => {\n this.handleTransactionError(userPromiseError);\n });\n }\n });\n }\n\n private tryRunUpdateFunction(transaction: Transaction): Promise<T> | null {\n try {\n const userPromise = this.updateFunction(transaction);\n if (\n isNullOrUndefined(userPromise) ||\n !userPromise.catch ||\n !userPromise.then\n ) {\n this.deferred.reject(\n Error('Transaction callback must return a Promise')\n );\n return null;\n }\n return userPromise;\n } catch (error) {\n // Do not retry errors thrown by user provided updateFunction.\n this.deferred.reject(error as Error);\n return null;\n }\n }\n\n private handleTransactionError(error: Error): void {\n if (this.attemptsRemaining > 0 && this.isRetryableTransactionError(error)) {\n this.attemptsRemaining -= 1;\n this.asyncQueue.enqueueAndForget(() => {\n this.runWithBackOff();\n return Promise.resolve();\n });\n } else {\n this.deferred.reject(error);\n }\n }\n\n private isRetryableTransactionError(error: Error): boolean {\n if (error.name === 'FirebaseError') {\n // In transactions, the backend will fail outdated reads with FAILED_PRECONDITION and\n // non-matching document versions with ABORTED. These errors should be retried.\n const code = (error as FirestoreError).code;\n return (\n code === 'aborted' ||\n code === 'failed-precondition' ||\n code === 'already-exists' ||\n !isPermanentError(code)\n );\n }\n return false;\n }\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/** The Platform's 'window' implementation or null if not available. */\nexport function getWindow(): Window | null {\n // `window` is not always available, e.g. in ReactNative and WebWorkers.\n // eslint-disable-next-line no-restricted-globals\n return typeof window !== 'undefined' ? window : null;\n}\n\n/** The Platform's 'document' implementation or null if not available. */\nexport function getDocument(): Document | null {\n // `document` is not always available, e.g. in ReactNative and WebWorkers.\n // eslint-disable-next-line no-restricted-globals\n return typeof document !== 'undefined' ? document : null;\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { isIndexedDbTransactionError } from '../local/simple_db';\n\nimport { Code, FirestoreError } from './error';\nimport { logError } from './log';\nimport { Deferred } from './promise';\n\nconst LOG_TAG = 'AsyncQueue';\n\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\ntype TimerHandle = any;\n\n/**\n * Wellknown \"timer\" IDs used when scheduling delayed operations on the\n * AsyncQueue. These IDs can then be used from tests to check for the presence\n * of operations or to run them early.\n *\n * The string values are used when encoding these timer IDs in JSON spec tests.\n */\nexport const enum TimerId {\n /** All can be used with runDelayedOperationsEarly() to run all timers. */\n All = 'all',\n\n /**\n * The following 5 timers are used in persistent_stream.ts for the listen and\n * write streams. The \"Idle\" timer is used to close the stream due to\n * inactivity. The \"ConnectionBackoff\" timer is used to restart a stream once\n * the appropriate backoff delay has elapsed. The health check is used to mark\n * a stream healthy if it has not received an error during its initial setup.\n */\n ListenStreamIdle = 'listen_stream_idle',\n ListenStreamConnectionBackoff = 'listen_stream_connection_backoff',\n WriteStreamIdle = 'write_stream_idle',\n WriteStreamConnectionBackoff = 'write_stream_connection_backoff',\n HealthCheckTimeout = 'health_check_timeout',\n\n /**\n * A timer used in online_state_tracker.ts to transition from\n * OnlineState.Unknown to Offline after a set timeout, rather than waiting\n * indefinitely for success or failure.\n */\n OnlineStateTimeout = 'online_state_timeout',\n\n /**\n * A timer used to update the client metadata in IndexedDb, which is used\n * to determine the primary leaseholder.\n */\n ClientMetadataRefresh = 'client_metadata_refresh',\n\n /** A timer used to periodically attempt LRU Garbage collection */\n LruGarbageCollection = 'lru_garbage_collection',\n\n /**\n * A timer used to retry transactions. Since there can be multiple concurrent\n * transactions, multiple of these may be in the queue at a given time.\n */\n TransactionRetry = 'transaction_retry',\n\n /**\n * A timer used to retry operations scheduled via retryable AsyncQueue\n * operations.\n */\n AsyncQueueRetry = 'async_queue_retry',\n\n /**\n * A timer used to periodically attempt index backfill.\n */\n IndexBackfill = 'index_backfill'\n}\n\n/**\n * Represents an operation scheduled to be run in the future on an AsyncQueue.\n *\n * It is created via DelayedOperation.createAndSchedule().\n *\n * Supports cancellation (via cancel()) and early execution (via skipDelay()).\n *\n * Note: We implement `PromiseLike` instead of `Promise`, as the `Promise` type\n * in newer versions of TypeScript defines `finally`, which is not available in\n * IE.\n */\nexport class DelayedOperation<T extends unknown> implements PromiseLike<T> {\n // handle for use with clearTimeout(), or null if the operation has been\n // executed or canceled already.\n private timerHandle: TimerHandle | null;\n\n private readonly deferred = new Deferred<T>();\n\n private constructor(\n private readonly asyncQueue: AsyncQueue,\n readonly timerId: TimerId,\n readonly targetTimeMs: number,\n private readonly op: () => Promise<T>,\n private readonly removalCallback: (op: DelayedOperation<T>) => void\n ) {\n // It's normal for the deferred promise to be canceled (due to cancellation)\n // and so we attach a dummy catch callback to avoid\n // 'UnhandledPromiseRejectionWarning' log spam.\n this.deferred.promise.catch(err => {});\n }\n\n /**\n * Creates and returns a DelayedOperation that has been scheduled to be\n * executed on the provided asyncQueue after the provided delayMs.\n *\n * @param asyncQueue - The queue to schedule the operation on.\n * @param id - A Timer ID identifying the type of operation this is.\n * @param delayMs - The delay (ms) before the operation should be scheduled.\n * @param op - The operation to run.\n * @param removalCallback - A callback to be called synchronously once the\n * operation is executed or canceled, notifying the AsyncQueue to remove it\n * from its delayedOperations list.\n * PORTING NOTE: This exists to prevent making removeDelayedOperation() and\n * the DelayedOperation class public.\n */\n static createAndSchedule<R extends unknown>(\n asyncQueue: AsyncQueue,\n timerId: TimerId,\n delayMs: number,\n op: () => Promise<R>,\n removalCallback: (op: DelayedOperation<R>) => void\n ): DelayedOperation<R> {\n const targetTime = Date.now() + delayMs;\n const delayedOp = new DelayedOperation(\n asyncQueue,\n timerId,\n targetTime,\n op,\n removalCallback\n );\n delayedOp.start(delayMs);\n return delayedOp;\n }\n\n /**\n * Starts the timer. This is called immediately after construction by\n * createAndSchedule().\n */\n private start(delayMs: number): void {\n this.timerHandle = setTimeout(() => this.handleDelayElapsed(), delayMs);\n }\n\n /**\n * Queues the operation to run immediately (if it hasn't already been run or\n * canceled).\n */\n skipDelay(): void {\n return this.handleDelayElapsed();\n }\n\n /**\n * Cancels the operation if it hasn't already been executed or canceled. The\n * promise will be rejected.\n *\n * As long as the operation has not yet been run, calling cancel() provides a\n * guarantee that the operation will not be run.\n */\n cancel(reason?: string): void {\n if (this.timerHandle !== null) {\n this.clearTimeout();\n this.deferred.reject(\n new FirestoreError(\n Code.CANCELLED,\n 'Operation cancelled' + (reason ? ': ' + reason : '')\n )\n );\n }\n }\n\n then = this.deferred.promise.then.bind(this.deferred.promise);\n\n private handleDelayElapsed(): void {\n this.asyncQueue.enqueueAndForget(() => {\n if (this.timerHandle !== null) {\n this.clearTimeout();\n return this.op().then(result => {\n return this.deferred.resolve(result);\n });\n } else {\n return Promise.resolve();\n }\n });\n }\n\n private clearTimeout(): void {\n if (this.timerHandle !== null) {\n this.removalCallback(this);\n clearTimeout(this.timerHandle);\n this.timerHandle = null;\n }\n }\n}\n\nexport interface AsyncQueue {\n // Is this AsyncQueue being shut down? If true, this instance will not enqueue\n // any new operations, Promises from enqueue requests will not resolve.\n readonly isShuttingDown: boolean;\n\n /**\n * Adds a new operation to the queue without waiting for it to complete (i.e.\n * we ignore the Promise result).\n */\n enqueueAndForget<T extends unknown>(op: () => Promise<T>): void;\n\n /**\n * Regardless if the queue has initialized shutdown, adds a new operation to the\n * queue without waiting for it to complete (i.e. we ignore the Promise result).\n */\n enqueueAndForgetEvenWhileRestricted<T extends unknown>(\n op: () => Promise<T>\n ): void;\n\n /**\n * Initialize the shutdown of this queue. Once this method is called, the\n * only possible way to request running an operation is through\n * `enqueueEvenWhileRestricted()`.\n *\n * @param purgeExistingTasks Whether already enqueued tasked should be\n * rejected (unless enqueued wih `enqueueEvenWhileRestricted()`). Defaults\n * to false.\n */\n enterRestrictedMode(purgeExistingTasks?: boolean): void;\n\n /**\n * Adds a new operation to the queue. Returns a promise that will be resolved\n * when the promise returned by the new operation is (with its value).\n */\n enqueue<T extends unknown>(op: () => Promise<T>): Promise<T>;\n\n /**\n * Enqueue a retryable operation.\n *\n * A retryable operation is rescheduled with backoff if it fails with a\n * IndexedDbTransactionError (the error type used by SimpleDb). All\n * retryable operations are executed in order and only run if all prior\n * operations were retried successfully.\n */\n enqueueRetryable(op: () => Promise<void>): void;\n\n /**\n * Schedules an operation to be queued on the AsyncQueue once the specified\n * `delayMs` has elapsed. The returned DelayedOperation can be used to cancel\n * or fast-forward the operation prior to its running.\n */\n enqueueAfterDelay<T extends unknown>(\n timerId: TimerId,\n delayMs: number,\n op: () => Promise<T>\n ): DelayedOperation<T>;\n\n /**\n * Verifies there's an operation currently in-progress on the AsyncQueue.\n * Unfortunately we can't verify that the running code is in the promise chain\n * of that operation, so this isn't a foolproof check, but it should be enough\n * to catch some bugs.\n */\n verifyOperationInProgress(): void;\n}\n\n/**\n * Returns a FirestoreError that can be surfaced to the user if the provided\n * error is an IndexedDbTransactionError. Re-throws the error otherwise.\n */\nexport function wrapInUserErrorIfRecoverable(\n e: Error,\n msg: string\n): FirestoreError {\n logError(LOG_TAG, `${msg}: ${e}`);\n if (isIndexedDbTransactionError(e)) {\n return new FirestoreError(Code.UNAVAILABLE, `${msg}: ${e}`);\n } else {\n throw e;\n }\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { isIndexedDbTransactionError } from '../local/simple_db';\nimport { getDocument } from '../platform/dom';\nimport { ExponentialBackoff } from '../remote/backoff';\n\nimport { debugAssert, fail } from './assert';\nimport { AsyncQueue, DelayedOperation, TimerId } from './async_queue';\nimport { FirestoreError } from './error';\nimport { logDebug, logError } from './log';\nimport { Deferred } from './promise';\n\nconst LOG_TAG = 'AsyncQueue';\n\nexport class AsyncQueueImpl implements AsyncQueue {\n // The last promise in the queue.\n private tail: Promise<unknown> = Promise.resolve();\n\n // A list of retryable operations. Retryable operations are run in order and\n // retried with backoff.\n private retryableOps: Array<() => Promise<void>> = [];\n\n // Is this AsyncQueue being shut down? Once it is set to true, it will not\n // be changed again.\n private _isShuttingDown: boolean = false;\n\n // Operations scheduled to be queued in the future. Operations are\n // automatically removed after they are run or canceled.\n private delayedOperations: Array<DelayedOperation<unknown>> = [];\n\n // visible for testing\n failure: FirestoreError | null = null;\n\n // Flag set while there's an outstanding AsyncQueue operation, used for\n // assertion sanity-checks.\n private operationInProgress = false;\n\n // Enabled during shutdown on Safari to prevent future access to IndexedDB.\n private skipNonRestrictedTasks = false;\n\n // List of TimerIds to fast-forward delays for.\n private timerIdsToSkip: TimerId[] = [];\n\n // Backoff timer used to schedule retries for retryable operations\n private backoff = new ExponentialBackoff(this, TimerId.AsyncQueueRetry);\n\n // Visibility handler that triggers an immediate retry of all retryable\n // operations. Meant to speed up recovery when we regain file system access\n // after page comes into foreground.\n private visibilityHandler: () => void = () => {\n const document = getDocument();\n if (document) {\n logDebug(\n LOG_TAG,\n 'Visibility state changed to ' + document.visibilityState\n );\n }\n this.backoff.skipBackoff();\n };\n\n constructor() {\n const document = getDocument();\n if (document && typeof document.addEventListener === 'function') {\n document.addEventListener('visibilitychange', this.visibilityHandler);\n }\n }\n\n get isShuttingDown(): boolean {\n return this._isShuttingDown;\n }\n\n /**\n * Adds a new operation to the queue without waiting for it to complete (i.e.\n * we ignore the Promise result).\n */\n enqueueAndForget<T extends unknown>(op: () => Promise<T>): void {\n // eslint-disable-next-line @typescript-eslint/no-floating-promises\n this.enqueue(op);\n }\n\n enqueueAndForgetEvenWhileRestricted<T extends unknown>(\n op: () => Promise<T>\n ): void {\n this.verifyNotFailed();\n // eslint-disable-next-line @typescript-eslint/no-floating-promises\n this.enqueueInternal(op);\n }\n\n enterRestrictedMode(purgeExistingTasks?: boolean): void {\n if (!this._isShuttingDown) {\n this._isShuttingDown = true;\n this.skipNonRestrictedTasks = purgeExistingTasks || false;\n const document = getDocument();\n if (document && typeof document.removeEventListener === 'function') {\n document.removeEventListener(\n 'visibilitychange',\n this.visibilityHandler\n );\n }\n }\n }\n\n enqueue<T extends unknown>(op: () => Promise<T>): Promise<T> {\n this.verifyNotFailed();\n if (this._isShuttingDown) {\n // Return a Promise which never resolves.\n return new Promise<T>(() => {});\n }\n\n // Create a deferred Promise that we can return to the callee. This\n // allows us to return a \"hanging Promise\" only to the callee and still\n // advance the queue even when the operation is not run.\n const task = new Deferred<T>();\n return this.enqueueInternal<unknown>(() => {\n if (this._isShuttingDown && this.skipNonRestrictedTasks) {\n // We do not resolve 'task'\n return Promise.resolve();\n }\n\n op().then(task.resolve, task.reject);\n return task.promise;\n }).then(() => task.promise);\n }\n\n enqueueRetryable(op: () => Promise<void>): void {\n this.enqueueAndForget(() => {\n this.retryableOps.push(op);\n return this.retryNextOp();\n });\n }\n\n /**\n * Runs the next operation from the retryable queue. If the operation fails,\n * reschedules with backoff.\n */\n private async retryNextOp(): Promise<void> {\n if (this.retryableOps.length === 0) {\n return;\n }\n\n try {\n await this.retryableOps[0]();\n this.retryableOps.shift();\n this.backoff.reset();\n } catch (e) {\n if (isIndexedDbTransactionError(e as Error)) {\n logDebug(LOG_TAG, 'Operation failed with retryable error: ' + e);\n } else {\n throw e; // Failure will be handled by AsyncQueue\n }\n }\n\n if (this.retryableOps.length > 0) {\n // If there are additional operations, we re-schedule `retryNextOp()`.\n // This is necessary to run retryable operations that failed during\n // their initial attempt since we don't know whether they are already\n // enqueued. If, for example, `op1`, `op2`, `op3` are enqueued and `op1`\n // needs to be re-run, we will run `op1`, `op1`, `op2` using the\n // already enqueued calls to `retryNextOp()`. `op3()` will then run in the\n // call scheduled here.\n // Since `backoffAndRun()` cancels an existing backoff and schedules a\n // new backoff on every call, there is only ever a single additional\n // operation in the queue.\n this.backoff.backoffAndRun(() => this.retryNextOp());\n }\n }\n\n private enqueueInternal<T extends unknown>(op: () => Promise<T>): Promise<T> {\n const newTail = this.tail.then(() => {\n this.operationInProgress = true;\n return op()\n .catch((error: FirestoreError) => {\n this.failure = error;\n this.operationInProgress = false;\n const message = getMessageOrStack(error);\n logError('INTERNAL UNHANDLED ERROR: ', message);\n\n // Re-throw the error so that this.tail becomes a rejected Promise and\n // all further attempts to chain (via .then) will just short-circuit\n // and return the rejected Promise.\n throw error;\n })\n .then(result => {\n this.operationInProgress = false;\n return result;\n });\n });\n this.tail = newTail;\n return newTail;\n }\n\n enqueueAfterDelay<T extends unknown>(\n timerId: TimerId,\n delayMs: number,\n op: () => Promise<T>\n ): DelayedOperation<T> {\n this.verifyNotFailed();\n\n debugAssert(\n delayMs >= 0,\n `Attempted to schedule an operation with a negative delay of ${delayMs}`\n );\n\n // Fast-forward delays for timerIds that have been overriden.\n if (this.timerIdsToSkip.indexOf(timerId) > -1) {\n delayMs = 0;\n }\n\n const delayedOp = DelayedOperation.createAndSchedule<T>(\n this,\n timerId,\n delayMs,\n op,\n removedOp =>\n this.removeDelayedOperation(removedOp as DelayedOperation<unknown>)\n );\n this.delayedOperations.push(delayedOp as DelayedOperation<unknown>);\n return delayedOp;\n }\n\n private verifyNotFailed(): void {\n if (this.failure) {\n fail('AsyncQueue is already failed: ' + getMessageOrStack(this.failure));\n }\n }\n\n verifyOperationInProgress(): void {\n debugAssert(\n this.operationInProgress,\n 'verifyOpInProgress() called when no op in progress on this queue.'\n );\n }\n\n /**\n * Waits until all currently queued tasks are finished executing. Delayed\n * operations are not run.\n */\n async drain(): Promise<void> {\n // Operations in the queue prior to draining may have enqueued additional\n // operations. Keep draining the queue until the tail is no longer advanced,\n // which indicates that no more new operations were enqueued and that all\n // operations were executed.\n let currentTail: Promise<unknown>;\n do {\n currentTail = this.tail;\n await currentTail;\n } while (currentTail !== this.tail);\n }\n\n /**\n * For Tests: Determine if a delayed operation with a particular TimerId\n * exists.\n */\n containsDelayedOperation(timerId: TimerId): boolean {\n for (const op of this.delayedOperations) {\n if (op.timerId === timerId) {\n return true;\n }\n }\n return false;\n }\n\n /**\n * For Tests: Runs some or all delayed operations early.\n *\n * @param lastTimerId - Delayed operations up to and including this TimerId\n * will be drained. Pass TimerId.All to run all delayed operations.\n * @returns a Promise that resolves once all operations have been run.\n */\n runAllDelayedOperationsUntil(lastTimerId: TimerId): Promise<void> {\n // Note that draining may generate more delayed ops, so we do that first.\n return this.drain().then(() => {\n // Run ops in the same order they'd run if they ran naturally.\n this.delayedOperations.sort((a, b) => a.targetTimeMs - b.targetTimeMs);\n\n for (const op of this.delayedOperations) {\n op.skipDelay();\n if (lastTimerId !== TimerId.All && op.timerId === lastTimerId) {\n break;\n }\n }\n\n return this.drain();\n });\n }\n\n /**\n * For Tests: Skip all subsequent delays for a timer id.\n */\n skipDelaysForTimerId(timerId: TimerId): void {\n this.timerIdsToSkip.push(timerId);\n }\n\n /** Called once a DelayedOperation is run or canceled. */\n private removeDelayedOperation(op: DelayedOperation<unknown>): void {\n // NOTE: indexOf / slice are O(n), but delayedOperations is expected to be small.\n const index = this.delayedOperations.indexOf(op);\n debugAssert(index >= 0, 'Delayed operation not found.');\n this.delayedOperations.splice(index, 1);\n }\n}\n\nexport function newAsyncQueue(): AsyncQueue {\n return new AsyncQueueImpl();\n}\n\n/**\n * Chrome includes Error.message in Error.stack. Other browsers do not.\n * This returns expected output of message + stack when available.\n * @param error - Error or FirestoreError\n */\nfunction getMessageOrStack(error: Error): string {\n let message = error.message || '';\n if (error.stack) {\n if (error.stack.includes(error.message)) {\n message = error.stack;\n } else {\n message = error.message + '\\n' + error.stack;\n }\n }\n return message;\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { getUA, isIndexedDBAvailable } from '@firebase/util';\n\nimport { debugAssert } from '../util/assert';\nimport { Code, FirestoreError } from '../util/error';\nimport { logDebug, logError } from '../util/log';\nimport { Deferred } from '../util/promise';\n\nimport { PersistencePromise } from './persistence_promise';\n\n// References to `window` are guarded by SimpleDb.isAvailable()\n/* eslint-disable no-restricted-globals */\n\nconst LOG_TAG = 'SimpleDb';\n\n/**\n * The maximum number of retry attempts for an IndexedDb transaction that fails\n * with a DOMException.\n */\nconst TRANSACTION_RETRY_COUNT = 3;\n\n// The different modes supported by `SimpleDb.runTransaction()`\ntype SimpleDbTransactionMode = 'readonly' | 'readwrite';\n\nexport interface SimpleDbSchemaConverter {\n createOrUpgrade(\n db: IDBDatabase,\n txn: IDBTransaction,\n fromVersion: number,\n toVersion: number\n ): PersistencePromise<void>;\n}\n\n/**\n * Wraps an IDBTransaction and exposes a store() method to get a handle to a\n * specific object store.\n */\nexport class SimpleDbTransaction {\n private aborted = false;\n\n /**\n * A `Promise` that resolves with the result of the IndexedDb transaction.\n */\n private readonly completionDeferred = new Deferred<void>();\n\n static open(\n db: IDBDatabase,\n action: string,\n mode: IDBTransactionMode,\n objectStoreNames: string[]\n ): SimpleDbTransaction {\n try {\n return new SimpleDbTransaction(\n action,\n db.transaction(objectStoreNames, mode)\n );\n } catch (e) {\n throw new IndexedDbTransactionError(action, e as Error);\n }\n }\n\n constructor(\n private readonly action: string,\n private readonly transaction: IDBTransaction\n ) {\n this.transaction.oncomplete = () => {\n this.completionDeferred.resolve();\n };\n this.transaction.onabort = () => {\n if (transaction.error) {\n this.completionDeferred.reject(\n new IndexedDbTransactionError(action, transaction.error)\n );\n } else {\n this.completionDeferred.resolve();\n }\n };\n this.transaction.onerror = (event: Event) => {\n const error = checkForAndReportiOSError(\n (event.target as IDBRequest).error!\n );\n this.completionDeferred.reject(\n new IndexedDbTransactionError(action, error)\n );\n };\n }\n\n get completionPromise(): Promise<void> {\n return this.completionDeferred.promise;\n }\n\n abort(error?: Error): void {\n if (error) {\n this.completionDeferred.reject(error);\n }\n\n if (!this.aborted) {\n logDebug(\n LOG_TAG,\n 'Aborting transaction:',\n error ? error.message : 'Client-initiated abort'\n );\n this.aborted = true;\n this.transaction.abort();\n }\n }\n\n maybeCommit(): void {\n // If the browser supports V3 IndexedDB, we invoke commit() explicitly to\n // speed up index DB processing if the event loop remains blocks.\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n const maybeV3IndexedDb = this.transaction as any;\n if (!this.aborted && typeof maybeV3IndexedDb.commit === 'function') {\n maybeV3IndexedDb.commit();\n }\n }\n\n /**\n * Returns a SimpleDbStore<KeyType, ValueType> for the specified store. All\n * operations performed on the SimpleDbStore happen within the context of this\n * transaction and it cannot be used anymore once the transaction is\n * completed.\n *\n * Note that we can't actually enforce that the KeyType and ValueType are\n * correct, but they allow type safety through the rest of the consuming code.\n */\n store<KeyType extends IDBValidKey, ValueType extends unknown>(\n storeName: string\n ): SimpleDbStore<KeyType, ValueType> {\n const store = this.transaction.objectStore(storeName);\n debugAssert(!!store, 'Object store not part of transaction: ' + storeName);\n return new SimpleDbStore<KeyType, ValueType>(store);\n }\n}\n\n/**\n * Provides a wrapper around IndexedDb with a simplified interface that uses\n * Promise-like return values to chain operations. Real promises cannot be used\n * since .then() continuations are executed asynchronously (e.g. via\n * .setImmediate), which would cause IndexedDB to end the transaction.\n * See PersistencePromise for more details.\n */\nexport class SimpleDb {\n private db?: IDBDatabase;\n private versionchangelistener?: (event: IDBVersionChangeEvent) => void;\n\n /** Deletes the specified database. */\n static delete(name: string): Promise<void> {\n logDebug(LOG_TAG, 'Removing database:', name);\n return wrapRequest<void>(window.indexedDB.deleteDatabase(name)).toPromise();\n }\n\n /** Returns true if IndexedDB is available in the current environment. */\n static isAvailable(): boolean {\n if (!isIndexedDBAvailable()) {\n return false;\n }\n\n if (SimpleDb.isMockPersistence()) {\n return true;\n }\n\n // We extensively use indexed array values and compound keys,\n // which IE and Edge do not support. However, they still have indexedDB\n // defined on the window, so we need to check for them here and make sure\n // to return that persistence is not enabled for those browsers.\n // For tracking support of this feature, see here:\n // https://developer.microsoft.com/en-us/microsoft-edge/platform/status/indexeddbarraysandmultientrysupport/\n\n // Check the UA string to find out the browser.\n const ua = getUA();\n\n // IE 10\n // ua = 'Mozilla/5.0 (compatible; MSIE 10.0; Windows NT 6.2; Trident/6.0)';\n\n // IE 11\n // ua = 'Mozilla/5.0 (Windows NT 6.3; Trident/7.0; rv:11.0) like Gecko';\n\n // Edge\n // ua = 'Mozilla/5.0 (Windows NT 10.0; WOW64) AppleWebKit/537.36 (KHTML,\n // like Gecko) Chrome/39.0.2171.71 Safari/537.36 Edge/12.0';\n\n // iOS Safari: Disable for users running iOS version < 10.\n const iOSVersion = SimpleDb.getIOSVersion(ua);\n const isUnsupportedIOS = 0 < iOSVersion && iOSVersion < 10;\n\n // Android browser: Disable for userse running version < 4.5.\n const androidVersion = SimpleDb.getAndroidVersion(ua);\n const isUnsupportedAndroid = 0 < androidVersion && androidVersion < 4.5;\n\n if (\n ua.indexOf('MSIE ') > 0 ||\n ua.indexOf('Trident/') > 0 ||\n ua.indexOf('Edge/') > 0 ||\n isUnsupportedIOS ||\n isUnsupportedAndroid\n ) {\n return false;\n } else {\n return true;\n }\n }\n\n /**\n * Returns true if the backing IndexedDB store is the Node IndexedDBShim\n * (see https://github.com/axemclion/IndexedDBShim).\n */\n static isMockPersistence(): boolean {\n return (\n typeof process !== 'undefined' &&\n process.env?.USE_MOCK_PERSISTENCE === 'YES'\n );\n }\n\n /** Helper to get a typed SimpleDbStore from a transaction. */\n static getStore<KeyType extends IDBValidKey, ValueType extends unknown>(\n txn: SimpleDbTransaction,\n store: string\n ): SimpleDbStore<KeyType, ValueType> {\n return txn.store<KeyType, ValueType>(store);\n }\n\n // visible for testing\n /** Parse User Agent to determine iOS version. Returns -1 if not found. */\n static getIOSVersion(ua: string): number {\n const iOSVersionRegex = ua.match(/i(?:phone|pad|pod) os ([\\d_]+)/i);\n const version = iOSVersionRegex\n ? iOSVersionRegex[1].split('_').slice(0, 2).join('.')\n : '-1';\n return Number(version);\n }\n\n // visible for testing\n /** Parse User Agent to determine Android version. Returns -1 if not found. */\n static getAndroidVersion(ua: string): number {\n const androidVersionRegex = ua.match(/Android ([\\d.]+)/i);\n const version = androidVersionRegex\n ? androidVersionRegex[1].split('.').slice(0, 2).join('.')\n : '-1';\n return Number(version);\n }\n\n /*\n * Creates a new SimpleDb wrapper for IndexedDb database `name`.\n *\n * Note that `version` must not be a downgrade. IndexedDB does not support\n * downgrading the schema version. We currently do not support any way to do\n * versioning outside of IndexedDB's versioning mechanism, as only\n * version-upgrade transactions are allowed to do things like create\n * objectstores.\n */\n constructor(\n private readonly name: string,\n private readonly version: number,\n private readonly schemaConverter: SimpleDbSchemaConverter\n ) {\n debugAssert(\n SimpleDb.isAvailable(),\n 'IndexedDB not supported in current environment.'\n );\n\n const iOSVersion = SimpleDb.getIOSVersion(getUA());\n // NOTE: According to https://bugs.webkit.org/show_bug.cgi?id=197050, the\n // bug we're checking for should exist in iOS >= 12.2 and < 13, but for\n // whatever reason it's much harder to hit after 12.2 so we only proactively\n // log on 12.2.\n if (iOSVersion === 12.2) {\n logError(\n 'Firestore persistence suffers from a bug in iOS 12.2 ' +\n 'Safari that may cause your app to stop working. See ' +\n 'https://stackoverflow.com/q/56496296/110915 for details ' +\n 'and a potential workaround.'\n );\n }\n }\n\n /**\n * Opens the specified database, creating or upgrading it if necessary.\n */\n async ensureDb(action: string): Promise<IDBDatabase> {\n if (!this.db) {\n logDebug(LOG_TAG, 'Opening database:', this.name);\n this.db = await new Promise<IDBDatabase>((resolve, reject) => {\n // TODO(mikelehen): Investigate browser compatibility.\n // https://developer.mozilla.org/en-US/docs/Web/API/IndexedDB_API/Using_IndexedDB\n // suggests IE9 and older WebKit browsers handle upgrade\n // differently. They expect setVersion, as described here:\n // https://developer.mozilla.org/en-US/docs/Web/API/IDBVersionChangeRequest/setVersion\n const request = indexedDB.open(this.name, this.version);\n\n request.onsuccess = (event: Event) => {\n const db = (event.target as IDBOpenDBRequest).result;\n resolve(db);\n };\n\n request.onblocked = () => {\n reject(\n new IndexedDbTransactionError(\n action,\n 'Cannot upgrade IndexedDB schema while another tab is open. ' +\n 'Close all tabs that access Firestore and reload this page to proceed.'\n )\n );\n };\n\n request.onerror = (event: Event) => {\n const error: DOMException = (event.target as IDBOpenDBRequest).error!;\n if (error.name === 'VersionError') {\n reject(\n new FirestoreError(\n Code.FAILED_PRECONDITION,\n 'A newer version of the Firestore SDK was previously used and so the persisted ' +\n 'data is not compatible with the version of the SDK you are now using. The SDK ' +\n 'will operate with persistence disabled. If you need persistence, please ' +\n 're-upgrade to a newer version of the SDK or else clear the persisted IndexedDB ' +\n 'data for your app to start fresh.'\n )\n );\n } else if (error.name === 'InvalidStateError') {\n reject(\n new FirestoreError(\n Code.FAILED_PRECONDITION,\n 'Unable to open an IndexedDB connection. This could be due to running in a ' +\n 'private browsing session on a browser whose private browsing sessions do not ' +\n 'support IndexedDB: ' +\n error\n )\n );\n } else {\n reject(new IndexedDbTransactionError(action, error));\n }\n };\n\n request.onupgradeneeded = (event: IDBVersionChangeEvent) => {\n logDebug(\n LOG_TAG,\n 'Database \"' + this.name + '\" requires upgrade from version:',\n event.oldVersion\n );\n const db = (event.target as IDBOpenDBRequest).result;\n this.schemaConverter\n .createOrUpgrade(\n db,\n request.transaction!,\n event.oldVersion,\n this.version\n )\n .next(() => {\n logDebug(\n LOG_TAG,\n 'Database upgrade to version ' + this.version + ' complete'\n );\n });\n };\n });\n }\n\n if (this.versionchangelistener) {\n this.db.onversionchange = event => this.versionchangelistener!(event);\n }\n return this.db;\n }\n\n setVersionChangeListener(\n versionChangeListener: (event: IDBVersionChangeEvent) => void\n ): void {\n this.versionchangelistener = versionChangeListener;\n if (this.db) {\n this.db.onversionchange = (event: IDBVersionChangeEvent) => {\n return versionChangeListener(event);\n };\n }\n }\n\n async runTransaction<T>(\n action: string,\n mode: SimpleDbTransactionMode,\n objectStores: string[],\n transactionFn: (transaction: SimpleDbTransaction) => PersistencePromise<T>\n ): Promise<T> {\n const readonly = mode === 'readonly';\n let attemptNumber = 0;\n\n while (true) {\n ++attemptNumber;\n\n try {\n this.db = await this.ensureDb(action);\n\n const transaction = SimpleDbTransaction.open(\n this.db,\n action,\n readonly ? 'readonly' : 'readwrite',\n objectStores\n );\n const transactionFnResult = transactionFn(transaction)\n .next(result => {\n transaction.maybeCommit();\n return result;\n })\n .catch(error => {\n // Abort the transaction if there was an error.\n transaction.abort(error);\n // We cannot actually recover, and calling `abort()` will cause the transaction's\n // completion promise to be rejected. This in turn means that we won't use\n // `transactionFnResult` below. We return a rejection here so that we don't add the\n // possibility of returning `void` to the type of `transactionFnResult`.\n return PersistencePromise.reject<T>(error);\n })\n .toPromise();\n\n // As noted above, errors are propagated by aborting the transaction. So\n // we swallow any error here to avoid the browser logging it as unhandled.\n transactionFnResult.catch(() => {});\n\n // Wait for the transaction to complete (i.e. IndexedDb's onsuccess event to\n // fire), but still return the original transactionFnResult back to the\n // caller.\n await transaction.completionPromise;\n return transactionFnResult;\n } catch (e) {\n const error = e as Error;\n // TODO(schmidt-sebastian): We could probably be smarter about this and\n // not retry exceptions that are likely unrecoverable (such as quota\n // exceeded errors).\n\n // Note: We cannot use an instanceof check for FirestoreException, since the\n // exception is wrapped in a generic error by our async/await handling.\n const retryable =\n error.name !== 'FirebaseError' &&\n attemptNumber < TRANSACTION_RETRY_COUNT;\n logDebug(\n LOG_TAG,\n 'Transaction failed with error:',\n error.message,\n 'Retrying:',\n retryable\n );\n\n this.close();\n\n if (!retryable) {\n return Promise.reject(error);\n }\n }\n }\n }\n\n close(): void {\n if (this.db) {\n this.db.close();\n }\n this.db = undefined;\n }\n}\n\n/**\n * A controller for iterating over a key range or index. It allows an iterate\n * callback to delete the currently-referenced object, or jump to a new key\n * within the key range or index.\n */\nexport class IterationController {\n private shouldStop = false;\n private nextKey: IDBValidKey | null = null;\n\n constructor(private dbCursor: IDBCursorWithValue) {}\n\n get isDone(): boolean {\n return this.shouldStop;\n }\n\n get skipToKey(): IDBValidKey | null {\n return this.nextKey;\n }\n\n set cursor(value: IDBCursorWithValue) {\n this.dbCursor = value;\n }\n\n /**\n * This function can be called to stop iteration at any point.\n */\n done(): void {\n this.shouldStop = true;\n }\n\n /**\n * This function can be called to skip to that next key, which could be\n * an index or a primary key.\n */\n skip(key: IDBValidKey): void {\n this.nextKey = key;\n }\n\n /**\n * Delete the current cursor value from the object store.\n *\n * NOTE: You CANNOT do this with a keysOnly query.\n */\n delete(): PersistencePromise<void> {\n return wrapRequest<void>(this.dbCursor.delete());\n }\n}\n\n/**\n * Callback used with iterate() method.\n */\nexport type IterateCallback<KeyType, ValueType> = (\n key: KeyType,\n value: ValueType,\n control: IterationController\n) => void | PersistencePromise<void>;\n\n/** Options available to the iterate() method. */\nexport interface IterateOptions {\n /** Index to iterate over (else primary keys will be iterated) */\n index?: string;\n\n /** IndxedDB Range to iterate over (else entire store will be iterated) */\n range?: IDBKeyRange;\n\n /** If true, values aren't read while iterating. */\n keysOnly?: boolean;\n\n /** If true, iterate over the store in reverse. */\n reverse?: boolean;\n}\n\n/** An error that wraps exceptions that thrown during IndexedDB execution. */\nexport class IndexedDbTransactionError extends FirestoreError {\n name = 'IndexedDbTransactionError';\n\n constructor(actionName: string, cause: Error | string) {\n super(\n Code.UNAVAILABLE,\n `IndexedDB transaction '${actionName}' failed: ${cause}`\n );\n }\n}\n\n/** Verifies whether `e` is an IndexedDbTransactionError. */\nexport function isIndexedDbTransactionError(e: Error): boolean {\n // Use name equality, as instanceof checks on errors don't work with errors\n // that wrap other errors.\n return e.name === 'IndexedDbTransactionError';\n}\n\n/**\n * A wrapper around an IDBObjectStore providing an API that:\n *\n * 1) Has generic KeyType / ValueType parameters to provide strongly-typed\n * methods for acting against the object store.\n * 2) Deals with IndexedDB's onsuccess / onerror event callbacks, making every\n * method return a PersistencePromise instead.\n * 3) Provides a higher-level API to avoid needing to do excessive wrapping of\n * intermediate IndexedDB types (IDBCursorWithValue, etc.)\n */\nexport class SimpleDbStore<\n KeyType extends IDBValidKey,\n ValueType extends unknown\n> {\n constructor(private store: IDBObjectStore) {}\n\n /**\n * Writes a value into the Object Store.\n *\n * @param key - Optional explicit key to use when writing the object, else the\n * key will be auto-assigned (e.g. via the defined keyPath for the store).\n * @param value - The object to write.\n */\n put(value: ValueType): PersistencePromise<void>;\n put(key: KeyType, value: ValueType): PersistencePromise<void>;\n put(\n keyOrValue: KeyType | ValueType,\n value?: ValueType\n ): PersistencePromise<void> {\n let request;\n if (value !== undefined) {\n logDebug(LOG_TAG, 'PUT', this.store.name, keyOrValue, value);\n request = this.store.put(value, keyOrValue as KeyType);\n } else {\n logDebug(LOG_TAG, 'PUT', this.store.name, '<auto-key>', keyOrValue);\n request = this.store.put(keyOrValue as ValueType);\n }\n return wrapRequest<void>(request);\n }\n\n /**\n * Adds a new value into an Object Store and returns the new key. Similar to\n * IndexedDb's `add()`, this method will fail on primary key collisions.\n *\n * @param value - The object to write.\n * @returns The key of the value to add.\n */\n add(value: ValueType): PersistencePromise<KeyType> {\n logDebug(LOG_TAG, 'ADD', this.store.name, value, value);\n const request = this.store.add(value as ValueType);\n return wrapRequest<KeyType>(request);\n }\n\n /**\n * Gets the object with the specified key from the specified store, or null\n * if no object exists with the specified key.\n *\n * @key The key of the object to get.\n * @returns The object with the specified key or null if no object exists.\n */\n get(key: KeyType): PersistencePromise<ValueType | null> {\n const request = this.store.get(key);\n // We're doing an unsafe cast to ValueType.\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n return wrapRequest<any>(request).next(result => {\n // Normalize nonexistence to null.\n if (result === undefined) {\n result = null;\n }\n logDebug(LOG_TAG, 'GET', this.store.name, key, result);\n return result;\n });\n }\n\n delete(key: KeyType | IDBKeyRange): PersistencePromise<void> {\n logDebug(LOG_TAG, 'DELETE', this.store.name, key);\n const request = this.store.delete(key);\n return wrapRequest<void>(request);\n }\n\n /**\n * If we ever need more of the count variants, we can add overloads. For now,\n * all we need is to count everything in a store.\n *\n * Returns the number of rows in the store.\n */\n count(): PersistencePromise<number> {\n logDebug(LOG_TAG, 'COUNT', this.store.name);\n const request = this.store.count();\n return wrapRequest<number>(request);\n }\n\n /** Loads all elements from the object store. */\n loadAll(): PersistencePromise<ValueType[]>;\n /** Loads all elements for the index range from the object store. */\n loadAll(range: IDBKeyRange): PersistencePromise<ValueType[]>;\n /** Loads all elements ordered by the given index. */\n loadAll(index: string): PersistencePromise<ValueType[]>;\n /**\n * Loads all elements from the object store that fall into the provided in the\n * index range for the given index.\n */\n loadAll(index: string, range: IDBKeyRange): PersistencePromise<ValueType[]>;\n loadAll(\n indexOrRange?: string | IDBKeyRange,\n range?: IDBKeyRange\n ): PersistencePromise<ValueType[]> {\n const iterateOptions = this.options(indexOrRange, range);\n // Use `getAll()` if the browser supports IndexedDB v3, as it is roughly\n // 20% faster. Unfortunately, getAll() does not support custom indices.\n if (!iterateOptions.index && typeof this.store.getAll === 'function') {\n const request = this.store.getAll(iterateOptions.range);\n return new PersistencePromise((resolve, reject) => {\n request.onerror = (event: Event) => {\n reject((event.target as IDBRequest).error!);\n };\n request.onsuccess = (event: Event) => {\n resolve((event.target as IDBRequest).result);\n };\n });\n } else {\n const cursor = this.cursor(iterateOptions);\n const results: ValueType[] = [];\n return this.iterateCursor(cursor, (key, value) => {\n results.push(value);\n }).next(() => {\n return results;\n });\n }\n }\n\n /**\n * Loads the first `count` elements from the provided index range. Loads all\n * elements if no limit is provided.\n */\n loadFirst(\n range: IDBKeyRange,\n count: number | null\n ): PersistencePromise<ValueType[]> {\n const request = this.store.getAll(\n range,\n count === null ? undefined : count\n );\n return new PersistencePromise((resolve, reject) => {\n request.onerror = (event: Event) => {\n reject((event.target as IDBRequest).error!);\n };\n request.onsuccess = (event: Event) => {\n resolve((event.target as IDBRequest).result);\n };\n });\n }\n\n deleteAll(): PersistencePromise<void>;\n deleteAll(range: IDBKeyRange): PersistencePromise<void>;\n deleteAll(index: string, range: IDBKeyRange): PersistencePromise<void>;\n deleteAll(\n indexOrRange?: string | IDBKeyRange,\n range?: IDBKeyRange\n ): PersistencePromise<void> {\n logDebug(LOG_TAG, 'DELETE ALL', this.store.name);\n const options = this.options(indexOrRange, range);\n options.keysOnly = false;\n const cursor = this.cursor(options);\n return this.iterateCursor(cursor, (key, value, control) => {\n // NOTE: Calling delete() on a cursor is documented as more efficient than\n // calling delete() on an object store with a single key\n // (https://developer.mozilla.org/en-US/docs/Web/API/IDBObjectStore/delete),\n // however, this requires us *not* to use a keysOnly cursor\n // (https://developer.mozilla.org/en-US/docs/Web/API/IDBCursor/delete). We\n // may want to compare the performance of each method.\n return control.delete();\n });\n }\n\n /**\n * Iterates over keys and values in an object store.\n *\n * @param options - Options specifying how to iterate the objects in the\n * store.\n * @param callback - will be called for each iterated object. Iteration can be\n * canceled at any point by calling the doneFn passed to the callback.\n * The callback can return a PersistencePromise if it performs async\n * operations but note that iteration will continue without waiting for them\n * to complete.\n * @returns A PersistencePromise that resolves once all PersistencePromises\n * returned by callbacks resolve.\n */\n iterate(\n callback: IterateCallback<KeyType, ValueType>\n ): PersistencePromise<void>;\n iterate(\n options: IterateOptions,\n callback: IterateCallback<KeyType, ValueType>\n ): PersistencePromise<void>;\n iterate(\n optionsOrCallback: IterateOptions | IterateCallback<KeyType, ValueType>,\n callback?: IterateCallback<KeyType, ValueType>\n ): PersistencePromise<void> {\n let options;\n if (!callback) {\n options = {};\n callback = optionsOrCallback as IterateCallback<KeyType, ValueType>;\n } else {\n options = optionsOrCallback as IterateOptions;\n }\n const cursor = this.cursor(options);\n return this.iterateCursor(cursor, callback);\n }\n\n /**\n * Iterates over a store, but waits for the given callback to complete for\n * each entry before iterating the next entry. This allows the callback to do\n * asynchronous work to determine if this iteration should continue.\n *\n * The provided callback should return `true` to continue iteration, and\n * `false` otherwise.\n */\n iterateSerial(\n callback: (k: KeyType, v: ValueType) => PersistencePromise<boolean>\n ): PersistencePromise<void> {\n const cursorRequest = this.cursor({});\n return new PersistencePromise((resolve, reject) => {\n cursorRequest.onerror = (event: Event) => {\n const error = checkForAndReportiOSError(\n (event.target as IDBRequest).error!\n );\n reject(error);\n };\n cursorRequest.onsuccess = (event: Event) => {\n const cursor: IDBCursorWithValue = (event.target as IDBRequest).result;\n if (!cursor) {\n resolve();\n return;\n }\n\n callback(cursor.primaryKey as KeyType, cursor.value).next(\n shouldContinue => {\n if (shouldContinue) {\n cursor.continue();\n } else {\n resolve();\n }\n }\n );\n };\n });\n }\n\n private iterateCursor(\n cursorRequest: IDBRequest,\n fn: IterateCallback<KeyType, ValueType>\n ): PersistencePromise<void> {\n const results: Array<PersistencePromise<void>> = [];\n return new PersistencePromise((resolve, reject) => {\n cursorRequest.onerror = (event: Event) => {\n reject((event.target as IDBRequest).error!);\n };\n cursorRequest.onsuccess = (event: Event) => {\n const cursor: IDBCursorWithValue = (event.target as IDBRequest).result;\n if (!cursor) {\n resolve();\n return;\n }\n const controller = new IterationController(cursor);\n const userResult = fn(\n cursor.primaryKey as KeyType,\n cursor.value,\n controller\n );\n if (userResult instanceof PersistencePromise) {\n const userPromise: PersistencePromise<void> = userResult.catch(\n err => {\n controller.done();\n return PersistencePromise.reject(err);\n }\n );\n results.push(userPromise);\n }\n if (controller.isDone) {\n resolve();\n } else if (controller.skipToKey === null) {\n cursor.continue();\n } else {\n cursor.continue(controller.skipToKey);\n }\n };\n }).next(() => PersistencePromise.waitFor(results));\n }\n\n private options(\n indexOrRange?: string | IDBKeyRange,\n range?: IDBKeyRange\n ): IterateOptions {\n let indexName: string | undefined = undefined;\n if (indexOrRange !== undefined) {\n if (typeof indexOrRange === 'string') {\n indexName = indexOrRange;\n } else {\n debugAssert(\n range === undefined,\n '3rd argument must not be defined if 2nd is a range.'\n );\n range = indexOrRange;\n }\n }\n return { index: indexName, range };\n }\n\n private cursor(options: IterateOptions): IDBRequest {\n let direction: IDBCursorDirection = 'next';\n if (options.reverse) {\n direction = 'prev';\n }\n if (options.index) {\n const index = this.store.index(options.index);\n if (options.keysOnly) {\n return index.openKeyCursor(options.range, direction);\n } else {\n return index.openCursor(options.range, direction);\n }\n } else {\n return this.store.openCursor(options.range, direction);\n }\n }\n}\n\n/**\n * Wraps an IDBRequest in a PersistencePromise, using the onsuccess / onerror\n * handlers to resolve / reject the PersistencePromise as appropriate.\n */\nfunction wrapRequest<R>(request: IDBRequest): PersistencePromise<R> {\n return new PersistencePromise<R>((resolve, reject) => {\n request.onsuccess = (event: Event) => {\n const result = (event.target as IDBRequest).result;\n resolve(result);\n };\n\n request.onerror = (event: Event) => {\n const error = checkForAndReportiOSError(\n (event.target as IDBRequest).error!\n );\n reject(error);\n };\n });\n}\n\n// Guard so we only report the error once.\nlet reportedIOSError = false;\nfunction checkForAndReportiOSError(error: DOMException): Error {\n const iOSVersion = SimpleDb.getIOSVersion(getUA());\n if (iOSVersion >= 12.2 && iOSVersion < 13) {\n const IOS_ERROR =\n 'An internal error was encountered in the Indexed Database server';\n if (error.message.indexOf(IOS_ERROR) >= 0) {\n // Wrap error in a more descriptive one.\n const newError = new FirestoreError(\n 'internal',\n `IOS_INDEXEDDB_BUG1: IndexedDb has thrown '${IOS_ERROR}'. This is likely ` +\n `due to an unavoidable bug in iOS. See https://stackoverflow.com/q/56496296/110915 ` +\n `for details and a potential workaround.`\n );\n if (!reportedIOSError) {\n reportedIOSError = true;\n // Throw a global exception outside of this promise chain, for the user to\n // potentially catch.\n setTimeout(() => {\n throw newError;\n }, 0);\n }\n return newError;\n }\n }\n return error;\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { getModularInstance } from '@firebase/util';\n\nimport { Transaction as InternalTransaction } from '../core/transaction';\nimport {\n DEFAULT_TRANSACTION_OPTIONS,\n TransactionOptions as TranasactionOptionsInternal,\n validateTransactionOptions\n} from '../core/transaction_options';\nimport { TransactionRunner } from '../core/transaction_runner';\nimport { fail } from '../util/assert';\nimport { newAsyncQueue } from '../util/async_queue_impl';\nimport { cast } from '../util/input_validation';\nimport { Deferred } from '../util/promise';\n\nimport { getDatastore } from './components';\nimport { Firestore } from './database';\nimport { FieldPath } from './field_path';\nimport {\n DocumentReference,\n PartialWithFieldValue,\n SetOptions,\n UpdateData,\n WithFieldValue\n} from './reference';\nimport {\n applyFirestoreDataConverter,\n LiteUserDataWriter\n} from './reference_impl';\nimport { DocumentSnapshot } from './snapshot';\nimport { TransactionOptions } from './transaction_options';\nimport {\n newUserDataReader,\n parseSetData,\n parseUpdateData,\n parseUpdateVarargs,\n UserDataReader\n} from './user_data_reader';\nimport { validateReference } from './write_batch';\n\n// TODO(mrschmidt) Consider using `BaseTransaction` as the base class in the\n// legacy SDK.\n\n/**\n * A reference to a transaction.\n *\n * The `Transaction` object passed to a transaction's `updateFunction` provides\n * the methods to read and write data within the transaction context. See\n * {@link runTransaction}.\n */\nexport class Transaction {\n // This is the tree-shakeable version of the Transaction class used in the\n // legacy SDK. The class is a close copy but takes different input and output\n // types. The firestore-exp SDK further extends this class to return its API\n // type.\n\n private readonly _dataReader: UserDataReader;\n\n /** @hideconstructor */\n constructor(\n protected readonly _firestore: Firestore,\n private readonly _transaction: InternalTransaction\n ) {\n this._dataReader = newUserDataReader(_firestore);\n }\n\n /**\n * Reads the document referenced by the provided {@link DocumentReference}.\n *\n * @param documentRef - A reference to the document to be read.\n * @returns A `DocumentSnapshot` with the read data.\n */\n get<T>(documentRef: DocumentReference<T>): Promise<DocumentSnapshot<T>> {\n const ref = validateReference(documentRef, this._firestore);\n const userDataWriter = new LiteUserDataWriter(this._firestore);\n return this._transaction.lookup([ref._key]).then(docs => {\n if (!docs || docs.length !== 1) {\n return fail('Mismatch in docs returned from document lookup.');\n }\n const doc = docs[0];\n if (doc.isFoundDocument()) {\n return new DocumentSnapshot(\n this._firestore,\n userDataWriter,\n doc.key,\n doc,\n ref.converter\n );\n } else if (doc.isNoDocument()) {\n return new DocumentSnapshot(\n this._firestore,\n userDataWriter,\n ref._key,\n null,\n ref.converter\n );\n } else {\n throw fail(\n `BatchGetDocumentsRequest returned unexpected document: ${doc}`\n );\n }\n });\n }\n\n /**\n * Writes to the document referred to by the provided {@link\n * DocumentReference}. If the document does not exist yet, it will be created.\n *\n * @param documentRef - A reference to the document to be set.\n * @param data - An object of the fields and values for the document.\n * @throws Error - If the provided input is not a valid Firestore document.\n * @returns This `Transaction` instance. Used for chaining method calls.\n */\n set<T>(documentRef: DocumentReference<T>, data: WithFieldValue<T>): this;\n /**\n * Writes to the document referred to by the provided {@link\n * DocumentReference}. If the document does not exist yet, it will be created.\n * If you provide `merge` or `mergeFields`, the provided data can be merged\n * into an existing document.\n *\n * @param documentRef - A reference to the document to be set.\n * @param data - An object of the fields and values for the document.\n * @param options - An object to configure the set behavior.\n * @throws Error - If the provided input is not a valid Firestore document.\n * @returns This `Transaction` instance. Used for chaining method calls.\n */\n set<T>(\n documentRef: DocumentReference<T>,\n data: PartialWithFieldValue<T>,\n options: SetOptions\n ): this;\n set<T>(\n documentRef: DocumentReference<T>,\n value: PartialWithFieldValue<T>,\n options?: SetOptions\n ): this {\n const ref = validateReference(documentRef, this._firestore);\n const convertedValue = applyFirestoreDataConverter(\n ref.converter,\n value,\n options\n );\n const parsed = parseSetData(\n this._dataReader,\n 'Transaction.set',\n ref._key,\n convertedValue,\n ref.converter !== null,\n options\n );\n this._transaction.set(ref._key, parsed);\n return this;\n }\n\n /**\n * Updates fields in the document referred to by the provided {@link\n * DocumentReference}. The update will fail if applied to a document that does\n * not exist.\n *\n * @param documentRef - A reference to the document to be updated.\n * @param data - An object containing the fields and values with which to\n * update the document. Fields can contain dots to reference nested fields\n * within the document.\n * @throws Error - If the provided input is not valid Firestore data.\n * @returns This `Transaction` instance. Used for chaining method calls.\n */\n update<T>(documentRef: DocumentReference<T>, data: UpdateData<T>): this;\n /**\n * Updates fields in the document referred to by the provided {@link\n * DocumentReference}. The update will fail if applied to a document that does\n * not exist.\n *\n * Nested fields can be updated by providing dot-separated field path\n * strings or by providing `FieldPath` objects.\n *\n * @param documentRef - A reference to the document to be updated.\n * @param field - The first field to update.\n * @param value - The first value.\n * @param moreFieldsAndValues - Additional key/value pairs.\n * @throws Error - If the provided input is not valid Firestore data.\n * @returns This `Transaction` instance. Used for chaining method calls.\n */\n update(\n documentRef: DocumentReference<unknown>,\n field: string | FieldPath,\n value: unknown,\n ...moreFieldsAndValues: unknown[]\n ): this;\n update<T>(\n documentRef: DocumentReference<T>,\n fieldOrUpdateData: string | FieldPath | UpdateData<T>,\n value?: unknown,\n ...moreFieldsAndValues: unknown[]\n ): this {\n const ref = validateReference(documentRef, this._firestore);\n\n // For Compat types, we have to \"extract\" the underlying types before\n // performing validation.\n fieldOrUpdateData = getModularInstance(fieldOrUpdateData);\n\n let parsed;\n if (\n typeof fieldOrUpdateData === 'string' ||\n fieldOrUpdateData instanceof FieldPath\n ) {\n parsed = parseUpdateVarargs(\n this._dataReader,\n 'Transaction.update',\n ref._key,\n fieldOrUpdateData,\n value,\n moreFieldsAndValues\n );\n } else {\n parsed = parseUpdateData(\n this._dataReader,\n 'Transaction.update',\n ref._key,\n fieldOrUpdateData\n );\n }\n\n this._transaction.update(ref._key, parsed);\n return this;\n }\n\n /**\n * Deletes the document referred to by the provided {@link DocumentReference}.\n *\n * @param documentRef - A reference to the document to be deleted.\n * @returns This `Transaction` instance. Used for chaining method calls.\n */\n delete(documentRef: DocumentReference<unknown>): this {\n const ref = validateReference(documentRef, this._firestore);\n this._transaction.delete(ref._key);\n return this;\n }\n}\n\n/**\n * Executes the given `updateFunction` and then attempts to commit the changes\n * applied within the transaction. If any document read within the transaction\n * has changed, Cloud Firestore retries the `updateFunction`. If it fails to\n * commit after 5 attempts, the transaction fails.\n *\n * The maximum number of writes allowed in a single transaction is 500.\n *\n * @param firestore - A reference to the Firestore database to run this\n * transaction against.\n * @param updateFunction - The function to execute within the transaction\n * context.\n * @param options - An options object to configure maximum number of attempts to\n * commit.\n * @returns If the transaction completed successfully or was explicitly aborted\n * (the `updateFunction` returned a failed promise), the promise returned by the\n * `updateFunction `is returned here. Otherwise, if the transaction failed, a\n * rejected promise with the corresponding failure error is returned.\n */\nexport function runTransaction<T>(\n firestore: Firestore,\n updateFunction: (transaction: Transaction) => Promise<T>,\n options?: TransactionOptions\n): Promise<T> {\n firestore = cast(firestore, Firestore);\n const datastore = getDatastore(firestore);\n const optionsWithDefaults: TranasactionOptionsInternal = {\n ...DEFAULT_TRANSACTION_OPTIONS,\n ...options\n };\n validateTransactionOptions(optionsWithDefaults);\n const deferred = new Deferred<T>();\n new TransactionRunner<T>(\n newAsyncQueue(),\n datastore,\n optionsWithDefaults,\n internalTransaction =>\n updateFunction(new Transaction(firestore, internalTransaction)),\n deferred\n ).run();\n return deferred.promise;\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport {\n _registerComponent,\n registerVersion,\n SDK_VERSION\n} from '@firebase/app';\nimport { Component, ComponentType } from '@firebase/component';\n\nimport { version } from '../package.json';\nimport {\n LiteAppCheckTokenProvider,\n LiteAuthCredentialsProvider\n} from '../src/api/credentials';\nimport { databaseIdFromApp } from '../src/core/database_info';\nimport { setSDKVersion } from '../src/core/version';\nimport { Firestore } from '../src/lite-api/database';\n\ndeclare module '@firebase/component' {\n interface NameServiceMapping {\n 'firestore/lite': Firestore;\n }\n}\n\nexport function registerFirestore(): void {\n setSDKVersion(`${SDK_VERSION}_lite`);\n _registerComponent(\n new Component(\n 'firestore/lite',\n (container, { instanceIdentifier: databaseId, options: settings }) => {\n const app = container.getProvider('app').getImmediate()!;\n const firestoreInstance = new Firestore(\n new LiteAuthCredentialsProvider(\n container.getProvider('auth-internal')\n ),\n new LiteAppCheckTokenProvider(\n container.getProvider('app-check-internal')\n ),\n databaseIdFromApp(app, databaseId),\n app\n );\n if (settings) {\n firestoreInstance._setSettings(settings);\n }\n return firestoreInstance;\n },\n 'PUBLIC' as ComponentType.PUBLIC\n ).setMultipleInstances(true)\n );\n // RUNTIME_ENV and BUILD_TARGET are replaced by real values during the compilation\n registerVersion('firestore-lite', version, '__RUNTIME_ENV__');\n registerVersion('firestore-lite', version, '__BUILD_TARGET__');\n}\n"],"names":["User","constructor","uid","this","isAuthenticated","toKey","isEqual","otherUser","UNAUTHENTICATED","GOOGLE_CREDENTIALS","FIRST_PARTY","MOCK_USER","SDK_VERSION","__PRIVATE_logClient","Logger","setLogLevel","logLevel","__PRIVATE_logDebug","msg","obj","LogLevel","DEBUG","args","map","__PRIVATE_argToString","debug","__spreadArray","concat","__PRIVATE_logError","ERROR","error","__PRIVATE_logWarn","WARN","warn","value","JSON","stringify","e","fail","__PRIVATE_failure","message","Error","__PRIVATE_hardAssert","assertion","__PRIVATE_debugCast","Code","U","_super","code","super","toString","name","FirebaseError","__PRIVATE_Deferred","promise","Promise","resolve","reject","__PRIVATE_OAuthToken","user","type","headers","Map","set","__PRIVATE_EmptyAuthCredentialsProvider","getToken","invalidateToken","start","asyncQueue","changeListener","enqueueRetryable","shutdown","__PRIVATE_EmulatorAuthCredentialsProvider","token","__PRIVATE_LiteAuthCredentialsProvider","__PRIVATE_authProvider","auth","onInit","then","__PRIVATE_tokenData","accessToken","getUid","__PRIVATE_FirstPartyToken","__PRIVATE_gapi","__PRIVATE_sessionIndex","__PRIVATE_iamToken","__PRIVATE_authTokenFactory","__PRIVATE__headers","__PRIVATE_getAuthToken","getAuthHeaderValueForFirstParty","__PRIVATE_authHeaderTokenValue","__PRIVATE_FirstPartyAuthCredentialsProvider","AppCheckToken","length","__PRIVATE_LiteAppCheckTokenProvider","__PRIVATE_appCheckProvider","appCheck","tokenResult","DatabaseInfo","databaseId","appId","persistenceKey","host","ssl","forceLongPolling","autoDetectLongPolling","useFetchStreams","DatabaseId","projectId","database","static","isDefaultDatabase","other","Z","segments","offset","undefined","len","BasePath","comparator","child","nameOrPath","slice","limit","forEach","segment","push","construct","popFirst","size","popLast","firstSegment","lastSegment","get","index","isEmpty","isPrefixOf","__PRIVATE_i","isImmediateParentOf","potentialChild","fn","end","toArray","p1","p2","Math","min","left","right","tt","ResourcePath","canonicalString","join","pathComponents","t_1","path","indexOf","FirestoreError","split","filter","__PRIVATE_identifierRegExp","nt","FieldPath","test","str","replace","isValidIdentifier","isKeyField","current","__PRIVATE_addCurrentSegment","__PRIVATE_inBackticks","c","next","DocumentKey","fromString","emptyPath","collectionGroup","hasCollectionId","collectionId","getCollectionGroup","getCollectionPath","k1","k2","__PRIVATE_validateNonEmptyArgument","__PRIVATE_functionName","__PRIVATE_argumentName","__PRIVATE_argument","__PRIVATE_validateDocumentPath","isDocumentKey","__PRIVATE_validateCollectionPath","__PRIVATE_valueDescription","input","substring","Array","__PRIVATE_customObjectName","__PRIVATE_cast","_delegate","description","__PRIVATE_validatePositiveNumber","n","__PRIVATE_isNullOrUndefined","__PRIVATE_isNegativeZero","__PRIVATE_RpcCode","RpcCode","__PRIVATE_RPC_NAME_URL_MAPPING","__PRIVATE_mapCodeFromHttpStatus","status","OK","CANCELLED","UNKNOWN","INVALID_ARGUMENT","DEADLINE_EXCEEDED","NOT_FOUND","ALREADY_EXISTS","PERMISSION_DENIED","RESOURCE_EXHAUSTED","FAILED_PRECONDITION","ABORTED","OUT_OF_RANGE","UNIMPLEMENTED","INTERNAL","UNAVAILABLE","DATA_LOSS","pt","databaseInfo","__PRIVATE_fetchImpl","__PRIVATE_openStream","__PRIVATE_rpcName","async","url","body","__PRIVATE_requestJson","method","response","err","statusText","ok","json","__PRIVATE_errorResponse","isArray","__PRIVATE_errorMessage","_a","proto","__PRIVATE_baseUrl","__PRIVATE_databaseRoot","__PRIVATE_shouldResourcePathBeIncludedInRequest","__PRIVATE_invokeRPC","__PRIVATE_req","__PRIVATE_authToken","appCheckToken","__PRIVATE_makeUrl","__PRIVATE_modifyHeadersForRequest","__PRIVATE_performRPCRequest","__PRIVATE_invokeStreamingRPC","request","__PRIVATE_expectedResponseCount","key","__PRIVATE_urlRpcName","__PRIVATE_randomBytes","__PRIVATE_nBytes","crypto","self","msCrypto","bytes","Uint8Array","getRandomValues","floor","random","__PRIVATE_AutoId","__PRIVATE_chars","__PRIVATE_maxMultiple","__PRIVATE_autoId","charAt","__PRIVATE_primitiveComparator","__PRIVATE_arrayEquals","every","__PRIVATE_objectSize","count","Object","prototype","hasOwnProperty","call","ByteString","binaryString","base64","atob","array","String","fromCharCode","It","Symbol","iterator","charCodeAt","done","toBase64","raw","btoa","toUint8Array","buffer","approximateByteSize","compareTo","EMPTY_BYTE_STRING","__PRIVATE_ISO_TIMESTAMP_REG_EXP","RegExp","__PRIVATE_normalizeTimestamp","date","nanos","__PRIVATE_fraction","exec","__PRIVATE_nanoStr","substr","Number","__PRIVATE_parsedDate","Date","seconds","getTime","__PRIVATE_normalizeNumber","__PRIVATE_normalizeByteString","blob","fromBase64String","fromUint8Array","Timestamp","nanoseconds","fromMillis","now","milliseconds","toDate","toMillis","_compareTo","toJSON","valueOf","__PRIVATE_adjustedSeconds","padStart","__PRIVATE_isServerTimestamp","_b","mapValue","fields","__type__","stringValue","__PRIVATE_getPreviousValue","previousValue","__previous_value__","__PRIVATE_getLocalWriteTime","localWriteTime","__local_write_time__","timestampValue","MAX_VALUE","__PRIVATE_typeOrder","__PRIVATE_valueEquals","__PRIVATE_leftType","booleanValue","__PRIVATE_leftTimestamp","__PRIVATE_rightTimestamp","bytesValue","referenceValue","geoPointValue","latitude","longitude","integerValue","__PRIVATE_n1","doubleValue","__PRIVATE_n2","isNaN","arrayValue","values","__PRIVATE_leftMap","__PRIVATE_rightMap","__PRIVATE_arrayValueContains","__PRIVATE_haystack","__PRIVATE_needle","find","v","__PRIVATE_valueCompare","__PRIVATE_rightType","__PRIVATE_leftNumber","__PRIVATE_rightNumber","__PRIVATE_compareTimestamps","__PRIVATE_leftBytes","__PRIVATE_rightBytes","__PRIVATE_leftPath","__PRIVATE_rightPath","__PRIVATE_leftSegments","__PRIVATE_rightSegments","comparison","__PRIVATE_leftArray","__PRIVATE_rightArray","compare","__PRIVATE_leftKeys","keys","__PRIVATE_rightKeys","sort","__PRIVATE_keyCompare","__PRIVATE_refValue","__PRIVATE_isNullValue","__PRIVATE_isNanValue","__PRIVATE_isMapValue","__PRIVATE_deepClone","source","assign","target","val","Bound","position","inclusive","__PRIVATE_boundEquals","Filter","Gt","field","op","createKeyFieldInFilter","__PRIVATE_KeyFieldFilter","__PRIVATE_ArrayContainsFilter","__PRIVATE_InFilter","__PRIVATE_NotInFilter","__PRIVATE_ArrayContainsAnyFilter","FieldFilter","__PRIVATE_KeyFieldInFilter","__PRIVATE_KeyFieldNotInFilter","matches","doc","data","matchesComparison","isInequality","getFlattenedFilters","getFilters","getFirstInequalityField","Kt","filters","__PRIVATE_memoizedFlattenedFilters","CompositeFilter","reduce","result","__PRIVATE_subfilter","found","__PRIVATE_findFirstMatchingFilter","predicate","fieldFilter","__PRIVATE_filterEquals","__PRIVATE_f1","__PRIVATE_f2","__PRIVATE_f1Filter","Ht","fromName","Jt","__PRIVATE_extractDocumentKeysFromArrayValue","some","Xt","te","ee","ne","nullValue","re","OrderBy","dir","__PRIVATE_orderByEquals","SnapshotVersion","timestamp","toMicroseconds","toTimestamp","SortedMap","root","LLRBNode","EMPTY","insert","copy","BLACK","remove","node","cmp","__PRIVATE_prunedNodes","minKey","maxKey","inorderTraversal","action","k","__PRIVATE_descriptions","reverseTraversal","getIterator","SortedMapIterator","getIteratorFrom","getReverseIterator","getReverseIteratorFrom","startKey","isReverse","nodeStack","getNext","pop","hasNext","peek","color","RED","fixUp","removeMin","isRed","moveRedLeft","__PRIVATE_smallest","rotateRight","moveRedRight","rotateLeft","colorFlip","__PRIVATE_nl","__PRIVATE_nr","checkMaxDepth","__PRIVATE_blackDepth","check","pow","SortedSet","has","elem","first","last","cb","forEachInRange","range","iter","forEachWhile","firstAfterOrEqual","SortedSetIterator","add","delete","unionWith","__PRIVATE_thisIt","__PRIVATE_otherIt","__PRIVATE_thisElem","__PRIVATE_otherElem","__PRIVATE_res","targetId","FieldMask","extraFields","__PRIVATE_mergedMaskSet","fieldPath","covers","l","r","ObjectValue","__PRIVATE_currentLevel","getFieldsMap","setAll","parent","__PRIVATE_upserts","__PRIVATE_deletes","__PRIVATE_fieldsMap","applyChanges","__PRIVATE_nestedValue","__PRIVATE_inserts","clone","MutableDocument","documentType","version","readTime","createTime","documentState","documentKey","empty","convertToFoundDocument","convertToNoDocument","convertToUnknownDocument","setHasCommittedMutations","setHasLocalMutations","setReadTime","hasLocalMutations","hasCommittedMutations","hasPendingWrites","isValidDocument","isFoundDocument","isNoDocument","isUnknownDocument","mutableCopy","__PRIVATE_TargetImpl","orderBy","startAt","endAt","__PRIVATE_memoizedCanonicalId","__PRIVATE_newTarget","__PRIVATE_QueryImpl","explicitOrderBy","limitType","__PRIVATE_memoizedOrderBy","__PRIVATE_memoizedTarget","__PRIVATE_getFirstOrderByField","query","__PRIVATE_getInequalityFilterField","__PRIVATE_isCollectionGroupQuery","__PRIVATE_queryOrderBy","__PRIVATE_queryImpl","__PRIVATE_inequalityField","__PRIVATE_firstOrderByField","keyField","__PRIVATE_foundKeyOrdering","__PRIVATE_lastDirection","__PRIVATE_queryToTarget","__PRIVATE_orderBys","__PRIVATE_queryWithAddedFilter","__PRIVATE_newFilters","__PRIVATE_toNumber","__PRIVATE_serializer","isInteger","MAX_SAFE_INTEGER","MIN_SAFE_INTEGER","__PRIVATE_useProto3Json","Infinity","TransformOperation","_","Pe","Ve","elements","$e","Ne","__PRIVATE_operand","FieldTransform","transform","Precondition","updateTime","exists","isNone","Mutation","Se","precondition","fieldTransforms","getFieldMask","qe","fieldMask","Oe","ke","__PRIVATE_DIRECTIONS","__PRIVATE_dirs","__PRIVATE_OPERATORS","__PRIVATE_ops","__PRIVATE_COMPOSITE_OPERATORS","__PRIVATE_JsonProtoSerializer","toISOString","__PRIVATE_toBytes","__PRIVATE_toVersion","__PRIVATE_fromVersion","fromTimestamp","__PRIVATE_toResourceName","__PRIVATE_toName","__PRIVATE_resourceName","__PRIVATE_resource","__PRIVATE_isValidResourceName","__PRIVATE_toQueryPath","__PRIVATE_getEncodedDatabaseId","__PRIVATE_toMutationDocument","__PRIVATE_toQueryTarget","structuredQuery","from","allDescendants","where","__PRIVATE_toFilter","create","order","__PRIVATE_toFieldPathReference","direction","__PRIVATE_toDirection","cursor","before","__PRIVATE_toOperatorName","__PRIVATE_toCompositeOperatorName","unaryFilter","__PRIVATE_protos","compositeFilter","__PRIVATE_toDocumentMask","__PRIVATE_canonicalFields","fieldPaths","__PRIVATE_newSerializer","__PRIVATE_ExponentialBackoff","__PRIVATE_queue","timerId","__PRIVATE_initialDelayMs","__PRIVATE_backoffFactor","__PRIVATE_maxDelayMs","__PRIVATE_currentBaseMs","__PRIVATE_timerPromise","__PRIVATE_lastAttemptTime","reset","__PRIVATE_resetToMax","__PRIVATE_backoffAndRun","cancel","__PRIVATE_desiredDelayWithJitterMs","__PRIVATE_jitterDelayMs","__PRIVATE_delaySoFarMs","max","__PRIVATE_remainingDelayMs","enqueueAfterDelay","__PRIVATE_skipBackoff","skipDelay","ln","authCredentials","appCheckCredentials","connection","__PRIVATE_terminated","__PRIVATE_DatastoreImpl","__PRIVATE_verifyInitialized","all","catch","terminate","__PRIVATE_invokeCommitRpc","datastore","mutations","__PRIVATE_datastoreImpl","writes","m","toMutation","mutation","__PRIVATE_SetMutation","update","__PRIVATE_DeleteMutation","__PRIVATE_PatchMutation","updateMask","__PRIVATE_VerifyMutation","verify","updateTransforms","__PRIVATE_fieldTransform","__PRIVATE_ServerTimestampTransform","setToServerValue","__PRIVATE_ArrayUnionTransformOperation","appendMissingElements","__PRIVATE_ArrayRemoveTransformOperation","removeAllFromArray","__PRIVATE_NumericIncrementTransformOperation","increment","currentDocument","__PRIVATE_invokeBatchGetDocumentsRpc","documents","docs","newFoundDocument","missing","newNoDocument","__PRIVATE_fromBatchGetDocumentsResponse","__PRIVATE_datastoreInstances","__PRIVATE_getDatastore","firestore","_terminated","__PRIVATE_FetchConnection","fetch","bind","_databaseId","app","options","_persistenceKey","settings","_freezeSettings","experimentalForceLongPolling","experimentalAutoDetectLongPolling","_authCredentials","_appCheckCredentials","FirestoreSettingsImpl","credentials","ignoreUndefinedProperties","cacheSizeBytes","optionName1","argument1","optionName2","argument2","Firestore","_app","_settings","_settingsFrozen","_initialized","_terminateTask","_setSettings","__PRIVATE_client","client","sessionIndex","iamToken","authTokenFactory","_getSettings","_delete","_terminate","initializeFirestore","provider","_getProvider","isInitialized","initialize","instanceIdentifier","getFirestore","__PRIVATE_appOrDatabaseId","__PRIVATE_optionalDatabaseId","getApp","db","getImmediate","identifier","__PRIVATE_emulator","getDefaultEmulatorHostnameAndPort","connectFirestoreEmulator","port","mockUserToken","createMockUserToken","sub","user_id","_removeServiceInstance","AggregateField","AggregateQuerySnapshot","_data","__PRIVATE_CountQueryRunner","userDataWriter","run","__PRIVATE_queryTarget","structuredAggregationQuery","aggregations","alias","sent","aggregateFields","__PRIVATE_invokeRunAggregationQueryRpc","_query","__PRIVATE_countValue","entries","convertValue","DocumentReference","converter","_key","_path","id","CollectionReference","withConverter","Query","$n","parentPath","collection","pathSegments","getModularInstance","__PRIVATE_absolutePath","arguments","__PRIVATE_newId","refEqual","queryEqual","__PRIVATE_queryEquals","Bytes","byteString","_byteString","fieldNames","_internalPath","__PRIVATE_InternalFieldPath","documentId","FieldValue","_methodName","GeoPoint","isFinite","_lat","_long","__PRIVATE_RESERVED_FIELD_REGEX","ParsedSetData","ParsedUpdateData","__PRIVATE_isWrite","__PRIVATE_dataSource","__PRIVATE_ParseContextImpl","__PRIVATE_validatePath","__PRIVATE_contextWith","configuration","__PRIVATE_childContextForField","__PRIVATE_childPath","context","__PRIVATE_arrayElement","__PRIVATE_validatePathSegment","__PRIVATE_childContextForFieldPath","__PRIVATE_childContextForArray","__PRIVATE_createError","reason","methodName","__PRIVATE_hasConverter","__PRIVATE_targetDoc","contains","__PRIVATE_UserDataReader","__PRIVATE_createContext","__PRIVATE_newUserDataReader","__PRIVATE_parseSetData","__PRIVATE_userDataReader","merge","mergeFields","__PRIVATE_validatePlainObject","__PRIVATE_updateData","__PRIVATE_parseObject","__PRIVATE_validatedFieldPaths","__PRIVATE_fieldPathFromArgument","__PRIVATE_fieldMaskContains","Kn","_toFieldTransform","__PRIVATE_DeleteFieldValueImpl","__PRIVATE_createSentinelChildContext","__PRIVATE_fieldValue","Hn","__PRIVATE_ServerTimestampFieldValueImpl","Jn","__PRIVATE__elements","__PRIVATE_parseContext","__PRIVATE_parsedElements","element","__PRIVATE_parseData","arrayUnion","Xn","Zn","__PRIVATE__operand","__PRIVATE_numericIncrement","__PRIVATE_parseUpdateData","__PRIVATE_fieldMaskPaths","__PRIVATE_fieldPathFromDotSeparatedString","__PRIVATE_childContext","__PRIVATE_parsedValue","mask","__PRIVATE_parseUpdateVarargs","moreFieldsAndValues","__PRIVATE_parseQueryValue","__PRIVATE_allowArrays","__PRIVATE_looksLikeJsonObject","__PRIVATE_entryIndex","t_25","__PRIVATE_parsedEntry","fromDate","__PRIVATE_thisDb","__PRIVATE_otherDb","getPrototypeOf","__PRIVATE_FIELD_PATH_RESERVED","search","__PRIVATE_hasPath","__PRIVATE_hasDocument","DocumentSnapshot","_firestore","_userDataWriter","_document","_converter","ref","snapshot","QueryDocumentSnapshot","fromFirestore","dr","QuerySnapshot","_docs","callback","thisArg","snapshotEqual","arg","AppliableConstraint","gr","__PRIVATE_queryConstraint","__PRIVATE_additionalQueryConstraints","queryConstraints","__PRIVATE_compositeFilterCount","QueryCompositeFilterConstraint","__PRIVATE_fieldFilterCount","QueryFieldFilterConstraint","constraint","_apply","vr","_field","_op","_value","QueryConstraint","_parse","__PRIVATE_validateNewFieldFilter","__PRIVATE_reader","__PRIVATE_dataReader","__PRIVATE_validateDisjunctiveFilterElements","__PRIVATE_referenceList","__PRIVATE_parseDocumentIdValue","opStr","_create","Er","_queryConstraints","__PRIVATE_parsedFilters","__PRIVATE_parsedFilter","_getOperator","__PRIVATE_testQuery","__PRIVATE_subFilters","__PRIVATE_subFilter","_getQueryConstraints","or","__PRIVATE_validateQueryFilterConstraint","and","Ar","_direction","QueryOrderByConstraint","__PRIVATE_validateOrderByAndInequalityMatch","__PRIVATE_newOrderBy","directionStr","Pr","_limit","_limitType","QueryLimitConstraint","limitToLast","Nr","_docOrFields","_inclusive","QueryStartAtConstraint","bound","__PRIVATE_newQueryBoundFromDocOrFields","__PRIVATE_docOrFields","startAfter","xr","QueryEndAtConstraint","endBefore","components","__PRIVATE_rawValue","__PRIVATE_wrapped","__PRIVATE_documentIdValue","operator","__PRIVATE_existingInequality","__PRIVATE_newInequality","__PRIVATE_conflictingOp","__PRIVATE_operators","__PRIVATE_baseQuery","__PRIVATE_inequality","__PRIVATE_applyFirestoreDataConverter","toFirestore","Br","__PRIVATE_LiteUserDataWriter","convertBytes","convertReference","convertDocumentKey","serverTimestampBehavior","convertTimestamp","convertServerTimestamp","convertGeoPoint","convertArray","convertObject","__PRIVATE_normalizedValue","expectedDatabaseId","__PRIVATE_resourcePath","getDoc","reference","document","getDocs","__PRIVATE_invokeRunQueryRpc","reverse","setDoc","__PRIVATE_convertedValue","__PRIVATE_parsed","none","updateDoc","__PRIVATE_fieldOrUpdateData","deleteDoc","addDoc","__PRIVATE_docRef","getCount","aggregateQuerySnapshotEqual","deepEqual","deleteField","serverTimestamp","__PRIVATE_ArrayUnionFieldValueImpl","arrayRemove","__PRIVATE_ArrayRemoveFieldValueImpl","__PRIVATE_NumericIncrementFieldValueImpl","WriteBatch","_commitHandler","_mutations","_committed","_dataReader","documentRef","_verifyNotCommitted","__PRIVATE_validateReference","commit","writeBatch","Transaction","readVersions","committed","lastWriteError","writtenDocs","Set","ensureCommitNotCalled","recordVersion","write","preconditionForUpdate","__PRIVATE_unwritten","fromPath","__PRIVATE_docVersion","__PRIVATE_existingVersion","__PRIVATE_DEFAULT_TRANSACTION_OPTIONS","maxAttempts","__PRIVATE_TransactionRunner","updateFunction","deferred","__PRIVATE_attemptsRemaining","__PRIVATE_backoff","__PRIVATE_runWithBackOff","transaction","__PRIVATE_userPromise","__PRIVATE_tryRunUpdateFunction","enqueueAndForget","__PRIVATE_commitError","__PRIVATE_handleTransactionError","__PRIVATE_userPromiseError","__PRIVATE_isRetryableTransactionError","getDocument","DelayedOperation","targetTimeMs","removalCallback","delayMs","__PRIVATE_delayedOp","timerHandle","setTimeout","handleDelayElapsed","clearTimeout","__PRIVATE_AsyncQueueImpl","__PRIVATE_tail","__PRIVATE_retryableOps","__PRIVATE__isShuttingDown","__PRIVATE_delayedOperations","__PRIVATE_operationInProgress","__PRIVATE_skipNonRestrictedTasks","__PRIVATE_timerIdsToSkip","__PRIVATE_visibilityHandler","visibilityState","addEventListener","isShuttingDown","enqueue","enqueueAndForgetEvenWhileRestricted","__PRIVATE_verifyNotFailed","__PRIVATE_enqueueInternal","enterRestrictedMode","purgeExistingTasks","removeEventListener","task","__PRIVATE_retryNextOp","shift","__PRIVATE_newTail","stack","includes","createAndSchedule","__PRIVATE_removedOp","__PRIVATE_removeDelayedOperation","verifyOperationInProgress","__PRIVATE_currentTail","__PRIVATE_containsDelayedOperation","__PRIVATE_runAllDelayedOperationsUntil","__PRIVATE_lastTimerId","__PRIVATE_drain","a","b","__PRIVATE_skipDelaysForTimerId","splice","_transaction","lookup","runTransaction","__PRIVATE_optionsWithDefaults","__PRIVATE_internalTransaction","_registerComponent","Component","container","getProvider","__PRIVATE_firestoreInstance","apply","setMultipleInstances","registerVersion"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqBaA,KAAAA,kBAAAA;IAUXC,SAAAA,EAAqBC;QAAAC,KAAGD,MAAHA;;WAErBE,EAAAA,UAAAA,kBAAAA;QACE,OAAmB,QAAZD,KAAKD;;;;;;IAOdG,oBAAAA;QACE,OAAIF,KAAKC,oBACA,SAASD,KAAKD,MAEd;OAIXI,EAAQC,UAAAA,UAARD,SAAQC;QACN,OAAOA,EAAUL,QAAQC,KAAKD;;;;8BA3BhBM,GAAAA,kBAAkB,IAAIR,EAAK;;;AAI3BA,EAAAS,qBAAqB,IAAIT,EAAK,2BAC9BA,EAAAU,cAAc,IAAIV,EAAK;AACvBA,EAAAW,YAAY,IAAIX,EAAK;;;;;;;;;;;;;;;;;;ACVhC,IAAIY,IAAAA,UCKLC,IAAY,IAAIC,EAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoBvB,SAAUC,EAAYC;IAC1BH,EAAUE,YAAYC;;;AAGRC,SAAAA,EAASC;SAAgBC,IAAAA,IAAAA,IAAAA,IAAAA,GAAAA,IAAAA,UAAAA,QAAAA,KAAAA,EAAAA,IAAAA,KAAAA,UAAAA;IACvC,IAAIN,EAAUG,YAAYI,EAASC,OAAO;QACxC,IAAMC,IAAOH,EAAII,IAAIC;QACrBX,EAAUY,MAAVZ,MAAAA,GAAgBa,EAAA,EAAA,cAAAC,OAAcf,GAAAA,OAAAA,OAAiBM,MAAUI,IAAAA;;;;AAI7CM,SAAAA,EAASV;SAAgBC,IAAAA,IAAAA,IAAAA,IAAAA,GAAAA,IAAAA,UAAAA,QAAAA,KAAAA,EAAAA,IAAAA,KAAAA,UAAAA;IACvC,IAAIN,EAAUG,YAAYI,EAASS,OAAO;QACxC,IAAMP,IAAOH,EAAII,IAAIC;QACrBX,EAAUiB,MAAVjB,MAAAA,GAAgBa,EAAA,EAAA,cAAAC,OAAcf,GAAAA,OAAAA,OAAiBM,MAAUI,IAAAA;;;;;;GAO7CS,UAAAA,EAAQb;SAAgBC,IAAAA,IAAAA,IAAAA,IAAAA,GAAAA,IAAAA,UAAAA,QAAAA,KAAAA,EAAAA,IAAAA,KAAAA,UAAAA;IACtC,IAAIN,EAAUG,YAAYI,EAASY,MAAM;QACvC,IAAMV,IAAOH,EAAII,IAAIC;QACrBX,EAAUoB,KAAVpB,MAAAA,GAAea,EAAA,EAAA,cAAAC,OAAcf,GAAAA,OAAAA,OAAiBM,MAAUI,IAAAA;;;;;;GAO5D,UAASE,EAAYL;IACnB,IAAmB,mBAARA,GACT,OAAOA;IAEP;QACE,OC9DqBe,ID8DHf,GC7DfgB,KAAKC,UAAUF;MD8DlB,OAAOG;;QAEP,OAAOlB;;;;;;;;;;;;;;;;;;wECjEP,IAAqBe;;;;;;;;;;;;;;;;;;;;;;;;;;GCWX,UAAAI,EAAKC;SAAAA,MAAAA,MAAAA,IAAkB;;;QAGrC,IAAMC,IACJ,cAAAb,OAAcf,GAA6C2B,mCAAAA;;;;QAM7D,MALAX,EAASY,IAKH,IAAIC,MAAMD;;;;;;;;;AASF,SAAAE,EACdC,GACAH;IAEKG,KACHL;;;;;;GA2BE,UAAUM,EACdzB;;AAEAlB;IAMA,OAAOkB;;;;;;;;;;;;;;;;;;GCPF,KAAM0B,IAOA,aAPAA,IAUF,WAVEA,IAkBO,oBAlBPA,IA2BQ,qBA3BRA,IA8BA,aA9BAA,IA6CQ,qBA7CRA,IAmDM,mBAnDNA,IAyDS,sBAzDTA,IA+EU,uBA/EVA,IAwFF,WAxFEA,IAyGG,gBAzGHA,IA4GI,iBA5GJA,IAkHD,YAlHCA,IA2HE,eAOTC,kBAAA,SAAAC;;IAKJ9C,SAAAA;;;;IAIW+C;;;;IAIAR;QARXvC;gBAUEgD,IAAAA,aAAMD,GAAMR,YANCQ,OAAJA,GAIA7C,EAAOqC,UAAPA;;;;QAOTrC,EAAK+C,WAAW;YAAM,OAAA,GAAG/C,OAAAA,EAAKgD,MAAehD,YAAAA,OAAAA,EAAK6C,oBAAU7C,EAAKqC;;;WApBjCY,EAAAA,GAAAA;CAA9B,CAA8BA,IC3LvBC,IAMXpD;IAAAA;IACEE,KAAKmD,UAAU,IAAIC,SAAQ,SAACC,GAAsBC;QAChDtD,EAAKqD,UAAUA,GACfrD,EAAKsD,SAASA;;GC2CPC,IAIXzD,SAAYiC,GAAsByB;IAAAxD,KAAIwD,OAAJA,GAHlCxD,KAAIyD,OAAG,SACPzD,KAAA0D,UAAU,IAAIC,KAGZ3D,KAAK0D,QAAQE,IAAI,iBAAiB,UAAApC,OAAUO;GA4CnC8B,kBAAAA;IAAAA,SAAAA;WACXC,EAAAA,UAAAA,WAAAA;QACE,OAAOV,QAAQC,QAAsB;OAGvCU,EAAAA,UAAAA,kBAAAA,eAEAC,EAAAA,UAAAA,QAAAA,SACEC,GACAC;;QAGAD,EAAWE,kBAAiB;YAAMD,OAAAA,EAAerE,EAAKQ;;OAGxD+D,EAAAA,UAAAA,WAAAA;CAfWP,IAsBAQ,kBAAAA;IAGXvE,SAAAA,EAAoBwE;QAAAtE,KAAKsE,QAALA;;;;;;QAOZtE,KAAckE,iBAA0C;;WAEhEJ,EAAAA,UAAAA,WAAAA;QACE,OAAOV,QAAQC,QAAQrD,KAAKsE;OAG9BP,EAAAA,UAAAA,kBAAAA,eAEAC,EAAAA,UAAAA,QAAAA,SACEC,GACAC;QAFFF;QAQEhE,KAAKkE,iBAAiBA;;QAEtBD,EAAWE;YAAuBD,OAAAA,EAAelE,EAAKsE,MAAMd;;OAG9DY,EAAAA,UAAAA,WAAAA;QACEpE,KAAKkE,iBAAiB;;CAhCbG,IAqCAE,kBAAAA;IAGXzE,SAAAA,EAAY0E;QAAZ1E;QAFQE,KAAIyE,OAAgC,MAG1CD,EAAaE,QAAOD,SAAAA;YAClBzE,EAAKyE,OAAOA;;;WAIhBX,EAAAA,UAAAA,WAAAA;QAAAA;QACE,OAAK9D,KAAKyE,OAIHzE,KAAKyE,KAAKX,WAAWa,eAAKC;YAC3BA,OAAAA,KACFrC,EACmC,mBAA1BqC,EAAUC,cAGZ,IAAItB,EACTqB,EAAUC,aACV,IAAIhF,EAAKG,EAAKyE,KAAMK,cAGf;cAdF1B,QAAQC,QAAQ;OAmB3BU,EAAAA,UAAAA,kBAAAA,eAEAC,EAAAA,UAAAA,QAAAA,SACEC,GACAC;IAGFE,EAAAA,UAAAA,WAAAA;CArCWG,IAoNAQ,kBAAAA;IAKXjF,SAAAA,EACmBkF,GACAC,GACAC,GACAC;QAHAnF,KAAAgF,IAAAA,GACAhF,KAAAiF,IAAAA,GACAjF,KAAAkF,IAAAA,GACAlF,KAAAmF,IAAAA,GARnBnF,KAAIyD,OAAG,cACPzD,KAAAwD,OAAO3D,EAAKU;QACZP,KAAmBoF,IAAA,IAAIzB;;;WAUf0B,gBAAAA;QACN,OAAIrF,KAAKmF,IACAnF,KAAKmF;;QAGZ5C,IAEyB,mBAAdvC,KAAKgF,KACE,SAAdhF,KAAKgF,MACLhF,KAAKgF,EAAWP,SAChBzE,KAAKgF,EAAWP,KAAmCa;QAIhDtF,KAAKgF,EAAYP,KAAmCa,gCAAE;OAI7D5B,OAAAA,eAAAA,EAAAA,WAAAA,WAAAA;QAAAA,KAAAA;YACF1D,KAAKoF,EAASxB,IAAI,mBAAmB5D,KAAKiF;;YAE1C,IAAMM,IAAuBvF,KAAKqF;YAQlC,OAPIE,KACFvF,KAAKoF,EAASxB,IAAI,iBAAiB2B,IAEjCvF,KAAKkF,KACPlF,KAAKoF,EAASxB,IAAI,kCAAkC5D,KAAKkF;YAGpDlF,KAAKoF;;;;;CA1CHL,IAmDAS,kBAAAA;IAGX1F,SAAAA,EACUkF,GACAC,GACAC,GACAC;QAHAnF,KAAAgF,IAAAA,GACAhF,KAAAiF,IAAAA,GACAjF,KAAAkF,IAAAA,GACAlF,KAAAmF,IAAAA;;WAGVrB,EAAAA,UAAAA,WAAAA;QACE,OAAOV,QAAQC,QACb,IAAI0B,EACF/E,KAAKgF,GACLhF,KAAKiF,GACLjF,KAAKkF,GACLlF,KAAKmF;OAKXnB,EAAAA,UAAAA,QAAAA,SACEC,GACAC;;QAGAD,EAAWE,kBAAiB;YAAMD,OAAAA,EAAerE,EAAKU;;OAGxD6D,EAAAA,UAAAA,WAAAA,eAEAL,EAAAA,UAAAA,kBAAAA;;CA/BWyB,IAkCAC,IAIX3F,SAAoBiC;IAAA/B,KAAK+B,QAALA,GAHpB/B,KAAIyD,OAAG,YACPzD,KAAA0D,UAAU,IAAIC,KAGR5B,KAASA,EAAM2D,SAAS,KAC1B1F,KAAK0D,QAAQE,IAAI,uBAAuB5D,KAAK+B;GAqItC4D,kBAAAA;IAGX7F,SAAAA,EACU8F;QADV9F;QACUE,KAAA4F,IAAAA,GAHF5F,KAAQ6F,WAAoC,MAKlDD,EAAiBlB,QAAOmB,SAAAA;YACtB7F,EAAK6F,WAAWA;;;WAIpB/B,EAAAA,UAAAA,WAAAA;QACE,OAAK9D,KAAK6F,WAIH7F,KAAK6F,SAAS/B,WAAWa,eAAKmB;YAC/BA,OAAAA,KACFvD,EAC+B,mBAAtBuD,EAAYxB,QAGd,IAAImB,EAAcK,EAAYxB,UAE9B;cAXFlB,QAAQC,QAAQ;OAgB3BU,EAAAA,UAAAA,kBAAAA,eAEAC,EAAAA,UAAAA,QAAAA,SACEC,GACAC;IAGFE,EAAAA,UAAAA,WAAAA;CApCWuB,ICxlBAI;;;;;;;;;;;;;;;;;;AAkBXjG,SACWkG,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC;IAPAvG,KAAUgG,aAAVA,GACAhG,KAAKiG,QAALA,GACAjG,KAAckG,iBAAdA,GACAlG,KAAImG,OAAJA,GACAnG,KAAGoG,MAAHA;IACApG,KAAgBqG,mBAAhBA,GACArG,KAAqBsG,wBAArBA,GACAtG,KAAeuG,kBAAfA;GAWAC,kBAAAA;IAEX1G,SAAqB2G,EAAAA,GAAmBC;QAAnB1G,KAASyG,YAATA,GACnBzG,KAAK0G,WAAWA,KATiB;;WAYnCC,EAAAA,QAAAA;QACE,OAAO,IAAIH,EAAW,IAAI;OAGxBI,OAAAA,eAAAA,EAAAA,WAAAA,qBAAAA;QAAAA,KAAAA;YACF,OAjBiC,gBAiB1B5G,KAAK0G;;;;QAGdvG,EAAQ0G,UAAAA,UAAR1G,SAAQ0G;QACN,OACEA,aAAiBL,KACjBK,EAAMJ,cAAczG,KAAKyG,aACzBI,EAAMH,aAAa1G,KAAK0G;;KCnD9BI,mBAAA;IAKEhH,SAAAA,EAAYiH,GAAoBC,GAAiBtB;aAChCuB,MAAXD,IACFA,IAAS,IACAA,IAASD,EAASrB,UAC3BvD,UAGa8E,MAAXvB,IACFA,IAASqB,EAASrB,SAASsB,IAClBtB,IAASqB,EAASrB,SAASsB,KACpC7E;QAEFnC,KAAK+G,WAAWA,GAChB/G,KAAKgH,SAASA,GACdhH,KAAKkH,MAAMxB;;WAqBTA,OAAAA,eAAAA,EAAAA,WAAAA,UAAAA;QAAAA,KAAAA;YACF,OAAO1F,KAAKkH;;;;QAGd/G,EAAQ0G,UAAAA,UAAR1G,SAAQ0G;QACN,OAA4C,MAArCM,EAASC,WAAWpH,MAAM6G;OAGnCQ,EAAMC,UAAAA,QAAND,SAAMC;QACJ,IAAMP,IAAW/G,KAAK+G,SAASQ,MAAMvH,KAAKgH,QAAQhH,KAAKwH;QAQvD,OAPIF,aAAsBH,IACxBG,EAAWG,SAAQC,SAAAA;YACjBX,EAASY,KAAKD;cAGhBX,EAASY,KAAKL,IAETtH,KAAK4H,UAAUb;;+DAIhBS,oBAAAA;QACN,OAAOxH,KAAKgH,SAAShH,KAAK0F;OAG5BmC,EAASC,UAAAA,WAATD,SAASC;QAMP,OALAA,SAAgBb,MAATa,IAAqB,IAAIA,GAKzB9H,KAAK4H,UACV5H,KAAK+G,UACL/G,KAAKgH,SAASc,GACd9H,KAAK0F,SAASoC;OAIlBC,EAAAA,UAAAA,UAAAA;QAEE,OAAO/H,KAAK4H,UAAU5H,KAAK+G,UAAU/G,KAAKgH,QAAQhH,KAAK0F,SAAS;OAGlEsC,EAAAA,UAAAA,eAAAA;QAEE,OAAOhI,KAAK+G,SAAS/G,KAAKgH;OAG5BiB,EAAAA,UAAAA,cAAAA;QAEE,OAAOjI,KAAKkI,IAAIlI,KAAK0F,SAAS;OAGhCwC,EAAIC,UAAAA,MAAJD,SAAIC;QAEF,OAAOnI,KAAK+G,SAAS/G,KAAKgH,SAASmB;OAGrCC,EAAAA,UAAAA,UAAAA;QACE,OAAuB,MAAhBpI,KAAK0F;OAGd2C,EAAWxB,UAAAA,aAAXwB,SAAWxB;QACT,IAAIA,EAAMnB,SAAS1F,KAAK0F,QACtB,QAAO;QAGT,KAAK,IAAI4C,IAAI,GAAGA,IAAItI,KAAK0F,QAAQ4C,KAC/B,IAAItI,KAAKkI,IAAII,OAAOzB,EAAMqB,IAAII,IAC5B,QAAO;QAIX,QAAO;OAGTC,EAAoBC,UAAAA,sBAApBD,SAAoBC;QAClB,IAAIxI,KAAK0F,SAAS,MAAM8C,EAAe9C,QACrC,QAAO;QAGT,KAAK,IAAI4C,IAAI,GAAGA,IAAItI,KAAK0F,QAAQ4C,KAC/B,IAAItI,KAAKkI,IAAII,OAAOE,EAAeN,IAAII,IACrC,QAAO;QAIX,QAAO;OAGTb,EAAQgB,UAAAA,UAARhB,SAAQgB;QACN,KAAK,IAAIH,IAAItI,KAAKgH,QAAQ0B,IAAM1I,KAAKwH,SAASc,IAAII,GAAKJ,KACrDG,EAAGzI,KAAK+G,SAASuB;OAIrBK,EAAAA,UAAAA,UAAAA;QACE,OAAO3I,KAAK+G,SAASQ,MAAMvH,KAAKgH,QAAQhH,KAAKwH;OAG/Cb,EAAAA,aAAAA,SACEiC,GACAC;QAGA,KADA,IAAM3B,IAAM4B,KAAKC,IAAIH,EAAGlD,QAAQmD,EAAGnD,SAC1B4C,IAAI,GAAGA,IAAIpB,GAAKoB,KAAK;YAC5B,IAAMU,IAAOJ,EAAGV,IAAII,IACdW,IAAQJ,EAAGX,IAAII;YACrB,IAAIU,IAAOC,GACT,QAAQ;YAEV,IAAID,IAAOC,GACT,OAAO;;QAGX,OAAIL,EAAGlD,SAASmD,EAAGnD,UACT,IAENkD,EAAGlD,SAASmD,EAAGnD,SACV,IAEF;;KAULwD,mBAAA,SAAAtG;IAAA,SAAAsG;;;WAA4B/B,EAAAA,GAAAA,IACtBS,EAAAA,UAAAA,YAAAA,SACRb,GACAC,GACAtB;QAEA,OAAO,IAAIyD,EAAapC,GAAUC,GAAQtB;OAG5C0D,EAAAA,UAAAA,kBAAAA;;;;QAKE,OAAOpJ,KAAK2I,UAAUU,KAAK;OAG7BtG,EAAAA,UAAAA,WAAAA;QACE,OAAO/C,KAAKoJ;;;;;;;IAQOE,eAArB3C;aAAqB2C,IAAAA,IAAAA,IAAAA,IAAAA,GAAAA,IAAAA,UAAAA,QAAAA,KAAAA,EAAAA,KAAAA,UAAAA;;;;gBAMnB,KADA,IAAMvC,IAAqB,WACRuC,IAAAA,GAAAA,IAAgBC,EAAA7D,QAAhB4D,KAAgB;YAA9B,IAAME;YACT,IAAIA,EAAKC,QAAQ,SAAS,GACxB,MAAM,IAAIC,EACRhH,GACA,oBAAoB8G,OAAAA,GAAAA;;wBAIxBzC,EAASY,KAATZ,MAAAA,GAAiByC,EAAKG,MAAM,KAAKC,QAAOlC,SAAAA;gBAAWA,OAAAA,EAAQhC,SAAS;;;QAGtE,OAAO,IAAIyD,EAAapC;OAG1BJ,EAAAA,YAAAA;QACE,OAAO,IAAIwC,EAAa;;CA/CtB,CAA4BhC,KAmD5B0C,KAAmB,4BAMnBC,mBAAA,SAAAlH;IAAA,SAAAkH;;;WAAyB3C,EAAAA,GAAAA,IACnBS,EAAAA,UAAAA,YAAAA,SACRb,GACAC,GACAtB;QAEA,OAAO,IAAIqE,EAAUhD,GAAUC,GAAQtB;;;;;;IAORgC,EAAAA,oBAAzBf,SAAyBe;QAC/B,OAAOmC,GAAiBG,KAAKtC;OAG/B0B,EAAAA,UAAAA,kBAAAA;QACE,OAAOpJ,KAAK2I,UACTvH,KAAAA,SAAI6I;YACHA,OAAAA,IAAMA,EAAIC,QAAQ,OAAO,QAAQA,QAAQ,MAAM,QAC1CH,EAAUI,kBAAkBF,OAC/BA,IAAM,MAAMA,IAAM;YAEbA;YAERZ,KAAK;OAGVtG,EAAAA,UAAAA,WAAAA;QACE,OAAO/C,KAAKoJ;;;;;IAMdgB,yBAAAA;QACE,OAAuB,MAAhBpK,KAAK0F,UA9QiB,eA8QD1F,KAAKkI,IAAI;;;;;IAMvCvB,aAAAA;QACE,OAAO,IAAIoD,EAAU,EArRQ;;;;;;;;;;;;IAkSPP,EAAAA,mBAAxB7C,SAAwB6C;QAmBtB,KAlBA,IAAMzC,IAAqB,IACvBsD,IAAU,IACV/B,IAAI,GAEFgC,IAAoB;YACxB,IAAuB,MAAnBD,EAAQ3E,QACV,MAAM,IAAIgE,EACRhH,GACA,uBAAuB8G,OAAAA,GAAAA;YAI3BzC,EAASY,KAAK0C,IACdA,IAAU;WAGRE,KAAc,GAEXjC,IAAIkB,EAAK9D,UAAQ;YACtB,IAAM8E,IAAIhB,EAAKlB;YACf,IAAU,SAANkC,GAAY;gBACd,IAAIlC,IAAI,MAAMkB,EAAK9D,QACjB,MAAM,IAAIgE,EACRhH,GACA,yCAAyC8G;gBAG7C,IAAMiB,IAAOjB,EAAKlB,IAAI;gBACtB,IAAe,SAATmC,KAA0B,QAATA,KAAyB,QAATA,GACrC,MAAM,IAAIf,EACRhH,GACA,uCAAuC8G;gBAG3Ca,KAAWI,GACXnC,KAAK;mBACU,QAANkC,KACTD,KAAeA,GACfjC,OACe,QAANkC,KAAcD,KAIvBF,KAAWG,GACXlC,QAJAgC,KACAhC;;QAQJ,IAFAgC,KAEIC,GACF,MAAM,IAAIb,EACRhH,GACA,6BAA6B8G;QAIjC,OAAO,IAAIO,EAAUhD;OAGvBJ,EAAAA,YAAAA;QACE,OAAO,IAAIoD,EAAU;;CAtHnB,CAAyB5C,KCrOlBuD,mBAAAA;IACX5K,SAAAA,EAAqB0J;QAAAxJ,KAAIwJ,OAAJA;;WAQLA,EAAAA,WAAhB7C,SAAgB6C;QACd,OAAO,IAAIkB,EAAYvB,GAAawB,WAAWnB;OAGjCxG,EAAAA,WAAhB2D,SAAgB3D;QACd,OAAO,IAAI0H,EAAYvB,GAAawB,WAAW3H,GAAM6E,SAAS;OAGhElB,EAAAA,QAAAA;QACE,OAAO,IAAI+D,EAAYvB,GAAayB;OAGlCC,OAAAA,eAAAA,EAAAA,WAAAA,mBAAAA;QAAAA,KAAAA;YAKF,OAAO7K,KAAKwJ,KAAKzB,UAAUE;;;;;0EAI7B6C,EAAAA,UAAAA,kBAAAA,SAAgBC;QACd,OACE/K,KAAKwJ,KAAK9D,UAAU,KACpB1F,KAAKwJ,KAAKtB,IAAIlI,KAAKwJ,KAAK9D,SAAS,OAAOqF;;+FAK5CC,iCAAAA;QAKE,OAAOhL,KAAKwJ,KAAKtB,IAAIlI,KAAKwJ,KAAK9D,SAAS;;sEAI1CuF,gCAAAA;QACE,OAAOjL,KAAKwJ,KAAKzB;OAGnB5H,EAAQ0G,UAAAA,UAAR1G,SAAQ0G;QACN,OACY,SAAVA,KAAqE,MAAnDsC,GAAa/B,WAAWpH,KAAKwJ,MAAM3C,EAAM2C;OAI/DzG,EAAAA,UAAAA,WAAAA;QACE,OAAO/C,KAAKwJ,KAAKzG;OAGnB4D,EAAAA,aAAAA,SAAkBuE,GAAiBC;QACjC,OAAOhC,GAAa/B,WAAW8D,EAAG1B,MAAM2B,EAAG3B;OAGxBA,EAAAA,gBAArB7C,SAAqB6C;QACnB,OAAOA,EAAK9D,SAAS,KAAM;;;;;;;;IASTqB,EAAAA,eAApBJ,SAAoBI;QAClB,OAAO,IAAI2D,EAAY,IAAIvB,GAAapC,EAASQ;;CA5ExCmD;;;;;;;;;;;;;;;;;;;ACSGU,SAAAA,GACdC,GACAC,GACAC;IAEA,KAAKA,GACH,MAAM,IAAI7B,EACRhH,GACA,YAAY2I,OAAAA,GAAiDC,sCAAAA,OAAAA,GAAAA;;;;;;;;;;GA2B7D,UAAUE,GAAqBhC;IACnC,KAAKkB,GAAYe,cAAcjC,IAC7B,MAAM,IAAIE,EACRhH,GACA,6FAAAlB,OAA6FgI,GAAAA,SAAAA,OAAYA,EAAK9D,QAAAA;;;;;;GAS9G,UAAUgG,GAAuBlC;IACrC,IAAIkB,GAAYe,cAAcjC,IAC5B,MAAM,IAAIE,EACRhH,GACA,gGAAAlB,OAAgGgI,GAAAA,SAAAA,OAAYA,EAAK9D,QAAAA;;;;;;;0EAmBjH,UAAUiG,GAAiBC;IAC/B,SAAc3E,MAAV2E,GACF,OAAO;IACF,IAAc,SAAVA,GACT,OAAO;IACF,IAAqB,mBAAVA,GAIhB,OAHIA,EAAMlG,SAAS,OACjBkG,IAAQ,UAAGA,EAAMC,UAAU,GAAG;IAEzB7J,KAAKC,UAAU2J;IACjB,IAAqB,mBAAVA,KAAuC,oBAAVA,GAC7C,OAAO,KAAKA;IACP,IAAqB,mBAAVA,GAAoB;QACpC,IAAIA,aAAiBE,OACnB,OAAO;QAEP,IAAMC;;QAeN,SAAiCH;YACrC,OAAIA,EAAM9L,cACD8L,EAAM9L,YAAYkD,OAEpB;SAJH,CAfgD4I;QAChD,OAAIG,IACK,YAAAvK,OAAYuK,GAEZ,aAAA;;IAGN,OAAqB,qBAAVH,IACT,eApGPzJ;;;AA0HE,SAAU6J,GACdhL;;AAEAlB;IAQA,IANI,eAAekB;;;IAGjBA,IAAOA,EAAYiL,cAGfjL,aAAelB,IAAc;QACjC,IAAIA,EAAYkD,SAAShC,EAAIlB,YAAYkD,MACvC,MAAM,IAAI0G,EACRhH,GACA;QAIF,IAAMwJ,IAAcP,GAAiB3K;QACrC,MAAM,IAAI0I,EACRhH,GACA,kBAAAlB,OAAkB1B,EAAYkD,MAAsBkJ,mBAAAA,OAAAA;;IAI1D,OAAOlL;;;AAGO,SAAAmL,GAAuBd,GAAsBe;IAC3D,IAAIA,KAAK,GACP,MAAM,IAAI1C,EACRhH,GACA,YAAY2I,OAAAA,GAA0De,+CAAAA,OAAAA,GAAAA;;;;;;;;;;;;;;;;;;;;;GC3JtE,UAAUC,GAAkBtK;IAChC,OAAOA,QAAAA;;;+CAIH,UAAUuK,GAAevK;;;IAG7B,OAAiB,MAAVA,KAAe,IAAIA,MAAAA,IAAAA;;;;;;;;;;;;;;;;;;;;;;GCT5B,KCIKwK,IAALC,IDGMC,KAAkC;IAExCA,mBAA4C;IAC5CA,QAAiC;IACjCA,UAAmC;IACnCA,qBAA8C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACkMxC,SAAUC,GAAsBC;IACpC,SAAA,MAAIA,GAEF,OADAlL,EAAS,aAAa,6BACfiB;;;;;;QAST,QAAQiK;MACN,KAAK;;QACH,OTjKA;;MSmKF,KAAK;;QACH,OAAOjK;;;;;cAKT,KAAK;;QACH,OAAOA;;MAET,KAAK;;QACH,OAAOA;;MAET,KAAK;;QACH,OAAOA;;MAET,KAAK;;QACH,OAAOA;;;;cAIT,KAAK;;QACH,OAAOA;;MAET,KAAK;;QACH,OAAOA;;MAET,KAAK;;QACH,OAAOA;;MAET,KAAK;;QACH,OAAOA;;;;;cAKT,KAAK;;QACH,OAAOA;;MAET,KAAK;;QACH,OAAOA;;MAET,KAAK;;QACH,OAAOA;;MAET;QACE,OAAIiK,KAAU,OAAOA,IAAS,MThN9B,OSmNIA,KAAU,OAAOA,IAAS,MACrBjK,IAELiK,KAAU,OAAOA,IAAS,MACrBjK,IAEFA;;;;;;;;;;;;;;;;;;;;;;;KAhRb8J,KAAKD,OAAAA,KAkBJ,KAjBCC,GAAAI,KAAA,KAAA,MACAJ,GAAAA,GAAAK,YAAA,KAAA;AACAL,GAAAA,GAAAM,UAAA,KAAA,WACAN,GAAAA,GAAAO,mBAAA,KAAA;AACAP,GAAAA,GAAAQ,oBAAA,KAAA,qBACAR,GAAAA,GAAAS,YAAA,KAAA;AACAT,GAAAA,GAAAU,iBAAA,KAAA,kBACAV,GAAAA,GAAAW,oBAAA,KAAA;AACAX,GAAAA,GAAAnM,kBAAA,MAAA,mBACAmM,GAAAA,GAAAY,qBAAA,KAAA;AACAZ,GAAAA,GAAAa,sBAAA,KAAA,uBACAb,GAAAA,GAAAc,UAAA,MAAA;AACAd,GAAAA,GAAAe,eAAA,MAAA,gBACAf,GAAAA,GAAAgB,gBAAA,MAAA;AACAhB,GAAAA,GAAAiB,WAAA,MAAA,YACAjB,GAAAA,GAAAkB,cAAA,MAAA,eACAlB,GAAAA,GAAAmB,YAAA,MAAA;;ACnBI,IAAAC,mBAAA,SAAAhL;;;;;IAKJ9C,SACE+N,EAAAA,GACiBC;QAFnBhO;gBAIEgD,IAAAA,EAAAA,KAAAA,MAAM+K,MAAAA,MAFWC,IAAAA;;;;;;oBAKnBC,EAAAA,UAAAA,IAAAA,SACEC,GACA1J;QAEA,MAAM,IAAIhC,MAAM;OAIhB0L,EAAAA,UAAAA,IADQC,SACRD,GACAE,GACAxK,GACAyK;;;;;;oBAEMC,IAAcpM,KAAKC,UAAUkM;;;oBAIhBnO,mCAAAA,EAAAA,cAAAA,KAAK8N,EAAUI,GAAK;wBACnCG,QAAQ;wBACR3K,SAAAA;wBACAyK,MAAMC;;;;2BAHRE,IAAiBtO;;;oBAOjB,oBAAM,IAAI0J,EACRgD,IAFI6B,IAAMrM,GAEgByK,SAC1B,gCAAgC4B,EAAIC;;;oBAIxC,OAAKF,EAASG,KAAI,EAAA,cAAA,sBACUH,EAASI;;;oBAKnC,MALIC,MAA+BD,QAC/B5C,MAAM8C,QAAQD,OAChBA,IAAgBA,EAAc,KAE1BE,IAAqC,UAAtBC,IAAAH,QAAAA,SAAAA,IAAAA,EAAehN,eAAO,MAAAmN,SAAA,IAAAA,EAAAzM;oBACrC,IAAIqH,EACRgD,GAAsB4B,EAAS3B,SAC/B,8BAAAnL,OAA8BqN,QAAAA,IAAAA,IAAgBP,EAASE;;kBAI3D,KAAA;oBAAA,OAAA,EAAA,eAAOF,EAASI;;;;;CAtDd,eAAA;IFkCJ5O,SAAAA,EAA6B+N;QAAA7N,KAAY6N,eAAZA,GAC3B7N,KAAKgG,aAAa6H,EAAa7H;QAC/B,IAAM+I,IAAQlB,EAAazH,MAAM,UAAU;QAC3CpG,KAAKgP,IAAUD,IAAQ,QAAQlB,EAAa1H,MAC5CnG,KAAKiP,IACH,cACAjP,KAAKgG,WAAWS,YAChB,gBACAzG,KAAKgG,WAAWU,WAChB;;WAfAwI,OAAAA,eAAAA,EAAAA,WAAAA,KAAAA;QAAAA,KAAAA;;;YAGF,QAAO;;;;QAeTC,EACEnB,UAAAA,IADFmB,SACEnB,GACAxE,GACA4F,GACAC,GACAC;QAEA,IAAMpB,IAAMlO,KAAKuP,EAAQvB,GAASxE;QAClC1I,EAxDY,kBAwDM,aAAaoN,GAAKkB;QAEpC,IAAM1L,IAAU;QAGhB,OAFA1D,KAAKwP,EAAwB9L,GAAS2L,GAAWC,IAE1CtP,KAAKyP,EAA6BzB,GAASE,GAAKxK,GAAS0L,GAAKzK,MAAAA,SACnE2J;YACExN,OAAAA,EA/DQ,kBA+DU,cAAcwN,IACzBA;aAERC,SAAAA;YAUC,MATA3M,EAnEQ,kBAqEN,GAAAJ,OAAGwM,4BACHO,GACA,SACAL,GACA,YACAkB;YAEIb;;OAKZmB,EAAAA,UAAAA,IAAAA,SACE1B,GACAxE,GACAmG,GACAN,GACAC,GACAM;;;QAIA,OAAO5P,KAAKmP,EACVnB,GACAxE,GACAmG,GACAN,GACAC;;;;;;IAcME,gBAAAA,SACR9L,GACA2L,GACAC;QAEA5L,EAAQ,uBAhGH,iBAAiBjD;;;;;QAsGtBiD,EAAQ,kBAAkB,cAEtB1D,KAAK6N,aAAa5H,UACpBvC,EAAQ,sBAAsB1D,KAAK6N,aAAa5H;QAG9CoJ,KACFA,EAAU3L,QAAQ+D,SAAQ,SAAC1F,GAAO8N;YAASnM,OAAAA,EAAQmM,KAAO9N;aAExDuN,KACFA,EAAc5L,QAAQ+D,SAAAA,SAAS1F,GAAO8N;YAASnM,OAAAA,EAAQmM,KAAO9N;;OAc1DwN,EAAAA,UAAAA,IAAAA,SAAQvB,GAAiBxE;QAC/B,IAAMsG,IAAarD,GAAqBuB;QAKxC,OAAO,GAAAxM,OAAGxB,KAAKgP,kBAA8BxF,GAAQsG,KAAAA,OAAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GG1JnD,UAAUC,GAAYC;;IAI1B,IAAMC;;IAEY,sBAATC,SAAyBA,KAAKD,UAAWC,KAAuBC,WACnEC,IAAQ,IAAIC,WAAWL;IAC7B,IAAIC,KAA4C,qBAA3BA,EAAOK,iBAC1BL,EAAOK,gBAAgBF;;IAGvB,KAAK,IAAI9H,IAAI,GAAGA,IAAI0H,GAAQ1H,KAC1B8H,EAAM9H,KAAKQ,KAAKyH,MAAsB,MAAhBzH,KAAK0H;IAG/B,OAAOJ;;;;;;;;;;;;;;;;;;GCdIK,KAAAA,mBAAAA;IAAAA,SAAAA;WACX9J,EAAAA,IAAAA;QAaE;;QAXA,IAAM+J,IACJ,kEAEIC,IAAc7H,KAAKyH,MAAM,MAAMG,EAAMhL,UAAUgL,EAAMhL,QAMvDkL,IAAS;;UAENA,EAAOlL,SADO,MAGnB,KADA,IAAM0K,IAAQL,GAAY,KACjBzH,IAAI,GAAGA,IAAI8H,EAAM1K,UAAU4C;;;QAG9BsI,EAAOlL,SANM,MAMmB0K,EAAM9H,KAAKqI,MAC7CC,KAAUF,EAAMG,OAAOT,EAAM9H,KAAKoI,EAAMhL;QAM9C,OAAOkL;;CA1BEH;;AA8BG,SAAAK,GAAuB9H,GAASC;IAC9C,OAAID,IAAOC,KACD,IAEND,IAAOC,IACF,IAEF;;;gDAYO8H,UAAAA,GACd/H,GACAC,GACA7B;IAEA,OAAI4B,EAAKtD,WAAWuD,EAAMvD,UAGnBsD,EAAKgI,OAAM,SAACjP,GAAOoG;QAAUf,OAAAA,EAAWrF,GAAOkH,EAAMd;;;;;;;;;;;;;;;;;;;GC5DxD,UAAU8I,GAAWjQ;IACzB,IAAIkQ,IAAQ;IACZ,KAAK,IAAMrB,KAAO7O,GACZmQ,OAAOC,UAAUC,eAAeC,KAAKtQ,GAAK6O,MAC5CqB;IAGJ,OAAOA;;;AAGO,SAAAzJ,GACdzG,GACAyH;IAEA,KAAK,IAAMoH,KAAO7O,GACZmQ,OAAOC,UAAUC,eAAeC,KAAKtQ,GAAK6O,MAC5CpH,EAAGoH,GAAK7O,EAAI6O;;;;;;;;;;;;;;;;;;;;;;;;;;;GCTL0B,KAAAA,mBAAAA;IAGXzR,SAAAA,EAAqC0R;QAAAxR,KAAYwR,eAAZA;;WAEbC,EAAAA,mBAAxB9K,SAAwB8K;QAEtB,OAAO,IAAIF,EClBNG,KDiB6BD;OAIdE,EAAAA,iBAAtBhL,SAAsBgL;;;QAGpB,IAAMH;;;;QAyCJ,SAAqCG;YAEzC,KADA,IAAIH,IAAe,IACVlJ,IAAI,GAAGA,IAAIqJ,EAAMjM,UAAU4C,GAClCkJ,KAAgBI,OAAOC,aAAaF,EAAMrJ;YAE5C,OAAOkJ;SALH,CAzC8CG;QAChD,OAAO,IAAIJ,EAAWC;OAGxBM,EAAAV,UAACW,OAAOC,YAAR;QAAA,cACM1J,IAAI;QACR,OAAO;YACLmC,MAAM;gBACAnC,OAAAA,IAAItI,EAAKwR,aAAa9L,SACjB;oBAAE3D,OAAO/B,EAAKwR,aAAaS,WAAW3J;oBAAM4J,OAAM;oBAElD;oBAAEnQ,YAAOkF;oBAAWiL,OAAM;;;;OAMzCC,EAAAA,UAAAA,WAAAA;QACE,OCtCyBC,IDsCLpS,KAAKwR,cCrCpBa,KAAKD;2EADR,IAAuBA;ODyC3BE,EAAAA,UAAAA,eAAAA;QACE,OA8BE,SAAqCd;YAEzC,KADA,IAAMe,IAAS,IAAIlC,WAAWmB,EAAa9L,SAClC4C,IAAI,GAAGA,IAAIkJ,EAAa9L,QAAQ4C,KACvCiK,EAAOjK,KAAKkJ,EAAaS,WAAW3J;YAEtC,OAAOiK;SALH,CA9BgCvS,KAAKwR;OAGzCgB,EAAAA,UAAAA,sBAAAA;QACE,OAAkC,IAA3BxS,KAAKwR,aAAa9L;OAG3B+M,EAAU5L,UAAAA,YAAV4L,SAAU5L;QACR,OAAOiK,GAAoB9Q,KAAKwR,cAAc3K,EAAM2K;OAGtDrR,EAAQ0G,UAAAA,UAAR1G,SAAQ0G;QACN,OAAO7G,KAAKwR,iBAAiB3K,EAAM2K;;;;AA9CrBD,GAAAmB,oBAAoB,IAAInB,GAAW;;AETrD,IAAMoB,KAAwB,IAAIC,OAChC;;;;;GAOI,UAAUC,GAAmBC;;;;IASjC,IAM8BvQ,IAXjBuQ,IAKO,mBAATA,GAAmB;;;;QAK5B,IAAIC,IAAQ,GACNC,IAAWL,GAAsBM,KAAKH;QAE5C,IAF4BvQ,IACfyQ,IACTA,EAAS,IAAI;;YAEf,IAAIE,IAAUF,EAAS;YACvBE,KAAWA,IAAU,aAAaC,OAAO,GAAG,IAC5CJ,IAAQK,OAAOF;;;gBAIjB,IAAMG,IAAa,IAAIC,KAAKR;QAG5B,OAAO;YAAES,SAFOzK,KAAKyH,MAAM8C,EAAWG,YAAY;YAEhCT,OAAAA;;;IAOlB,OAAO;QAAEQ,SAFOE,GAAgBX,EAAKS;QAEnBR,OADJU,GAAgBX,EAAKC;;;;;;;GASjC,UAAUU,GAAgB1R;;IAE9B,OAAqB,mBAAVA,IACFA,IACmB,mBAAVA,IACTqR,OAAOrR,KAEP;;;qEAKL,UAAU2R,GAAoBC;IAClC,OAAoB,mBAATA,IACFpC,GAAWqC,iBAAiBD,KAE5BpC,GAAWsC,eAAeF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GCjDxBG,KAAAA,mBAAAA;;;;;;;;;;;;IA8CXhU,SAAAA;;;;IAIWyT;;;;IAIAQ;QAET,IANS/T,KAAOuT,UAAPA,GAIAvT,KAAW+T,cAAXA,GAELA,IAAc,GAChB,MAAM,IAAIrK,EACRhH,GACA,yCAAyCqR;QAG7C,IAAIA,KAAe,KACjB,MAAM,IAAIrK,EACRhH,GACA,yCAAyCqR;QAG7C,IAAIR,KAvFY,aAwFd,MAAM,IAAI7J,EACRhH,GACA,qCAAqC6Q;;gBAIzC,IAAIA,KAAW,cACb,MAAM,IAAI7J,EACRhH,GACA,qCAAqC6Q;;;;;;kBAxE3C5M,QAAAA;QACE,OAAOmN,EAAUE,WAAWV,KAAKW;;;;;;;;;IAUnBnB,EAAAA,WAAhBnM,SAAgBmM;QACd,OAAOgB,EAAUE,WAAWlB,EAAKU;;;;;;;;;;IAWjBU,EAAAA,aAAlBvN,SAAkBuN;QAChB,IAAMX,IAAUzK,KAAKyH,MAAM2D,IAAe;QAE1C,OAAO,IAAIJ,EAAUP,GADPzK,KAAKyH,MA/CH,OA+CU2D,IAAyB,MAAVX;;;;;;;;;;IA4D3CY,qBAAAA;QACE,OAAO,IAAIb,KAAKtT,KAAKoU;;;;;;;;;IAUvBA,uBAAAA;QACE,OAAsB,MAAfpU,KAAKuT,UAAiBvT,KAAK+T,cAvHlB;OA0HlBM,EAAWxN,UAAAA,aAAXwN,SAAWxN;QACT,OAAI7G,KAAKuT,YAAY1M,EAAM0M,UAClBzC,GAAoB9Q,KAAK+T,aAAalN,EAAMkN,eAE9CjD,GAAoB9Q,KAAKuT,SAAS1M,EAAM0M;;;;;;;;IASjDpT,EAAAA,UAAAA,UAAAA,SAAQ0G;QACN,OACEA,EAAM0M,YAAYvT,KAAKuT,WAAW1M,EAAMkN,gBAAgB/T,KAAK+T;;iEAKjEhR,uBAAAA;QACE,OACE,uBACA/C,KAAKuT,UACL,mBACAvT,KAAK+T,cACL;;2EAKJO,qBAAAA;QACE,OAAO;YAAEf,SAASvT,KAAKuT;YAASQ,aAAa/T,KAAK+T;;;;;;;IAOpDQ,sBAAAA;;;;;;;;QAQE,IAAMC,IAAkBxU,KAAKuT,WA5Kb;;;gBAiLhB,OAFyB3B,OAAO4C,GAAiBC,SAAS,IAAI,OAEpC,MADG7C,OAAO5R,KAAK+T,aAAaU,SAAS,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GCpJhE,UAAUC,GAAkB3S;;IAEhC,OAPgC,wBAMwB,UAA3C4S,MAAgB,UAAf7F,IAAA/M,QAAAA,SAAAA,IAAAA,EAAO6S,kBAAAA,MAAQ9F,SAAA,IAAAA,EAAE+F,WAAU,IAAYC,wBAAGH,SAAAA,IAAAA,EAAAI;;;;;;;;GAsCpD,UAAUC,GAAiBjT;IAC/B,IAAMkT,IAAgBlT,EAAM6S,SAAUC,OAA0BK;IAEhE,OAAIR,GAAkBO,KACbD,GAAiBC,KAEnBA;;;;;GAMH,UAAUE,GAAkBpT;IAChC,IAAMqT,IAAiBvC,GACrB9Q,EAAM6S,SAAUC,OAA4BQ,qBAAEC;IAEhD,OAAO,IAAIxB,GAAUsB,EAAe7B,SAAS6B,EAAerC;;;;;;;;;;;;;;;;;;GC7D9D,KACawC,KACD;IACRV,QAAQ;QACNC,UAAY;YAAEC,aAJG;;;;;gEAcjB,UAAUS,GAAUzT;IACxB,OAAI,eAAeA,IACU,8BAClB,kBAAkBA,IACG,iCACrB,kBAAkBA,KAAS,iBAAiBA,IACxB,gCACpB,oBAAoBA,IACG,mCACvB,iBAAiBA,IACG,gCACpB,gBAAgBA,IACE,8BAClB,oBAAoBA,IACH,6BACjB,mBAAmBA,IACG,kCACtB,gBAAgBA,IACG,+BACnB,cAAcA,IACnB2S,GAAkB3S,KACkB;;IA6hBtC,SAAqBA;QACzB,OAjkBqB,iBAkkBhBA,EAAM6S,YAAY,IAAIC,UAAU,IAAcC,YAAK,IAAIC;KAFxD,CA5hBoBhT,KACM,4CAEC,iCAtDXI;;;4EA6DN,UAAAsT,GAAYzM,GAAaC;IACvC,IAAID,MAASC,GACX,QAAO;IAGT,IAAMyM,IAAWF,GAAUxM;IAE3B,IAAI0M,MADcF,GAAUvM,IAE1B,QAAO;IAGT,QAAQyM;MACN,KAAA;MA0BA,KAAA;QACE,QAAO;;MAzBT,KAAA;QACE,OAAO1M,EAAK2M,iBAAiB1M,EAAM0M;;MACrC,KAAA;QACE,OAAOR,GAAkBnM,GAAM7I,QAAQgV,GAAkBlM;;MAC3D,KAAA;QACE,OA0BN,SAAyBD,GAAaC;YACpC,IACiC,mBAAxBD,EAAKsM,kBACoB,mBAAzBrM,EAAMqM,kBACbtM,EAAKsM,eAAe5P,WAAWuD,EAAMqM,eAAe5P;;YAGpD,OAAOsD,EAAKsM,mBAAmBrM,EAAMqM;YAGvC,IAAMM,IAAgB/C,GAAmB7J,EAAKsM,iBACxCO,IAAiBhD,GAAmB5J,EAAMqM;YAChD,OACEM,EAAcrC,YAAYsC,EAAetC,WACzCqC,EAAc7C,UAAU8C,EAAe9C;SAd3C,CA1B6B/J,GAAMC;;MAC/B,KAAA;QACE,OAAOD,EAAK+L,gBAAgB9L,EAAM8L;;MACpC,KAAA;QACE,OAiDN,SAAoB/L,GAAaC;YAC/B,OAAOyK,GAAoB1K,EAAK8M,YAAa3V,QAC3CuT,GAAoBzK,EAAM6M;SAF9B,CAjDwB9M,GAAMC;;MAC1B,KAAA;QACE,OAAOD,EAAK+M,mBAAmB9M,EAAM8M;;MACvC,KAAA;QACE,OAoCN,SAAwB/M,GAAaC;YACnC,OACEwK,GAAgBzK,EAAKgN,cAAeC,cAClCxC,GAAgBxK,EAAM+M,cAAeC,aACvCxC,GAAgBzK,EAAKgN,cAAeE,eAClCzC,GAAgBxK,EAAM+M,cAAeE;SAL3C,CApC4BlN,GAAMC;;MAC9B,KAAA;QACE,OAiDU,SAAaD,GAAaC;YACxC,IAAI,kBAAkBD,KAAQ,kBAAkBC,GAC9C,OACEwK,GAAgBzK,EAAKmN,kBAAkB1C,GAAgBxK,EAAMkN;YAE1D,IAAI,iBAAiBnN,KAAQ,iBAAiBC,GAAO;gBAC1D,IAAMmN,IAAK3C,GAAgBzK,EAAKqN,cAC1BC,IAAK7C,GAAgBxK,EAAMoN;gBAEjC,OAAID,MAAOE,IACFhK,GAAe8J,OAAQ9J,GAAegK,KAEtCC,MAAMH,MAAOG,MAAMD;;YAI9B,QAAO;SAhBO,CAjDUtN,GAAMC;;MAC5B,KAAA;QACE,OAAO8H,GACL/H,EAAKwN,WAAYC,UAAU,IAC3BxN,EAAMuN,WAAYC,UAAU,IAC5BhB;;MAEJ,KAAA;QACE,OA4DN,SAAsBzM,GAAaC;YACjC,IAAMyN,IAAU1N,EAAK4L,SAAUC,UAAU,IACnC8B,IAAW1N,EAAM2L,SAAUC,UAAU;YAE3C,IAAI5D,GAAWyF,OAAazF,GAAW0F,IACrC,QAAO;YAGT,KAAK,IAAM9G,KAAO6G,GAChB,IAAIA,EAAQrF,eAAexB,YAAAA,MAEvB8G,EAAS9G,OACR4F,GAAYiB,EAAQ7G,IAAM8G,EAAS9G,MAEpC,QAAO;YAIb,QAAO;SAlBT,CA5D0B7G,GAAMC;;MAG5B;QACE,OAtGgB9G;;;;AAoLN,SAAAyU,GACdC,GACAC;IAEA,YAAA,OACGD,EAASJ,UAAU,IAAIM,MAAKC,SAAAA;QAAKvB,OAAAA,GAAYuB,GAAGF;;;;AAIrC,SAAAG,GAAajO,GAAaC;IACxC,IAAID,MAASC,GACX,OAAO;IAGT,IAAMyM,IAAWF,GAAUxM,IACrBkO,IAAY1B,GAAUvM;IAE5B,IAAIyM,MAAawB,GACf,OAAOpG,GAAoB4E,GAAUwB;IAGvC,QAAQxB;MACN,KAAyB;MACzB,KAAA;QACE,OAAO;;MACT,KAAA;QACE,OAAO5E,GAAoB9H,EAAK2M,cAAe1M,EAAM0M;;MACvD,KAAA;QACE,OAyBN,SAAwB3M,GAAaC;YACnC,IAAMkO,IAAa1D,GAAgBzK,EAAKmN,gBAAgBnN,EAAKqN,cACvDe,IAAc3D,GAAgBxK,EAAMkN,gBAAgBlN,EAAMoN;YAEhE,OAAIc,IAAaC,KACP,IACCD,IAAaC,IACf,IACED,MAAeC,IACjB;;YAGHb,MAAMY,KACDZ,MAAMa,KAAe,KAAK,IAE1B;SAfb,CAzB4BpO,GAAMC;;MAC9B,KAAA;QACE,OAAOoO,GAAkBrO,EAAKsM,gBAAiBrM,EAAMqM;;MACvD,KAAA;QACE,OAAO+B,GACLlC,GAAkBnM,IAClBmM,GAAkBlM;;MAEtB,KAAA;QACE,OAAO6H,GAAoB9H,EAAK+L,aAAc9L,EAAM8L;;MACtD,KAAA;QACE,OAkFN,SACE/L,GACAC;YAEA,IAAMqO,IAAY5D,GAAoB1K,IAChCuO,IAAa7D,GAAoBzK;YACvC,OAAOqO,EAAU7E,UAAU8E;SAN7B,CAlF0BvO,EAAK8M,YAAa7M,EAAM6M;;MAC9C,KAAA;QACE,OAsDN,SAA2B0B,GAAkBC;YAG3C,KAFA,IAAMC,IAAeF,EAAS7N,MAAM,MAC9BgO,IAAgBF,EAAU9N,MAAM,MAC7BrB,IAAI,GAAGA,IAAIoP,EAAahS,UAAU4C,IAAIqP,EAAcjS,QAAQ4C,KAAK;gBACxE,IAAMsP,IAAa9G,GAAoB4G,EAAapP,IAAIqP,EAAcrP;gBACtE,IAAmB,MAAfsP,GACF,OAAOA;;YAGX,OAAO9G,GAAoB4G,EAAahS,QAAQiS,EAAcjS;SAThE,CAtD+BsD,EAAK+M,gBAAiB9M,EAAM8M;;MACvD,KAAA;QACE,OAgEN,SAA0B/M,GAAcC;YACtC,IAAM2O,IAAa9G,GACjB2C,GAAgBzK,EAAKiN,WACrBxC,GAAgBxK,EAAMgN;YAExB,OAAmB,MAAf2B,IACKA,IAEF9G,GACL2C,GAAgBzK,EAAKkN,YACrBzC,GAAgBxK,EAAMiN;SAV1B,CAhE8BlN,EAAKgN,eAAgB/M,EAAM+M;;MACrD,KAAA;QACE,OAqFN,SAAuBhN,GAAkBC;YAIvC,KAHA,IAAM4O,IAAY7O,EAAKyN,UAAU,IAC3BqB,IAAa7O,EAAMwN,UAAU,IAE1BnO,IAAI,GAAGA,IAAIuP,EAAUnS,UAAU4C,IAAIwP,EAAWpS,UAAU4C,GAAG;gBAClE,IAAMyP,IAAUd,GAAaY,EAAUvP,IAAIwP,EAAWxP;gBACtD,IAAIyP,GACF,OAAOA;;YAGX,OAAOjH,GAAoB+G,EAAUnS,QAAQoS,EAAWpS;SAV1D,CArF2BsD,EAAKwN,YAAavN,EAAMuN;;MAC/C,KAAA;QACE,OAgGN,SAAqBxN,GAAgBC;YACnC,IAAID,MAASuM,MAAsBtM,MAAUsM,IAC3C,OAAO;YACF,IAAIvM,MAASuM,IAClB,OAAO;YACF,IAAItM,MAAUsM,IACnB,QAAQ;YAGV,IAAMmB,IAAU1N,EAAK6L,UAAU,IACzBmD,IAAW7G,OAAO8G,KAAKvB,IACvBC,IAAW1N,EAAM4L,UAAU,IAC3BqD,IAAY/G,OAAO8G,KAAKtB;;;;;wBAM9BqB,EAASG,QACTD,EAAUC;YAEV,KAAK,IAAI7P,IAAI,GAAGA,IAAI0P,EAAStS,UAAU4C,IAAI4P,EAAUxS,UAAU4C,GAAG;gBAChE,IAAM8P,IAAatH,GAAoBkH,EAAS1P,IAAI4P,EAAU5P;gBAC9D,IAAmB,MAAf8P,GACF,OAAOA;gBAET,IAAML,IAAUd,GAAaP,EAAQsB,EAAS1P,KAAKqO,EAASuB,EAAU5P;gBACtE,IAAgB,MAAZyP,GACF,OAAOA;;YAIX,OAAOjH,GAAoBkH,EAAStS,QAAQwS,EAAUxS;SAhCxD,CAhGyBsD,EAAK4L,UAAW3L,EAAM2L;;MAC3C;QACE,MArOgBzS;;;;AA6PtB,SAASkV,GAAkBrO,GAAiBC;IAC1C,IACkB,mBAATD,KACU,mBAAVC,KACPD,EAAKtD,WAAWuD,EAAMvD,QAEtB,OAAOoL,GAAoB9H,GAAMC;IAGnC,IAAM2M,IAAgB/C,GAAmB7J,IACnC6M,IAAiBhD,GAAmB5J,IAEpC2O,IAAa9G,GACjB8E,EAAcrC,SACdsC,EAAetC;IAEjB,OAAmB,MAAfqE,IACKA,IAEF9G,GAAoB8E,EAAc7C,OAAO8C,EAAe9C;;;AAqOjD,SAAAsF,GAASrS,GAAwB6J;IAC/C,OAAO;QACLkG,gBAAgB,YAAY/P,OAAAA,EAAWS,iCACrCT,EAAWU,UAAAA,eAAAA,OACCmJ,EAAIrG,KAAKJ;;;;gDAwBrB,UAAUwF,GACd7M;IAEA,SAASA,KAAS,gBAAgBA;;;8CAW9B,UAAUuW,GACdvW;IAEA,SAASA,KAAS,eAAeA;;;sCAI7B,UAAUwW,GACdxW;IAEA,SAASA,KAAS,iBAAiBA,KAASwU,MAAMnD,OAAOrR,EAAMsU;;;6CAI3D,UAAUmC,GACdzW;IAEA,SAASA,KAAS,cAAcA;;;uCAI5B,UAAU0W,GAAUC;IACxB,IAAIA,EAAO1C,eACT,OAAO;QAAEA,eAAoB7E,OAAAwH,OAAA,IAAAD,EAAO1C;;IAC/B,IACL0C,EAAOpD,kBAC0B,mBAA1BoD,EAAOpD,gBAEd,OAAO;QAAEA,gBAAqBnE,OAAAwH,OAAA,IAAAD,EAAOpD;;IAChC,IAAIoD,EAAO9D,UAAU;QAC1B,IAAMgE,IAAgB;YAAEhE,UAAU;gBAAEC,QAAQ;;;QAK5C,OAJApN,GACEiR,EAAO9D,SAASC,SAAAA,SACfhF,GAAKgJ;YAASD,OAAAA,EAAOhE,SAAUC,OAAQhF,KAAO4I,GAAUI;aAEpDD;;IACF,IAAIF,EAAOlC,YAAY;QAE5B,KADA,IAAMoC,IAAgB;YAAEpC,YAAY;gBAAEC,QAAQ;;WACrCnO,IAAI,GAAGA,KAAKoQ,EAAOlC,WAAWC,UAAU,IAAI/Q,UAAU4C,GAC7DsQ,EAAOpC,WAAYC,OAAQnO,KAAKmQ,GAAUC,EAAOlC,WAAWC,OAAQnO;QAEtE,OAAOsQ;;IAEP,OAAAzH,OAAAwH,OAAA,IAAYD;;;AC/jBHI,IAAAA,KACXhZ,SAAqBiZ,GAAiCC;IAAjChZ,KAAQ+Y,WAARA,GAAiC/Y,KAASgZ,YAATA;;;AAqExC,SAAAC,GAAYjQ,GAAoBC;IAC9C,IAAa,SAATD,GACF,OAAiB,SAAVC;IACF,IAAc,SAAVA,GACT,QAAO;IAGT,IACED,EAAKgQ,cAAc/P,EAAM+P,aACzBhQ,EAAK+P,SAASrT,WAAWuD,EAAM8P,SAASrT,QAExC,QAAO;IAET,KAAK,IAAI4C,IAAI,GAAGA,IAAIU,EAAK+P,SAASrT,QAAQ4C,KAGxC,KAAKmN,GAFgBzM,EAAK+P,SAASzQ,IACbW,EAAM8P,SAASzQ,KAEnC,QAAO;IAGX,QAAO;;;;;;;;;;;;;;;;;;GC7Ea4Q,KAAAA,KAAAA,eAUhBC,mBAAA,SAAAvW;IACJ9C,SAAAA,EACkBsZ,GACAC,GACAtX;QAHlBjC;gBAKEgD,IAAAA,gBAJgB9C,MAAKoZ,QAALA,GACApZ,EAAEqZ,KAAFA,GACArZ,EAAK+B,QAALA;;;;kBAJamX,EAAAA,GAAAA,IAY/BvS,WAAAA,SACEyS,GACAC,GACAtX;QAEA,OAAIqX,EAAMhP,eACF,2BAAFiP,KAAsBA,mCAAAA,IACjBrZ,KAAKsZ,uBAAuBF,GAAOC,GAAItX,KAUvC,IAAIwX,GAAeH,GAAOC,GAAItX,KAE9BsX,mDAAAA,IACF,IAAIG,GAAoBJ,GAAOrX,KAC7BsX,2BAAAA,IAKF,IAAII,GAASL,GAAOrX,KAClBsX,mCAAAA,IAKF,IAAIK,GAAYN,GAAOrX,KACrBsX,2DAAAA,IAKF,IAAIM,GAAuBP,GAAOrX,KAElC,IAAI6X,EAAYR,GAAOC,GAAItX;OAI9B4E,EAAAA,yBAAAA,SACNyS,GACAC,GACAtX;QAaA,OAAyB,2BAAlBsX,IACH,IAAIQ,GAAiBT,GAAOrX,KAC5B,IAAI+X,GAAoBV,GAAOrX;OAGrCgY,EAAQC,UAAAA,UAARD,SAAQC;QACN,IAAMnT,IAAQmT,EAAIC,KAAKb,MAAMpZ,KAAKoZ;;gBAElC,OAAW,kCAAPpZ,KAAKqZ,KAEK,SAAVxS,KACA7G,KAAKka,kBAAkBjD,GAAapQ,GAAQ7G,KAAK+B,UAMzC,SAAV8E,KACA2O,GAAUxV,KAAK+B,WAAWyT,GAAU3O,MACpC7G,KAAKka,kBAAkBjD,GAAapQ,GAAO7G,KAAK+B;;WAI1CmY,EAAkBtC,UAAAA,oBAAlBsC,SAAkBtC;QAC1B,QAAQ5X,KAAKqZ;UACX,KAAA;YACE,OAAOzB,IAAa;;UACtB,KAAA;YACE,OAAOA,KAAc;;UACvB,KAAA;YACE,OAAsB,MAAfA;;UACT,KAAA;YACE,OAAsB,MAAfA;;UACT,KAAA;YACE,OAAOA,IAAa;;UACtB,KAAA;YACE,OAAOA,KAAc;;UACvB;YACE,OA/IuCzV;;OAmJ7CgY,EAAAA,UAAAA,eAAAA;QACE,OACE,EAAA,+BAAA,yCAAA,kCAAA,4CAAA,gCAAA,iCAOE1Q,QAAQzJ,KAAKqZ,OAAO;OAI1Be,EAAAA,UAAAA,sBAAAA;QACE,OAAO,EAACpa;OAGVqa,EAAAA,UAAAA,aAAAA;QACE,OAAO,EAACra;OAGVsa,EAAAA,UAAAA,0BAAAA;QACE,OAAIta,KAAKma,iBACAna,KAAKoZ,QAEP;;CA3IL,CAA2BF,KA+I3BqB,mBAAA,SAAA3X;IAGJ9C,SACkB0a,EAAAA,GACAnB;QAFlBvZ;gBAIEgD,IAAAA,gBAHgB9C,MAAOwa,UAAPA,GACAxa,EAAEqZ,KAAFA,GAJlBrZ,EAAAya,IAAyD;;;;kBADtBvB,EAAAA,GAAAA,IAanCvS,EAAAA,SAAAA,SAAc6T,GAAmBnB;QAC/B,OAAO,IAAIqB,EAAgBF,GAASnB;OAGtCU,EAAQC,UAAAA,UAARD,SAAQC;QACN,OAsDuB,sCAtDUha,KAsDZqZ,UAAAA,MApDZrZ,KAAKwa,QAAQzD,MAAKnN,SAAAA;YAAAA,QAAWA,EAAOmQ,QAAQC;yBAG5Cha,KAAKwa,QAAQzD,MAAKnN,SAAAA;YAAUA,OAAAA,EAAOmQ,QAAQC;;OAItDI,EAAAA,UAAAA,sBAAAA;QACE,OAAsC,SAAlCpa,KAAKya,MAITza,KAAKya,IAA2Bza,KAAKwa,QAAQG,iBAAQC,GAAQC;YACpDD,OAAAA,EAAOpZ,OAAOqZ,EAAUT;YAC9B,MALMpa,KAAKya;;;IAWhBJ,EAAAA,UAAAA,aAAAA;QACE,OAAOlJ,OAAOwH,OAAO,IAAI3Y,KAAKwa;OAGhCF,EAAAA,UAAAA,0BAAAA;QACE,IAAMQ,IAAQ9a,KAAK+a,YAAwBnR;YAAUA,OAAAA,EAAOuQ;;QAE5D,OAAc,SAAVW,IACKA,EAAM1B,QAER;;;;;IAMD2B,EACNC,UAAAA,IADMD,SACNC;QAEA,KAA0Bhb,IAAAA,IAAAA,GAAAA,IAAAA,KAAKoa,uBAALpa,cAAAA;YAArB,IAAMib,IAAejb,EAAAA;YACxB,IAAIgb,EAAUC,IACZ,OAAOA;;QAIX,OAAO;;CAjEL,CAA+B/B;;AA2IrB,SAAAgC,GAAaC,GAAYC;IACvC,OAAID,aAAcvB,KASJ,SAAkBuB,GAAiBC;QACjD,OACEA,aAAcxB,MACduB,EAAG9B,OAAO+B,EAAG/B,MACb8B,EAAG/B,MAAMjZ,QAAQib,EAAGhC,UACpB3D,GAAY0F,EAAGpZ,OAAOqZ,EAAGrZ;KALb,CARaoZ,GAAIC,KACpBD,aAAcT,KAgBX,SACdS,GACAC;QAEA,OACEA,aAAcV,MACdS,EAAG9B,OAAO+B,EAAG/B,MACb8B,EAAGX,QAAQ9U,WAAW0V,EAAGZ,QAAQ9U,UAEAyV,EAAGX,QAAQG,QAC1C,SAACC,GAAiBS,GAAkBlT;YAClCyS,OAAAA,KAAUM,GAAaG,GAAUD,EAAGZ,QAAQrS;aAC9C;KAZU,CAfiBgT,GAAIC,UAEjCjZ;;;AA6EE,IAAAmZ,mBAAA,SAAA1Y;IAGJ9C,SAAAA,EAAYsZ,GAAkBC,GAActX;QAA5CjC;gBACEgD,IAAAA,EAAAA,KAAAA,MAAMsW,GAAOC,GAAItX,YAKZ8N,MAAMnF,GAAY6Q,SAASxZ,EAAMgU;;;WATN6D,EAAAA,GAAAA,IAYlCG,EAAQC,UAAAA,UAARD,SAAQC;QACN,IAAMpC,IAAalN,GAAYtD,WAAW4S,EAAInK,KAAK7P,KAAK6P;QACxD,OAAO7P,KAAKka,kBAAkBtC;;CAd5B,CAA8BgC,KAmB9B4B,mBAAA,SAAA5Y;IAGJ9C,SAAYsZ,EAAAA,GAAkBrX;QAA9BjC;gBACEgD,IAAAA,EAAAA,KAAAA,MAAMsW,GAAoB,yBAAArX,MAC1B/B,MAAKiY,OAAOwD,GAA+C,yBAAA1Z;;;WALzB6X,EAAAA,GAAAA,IAQpCG,EAAQC,UAAAA,UAARD,SAAQC;QACN,OAAOha,KAAKiY,KAAKyD,MAAAA,SAAK7L;YAAOA,OAAAA,EAAI1P,QAAQ6Z,EAAInK;;;CAT3C,CAAgC+J,KAchC+B,mBAAA,SAAA/Y;IAGJ9C,SAAYsZ,EAAAA,GAAkBrX;QAA9BjC;gBACEgD,IAAAA,EAAAA,KAAAA,MAAMsW,GAAwB,iCAAArX,MAC9B/B,MAAKiY,OAAOwD,GAAmD,iCAAA1Z;;;WAL1B6X,EAAAA,GAAAA,IAQvCG,EAAQC,UAAAA,UAARD,SAAQC;QACN,QAAQha,KAAKiY,KAAKyD,MAAAA,SAAK7L;YAAOA,OAAAA,EAAI1P,QAAQ6Z,EAAInK;;;CAT5C,CAAmC+J;;yDAazC,UAAS6B,GACPpC,GACAtX;;IAMA,SAA0B,UAAlB+M,IAAA/M,EAAMyU,oBAAAA,MAAY1H,SAAA,IAAAA,EAAA2H,WAAU,IAAIrV,KAAAA,SAAI4V;QAMnCtM,OAAAA,GAAY6Q,SAASvE,EAAEjB;;;;4DAK5B,KAAA6F,mBAAA,SAAAhZ;IACJ9C,SAAYsZ,EAAAA,GAAkBrX;QAC5Be,OAAAA,EAAAA,KAAAA,MAAMsW,GAAgC,iDAAArX,MAAAA;;WAFD6X,EAAAA,GAAAA,IAKvCG,EAAQC,UAAAA,UAARD,SAAQC;QACN,IAAMnT,IAAQmT,EAAIC,KAAKb,MAAMpZ,KAAKoZ;QAClC,OAAOxK,GAAQ/H,MAAU+P,GAAmB/P,EAAM2P,YAAYxW,KAAK+B;;CAPjE,CAAmC6X,KAYnCiC,mBAAA,SAAAjZ;IACJ9C,SAAYsZ,EAAAA,GAAkBrX;QAC5Be,OAAAA,EAAAA,KAAAA,MAAMsW,GAAoB,yBAAArX,MAAAA;;WAFA6X,EAAAA,GAAAA,IAM5BG,EAAQC,UAAAA,UAARD,SAAQC;QACN,IAAMnT,IAAQmT,EAAIC,KAAKb,MAAMpZ,KAAKoZ;QAClC,OAAiB,SAAVvS,KAAkB+P,GAAmB5W,KAAK+B,MAAMyU,YAAa3P;;CARlE,CAAwB+S,KAaxBkC,mBAAA,SAAAlZ;IACJ9C,SAAYsZ,EAAAA,GAAkBrX;QAC5Be,OAAAA,EAAAA,KAAAA,MAAMsW,GAAwB,iCAAArX,MAAAA;;WAFD6X,EAAAA,GAAAA,IAM/BG,EAAQC,UAAAA,UAARD,SAAQC;QACN,IACEpD,GAAmB5W,KAAK+B,MAAMyU,YAAa;YAAEuF,WAAW;YAExD,QAAO;QAET,IAAMlV,IAAQmT,EAAIC,KAAKb,MAAMpZ,KAAKoZ;QAClC,OAAiB,SAAVvS,MAAmB+P,GAAmB5W,KAAK+B,MAAMyU,YAAa3P;;CAbnE,CAA2B+S,KAkB3BoC,mBAAA,SAAApZ;IACJ9C,SAAYsZ,EAAAA,GAAkBrX;QAC5Be,OAAAA,EAAAA,KAAAA,MAAMsW,GAAoC,yDAAArX,MAAAA;;WAFF6X,EAAAA,GAAAA,IAM1CG,EAAQC,UAAAA,UAARD,SAAQC;QAARD,cACQlT,IAAQmT,EAAIC,KAAKb,MAAMpZ,KAAKoZ;QAClC,UAAKxK,GAAQ/H,OAAWA,EAAM2P,WAAWC,WAGlC5P,EAAM2P,WAAWC,OAAOiF,eAAK7C;YAClCjC,OAAAA,GAAmB5W,EAAK+B,MAAMyU,YAAaqC;;;CAZ3C,CAAsCe,KCzf/BqC,KACXnc,SACWsZ,GACA8C;SAAAA,MAAAA,MAAAA,IAAoC,QADpClc,KAAKoZ,QAALA,GACApZ,KAAGkc,MAAHA;;;gDAaG,UAAAC,GAAcnT,GAAeC;IAC3C,OAAOD,EAAKkT,QAAQjT,EAAMiT,OAAOlT,EAAKoQ,MAAMjZ,QAAQ8I,EAAMmQ;;;;;;;;;;;;;;;;;;;;;;GCxB/CgD,KAAAA,mBAAAA;IAaXtc,SAAAA,EAA4Buc;QAAArc,KAASqc,YAATA;;WAZPta,EAAAA,gBAArB4E,SAAqB5E;QACnB,OAAO,IAAIqa,EAAgBra;OAG7B4E,EAAAA,MAAAA;QACE,OAAO,IAAIyV,EAAgB,IAAItI,GAAU,GAAG;OAG9CnN,EAAAA,MAAAA;QACE,OAAO,IAAIyV,EAAgB,IAAItI,GAAU,cAAc;OAKzDrB,EAAU5L,UAAAA,YAAV4L,SAAU5L;QACR,OAAO7G,KAAKqc,UAAUhI,WAAWxN,EAAMwV;OAGzClc,EAAQ0G,UAAAA,UAAR1G,SAAQ0G;QACN,OAAO7G,KAAKqc,UAAUlc,QAAQ0G,EAAMwV;;iFAItCC,6BAAAA;;QAEE,OAAgC,MAAzBtc,KAAKqc,UAAU9I,UAAgBvT,KAAKqc,UAAUtI,cAAc;OAGrEhR,EAAAA,UAAAA,WAAAA;QACE,OAAO,qBAAqB/C,KAAKqc,UAAUtZ,aAAa;OAG1DwZ,EAAAA,UAAAA,cAAAA;QACE,OAAOvc,KAAKqc;;CAlCHD,ICmBAI,mBAAAA;IAIX1c,SACSsH,EAAAA,GACPqV;QADOzc,KAAUoH,aAAVA,GAGPpH,KAAKyc,OAAOA,KAAcC,GAASC;;;eAIrCC,EAAAA,UAAAA,SAAAA,SAAO/M,GAAQ9N;QACb,OAAO,IAAIya,EACTxc,KAAKoH,YACLpH,KAAKyc,KACFG,OAAO/M,GAAK9N,GAAO/B,KAAKoH,YACxByV,KAAK,MAAM,MAAMH,GAASI,OAAO,MAAM;;;IAK9CC,EAAOlN,UAAAA,SAAPkN,SAAOlN;QACL,OAAO,IAAI2M,EACTxc,KAAKoH,YACLpH,KAAKyc,KACFM,OAAOlN,GAAK7P,KAAKoH,YACjByV,KAAK,MAAM,MAAMH,GAASI,OAAO,MAAM;;;IAK9C5U,EAAI2H,UAAAA,MAAJ3H,SAAI2H;QAEF,KADA,IAAImN,IAAOhd,KAAKyc,OACRO,EAAK5U,aAAW;YACtB,IAAM6U,IAAMjd,KAAKoH,WAAWyI,GAAKmN,EAAKnN;YACtC,IAAY,MAARoN,GACF,OAAOD,EAAKjb;YACHkb,IAAM,IACfD,IAAOA,EAAKhU,OACHiU,IAAM,MACfD,IAAOA,EAAK/T;;QAGhB,OAAO;;;;IAKTQ,EAAQoG,UAAAA,UAARpG,SAAQoG;QAIN;;QAFA,IAAIqN,IAAc,GACdF,IAAOhd,KAAKyc,OACRO,EAAK5U,aAAW;YACtB,IAAM6U,IAAMjd,KAAKoH,WAAWyI,GAAKmN,EAAKnN;YACtC,IAAY,MAARoN,GACF,OAAOC,IAAcF,EAAKhU,KAAKlB;YACtBmV,IAAM,IACfD,IAAOA,EAAKhU;;YAGZkU,KAAeF,EAAKhU,KAAKlB,OAAO,GAChCkV,IAAOA,EAAK/T;;;gBAIhB,QAAQ;OAGVb,EAAAA,UAAAA,UAAAA;QACE,OAAOpI,KAAKyc,KAAKrU;OAIfN,OAAAA,eAAAA,EAAAA,WAAAA,QAAAA;;QAAAA,KAAAA;YACF,OAAO9H,KAAKyc,KAAK3U;;;;;;IAInBqV,EAAAA,UAAAA,SAAAA;QACE,OAAOnd,KAAKyc,KAAKU;;;IAInBC,EAAAA,UAAAA,SAAAA;QACE,OAAOpd,KAAKyc,KAAKW;;;;;;IAOnBC,EAAoBC,UAAAA,mBAApBD,SAAoBC;QAClB,OAAQtd,KAAKyc,KAAwBY,iBAAiBC;OAGxD7V,EAAQgB,UAAAA,UAARhB,SAAQgB;QACNzI,KAAKqd,2BAAkBE,GAAGvG;YACxBvO,OAAAA,EAAG8U,GAAGvG,KACC;;OAIXjU,EAAAA,UAAAA,WAAAA;QACE,IAAMya,IAAyB;QAK/B,OAJAxd,KAAKqd,2BAAkBE,GAAGvG;YACxBwG,OAAAA,EAAa7V,KAAK,UAAG4V,GAAKvG,KAAAA,OAAAA,MAAAA;aAGrB,IAAAxV,OAAIgc,EAAanU,KAAK;;;;;;;IAQ/BoU,EAAoBH,UAAAA,mBAApBG,SAAoBH;QAClB,OAAQtd,KAAKyc,KAAwBgB,iBAAiBH;;;IAIxDI,EAAAA,UAAAA,cAAAA;QACE,OAAO,IAAIC,GAAwB3d,KAAKyc,MAAM,MAAMzc,KAAKoH,aAAY;OAGvEwW,EAAgB/N,UAAAA,kBAAhB+N,SAAgB/N;QACd,OAAO,IAAI8N,GAAwB3d,KAAKyc,MAAM5M,GAAK7P,KAAKoH,aAAY;OAGtEyW,EAAAA,UAAAA,qBAAAA;QACE,OAAO,IAAIF,GAAwB3d,KAAKyc,MAAM,MAAMzc,KAAKoH,aAAY;OAGvE0W,EAAuBjO,UAAAA,yBAAvBiO,SAAuBjO;QACrB,OAAO,IAAI8N,GAAwB3d,KAAKyc,MAAM5M,GAAK7P,KAAKoH,aAAY;;KAK3DuW,mBAAAA;IAIX7d,SAAAA,EACEkd,GACAe,GACA3W,GACA4W;QAEAhe,KAAKge,YAAYA,GACjBhe,KAAKie,YAAY;QAGjB,KADA,IAAIhB,IAAM,IACFD,EAAK5U,aAOX,IANA6U,IAAMc,IAAW3W,EAAW4V,EAAKnN,KAAKkO,KAAY;;QAE9CA,KAAYC,MACdf,MAAQ,IAGNA,IAAM;;QAGND,IADEhd,KAAKge,YACAhB,EAAKhU,OAELgU,EAAK/T,YAET;YAAA,IAAY,MAARgU,GAAW;;;gBAGpBjd,KAAKie,UAAUtW,KAAKqV;gBACpB;;;;wBAIAhd,KAAKie,UAAUtW,KAAKqV,IAElBA,IADEhd,KAAKge,YACAhB,EAAK/T,QAEL+T,EAAKhU;;;WAMpBkV,EAAAA,UAAAA,UAAAA;QAME,IAAIlB,IAAOhd,KAAKie,UAAUE,OACpBvD,IAAS;YAAE/K,KAAKmN,EAAKnN;YAAK9N,OAAOib,EAAKjb;;QAE5C,IAAI/B,KAAKge,WAEP,KADAhB,IAAOA,EAAKhU,OACJgU,EAAK5U,aACXpI,KAAKie,UAAUtW,KAAKqV,IACpBA,IAAOA,EAAK/T,YAId,KADA+T,IAAOA,EAAK/T,QACJ+T,EAAK5U,aACXpI,KAAKie,UAAUtW,KAAKqV;QACpBA,IAAOA,EAAKhU;QAIhB,OAAO4R;OAGTwD,EAAAA,UAAAA,UAAAA;QACE,OAAOpe,KAAKie,UAAUvY,SAAS;OAGjC2Y,EAAAA,UAAAA,OAAAA;QACE,IAA8B,MAA1Bre,KAAKie,UAAUvY,QACjB,OAAO;QAGT,IAAMsX,IAAOhd,KAAKie,UAAUje,KAAKie,UAAUvY,SAAS;QACpD,OAAO;YAAEmK,KAAKmN,EAAKnN;YAAK9N,OAAOib,EAAKjb;;;KAK3B2a,mBAAAA;IAaX5c,SACS+P,EAAAA,GACA9N,GACPuc,GACAtV,GACAC;QAJOjJ,KAAG6P,MAAHA,GACA7P,KAAK+B,QAALA,GAKP/B,KAAKse,QAAiB,QAATA,IAAgBA,IAAQ5B,EAAS6B,KAC9Cve,KAAKgJ,OAAe,QAARA,IAAeA,IAAO0T,EAASC;QAC3C3c,KAAKiJ,QAAiB,QAATA,IAAgBA,IAAQyT,EAASC,OAC9C3c,KAAK8H,OAAO9H,KAAKgJ,KAAKlB,OAAO,IAAI9H,KAAKiJ,MAAMnB;;;eAI9C+U,EACEhN,UAAAA,OADFgN,SACEhN,GACA9N,GACAuc,GACAtV,GACAC;QAEA,OAAO,IAAIyT,EACF,QAAP7M,IAAcA,IAAM7P,KAAK6P,KAChB,QAAT9N,IAAgBA,IAAQ/B,KAAK+B,OACpB,QAATuc,IAAgBA,IAAQte,KAAKse,OACrB,QAARtV,IAAeA,IAAOhJ,KAAKgJ,MAClB,QAATC,IAAgBA,IAAQjJ,KAAKiJ;OAIjCb,EAAAA,UAAAA,UAAAA;QACE,QAAO;;;;;;IAOTiV,EAAoBC,UAAAA,mBAApBD,SAAoBC;QAClB,OACGtd,KAAKgJ,KAAwBqU,iBAAiBC,MAC/CA,EAAOtd,KAAK6P,KAAK7P,KAAK+B,UACrB/B,KAAKiJ,MAAyBoU,iBAAiBC;;;;;;IAQpDG,EAAoBH,UAAAA,mBAApBG,SAAoBH;QAClB,OACGtd,KAAKiJ,MAAyBwU,iBAAiBH,MAChDA,EAAOtd,KAAK6P,KAAK7P,KAAK+B,UACrB/B,KAAKgJ,KAAwByU,iBAAiBH;;;IAK3CvU,EAAAA,UAAAA,MAAAA;QACN,OAAI/I,KAAKgJ,KAAKZ,YACLpI,OAECA,KAAKgJ,KAAwBD;;;IAKzCoU,EAAAA,UAAAA,SAAAA;QACE,OAAOnd,KAAK+I,MAAM8G;;;IAIpBuN,EAAAA,UAAAA,SAAAA;QACE,OAAIpd,KAAKiJ,MAAMb,YACNpI,KAAK6P,MAEL7P,KAAKiJ,MAAMmU;;;IAKtBR,EAAAA,UAAAA,SAAAA,SAAO/M,GAAQ9N,GAAUqF;QACvB,IAAIgF,IAAoBpM,MAClBid,IAAM7V,EAAWyI,GAAKzD,EAAEyD;QAc9B,QAZEzD,IADE6Q,IAAM,IACJ7Q,EAAEyQ,KAAK,MAAM,MAAM,MAAMzQ,EAAEpD,KAAK4T,OAAO/M,GAAK9N,GAAOqF,IAAa,QACnD,MAAR6V,IACL7Q,EAAEyQ,KAAK,MAAM9a,GAAO,MAAM,MAAM,QAEhCqK,EAAEyQ,KACJ,MACA,MACA,MACA,MACAzQ,EAAEnD,MAAM2T,OAAO/M,GAAK9N,GAAOqF,KAGtBoX;OAGHC,EAAAA,UAAAA,YAAAA;QACN,IAAIze,KAAKgJ,KAAKZ,WACZ,OAAOsU,EAASC;QAElB,IAAIvQ,IAAoBpM;QAKxB,OAJKoM,EAAEpD,KAAK0V,WAAYtS,EAAEpD,KAAKA,KAAK0V,YAClCtS,IAAIA,EAAEuS,iBAERvS,IAAIA,EAAEyQ,KAAK,MAAM,MAAM,MAAOzQ,EAAEpD,KAAwByV,aAAa,OAC5DD;;;IAIXzB,EAAAA,UAAAA,SAAAA,SACElN,GACAzI;QAEA,IAAIwX,GACAxS,IAAoBpM;QACxB,IAAIoH,EAAWyI,GAAKzD,EAAEyD,OAAO,GACtBzD,EAAEpD,KAAKZ,aAAcgE,EAAEpD,KAAK0V,WAAYtS,EAAEpD,KAAKA,KAAK0V,YACvDtS,IAAIA,EAAEuS;QAERvS,IAAIA,EAAEyQ,KAAK,MAAM,MAAM,MAAMzQ,EAAEpD,KAAK+T,OAAOlN,GAAKzI,IAAa,YACxD;YAOL,IANIgF,EAAEpD,KAAK0V,YACTtS,IAAIA,EAAEyS,gBAEHzS,EAAEnD,MAAMb,aAAcgE,EAAEnD,MAAMyV,WAAYtS,EAAEnD,MAAMD,KAAK0V,YAC1DtS,IAAIA,EAAE0S;YAEuB,MAA3B1X,EAAWyI,GAAKzD,EAAEyD,MAAY;gBAChC,IAAIzD,EAAEnD,MAAMb,WACV,OAAOsU,EAASC;gBAEhBiC,IAAYxS,EAAEnD,MAAyBF,OACvCqD,IAAIA,EAAEyQ,KACJ+B,EAAS/O,KACT+O,EAAS7c,OACT,MACA,MACCqK,EAAEnD,MAAyBwV;;YAIlCrS,IAAIA,EAAEyQ,KAAK,MAAM,MAAM,MAAM,MAAMzQ,EAAEnD,MAAM8T,OAAOlN,GAAKzI;;QAEzD,OAAOgF,EAAEoS;OAGXE,EAAAA,UAAAA,QAAAA;QACE,OAAO1e,KAAKse;;;IAINE,EAAAA,UAAAA,QAAAA;QACN,IAAIpS,IAAoBpM;QAUxB,OATIoM,EAAEnD,MAAMyV,YAAYtS,EAAEpD,KAAK0V,YAC7BtS,IAAIA,EAAE2S,eAEJ3S,EAAEpD,KAAK0V,WAAWtS,EAAEpD,KAAKA,KAAK0V,YAChCtS,IAAIA,EAAEyS;QAEJzS,EAAEpD,KAAK0V,WAAWtS,EAAEnD,MAAMyV,YAC5BtS,IAAIA,EAAE4S,cAED5S;OAGDuS,EAAAA,UAAAA,cAAAA;QACN,IAAIvS,IAAIpM,KAAKgf;QAYb,OAXI5S,EAAEnD,MAAMD,KAAK0V,YASftS,KADAA,KAPAA,IAAIA,EAAEyQ,KACJ,MACA,MACA,MACA,MACCzQ,EAAEnD,MAAyB4V,gBAExBE,cACAC;QAED5S;OAGD0S,EAAAA,UAAAA,eAAAA;QACN,IAAI1S,IAAIpM,KAAKgf;QAKb,OAJI5S,EAAEpD,KAAKA,KAAK0V,YAEdtS,KADAA,IAAIA,EAAEyS,eACAG,cAED5S;OAGD2S,EAAAA,UAAAA,aAAAA;QACN,IAAME,IAAKjf,KAAK6c,KAAK,MAAM,MAAMH,EAAS6B,KAAK,MAAMve,KAAKiJ,MAAMD;QAChE,OAAQhJ,KAAKiJ,MAAyB4T,KACpC,MACA,MACA7c,KAAKse,OACLW,GACA;OAIIJ,EAAAA,UAAAA,cAAAA;QACN,IAAMK,IAAKlf,KAAK6c,KAAK,MAAM,MAAMH,EAAS6B,KAAKve,KAAKgJ,KAAKC,OAAO;QAChE,OAAQjJ,KAAKgJ,KAAwB6T,KAAK,MAAM,MAAM7c,KAAKse,OAAO,MAAMY;OAGlEF,EAAAA,UAAAA,YAAAA;QACN,IAAMhW,IAAOhJ,KAAKgJ,KAAK6T,KAAK,MAAM,OAAO7c,KAAKgJ,KAAKsV,OAAO,MAAM,OAC1DrV,IAAQjJ,KAAKiJ,MAAM4T,KAAK,MAAM,OAAO7c,KAAKiJ,MAAMqV,OAAO,MAAM;QACnE,OAAOte,KAAK6c,KAAK,MAAM,OAAO7c,KAAKse,OAAOtV,GAAMC;;;IAIlDkW,EAAAA,UAAAA,gBAAAA;QACE,IAAMC,IAAapf,KAAKqf;QACxB,OAAIvW,KAAKwW,IAAI,GAAKF,MAAepf,KAAK8H,OAAO;;;;IASrCuX,EAAAA,UAAAA,QAAAA;QACR,IAAIrf,KAAK0e,WAAW1e,KAAKgJ,KAAK0V,SAC5B,MAvegBvc;QAyelB,IAAInC,KAAKiJ,MAAMyV,SACb,MA1egBvc;QA4elB,IAAMid,IAAcpf,KAAKgJ,KAAwBqW;QACjD,IAAID,MAAgBpf,KAAKiJ,MAAyBoW,SAChD,MA9egBld;QAgfhB,OAAOid,KAAcpf,KAAK0e,UAAU,IAAI;;;;;;;;;;;;;;;;;;;;;;;;;AArPhC/B,GAAAA,QAA4B,MAEjCD,GAAG6B,OAAG,GACN7B,GAAKI,SAAG;;AAiUjBJ,GAASC,QAAQ,mBAAA;IAzEjB7c,SAAAA;QAgBEE,KAAI8H,OAAG;;WAfH+H,OAAAA,eAAAA,EAAAA,WAAAA,OAAAA;QAAAA,KAAAA;YACF,MAxfkB1N;;;;QA0fhBJ,OAAAA,eAAAA,EAAAA,WAAAA,SAAAA;QAAAA,KAAAA;YACF,MA3fkBI;;;;QA6fhBmc,OAAAA,eAAAA,EAAAA,WAAAA,SAAAA;QAAAA,KAAAA;YACF,MA9fkBnc;;;;QAggBhB6G,OAAAA,eAAAA,EAAAA,WAAAA,QAAAA;QAAAA,KAAAA;YACF,MAjgBkB7G;;;;QAmgBhB8G,OAAAA,eAAAA,EAAAA,WAAAA,SAAAA;QAAAA,KAAAA;YACF,MApgBkB9G;;;;;;IAygBpB0a,EACEhN,UAAAA,OADFgN,SACEhN,GACA9N,GACAuc,GACAtV,GACAC;QAEA,OAAOjJ;;;IAIT4c,EAAAA,UAAAA,SAAAA,SAAO/M,GAAQ9N,GAAUqF;QACvB,OAAO,IAAIsV,GAAe7M,GAAK9N;;;IAIjCgb,EAAAA,UAAAA,SAAAA,SAAOlN,GAAQzI;QACb,OAAOpH;OAGToI,EAAAA,UAAAA,UAAAA;QACE,QAAO;OAGTiV,EAAiBC,UAAAA,mBAAjBD,SAAiBC;QACf,QAAO;OAGTG,EAAiBH,UAAAA,mBAAjBG,SAAiBH;QACf,QAAO;OAGTH,EAAAA,UAAAA,SAAAA;QACE,OAAO;OAGTC,EAAAA,UAAAA,SAAAA;QACE,OAAO;OAGTsB,EAAAA,UAAAA,QAAAA;QACE,QAAO;;;IAITS,EAAAA,UAAAA,gBAAAA;QACE,QAAO;OAGCE,EAAAA,UAAAA,QAAAA;QACR,OAAO;;CAIM;;;;;;;;;;;;;;;;;;;;;;;;;AC/jBJE,IAAAA,mBAAAA;IAGXzf,SAAAA,EAAoBsH;QAAApH,KAAUoH,aAAVA,GAClBpH,KAAKia,OAAO,IAAIuC,GAAsBxc,KAAKoH;;WAG7CoY,EAAIC,UAAAA,MAAJD,SAAIC;QACF,OAA+B,SAAxBzf,KAAKia,KAAK/R,IAAIuX;OAGvBC,EAAAA,UAAAA,QAAAA;QACE,OAAO1f,KAAKia,KAAKkD;OAGnBwC,EAAAA,UAAAA,OAAAA;QACE,OAAO3f,KAAKia,KAAKmD;OAGftV,OAAAA,eAAAA,EAAAA,WAAAA,QAAAA;QAAAA,KAAAA;YACF,OAAO9H,KAAKia,KAAKnS;;;;QAGnB2B,EAAQgW,UAAAA,UAARhW,SAAQgW;QACN,OAAOzf,KAAKia,KAAKxQ,QAAQgW;;8DAI3BhY,EAAAA,UAAAA,UAAAA,SAAQmY;QACN5f,KAAKia,KAAKoD,kBAAiB,SAACE,GAAMvG;YAAAA,OAChC4I,EAAGrC,KACI;;;+EAKXsC,EAAAA,UAAAA,iBAAAA,SAAeC,GAAeF;QAE5B,KADA,IAAMG,IAAO/f,KAAKia,KAAK2D,gBAAgBkC,EAAM,KACtCC,EAAK3B,aAAW;YACrB,IAAMqB,IAAOM,EAAK7B;YAClB,IAAIle,KAAKoH,WAAWqY,EAAK5P,KAAKiQ,EAAM,OAAO,GACzC;YAEFF,EAAGH,EAAK5P;;;;;;IAOZmQ,EAAAA,UAAAA,eAAAA,SAAaJ,GAA0B5b;QACrC,IAAI+b;QAMJ,KAJEA,SAAAA,MADE/b,IACKhE,KAAKia,KAAK2D,gBAAgB5Z,KAE1BhE,KAAKia,KAAKyD,eAEZqC,EAAK3B,aAGV,KADewB,EADFG,EAAK7B,UACKrO,MAErB;;oEAMNoQ,EAAAA,UAAAA,oBAAAA,SAAkBR;QAChB,IAAMM,IAAO/f,KAAKia,KAAK2D,gBAAgB6B;QACvC,OAAOM,EAAK3B,YAAY2B,EAAK7B,UAAUrO,MAAM;OAG/C6N,EAAAA,UAAAA,cAAAA;QACE,OAAO,IAAIwC,GAAqBlgB,KAAKia,KAAKyD;OAG5CE,EAAgB/N,UAAAA,kBAAhB+N,SAAgB/N;QACd,OAAO,IAAIqQ,GAAqBlgB,KAAKia,KAAK2D,gBAAgB/N;;yCAI5DsQ,EAAAA,UAAAA,MAAAA,SAAIV;QACF,OAAOzf,KAAK6c,KAAK7c,KAAKia,KAAK8C,OAAO0C,GAAM7C,OAAO6C,IAAM;;8BAIvDW,EAAAA,UAAAA,SAAAA,SAAOX;QACL,OAAKzf,KAAKwf,IAAIC,KAGPzf,KAAK6c,KAAK7c,KAAKia,KAAK8C,OAAO0C,MAFzBzf;OAKXoI,EAAAA,UAAAA,UAAAA;QACE,OAAOpI,KAAKia,KAAK7R;OAGnBiY,EAAUxZ,UAAAA,YAAVwZ,SAAUxZ;QACR,IAAI+T,IAAuB5a;;gBAW3B,OARI4a,EAAO9S,OAAOjB,EAAMiB,SACtB8S,IAAS/T,GACTA,IAAQ7G,OAGV6G,EAAMY,SAAQgY,SAAAA;YACZ7E,IAASA,EAAOuF,IAAIV;aAEf7E;OAGTza,EAAQ0G,UAAAA,UAAR1G,SAAQ0G;QACN,MAAMA,aAAiB0Y,IACrB,QAAO;QAET,IAAIvf,KAAK8H,SAASjB,EAAMiB,MACtB,QAAO;QAKT,KAFA,IAAMwY,IAAStgB,KAAKia,KAAKyD,eACnB6C,IAAU1Z,EAAMoT,KAAKyD,eACpB4C,EAAOlC,aAAW;YACvB,IAAMoC,IAAWF,EAAOpC,UAAUrO,KAC5B4Q,IAAYF,EAAQrC,UAAUrO;YACpC,IAA6C,MAAzC7P,KAAKoH,WAAWoZ,GAAUC,IAC5B,QAAO;;QAGX,QAAO;OAGT9X,EAAAA,UAAAA,UAAAA;QACE,IAAM+X,IAAW;QAIjB,OAHA1gB,KAAKyH,SAAQkZ,SAAAA;YACXD,EAAI/Y,KAAKgZ;aAEJD;OAGT3d,EAAAA,UAAAA,WAAAA;QACE,IAAM6X,IAAc;QAEpB,OADA5a,KAAKyH,SAAQgY,SAAAA;YAAQ7E,OAAAA,EAAOjT,KAAK8X;aAC1B,eAAe7E,EAAO7X,aAAa;OAGpC8Z,EAAK5C,UAAAA,OAAL4C,SAAK5C;QACX,IAAMW,IAAS,IAAI2E,EAAUvf,KAAKoH;QAElC,OADAwT,EAAOX,OAAOA,GACPW;;KAIEsF,mBAAAA;IACXpgB,SAAAA,EAAoBigB;QAAA/f,KAAI+f,OAAJA;;WAEpB7B,EAAAA,UAAAA,UAAAA;QACE,OAAOle,KAAK+f,KAAK7B,UAAUrO;OAG7BuO,EAAAA,UAAAA,UAAAA;QACE,OAAOpe,KAAK+f,KAAK3B;;KC1JRwC,mBAAAA;IACX9gB,SAAAA,EAAqB+U;QAAA7U,KAAM6U,SAANA;;;QAGnBA,EAAOsD,KAAKpO,GAAU3C;;WAQxBT,EAAAA,QAAAA;QACE,OAAO,IAAIia,EAAU;;;;;;IAOvBP,EAAAA,UAAAA,YAAAA,SAAUQ;QAER,KADA,IAAIC,IAAgB,IAAIvB,GAAqBxV,GAAU3C,aAC/BpH,IAAAA,GAAAA,IAAAA,KAAK6U,QAAL7U,IACtB8gB,EAAAA,QADsB9gB,KACtB8gB;YADG,IAAMC,IAAa/gB,EAAAA;YACtB8gB,IAAgBA,EAAcX,IAAIY;;QAEpC,KAAwBF,WAAAA,IAAAA,GAAAA,IAAAA,EAAAA,QAAAA,KACtBC;YADG,IAAMC,IAAAA,EAAAA;YACTD,IAAgBA,EAAcX,IAAIY;;QAEpC,OAAO,IAAIH,EAAUE,EAAcnY;;;;;;;;IASrCqY,EAAAA,UAAAA,SAAAA,SAAOD;QACL,KAA4B/gB,IAAAA,IAAAA,GAAAA,IAAAA,KAAK6U,QAAL7U,IAAK6U,EAAAA,QAAL7U,KAAK6U;YAC/B,SAAkBxM,WAAW0Y,IAC3B,QAAO;;QAGX,QAAO;OAGT5gB,EAAQ0G,UAAAA,UAAR1G,SAAQ0G;QACN,OAAOkK,GAAY/Q,KAAK6U,QAAQhO,EAAMgO,kBAASoM,GAAGC;YAAMD,OAAAA,EAAE9gB,QAAQ+gB;;;CA/CzDN,ICGAO,mBAAAA;IACXrhB,SAAAA,EAAqBiC;QAAA/B,KAAK+B,QAALA;;WAOrB4E,EAAAA,QAAAA;QACE,OAAO,IAAIwa,EAAY;YAAEvM,UAAU;;;;;;;;;IASrCwE,EAAAA,UAAAA,QAAAA,SAAM5P;QACJ,IAAIA,EAAKpB,WACP,OAAOpI,KAAK+B;QAGZ,KADA,IAAIqf,IAA2BphB,KAAK+B,OAC3BuG,IAAI,GAAGA,IAAIkB,EAAK9D,SAAS,KAAK4C,GAErC,KAAKkQ,GADL4I,KAAgBA,EAAaxM,SAAUC,UAAU,IAAIrL,EAAKtB,IAAII,MAE5D,OAAO;QAIX,QADA8Y,KAAgBA,EAAaxM,SAAUC,UAAW,IAAIrL,EAAKvB,mBACpC;;;;;;;;IAU3BrE,EAAAA,UAAAA,MAAAA,SAAI4F,GAAiBzH;QAKD/B,KAAKqhB,aAAa7X,EAAKzB,WAC/ByB,EAAKvB,iBAAiBwQ,GAAU1W;;;;;;;IAQ5Cuf,EAAAA,UAAAA,SAAAA,SAAOrH;QAAPqH,cACMC,IAASxX,GAAUa,aAEnB4W,IAAyC,IACzCC,IAAoB;QAExBxH,EAAKxS,SAAAA,SAAS1F,GAAOyH;YACnB,KAAK+X,EAAOhZ,oBAAoBiB,IAAO;;gBAErC,IAAMkY,IAAY1hB,EAAKqhB,aAAaE;gBACpCvhB,EAAK2hB,aAAaD,GAAWF,GAASC,IACtCD,IAAU,IACVC,IAAU,IACVF,IAAS/X,EAAKzB;;YAGZhG,IACFyf,EAAQhY,EAAKvB,iBAAiBwQ,GAAU1W,KAExC0f,EAAQ9Z,KAAK6B,EAAKvB;;QAItB,IAAMyZ,IAAY1hB,KAAKqhB,aAAaE;QACpCvhB,KAAK2hB,aAAaD,GAAWF,GAASC;;;;;;;;IASxCrB,EAAAA,UAAAA,SAAAA,SAAO5W;QAKL,IAAMoY,IAAc5hB,KAAKoZ,MAAM5P,EAAKzB;QAChCyQ,GAAWoJ,MAAgBA,EAAYhN,SAASC,iBAC3C+M,EAAYhN,SAASC,OAAOrL,EAAKvB;OAI5C9H,EAAQ0G,UAAAA,UAAR1G,SAAQ0G;QACN,OAAO4O,GAAYzV,KAAK+B,OAAO8E,EAAM9E;;;;;;IAO/Bsf,EAAAA,UAAAA,eAAAA,SAAa7X;QACnB,IAAIa,IAAUrK,KAAK+B;QAEdsI,EAAQuK,SAAUC,WACrBxK,EAAQuK,WAAW;YAAEC,QAAQ;;QAG/B,KAAK,IAAIvM,IAAI,GAAGA,IAAIkB,EAAK9D,UAAU4C,GAAG;YACpC,IAAImC,IAAOJ,EAAQuK,SAAUC,OAAQrL,EAAKtB,IAAII;YACzCkQ,GAAW/N,MAAUA,EAAKmK,SAASC,WACtCpK,IAAO;gBAAEmK,UAAU;oBAAEC,QAAQ;;eAC7BxK,EAAQuK,SAAUC,OAAQrL,EAAKtB,IAAII,MAAMmC,IAE3CJ,IAAUI;;QAGZ,OAAOJ,EAAQuK,SAAUC;;;;;;IAOnB8M,2BAAAA,SACND,GACAG,GACAJ;QAEAha,GAAQoa,IAAS,SAAChS,GAAKgJ;YAAS6I,OAAAA,EAAU7R,KAAOgJ;;QACjD,KAAoB4I,WAAAA,IAAAA,GAAAA,IAAAA,EAAAA,QAAAA,KAAAA;YAAf,IAAMrI,IAASqI,EAAAA;mBACXC,EAAUtI;;OAIrB0I,EAAAA,UAAAA,QAAAA;QACE,OAAO,IAAIX,EACT1I,GAAUzY,KAAK+B;;CA9IRof,ICkIAY,mBAAAA;IACXjiB,SAAAA,EACW+P,GACDmS,GACDC,GACAC,GACAC,GACAlI,GACCmI;QANCpiB,KAAG6P,MAAHA,GACD7P,KAAYgiB,eAAZA,GACDhiB,KAAOiiB,UAAPA,GACAjiB,KAAQkiB,WAARA,GACAliB,KAAUmiB,aAAVA;QACAniB,KAAIia,OAAJA,GACCja,KAAaoiB,gBAAbA;;;;;;WAOgBC,EAAAA,qBAA1B1b,SAA0B0b;QACxB,OAAO,IAAIN,EACTM,GAAW;sBAEGjG,GAAgBrT;uBACfqT,GAAgBrT;yBACdqT,GAAgBrT,OACjCoY,GAAYmB,SAAO;;;;;;IAUrBD,EAAAA,mBADF1b,SACE0b,GACAJ,GACAE,GACApgB;QAEA,OAAO,IAAIggB,EACTM,GAAW;sBAEGJ;uBACC7F,GAAgBrT;yBACdoZ,GACjBpgB,GAAAA;;mFAMJ4E,EAAAA,gBAAAA,SACE0b,GACAJ;QAEA,OAAO,IAAIF,EACTM,GAAW;sBAEGJ;uBACC7F,GAAgBrT;yBACdqT,GAAgBrT,OACjCoY,GAAYmB,SAAO;;;;;;;IAUvB3b,EAAAA,qBAAAA,SACE0b,GACAJ;QAEA,OAAO,IAAIF,EACTM,GAAW;sBAEGJ;uBACC7F,GAAgBrT;yBACdqT,GAAgBrT,OACjCoY,GAAYmB,SAAO;;;;;;IASvBC,EAAAA,UAAAA,yBAAAA,SACEN,GACAlgB;;;;;;QAkBA,QAVE/B,KAAKmiB,WAAWhiB,QAAQic,GAAgBrT,UACO,qCAA9C/I,KAAKgiB,gBACsC,iCAA1ChiB,KAAKgiB,iBAEPhiB,KAAKmiB,aAAaF;QAEpBjiB,KAAKiiB,UAAUA,GACfjiB,KAAKgiB,eAAY,sCACjBhiB,KAAKia,OAAOlY;QACZ/B,KAAKoiB,gBAAa,+BACXpiB;;;;;;IAOTwiB,EAAAA,UAAAA,sBAAAA,SAAoBP;QAKlB,OAJAjiB,KAAKiiB,UAAUA,GACfjiB,KAAKgiB,eAAY;QACjBhiB,KAAKia,OAAOkH,GAAYmB,SACxBtiB,KAAKoiB,gBAAa,+BACXpiB;;;;;;;IAQTyiB,EAAAA,UAAAA,2BAAAA,SAAyBR;QAKvB,OAJAjiB,KAAKiiB,UAAUA,GACfjiB,KAAKgiB,eAAY;QACjBhiB,KAAKia,OAAOkH,GAAYmB,SACxBtiB,KAAKoiB,gBAAa;QACXpiB;OAGT0iB,EAAAA,UAAAA,2BAAAA;QAME,OADA1iB,KAAKoiB,gBAAa,gDACXpiB;OAGT2iB,EAAAA,UAAAA,uBAAAA;QAGE,OAFA3iB,KAAKoiB,gBAAa,4CAClBpiB,KAAKiiB,UAAU7F,GAAgBrT;QACxB/I;OAGT4iB,EAAYV,UAAAA,cAAZU,SAAYV;QAEV,OADAliB,KAAKkiB,WAAWA,GACTliB;OAGL6iB,OAAAA,eAAAA,EAAAA,WAAAA,qBAAAA;QAAAA,KAAAA;YACF,OAAyB,8CAAlB7iB,KAAKoiB;;;;QAGVU,OAAAA,eAAAA,EAAAA,WAAAA,yBAAAA;QAAAA,KAAAA;YACF,OAAyB,kDAAlB9iB,KAAKoiB;;;;QAGVW,OAAAA,eAAAA,EAAAA,WAAAA,oBAAAA;QAAAA,KAAAA;YACF,OAAO/iB,KAAK6iB,qBAAqB7iB,KAAK8iB;;;;QAGxCE,EAAAA,UAAAA,kBAAAA;QACE,OAAwB,iCAAjBhjB,KAAKgiB;OAGdiB,EAAAA,UAAAA,kBAAAA;QACE,OAAwB,wCAAjBjjB,KAAKgiB;OAGdkB,EAAAA,UAAAA,eAAAA;QACE,OAAwB,qCAAjBljB,KAAKgiB;OAGdmB,EAAAA,UAAAA,oBAAAA;QACE,OAAwB,0CAAjBnjB,KAAKgiB;OAGd7hB,EAAQ0G,UAAAA,UAAR1G,SAAQ0G;QACN,OACEA,aAAiBkb,KACjB/hB,KAAK6P,IAAI1P,QAAQ0G,EAAMgJ,QACvB7P,KAAKiiB,QAAQ9hB,QAAQ0G,EAAMob,YAC3BjiB,KAAKgiB,iBAAiBnb,EAAMmb,gBAC5BhiB,KAAKoiB,kBAAkBvb,EAAMub,iBAC7BpiB,KAAKia,KAAK9Z,QAAQ0G,EAAMoT;OAI5BmJ,EAAAA,UAAAA,cAAAA;QACE,OAAO,IAAIrB,EACT/hB,KAAK6P,KACL7P,KAAKgiB,cACLhiB,KAAKiiB,SACLjiB,KAAKkiB,UACLliB,KAAKmiB,YACLniB,KAAKia,KAAK6H,SACV9hB,KAAKoiB;OAITrf,EAAAA,UAAAA,WAAAA;QACE,OACE,YAAY/C,OAAAA,KAAK6P,kBAAQ7P,KAAKiiB,sBAAYjgB,KAAKC,UAC7CjC,KAAKia,KAAKlY,QAEI/B,mBAAAA,OAAAA,KAAKmiB,YACHniB,uBAAAA,OAAAA,KAAKgiB,cACJhiB,wBAAAA,OAAAA,KAAKoiB;;CAtNjBL,IC7FAsB,KAEXvjB,SACW0J,GACAqB,GACAyY,GACA9I,GACAhT,GACA+b,GACAC;SALA3Y,MAAAA,MAAAA,IAAiC,YACjCyY,MAAAA,MAAAA,IAAqB,UACrB9I,MAAAA,MAAAA,IAAoB;SACpBhT,MAAAA,MAAAA,IAAuB,YACvB+b,MAAAA,MAAAA,IAAwB,YACxBC,MAAAA,MAAAA,IAAsB;IANtBxjB,KAAIwJ,OAAJA,GACAxJ,KAAe6K,kBAAfA,GACA7K,KAAOsjB,UAAPA,GACAtjB,KAAOwa,UAAPA,GACAxa,KAAKwH,QAALA;IACAxH,KAAOujB,UAAPA,GACAvjB,KAAKwjB,QAALA,GARXxjB,KAAAyjB,IAAqC;;;;;;;;;;;AAoBjC,SAAUC,GACdla,GACAqB,GACAyY,GACA9I,GACAhT,GACA+b,GACAC;IAEA,YAPA3Y,MAAAA,MAAAA,IAAiC,YACjCyY,MAAAA,MAAAA,IAAqB,UACrB9I,MAAAA,MAAAA,IAAoB;SACpBhT,MAAAA,MAAAA,IAAuB,YACvB+b,MAAAA,MAAAA,IAAwB,YACxBC,MAAAA,MAAAA,IAAsB;IAEf,IAAIH,GACT7Z,GACAqB,GACAyY,GACA9I,GACAhT,GACA+b,GACAC;;;;;;;;;;;;;;;;;;;;;;;;;GC5CSG,KAAAA;;;;;AAUX7jB,SACW0J,GACAqB,GACA+Y,GACApJ,GACAhT,GACAqc,0BACAN,GACAC;SANA3Y,MAAAA,MAAAA,IACA+Y,YAAAA,MAAAA,MAAAA,IACApJ,UAAAA,MAAAA,MAAAA,IACAhT;SAAAA,MAAAA,MAAAA,IACAqc,YAAAA,MAAAA,MAAAA,IACAN,WAAAA,MAAAA,MAAAA;SACAC,MAAAA,MAAAA,IAAsB,OAPtBxjB,KAAIwJ,OAAJA,GACAxJ,KAAe6K,kBAAfA,GACA7K,KAAe4jB,kBAAfA;IACA5jB,KAAOwa,UAAPA,GACAxa,KAAKwH,QAALA,GACAxH,KAAS6jB,YAATA,GACA7jB,KAAOujB,UAAPA,GACAvjB,KAAKwjB,QAALA;IAjBXxjB,KAAA8jB,IAAoC;;IAGpC9jB,KAAA+jB,IAAgC,MAgB1B/jB,KAAKujB,SAMLvjB,KAAKwjB;;;2EAkFP,UAAUQ,GAAqBC;IACnC,OAAOA,EAAML,gBAAgBle,SAAS,IAClCue,EAAML,gBAAgB,GAAGxK,QACzB;;;AAGA,SAAU8K,GAAyBD;IACvC,KAAqBA,IAAAA,IAAAA,GAAAA,IAAAA,EAAMzJ,SAANyJ,IAAAA,EAAAA,QAAAA,KAAe;QAA/B,IACGrJ,IADaqJ,EAAAA,GACG3J;QACtB,IAAe,SAAXM,GACF,OAAOA;;IAIX,OAAO;;;;;;;;;;GA2BH,UAAUuJ,GAAuBF;IACrC,OAAiC,SAA1BA,EAAMpZ;;;;;;;GAQT,UAAUuZ,GAAaH;IAC3B,IAAMI,IAAY5hB,EAAUwhB;IAC5B,IAAkC,SAA9BI,EAAUP,GAA0B;QACtCO,EAAUP,IAAkB;QAE5B,IAAMQ,IAAkBJ,GAAyBG,IAC3CE,IAAoBP,GAAqBK;QAC/C,IAAwB,SAApBC,KAAkD,SAAtBC;;;;QAIzBD,EAAgBla,gBACnBia,EAAUP,EAAgBnc,KAAK,IAAIsU,GAAQqI,KAE7CD,EAAUP,EAAgBnc,KACxB,IAAIsU,GAAQlS,GAAUya,YAAU,wCAE7B;YAQL,KADA,IAAIC,KAAmB,GACDJ,IAAAA,GAAAA,IAAAA,EAAUT,iBAAVS,IACpBA,EAAAA,QADoBA,KACpBA;gBADG,IAAMf,IAAWe,EAAAA;gBACpBA,EAAUP,EAAgBnc,KAAK2b,IAC3BA,EAAQlK,MAAMhP,iBAChBqa,KAAmB;;YAGvB,KAAKA,GAAkB;;;gBAGrB,IAAMC,IACJL,EAAUT,gBAAgBle,SAAS,IAC/B2e,EAAUT,gBAAgBS,EAAUT,gBAAgBle,SAAS,GAC1DwW,MAAAA;gBAETmI,EAAUP,EAAgBnc,KACxB,IAAIsU,GAAQlS,GAAUya,YAAYE;;;;IAK1C,OAAOL,EAAUP;;;;;GAMb,UAAUa,GAAcV;IAC5B,IAAMI,IAAY5hB,EAAUwhB;IAC5B,KAAKI,EAAUN,GACb,IAAuB,8BAAnBM,EAAUR,WACZQ,EAAUN,IAAiBL,GACzBW,EAAU7a,MACV6a,EAAUxZ,iBACVuZ,GAAaC,IACbA,EAAU7J,SACV6J,EAAU7c,OACV6c,EAAUd,SACVc,EAAUb,aAEP;QAGL;;QADA,IAAMoB,IAAW,IACKR,IAAAA,GAAAA,IAAAA,GAAaC,IAAbD,IAAAA,EAAAA,QAAAA,KAAyB;YAA1C,IAAMd,IAAWc,EAAAA,IACdlI,IACgC,sCAApCoH,EAAQpH,MACL,kCAAA;YAEL0I,EAASjd,KAAK,IAAIsU,GAAQqH,EAAQlK,OAAO8C;;;gBAI3C,IAAMqH,IAAUc,EAAUb,QACtB,IAAI1K,GAAMuL,EAAUb,MAAMzK,UAAUsL,EAAUb,MAAMxK,aACpD,MACEwK,IAAQa,EAAUd,UACpB,IAAIzK,GAAMuL,EAAUd,QAAQxK,UAAUsL,EAAUd,QAAQvK,aACxD;;gBAGJqL,EAAUN,IAAiBL,GACzBW,EAAU7a,MACV6a,EAAUxZ,iBACV+Z,GACAP,EAAU7J,SACV6J,EAAU7c,OACV+b,GACAC;;IAIN,OAAOa,EAAUN;;;AAGH,SAAAc,GAAqBZ,GAAcra;IACtBA,EAAO0Q,2BACL4J,GAAyBD;IActD,IAAMa,IAAab,EAAMzJ,QAAQhZ,OAAO,EAACoI;IACzC,OAAO,IAAI+Z,GACTM,EAAMza,MACNya,EAAMpZ,iBACNoZ,EAAML,gBAAgBrc,SACtBud,GACAb,EAAMzc,OACNyc,EAAMJ,WACNI,EAAMV,SACNU,EAAMT;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACrSM,SAAAuB,GAASC,GAAwBjjB;IAC/C,OxBZI,SAAwBA;QAC5B,OACmB,mBAAVA,KACPqR,OAAO6R,UAAUljB,OAChBuK,GAAevK,MAChBA,KAASqR,OAAO8R,oBAChBnjB,KAASqR,OAAO+R;KANd,CwBYiBpjB;;;;IAVjB,SAAoBA;QACxB,OAAO;YAAEoU,cAAc,KAAKpU;;KADxB,CAUoCA,KA1B1B,SAASijB,GAAwBjjB;QAC/C,IAAIijB,EAAWI,GAAe;YAC5B,IAAI7O,MAAMxU,IACR,OAAO;gBAAEsU,aAAa;;YACjB,IAAItU,MAAUsjB,IAAAA,GACnB,OAAO;gBAAEhP,aAAa;;YACjB,IAAItU,OAAAA,IAAAA,GACT,OAAO;gBAAEsU,aAAa;;;QAG1B,OAAO;YAAEA,aAAa/J,GAAevK,KAAS,OAAOA;;KAVvC,CA0B4CijB,GAAYjjB;;;;;;;;;;;;;;;;;;;yDC3B3DujB,KAAAA,KAAbxlB;;;IAGUE,KAACulB,SAAGte;GA4GRue,mBAAA,SAAA5iB;IAAA,SAAA4iB;;;IAAwCF,OAAAA,EAAAA,GAAAA,IAAAA;CAAxC,CAAwCA,KAGxCG,mBAAA,SAAA7iB;IACJ9C,SAAAA,EAAqB4lB;QAArB5lB;gBACEgD,IAAAA,gBADmB9C,MAAQ0lB,WAARA;;WAD2BJ,EAAAA,GAAAA;CAA5C,CAA4CA,KAoB5CK,mBAAA,SAAA/iB;IACJ9C,SAAAA,EAAqB4lB;QAArB5lB;gBACEgD,IAAAA,gBADmB9C,MAAQ0lB,WAARA;;WAD4BJ,EAAAA,GAAAA;CAA7C,CAA6CA,KAuB7CM,mBAAA,SAAAhjB;IACJ9C,SAAqBklB,EAAAA,GAAiCa;QAAtD/lB;gBACEgD,IAAAA,EAAAA,KAAAA,SAAAA,MADmBkiB,IAAAA,GAAiChlB,EAAA6lB,IAAAA;;WADAP,EAAAA,GAAAA;CAAlD,CAAkDA,KCnJ3CQ,KACXhmB,SACWsZ,GACA2M;IADA/lB,KAAKoZ,QAALA,GACApZ,KAAS+lB,YAATA;GAkEAC,mBAAAA;IACXlmB,SACWmmB,EAAAA,GACAC;QADAlmB,KAAUimB,aAAVA,GACAjmB,KAAMkmB,SAANA;;;WASXvf,SAAAA;QACE,OAAO,IAAIqf;;2DAICE,EAAAA,SAAdvf,SAAcuf;QACZ,OAAO,IAAIF,UAAwBE;;+EAInBjE,EAAAA,aAAlBtb,SAAkBsb;QAChB,OAAO,IAAI+D,EAAa/D;OAItBkE,OAAAA,eAAAA,EAAAA,WAAAA,UAAAA;2DAAAA,KAAAA;YACF,YAAA,MAAOnmB,KAAKimB,mBAA4Chf,MAAhBjH,KAAKkmB;;;;QAG/C/lB,EAAQ0G,UAAAA,UAAR1G,SAAQ0G;QACN,OACE7G,KAAKkmB,WAAWrf,EAAMqf,WACrBlmB,KAAKimB,eACApf,EAAMof,cAAcjmB,KAAKimB,WAAW9lB,QAAQ0G,EAAMof,eACnDpf,EAAMof;;CApCJD,IAuGSI,KAAAA,eAuOhBC,mBAAA,SAAAzjB;IACJ9C,SAAAA,EACW+P,GACA9N,GACAukB,GACAC;aAAAA,MAAAA,MAAAA,IAAoC;QAJ/CzmB;gBAMEgD,IAAAA,EAAAA,KAAAA,SALS9C,MAAG6P,MAAHA,GACA7P,EAAK+B,QAALA,GACA/B,EAAYsmB,eAAZA,GACAtmB,EAAeumB,kBAAfA;QAKFvmB,EAAAyD,OAAsC;;WAVhB2iB,EAAAA,GAAAA,IAY/BI,EAAAA,UAAAA,eAAAA;QACE,OAAO;;CAbL,CAA2BJ,KA2E3BK,mBAAA,SAAA7jB;IACJ9C,SACW+P,EAAAA,GACAoK,GACAyM,GACAJ,GACAC;aAAAA,MAAAA,MAAAA,IAAoC;QAL/CzmB;gBAOEgD,IAAAA,EAAAA,KAAAA,SANS9C,MAAG6P,MAAHA,GACA7P,EAAIia,OAAJA,GACAja,EAAS0mB,YAATA,GACA1mB,EAAYsmB,eAAZA;QACAtmB,EAAeumB,kBAAfA,GAKFvmB,EAAAyD,OAAwC;;WAXhB2iB,EAAAA,GAAAA,IAajCI,EAAAA,UAAAA,eAAAA;QACE,OAAOxmB,KAAK0mB;;CAdV,CAA6BN,KAmK7BO,mBAAA,SAAA/jB;IACJ9C,SAAqB+P,EAAAA,GAA2ByW;QAAhDxmB;gBACEgD,IAAAA,EAAAA,KAAAA,eADsB+M,MAAHA,GAA2B7P,EAAYsmB,eAAZA,GAIvCtmB,EAAAyD,OAAyC;QACzCzD,EAAeumB,kBAAqB;;WANXH,EAAAA,GAAAA,IAQlCI,EAAAA,UAAAA,eAAAA;QACE,OAAO;;CATL,CAA8BJ,KAsD9BQ,mBAAA,SAAAhkB;IACJ9C,SAAqB+P,EAAAA,GAA2ByW;QAAhDxmB;gBACEgD,IAAAA,EAAAA,KAAAA,eADsB+M,MAAHA,GAA2B7P,EAAYsmB,eAAZA,GAIvCtmB,EAAAyD,OAAyC;QACzCzD,EAAeumB,kBAAqB;;WANXH,EAAAA,GAAAA,IAQlCI,EAAAA,UAAAA,eAAAA;QACE,OAAO;;CATL,CAA8BJ,KCpnB9BS,KACiD;IACrDC,KAA4B;IAC5BA,MAA6B;GAIzBC,KAC8C;IAClDC,KAA0B;IAC1BA,MAAmC;IACnCA,KAA6B;IAC7BA,MAAsC;IACtCA,MAAsB;IACtBA,MAA0B;IAC1BA,kBAA+B;IAC/BA,IAAmB;IACnBA,UAAuB;IACvBA,sBAAmC;GAI/BC,KACkD;IACtDD,KAA6B;IAC7BA,IAA4B;GAsBjBE,KACXpnB,SACWkG,GACAof;IADAplB,KAAUgG,aAAVA,GACAhG,KAAAolB,IAAAA;;;;;;;;;;;;;;;AA+CG,SAAA7I,GACdyI,GACA3I;IAEA,OAAI2I,EAAWI,IAUN,UANW,IAAI9R,KAAyB,MAApB+I,EAAU9I,SAAgB4T,cAEnBjd,QAAQ,SAAS,IAAIA,QAAQ,KAAK,KAAA,KAAA1I,QAEnD,cAAc6a,EAAUtI,aAAaxM,OAAO,WAItD;QACLgM,SAAS,KAAK8I,EAAU9I;QACxBR,OAAOsJ,EAAUtI;;;;;;;;GAgBP,UAAAqT,GACdpC,GACA5U;IAEA,OAAI4U,EAAWI,IACNhV,EAAM+B,aAEN/B,EAAMkC;;;AA0BD,SAAA+U,GACdrC,GACA/C;IAEA,OAAO1F,GAAYyI,GAAY/C,EAAQ1F;;;AAGnC,SAAU+K,GAAYrF;IAE1B,OAjOsC1f,IAgOzB0f,IACN7F,GAAgBmL,cApDzB,SAAuBzU;QACrB,IAAMuJ,IAAYxJ,GAAmBC;QACrC,OAAO,IAAIgB,GAAUuI,EAAU9I,SAAS8I,EAAUtJ;KAFpD,CAoDqDkP;;;AAGrC,SAAAuF,GACdxhB,GACAwD;IAEA,OA+EF,SAAkCxD;QAChC,OAAO,IAAImD,GAAa,EACtB,YACAnD,EAAWS,WACX,aACAT,EAAWU;KALf,CA/EkCV,GAC7BqB,MAAM,aACNA,MAAMmC,GACNJ;;;AAYW,SAAAqe,GACdzC,GACAnV;IAEA,OAAO2X,GAAexC,EAAWhf,YAAY6J,EAAIrG;;;AAGnC,SAAA+R,GACdyJ,GACAhiB;IAEA,IA+DA0kB,GA/DMC,IApBR,SAA0B3kB;QACxB,IAAM2kB,IAAWxe,GAAawB,WAAW3H;QAKzC,OApPsCT,EAiPpCqlB,GAAoBD,KAGfA;KANT,CAoBoC3kB;IAElC,IAAI2kB,EAASzf,IAAI,OAAO8c,EAAWhf,WAAWS,WAC5C,MAAM,IAAIiD,EACRhH,GACA,sDACEilB,EAASzf,IAAI,KACb,SACA8c,EAAWhf,WAAWS;IAI5B,IAAIkhB,EAASzf,IAAI,OAAO8c,EAAWhf,WAAWU,UAC5C,MAAM,IAAIgD,EACRhH,GACA,uDACEilB,EAASzf,IAAI,KACb,SACA8c,EAAWhf,WAAWU;IAG5B,OAAO,IAAIgE,IAvR2BnI,GAiUtCmlB,IA1CwDC,GA6CzCjiB,SAAS,KAA6B,gBAAxBgiB,EAAaxf,IAAI,KAGvCwf,EAAa7f,SAAS;;;AA7C/B,SAASggB,GACP7C,GACAxb;IAEA,OAAOge,GAAexC,EAAWhf,YAAYwD;;;AAezC,SAAUse,GAAqB9C;IAOnC,OANa,IAAI7b,GAAa,EAC5B,YACA6b,EAAWhf,WAAWS,WACtB,aACAue,EAAWhf,WAAWU,YAEZ0C;;;AAuBE2e,SAAAA,GACd/C,GACAnV,GACAgF;IAEA,OAAO;QACL7R,MAAMykB,GAAOzC,GAAYnV;QACzBgF,QAAQA,EAAO9S,MAAM6S,SAASC;;;;AA2blB,SAAAmT,GACdhD,GACApM;;IAGA,IAAMgC,IAA2B;QAAEqN,iBAAiB;OAC9Cze,IAAOoP,EAAOpP;IACW,SAA3BoP,EAAO/N,mBAKT+P,EAAO2G,SAASsG,GAAY7C,GAAYxb,IACxCoR,EAAOqN,gBAAiBC,OAAO,EAC7B;QACEnd,cAAc6N,EAAO/N;QACrBsd,iBAAgB;YAQpBvN,EAAO2G,SAASsG,GAAY7C,GAAYxb,EAAKzB,YAC7C6S,EAAOqN,gBAAiBC,OAAO,EAAC;QAAEnd,cAAcvB,EAAKvB;;IAGvD,IAAMmgB,IAqKR,SAAmB5N;QACjB,IAAuB,MAAnBA,EAAQ9U,QAIZ,OAAO2iB,GAAS3N,GAAgB4N,OAAO9N,GAA+B;KALxE,CArK0B5B,EAAO4B;IAC3B4N,MACFxN,EAAOqN,gBAAiBG,QAAQA;IAGlC,IAAM9E,IAiMR,SAAiBsB;QACf,IAAwB,MAApBA,EAASlf,QAGb,OAAOkf,EAASxjB,KAAImnB,SAAAA;;YAoHhB,OAAA,SAA0BjF;gBAC9B,OAAO;oBACLlK,OAAOoP,GAAqBlF,EAAQlK;oBACpCqP,WAAWC,GAAYpF,EAAQpH;;aAH7B,CApHyCqM;;KAJ/C,CAjM0B3P,EAAO0K;IAC3BA,MACF1I,EAAOqN,gBAAiB3E,UAAUA;IAGpC,IAuMuBqF,GAvMjBnhB,IA3rBR,SACEwd,GACAnM;QAEA,OAAImM,EAAWI,KAAiB/Y,GAAkBwM,KACzCA,IAEA;YAAE9W,OAAO8W;;KAPpB,CA2rB6BmM,GAAYpM,EAAOpR;IAY9C,OAXc,SAAVA,MACFoT,EAAOqN,gBAAiBzgB,QAAQA,IAG9BoR,EAAO2K,YACT3I,EAAOqN,gBAAiB1E,UAkMnB;QACLqF,SAFqBD,IAjM6B/P,EAAO2K,SAmM1CvK;QACfvC,QAAQkS,EAAO5P;QAlMbH,EAAO4K,UACT5I,EAAOqN,gBAAiBzE,QAqM5B,SAAuBmF;QACrB,OAAO;YACLC,SAASD,EAAO3P;YAChBvC,QAAQkS,EAAO5P;;KAHnB,CArMkDH,EAAO4K,SAGhD5I;;;AAsNH,SAAU8N,GAAYxM;IAC1B,OAAO2K,GAAW3K;;;;SAkBJ2M,GAAexP;IAC7B,OAAO0N,GAAU1N;;;AAGb,SAAUyP,GACdzP;IAEA,OAAO4N,GAAoB5N;;;AA6CvB,SAAUmP,GAAqBhf;IACnC,OAAO;QAAEuX,WAAWvX,EAAKJ;;;;AAyBrB,SAAUif,GAASze;IACvB,OAAIA,aAAkBgQ,KAwBlB,SAA+BhQ;QACnC,IAAa,8BAATA,EAAOyP,IAAuB;YAChC,IAAId,GAAW3O,EAAO7H,QACpB,OAAO;gBACLgnB,aAAa;oBACX3P,OAAOoP,GAAqB5e,EAAOwP;oBACnCC,IAAI;;;YAGH,IAAIf,GAAY1O,EAAO7H,QAC5B,OAAO;gBACLgnB,aAAa;oBACX3P,OAAOoP,GAAqB5e,EAAOwP;oBACnCC,IAAI;;;eAIL,IAAa,kCAATzP,EAAOyP,IAA2B;YAC3C,IAAId,GAAW3O,EAAO7H,QACpB,OAAO;gBACLgnB,aAAa;oBACX3P,OAAOoP,GAAqB5e,EAAOwP;oBACnCC,IAAI;;;YAGH,IAAIf,GAAY1O,EAAO7H,QAC5B,OAAO;gBACLgnB,aAAa;oBACX3P,OAAOoP,GAAqB5e,EAAOwP;oBACnCC,IAAI;;;;QAKZ,OAAO;YACL4B,aAAa;gBACX7B,OAAOoP,GAAqB5e,EAAOwP;gBACnCC,IAAIwP,GAAejf,EAAOyP;gBAC1BtX,OAAO6H,EAAO7H;;;KAtCd,CAvB0B6H,KACnBA,aAAkB8Q,KAOzB,SAA4B9Q;QAChC,IAAMof,IAASpf,EAAOyQ,aAAajZ,KAAIwI,SAAAA;YAAUye,OAAAA,GAASze;;QAE1D,OAAsB,MAAlBof,EAAOtjB,SACFsjB,EAAO,KAGT;YACLC,iBAAiB;gBACf5P,IAAIyP,GAAwBlf,EAAOyP;gBACnCmB,SAASwO;;;KAVT,CANuBpf,KAhpCpBzH;;;AA4vCH,SAAU+mB,GAAexC;IAC7B,IAAMyC,IAA4B;IAIlC,OAHAzC,EAAU7R,OAAOpN,SAAQ2R,SAAAA;QACvB+P,OAAAA,EAAgBxhB,KAAKyR,EAAMhQ;SAEtB;QACLggB,YAAYD;;;;AASV,SAAUvB,GAAoBpe;;IAElC,OACEA,EAAK9D,UAAU,KACC,eAAhB8D,EAAKtB,IAAI,MACO,gBAAhBsB,EAAKtB,IAAI;;;;;;;;;;;;;;;;;;GC1xCP,UAAUmhB,GAAcrjB;IAC5B,OAAO,IAAIkhB,GAAoBlhB,yBAAiC;;;;;;;;;;;;;;;;;;;;;;;;;;;GCoBrDsjB,KAAAA,mBAAAA;IAMXxpB,SAAAA;;;;IAImBypB;;;;IAIAC;;;;;;IAMAC;;;;UAKAC;;;;;UAMAC;aAXAF,MAAAA,MAAAA,IApCoB,WAyCpBC,MAAAA,MAAAA,IAvCU,WA6CVC,MAAAA,MAAAA,IA1CgB;QAqBhB3pB,KAAAupB,IAAAA,GAIAvpB,KAAOwpB,UAAPA,GAMAxpB,KAAAypB,IAAAA,GAKAzpB,KAAA0pB,IAAAA,GAMA1pB,KAAA2pB,IAAAA,GA9BnB3pB,KAAA4pB,IAAgC,GAChC5pB,KAAA6pB,IAAsD;;QAEtD7pB,KAAA8pB,IAA0BxW,KAAKW,OA6B7BjU,KAAK+pB;;;;;;;;kBAUPA,oBAAAA;QACE/pB,KAAK4pB,IAAgB;;;;;;IAOvBI,gBAAAA;QACEhqB,KAAK4pB,IAAgB5pB,KAAK2pB;;;;;;;IAQ5BM,EAAAA,UAAAA,IAAAA,SAAc5Q;QAAd4Q;;gBAEEjqB,KAAKkqB;;;QAIL,IAAMC,IAA2BrhB,KAAKyH,MACpCvQ,KAAK4pB,IAAgB5pB,KAAKoqB,MAItBC,IAAevhB,KAAKwhB,IAAI,GAAGhX,KAAKW,QAAQjU,KAAK8pB,IAG7CS,IAAmBzhB,KAAKwhB,IAC5B,GACAH,IAA2BE;;gBAGzBE,IAAmB,KACrBzpB,EAtGU,sBAwGR,mBAAmBypB,OAAAA,GACDvqB,qBAAAA,OAAAA,KAAK4pB,sCACCO,GACLE,uBAAAA,OAAAA;QAIvBrqB,KAAK6pB,IAAe7pB,KAAKupB,EAAMiB,kBAC7BxqB,KAAKwpB,SACLe,IACA;YAAA,OACEvqB,EAAK8pB,IAAkBxW,KAAKW,OACrBoF;;;;QAMXrZ,KAAK4pB,KAAiB5pB,KAAK0pB,GACvB1pB,KAAK4pB,IAAgB5pB,KAAKypB,MAC5BzpB,KAAK4pB,IAAgB5pB,KAAKypB,IAExBzpB,KAAK4pB,IAAgB5pB,KAAK2pB,MAC5B3pB,KAAK4pB,IAAgB5pB,KAAK2pB;OAI9Bc,EAAAA,UAAAA,IAAAA;QAC4B,SAAtBzqB,KAAK6pB,MACP7pB,KAAK6pB,EAAaa,aAClB1qB,KAAK6pB,IAAe;OAIxBK,EAAAA,UAAAA,SAAAA;QAC4B,SAAtBlqB,KAAK6pB,MACP7pB,KAAK6pB,EAAaK,UAClBlqB,KAAK6pB,IAAe;;mFAKhBO,gBAAAA;QACN,QAAQthB,KAAK0H,WAAW,MAAOxQ,KAAK4pB;;KCpGxCe,mBAAA,SAAA/nB;IAGE9C,SAAAA,EACW8qB,GACAC,GACAC,GACA9F;QAJXllB;gBAMEgD,IAAAA,gBALS9C,MAAe4qB,kBAAfA,GACA5qB,EAAmB6qB,sBAAnBA;QACA7qB,EAAU8qB,aAAVA,GACA9qB,EAAAglB,IAAAA,GANXhlB,EAAA+qB,KAAa;;WADTC,EAAAA,GAAAA,IAYJC,EAAAA,UAAAA,KAAAA;QAEE,IAAIjrB,KAAK+qB,GACP,MAAM,IAAIrhB,EACRhH,GACA;;mEAMNyM,gBAAAA,SACEnB,GACAxE,GACAmG;QAHFR;QAME,OADAnP,KAAKirB,MACE7nB,QAAQ8nB,IAAI,EACjBlrB,KAAK4qB,gBAAgB9mB,YACrB9D,KAAK6qB,oBAAoB/mB,cAExBa,MAAK,SAAE0K;gBAAAA,IAAAA,EAAAA,IAAWC,IACVtP,EAAAA;YAAAA,OAAAA,EAAK8qB,WAAW3b,EACrBnB,GACAxE,GACAmG,GACAN,GACAC;YAGH6b,OAAOxpB,SAAAA;YACN,MAAmB,oBAAfA,EAAMqB,QACJrB,EAAMkB,SAASH,MACjB1C,EAAK4qB,gBAAgB7mB;YACrB/D,EAAK6qB,oBAAoB9mB,oBAErBpC,KAEA,IAAI+H,EAAehH,GAAcf,EAAMoB;;;yFAMrD2M,EACE1B,UAAAA,IADF0B,SACE1B,GACAxE,GACAmG,GACAC;QAJFF;QAOE,OADA1P,KAAKirB,MACE7nB,QAAQ8nB,IAAI,EACjBlrB,KAAK4qB,gBAAgB9mB,YACrB9D,KAAK6qB,oBAAoB/mB,cAExBa,MAAK;gBAAE0K,IAAWC,EAAAA,IAAAA,IAAAA,EAAAA;YACVtP,OAAAA,EAAK8qB,WAAWpb,EACrB1B,GACAxE,GACAmG,GACAN,GACAC,GACAM;YAGHub,OAAOxpB,SAAAA;YACN,MAAmB,oBAAfA,EAAMqB,QACJrB,EAAMkB,SAASH,MACjB1C,EAAK4qB,gBAAgB7mB;YACrB/D,EAAK6qB,oBAAoB9mB,oBAErBpC,KAEA,IAAI+H,EAAehH,GAAcf,EAAMoB;;OAKrDqoB,EAAAA,UAAAA,YAAAA;QACEprB,KAAK+qB,KAAa;;CA3FtB,EAAMC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA+GgBK,SAAAA,GACpBC,GACAC;;;;;;uBAEMC,IAAgB/oB,EAAU6oB,IAC1B9hB,IAAOse,GAAqB0D,EAAcxG,KAAc,cACxDrV,IAAU;oBACd8b,QAAQF,EAAUnqB,KAAIsqB,SAAAA;wBAAKC,OHwaf,SACd3G,GACA4G;4BAEA,IAAIhR;4BACJ,IAAIgR,aAAoBC,IACtBjR,IAAS;gCACPkR,QAAQ/D,GAAmB/C,GAAY4G,EAAS/b,KAAK+b,EAAS7pB;oCAE3D,IAAI6pB,aAAoBG,IAC7BnR,IAAS;gCAAEwF,QAAQqH,GAAOzC,GAAY4G,EAAS/b;oCAC1C,IAAI+b,aAAoBI,IAC7BpR,IAAS;gCACPkR,QAAQ/D,GAAmB/C,GAAY4G,EAAS/b,KAAK+b,EAAS3R;gCAC9DgS,YAAY/C,GAAe0C,EAASlF;oCAEjC;gCAAA,MAAIkF,aAAoBM,KAK7B,OAvlBK/pB;gCAmlBLyY,IAAS;oCACPuR,QAAQ1E,GAAOzC,GAAY4G,EAAS/b;;;4BAgBxC,OAVI+b,EAASrF,gBAAgB7gB,SAAS,MACpCkV,EAAOwR,mBAAmBR,EAASrF,gBAAgBnlB,KAAI2kB,SAAAA;gCAsH3D,OAAA,SACEf,GACAqH;oCAEA,IAAMtG,IAAYsG,EAAetG;oCACjC,IAAIA,aAAqBuG,IACvB,OAAO;wCACLvL,WAAWsL,EAAejT,MAAMhQ;wCAChCmjB,kBAAkB;;oCAEf,IAAIxG,aAAqByG,IAC9B,OAAO;wCACLzL,WAAWsL,EAAejT,MAAMhQ;wCAChCqjB,uBAAuB;4CACrBhW,QAAQsP,EAAUL;;;oCAGjB,IAAIK,aAAqB2G,IAC9B,OAAO;wCACL3L,WAAWsL,EAAejT,MAAMhQ;wCAChCujB,oBAAoB;4CAClBlW,QAAQsP,EAAUL;;;oCAGjB,IAAIK,aAAqB6G,IAC9B,OAAO;wCACL7L,WAAWsL,EAAejT,MAAMhQ;wCAChCyjB,WAAW9G,EAAUF;;oCAGvB,MA/uBK1jB;iCAitBT,CArHuB6iB,GAAYe;kCAI5B6F,EAAStF,aAAaH,WACzBvL,EAAOkS,kBAkDX,SACE9H,GACAsB;gCAGA,YAAgCrf,MAA5Bqf,EAAaL,aACR;oCACLA,YAAYoB,GAAUrC,GAAYsB,EAAaL;yCAEhBhf,MAAxBqf,EAAaJ,SACf;oCAAEA,QAAQI,EAAaJ;oCA7pBzB/jB;6BAmpBT,CAlD4C6iB,GAAY4G,EAAStF,gBAGxD1L;yBG1csB+Q,CAAWH,EAAcxG,GAAY0G;;mBAE5DF,EAAAA,cAAAA,EAAcrc,EAAU,UAAU3F,GAAMmG;;;;;;;;;AAGzC1B,SAAe8e,GACpBzB,GACArT;;;;;;gBAOuBuT,OALjBA,IAAgB/oB,EAAU6oB,IAC1B9hB,IAAOse,GAAqB0D,EAAcxG,KAAc,cACxDrV,IAAU;oBACdqd,WAAW/U,EAAK7W,KAAImc,SAAAA;wBAAKkK,OAAAA,GAAO+D,EAAcxG,GAAYzH;;mBAErCiO,EAAAA,cAAAA,EAAc9b,EAGnC,qBAAqBlG,GAAMmG,GAASsI,EAAKvS;;;gBAa3C,OAhBM4I,IAAiBkd,EAGoB9lB,QAErCunB,IAAO,IAAItpB,KACjB2K,EAAS7G,SAAQsH,SAAAA;oBACf,IAAMiL,IH2QM,SACdgL,GACApK;wBAEA,OAAI,WAAWA,IAxCjB,SACEoK,GACAhL;4BAEAzX,IACIyX,EAAIc,QAGMd,EAAIc,MAAM9X,MACVgX,EAAIc,MAAMmL;4BACxB,IAAMpW,IAAM0L,GAASyJ,GAAYhL,EAAIc,MAAM9X,OACrCif,IAAUqF,GAAYtN,EAAIc,MAAMmL,aAChC9D,IAAanI,EAAIc,MAAMqH,aACzBmF,GAAYtN,EAAIc,MAAMqH,cACtB/F,GAAgBrT,OACdkR,IAAO,IAAIkH,GAAY;gCAAEvM,UAAU;oCAAEC,QAAQmF,EAAIc,MAAMjG;;;4BAC7D,OAAOkN,GAAgBmL,iBAAiBrd,GAAKoS,GAASE,GAAYlI;yBAhBpE,CAyCqB+K,GAAYpK,KACpB,aAAaA,IAvB1B,SACEoK,GACApK;4BAEArY,IACIqY,EAAOuS,UAGX5qB,IACIqY,EAAOsH;4BAGX,IAAMrS,IAAM0L,GAASyJ,GAAYpK,EAAOuS,UAClClL,IAAUqF,GAAY1M,EAAOsH;4BACnC,OAAOH,GAAgBqL,cAAcvd,GAAKoS;yBAd5C,CAwBuB+C,GAAYpK,KAjc1BzY;qBG+KOkrB,CAA8B7B,EAAcxG,GAAYjW;oBACpEke,EAAKrpB,IAAIoW,EAAInK,IAAI9M,YAAYiX;qBAEzBY,IAAqB,IAM3B,EAAA,gBALA3C,EAAKxQ,SAAQoI,SAAAA;oBACX,IAAMmK,IAAMiT,EAAK/kB,IAAI2H,EAAI9M;oBAzKnBR,IA0KOyX,IACbY,EAAOjT,KAAKqS;qBAEPY;;;;;;;;;;;;;;;;;;;;;;ACxLF,IAyBD0S,KAAqB,IAAI3pB;;;;;;;;;;GAOzB,UAAU4pB,GAAaC;IAC3B,IAAIA,EAAUC,aACZ,MAAM,IAAI/jB,EACRhH,GACA;IAGJ,KAAK4qB,GAAmB9N,IAAIgO,IAAY;QACtC1sB,EAxCmB,qBAwCD;QAClB,IAMMgqB,ICrDJ,SAAwBjd;YAC5B,OAAO,IAAI6f,GAAgB7f,GAAc8f,MAAMC,KAAK;SADhD,EDiFJ5nB,IAjCIwnB,EAAUK,aAkCd5nB,IAjCIunB,EAAUM,IAAIC,QAAQ9nB,SAAS,IAkCnCC,IAjCIsnB,EAAUQ,iBAkCdC,IAjCIT,EAAUU;QAmCP,IAAInoB,EACTC,GACAC,GACAC,GACA+nB,EAAS9nB,MACT8nB,EAAS7nB,KACT6nB,EAASE,8BACTF,EAASG,mCACTH,EAAS1nB,oBAxCHye,IAAaqE,GAAcmE,EAAUK,cACrCvC,IDoFJ,SACJV,GACAC,GACAC,GACA9F;YAEA,OAAO,IAAIgG,GACTJ,GACAC,GACAC,GACA9F;SAVE,CCnFAwI,EAAUa,kBACVb,EAAUc,sBACVxD,GACA9F;QAGFsI,GAAmB1pB,IAAI4pB,GAAWlC;;IAkBhC,IACJtlB,GACAC,GACAC,GACA+nB;;;;;;;;;;;;;;;;OApBA,OAAOX,GAAmBplB,IAAIslB;;;;;;;;;;;GEpBnBe,KAAAA,mBAAAA;IAqBXzuB,SAAAA,EAAYmuB;;QACV,SAAsBhnB,MAAlBgnB,EAAS9nB,MAAoB;YAC/B,SAAA,MAAI8nB,EAAS7nB,KACX,MAAM,IAAIsD,EACRhH,GACA;YAGJ1C,KAAKmG,OAvEiB,4BAwEtBnG,KAAKoG,OAvEgB;eAyErBpG,KAAKmG,OAAO8nB,EAAS9nB,MACrBnG,KAAKoG,MAAsB,UAAhB0I,IAAAmf,EAAS7nB,aAAO,MAAA0I,KAAAA;QAM7B,IAHA9O,KAAKwuB,cAAcP,EAASO,aAC5BxuB,KAAKyuB,8BAA8BR,EAASQ;aAEZxnB,MAA5BgnB,EAASS,gBACX1uB,KAAK0uB,iBCvEiC,eDwEjC;YACL,KC1EiC,MD2E/BT,EAASS,kBACTT,EAASS,iBEtE2B,SFwEpC,MAAM,IAAIhlB,EACRhH,GACA;YAGF1C,KAAK0uB,iBAAiBT,EAASS;;QAInC1uB,KAAKmuB,iCAAiCF,EAASE,8BAC/CnuB,KAAKouB,sCACDH,EAASG;QACbpuB,KAAKuG,oBAAoB0nB,EAAS1nB,iBlC7EhC,SACJooB,GACAC,GACAC,GACAC;YAEA,KAAkB,MAAdF,YAAsBE,GACxB,MAAM,IAAIplB,EACRhH,GACA,GAAGisB,OkCuEH,gClCvEsBE,SAAAA,OkCyEtB,qClCzEsBA;SATtB,CkCgFA,GACAZ,EAASE,8BACT,GACAF,EAASG;;WAIbjuB,EAAQ0G,UAAAA,UAAR1G,SAAQ0G;QACN,OACE7G,KAAKmG,SAASU,EAAMV,QACpBnG,KAAKoG,QAAQS,EAAMT,OACnBpG,KAAKwuB,gBAAgB3nB,EAAM2nB,eAC3BxuB,KAAK0uB,mBAAmB7nB,EAAM6nB,kBAC9B1uB,KAAKmuB,iCACHtnB,EAAMsnB,gCACRnuB,KAAKouB,sCACHvnB,EAAMunB,qCACRpuB,KAAKyuB,8BAA8B5nB,EAAM4nB,6BACzCzuB,KAAKuG,oBAAoBM,EAAMN;;KGrFxBwoB,mBAAAA;;IAgBXjvB,SAAAA,EACSuuB,GACAC,GACET,GACAmB;QAHFhvB,KAAgBquB,mBAAhBA,GACAruB,KAAoBsuB,uBAApBA,GACEtuB,KAAW6tB,cAAXA;QACA7tB,KAAIgvB,OAAJA;;;;QAhBXhvB,KAAIyD,OAAmC,kBAE9BzD,KAAeguB,kBAAW,UAE3BhuB,KAAAivB,YAAY,IAAIV,GAAsB;QACtCvuB,KAAekvB,mBAAG;;WAkBtBpB,OAAAA,eAAAA,EAAAA,WAAAA,OAAAA;;;;;QAAAA,KAAAA;YACF,KAAK9tB,KAAKgvB,MACR,MAAM,IAAItlB,EACRhH,GACA;YAIJ,OAAO1C,KAAKgvB;;;;QAGVG,OAAAA,eAAAA,EAAAA,WAAAA,gBAAAA;QAAAA,KAAAA;YACF,OAAOnvB,KAAKkvB;;;;QAGVzB,OAAAA,eAAAA,EAAAA,WAAAA,eAAAA;QAAAA,KAAAA;YACF,YAAA,MAAOztB,KAAKovB;;;;QAGdC,EAAapB,UAAAA,eAAboB,SAAapB;QACX,IAAIjuB,KAAKkvB,iBACP,MAAM,IAAIxlB,EACRhH,GACA;QAKJ1C,KAAKivB,YAAY,IAAIV,GAAsBN,SAAAA,MACvCA,EAASO,gBACXxuB,KAAKquB,mBzCgiBL,SACJG;YAEA,KAAKA,GACH,OAAO,IAAI3qB;YAGb,QAAQ2qB,EAAkB/qB;cACxB,KAAK;gBACH,IAAM6rB,IAASd,EAAoBe;gBACnC,OAAO,IAAI/pB,EACT8pB,GACAd,EAA0BgB,gBAAK,KAC/BhB,EAAsBiB,YAAK,MAC3BjB,EAA8BkB,oBAAK;;cAGvC,KAAK;gBACH,OAAOlB,EAAoBe;;cAE7B;gBACE,MAAM,IAAI7lB,EACRhH,GACA;;SAvBF,CyChiBoDurB,EAASO;OAIjEmB,EAAAA,UAAAA,eAAAA;QACE,OAAO3vB,KAAKivB;OAGdf,EAAAA,UAAAA,kBAAAA;QAEE,OADAluB,KAAKkvB,mBAAkB,GAChBlvB,KAAKivB;OAGdW,EAAAA,UAAAA,UAAAA;QAIE,OAHK5vB,KAAKovB,mBACRpvB,KAAKovB,iBAAiBpvB,KAAK6vB,eAEtB7vB,KAAKovB;;oFAId9a,qBAAAA;QACE,OAAO;YACLwZ,KAAK9tB,KAAKgvB;YACVhpB,YAAYhG,KAAK6tB;YACjBI,UAAUjuB,KAAKivB;;;;;;;;;;IAWTY,yBAAAA;QAER,OL9D6BrC,IK6DZxtB,OL5DbsrB,IAAYgC,GAAmBplB,IAAIslB,QAEvC1sB,EApEmB,qBAoED;QAClBwsB,GAAmBlN,OAAOoN,IAC1BlC,EAAUF,cKyDHhoB,QAAQC;QL9Db,IAA2BmqB,GACzBlC;;CKlCKyD;;;;;;;;;;;;;;;;;;;;;;GAoIGe,UAAAA,GACdhC,GACAG,GACAjoB;IAEKA,MACHA,IxCrJiC;IwCuJnC,IAAM+pB,IAAWC,aAAalC,GAAK;IAEnC,IAAIiC,EAASE,cAAcjqB,IACzB,MAAM,IAAI0D,EACRhH,GACA;IAIJ,OAAOqtB,EAASG,WAAW;QACzBnC,SAASE;QACTkC,oBAAoBnqB;;;;AA4CR,SAAAoqB,GACdC,GACAC;IAEA,IAAMxC,IACuB,mBAApBuC,IAA+BA,IAAkBE,KACpDvqB,IACuB,mBAApBqqB,IACHA,IACAC,KAAsB,aACtBE,IAAKR,aAAalC,GAAK,kBAAkB2C,aAAa;QAC1DC,YAAY1qB;;IAEd,KAAKwqB,EAAGrB,cAAc;QACpB,IAAMwB,IAAWC,EAAkC;QAC/CD,KACFE,qBAAyBL,KAAOG;;IAGpC,OAAOH;;;;;;;;;;;;;;;GAgBH,UAAUK,GACdrD,GACArnB,GACA2qB,GACA/C;;SAAAA,MAAAA,MAAAA,IAEI;IAGJ,IAAME,KADNT,IAAYxhB,GAAKwhB,GAAWuB,KACDY;IAe3B,IHlS0B,+BGqRtB1B,EAAS9nB,QAAyB8nB,EAAS9nB,SAASA,KACtDvE,EACE;IAKJ4rB,EAAU6B,aAAYle,OAAAwH,OAAAxH,OAAAwH,OAAA,IACjBsV,IAAQ;QACX9nB,MAAM,GAAA3E,OAAG2E,GAAQ2qB,KAAAA,OAAAA;QACjB1qB,MAAK;SAGH2nB,EAAQgD,eAAe;QACzB,IAAIzsB,GACAd;QACJ,IAAqC,mBAA1BuqB,EAAQgD,eACjBzsB,IAAQypB,EAAQgD,eAChBvtB,IAAO3D,EAAKW,gBACP;;;YAGL8D,IAAQ0sB,EACNjD,EAAQgD,eACQ,UAAhBjiB,IAAA0e,EAAUwB,cAAAA,MAAMlgB,SAAAA,IAAAA,EAAAif,QAAQtnB;YAE1B,IAAM1G,IAAMguB,EAAQgD,cAAcE,OAAOlD,EAAQgD,cAAcG;YAC/D,KAAKnxB,GACH,MAAM,IAAI2J,EACRhH,GACA;YAGJc,IAAO,IAAI3D,EAAKE;;QAGlBytB,EAAUa,mBAAmB,IAAIhqB,EAC/B,IAAId,EAAWe,GAAOd;;;;;;;;;;;;;;;;;;;;;;;GAyBtB,UAAU4nB,GAAUoC;IAGxB,OAFAA,IAAYxhB,GAAKwhB,GAAWuB,KAC5BoC,EAAuB3D,EAAUM,KAAK,mBAC/BN,EAAUoC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;6DC1VNwB;IAAAA,KAAbtxB;;IAEEE,KAAIyD,OAAG;GA2BI4tB,mBAAAA;;IAWXvxB,SACEmkB,EAAAA,GACiBqN;QAAAtxB,KAAKsxB,QAALA;;QAXVtxB,KAAIyD,OAAG,0BAadzD,KAAKikB,QAAQA;;;;;;;;;;;;;WAcfhK,mBAAAA;QACE,OAAOja,KAAKsxB;;CA9BHD,ICtBAE,mBAAAA;IACXzxB,SAAAA,EACmBmkB,GACAqH,GACAkG;QAFAxxB,KAAKikB,QAALA,GACAjkB,KAASsrB,YAATA,GACAtrB,KAAcwxB,iBAAdA;;WAGnBC,EAAAA,UAAAA,MAAAA;QAAAA;QACE,ORwMGxjB,SACLqd,GACArH;;;;;;wBAgBA,OAdMuH,IAAgB/oB,EAAU6oB,IAC1B3b,IHooBQ,SACdqV,GACApM;4BAEA,IAAM8Y,IAAc1J,GAAchD,GAAYpM;4BAE9C,OAAO;gCACL+Y,4BAA4B;oCAC1BC,cAAc,EACZ;wCACE1gB,OAAO;wCACP2gB,OAAO;;oCAGX5J,iBAAiByJ,EAAYzJ;;gCAE/B1G,QAAQmQ,EAAYnQ;;yBAhBR,CGnoBZiK,EAAcxG,GACdL,GAAcV,KAGV1C,IAAS5R,EAAQ4R,QAClBiK,EAAcV,WAAW5b,YACrBS,EAAQ4R,QAMjB,EAAA,cAJuBiK,EAAc9b,EAGnC,uBAAuB6R,GAAS5R,8BAAoC;;sBACtE,KAAA;wBAAA,OAAA,EAAA,eAAAb,EADsEgjB,OAIjEloB,QAAOmF,SAAAA;4BAAAA,SAAWA,EAAM6L;4BACxBxZ,KAAI2N,SAAAA;4BAASA,OAAAA,EAAM6L,OAAQmX;;;;;SQ9NvBC,CAA6BhyB,KAAKsrB,WAAWtrB,KAAKikB,MAAMgO,QAAQttB,MACrEiW,SAAAA;YAQIrY,OAAAA,MANAqY,EAAO;YAIT,IAMMsX,IANS/gB,OAAOghB,QAAQvX,EAAO,IAClChR,QAAO;oBAAEiG,IAAK9N,EAAAA;gBAAmB,OAAnBA,EAAAA,IAAmB,kBAAR8N;gBACzBzO,KAAI,SAAEyO;gBAAAA,EAAAA;gBAAK9N,IAAAA;gBACV/B,OAAAA,EAAKwxB,eAAeY,aAAarwB;gBAGX;YAO1B,OAXEQ,EAOsB,mBAAf2vB,IAIF9uB,QAAQC,QACb,IAAIguB,GACFrxB,EAAKikB,OACL;gBACE/S,OAAOghB;;;;CAhCRX,ICqFAc,mBAAAA;;IAWXvyB,SAAAA,EACE0tB;;;;IAIS8E,GACAC;QADAvyB,KAASsyB,YAATA,GACAtyB,KAAIuyB,OAAJA;;QAfFvyB,KAAIyD,OAAG,YAiBdzD,KAAKwtB,YAAYA;;WAGfgF,OAAAA,eAAAA,EAAAA,WAAAA,SAAAA;QAAAA,KAAAA;YACF,OAAOxyB,KAAKuyB,KAAK/oB;;;;QAMfipB,OAAAA,eAAAA,EAAAA,WAAAA,MAAAA;;;;QAAAA,KAAAA;YACF,OAAOzyB,KAAKuyB,KAAK/oB,KAAKvB;;;;QAOpBuB,OAAAA,eAAAA,EAAAA,WAAAA,QAAAA;;;;;QAAAA,KAAAA;YACF,OAAOxJ,KAAKuyB,KAAK/oB,KAAKJ;;;;QAMpBmY,OAAAA,eAAAA,EAAAA,WAAAA,UAAAA;;;;QAAAA,KAAAA;YACF,OAAO,IAAImR,GACT1yB,KAAKwtB,WACLxtB,KAAKsyB,WACLtyB,KAAKuyB,KAAK/oB,KAAKzB;;;;QAsBnB4qB,EACEL,UAAAA,gBADFK,SACEL;QAEA,OAAO,IAAID,EAAqBryB,KAAKwtB,WAAW8E,GAAWtyB,KAAKuyB;;CAzEvDF,IAiFAO,mBAAAA;;;IAaX9yB,SAAAA,EACE0tB;;;;IAIS8E,GACAL;QADAjyB,KAASsyB,YAATA,GACAtyB,KAAMiyB,SAANA;;QAjBFjyB,KAAIyD,OAA2B,SAmBtCzD,KAAKwtB,YAAYA;;WAoBnBmF,EAAiBL,UAAAA,gBAAjBK,SAAiBL;QACf,OAAO,IAAIM,EAAS5yB,KAAKwtB,WAAW8E,GAAWtyB,KAAKiyB;;CA1C3CW,IAkDPC,mBAAA,SAAAjwB;;IAKJ9C,SAAAA,EACE0tB,GACA8E,GACSE;QAHX1yB;gBAKEgD,IAAAA,aAAM0qB,GAAW8E,GhBlIZ,IAAI3O,GgBkImC6O,OAFnCxyB,MAAKwyB,QAALA;;QANFxyB,EAAIyD,OAAG;;WAFyCmvB,EAAAA,GAAAA,IAcrDH,OAAAA,eAAAA,EAAAA,WAAAA,MAAAA;4CAAAA,KAAAA;YACF,OAAOzyB,KAAKiyB,OAAOzoB,KAAKvB;;;;QAOtBuB,OAAAA,eAAAA,EAAAA,WAAAA,QAAAA;;;;;QAAAA,KAAAA;YACF,OAAOxJ,KAAKiyB,OAAOzoB,KAAKJ;;;;QAOtBmY,OAAAA,eAAAA,EAAAA,WAAAA,UAAAA;;;;;QAAAA,KAAAA;YACF,IAAMuR,IAAa9yB,KAAKwyB,MAAMzqB;YAC9B,OAAI+qB,EAAW1qB,YACN,OAEA,IAAIiqB,GACTryB,KAAKwtB;6BACY,MACjB,IAAI9iB,GAAYooB;;;;QAyBtBH,EACEL,UAAAA,gBADFK,SACEL;QAEA,OAAO,IAAII,EAAuB1yB,KAAKwtB,WAAW8E,GAAWtyB,KAAKwyB;;CAlEhE,CAAqDI;;;;GAyHrD,UAAUG,GACdxR,GACA/X;SACGwpB,IAAAA,IAAAA,IAAAA,IAAAA,GAAAA,IAAAA,UAAAA,QAAAA,KAAAA,EAAAA,IAAAA,KAAAA,UAAAA;IAKH,IAHAzR,IAAS0R,EAAmB1R,IAE5BnW,GAAyB,cAAc,QAAQ5B,IAC3C+X,aAAkBwN,IAAW;QAC/B,IAAMmE,IAAe/pB,GAAawB,WAAAA,MAAbxB,IAAawB,EAAAA,EAAWnB,KAASwpB,IAAAA;QAEtD,OADAtnB,GAAuBwnB,IAChB,IAAIR,GAAoBnR,oBAAyB,MAAM2R;;IAE9D,MACI3R,aAAkB8Q,MAClB9Q,aAAkBmR,KAEpB,MAAM,IAAIhpB,EACRhH,GACA;IAIJ,IAAMwwB,IAAe3R,EAAOiR,MAAMnrB,MAChC8B,GAAawB,iBAAbxB,IAAAA,EAAAA,EAAwBK,KAASwpB;IAGnC,OADAtnB,GAAuBwnB,IAChB,IAAIR,GACTnR,EAAOiM;qBACU,MACjB0F;;;;;;;;;;;;;;;GAmBU,UAAAroB,GACd2iB,GACAziB;IAKA,IAHAyiB,IAAYxhB,GAAKwhB,GAAWuB,KAE5B3jB,GAAyB,mBAAmB,iBAAiBL,IACzDA,EAAatB,QAAQ,QAAQ,GAC/B,MAAM,IAAIC,EACRhH,GACA,0BAA0BqI,OAAAA,GAAAA;IAK9B,OAAO,IAAI6nB,GACTpF;qBACiB,MhB9Of,SAAqCziB;QACzC,OAAO,IAAI4Y,GAAUxa,GAAayB,aAAaG;KAD3C,CgB+OyBA;;;AA0DzB,SAAUiP,GACduH,GACA/X;SACGwpB,IAAAA,IAAAA,IAAAA,IAAAA,GAAAA,IAAAA,UAAAA,QAAAA,KAAAA,EAAAA,IAAAA,KAAAA,UAAAA;IAWH,IATAzR,IAAS0R,EAAmB1R;;;IAIH,MAArB4R,UAAUztB,WACZ8D,IAAOiH,GAAO2iB,MAEhBhoB,GAAyB,OAAO,QAAQ5B,IAEpC+X,aAAkBwN,IAAW;QAC/B,IAAMmE,IAAe/pB,GAAawB,WAAAA,MAAbxB,IAAawB,EAAAA,EAAWnB,KAASwpB,IAAAA;QAEtD,OADAxnB,GAAqB0nB,IACd,IAAIb,GACT9Q;yBACiB,MACjB,IAAI7W,GAAYwoB;;IAGlB,MACI3R,aAAkB8Q,MAClB9Q,aAAkBmR,KAEpB,MAAM,IAAIhpB,EACRhH,GACA;IAIJ,IAAMwwB,IAAe3R,EAAOiR,MAAMnrB,MAChC8B,GAAawB,iBAAbxB,IAAAA,EAAAA,EAAwBK,KAASwpB;IAGnC,OADAxnB,GAAqB0nB,IACd,IAAIb,GACT9Q,EAAOiM,WACPjM,aAAkBmR,KAAsBnR,EAAO+Q,YAAY,MAC3D,IAAI5nB,GAAYwoB;;;;;;;;;;GAaN,UAAAG,GACdrqB,GACAC;IAKA,OAHAD,IAAOiqB,EAAmBjqB,IAC1BC,IAAQgqB,EAAmBhqB,KAGxBD,aAAgBqpB,MACfrpB,aAAgB0pB,QACjBzpB,aAAiBopB,MAAqBppB,aAAiBypB,OAGtD1pB,EAAKwkB,cAAcvkB,EAAMukB,aACzBxkB,EAAKQ,SAASP,EAAMO,QACpBR,EAAKspB,cAAcrpB,EAAMqpB;;;;;;;;;;;;AAef,SAAAgB,GAActqB,GAAgBC;IAI5C,OAHAD,IAAOiqB,EAAmBjqB,IAC1BC,IAAQgqB,EAAmBhqB,IAEvBD,aAAgB4pB,MAAS3pB,aAAiB2pB,MAE1C5pB,EAAKwkB,cAAcvkB,EAAMukB,ahBxKf,SAAYxkB,GAAaC;QACvC,OD7Oc,SAAaD,GAAcC;YACzC,IAAID,EAAKxB,UAAUyB,EAAMzB,OACvB,QAAO;YAGT,IAAIwB,EAAKsa,QAAQ5d,WAAWuD,EAAMqa,QAAQ5d,QACxC,QAAO;YAGT,KAAK,IAAI4C,IAAI,GAAGA,IAAIU,EAAKsa,QAAQ5d,QAAQ4C,KACvC,KAAK6T,GAAcnT,EAAKsa,QAAQhb,IAAIW,EAAMqa,QAAQhb,KAChD,QAAO;YAIX,IAAIU,EAAKwR,QAAQ9U,WAAWuD,EAAMuR,QAAQ9U,QACxC,QAAO;YAGT,KAAK,IAAI4C,IAAI,GAAGA,IAAIU,EAAKwR,QAAQ9U,QAAQ4C,KACvC,KAAK4S,GAAalS,EAAKwR,QAAQlS,IAAIW,EAAMuR,QAAQlS,KAC/C,QAAO;YAIX,OAAIU,EAAK6B,oBAAoB5B,EAAM4B,qBAI9B7B,EAAKQ,KAAKrJ,QAAQ8I,EAAMO,WAIxByP,GAAYjQ,EAAKua,SAASta,EAAMsa,YAI9BtK,GAAYjQ,EAAKwa,OAAOva,EAAMua;SArCvB,CC8OCmB,GAAc3b,IAAO2b,GAAc1b,OAChDD,EAAK6a,cAAc5a,EAAM4a;KgBsKvB0P,CAAYvqB,EAAKipB,QAAQhpB,EAAMgpB,WAC/BjpB,EAAKspB,cAAcrpB,EAAMqpB;;;;;;;;;;;;;;;;;;;;;;AChjBlBkB,IAAAA,mBAAAA;;IAIX1zB,SAAAA,EAAY2zB;QACVzzB,KAAK0zB,cAAcD;;;;;;;kBASGhiB,EAAAA,mBAAxB9K,SAAwB8K;QACtB;YACE,OAAO,IAAI+hB,EAAMjiB,GAAWqC,iBAAiBnC;UAC7C,OAAOvP;YACP,MAAM,IAAIwH,EACRhH,GACA,kDAAkDR;;;;;;;;IAUlCyP,EAAAA,iBAAtBhL,SAAsBgL;QACpB,OAAO,IAAI6hB,EAAMjiB,GAAWsC,eAAelC;;;;;;;IAQ7CQ,uBAAAA;QACE,OAAOnS,KAAK0zB,YAAYvhB;;;;;;;IAQ1BG,2BAAAA;QACE,OAAOtS,KAAK0zB,YAAYphB;;;;;;;IAQ1BvP,uBAAAA;QACE,OAAO,mBAAmB/C,KAAKmS,aAAa;;;;;;;;IAS9ChS,EAAAA,UAAAA,UAAAA,SAAQ0G;QACN,OAAO7G,KAAK0zB,YAAYvzB,QAAQ0G,EAAM6sB;;CApE7BF,ICQAzpB,mBAAAA;;;;;;;IAUXjK,SAAAA;aAAe6zB,IAAAA,IAAAA,IAAAA,IAAAA,GAAAA,IAAAA,UAAAA,QAAAA,KAAAA,EAAAA,KAAAA,UAAAA;QACb,KAAK,IAAIrrB,IAAI,GAAGA,IAAIqrB,EAAWjuB,UAAU4C,GACvC,IAA6B,MAAzBqrB,EAAWrrB,GAAG5C,QAChB,MAAM,IAAIgE,EACRhH,GACA;QAMN1C,KAAK4zB,gBAAgB,IAAIC,GAAkBF;;;;;;;kBAS7CxzB,EAAAA,UAAAA,UAAAA,SAAQ0G;QACN,OAAO7G,KAAK4zB,cAAczzB,QAAQ0G,EAAM+sB;;CA/B/B7pB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuCG+pB,SAAAA;IACd,OAAO,IAAI/pB,G5CnDoB;;;;;;;;;;;;;;;;;;;;;;G6CIXgqB,KAAAA;;;;;AAKpBj0B,SAAmBk0B;IAAAh0B,KAAWg0B,cAAXA;GCFRC,mBAAAA;;;;;;;IAYXn0B,SAAYmW,EAAAA,GAAkBC;QAC5B,KAAKge,SAASje,MAAaA,KAAY,MAAMA,IAAW,IACtD,MAAM,IAAIvM,EACRhH,GACA,4DAA4DuT;QAGhE,KAAKie,SAAShe,MAAcA,KAAa,OAAOA,IAAY,KAC1D,MAAM,IAAIxM,EACRhH,GACA,+DAA+DwT;QAInElW,KAAKm0B,OAAOle,GACZjW,KAAKo0B,QAAQle;;WAMXD,OAAAA,eAAAA,EAAAA,WAAAA,YAAAA;;;;QAAAA,KAAAA;YACF,OAAOjW,KAAKm0B;;;;QAMVje,OAAAA,eAAAA,EAAAA,WAAAA,aAAAA;;;;QAAAA,KAAAA;YACF,OAAOlW,KAAKo0B;;;;;;;;;;;IASdj0B,EAAAA,UAAAA,UAAAA,SAAQ0G;QACN,OAAO7G,KAAKm0B,SAASttB,EAAMstB,QAAQn0B,KAAKo0B,UAAUvtB,EAAMutB;;wEAI1D9f,qBAAAA;QACE,OAAO;YAAE2B,UAAUjW,KAAKm0B;YAAMje,WAAWlW,KAAKo0B;;;;;;;IAOhD/f,EAAAA,UAAAA,aAAAA,SAAWxN;QACT,OACEiK,GAAoB9Q,KAAKm0B,MAAMttB,EAAMstB,SACrCrjB,GAAoB9Q,KAAKo0B,OAAOvtB,EAAMutB;;CAlE/BH,IC6CPI,KAAuB,YAgBhBC,mBAAAA;IACXx0B,SAAAA,EACWma,GACAyM,GACAH;QAFAvmB,KAAIia,OAAJA,GACAja,KAAS0mB,YAATA,GACA1mB,KAAeumB,kBAAfA;;WAGXoF,EAAAA,UAAAA,aAAAA,SAAW9b,GAAkByW;QAC3B,OAAuB,SAAnBtmB,KAAK0mB,YACA,IAAIsF,GACTnc,GACA7P,KAAKia,MACLja,KAAK0mB,WACLJ,GACAtmB,KAAKumB,mBAGA,IAAIsF,GACThc,GACA7P,KAAKia,MACLqM,GACAtmB,KAAKumB;;CArBA+N,IA4BAC,mBAAAA;IACXz0B,SAAAA,EACWma;;IAEAyM,GACAH;QAHAvmB,KAAIia,OAAJA,GAEAja,KAAS0mB,YAATA,GACA1mB,KAAeumB,kBAAfA;;WAGXoF,EAAAA,UAAAA,aAAAA,SAAW9b,GAAkByW;QAC3B,OAAO,IAAI0F,GACTnc,GACA7P,KAAKia,MACLja,KAAK0mB,WACLJ,GACAtmB,KAAKumB;;CAdEgO;;;;;;;;;;;;;;;;;;;;;;;;GAwCb,UAASC,GAAQC;IACf,QAAQA;MACN,KAAA;;cACA,KAAA;;cACA,KAAA;QACE,QAAO;;MACT,KAA6B;MAC7B,KAAA;QACE,QAAO;;MACT;QACE,MA3IGtyB;;;;gEA2KHuyB,KAAAA,mBAAAA;;;;;;;;;;;;;;;;;;;IAqBJ50B,SACWmuB,EAAAA,GACAjoB,GACAgf,GACAyJ,GACTlI,GACAG;QALS1mB,KAAQiuB,WAARA,GACAjuB,KAAUgG,aAAVA,GACAhG,KAAAglB,IAAAA,GACAhlB,KAAyByuB,4BAAzBA;;;mBAMLlI,KACFvmB,KAAK20B,MAEP30B,KAAKumB,kBAAkBA,KAAmB,IAC1CvmB,KAAK0mB,YAAYA,KAAa;;WAG5Bld,OAAAA,eAAAA,EAAAA,WAAAA,QAAAA;QAAAA,KAAAA;YACF,OAAOxJ,KAAKiuB,SAASzkB;;;;QAGnBirB,OAAAA,eAAAA,EAAAA,WAAAA,MAAAA;QAAAA,KAAAA;YACF,OAAOz0B,KAAKiuB,SAASwG;;;;;0EAIvBG,EAAAA,UAAAA,KAAAA,SAAYC;QACV,OAAO,IAAIH,EACJvjB,OAAAwH,OAAAxH,OAAAwH,OAAA,IAAA3Y,KAAKiuB,WAAa4G,IACvB70B,KAAKgG,YACLhG,KAAKglB,GACLhlB,KAAKyuB,2BACLzuB,KAAKumB,iBACLvmB,KAAK0mB;OAIToO,EAAqB1b,UAAAA,KAArB0b,SAAqB1b;eACb2b,IAAqB,UAATjmB,IAAA9O,KAAKwJ,cAAI,MAAAsF,SAAA,IAAAA,EAAEzH,MAAM+R,IAC7B4b,IAAUh1B,KAAK40B,GAAY;YAAEprB,MAAMurB;YAAWE,KAAc;;QAElE,OADAD,EAAQE,GAAoB9b,IACrB4b;OAGTG,EAAyB/b,UAAAA,KAAzB+b,SAAyB/b;eACjB2b,IAAqB,UAATjmB,IAAA9O,KAAKwJ,cAAI,MAAAsF,SAAA,IAAAA,EAAEzH,MAAM+R,IAC7B4b,IAAUh1B,KAAK40B,GAAY;YAAEprB,MAAMurB;YAAWE,KAAc;;QAElE,OADAD,EAAQL,MACDK;OAGTI,EAAqBjtB,UAAAA,KAArBitB,SAAqBjtB;;;QAGnB,OAAOnI,KAAK40B,GAAY;YAAEprB,WAAMvC;YAAWguB,KAAc;;OAG3DI,EAAYC,UAAAA,KAAZD,SAAYC;QACV,OAAOD,GACLC,GACAt1B,KAAKiuB,SAASsH,YACdv1B,KAAKiuB,SAASuH,OAAAA,GACdx1B,KAAKwJ,MACLxJ,KAAKiuB,SAASwH;;mFAKlBC,EAAAA,UAAAA,WAAAA,SAAS3U;QACP,YAAA,MACE/gB,KAAK0mB,UAAU3P,MAAKqC,SAAAA;YAAS2H,OAAAA,EAAU1Y,WAAW+Q;oBAG5CnS,MAFNjH,KAAKumB,gBAAgBxP,MAAAA,SAAKgP;YACxBhF,OAAAA,EAAU1Y,WAAW0d,EAAU3M;;OAK7Bub,EAAAA,UAAAA,KAAAA;;;QAGN,IAAK30B,KAAKwJ,MAGV,KAAK,IAAIlB,IAAI,GAAGA,IAAItI,KAAKwJ,KAAK9D,QAAQ4C,KACpCtI,KAAKk1B,GAAoBl1B,KAAKwJ,KAAKtB,IAAII;OAInC4sB,EAAoBxtB,UAAAA,KAApBwtB,SAAoBxtB;QAC1B,IAAuB,MAAnBA,EAAQhC,QACV,MAAM1F,KAAKq1B,GAAY;QAEzB,IAAIb,GAAQx0B,KAAKy0B,OAAeJ,GAAqBrqB,KAAKtC,IACxD,MAAM1H,KAAKq1B,GAAY;;CAlHvBX,IA2HOiB,mBAAAA;IAGX71B,SAAAA,EACmBkG,GACAyoB,GACjBzJ;QAFiBhlB,KAAUgG,aAAVA,GACAhG,KAAyByuB,4BAAzBA,GAGjBzuB,KAAKglB,IAAaA,KAAcqE,GAAcrjB;;;WAIhD4vB,EACEnB,UAAAA,KADFmB,SACEnB,GACAc,GACAE,GACAD;QAEA,YAFAA,MAAAA,MAAAA,SAEO,IAAId,GACT;YACED,IAAAA;YACAc,YAAAA;YACAE,IAAAA;YACAjsB,MAAMqqB,GAAkBjpB;YACxBqqB,KAAc;YACdO,IAAAA;WAEFx1B,KAAKgG,YACLhG,KAAKglB,GACLhlB,KAAKyuB;;CA7BEkH;;;;;GAkCP,UAAUE,GAAkBrI;IAChC,IAAMS,IAAWT,EAAUU,mBACrBlJ,IAAaqE,GAAcmE,EAAUK;IAC3C,OAAO,IAAI8H,GACTnI,EAAUK,eACRI,EAASQ,2BACXzJ;;;6CAKY,UAAA8Q,GACdC,GACAR,GACAE,GACA7pB,GACA4pB,GACAzH;SAAAA,MAAAA,MAAAA,IAAsB;IAEtB,IAAMiH,IAAUe,EAAeH,GAC7B7H,EAAQiI,SAASjI,EAAQkI,cACtB,kCACA,6BACHV,GACAE,GACAD;IAEFU,GAAoB,uCAAuClB,GAASppB;IACpE,IAEI8a,GACAH,GAHE4P,IAAaC,GAAYxqB,GAAOopB;IAKtC,IAAIjH,EAAQiI,OACVtP,IAAY,IAAI9F,GAAUoU,EAAQtO,YAClCH,IAAkByO,EAAQzO,sBACrB,IAAIwH,EAAQkI,aAAa;QAG9B,KAFA,IAAMI,IAA2C,IAEjBtI,IAAAA,GAAAA,IAAAA,EAAQkI,aAARlI,IAAAA,EAAAA,QAAAA,KAAqB;YAAhD,IACGhN,IAAYuV,GAChBf,GAF4BxH,EAAAA,IAI5B0H;YAEF,KAAKT,EAAQU,SAAS3U,IACpB,MAAM,IAAIrX,EACRhH,GACA,UAAUqe,OAAAA,GAAAA;YAITwV,GAAkBF,GAAqBtV,MAC1CsV,EAAoB1uB,KAAKoZ;;QAI7B2F,IAAY,IAAI9F,GAAUyV,IAC1B9P,IAAkByO,EAAQzO,gBAAgB3c,QAAOmc,SAAAA;YAC/CW,OAAAA,EAAW1F,OAAO+E,EAAU3M;;WAG9BsN,IAAY,MACZH,IAAkByO,EAAQzO;IAG5B,OAAO,IAAI+N,GACT,IAAInT,GAAYgV,IAChBzP,GACAH;;;AAIE,IAAAiQ,mBAAA,SAAA5zB;IAAA,SAAA4zB;;;WAAoCzC,EAAAA,GAAAA,IACxC0C,EAAkBzB,UAAAA,oBAAlByB,SAAkBzB;QAChB,IAAsB,oCAAlBA,EAAQP,IAIL,MAAsB,kCAAlBO,EAAQP,KAMXO,EAAQK,GACZ,GAAGr1B,OAAAA,KAAKg0B,aAAAA,8DAKJgB,EAAQK,GACZ,UAAGr1B,KAAKg0B,aAAAA;;;gBAIZ,OAlBEgB,EAAQtO,UAAU/e,KAAKqtB,EAAQxrB,OAkB1B;OAGTrJ,EAAQ0G,UAAAA,UAAR1G,SAAQ0G;QACN,OAAOA,aAAiB6vB;;CA3BtB,CAAoC3C;;;;;;;;;;;;;;;;;GA+CjC4C,UAAAA,GACPC,GACA5B,GACAC;IAEA,OAAO,IAAIP,GACT;QACED,IAAmC;QACnCgB,IAAWT,EAAQ/G,SAASwH;QAC5BF,YAAYqB,EAAW5C;QACvBiB,IAAAA;OAEFD,EAAQhvB,YACRgvB,EAAQhQ,GACRgQ,EAAQvG;;;AAIN,IAAAoI,mBAAA,SAAAj0B;IAAA,SAAAi0B;;;WAA6C9C,EAAAA,GAAAA,IACjD0C,EAAkBzB,UAAAA,oBAAlByB,SAAkBzB;QAChB,OAAO,IAAIlP,GAAekP,EAAQxrB,MAAO,IAAI8iB;OAG/CnsB,EAAQ0G,UAAAA,UAAR1G,SAAQ0G;QACN,OAAOA,aAAiBiwB;;CANtB,CAA6C/C,KAU7CgD,mBAAA,SAAAn0B;IACJ9C,SAAYy1B,EAAAA,GAAqCyB;QAAjDl3B;gBACEgD,IAAAA,EAAAA,KAAAA,MAAMyyB,MAAAA,MADyCyB,KAAAA;;WADLjD,EAAAA,GAAAA,IAK5C0C,EAAkBzB,UAAAA,oBAAlByB,SAAkBzB;QAChB,IAAMiC,IAAeN,GACnB32B,MACAg1B;wBAGIkC,IAAiBl3B,KAAKg3B,GAAU51B,KACpC+1B,SAAAA;YAAWC,OAAAA,GAAUD,GAASF;aAE1BI,IAAa,IAAI7K,GAA6B0K;QACpD,OAAO,IAAIpR,GAAekP,EAAQxrB,MAAO6tB;OAG3Cl3B,EAAQ0G,UAAAA,UAAR1G,SAAQ0G;;QAEN,OAAO7G,SAAS6G;;CApBd,CAAwCktB,KAwBxCuD,mBAAA,SAAA10B;IACJ9C,SAAYy1B,EAAAA,GAA6ByB;QAAzCl3B;gBACEgD,IAAAA,EAAAA,KAAAA,MAAMyyB,MAAAA,MADiCyB,KAAAA;;WADIjD,EAAAA,GAAAA,IAK7C0C,EAAkBzB,UAAAA,oBAAlByB,SAAkBzB;QAChB,IAAMiC,IAAeN,GACnB32B,MACAg1B;wBAGIkC,IAAiBl3B,KAAKg3B,GAAU51B,KACpC+1B,SAAAA;YAAWC,OAAAA,GAAUD,GAASF;aAE1BI,IAAa,IAAI3K,GAA8BwK;QACrD,OAAO,IAAIpR,GAAekP,EAAQxrB,MAAO6tB;OAG3Cl3B,EAAQ0G,UAAAA,UAAR1G,SAAQ0G;;QAEN,OAAO7G,SAAS6G;;CApBd,CAAyCktB,KAwBzCwD,mBAAA,SAAA30B;IACJ9C,SAAYy1B,EAAAA,GAAqCiC;QAAjD13B;gBACEgD,IAAAA,EAAAA,KAAAA,MAAMyyB,MAAAA,MADyCiC,KAAAA;;WADCzD,EAAAA,GAAAA,IAKlD0C,EAAkBzB,UAAAA,oBAAlByB,SAAkBzB;QAChB,IAAMyC,IAAmB,IAAI7K,GAC3BoI,EAAQhQ,GACRD,GAASiQ,EAAQhQ,GAAYhlB,KAAKw3B;QAEpC,OAAO,IAAI1R,GAAekP,EAAQxrB,MAAOiuB;OAG3Ct3B,EAAQ0G,UAAAA,UAAR1G,SAAQ0G;;QAEN,OAAO7G,SAAS6G;;CAfd,CAA8CktB;;gDAoBpC2D,SAAAA,GACd3B,GACAR,GACAE,GACA7pB;IAEA,IAAMopB,IAAUe,EAAeH,GAAAA,gCAE7BL,GACAE;IAEFS,GAAoB,uCAAuClB,GAASppB;IAEpE,IAAM+rB,IAAsC,IACtCxB,IAAahV,GAAYmB;IAC/B7a,GAAQmE,IAAAA,SAAyBiE,GAAK9N;QACpC,IAAMyH,IAAOouB,GAAgCrC,GAAY1lB,GAAK4lB;;;gBAI9D1zB,IAAQkxB,EAAmBlxB;QAE3B,IAAM81B,IAAe7C,EAAQG,GAAyB3rB;QACtD,IAAIzH,aAAiB20B;;QAEnBiB,EAAehwB,KAAK6B,SACf;YACL,IAAMsuB,IAAcV,GAAUr1B,GAAO81B;YAClB,QAAfC,MACFH,EAAehwB,KAAK6B,IACpB2sB,EAAWvyB,IAAI4F,GAAMsuB;;;IAK3B,IAAMC,IAAO,IAAInX,GAAU+W;IAC3B,OAAO,IAAIpD,GAAiB4B,GAAY4B,GAAM/C,EAAQzO;;;8DAIxC,UAAAyR,GACdjC,GACAR,GACAE,GACArc,GACArX,GACAk2B;IAEA,IAAMjD,IAAUe,EAAeH,GAE7BL,gCAAAA,GACAE,IAEIxd,IAAO,EAACqe,GAAsBf,GAAYnc,GAAOqc,MACjDhf,IAAS,EAAC1U;IAEhB,IAAIk2B,EAAoBvyB,SAAS,KAAM,GACrC,MAAM,IAAIgE,EACRhH,GACA,YAAY6yB,OAAAA,GAAAA;IAKhB,KAAK,IAAIjtB,IAAI,GAAGA,IAAI2vB,EAAoBvyB,QAAQ4C,KAAK,GACnD2P,EAAKtQ,KACH2uB,GACEf,GACA0C,EAAoB3vB,MAGxBmO,EAAO9O,KAAKswB,EAAoB3vB,IAAI;;;IAQtC,KALA,IAAMqvB,IAAsC,IACtCxB,IAAahV,GAAYmB,SAItBha,IAAI2P,EAAKvS,SAAS,GAAG4C,KAAK,KAAKA,GACtC,KAAKiuB,GAAkBoB,GAAgB1f,EAAK3P,KAAK;QAC/C,IAAMkB,IAAOyO,EAAK3P,IACdvG,IAAQ0U,EAAOnO;;;QAInBvG,IAAQkxB,EAAmBlxB;QAE3B,IAAM81B,IAAe7C,EAAQG,GAAyB3rB;QACtD,IAAIzH,aAAiB20B;;QAEnBiB,EAAehwB,KAAK6B,SACf;YACL,IAAMsuB,IAAcV,GAAUr1B,GAAO81B;YAClB,QAAfC,MACFH,EAAehwB,KAAK6B,IACpB2sB,EAAWvyB,IAAI4F,GAAMsuB;;;IAM7B,IAAMC,IAAO,IAAInX,GAAU+W;IAC3B,OAAO,IAAIpD,GAAiB4B,GAAY4B,GAAM/C,EAAQzO;;;;;;;;;GAUlD,UAAU2R,GACdnC,GACAR,GACA3pB,GACAusB;IAYA,YAZAA,MAAAA,MAAAA,SAMef,GAAUxrB,GAJTmqB,EAAeH,GAC7BuC,2CAA4C,kCAC5C5C;;;;;;;;;;;GAoBY,UAAA6B,GACdxrB,GACAopB;IAMA,IAAIoD;;;IAFJxsB,IAAQqnB,EAAmBrnB,KAIzB,OADAsqB,GAAoB,4BAA4BlB,GAASppB,IAClDwqB,GAAYxqB,GAAOopB;IACrB,IAAIppB,aAAiBmoB;;;;;;;;;;IAO1B,OAgFJ,SACEhyB,GACAizB;;QAGA,KAAKR,GAAQQ,EAAQP,KACnB,MAAMO,EAAQK,GACZ,GAAA7zB,OAAGO,EAAMiyB,aAAAA;QAGb,KAAKgB,EAAQxrB,MACX,MAAMwrB,EAAQK,GACZ,GAAA7zB,OAAGO,EAAMiyB,aAAAA;QAIb,IAAM3H,IAAiBtqB,EAAM00B,kBAAkBzB;QAC3C3I,KACF2I,EAAQzO,gBAAgB5e,KAAK0kB;KAlBjC,CAjF4BzgB,GAAOopB,IACxB;IACF,SAAc/tB,MAAV2E,KAAuBopB,EAAQvG;;;;IAIxC,OAAO;IAQP;;;IAJIuG,EAAQxrB,QACVwrB,EAAQtO,UAAU/e,KAAKqtB,EAAQxrB,OAG7BoC,aAAiBE,OAAO;;;;;;;QAO1B,IACEkpB,EAAQ/G,SAASgH,MACC,yCAAlBD,EAAQP,IAER,MAAMO,EAAQK,GAAY;QAE5B,OA+BN,SAAoB1jB,GAAkBqjB;YAGpC,KAFA,IAAMve,IAAuB,IACzB4hB,IAAa,UACG1mB,IAAAA,GAAAA,IAAO2mB,EAAA5yB,QAAPiM,KAAO;gBAAtB,IACC4mB,IAAcnB,SAEhBpC,EAAQI,GAAqBiD;gBAEZ,QAAfE;;;gBAGFA,IAAc;oBAAExc,WAAW;oBAE7BtF,EAAO9O,KAAK4wB,IACZF;;YAEF,OAAO;gBAAE7hB,YAAY;oBAAEC,QAAAA;;;SAhBzB,CA/BwB7K,GAAoBopB;;IAEtC,OA+EN,SACEjzB,GACAizB;QAIA,IAAc,UAFdjzB,IAAQkxB,EAAmBlxB,KAGzB,OAAO;YAAEga,WAAW;;QACf,IAAqB,mBAAVha,GAChB,OAAOgjB,GAASiQ,EAAQhQ,GAAYjjB;QAC/B,IAAqB,oBAAVA,GAChB,OAAO;YAAE4T,cAAc5T;;QAClB,IAAqB,mBAAVA,GAChB,OAAO;YAAEgT,aAAahT;;QACjB,IAAIA,aAAiBuR,MAAM;YAChC,IAAM+I,IAAYvI,GAAU0kB,SAASz2B;YACrC,OAAO;gBACLuT,gBAAgBiH,GAAYyY,EAAQhQ,GAAY3I;;;QAE7C,IAAIta,aAAiB+R,IAAW;;;;YAIrC,IAAMuI,IAAY,IAAIvI,GACpB/R,EAAMwR,SACiC,MAAvCzK,KAAKyH,MAAMxO,EAAMgS,cAAc;YAEjC,OAAO;gBACLuB,gBAAgBiH,GAAYyY,EAAQhQ,GAAY3I;;;QAE7C,IAAIta,aAAiBkyB,IAC1B,OAAO;YACLje,eAAe;gBACbC,UAAUlU,EAAMkU;gBAChBC,WAAWnU,EAAMmU;;;QAGhB,IAAInU,aAAiByxB,IAC1B,OAAO;YAAE1d,YAAYsR,GAAQ4N,EAAQhQ,GAAYjjB,EAAM2xB;;QAClD,IAAI3xB,aAAiBswB,IAAmB;YAC7C,IAAMoG,IAASzD,EAAQhvB,YACjB0yB,IAAU32B,EAAMyrB,UAAUK;YAChC,KAAK6K,EAAQv4B,QAAQs4B,IACnB,MAAMzD,EAAQK,GAEV,6CAAGqD,EAAQjyB,WAAaiyB,KAAAA,OAAAA,EAAQhyB,UAChB+xB,gCAAAA,OAAAA,EAAOhyB,uBAAagyB,EAAO/xB;YAGjD,OAAO;gBACLqP,gBAAgByR,GACdzlB,EAAMyrB,UAAUK,eAAemH,EAAQhvB,YACvCjE,EAAMwwB,KAAK/oB;;;QAIf,MAAMwrB,EAAQK,GACZ,4BAAA7zB,OAA4BmK,GAAiB5J;KAzDnD,CA/E8B6J,GAAOopB;;;AAKrC,SAASoB,GACPp1B,GACAg0B;IAEA,IAAMngB,IAA2B;IAiBjC,OtCpuBI,SAAqB7T;QAKzB,KAAK,IAAM6O,KAAO7O,GAChB,IAAImQ,OAAOC,UAAUC,eAAeC,KAAKtQ,GAAK6O,IAC5C,QAAO;QAGX,QAAO;KAVH,CsCqtBQ7O;;;IAGNg0B,EAAQxrB,QAAQwrB,EAAQxrB,KAAK9D,SAAS,KACxCsvB,EAAQtO,UAAU/e,KAAKqtB,EAAQxrB,QAGjC/B,GAAQzG,IAAK,SAAC6O,GAAagJ;QACzB,IAAMif,IAAcV,GAAUve,GAAKmc,EAAQF,GAAqBjlB;QAC7C,QAAfioB,MACFjjB,EAAOhF,KAAOioB;SAKb;QAAEljB,UAAU;YAAEC,QAAAA;;;;;AA0HvB,SAASujB,GAAoBxsB;IAC3B,SACmB,mBAAVA,KACG,SAAVA,KACEA,aAAiBE,SACjBF,aAAiB0H,QACjB1H,aAAiBkI,MACjBlI,aAAiBqoB,MACjBroB,aAAiB4nB,MACjB5nB,aAAiBymB,MACjBzmB,aAAiBmoB;;;AAIvB,SAASmC,GACP7zB,GACA2yB,GACAppB;IAEA,KAAKwsB,GAAoBxsB,O7C/zBrB,SAAwBA;QAC5B,OACmB,mBAAVA,KACG,SAAVA,MACCuF,OAAOwnB,eAAe/sB,OAAWuF,OAAOC,aACN,SAAjCD,OAAOwnB,eAAe/sB;KALtB,C6C+zB8CA,IAAQ;QACxD,IAAMM,IAAcP,GAAiBC;QACrC,MAAoB,gBAAhBM,IAEI8oB,EAAQK,GAAYhzB,IAAU,sBAE9B2yB,EAAQK,GAAYhzB,IAAU,MAAM6J;;;;;;GAQhCoqB,UAAAA,GACdf,GACA/rB,GACAisB;IAMA;;;KAFAjsB,IAAOypB,EAAmBzpB,eAENO,IAClB,OAAOP,EAAKoqB;IACP,IAAoB,mBAATpqB,GAChB,OAAOouB,GAAgCrC,GAAY/rB;IAGnD,MAAM6rB,GADU,mDAGdE;yBACoB;wBAEpBE;;;;;GAQAmD,KAAAA,KAAsB,IAAIhmB,OAAO;;;;;;;;;;GAWvBglB,UAAAA,GACdrC,GACA/rB,GACAisB;IAGA,IADcjsB,EAAKqvB,OAAOD,OACb,GACX,MAAMvD,GACJ,uBAAA7zB,OAAuBgI,GAEvB+rB,yDAAAA;yBACoB;wBAEpBE;IAIJ;QACE,QAAO,KAAI1rB,GAAAA,KAAAA,MAAAA,IAAaP,EAAAA,OAAAA,KAAAA,EAAKG,MAAM,OAAMiqB,MAAAA;MACzC,OAAO1xB;QACP,MAAMmzB,GACJ,uBAAA7zB,OAAuBgI,GAEvB+rB,8EAAAA;6BACoB;4BAEpBE;;;;AAKN,SAASJ,GACPC,GACAC,GACAC,GACAhsB,GACAisB;IAEA,IAAMqD,IAAUtvB,MAASA,EAAKpB,WACxB2wB,eAActD,GAChBpzB,IAAU,YAAYkzB,OAAAA;IACtBC,MACFnzB,KAAW,2BAEbA,KAAW;IAEX,IAAI6J,IAAc;IAalB,QAZI4sB,KAAWC,OACb7sB,KAAe,WAEX4sB,MACF5sB,KAAe,aAAa1C,OAAAA,KAE1BuvB,MACF7sB,KAAe,gBAAgBupB,OAAAA;IAEjCvpB,KAAe,MAGV,IAAIxC,EACThH,GACAL,IAAUizB,IAASppB;;;;AAKvB,SAASqqB,GACP1f,GACAC;IAEA,OAAOD,EAAS6E,MAAK1E,SAAAA;QAAKA,OAAAA,EAAE7W,QAAQ2W;;;;;;;;;;;;;;;;;;;;;;;;;;;;GCz5BzBkiB,KAAAA,mBAAAA;;;;;;IAOXl5B,SACSm5B,EAAAA,GACAC,GACA3G,GACA4G,GACAC;QAJAp5B,KAAUi5B,aAAVA,GACAj5B,KAAek5B,kBAAfA,GACAl5B,KAAIuyB,OAAJA,GACAvyB,KAASm5B,YAATA;QACAn5B,KAAUo5B,aAAVA;;WAIL3G,OAAAA,eAAAA,EAAAA,WAAAA,MAAAA;mFAAAA,KAAAA;YACF,OAAOzyB,KAAKuyB,KAAK/oB,KAAKvB;;;;QAMpBoxB,OAAAA,eAAAA,EAAAA,WAAAA,OAAAA;;;;QAAAA,KAAAA;YACF,OAAO,IAAIhH,GACTryB,KAAKi5B,YACLj5B,KAAKo5B,YACLp5B,KAAKuyB;;;;;;;;;;IASTrM,qBAAAA;QACE,OAA0B,SAAnBlmB,KAAKm5B;;;;;;;;;IAUdlf,mBAAAA;QACE,IAAKja,KAAKm5B,WAEH;YAAA,IAAIn5B,KAAKo5B,YAAY;;;gBAG1B,IAAME,IAAW,IAAIC,GACnBv5B,KAAKi5B,YACLj5B,KAAKk5B,iBACLl5B,KAAKuyB,MACLvyB,KAAKm5B;iCACY;gBAEnB,OAAOn5B,KAAKo5B,WAAWI,cAAcF;;YAErC,OAAOt5B,KAAKk5B,gBAAgB9G,aAAapyB,KAAKm5B,UAAUlf,KAAKlY;;;;;;;;;;;;;;IAejEmG,EAAI6Y,UAAAA,MAAJ7Y,SAAI6Y;QACF,IAAI/gB,KAAKm5B,WAAW;YAClB,IAAMp3B,IAAQ/B,KAAKm5B,UAAUlf,KAAKb,MAChCkd,GAAsB,wBAAwBvV;YAEhD,IAAc,SAAVhf,GACF,OAAO/B,KAAKk5B,gBAAgB9G,aAAarwB;;;CAnFpCi3B,IAqGPS,mBAAA,SAAA72B;IAAA,SAAA62B;;;;;;;;kBAEIT,EAAAA,GAAAA,IAOR/e,EAAAA,UAAAA,OAAAA;QACE,OAAOnX,EAAAA,UAAMmX,KAAAA,KAAAA;;CAVX,CAEI+e,KAmBGU,mBAAAA;;IAQX55B,SACEmyB,EAAAA,GACS0H;QAAA35B,KAAK25B,QAALA,GAET35B,KAAKikB,QAAQgO;;WAIXhF,OAAAA,eAAAA,EAAAA,WAAAA,QAAAA;qEAAAA,KAAAA;YACF,OAAWjtB,EAAAA,IAAAA,KAAK25B,QAAAA;;;;QAId7xB,OAAAA,eAAAA,EAAAA,WAAAA,QAAAA;+DAAAA,KAAAA;YACF,OAAO9H,KAAKitB,KAAKvnB;;;;QAIf4c,OAAAA,eAAAA,EAAAA,WAAAA,SAAAA;sEAAAA,KAAAA;YACF,OAA4B,MAArBtiB,KAAKitB,KAAKvnB;;;;;;;;;;;;IAUnB+B,EAAAA,UAAAA,UAAAA,SACEmyB,GACAC;QAEA75B,KAAK25B,MAAMlyB,QAAQmyB,GAAUC;;CAzCpBH;;;;;;;;;;;;;;;;;;;;AAoDG,SAAAI,GACd9wB,GACAC;IAKA,OAHAD,IAAOiqB,EAAmBjqB,IAC1BC,IAAQgqB,EAAmBhqB,IAEvBD,aAAgBgwB,MAAoB/vB,aAAiB+vB,KAErDhwB,EAAKiwB,eAAehwB,EAAMgwB,cAC1BjwB,EAAKupB,KAAKpyB,QAAQ8I,EAAMspB,UACJ,SAAnBvpB,EAAKmwB,YACkB,SAApBlwB,EAAMkwB,YACNnwB,EAAKmwB,UAAUh5B,QAAQ8I,EAAMkwB,eACjCnwB,EAAKowB,eAAenwB,EAAMmwB,aAEnBpwB,aAAgB0wB,MAAiBzwB,aAAiBywB,MAEzDpG,GAAWtqB,EAAKib,OAAOhb,EAAMgb,UAC7BlT,GAAY/H,EAAKikB,MAAMhkB,EAAMgkB,MAAM6M;;;;;;AAUzB,SAAAxD,GACdf,GACAwE;IAEA,OAAmB,mBAARA,IACFnC,GAAgCrC,GAAYwE,KAC1CA,aAAehwB,KACjBgwB,EAAInG,gBAEJmG,EAAI9tB,UAAU2nB;;;;;;;;;;;;;;;;;;;;;;GCvPHoG,KAAAA,KAAAA,eAgBhBC,mBAAA,SAAAr3B;IAAA,SAAAq3B;;;IAAwCD,OAAAA,EAAAA,GAAAA,IAAAA;CAAxC,CAAwCA;;;;;;;;;GA+CxC,UAAU/V,GACdA,GACAiW;SACGC,IAAAA,IAAAA,IAAAA,IAAAA,GAAAA,IAAAA,UAAAA,QAAAA,KAAAA,EAAAA,IAAAA,KAAAA,UAAAA;IAIH,IAAIC,IAA0C;IAE1CF,aAA2BF,MAC7BI,EAAiBzyB,KAAKuyB,IAoiC1B,SACEA;QAEA,IAAMG,IAAuBH,EAAgBtwB,iBAC3CA;YAAUA,OAAAA,aAAkB0wB;YAC5B50B,QACI60B,IAAmBL,EAAgBtwB,QACvCA,SAAAA;YAAUA,OAAAA,aAAkB4wB;YAC5B90B;QAEF,IACE20B,IAAuB,KACtBA,IAAuB,KAAKE,IAAmB,GAEhD,MAAM,IAAI7wB,EACRhH,GACA;KAhBN,CAjiCE03B,IAAmBA,EAAiB54B,OAAO24B;IAI3C,KAAyBC,WAAAA,IAAAA,GAAAA,IAAAA,EAAAA,QAAAA,KACvBnW;QADG,IAAMwW,IAAAA,EAAAA;QACTxW,IAAQwW,EAAWC,OAAOzW;;IAE5B,OAAOA;;;;;;;;;GAUH,KAAA0W,mBAAA,SAAA/3B;;;;IAOJ9C,SAAAA,EACmB86B,GACTC,GACAC;QAHVh7B;gBAKEgD,IAAAA,gBAJiB9C,MAAM46B,SAANA,GACT56B,EAAG66B,MAAHA,GACA76B,EAAM86B,SAANA;;QARD96B,EAAIyD,OAAG;;WAF8Bs3B,EAAAA,GAAAA,IAe9Cp0B,EAAAA,UAAAA,SACEi0B,GACAC,GACAC;QAEA,OAAO,IAAIN,EAA2BI,GAAQC,GAAKC;OAGrDJ,EAAUzW,UAAAA,SAAVyW,SAAUzW;QACR,IAAMra,IAAS5J,KAAKg7B,OAAO/W;QAE3B,OADAgX,GAAuBhX,EAAMgO,QAAQroB,IAC9B,IAAIgpB,GACT3O,EAAMuJ,WACNvJ,EAAMqO,WACNzN,GAAqBZ,EAAMgO,QAAQroB;OAIvCoxB,EAAU/W,UAAAA,SAAV+W,SAAU/W;QACR,IAAMiX,IAASrF,GAAkB5R,EAAMuJ,YACjC5jB,IA0jBM,SACdqa,GACAsR,GACA4F,GACAn1B,GACA+a,GACA1H,GACAtX;YAEA,IAAI60B;YACJ,IAAI7V,EAAU3W,cAAc;gBAC1B,IAAM,mDAAFiP,KAAkCA,2DAAAA,GACpC,MAAM,IAAI3P,EACRhH,GACA,qCAAqC2W,OAAAA,GAAAA;gBAElC,IAAM,2BAAFA,wCAAsBA,GAAwB;oBACvD+hB,GAAkCr5B,GAAOsX;oBAEzC,KADA,IAAMgiB,IAA8B,WACXt5B,IAAAA,GAAAA,IAAAA,EAAAA,QAAAA,KAAAA;wBAApB,IAAMyU,IAAczU,EAAAA;wBACvBs5B,EAAc1zB,KAAK2zB,GAAqBt1B,GAAYie,GAAOzN;;oBAE7DogB,IAAa;wBAAEpgB,YAAY;4BAAEC,QAAQ4kB;;;uBAErCzE,IAAa0E,GAAqBt1B,GAAYie,GAAOliB;mBAInC,2BAAlBsX,KACsB,mCAAtBA,KACAA,2DAAAA,KAEA+hB,GAAkCr5B,GAAOsX;YAE3Cud,IAAasB,GACXiD,GA3lBA,SA6lBAp5B;+BACqB,2BAAFsX,KAAwB,mCAAFA;YAI7C,OADeO,GAAY0O,OAAOvH,GAAW1H,GAAIud;SAzCnC,CAzjBV3S,EAAMgO,QACN,GACAiJ,GACAjX,EAAMuJ,UAAUK,aAChB7tB,KAAK46B,QACL56B,KAAK66B,KACL76B,KAAK86B;QAEP,OAAOlxB;;CA5CL,CAA0CmxB;;;;;;;;;;;;GA4EhC3S,UAAAA,GACdrH,GACAwa,GACAx5B;IAEA,IAAMsX,IAAKkiB,GACLniB,IAAQkd,GAAsB,SAASvV;IAC7C,OAAOyZ,GAA2BgB,QAAQpiB,GAAOC,GAAItX;;;;;;;;;;;GAYjD,KAAA05B,mBAAA,SAAA74B;;;;IAIJ9C,SAAAA;;IAEW2D,GACQi4B;QAHnB57B;gBAKEgD,IAAAA,EAAAA,KAAAA,SAAAA,MAHaW,OAAJA,GACQzD,EAAiB07B,oBAAjBA;;WAP+B1B,EAAAA,GAAAA,IAYlDrzB,EAAAA,UAAAA,SACElD,GACAi4B;QAEA,OAAO,IAAIpB,EAA+B72B,GAAMi4B;OAGlDV,EAAU/W,UAAAA,SAAV+W,SAAU/W;QACR,IAAM0X,IAAgB37B,KAAK07B,kBACxBt6B,KAAAA,SAAI84B;YACIA,OAAAA,EAAgBc,OAAO/W;YAE/Bra,QAAOgyB,SAAAA;YAAgBA,OAAAA,EAAavhB,aAAa3U,SAAS;;QAE7D,OAA6B,MAAzBi2B,EAAcj2B,SACTi2B,EAAc,KAGhBjhB,GAAgB4N,OAAOqT,GAAe37B,KAAK67B;OAGpDnB,EAAUzW,UAAAA,SAAVyW,SAAUzW;QACR,IAAM2X,IAAe57B,KAAKg7B,OAAO/W;QACjC,OAAyC,MAArC2X,EAAavhB,aAAa3U,SAGrBue,KAw0Bb,SAA2BA,GAAsBra;YAG/C,KAFA,IAAIkyB,IAAY7X,UAEQ8X,IADLnyB,EAAOwQ,uBACF2hB,IAAAA,EAAAA,QAAAA,KACtBd;gBADG,IAAMe;gBACTf,GAAuBa,GAAWE,IAClCF,IAAYjX,GAAqBiX,GAAWE;;SALhD,CAt0BsB/X,EAAMgO,QAAQ2J,IAEzB,IAAIhJ,GACT3O,EAAMuJ,WACNvJ,EAAMqO,WACNzN,GAAqBZ,EAAMgO,QAAQ2J;OAIvCK,EAAAA,UAAAA,uBAAAA;QACE,OAAOj8B,KAAK07B;OAGdG,EAAAA,UAAAA,eAAAA;QACE,OAAqB,UAAd77B,KAAKyD,OAAgB,oCAAwB;;CAtDlD,CAA8Cu2B;;;;;;;;;;;;GAgGpC,UAAAkC;SACX9B,IAAAA,IAAAA,IAAAA,IAAAA,GAAAA,IAAAA,UAAAA,QAAAA,KAAAA,EAAAA,KAAAA,UAAAA;;QAOH,OAJAA,EAAiB3yB,SAAQyyB,SAAAA;QACvBiC,OAAAA,GAA8B,MAAMjC;SAG/BI,GAA+BkB,QAEpC,kCAAApB;;;;;;;;;;;;;;AAeY,SAAAgC;SACXhC,IAAAA,IAAAA,IAAAA,IAAAA,GAAAA,IAAAA,UAAAA,QAAAA,KAAAA,EAAAA,KAAAA,UAAAA;;QAOH,OAJAA,EAAiB3yB,SAAQyyB,SAAAA;QACvBiC,OAAAA,GAA8B,OAAOjC;SAGhCI,GAA+BkB,QAEpC,oCAAApB;;;;;;;;;;;;AAaE,IAAAiC,mBAAA,SAAAz5B;;;;IAOJ9C,SACmB86B,EAAAA,GACT0B;QAFVx8B;gBAIEgD,IAAAA,EAAAA,KAAAA,SAAAA,MAHuB83B,SAANA,GACT56B,EAAUs8B,aAAVA;;QAPDt8B,EAAIyD,OAAG;;WAF0Bs3B,EAAAA,GAAAA,IAc1Cp0B,EAAAA,UAAAA,SACEi0B,GACA0B;QAEA,OAAO,IAAIC,EAAuB3B,GAAQ0B;OAG5C5B,EAAUzW,UAAAA,SAAVyW,SAAUzW;QACR,IAAMX,IAAAA,SAsYRW,GACAlD,GACA0H;YAEA,IAAsB,SAAlBxE,EAAMV,SACR,MAAM,IAAI7Z,EACRhH,GACA;YAIJ,IAAoB,SAAhBuhB,EAAMT,OACR,MAAM,IAAI9Z,EACRhH,GACA;YAIJ,IAAM4gB,IAAU,IAAIrH,GAAQ8E,GAAW0H;YAEvC,OAuUF,SAA4BxE,GAAsBX;gBAChD,IAAoC,SAAhCU,GAAqBC,IAAiB;;oBAExC,IAAMK,IAAkBJ,GAAyBD;oBACzB,SAApBK,KACFkY,GAAkCvY,GAAOK,GAAiBhB,EAAQlK;;aALxE,CAxUqB6K,GAAOX,IACnBA;SA1ZCA,CAA0BW,EAAMgO,QAAQjyB,KAAK46B,QAAQ56B,KAAKs8B;QAChE,OAAO,IAAI1J,GACT3O,EAAMuJ,WACNvJ,EAAMqO,WvBlGI,SAAsBrO,GAAcX;;YAMlD,IAAMmZ,IAAaxY,EAAML,gBAAgBpiB,OAAO,EAAC8hB;YACjD,OAAO,IAAIK,GACTM,EAAMza,MACNya,EAAMpZ,iBACN4xB,GACAxY,EAAMzJ,QAAQjT,SACd0c,EAAMzc,OACNyc,EAAMJ,WACNI,EAAMV,SACNU,EAAMT;SAfM,CuBmGYS,EAAMgO,QAAQ3O;;CA1BpC,CAAsCyX;;;;;;;;;;;;;GAiD5BzX,UAAAA,GACdvC,GACA2b;SAAAA,MAAAA,MAAAA,IAAiC;IAEjC,IAAMjU,IAAYiU,GACZlzB,IAAO8sB,GAAsB,WAAWvV;IAC9C,OAAOwb,GAAuBf,QAAQhyB,GAAMif;;;;;;;;;GAUxC,KAAAkU,mBAAA,SAAA/5B;;;;IAIJ9C,SAAAA;;IAEW2D,GACQm5B,GACAC;QAJnB/8B;gBAMEgD,IAAAA,gBAJS9C,MAAIyD,OAAJA,GACQzD,EAAM48B,SAANA,GACA58B,EAAU68B,aAAVA;;WARqB9B,EAAAA,GAAAA,IAaxCp0B,EAAAA,UAAAA,SACElD,GACAm5B,GACAC;QAEA,OAAO,IAAIC,EAAqBr5B,GAAMm5B,GAAQC;OAGhDnC,EAAUzW,UAAAA,SAAVyW,SAAUzW;QACR,OAAO,IAAI2O,GACT3O,EAAMuJ,WACNvJ,EAAMqO,WAAAA,SvB9IVrO,GACAzc,GACAqc;YAEA,OAAO,IAAIF,GACTM,EAAMza,MACNya,EAAMpZ,iBACNoZ,EAAML,gBAAgBrc,SACtB0c,EAAMzJ,QAAQjT,SACdC,GACAqc,GACAI,EAAMV,SACNU,EAAMT;SuBkIE8O,CACSrO,EAAMgO,QAAQjyB,KAAK48B,QAAQ58B,KAAK68B;;CAzB/C,CAAoC9B;;;;;;;;GAqCpC,UAAUvzB,GAAMA;IAEpB,OADA2E,GAAuB,SAAS3E,IACzBs1B,GAAqBtB,QAAQ,SAASh0B,GAAAA;;;;;;;;;;;;;AAazC,SAAUu1B,GAAYv1B;IAE1B,OADA2E,GAAuB,eAAe3E,IAC/Bs1B,GAAqBtB,QAAQ,eAAeh0B,GAAAA;;;;;;;;;;AAU/C,IAAAw1B,mBAAA,SAAAp6B;;;;IAIJ9C,SAAAA;;IAEW2D,GACQw5B,GACAC;QAJnBp9B;gBAMEgD,IAAAA,gBAJS9C,MAAIyD,OAAJA,GACQzD,EAAYi9B,eAAZA,GACAj9B,EAAUk9B,aAAVA;;;WARuBnC,EAAAA,GAAAA,IAa1Cp0B,EAAAA,UAAAA,SACElD,GACAw5B,GACAC;QAEA,OAAO,IAAIC,EAAuB15B,GAAMw5B,GAAcC;OAGxDxC,EAAUzW,UAAAA,SAAVyW,SAAUzW;QACR,IAAMmZ,IAAQC,GACZpZ,GACAjkB,KAAKyD,MACLzD,KAAKi9B,cACLj9B,KAAKk9B;QAEP,OAAO,IAAItK,GACT3O,EAAMuJ,WACNvJ,EAAMqO,WvBpMI,SAAiBrO,GAAcmZ;YAC7C,OAAO,IAAIzZ,GACTM,EAAMza,MACNya,EAAMpZ,iBACNoZ,EAAML,gBAAgBrc,SACtB0c,EAAMzJ,QAAQjT,SACd0c,EAAMzc,OACNyc,EAAMJ,WACNuZ,GACAnZ,EAAMT;SATM,CuBqMOS,EAAMgO,QAAQmL;;CA/B/B,CAAsCrC;;AA0D5B,SAAAxX;SACX+Z,IAAAA,IAAAA,IAAAA,IAAAA,GAAAA,IAAAA,UAAAA,QAAAA,KAAAA,EAAAA,KAAAA,UAAAA;IAEH,OAAOH,GAAuB3B,QAC5B,WACA8B;oBACe;;;AA0BH,SAAAC;SACXD,IAAAA,IAAAA,IAAAA,IAAAA,GAAAA,IAAAA,UAAAA,QAAAA,KAAAA,EAAAA,KAAAA,UAAAA;IAEH,OAAOH,GAAuB3B,QAC5B,cACA8B;oBACe;;;;;;;;;GAWb,KAAAE,mBAAA,SAAA56B;;;;IAIJ9C,SAAAA;;IAEW2D,GACQw5B,GACAC;QAJnBp9B;gBAMEgD,IAAAA,gBAJS9C,MAAIyD,OAAJA,GACQzD,EAAYi9B,eAAZA,GACAj9B,EAAUk9B,aAAVA;;;WARqBnC,EAAAA,GAAAA,IAaxCp0B,EAAAA,UAAAA,SACElD,GACAw5B,GACAC;QAEA,OAAO,IAAIO,EAAqBh6B,GAAMw5B,GAAcC;OAGtDxC,EAAUzW,UAAAA,SAAVyW,SAAUzW;QACR,IAAMmZ,IAAQC,GACZpZ,GACAjkB,KAAKyD,MACLzD,KAAKi9B,cACLj9B,KAAKk9B;QAEP,OAAO,IAAItK,GACT3O,EAAMuJ,WACNvJ,EAAMqO,WvBlSI,SAAerO,GAAcmZ;YAC3C,OAAO,IAAIzZ,GACTM,EAAMza,MACNya,EAAMpZ,iBACNoZ,EAAML,gBAAgBrc,SACtB0c,EAAMzJ,QAAQjT,SACd0c,EAAMzc,OACNyc,EAAMJ,WACNI,EAAMV,SACN6Z;SATY,CuBmSKnZ,EAAMgO,QAAQmL;;CA/B7B,CAAoCrC;;AA0D1B,SAAA2C;SACXJ,IAAAA,IAAAA,IAAAA,IAAAA,GAAAA,IAAAA,UAAAA,QAAAA,KAAAA,EAAAA,KAAAA,UAAAA;IAEH,OAAOG,GAAqBjC,QAC1B,aACA8B;oBACe;;;AA0BH,SAAA9Z;SACX8Z,IAAAA,IAAAA,IAAAA,IAAAA,GAAAA,IAAAA,UAAAA,QAAAA,KAAAA,EAAAA,KAAAA,UAAAA;IAEH,OAAOG,GAAqBjC,QAC1B,SACA8B;oBACe;;;kEAKVD,UAAAA,GACPpZ,GACAsR,GACA+H,GACAtkB;IAIA,IAFAskB,EAAY,KAAKrK,EAAmBqK,EAAY,KAE5CA,EAAY,cAActE,IAC5B,OAoGE,SACJ/U,GACAje,GACAuvB,GACAvb,GACAhB;QAEA,KAAKgB,GACH,MAAM,IAAItQ,EACRhH,GAEE,uDAAG6yB,OAAAA,GAAAA;;;;;;;;QAaT,KATA,IAAMoI,IAA2B,IASXvZ,IAAAA,GAAAA,IAAAA,GAAaH,IAAbG,IAAaH,EAAAA,QAAbG,KAAaH;YAA9B,IAAMX,IAAAA,EAAAA;YACT,IAAIA,EAAQlK,MAAMhP,cAChBuzB,EAAWh2B,KAAK0Q,GAASrS,GAAYgU,EAAInK,YACpC;gBACL,IAAM9N,IAAQiY,EAAIC,KAAKb,MAAMkK,EAAQlK;gBACrC,IAAI1E,GAAkB3S,IACpB,MAAM,IAAI2H,EACRhH,GACA,iGAEE4gB,EAAQlK,QAFV;gBAMG,IAAc,SAAVrX,GAEJ;oBACL,IAAMqX,IAAQkK,EAAQlK,MAAMhQ;oBAC5B,MAAM,IAAIM,EACRhH,GAEE,+FAAiC0W,OAAAA,GAAAA;;gBANrCukB,EAAWh2B,KAAK5F;;;QAYtB,OAAO,IAAI+W,GAAM6kB,GAAY3kB;KAnDzB,CAnGAiL,EAAMgO,QACNhO,EAAMuJ,UAAUK,aAChB0H,GACA+H,EAAY,GAAGnE,WACfngB;IAGF,IAAMkiB,IAASrF,GAAkB5R,EAAMuJ;IACvC,OAoJY,SACdvJ,GACAje,GACAm1B,GACA5F,GACA9e,GACAuC;;QAGA,IAAMsK,IAAUW,EAAML;QACtB,IAAInN,EAAO/Q,SAAS4d,EAAQ5d,QAC1B,MAAM,IAAIgE,EACRhH,GACA,kCAAkC6yB,OAAAA,GAAAA;QAOtC,KADA,IAAMoI,IAA2B,IACxBr1B,IAAI,GAAGA,IAAImO,EAAO/Q,QAAQ4C,KAAK;YACtC,IAAMs1B,IAAWnnB,EAAOnO;YAExB,IADyBgb,EAAQhb,GACZ8Q,MAAMhP,cAAc;gBACvC,IAAwB,mBAAbwzB,GACT,MAAM,IAAIl0B,EACRhH,GAEE,uDAAAlB,OAAG+zB,GAAkCqI,kBAAAA,cAAAA;gBAG3C,KAAKzZ,GAAuBF,OAAqC,MAA3B2Z,EAASn0B,QAAQ,MACrD,MAAM,IAAIC,EACRhH,GAEE,+FAAuB6yB,OAAAA,GACnBqI,yCAAAA,OAAAA,GAAAA;gBAGV,IAAMp0B,IAAOya,EAAMza,KAAKnC,MAAM8B,GAAawB,WAAWizB;gBACtD,KAAKlzB,GAAYe,cAAcjC,IAC7B,MAAM,IAAIE,EACRhH,GAEE,qGAAqC6yB,OAAAA,GACR/rB,kDAAAA,OAAAA,GAAAA;gBAInC,IAAMqG,IAAM,IAAInF,GAAYlB;gBAC5Bm0B,EAAWh2B,KAAK0Q,GAASrS,GAAY6J;mBAChC;gBACL,IAAMguB,IAAU3F,GAAgBiD,GAAY5F,GAAYqI;gBACxDD,EAAWh2B,KAAKk2B;;;QAIpB,OAAO,IAAI/kB,GAAM6kB,GAAY3kB;KAzDf,CAnJViL,EAAMgO,QACNhO,EAAMuJ,UAAUK,aAChBqN,GACA3F,GACA+H,GACAtkB;;;AA+MN,SAASsiB,GACPt1B,GACAie,GACA6Z;IAIA,IAA+B,oBAF/BA,IAAkB7K,EAAmB6K,KAEI;QACvC,IAAwB,OAApBA,GACF,MAAM,IAAIp0B,EACRhH,GACA;QAIJ,KAAKyhB,GAAuBF,OAA4C,MAAlC6Z,EAAgBr0B,QAAQ,MAC5D,MAAM,IAAIC,EACRhH,GAGE,yGAAIo7B,OAAAA,GAAAA;QAGV,IAAMt0B,IAAOya,EAAMza,KAAKnC,MAAM8B,GAAawB,WAAWmzB;QACtD,KAAKpzB,GAAYe,cAAcjC,IAC7B,MAAM,IAAIE,EACRhH,GAGE,kIAAAlB,OAAQgI,GAAAA,uDAAAA,OAA0DA,EAAK9D,QAAAA;QAG7E,OAAO2S,GAASrS,GAAY,IAAI0E,GAAYlB;;IACvC,IAAIs0B,aAA2BzL,IACpC,OAAOha,GAASrS,GAAY83B,EAAgBvL;IAE5C,MAAM,IAAI7oB,EACRhH,GAGE,uHAAAlB,OAAGmK,GAAiBmyB,IAAAA;;;;;;GAS5B,UAAS1C,GACPr5B,GACAg8B;IAEA,KAAKjyB,MAAM8C,QAAQ7M,MAA2B,MAAjBA,EAAM2D,QACjC,MAAM,IAAIgE,EACRhH,GAEE,qDAAAlB,OAAIu8B,EAASh7B,YAAAA;IAGnB,IAAIhB,EAAM2D,SAAS,IACjB,MAAM,IAAIgE,EACRhH,GACA,mBAAAlB,OAAmBu8B,EAASh7B,YAAAA;;;;;;;;;;;;;;GAkDlC,UAASk4B,GACPhX,GACAhJ;IAEA,IAAIA,EAAYd,gBAAgB;QAC9B,IAAM6jB,IAAqB9Z,GAAyBD,IAC9Cga,IAAgBhjB,EAAY7B;QAElC,IACyB,SAAvB4kB,MACCA,EAAmB79B,QAAQ89B,IAE5B,MAAM,IAAIv0B,EACRhH,GAGE,2JAA2Bs7B,EAAmBj7B,8BACrCk7B,EAAcl7B,YAAAA;QAI7B,IAAMwhB,IAAoBP,GAAqBC;QACrB,SAAtBM,KACFiY,GACEvY,GACAga,GACA1Z;;IAKN,IAAM2Z,IAiCR,SACE1jB,GACA2jB;QAEA,KAAqB3jB,WAAAA,IAAAA,GAAAA,IAAAA,EAAAA,QAAAA,KACnB,KADG,IACuB5Q,IAAAA,GAAAA,IADjBA,EAAAA,GACwBwQ,uBAAPxQ,IACxB+K,EAAAjP,QADwBkE,KACxB;YADG,IAAMqR,IAAerR,EAAAA;YACxB,IAAIu0B,EAAU10B,QAAQwR,EAAY5B,OAAO,GACvC,OAAO4B,EAAY5B;;QAIzB,OAAO;KAXT,CAhCI4K,EAAMzJ,SAhEV,SAAwBnB;QACtB,QAAQA;UACN,KAAA;YACE,OAAO,EAAA,gCAAA;;UACT,KAAA;YACE,OAAO,EAAA,iDAAA,yDAAA;;UAKT,KAAA;YACE,OAAO,EAAA,yDAAA,yBAAA;;UACT,KAAA;YACE,OAAO,EAAA,iDAAA,yDAAA,yBAAA;;UAMT,KAAA;YACE,OAAO,EAAA,iDAAA,yDAAA,yBAAA,iCAAA;;UAOT;YACE,OAAO;;KA5Bb,CAiEmB4B,EAAY5B;IAE7B,IAAsB,SAAlB6kB;;IAEF,MAAIA,MAAkBjjB,EAAY5B,KAC1B,IAAI3P,EACRhH,GAEE,uDAAIuY,EAAY5B,GAAGtW,YAAAA,gBAGjB,IAAI2G,EACRhH,GACA,kCAAAlB,OAAkCyZ,EAAY5B,GAAGtW,uCACtCm7B,EAAcn7B,YAAAA;;;AAyCjC,SAASy5B,GACP4B,GACAC,GACA/a;IAEA,KAAKA,EAAQnjB,QAAQk+B,IACnB,MAAM,IAAI30B,EACRhH,GAEE,qGAA2C27B,OAAAA,EAAWt7B,YAAAA,gCAAAA,OACzBs7B,EAAWt7B,YAExBugB,iFAAAA,OAAAA,EAAQvgB,YAAAA;;;AAKhB,SAAAo5B,GACd9wB,GACA6uB;IAEA,MACIA,aAA2BM,MAC3BN,aAA2BI,KAE7B,MAAM,IAAI5wB,EACRhH,GACA,YAAY2I,OAAAA,GAAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;GC3nCFizB,UAAAA,GACdhM,GACAvwB,GACAgsB;;;;IAeA,OAZIuE,IACEvE,MAAYA,EAAQiI,SAASjI,EAAQkI,eAIrB3D,EAAkBiM,YAAYx8B,GAAOgsB,KAEtCuE,EAAUiM,YAAYx8B,KAGxBA;;;AAKf,IAAAy8B,mBAAA,SAAA57B;IACJ9C,SAAAA,EAAsB0tB;QAAtB1tB;gBACEgD,IAAAA,gBADoB9C,MAASwtB,YAATA;;WADXiR,SAKDC,EAAatuB,UAAAA,eAAbsuB,SAAatuB;QACrB,OAAO,IAAIojB,GAAMpjB;OAGTuuB,EAAiB37B,UAAAA,mBAAjB27B,SAAiB37B;QACzB,IAAM6M,IAAM7P,KAAK4+B,mBAAmB57B,GAAMhD,KAAKwtB,UAAUK;QACzD,OAAO,IAAIwE,GAAkBryB,KAAKwtB,4BAA4B,MAAM3d;;CAXlE,eAAA;IAAO4uB,SAAAA;WCpCXrM,EAAAA,UAAAA,eAAAA,SACErwB,GACA88B;QAEA,aAFAA,MAAAA,MAAAA,IAAmD,SAE3CrpB,GAAUzT;UAChB,KAAA;YACE,OAAO;;UACT,KAAA;YACE,OAAOA,EAAM4T;;UACf,KAAA;YACE,OAAOlC,GAAgB1R,EAAMoU,gBAAgBpU,EAAMsU;;UACrD,KAAA;YACE,OAAOrW,KAAK8+B,iBAAiB/8B,EAAMuT;;UACrC,KAAA;YACE,OAAOtV,KAAK++B,uBAAuBh9B,GAAO88B;;UAC5C,KAAA;YACE,OAAO98B,EAAMgT;;UACf,KAAA;YACE,OAAO/U,KAAK0+B,aAAahrB,GAAoB3R,EAAM+T;;UACrD,KAAA;YACE,OAAO9V,KAAK2+B,iBAAiB58B,EAAMgU;;UACrC,KAAA;YACE,OAAO/V,KAAKg/B,gBAAgBj9B,EAAMiU;;UACpC,KAAA;YACE,OAAOhW,KAAKi/B,aAAal9B,EAAMyU,YAAaqoB;;UAC9C,KAAA;YACE,OAAO7+B,KAAKk/B,cAAcn9B,EAAM6S,UAAWiqB;;UAC7C;YACE,MA1DO18B;;OA8DL+8B,EAAAA,UAAAA,gBAAAA,SACNtqB,GACAiqB;QAFMK,cAIAtkB,IAAuB;QAI7B,OAHAnT,GAAQmN,EAASC,SAAQ,SAAChF,GAAK9N;YAC7B6Y,EAAO/K,KAAO7P,EAAKoyB,aAAarwB,GAAO88B;aAElCjkB;OAGDokB,EAAgBj9B,UAAAA,kBAAhBi9B,SAAgBj9B;QACtB,OAAO,IAAIkyB,GACTxgB,GAAgB1R,EAAMkU,WACtBxC,GAAgB1R,EAAMmU;OAIlB+oB,EAAAA,UAAAA,eAAAA,SACNzoB,GACAqoB;QAFMI;QAIN,QAAQzoB,EAAWC,UAAU,IAAIrV,KAAIW,SAAAA;YACnC/B,OAAAA,EAAKoyB,aAAarwB,GAAO88B;;OAIrBE,EAAAA,UAAAA,yBAAAA,SACNh9B,GACA88B;QAEA,QAAQA;UACN,KAAK;YACH,IAAM5pB,IAAgBD,GAAiBjT;YACvC,OAAqB,QAAjBkT,IACK,OAEFjV,KAAKoyB,aAAand,GAAe4pB;;UAC1C,KAAK;YACH,OAAO7+B,KAAK8+B,iBAAiB3pB,GAAkBpT;;UACjD;YACE,OAAO;;OAIL+8B,EAAiB/8B,UAAAA,mBAAjB+8B,SAAiB/8B;QACvB,IAAMo9B,IAAkBtsB,GAAmB9Q;QAC3C,OAAO,IAAI+R,GAAUqrB,EAAgB5rB,SAAS4rB,EAAgBpsB;OAGtD6rB,EAAAA,UAAAA,qBAAAA,SACR57B,GACAo8B;QAEA,IAAMC,IAAel2B,GAAawB,WAAW3H;QA/FXT,EAiGhCqlB,GAAoByX;QAGtB,IAAMr5B,IAAa,IAAIQ,EAAW64B,EAAan3B,IAAI,IAAIm3B,EAAan3B,IAAI,KAClE2H,IAAM,IAAInF,GAAY20B,EAAax3B,SAAS;QAalD,OAXK7B,EAAW7F,QAAQi/B;;QAEtB39B,EACE,mBAAYoO,0EAEP7J,EAAWS,uBAAaT,EAAWU,UAEzB04B,yFAAAA,OAAAA,EAAmB34B,uBAAa24B,EAAmB14B;QAI/DmJ;;;;;;;;;;;;;;;;GDzCL,UAAUyvB,GACdC;IAGA,IAAMjU,IAAYiC,IADlBgS,IAAYvzB,GAA2BuzB,GAAWlN,KACT7E,YACnCgE,IAAiB,IAAIiN,GAAmBc,EAAU/R;IAExD,OAAOT,GAA2BzB,GAAW,EAACiU,EAAUhN,QAAO5tB,MAC7DiW,SAAAA;QACErY,EAA6B,MAAlBqY,EAAOlV;QAClB,IAAM85B,IAAW5kB,EAAO;QACxB,OAAO,IAAIoe,GACTuG,EAAU/R,WACVgE,GACA+N,EAAUhN,MACViN,EAASvc,oBAAoBuc,IAAW,MACxCD,EAAUjN;;;;;;;;;;;;;;;GAkBZ,UAAUmN,GAAWxb;KD7FrB,SACJA;QAEA,IACoC,6BAAlCA,EAAMJ,aAC2B,MAAjCI,EAAML,gBAAgBle,QAEtB,MAAM,IAAIgE,EACRhH,GACA;KATA,EC8FJuhB,IAAQjY,GAAeiY,GAAO2O,KACiBX;IAE/C,IAAM3G,IAAYiC,GAAatJ,EAAMuJ,YAC/BgE,IAAiB,IAAIiN,GAAmBxa,EAAMuJ;IACpD,OjBwDKvf,SACLqd,GACArH;;;;;;oBAQA,OANMuH,IAAgB/oB,EAAU6oB,IAC1B3b,IAAUqY,GAAcwD,EAAcxG,GAAYL,GAAcV,KAC/CuH,EAAAA,cAAAA,EAAc9b,EAGnC,YAAYC,EAAQ4R,QAAS;wBAAE0G,iBAAiBtY,EAAQsY;;;kBAC1D,KAAA;oBAAA,OAAA,EAAA,eAAAnZ,EAAAgjB,OAGKloB,QAAAA,SAAOmF;iCAAWA,EAAMywB;wBACxBp+B,KAAI2N,SAAAA;wBAAAA,OAAAA,SHoLTiW,GACAwa,GACA1c;4BAEA,IAAMjT,IAAM0L,GAASyJ,GAAYwa,EAASx8B,OACpCif,IAAUqF,GAAYkY,EAASvZ,aAI/B9D,IAAaqd,EAASrd,aACxBmF,GAAYkY,EAASrd,cACrB/F,GAAgBrT,OACdkR,IAAO,IAAIkH,GAAY;gCAAEvM,UAAU;oCAAEC,QAAQ2qB,EAAS3qB;;;4BAU5D,OATekN,GAAgBmL,iBAC7Brd,GACAoS,GACAE,GACAlI;yBGrMOlL,CACUyc,EAAcxG,GAAYjW,EAAMywB;;;;;KiBvE5CE,CAAkBpU,GAAWrH,EAAMgO,QAAQttB,MAAKiW,SAAAA;QACrD,IAAMqS,IAAOrS,EAAOxZ,KAClB4Y,SAAAA;YACE,OAAA,IAAIuf,GACFtV,EAAMuJ,WACNgE,GACAxX,EAAInK,KACJmK,GACAiK,EAAMqO;;QAWZ,OAAA,6BAPIrO,EAAMgO,OAAOpO;;;;QAIfoJ,EAAK0S,WAGA,IAAIjG,GAAiBzV,GAAOgJ;;;;AA6CvB2S,SAAAA,GACdL,GACAtlB,GACA8T;IAGA,IAAM8R,IAAiBvB,IADvBiB,IAAYvzB,GAA2BuzB,GAAWlN,KAEtCC,WACVrY,GACA8T,IAGI+R,IAAShK,GADID,GAAkB0J,EAAU/R,YAG7C,UACA+R,EAAUhN,MACVsN,GACwB,SAAxBN,EAAUjN,WACVvE;IAIF,OAAO1C,GADWkC,GAAagS,EAAU/R,YACP,EAChCsS,EAAOnU,WAAW4T,EAAUhN,MAAMvM,GAAa+Z;;;AAqD7C,SAAUC,GACdT,GACAU,GACAl+B;SACGk2B,IAAAA,IAAAA,IAAAA,IAAAA,GAAAA,IAAAA,UAAAA,QAAAA,KAAAA,EAAAA,IAAAA,KAAAA,UAAAA;IAGH,IAMI6H,GANE3E,IAAatF,IADnB0J,IAAYvzB,GAAiCuzB,GAAWlN,KACT7E;;;QA6B/C,OAlBEsS,IAH6B,oBAJ/BG,IAAoBhN,EAAmBgN,OAKrCA,aAA6Bl2B,KAEpBiuB,GACPmD,GACA,aACAoE,EAAUhN,MACV0N,GACAl+B,GACAk2B,KAGOP,GACPyD,GACA,aACAoE,EAAUhN,MACV0N;IAKG5U,GADWkC,GAAagS,EAAU/R,YACP,EAChCsS,EAAOnU,WAAW4T,EAAUhN,MAAMvM,GAAaE,QAAO;;;;;;;;;;;;;;GAgBpD,UAAUga,GACdX;IAIA,OAAOlU,GADWkC,IADlBgS,IAAYvzB,GAAiCuzB,GAAWlN,KACf7E,YACP,EAChC,IAAIzB,GAAewT,EAAUhN,MAAMvM,GAAa+Z;;;;;;;;;;;;;;;;;GAmBpC,UAAAI,GACdZ,GACAtlB;IAGA,IAAMmmB,IAASpmB,GADfulB,IAAYvzB,GAA6BuzB,GAAW7M,MAG9CmN,IAAiBvB,GACrBiB,EAAUjN,WACVrY,IAII6lB,IAAShK,GADID,GAAkB0J,EAAU/R,YAG7C,UACA4S,EAAO7N,MACPsN,GACqB,SAArBO,EAAO9N,WACP;IAIF,OAAOjH,GADWkC,GAAagS,EAAU/R,YACP,EAChCsS,EAAOnU,WAAWyU,EAAO7N,MAAMvM,GAAaE,QAAO,OAClDvhB;QAAWy7B,OAAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GEvWV,UAAUC,GACdpc;IAEA,IAAMuJ,IAAYxhB,GAAKiY,EAAMuJ,WAAWuB,KAClCzD,IAAYiC,GAAaC,IACzBgE,IAAiB,IAAIiN,GAAmBjR;IAC9C,OAAO,IAAI+D,GAAiBtN,GAAOqH,GAAWkG,GAAgBC;;;;;;;;;;;;;;GAehD,UAAA6O,GACdt3B,GACAC;IAEA,OACEqqB,GAAWtqB,EAAKib,OAAOhb,EAAMgb,UAAUsc,EAAUv3B,EAAKiR,QAAQhR,EAAMgR;;;;;;;;;;;;;;;;;;;;;;GC1CxDumB,UAAAA;IACd,OAAO,IAAI9J,GAAqB;;;;;;GAOlB+J,UAAAA;IACd,OAAO,IAAI3J,GAA8B;;;;;;;;;;;;;;GAe3B,UAAAO;SAAc3R,IAAAA,IAAAA,IAAAA,IAAAA,GAAAA,IAAAA,UAAAA,QAAAA,KAAAA,EAAAA,KAAAA,UAAAA;;;QAG5B,OAAO,IAAIgb,GAAyB,cAAchb;;;;;;;;;;;;;GAcpC,UAAAib;SAAejb,IAAAA,IAAAA,IAAAA,IAAAA,GAAAA,IAAAA,UAAAA,QAAAA,KAAAA,EAAAA,KAAAA,UAAAA;;;QAG7B,OAAO,IAAIkb,GAA0B,eAAelb;;;;;;;;;;;;;;;;;;;;;GAsBhD,UAAUmH,GAAUzgB;IACxB,OAAO,IAAIy0B,GAA+B,aAAaz0B;;;;;;;;;;;;;;;;;;;;;;;;;;GC9C5C00B,KAAAA,mBAAAA;;IASXhhC,SACmBm5B,EAAAA,GACA8H;QADA/gC,KAAUi5B,aAAVA,GACAj5B,KAAc+gC,iBAAdA,GANX/gC,KAAUghC,aAAG,IACbhhC,KAAUihC,cAAG;QAOnBjhC,KAAKkhC,cAAcrL,GAAkBoD;;WAgCvCr1B,EAAAA,UAAAA,MAAAA,SACEu9B,GACAlnB,GACA8T;QAEA/tB,KAAKohC;QACL,IAAM/H,IAAMgI,GAAkBF,GAAanhC,KAAKi5B,aAE1C4G,IAAiBvB,GACrBjF,EAAI/G,WACJrY,GACA8T,IAEI+R,IAAShK,GACb91B,KAAKkhC,aACL,kBACA7H,EAAI9G,MACJsN,GACkB,SAAlBxG,EAAI/G,WACJvE;QAGF,OADA/tB,KAAKghC,WAAWr5B,KAAKm4B,EAAOnU,WAAW0N,EAAI9G,MAAMvM,GAAa+Z,UACvD//B;OAqCT8rB,EAAAA,UAAAA,SAAAA,SACEqV,GACAlB,GACAl+B;aACGk2B,IAAAA,IAAAA,IAAAA,IAAAA,GAAAA,IAAAA,UAAAA,QAAAA,KAAAA,EAAAA,IAAAA,KAAAA,UAAAA;QAEHj4B,KAAKohC;QACL,IAMItB,GANEzG,IAAMgI,GAAkBF,GAAanhC,KAAKi5B;;;gBA+BhD,OApBE6G,IAH6B,oBAJ/BG,IAAoBhN,EAAmBgN,OAKrCA,aAA6Bl2B,KAEpBiuB,GACPh4B,KAAKkhC,aACL,qBACA7H,EAAI9G,MACJ0N,GACAl+B,GACAk2B,KAGOP,GACP13B,KAAKkhC,aACL,qBACA7H,EAAI9G,MACJ0N;QAIJjgC,KAAKghC,WAAWr5B,KACdm4B,EAAOnU,WAAW0N,EAAI9G,MAAMvM,GAAaE,cAEpClmB;;;;;;;;IASTogB,EAAAA,UAAAA,SAAAA,SAAO+gB;QACLnhC,KAAKohC;QACL,IAAM/H,IAAMgI,GAAkBF,GAAanhC,KAAKi5B;QAIhD,OAHAj5B,KAAKghC,aAAahhC,KAAKghC,WAAWx/B,OAChC,IAAIuqB,GAAesN,EAAI9G,MAAMvM,GAAa+Z,UAErC//B;;;;;;;;;;;;;;IAeTshC,qBAAAA;QAGE,OAFAthC,KAAKohC,uBACLphC,KAAKihC,cAAAA,GACDjhC,KAAKghC,WAAWt7B,SAAS,IACpB1F,KAAK+gC,eAAe/gC,KAAKghC,cAG3B59B,QAAQC;OAGT+9B,EAAAA,UAAAA,sBAAAA;QACN,IAAIphC,KAAKihC,YACP,MAAM,IAAIv3B,EACRhH,GACA;;CA1LKo+B;;AAiMG,SAAAO,GACdF,GACA3T;IAIA,KAFA2T,IAAclO,EAAmBkO,IAEjB3T,cAAcA,GAC5B,MAAM,IAAI9jB,EACRhH,GACA;IAGF,OAAOy+B;;;;;;;;;;;;;;;GAiBL,UAAUI,GAAW/T;IAEzB,IAAMlC,IAAYiC,GADlBC,IAAYxhB,GAAKwhB,GAAWuB;IAE5B,OAAO,IAAI+R,GAAWtT,IAAW/B,SAAAA;QAC/BJ,OAAAA,GAAgBC,GAAWG;;;;;;;;;;;;;;;;;;;;;;;GC7OlB+V,KAAAA,mBAAAA;IAoBX1hC,SAAAA,EAAoBwrB;QAAAtrB,KAASsrB,YAATA;;QAlBZtrB,KAAAyhC,eAAe,IAAI99B,KACnB3D,KAASurB,YAAe,IACxBvrB,KAAS0hC,aAAG;;;;;QAMZ1hC,KAAc2hC,iBAA0B;;;;;;;QAQxC3hC,KAAA4hC,cAAuC,IAAIC;;WAItC5pB,EAAAA,UAAAA,SAAbhK,SAAagK;;;;;;oBAGX,IAFAjY,KAAK8hC,yBAED9hC,KAAKurB,UAAU7lB,SAAS,GAC1B,MAAM,IAAIgE,EACRhH,GACA;oBAGEuqB,OAAaF,EAAAA,cAAAA,GAA2B/sB,KAAKsrB,WAAWrT;;;oBAE9D,OADAgV,EAAAA,iBADMA,IAAAA,EAAwDhV,QACzDxQ,SAAAA,SAAQuS;wBAAOha,OAAAA,EAAK+hC,cAAc/nB;yBAChCiT;;;;OAGTrpB,EAAAA,UAAAA,MAAAA,SAAIiM,GAAkBoK;QACpBja,KAAKgiC,MAAM/nB,EAAK0R,WAAW9b,GAAK7P,KAAKsmB,aAAazW,MAClD7P,KAAK4hC,YAAYzhB,IAAItQ,EAAI9M;OAG3B+oB,EAAAA,UAAAA,SAAAA,SAAOjc,GAAkBoK;QACvB;YACEja,KAAKgiC,MAAM/nB,EAAK0R,WAAW9b,GAAK7P,KAAKiiC,sBAAsBpyB;UAC3D,OAAO3N;YACPlC,KAAK2hC,iBAAiBz/B;;QAExBlC,KAAK4hC,YAAYzhB,IAAItQ,EAAI9M;OAG3Bqd,EAAOvQ,UAAAA,SAAPuQ,SAAOvQ;QACL7P,KAAKgiC,MAAM,IAAIjW,GAAelc,GAAK7P,KAAKsmB,aAAazW,MACrD7P,KAAK4hC,YAAYzhB,IAAItQ,EAAI9M;OAG3BkL,EAAAA,UAAAA,SAAAA;;;;;;oBAGE,IAFAjO,KAAK8hC,yBAED9hC,KAAK2hC,gBACP,MAAM3hC,KAAK2hC;oBAaPtW,OAXA6W,IAAYliC,KAAKyhC;;oBAEvBzhC,KAAKurB,UAAU9jB,SAAQmkB,SAAAA;wBACrBsW,EAAU9hB,OAAOwL,EAAS/b,IAAI9M;;;;oBAIhCm/B,EAAUz6B,SAAAA,SAAS8d,GAAG/b;wBACpB,IAAMqG,IAAMnF,GAAYy3B,SAAS34B;wBACjCxJ,EAAKurB,UAAU5jB,KAAK,IAAIukB,GAAerc,GAAK7P,EAAKsmB,aAAazW;yBAE1Dwb,EAAAA,cAAAA,GAAgBrrB,KAAKsrB,WAAWtrB,KAAKurB;;;;2BAArCF,EAAAA,QACNrrB,KAAK0hC,aAAY;;;;OAGXK,EAAc/nB,UAAAA,gBAAd+nB,SAAc/nB;QACpB,IAAIooB;QAEJ,IAAIpoB,EAAIiJ,mBACNmf,IAAapoB,EAAIiI,cACZ;YAAA,KAAIjI,EAAIkJ,gBAIb,MAhGF/gB;;wBA8FEigC,IAAahmB,GAAgBrT;;QAK/B,IAAMs5B,IAAkBriC,KAAKyhC,aAAav5B,IAAI8R,EAAInK,IAAI9M;QACtD,IAAIs/B;YACF,KAAKD,EAAWjiC,QAAQkiC;;YAEtB,MAAM,IAAI34B,EACRhH,GACA;eAIJ1C,KAAKyhC,aAAa79B,IAAIoW,EAAInK,IAAI9M,YAAYq/B;;;;;;IAQtC9b,EAAAA,UAAAA,eAAAA,SAAazW;QACnB,IAAMoS,IAAUjiB,KAAKyhC,aAAav5B,IAAI2H,EAAI9M;QAC1C,QAAK/C,KAAK4hC,YAAYpiB,IAAI3P,EAAI9M,eAAekf,IACvCA,EAAQ9hB,QAAQic,GAAgBrT,SAC3Bid,GAAaE,QAAO,KAEpBF,GAAaC,WAAWhE,KAG1B+D,GAAa+Z;;;;;IAOhBkC,EAAAA,UAAAA,wBAAAA,SAAsBpyB;QAC5B,IAAMoS,IAAUjiB,KAAKyhC,aAAav5B,IAAI2H,EAAI9M;;;gBAG1C,KAAK/C,KAAK4hC,YAAYpiB,IAAI3P,EAAI9M,eAAekf,GAAS;YACpD,IAAIA,EAAQ9hB,QAAQic,GAAgBrT;;;;;;;;;;YAYlC,MAAM,IAAIW,EACRhH,GACA;;wBAIJ,OAAOsjB,GAAaC,WAAWhE;;;;gBAI/B,OAAO+D,GAAaE,QAAO;OAIvB8b,EAAMpW,UAAAA,QAANoW,SAAMpW;QACZ5rB,KAAK8hC,yBACL9hC,KAAKurB,UAAU5jB,KAAKikB;OAGdkW,EAAAA,UAAAA,wBAAAA;CA9JGN,ICrBAc,KAAkD;IAC7DC,aAAa;GCYFC,mBAAAA;IAIX1iC,SACmBmE,EAAAA,GACAqnB,GACAyC,GACA0U,GACAC;QAJA1iC,KAAUiE,aAAVA,GACAjE,KAASsrB,YAATA,GACAtrB,KAAO+tB,UAAPA,GACA/tB,KAAcyiC,iBAAdA;QACAziC,KAAQ0iC,WAARA,GAEjB1iC,KAAK2iC,KAAoB5U,EAAQwU,aACjCviC,KAAK4iC,KAAU,IAAItZ,GACjBtpB,KAAKiE,YAAU;;;WAMnBwtB,kBAAAA;QACEzxB,KAAK2iC,MAAqB,GAC1B3iC,KAAK6iC;OAGCA,EAAAA,UAAAA,KAAAA;QAAAA;QACN7iC,KAAK4iC,GAAQ3Y,GAAchc;YAAAA,OAAAA,EAAAA,QAAAA,QAAAA,IAAAA;;;2BACnB60B,IAAc,IAAItB,GAAYxhC,KAAKsrB,aACnCyX,IAAc/iC,KAAKgjC,GAAqBF,OAE5CC,EACGp+B,MAAKiW,SAAAA;wBACJ5a,EAAKiE,WAAWg/B;4BACPH,OAAAA,EACJxB,SACA38B;gCACC3E,EAAK0iC,SAASr/B,QAAQuX;gCAEvBuQ,OAAM+X,SAAAA;gCACLljC,EAAKmjC,GAAuBD;;;wBAInC/X,OAAMiY,SAAAA;wBACLpjC,EAAKmjC,GAAuBC;;;;;OAM9BJ,EAAqBF,UAAAA,KAArBE,SAAqBF;QAC3B;YACE,IAAMC,IAAc/iC,KAAKyiC,eAAeK;YACxC,QACEz2B,GAAkB02B,MACjBA,EAAY5X,SACZ4X,EAAYp+B,OAORo+B,KALL/iC,KAAK0iC,SAASp/B,OACZhB,MAAM;YAED;UAGT,OAAOX;;YAGP,OADA3B,KAAK0iC,SAASp/B,OAAO3B,IACd;;OAIHwhC,EAAuBxhC,UAAAA,KAAvBwhC,SAAuBxhC;QAAvBwhC;QACFnjC,KAAK2iC,KAAoB,KAAK3iC,KAAKqjC,GAA4B1hC,MACjE3B,KAAK2iC,MAAqB,GAC1B3iC,KAAKiE,WAAWg/B,kBAAiB;YAAA,OAC/BjjC,EAAK6iC,MACEz/B,QAAQC;eAGjBrD,KAAK0iC,SAASp/B,OAAO3B;OAIjB0hC,EAA4B1hC,UAAAA,KAA5B0hC,SAA4B1hC;QAClC,IAAmB,oBAAfA,EAAMqB,MAA0B;;;YAGlC,IAAMH,IAAQlB,EAAyBkB;YACvC,OACW,cAATA,KACS,0BAATA,KACS,qBAATA;;;;;;;YpDjEF,SAA2BA;gBAC/B,QAAQA;kBA0BN;oBACE,OA5DyFV;;kBAoC3F,KAAKO;kBACL,KAAKA;kBACL,KAAKA;kBACL,KAAKA;kBACL,KAAKA;kBACL,KAAKA;;;sCAGL,KAAKA;oBACH,QAAO;;kBACT,KAAKA;kBACL,KAAKA;kBACL,KT6Cc;kBS5Cd,KAAKA;kBACL,KAAKA;;;;sCAIL,KAAKA;kBACL,KAAKA;kBACL,KAAKA;kBACL,KT8HS;oBS7HP,QAAO;;aA1BP,CoDkEoBG;;QAGtB,QAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;0ECrGKygC,SAAAA;;;IAGd,OAA2B,sBAAb9D,WAA2BA,WAAW;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GCqEzC+D,KnE7EiBthB,ImE6EjBshB,mBAAAA;IAOXzjC,SACmBmE,EAAAA,GACRulB,GACAga,GACQnqB,GACAoqB;QAJAzjC,KAAUiE,aAAVA,GACRjE,KAAOwpB,UAAPA,GACAxpB,KAAYwjC,eAAZA,GACQxjC,KAAEqZ,KAAFA,GACArZ,KAAeyjC,kBAAfA;QAPFzjC,KAAA0iC,WAAW,IAAIx/B,GAmFhClD,KAAA2E,OAAO3E,KAAK0iC,SAASv/B,QAAQwB,KAAKipB,KAAK5tB,KAAK0iC,SAASv/B;;;;QAvEnDnD,KAAK0iC,SAASv/B,QAAQgoB,OAAM5c,SAAAA;;;;;;;;;;;;;;;;WAkB5BtK,EAAAA,oBADF0C,SACE1C,GACAulB,GACAka,GACArqB,GACAoqB;QAEA,IACME,IAAY,IAAIJ,EACpBt/B,GACAulB,GAHiBlW,KAAKW,QAAQyvB,GAK9BrqB,GACAoqB;QAGF,OADAE,EAAU3/B,MAAM0/B,IACTC;;;;;;IAOD3/B,EAAAA,UAAAA,QAAAA,SAAM0/B;QAAN1/B;QACNhE,KAAK4jC,cAAcC,YAAAA;YAAiB7jC,OAAAA,EAAK8jC;YAAsBJ;;;;;;IAOjEhZ,wBAAAA;QACE,OAAO1qB,KAAK8jC;;;;;;;;;IAUd5Z,EAAAA,UAAAA,SAAAA,SAAOoL;QACoB,SAArBt1B,KAAK4jC,gBACP5jC,KAAK+jC,gBACL/jC,KAAK0iC,SAASp/B,OACZ,IAAIoG,EACFhH,GACA,yBAAyB4yB,IAAS,OAAOA,IAAS;OAQlDwO,EAAAA,UAAAA,qBAAAA;QAAAA;QACN9jC,KAAKiE,WAAWg/B,kBAAiB;YACN,OAAA,SAArBjjC,EAAK4jC,eACP5jC,EAAK+jC,gBACE/jC,EAAKqZ,KAAK1U,MAAKiW,SAAAA;gBACb5a,OAAAA,EAAK0iC,SAASr/B,QAAQuX;mBAGxBxX,QAAQC;;OAKb0gC,EAAAA,UAAAA,eAAAA;QACmB,SAArB/jC,KAAK4jC,gBACP5jC,KAAKyjC,gBAAgBzjC,OACrB+jC,aAAa/jC,KAAK4jC;QAClB5jC,KAAK4jC,cAAc;;CA3GZL,ICpEAS,mBAAAA;IA8CXlkC,SAAAA;QAAAA;;gBA5CAE,KAAAikC,KAAiC7gC,QAAQC;;;QAIzCrD,KAAAkkC,KAAmD;;;QAInDlkC,KAAAmkC,MAAmC;;;QAInCnkC,KAAAokC,KAA8D;;QAG9DpkC,KAAAoC,KAAiC;;;QAIjCpC,KAAAqkC,MAA8B;;QAG9BrkC,KAAAskC,MAAiC;;QAGjCtkC,KAAAukC,KAAoC;;QAGpCvkC,KAAA4iC,KAAkB,IAAItZ,GAAmBtpB,MAAAA;;;;QAKzCA,KAAAwkC,KAAwC;YACtC,IAAMhF,IAAW8D;YACb9D,KACF1+B,EAxCU,cA0CR,iCAAiC0+B,EAASiF,kBAG9CzkC,EAAK4iC,GAAQnY;;QAIb,IAAM+U,IAAW8D;QACb9D,KAAiD,qBAA9BA,EAASkF,oBAC9BlF,EAASkF,iBAAiB,oBAAoB1kC,KAAKwkC;;WAInDG,OAAAA,eAAAA,EAAAA,WAAAA,kBAAAA;QAAAA,KAAAA;YACF,OAAO3kC,KAAKmkC;;;;;;;;;IAOdlB,EAAAA,UAAAA,mBAAAA,SAAoC5pB;;QAElCrZ,KAAK4kC,QAAQvrB;OAGfwrB,EACExrB,UAAAA,sCADFwrB,SACExrB;QAEArZ,KAAK8kC;;QAEL9kC,KAAK+kC,GAAgB1rB;OAGvB2rB,EAAoBC,UAAAA,sBAApBD,SAAoBC;QAClB,KAAKjlC,KAAKmkC,IAAiB;YACzBnkC,KAAKmkC,MAAkB,GACvBnkC,KAAKskC,KAAyBW,MAAsB;YACpD,IAAMzF,IAAW8D;YACb9D,KAAoD,qBAAjCA,EAAS0F,uBAC9B1F,EAAS0F,oBACP,oBACAllC,KAAKwkC;;OAMbI,EAA2BvrB,UAAAA,UAA3BurB,SAA2BvrB;QAA3BurB;QAEE,IADA5kC,KAAK8kC,MACD9kC,KAAKmkC;;QAEP,OAAO,IAAI/gC;;;;gBAMb,IAAM+hC,IAAO,IAAIjiC;QACjB,OAAOlD,KAAK+kC;YACN/kC,OAAAA,EAAKmkC,MAAmBnkC,EAAKskC,KAExBlhC,QAAQC,aAGjBgW,IAAK1U,KAAKwgC,EAAK9hC,SAAS8hC,EAAK7hC,SACtB6hC,EAAKhiC;YACXwB;YAAWwgC,OAAAA,EAAKhiC;;OAGrBgB,EAAiBkV,UAAAA,mBAAjBlV,SAAiBkV;QAAjBlV;QACEnE,KAAKijC;YACHjjC,OAAAA,EAAKkkC,GAAav8B,KAAK0R,IAChBrZ,EAAKolC;;;;;;;IAQRn3B,iBAAAA;;;;;;wBAC2B,MAA7BjO,KAAKkkC,GAAax+B,QAAW,OAAjC,EAAA,cAAA;;;;oBAKQ1F,mCAAAA,EAAAA,cAAAA,KAAKkkC,GAAa;;;2BAAlBlkC,EAAAA,QACNA,KAAKkkC,GAAamB,SAClBrlC,KAAK4iC,GAAQ7Y;;;oBAEb,kBCgZc,gCDhZkB7nB,ECgZ3Bc,MD7YH,MAAMd;;+CAFNpB,EAtIQ,cAsIU,4CAA4CoB;;;;oBAM9DlC,KAAKkkC,GAAax+B,SAAS;;;;;;;;;;;oBAW7B1F,KAAK4iC,GAAQ3Y;wBAAoBjqB,OAAAA,EAAKolC;;;;;;;;OAIlCL,EAAmC1rB,UAAAA,KAAnC0rB,SAAmC1rB;QAAnC0rB,cACAO,IAAUtlC,KAAKikC,GAAKt/B,MAAAA;mBACxB3E,EAAKqkC,MAAAA,GACEhrB,IACJ8R,OAAOxpB,SAAAA;gBACN3B,EAAKoC,KAAUT,GACf3B,EAAKqkC,MAAsB;gBAC3B,IAAMhiC;;;;;;gBAyIhB,SAA2BV;oBACzB,IAAIU,IAAUV,EAAMU,WAAW;oBAQ/B,OAPIV,EAAM4jC,UAENljC,IADEV,EAAM4jC,MAAMC,SAAS7jC,EAAMU,WACnBV,EAAM4jC,QAEN5jC,EAAMU,UAAU,OAAOV,EAAM4jC;oBAGpCljC;iBATT,CAzI4CV;;;;gCAMlC,MALAF,EAAS,8BAA8BY,IAKjCV;gBAEPgD,MAAKiW,SAAAA;gBAAAA,OACJ5a,EAAKqkC,MAAAA,GACEzpB;;;QAIb,OADA5a,KAAKikC,KAAOqB,GACLA;OAGT9a,EAAAA,UAAAA,oBAAAA,SACEhB,GACAka,GACArqB;QAHFmR;QAKExqB,KAAK8kC;;QAQD9kC,KAAKukC,GAAe96B,QAAQ+f,MAAY,MAC1Cka,IAAU;QAGZ,IAAMC,IAAYJ,GAAiBkC,kBACjCzlC,MACAwpB,GACAka,GACArqB,IACAqsB,SAAAA;YACE1lC,OAAAA,EAAK2lC,GAAuBD;;QAGhC,OADA1lC,KAAKokC,GAAkBz8B,KAAKg8B,IACrBA;OAGDmB,EAAAA,UAAAA,KAAAA;QACF9kC,KAAKoC,MACPD;OAIJyjC,EAAAA,UAAAA,4BAAAA;;;;;IAWA33B,iBAAAA;;;;;;oBAQU43B,OAAAA,EAAAA,cADNA,IAAc7lC,KAAKikC;;;oBACb4B,EAAAA;;;wBACCA,MAAgB7lC,KAAKikC,IAAAA,OAAAA,EAAAA,cAAAA;;;;;;;;;;;;;IAOhC6B,EAAAA,UAAAA,KAAAA,SAAyBtc;QACvB,KAAiBxpB,IAAAA,IAAAA,GAAAA,IAAAA,KAAKokC,IAALpkC,IAAKokC,EAAAA,QAALpkC,KAAKokC;YACpB,SAAO5a,YAAYA,GACjB,QAAO;;QAGX,QAAO;;;;;;;;;IAUTuc,EAAAA,UAAAA,KAAAA,SAA6BC;QAA7BD;;gBAEE,OAAO/lC,KAAKimC,KAAQthC;;YAElB3E,EAAKokC,GAAkBjsB,MAAK,SAAC+tB,GAAGC;gBAAMD,OAAAA,EAAE1C,eAAe2C,EAAE3C;;YAEzD,KAAiBxjC,IAAAA,IAAAA,GAAAA,IAAAA,EAAKokC,IAALpkC,IAEf8O,EAAApJ,QAFe1F,KAEf;gBAFG,IAAMqZ,IAAMrZ,EAAAA;gBAEf,IADAqZ,EAAGqR,aACCsb,4BAAAA,KAA+B3sB,EAAGmQ,YAAYwc,GAChD;;YAIJ,OAAOhmC,EAAKimC;;;;;;IAOhBG,EAAAA,UAAAA,KAAAA,SAAqB5c;QACnBxpB,KAAKukC,GAAe58B,KAAK6hB;;8DAInBmc,EAAAA,UAAAA,KAAAA,SAAuBtsB;;QAE7B,IAAMlR,IAAQnI,KAAKokC,GAAkB36B,QAAQ4P;QAE7CrZ,KAAKokC,GAAkBiC,OAAOl+B,GAAO;;CA5R5B67B,IEqCAxC,mBAAAA;;IASX1hC,SACqBm5B,EAAAA,GACFqN;QADEtmC,KAAUi5B,aAAVA,GACFj5B,KAAYsmC,eAAZA,GAEjBtmC,KAAKkhC,cAAcrL,GAAkBoD;;;;;;;;WASvC/wB,EAAAA,UAAAA,MAAAA,SAAOi5B;QAAPj5B,cACQmxB,IAAMgI,GAAkBF,GAAanhC,KAAKi5B,aAC1CzH,IAAiB,IAAIiN,GAAmBz+B,KAAKi5B;QACnD,OAAOj5B,KAAKsmC,aAAaC,OAAO,EAAClN,EAAI9G,QAAO5tB,MAAKsoB,SAAAA;YAC/C,KAAKA,KAAwB,MAAhBA,EAAKvnB,QAChB,OApEuCvD;YAsEzC,IAAM6X,IAAMiT,EAAK;YACjB,IAAIjT,EAAIiJ,mBACN,OAAO,IAAI+V,GACTh5B,EAAKi5B,YACLzH,GACAxX,EAAInK,KACJmK,GACAqf,EAAI/G;YAED,IAAItY,EAAIkJ,gBACb,OAAO,IAAI8V,GACTh5B,EAAKi5B,YACLzH,GACA6H,EAAI9G,MACJ,MACA8G,EAAI/G;YAGN,MAxFuCnwB;;OA0H7CyB,EAAAA,UAAAA,MAAAA,SACEu9B,GACAp/B,GACAgsB;QAEA,IAAMsL,IAAMgI,GAAkBF,GAAanhC,KAAKi5B,aAC1C4G,IAAiBvB,GACrBjF,EAAI/G,WACJvwB,GACAgsB,IAEI+R,IAAShK,GACb91B,KAAKkhC,aACL,mBACA7H,EAAI9G,MACJsN,GACkB,SAAlBxG,EAAI/G,WACJvE;QAGF,OADA/tB,KAAKsmC,aAAa1iC,IAAIy1B,EAAI9G,MAAMuN,IACzB9/B;OAqCT8rB,EAAAA,UAAAA,SAAAA,SACEqV,GACAlB,GACAl+B;aACGk2B,IAAAA,IAAAA,IAAAA,IAAAA,GAAAA,IAAAA,UAAAA,QAAAA,KAAAA,EAAAA,IAAAA,KAAAA,UAAAA;QAEH,IAMI6H,GANEzG,IAAMgI,GAAkBF,GAAanhC,KAAKi5B;;;gBA6BhD,OAlBE6G,IAH6B,oBAJ/BG,IAAoBhN,EAAmBgN,OAKrCA,aAA6Bl2B,KAEpBiuB,GACPh4B,KAAKkhC,aACL,sBACA7H,EAAI9G,MACJ0N,GACAl+B,GACAk2B,KAGOP,GACP13B,KAAKkhC,aACL,sBACA7H,EAAI9G,MACJ0N;QAIJjgC,KAAKsmC,aAAaxa,OAAOuN,EAAI9G,MAAMuN,IAC5B9/B;;;;;;;;IASTogB,EAAAA,UAAAA,SAAAA,SAAO+gB;QACL,IAAM9H,IAAMgI,GAAkBF,GAAanhC,KAAKi5B;QAEhD,OADAj5B,KAAKsmC,aAAalmB,OAAOiZ,EAAI9G,OACtBvyB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuBKwmC,SAAAA,GACdhZ,GACAiV,GACA1U;IAGA,IAAMzC,IAAYiC,GADlBC,IAAYxhB,GAAKwhB,GAAWuB,MAEtB0X,IACDt1B,OAAAwH,OAAAxH,OAAAwH,OAAA,IAAA2pB,KACAvU;KN5PD,SAAqCA;QACzC,IAAIA,EAAQwU,cAAc,GACxB,MAAM,IAAI74B,EACRhH,GACA;KAJA,CM8PuB+jC;IAC3B,IAAM/D,IAAW,IAAIx/B;IASrB,OARA,IAAIs/B,GF+BG,IAAIwB,IE7BT1Y,GACAmb,aACAC;QACEjE,OAAAA,EAAe,IAAIjB,GAAYhU,GAAWkZ;QAC5ChE,GACAjR,OACKiR,EAASv/B;;;;;;;;;;;AtEnRY8e,KuEoBd,GAAGxhB,OAAAA,GACjBkmC,UvEpBAlmC,IAAcwhB,IuEoBd0kB,EACE,IAAIC,EACF,4BACCC,GAAAA;QAAiC7gC,IAAAA,EAAAA,oBAAqBioB,IAAAA,EAAAA,SAC/CH,IAAM+Y,EAAUC,YAAY,OAAOrW,gBACnCsW,IAAoB,IAAIhY,GAC5B,IAAIxqB,EACFsiC,EAAUC,YAAY,mBAExB,IAAInhC,EACFkhC,EAAUC,YAAY,wBhE8BlB,SACdhZ,GACApnB;QAEA,KAAKyK,OAAOC,UAAUC,eAAe21B,MAAMlZ,EAAIC,SAAS,EAAC,gBACvD,MAAM,IAAIrkB,EACRhH,GACA;QAIJ,OAAO,IAAI8D,EAAWsnB,EAAIC,QAAQtnB,WAAYC;KAXhC,CgE5BYonB,GAAK9nB,IACvB8nB;IAKF,OAHIG,KACF8Y,EAAkB1X,aAAapB,IAE1B8Y;IAET,UACAE,sBAAqB;;AAGzBC,EAAgB,kBAAA,SAA2B,KAC3CA,EAAgB,kBAA2B,SAAA;;"}
|
