{"version":3,"file":"index.cjs.js","sources":["../src/core/version.ts","../src/auth/user.ts","../src/util/error.ts","../src/api/credentials.ts","../src/api/timestamp.ts","../src/core/snapshot_version.ts","../src/model/path.ts","../src/model/document_key.ts","../src/util/obj.ts","../src/util/byte_string.ts","../src/util/types.ts","../src/model/server_timestamps.ts","../src/model/values.ts","../src/model/transform_operation.ts","../src/model/mutation.ts","../src/model/object_value.ts","../src/remote/rpc_error.ts","../src/model/document.ts","../src/core/target.ts","../src/core/query.ts","../src/local/target_data.ts","../src/remote/existence_filter.ts","../src/util/sorted_map.ts","../src/util/sorted_set.ts","../src/model/collections.ts","../src/model/document_set.ts","../src/core/view_snapshot.ts","../src/remote/remote_event.ts","../src/remote/watch_change.ts","../src/remote/serializer.ts","../src/platform/platform.ts","../src/util/log.ts","../src/util/assert.ts","../src/util/misc.ts","../src/core/database_info.ts","../src/util/obj_map.ts","../src/model/mutation_batch.ts","../src/local/persistence_promise.ts","../src/local/remote_document_change_buffer.ts","../src/local/persistence.ts","../src/local/local_documents_view.ts","../src/local/local_view_changes.ts","../src/core/listen_sequence.ts","../src/util/promise.ts","../src/remote/backoff.ts","../src/local/encoded_resource_path.ts","../src/local/memory_index_manager.ts","../src/local/indexeddb_index_manager.ts","../src/local/indexeddb_remote_document_cache.ts","../src/core/target_id_generator.ts","../src/local/indexeddb_target_cache.ts","../src/local/local_serializer.ts","../src/local/indexeddb_persistence.ts","../src/local/indexeddb_mutation_queue.ts","../src/local/indexeddb_schema.ts","../src/local/simple_db.ts","../src/util/async_queue.ts","../src/local/lru_garbage_collector.ts","../src/local/local_store.ts","../src/local/reference_set.ts","../src/util/input_validation.ts","../src/api/blob.ts","../src/api/field_path.ts","../src/api/field_value.ts","../src/api/geo_point.ts","../src/api/user_data_reader.ts","../src/remote/persistent_stream.ts","../src/remote/datastore.ts","../src/core/transaction.ts","../src/remote/online_state_tracker.ts","../src/remote/remote_store.ts","../src/local/shared_client_state_schema.ts","../src/local/shared_client_state.ts","../src/core/view.ts","../src/core/transaction_runner.ts","../src/core/sync_engine.ts","../src/core/event_manager.ts","../src/local/index_free_query_engine.ts","../src/local/memory_mutation_queue.ts","../src/local/memory_remote_document_cache.ts","../src/local/memory_target_cache.ts","../src/local/memory_persistence.ts","../src/core/component_provider.ts","../src/core/firestore_client.ts","../src/util/async_observer.ts","../src/api/observer.ts","../src/api/user_data_writer.ts","../src/api/database.ts","../src/util/api.ts","../src/platform/config.ts","../src/remote/connectivity_monitor_noop.ts","../src/platform_browser/browser_connectivity_monitor.ts","../src/remote/stream_bridge.ts","../src/platform_browser/webchannel_connection.ts","../index.ts","../src/platform_browser/browser_init.ts","../src/platform_browser/browser_platform.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\nimport firebase from '@firebase/app';\n\n/** The semver (www.semver.org) version of the SDK. */\nexport const SDK_VERSION = firebase.SDK_VERSION;\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/**\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\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\nimport * as firestore from '@firebase/firestore-types';\n\n/**\n * Error Codes describing the different ways Firestore can fail. These come\n * directly from GRPC.\n */\nexport type Code = firestore.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 Code,\n\n  /** The operation was cancelled (typically by the caller). */\n  CANCELLED: 'cancelled' as Code,\n\n  /** Unknown error or an error from a different error domain. */\n  UNKNOWN: 'unknown' as Code,\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 Code,\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 Code,\n\n  /** Some requested entity (e.g., file or directory) was not found. */\n  NOT_FOUND: 'not-found' as Code,\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 Code,\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 Code,\n\n  /**\n   * The request does not have valid authentication credentials for the\n   * operation.\n   */\n  UNAUTHENTICATED: 'unauthenticated' as Code,\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 Code,\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 Code,\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 Code,\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 Code,\n\n  /** Operation is not implemented or not supported/enabled in this service. */\n  UNIMPLEMENTED: 'unimplemented' as Code,\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 Code,\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 Code,\n\n  /** Unrecoverable data loss or corruption. */\n  DATA_LOSS: 'data-loss' as Code\n};\n\n/**\n * An error class used for Firestore-generated errors. Ideally we should be\n * using FirebaseError, but integrating with it is overly arduous at the moment,\n * so we define our own compatible error class (with a `name` of 'FirebaseError'\n * and compatible `code` and `message` fields.)\n */\nexport class FirestoreError extends Error implements firestore.FirestoreError {\n  name = 'FirebaseError';\n  stack?: string;\n\n  constructor(readonly code: Code, readonly message: string) {\n    super(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\nimport { User } from '../auth/user';\nimport { hardAssert, debugAssert } from '../util/assert';\nimport { Code, FirestoreError } from '../util/error';\nimport {\n  FirebaseAuthInternal,\n  FirebaseAuthInternalName\n} from '@firebase/auth-interop-types';\nimport { Provider } from '@firebase/component';\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 interface FirstPartyCredentialsSettings {\n  type: 'gapi';\n  client: unknown;\n  sessionIndex: string;\n}\n\nexport interface ProviderCredentialsSettings {\n  type: 'provider';\n  client: CredentialsProvider;\n}\n\n/** Settings for private credentials */\nexport type CredentialsSettings =\n  | FirstPartyCredentialsSettings\n  | ProviderCredentialsSettings;\n\nexport type TokenType = 'OAuth' | 'FirstParty';\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   */\n  user: User;\n\n  /** Extra header values to be passed along with a request */\n  authHeaders: { [header: string]: string };\n}\n\nexport class OAuthToken implements Token {\n  type = 'OAuth' as TokenType;\n  authHeaders: { [header: string]: string };\n  constructor(value: string, public user: User) {\n    this.authHeaders = {};\n    // Set the headers using Object Literal notation to avoid minification\n    this.authHeaders['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 = (user: User) => 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 {\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  /**\n   * Specifies a listener to be notified of credential changes\n   * (sign-in / sign-out, token changes). It is immediately called once with the\n   * initial user.\n   */\n  setChangeListener(changeListener: CredentialChangeListener): void;\n\n  /** Removes the previously-set change listener. */\n  removeChangeListener(): void;\n}\n\n/** A CredentialsProvider that always yields an empty token. */\nexport class EmptyCredentialsProvider implements CredentialsProvider {\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 | null = null;\n\n  getToken(): Promise<Token | null> {\n    return Promise.resolve<Token | null>(null);\n  }\n\n  invalidateToken(): void {}\n\n  setChangeListener(changeListener: CredentialChangeListener): void {\n    debugAssert(\n      !this.changeListener,\n      'Can only call setChangeListener() once.'\n    );\n    this.changeListener = changeListener;\n    // Fire with initial user.\n    changeListener(User.UNAUTHENTICATED);\n  }\n\n  removeChangeListener(): void {\n    debugAssert(\n      this.changeListener !== null,\n      'removeChangeListener() when no listener registered'\n    );\n    this.changeListener = null;\n  }\n}\n\nexport class FirebaseCredentialsProvider implements CredentialsProvider {\n  /**\n   * The auth token listener registered with FirebaseApp, retained here so we\n   * can unregister it.\n   */\n  private tokenListener: ((token: string | null) => void) | null = null;\n\n  /** Tracks the current User. */\n  private currentUser: User = User.UNAUTHENTICATED;\n  private receivedInitialUser: boolean = false;\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  /** The listener registered with setChangeListener(). */\n  private changeListener: CredentialChangeListener | null = null;\n\n  private forceRefresh = false;\n\n  private auth: FirebaseAuthInternal | null;\n\n  constructor(authProvider: Provider<FirebaseAuthInternalName>) {\n    this.tokenListener = () => {\n      this.tokenCounter++;\n      this.currentUser = this.getUser();\n      this.receivedInitialUser = true;\n      if (this.changeListener) {\n        this.changeListener(this.currentUser);\n      }\n    };\n\n    this.tokenCounter = 0;\n\n    this.auth = authProvider.getImmediate({ optional: true });\n\n    if (this.auth) {\n      this.auth.addAuthTokenListener(this.tokenListener!);\n    } else {\n      // if auth is not available, invoke tokenListener once with null token\n      this.tokenListener(null);\n      authProvider.get().then(\n        auth => {\n          this.auth = auth;\n          if (this.tokenListener) {\n            // tokenListener can be removed by removeChangeListener()\n            this.auth.addAuthTokenListener(this.tokenListener);\n          }\n        },\n        () => {\n          /* this.authProvider.get() never rejects */\n        }\n      );\n    }\n  }\n\n  getToken(): Promise<Token | null> {\n    debugAssert(\n      this.tokenListener != null,\n      'getToken cannot be called after listener removed.'\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        throw new FirestoreError(\n          Code.ABORTED,\n          'getToken aborted due to token change.'\n        );\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  setChangeListener(changeListener: CredentialChangeListener): void {\n    debugAssert(\n      !this.changeListener,\n      'Can only call setChangeListener() once.'\n    );\n    this.changeListener = changeListener;\n\n    // Fire the initial event\n    if (this.receivedInitialUser) {\n      changeListener(this.currentUser);\n    }\n  }\n\n  removeChangeListener(): void {\n    debugAssert(\n      this.tokenListener != null,\n      'removeChangeListener() called twice'\n    );\n    debugAssert(\n      this.changeListener !== null,\n      'removeChangeListener() called when no listener registered'\n    );\n\n    if (this.auth) {\n      this.auth.removeAuthTokenListener(this.tokenListener!);\n    }\n    this.tokenListener = null;\n    this.changeListener = null;\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\n  constructor(private gapi: Gapi, private sessionIndex: string) {}\n\n  get authHeaders(): { [header: string]: string } {\n    const headers: { [header: string]: string } = {\n      'X-Goog-AuthUser': this.sessionIndex\n    };\n    const authHeader = this.gapi.auth.getAuthHeaderValueForFirstParty([]);\n    if (authHeader) {\n      headers['Authorization'] = authHeader;\n    }\n    return 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 FirstPartyCredentialsProvider implements CredentialsProvider {\n  constructor(private gapi: Gapi, private sessionIndex: string) {}\n\n  getToken(): Promise<Token | null> {\n    return Promise.resolve(new FirstPartyToken(this.gapi, this.sessionIndex));\n  }\n\n  setChangeListener(changeListener: CredentialChangeListener): void {\n    // Fire with initial uid.\n    changeListener(User.FIRST_PARTY);\n  }\n\n  removeChangeListener(): void {}\n\n  invalidateToken(): void {}\n}\n\n/**\n * Builds a CredentialsProvider depending on the type of\n * the credentials passed in.\n */\nexport function makeCredentialsProvider(\n  credentials?: CredentialsSettings\n): CredentialsProvider {\n  if (!credentials) {\n    return new EmptyCredentialsProvider();\n  }\n\n  switch (credentials.type) {\n    case 'gapi':\n      const client = credentials.client as Gapi;\n      // Make sure this really is a Gapi client.\n      hardAssert(\n        !!(\n          typeof client === 'object' &&\n          client !== null &&\n          client['auth'] &&\n          client['auth']['getAuthHeaderValueForFirstParty']\n        ),\n        'unexpected gapi interface'\n      );\n      return new FirstPartyCredentialsProvider(\n        client,\n        credentials.sessionIndex || '0'\n      );\n\n    case 'provider':\n      return credentials.client;\n\n    default:\n      throw new FirestoreError(\n        Code.INVALID_ARGUMENT,\n        'makeCredentialsProvider failed due to invalid credential type'\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 { Code, FirestoreError } from '../util/error';\nimport { primitiveComparator } from '../util/misc';\n\n// The earlist date supported by Firestore timestamps (0001-01-01T00:00:00Z).\nconst MIN_SECONDS = -62135596800;\n\nexport class Timestamp {\n  static now(): Timestamp {\n    return Timestamp.fromMillis(Date.now());\n  }\n\n  static fromDate(date: Date): Timestamp {\n    return Timestamp.fromMillis(date.getTime());\n  }\n\n  static fromMillis(milliseconds: number): Timestamp {\n    const seconds = Math.floor(milliseconds / 1000);\n    const nanos = (milliseconds - seconds * 1000) * 1e6;\n    return new Timestamp(seconds, nanos);\n  }\n\n  constructor(readonly seconds: number, readonly nanoseconds: number) {\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  toDate(): Date {\n    return new Date(this.toMillis());\n  }\n\n  toMillis(): number {\n    return this.seconds * 1000 + this.nanoseconds / 1e6;\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  isEqual(other: Timestamp): boolean {\n    return (\n      other.seconds === this.seconds && other.nanoseconds === this.nanoseconds\n    );\n  }\n\n  toString(): string {\n    return (\n      'Timestamp(seconds=' +\n      this.seconds +\n      ', nanoseconds=' +\n      this.nanoseconds +\n      ')'\n    );\n  }\n\n  valueOf(): string {\n    // This method returns a string of the form <seconds>.<nanoseconds> where <seconds> is\n    // translated to have a non-negative value and both <seconds> and <nanoseconds> are left-padded\n    // with zeroes to be a consistent length. Strings with this format then have a lexiographical\n    // ordering that matches the expected ordering. The <seconds> translation is done to avoid\n    // having a leading negative sign (i.e. a leading '-' character) in its string representation,\n    // 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 '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 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 '../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  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 '../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    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 */\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.\n   */\n  static fromString(path: 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    if (path.indexOf('//') >= 0) {\n      throw new FirestoreError(\n        Code.INVALID_ARGUMENT,\n        `Invalid path (${path}). Paths must not contain // in them.`\n      );\n    }\n\n    // We may still have an empty segment at the beginning or end if they had a\n    // leading or trailing slash (which we allow).\n    const segments = path.split('/').filter(segment => segment.length > 0);\n\n    return new ResourcePath(segments);\n  }\n\n  static EMPTY_PATH = new ResourcePath([]);\n}\n\nconst identifierRegExp = /^[_a-zA-Z][_a-zA-Z0-9]*$/;\n\n/** A dot-separated path for navigating sub-objects within a document. */\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('\\\\', '\\\\\\\\').replace('`', '\\\\`');\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 EMPTY_PATH = new FieldPath([]);\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\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 fromName(name: string): DocumentKey {\n    return new DocumentKey(ResourcePath.fromString(name).popFirst(5));\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  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 EMPTY = new DocumentKey(new ResourcePath([]));\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   * @return 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 { debugAssert } from './assert';\n\nexport interface Dict<V> {\n  [stringKey: string]: V;\n}\n\nexport function objectSize<V>(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>,\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 { PlatformSupport } from '../platform/platform';\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 */\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 = PlatformSupport.getPlatform().atob(base64);\n    return new ByteString(binaryString);\n  }\n\n  static fromUint8Array(array: Uint8Array): ByteString {\n    const binaryString = binaryStringFromUint8Array(array);\n    return new ByteString(binaryString);\n  }\n\n  toBase64(): string {\n    return PlatformSupport.getPlatform().btoa(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 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// 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 * @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 * as api from '../protos/firestore_proto_api';\nimport { Timestamp } from '../api/timestamp';\nimport { normalizeTimestamp } from './values';\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 *   TransformMutation (see TransformMutation.applyTo()). They can only exist in\n *   the local view of a document. Therefore they do not need to be parsed or\n *   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: api.Value | 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: api.Value | null\n): api.Value {\n  const mapValue: api.MapValue = {\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: api.Value): api.Value | 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: api.Value): 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 * as api from '../protos/firestore_proto_api';\n\nimport { TypeOrder } from './object_value';\nimport { fail, hardAssert } from '../util/assert';\nimport { forEach, objectSize } from '../util/obj';\nimport { ByteString } from '../util/byte_string';\nimport { isNegativeZero } from '../util/types';\nimport { DocumentKey } from './document_key';\nimport { arrayEquals, primitiveComparator } from '../util/misc';\nimport { DatabaseId } from '../core/database_info';\nimport {\n  getLocalWriteTime,\n  getPreviousValue,\n  isServerTimestamp\n} from './server_timestamps';\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/** Extracts the backend's type order for the provided value. */\nexport function typeOrder(value: api.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    }\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: api.Value, right: api.Value): boolean {\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    default:\n      return fail('Unexpected value type: ' + JSON.stringify(left));\n  }\n}\n\nfunction timestampEquals(left: api.Value, right: api.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: api.Value, right: api.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: api.Value, right: api.Value): boolean {\n  return normalizeByteString(left.bytesValue!).isEqual(\n    normalizeByteString(right.bytesValue!)\n  );\n}\n\nexport function numberEquals(left: api.Value, right: api.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: api.Value, right: api.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: api.ArrayValue,\n  needle: api.Value\n): boolean {\n  return (\n    (haystack.values || []).find(v => valueEquals(v, needle)) !== undefined\n  );\n}\n\nexport function valueCompare(left: api.Value, right: api.Value): number {\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      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: api.Value, right: api.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: api.Timestamp, right: api.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: api.LatLng, right: api.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: api.ArrayValue, right: api.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: api.MapValue, right: api.MapValue): number {\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: api.Value): string {\n  return canonifyValue(value);\n}\n\nfunction canonifyValue(value: api.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: api.Timestamp): string {\n  const normalizedTimestamp = normalizeTimestamp(timestamp);\n  return `time(${normalizedTimestamp.seconds},${normalizedTimestamp.nanos})`;\n}\n\nfunction canonifyGeoPoint(geoPoint: api.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: api.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: api.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: api.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: api.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: api.ArrayValue): number {\n  return (arrayValue.values || []).reduce(\n    (previousSize, value) => previousSize + estimateByteSize(value),\n    0\n  );\n}\n\n/**\n * Converts the possible Proto values for a timestamp value into a \"seconds and\n * nanos\" representation.\n */\nexport function normalizeTimestamp(\n  date: api.Timestamp\n): { seconds: number; nanos: number } {\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/** Returns a reference value for the provided database and key. */\nexport function refValue(databaseId: DatabaseId, key: DocumentKey): api.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?: api.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?: api.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?: api.Value | null): boolean {\n  return isInteger(value) || isDouble(value);\n}\n\n/** Returns true if `value` is an ArrayValue. */\nexport function isArray(\n  value?: api.Value | null\n): value is { arrayValue: api.ArrayValue } {\n  return !!value && 'arrayValue' in value;\n}\n\n/** Returns true if `value` is a ReferenceValue. */\nexport function isReferenceValue(\n  value?: api.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?: api.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?: api.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?: api.Value | null\n): value is { mapValue: api.MapValue } {\n  return !!value && 'mapValue' in 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 * as api from '../protos/firestore_proto_api';\n\nimport { Timestamp } from '../api/timestamp';\nimport { debugAssert } from '../util/assert';\nimport { JsonProtoSerializer } from '../remote/serializer';\nimport {\n  valueEquals,\n  isArray,\n  isInteger,\n  isNumber,\n  normalizeNumber\n} from './values';\nimport { serverTimestamp } from './server_timestamps';\nimport { arrayEquals } from '../util/misc';\n\n/** Represents a transform within a TransformMutation. */\nexport interface TransformOperation {\n  /**\n   * Computes the local transform result against the provided `previousValue`,\n   * optionally using the provided localWriteTime.\n   */\n  applyToLocalView(\n    previousValue: api.Value | null,\n    localWriteTime: Timestamp\n  ): api.Value;\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   */\n  applyToRemoteDocument(\n    previousValue: api.Value | null,\n    transformResult: api.Value | null\n  ): api.Value;\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   * @return a base value to store along with the mutation, or null for\n   * idempotent transforms.\n   */\n  computeBaseValue(previousValue: api.Value | null): api.Value | null;\n\n  isEqual(other: TransformOperation): boolean;\n}\n\n/** Transforms a value into a server-generated timestamp. */\nexport class ServerTimestampTransform implements TransformOperation {\n  private constructor() {}\n  static instance = new ServerTimestampTransform();\n\n  applyToLocalView(\n    previousValue: api.Value | null,\n    localWriteTime: Timestamp\n  ): api.Value {\n    return serverTimestamp(localWriteTime!, previousValue);\n  }\n\n  applyToRemoteDocument(\n    previousValue: api.Value | null,\n    transformResult: api.Value | null\n  ): api.Value {\n    return transformResult!;\n  }\n\n  computeBaseValue(previousValue: api.Value | null): api.Value | null {\n    return null; // Server timestamps are idempotent and don't require a base value.\n  }\n\n  isEqual(other: TransformOperation): boolean {\n    return other instanceof ServerTimestampTransform;\n  }\n}\n\n/** Transforms an array value via a union operation. */\nexport class ArrayUnionTransformOperation implements TransformOperation {\n  constructor(readonly elements: api.Value[]) {}\n\n  applyToLocalView(\n    previousValue: api.Value | null,\n    localWriteTime: Timestamp\n  ): api.Value {\n    return this.apply(previousValue);\n  }\n\n  applyToRemoteDocument(\n    previousValue: api.Value | null,\n    transformResult: api.Value | null\n  ): api.Value {\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    return this.apply(previousValue);\n  }\n\n  private apply(previousValue: api.Value | null): api.Value {\n    const values = coercedFieldValuesArray(previousValue);\n    for (const toUnion of this.elements) {\n      if (!values.some(element => valueEquals(element, toUnion))) {\n        values.push(toUnion);\n      }\n    }\n    return { arrayValue: { values } };\n  }\n\n  computeBaseValue(previousValue: api.Value | null): api.Value | null {\n    return null; // Array transforms are idempotent and don't require a base value.\n  }\n\n  isEqual(other: TransformOperation): boolean {\n    return (\n      other instanceof ArrayUnionTransformOperation &&\n      arrayEquals(this.elements, other.elements, valueEquals)\n    );\n  }\n}\n\n/** Transforms an array value via a remove operation. */\nexport class ArrayRemoveTransformOperation implements TransformOperation {\n  constructor(readonly elements: api.Value[]) {}\n\n  applyToLocalView(\n    previousValue: api.Value | null,\n    localWriteTime: Timestamp\n  ): api.Value {\n    return this.apply(previousValue);\n  }\n\n  applyToRemoteDocument(\n    previousValue: api.Value | null,\n    transformResult: api.Value | null\n  ): api.Value {\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    return this.apply(previousValue);\n  }\n\n  private apply(previousValue: api.Value | null): api.Value {\n    let values = coercedFieldValuesArray(previousValue);\n    for (const toRemove of this.elements) {\n      values = values.filter(element => !valueEquals(element, toRemove));\n    }\n    return { arrayValue: { values } };\n  }\n\n  computeBaseValue(previousValue: api.Value | null): api.Value | null {\n    return null; // Array transforms are idempotent and don't require a base value.\n  }\n\n  isEqual(other: TransformOperation): boolean {\n    return (\n      other instanceof ArrayRemoveTransformOperation &&\n      arrayEquals(this.elements, other.elements, valueEquals)\n    );\n  }\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 implements TransformOperation {\n  constructor(\n    private readonly serializer: JsonProtoSerializer,\n    readonly operand: api.Value\n  ) {\n    debugAssert(\n      isNumber(operand),\n      'NumericIncrementTransform transform requires a NumberValue'\n    );\n  }\n\n  applyToLocalView(\n    previousValue: api.Value | null,\n    localWriteTime: Timestamp\n  ): api.Value {\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 = this.computeBaseValue(previousValue);\n    const sum = this.asNumber(baseValue) + this.asNumber(this.operand);\n    if (isInteger(baseValue) && isInteger(this.operand)) {\n      return this.serializer.toInteger(sum);\n    } else {\n      return this.serializer.toDouble(sum);\n    }\n  }\n\n  applyToRemoteDocument(\n    previousValue: api.Value | null,\n    transformResult: api.Value | null\n  ): api.Value {\n    debugAssert(\n      transformResult !== null,\n      \"Didn't receive transformResult for NUMERIC_ADD transform\"\n    );\n    return transformResult;\n  }\n\n  /**\n   * Inspects the provided value, returning the provided value if it is already\n   * a NumberValue, otherwise returning a coerced value of 0.\n   */\n  computeBaseValue(previousValue: api.Value | null): api.Value {\n    return isNumber(previousValue) ? previousValue! : { integerValue: 0 };\n  }\n\n  isEqual(other: TransformOperation): boolean {\n    return (\n      other instanceof NumericIncrementTransformOperation &&\n      valueEquals(this.operand, other.operand)\n    );\n  }\n\n  private asNumber(value: api.Value): number {\n    return normalizeNumber(value.integerValue || value.doubleValue);\n  }\n}\n\nfunction coercedFieldValuesArray(value: api.Value | null): api.Value[] {\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 * as api from '../protos/firestore_proto_api';\n\nimport { Timestamp } from '../api/timestamp';\nimport { SnapshotVersion } from '../core/snapshot_version';\nimport { debugAssert, fail, hardAssert } from '../util/assert';\n\nimport {\n  Document,\n  MaybeDocument,\n  NoDocument,\n  UnknownDocument\n} from './document';\nimport { DocumentKey } from './document_key';\nimport { ObjectValue, ObjectValueBuilder } from './object_value';\nimport { FieldPath } from './path';\nimport { TransformOperation } from './transform_operation';\nimport { arrayEquals } from '../util/misc';\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  /**\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/** 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  isEqual(other: FieldTransform): boolean {\n    return (\n      this.field.isEqual(other.field) && this.transform.isEqual(other.transform)\n    );\n  }\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\n     * TransformMutation has been committed. Contains one FieldValue for each\n     * FieldTransform that was in the mutation.\n     *\n     * Will be null if the mutation was not a TransformMutation.\n     */\n    readonly transformResults: Array<api.Value | null> | null\n  ) {}\n}\n\nexport const enum MutationType {\n  Set,\n  Patch,\n  Transform,\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  /**\n   * Returns true if the preconditions is valid for the given document\n   * (or null if no document is available).\n   */\n  isValidFor(maybeDoc: MaybeDocument | null): boolean {\n    if (this.updateTime !== undefined) {\n      return (\n        maybeDoc instanceof Document &&\n        maybeDoc.version.isEqual(this.updateTime)\n      );\n    } else if (this.exists !== undefined) {\n      return this.exists === maybeDoc instanceof Document;\n    } else {\n      debugAssert(this.isNone, 'Precondition should be empty');\n      return true;\n    }\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/**\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, Patch, and Transform mutations. For Delete\n * mutations, we 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        null                  Document(v0)\n * PatchMutation      Document(v3)          Document(v3)\n * PatchMutation      NoDocument(v3)        NoDocument(v3)\n * PatchMutation      null                  null\n * TransformMutation  Document(v3)          Document(v3)\n * TransformMutation  NoDocument(v3)        NoDocument(v3)\n * TransformMutation  null                  null\n * DeleteMutation     Document(v3)          NoDocument(v0)\n * DeleteMutation     NoDocument(v3)        NoDocument(v0)\n * DeleteMutation     null                  NoDocument(v0)\n *\n * For acknowledged mutations, we use the updateTime of the WriteResponse as\n * the resulting version for Set, Patch, and Transform mutations. As deletes\n * have no 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 return an `UnknownDocument` and rely on Watch to send us the\n * updated version.\n *\n * Note that TransformMutations don't create Documents (in the case of being\n * applied to a NoDocument), even though they would on the backend. This is\n * because the client always combines the TransformMutation with a SetMutation\n * or PatchMutation and we only want to apply the transform if the prior\n * mutation resulted in a Document (always true for a SetMutation, but not\n * necessarily for a PatchMutation).\n *\n * ## Subclassing Notes\n *\n * Subclasses of Mutation need to implement applyToRemoteDocument() and\n * applyToLocalView() to implement the actual behavior of applying the mutation\n * to some source document.\n */\nexport abstract class Mutation {\n  abstract readonly type: MutationType;\n  abstract readonly key: DocumentKey;\n  abstract readonly precondition: Precondition;\n\n  /**\n   * Applies this mutation to the given MaybeDocument or null for the purposes\n   * of computing a new remote document. If the input document doesn't match the\n   * expected state (e.g. it is null or outdated), an `UnknownDocument` can be\n   * returned.\n   *\n   * @param maybeDoc The document to mutate. The input document can be null if\n   *     the client has no knowledge of the pre-mutation state of the document.\n   * @param mutationResult The result of applying the mutation from the backend.\n   * @return The mutated document. The returned document may be an\n   *     UnknownDocument if the mutation could not be applied to the locally\n   *     cached base document.\n   */\n  abstract applyToRemoteDocument(\n    maybeDoc: MaybeDocument | null,\n    mutationResult: MutationResult\n  ): MaybeDocument;\n\n  /**\n   * Applies this mutation to the given MaybeDocument or null for the purposes\n   * of computing the new local view of a document. Both the input and returned\n   * documents can be null.\n   *\n   * @param maybeDoc The document to mutate. The input document can be null if\n   *     the client has no knowledge of the pre-mutation state of the document.\n   * @param baseDoc The state of the document prior to this mutation batch. The\n   *     input document can be null if the client has no knowledge of the\n   *     pre-mutation state of the document.\n   * @param localWriteTime A timestamp indicating the local write time of the\n   *     batch this mutation is a part of.\n   * @return The mutated document. The returned document may be null, but only\n   *     if maybeDoc was null and the mutation would not create a new document.\n   */\n  abstract applyToLocalView(\n    maybeDoc: MaybeDocument | null,\n    baseDoc: MaybeDocument | null,\n    localWriteTime: Timestamp\n  ): MaybeDocument | null;\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   * @return a base value to store along with the mutation, or null for\n   * idempotent mutations.\n   */\n  abstract extractBaseValue(maybeDoc: MaybeDocument | null): ObjectValue | null;\n\n  abstract isEqual(other: Mutation): boolean;\n\n  protected verifyKeyMatches(maybeDoc: MaybeDocument | null): void {\n    if (maybeDoc != null) {\n      debugAssert(\n        maybeDoc.key.isEqual(this.key),\n        'Can only apply a mutation to a document with the same key'\n      );\n    }\n  }\n\n  /**\n   * Returns the version from the given document for use as the result of a\n   * mutation. Mutations are defined to return the version of the base document\n   * only if it is an existing document. Deleted and unknown documents have a\n   * post-mutation version of SnapshotVersion.min().\n   */\n  protected static getPostMutationVersion(\n    maybeDoc: MaybeDocument | null\n  ): SnapshotVersion {\n    if (maybeDoc instanceof Document) {\n      return maybeDoc.version;\n    } else {\n      return SnapshotVersion.min();\n    }\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  ) {\n    super();\n  }\n\n  readonly type: MutationType = MutationType.Set;\n\n  applyToRemoteDocument(\n    maybeDoc: MaybeDocument | null,\n    mutationResult: MutationResult\n  ): MaybeDocument {\n    this.verifyKeyMatches(maybeDoc);\n\n    debugAssert(\n      mutationResult.transformResults == null,\n      'Transform results received by SetMutation.'\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\n    const version = mutationResult.version;\n    return new Document(this.key, version, this.value, {\n      hasCommittedMutations: true\n    });\n  }\n\n  applyToLocalView(\n    maybeDoc: MaybeDocument | null,\n    baseDoc: MaybeDocument | null,\n    localWriteTime: Timestamp\n  ): MaybeDocument | null {\n    this.verifyKeyMatches(maybeDoc);\n\n    if (!this.precondition.isValidFor(maybeDoc)) {\n      return maybeDoc;\n    }\n\n    const version = Mutation.getPostMutationVersion(maybeDoc);\n    return new Document(this.key, version, this.value, {\n      hasLocalMutations: true\n    });\n  }\n\n  extractBaseValue(maybeDoc: MaybeDocument | null): null {\n    return null;\n  }\n\n  isEqual(other: Mutation): boolean {\n    return (\n      other instanceof SetMutation &&\n      this.key.isEqual(other.key) &&\n      this.value.isEqual(other.value) &&\n      this.precondition.isEqual(other.precondition)\n    );\n  }\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  ) {\n    super();\n  }\n\n  readonly type: MutationType = MutationType.Patch;\n\n  applyToRemoteDocument(\n    maybeDoc: MaybeDocument | null,\n    mutationResult: MutationResult\n  ): MaybeDocument {\n    this.verifyKeyMatches(maybeDoc);\n\n    debugAssert(\n      mutationResult.transformResults == null,\n      'Transform results received by PatchMutation.'\n    );\n\n    if (!this.precondition.isValidFor(maybeDoc)) {\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 return an UnknownDocument with the\n      // known updateTime.\n      return new UnknownDocument(this.key, mutationResult.version);\n    }\n\n    const newData = this.patchDocument(maybeDoc);\n    return new Document(this.key, mutationResult.version, newData, {\n      hasCommittedMutations: true\n    });\n  }\n\n  applyToLocalView(\n    maybeDoc: MaybeDocument | null,\n    baseDoc: MaybeDocument | null,\n    localWriteTime: Timestamp\n  ): MaybeDocument | null {\n    this.verifyKeyMatches(maybeDoc);\n\n    if (!this.precondition.isValidFor(maybeDoc)) {\n      return maybeDoc;\n    }\n\n    const version = Mutation.getPostMutationVersion(maybeDoc);\n    const newData = this.patchDocument(maybeDoc);\n    return new Document(this.key, version, newData, {\n      hasLocalMutations: true\n    });\n  }\n\n  extractBaseValue(maybeDoc: MaybeDocument | null): null {\n    return null;\n  }\n\n  isEqual(other: Mutation): boolean {\n    return (\n      other instanceof PatchMutation &&\n      this.key.isEqual(other.key) &&\n      this.fieldMask.isEqual(other.fieldMask) &&\n      this.precondition.isEqual(other.precondition)\n    );\n  }\n\n  /**\n   * Patches the data of document if available or creates a new document. Note\n   * that this does not check whether or not the precondition of this patch\n   * holds.\n   */\n  private patchDocument(maybeDoc: MaybeDocument | null): ObjectValue {\n    let data: ObjectValue;\n    if (maybeDoc instanceof Document) {\n      data = maybeDoc.data();\n    } else {\n      data = ObjectValue.empty();\n    }\n    return this.patchObject(data);\n  }\n\n  private patchObject(data: ObjectValue): ObjectValue {\n    const builder = new ObjectValueBuilder(data);\n    this.fieldMask.fields.forEach(fieldPath => {\n      if (!fieldPath.isEmpty()) {\n        const newValue = this.data.field(fieldPath);\n        if (newValue !== null) {\n          builder.set(fieldPath, newValue);\n        } else {\n          builder.delete(fieldPath);\n        }\n      }\n    });\n    return builder.build();\n  }\n}\n\n/**\n * A mutation that modifies specific fields of the document with transform\n * operations. Currently the only supported transform is a server timestamp, but\n * IP Address, increment(n), etc. could be supported in the future.\n *\n * It is somewhat similar to a PatchMutation in that it patches specific fields\n * and has no effect when applied to a null or NoDocument (see comment on\n * Mutation for rationale).\n */\nexport class TransformMutation extends Mutation {\n  readonly type: MutationType = MutationType.Transform;\n\n  // NOTE: We set a precondition of exists: true as a safety-check, since we\n  // always combine TransformMutations with a SetMutation or PatchMutation which\n  // (if successful) should end up with an existing document.\n  readonly precondition = Precondition.exists(true);\n\n  constructor(\n    readonly key: DocumentKey,\n    readonly fieldTransforms: FieldTransform[]\n  ) {\n    super();\n  }\n\n  applyToRemoteDocument(\n    maybeDoc: MaybeDocument | null,\n    mutationResult: MutationResult\n  ): MaybeDocument {\n    this.verifyKeyMatches(maybeDoc);\n\n    hardAssert(\n      mutationResult.transformResults != null,\n      'Transform results missing for TransformMutation.'\n    );\n\n    if (!this.precondition.isValidFor(maybeDoc)) {\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 return an UnknownDocument with the\n      // known updateTime.\n      return new UnknownDocument(this.key, mutationResult.version);\n    }\n\n    const doc = this.requireDocument(maybeDoc);\n    const transformResults = this.serverTransformResults(\n      maybeDoc,\n      mutationResult.transformResults!\n    );\n\n    const version = mutationResult.version;\n    const newData = this.transformObject(doc.data(), transformResults);\n    return new Document(this.key, version, newData, {\n      hasCommittedMutations: true\n    });\n  }\n\n  applyToLocalView(\n    maybeDoc: MaybeDocument | null,\n    baseDoc: MaybeDocument | null,\n    localWriteTime: Timestamp\n  ): MaybeDocument | null {\n    this.verifyKeyMatches(maybeDoc);\n\n    if (!this.precondition.isValidFor(maybeDoc)) {\n      return maybeDoc;\n    }\n\n    const doc = this.requireDocument(maybeDoc);\n    const transformResults = this.localTransformResults(\n      localWriteTime,\n      maybeDoc,\n      baseDoc\n    );\n    const newData = this.transformObject(doc.data(), transformResults);\n    return new Document(this.key, doc.version, newData, {\n      hasLocalMutations: true\n    });\n  }\n\n  extractBaseValue(maybeDoc: MaybeDocument | null): ObjectValue | null {\n    let baseObject: ObjectValueBuilder | null = null;\n    for (const fieldTransform of this.fieldTransforms) {\n      const existingValue =\n        maybeDoc instanceof Document\n          ? maybeDoc.field(fieldTransform.field)\n          : undefined;\n      const coercedValue = fieldTransform.transform.computeBaseValue(\n        existingValue || null\n      );\n\n      if (coercedValue != null) {\n        if (baseObject == null) {\n          baseObject = new ObjectValueBuilder().set(\n            fieldTransform.field,\n            coercedValue\n          );\n        } else {\n          baseObject = baseObject.set(fieldTransform.field, coercedValue);\n        }\n      }\n    }\n    return baseObject ? baseObject.build() : null;\n  }\n\n  isEqual(other: Mutation): boolean {\n    return (\n      other instanceof TransformMutation &&\n      this.key.isEqual(other.key) &&\n      arrayEquals(this.fieldTransforms, other.fieldTransforms, (l, r) =>\n        l.isEqual(r)\n      ) &&\n      this.precondition.isEqual(other.precondition)\n    );\n  }\n\n  /**\n   * Asserts that the given MaybeDocument is actually a Document and verifies\n   * that it matches the key for this mutation. Since we only support\n   * transformations with precondition exists this method is guaranteed to be\n   * safe.\n   */\n  private requireDocument(maybeDoc: MaybeDocument | null): Document {\n    debugAssert(\n      maybeDoc instanceof Document,\n      'Unknown MaybeDocument type ' + maybeDoc\n    );\n    debugAssert(\n      maybeDoc.key.isEqual(this.key),\n      'Can only transform a document with the same key'\n    );\n    return maybeDoc;\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\n   * TransformMutation has been acknowledged by the server.\n   *\n   * @param baseDoc The document prior to applying this mutation batch.\n   * @param serverTransformResults The transform results received by the server.\n   * @return The transform results list.\n   */\n  private serverTransformResults(\n    baseDoc: MaybeDocument | null,\n    serverTransformResults: Array<api.Value | null>\n  ): api.Value[] {\n    const transformResults: api.Value[] = [];\n    hardAssert(\n      this.fieldTransforms.length === serverTransformResults.length,\n      `server transform result count (${serverTransformResults.length}) ` +\n        `should match field transform count (${this.fieldTransforms.length})`\n    );\n\n    for (let i = 0; i < serverTransformResults.length; i++) {\n      const fieldTransform = this.fieldTransforms[i];\n      const transform = fieldTransform.transform;\n      let previousValue: api.Value | null = null;\n      if (baseDoc instanceof Document) {\n        previousValue = baseDoc.field(fieldTransform.field);\n      }\n      transformResults.push(\n        transform.applyToRemoteDocument(\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   * TransformMutation locally.\n   *\n   * @param localWriteTime The local time of the transform mutation (used to\n   *     generate ServerTimestampValues).\n   * @param maybeDoc The current state of the document after applying all\n   *     previous mutations.\n   * @param baseDoc The document prior to applying this mutation batch.\n   * @return The transform results list.\n   */\n  private localTransformResults(\n    localWriteTime: Timestamp,\n    maybeDoc: MaybeDocument | null,\n    baseDoc: MaybeDocument | null\n  ): api.Value[] {\n    const transformResults: api.Value[] = [];\n    for (const fieldTransform of this.fieldTransforms) {\n      const transform = fieldTransform.transform;\n\n      let previousValue: api.Value | null = null;\n      if (maybeDoc instanceof Document) {\n        previousValue = maybeDoc.field(fieldTransform.field);\n      }\n\n      if (previousValue === null && baseDoc instanceof Document) {\n        // If the current document does not contain a value for the mutated\n        // field, use the value that existed before applying this mutation\n        // batch. This solves an edge case where a PatchMutation clears the\n        // values in a nested map before the TransformMutation is applied.\n        previousValue = baseDoc.field(fieldTransform.field);\n      }\n\n      transformResults.push(\n        transform.applyToLocalView(previousValue, localWriteTime)\n      );\n    }\n    return transformResults;\n  }\n\n  private transformObject(\n    data: ObjectValue,\n    transformResults: api.Value[]\n  ): ObjectValue {\n    debugAssert(\n      transformResults.length === this.fieldTransforms.length,\n      'TransformResults length mismatch.'\n    );\n\n    const builder = new ObjectValueBuilder(data);\n    for (let i = 0; i < this.fieldTransforms.length; i++) {\n      const fieldTransform = this.fieldTransforms[i];\n      const fieldPath = fieldTransform.field;\n      builder.set(fieldPath, transformResults[i]);\n    }\n    return builder.build();\n  }\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\n  applyToRemoteDocument(\n    maybeDoc: MaybeDocument | null,\n    mutationResult: MutationResult\n  ): MaybeDocument {\n    this.verifyKeyMatches(maybeDoc);\n\n    debugAssert(\n      mutationResult.transformResults == null,\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\n    return new NoDocument(this.key, mutationResult.version, {\n      hasCommittedMutations: true\n    });\n  }\n\n  applyToLocalView(\n    maybeDoc: MaybeDocument | null,\n    baseDoc: MaybeDocument | null,\n    localWriteTime: Timestamp\n  ): MaybeDocument | null {\n    this.verifyKeyMatches(maybeDoc);\n\n    if (!this.precondition.isValidFor(maybeDoc)) {\n      return maybeDoc;\n    }\n\n    if (maybeDoc) {\n      debugAssert(\n        maybeDoc.key.isEqual(this.key),\n        'Can only apply mutation to document with same key'\n      );\n    }\n    return new NoDocument(this.key, SnapshotVersion.min());\n  }\n\n  extractBaseValue(maybeDoc: MaybeDocument | null): null {\n    return null;\n  }\n\n  isEqual(other: Mutation): boolean {\n    return (\n      other instanceof DeleteMutation &&\n      this.key.isEqual(other.key) &&\n      this.precondition.isEqual(other.precondition)\n    );\n  }\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\n  applyToRemoteDocument(\n    maybeDoc: MaybeDocument | null,\n    mutationResult: MutationResult\n  ): MaybeDocument {\n    fail('VerifyMutation should only be used in Transactions.');\n  }\n\n  applyToLocalView(\n    maybeDoc: MaybeDocument | null,\n    baseDoc: MaybeDocument | null,\n    localWriteTime: Timestamp\n  ): MaybeDocument | null {\n    fail('VerifyMutation should only be used in Transactions.');\n  }\n\n  extractBaseValue(maybeDoc: MaybeDocument | null): null {\n    fail('VerifyMutation should only be used in Transactions.');\n  }\n\n  isEqual(other: Mutation): boolean {\n    return (\n      other instanceof VerifyMutation &&\n      this.key.isEqual(other.key) &&\n      this.precondition.isEqual(other.precondition)\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 * as api from '../protos/firestore_proto_api';\n\nimport { debugAssert } from '../util/assert';\nimport { FieldMask } from './mutation';\nimport { FieldPath } from './path';\nimport { isServerTimestamp } from './server_timestamps';\nimport { valueEquals, isMapValue, typeOrder } from './values';\nimport { forEach } from '../util/obj';\n\nexport interface JsonObject<T> {\n  [name: string]: T;\n}\n\nexport const enum TypeOrder {\n  // This order is based on the backend's ordering, but modified to support\n  // server timestamps.\n  NullValue = 0,\n  BooleanValue = 1,\n  NumberValue = 2,\n  TimestampValue = 3,\n  ServerTimestampValue = 4,\n  StringValue = 5,\n  BlobValue = 6,\n  RefValue = 7,\n  GeoPointValue = 8,\n  ArrayValue = 9,\n  ObjectValue = 10\n}\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(public readonly proto: { mapValue: api.MapValue }) {\n    debugAssert(\n      !isServerTimestamp(proto),\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   * @return The value at the path or if there it doesn't exist.\n   */\n  field(path: FieldPath): api.Value | null {\n    if (path.isEmpty()) {\n      return this.proto;\n    } else {\n      let value: api.Value = this.proto;\n      for (let i = 0; i < path.length - 1; ++i) {\n        if (!value.mapValue!.fields) {\n          return null;\n        }\n        value = value.mapValue!.fields[path.get(i)];\n        if (!isMapValue(value)) {\n          return null;\n        }\n      }\n\n      value = (value.mapValue!.fields || {})[path.lastSegment()];\n      return value || null;\n    }\n  }\n\n  isEqual(other: ObjectValue): boolean {\n    return valueEquals(this.proto, other.proto);\n  }\n}\n\n/**\n * An Overlay, which contains an update to apply. Can either be Value proto, a\n * map of Overlay values (to represent additional nesting at the given key) or\n * `null` (to represent field deletes).\n */\ntype Overlay = Map<string, Overlay> | api.Value | null;\n\n/**\n * An ObjectValueBuilder provides APIs to set and delete fields from an\n * ObjectValue.\n */\nexport class ObjectValueBuilder {\n  /** A map that contains the accumulated changes in this builder. */\n  private overlayMap = new Map<string, Overlay>();\n\n  /**\n   * @param baseObject The object to mutate.\n   */\n  constructor(private readonly baseObject: ObjectValue = ObjectValue.empty()) {}\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   * @return The current Builder instance.\n   */\n  set(path: FieldPath, value: api.Value): ObjectValueBuilder {\n    debugAssert(\n      !path.isEmpty(),\n      'Cannot set field for empty path on ObjectValue'\n    );\n    this.setOverlay(path, value);\n    return this;\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   * @return The current Builder instance.\n   */\n  delete(path: FieldPath): ObjectValueBuilder {\n    debugAssert(\n      !path.isEmpty(),\n      'Cannot delete field for empty path on ObjectValue'\n    );\n    this.setOverlay(path, null);\n    return this;\n  }\n\n  /**\n   * Adds `value` to the overlay map at `path`. Creates nested map entries if\n   * needed.\n   */\n  private setOverlay(path: FieldPath, value: api.Value | null): void {\n    let currentLevel = this.overlayMap;\n\n    for (let i = 0; i < path.length - 1; ++i) {\n      const currentSegment = path.get(i);\n      let currentValue = currentLevel.get(currentSegment);\n\n      if (currentValue instanceof Map) {\n        // Re-use a previously created map\n        currentLevel = currentValue;\n      } else if (\n        currentValue &&\n        typeOrder(currentValue) === TypeOrder.ObjectValue\n      ) {\n        // Convert the existing Protobuf MapValue into a map\n        currentValue = new Map<string, Overlay>(\n          Object.entries(currentValue.mapValue!.fields || {})\n        );\n        currentLevel.set(currentSegment, currentValue);\n        currentLevel = currentValue;\n      } else {\n        // Create an empty map to represent the current nesting level\n        currentValue = new Map<string, Overlay>();\n        currentLevel.set(currentSegment, currentValue);\n        currentLevel = currentValue;\n      }\n    }\n\n    currentLevel.set(path.lastSegment(), value);\n  }\n\n  /** Returns an ObjectValue with all mutations applied. */\n  build(): ObjectValue {\n    const mergedResult = this.applyOverlay(\n      FieldPath.EMPTY_PATH,\n      this.overlayMap\n    );\n    if (mergedResult != null) {\n      return new ObjectValue(mergedResult);\n    } else {\n      return this.baseObject;\n    }\n  }\n\n  /**\n   * Applies any overlays from `currentOverlays` that exist at `currentPath`\n   * and returns the merged data at `currentPath` (or null if there were no\n   * changes).\n   *\n   * @param currentPath The path at the current nesting level. Can be set to\n   * FieldValue.EMPTY_PATH to represent the root.\n   * @param currentOverlays The overlays at the current nesting level in the\n   * same format as `overlayMap`.\n   * @return The merged data at `currentPath` or null if no modifications\n   * were applied.\n   */\n  private applyOverlay(\n    currentPath: FieldPath,\n    currentOverlays: Map<string, Overlay>\n  ): { mapValue: api.MapValue } | null {\n    let modified = false;\n\n    const existingValue = this.baseObject.field(currentPath);\n    const resultAtPath = isMapValue(existingValue)\n      ? // If there is already data at the current path, base our\n        // modifications on top of the existing data.\n        { ...existingValue.mapValue.fields }\n      : {};\n\n    currentOverlays.forEach((value, pathSegment) => {\n      if (value instanceof Map) {\n        const nested = this.applyOverlay(currentPath.child(pathSegment), value);\n        if (nested != null) {\n          resultAtPath[pathSegment] = nested;\n          modified = true;\n        }\n      } else if (value !== null) {\n        resultAtPath[pathSegment] = value;\n        modified = true;\n      } else if (resultAtPath.hasOwnProperty(pathSegment)) {\n        delete resultAtPath[pathSegment];\n        modified = true;\n      }\n    });\n\n    return modified ? { mapValue: { fields: resultAtPath } } : null;\n  }\n}\n\n/**\n * Returns a FieldMask built from all fields in a MapValue.\n */\nexport function extractFieldMask(value: api.MapValue): 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 { 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  // 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.INVALID_ARGUMENT;\n    // Other possibilities based on the forward mapping\n    // return Code.FAILED_PRECONDITION;\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('_', '-');\n  return Object.values(Code).indexOf(serverError as Code) >= 0\n    ? (serverError as Code)\n    : Code.UNKNOWN;\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 * as api from '../protos/firestore_proto_api';\n\nimport { SnapshotVersion } from '../core/snapshot_version';\nimport { fail } from '../util/assert';\n\nimport { DocumentKey } from './document_key';\nimport { ObjectValue } from './object_value';\nimport { FieldPath } from './path';\nimport { valueCompare } from './values';\n\nexport interface DocumentOptions {\n  hasLocalMutations?: boolean;\n  hasCommittedMutations?: boolean;\n}\n\n/**\n * The result of a lookup for a given path may be an existing document or a\n * marker that this document does not exist at a given version.\n */\nexport abstract class MaybeDocument {\n  constructor(readonly key: DocumentKey, readonly version: SnapshotVersion) {}\n\n  /**\n   * Whether this document had a local mutation applied that has not yet been\n   * acknowledged by Watch.\n   */\n  abstract get hasPendingWrites(): boolean;\n\n  abstract isEqual(other: MaybeDocument | null | undefined): boolean;\n\n  abstract toString(): string;\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 class Document extends MaybeDocument {\n  readonly hasLocalMutations: boolean;\n  readonly hasCommittedMutations: boolean;\n\n  constructor(\n    key: DocumentKey,\n    version: SnapshotVersion,\n    private readonly objectValue: ObjectValue,\n    options: DocumentOptions\n  ) {\n    super(key, version);\n    this.hasLocalMutations = !!options.hasLocalMutations;\n    this.hasCommittedMutations = !!options.hasCommittedMutations;\n  }\n\n  field(path: FieldPath): api.Value | null {\n    return this.objectValue.field(path);\n  }\n\n  data(): ObjectValue {\n    return this.objectValue;\n  }\n\n  toProto(): { mapValue: api.MapValue } {\n    return this.objectValue.proto;\n  }\n\n  isEqual(other: MaybeDocument | null | undefined): boolean {\n    return (\n      other instanceof Document &&\n      this.key.isEqual(other.key) &&\n      this.version.isEqual(other.version) &&\n      this.hasLocalMutations === other.hasLocalMutations &&\n      this.hasCommittedMutations === other.hasCommittedMutations &&\n      this.objectValue.isEqual(other.objectValue)\n    );\n  }\n\n  toString(): string {\n    return (\n      `Document(${this.key}, ${\n        this.version\n      }, ${this.objectValue.toString()}, ` +\n      `{hasLocalMutations: ${this.hasLocalMutations}}), ` +\n      `{hasCommittedMutations: ${this.hasCommittedMutations}})`\n    );\n  }\n\n  get hasPendingWrites(): boolean {\n    return this.hasLocalMutations || this.hasCommittedMutations;\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.field(field);\n  const v2 = d2.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/**\n * A class representing a deleted document.\n * Version is set to 0 if we don't point to any specific time, otherwise it\n * denotes time we know it didn't exist at.\n */\nexport class NoDocument extends MaybeDocument {\n  readonly hasCommittedMutations: boolean;\n\n  constructor(\n    key: DocumentKey,\n    version: SnapshotVersion,\n    options?: DocumentOptions\n  ) {\n    super(key, version);\n    this.hasCommittedMutations = !!(options && options.hasCommittedMutations);\n  }\n\n  toString(): string {\n    return `NoDocument(${this.key}, ${this.version})`;\n  }\n\n  get hasPendingWrites(): boolean {\n    return this.hasCommittedMutations;\n  }\n\n  isEqual(other: MaybeDocument | null | undefined): boolean {\n    return (\n      other instanceof NoDocument &&\n      other.hasCommittedMutations === this.hasCommittedMutations &&\n      other.version.isEqual(this.version) &&\n      other.key.isEqual(this.key)\n    );\n  }\n}\n\n/**\n * A class representing an existing document whose data is unknown (e.g. a\n * document that was updated without a known base document).\n */\nexport class UnknownDocument extends MaybeDocument {\n  toString(): string {\n    return `UnknownDocument(${this.key}, ${this.version})`;\n  }\n\n  get hasPendingWrites(): boolean {\n    return true;\n  }\n\n  isEqual(other: MaybeDocument | null | undefined): boolean {\n    return (\n      other instanceof UnknownDocument &&\n      other.version.isEqual(this.version) &&\n      other.key.isEqual(this.key)\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 { DocumentKey } from '../model/document_key';\nimport { ResourcePath } from '../model/path';\nimport { isNullOrUndefined } from '../util/types';\nimport { Bound, Filter, OrderBy } from './query';\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 class Target {\n  private memoizedCanonicalId: string | null = null;\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 constructor, because `Query` provides an implicit `orderBy`\n   * property.\n   */\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  canonicalId(): string {\n    if (this.memoizedCanonicalId === null) {\n      let canonicalId = this.path.canonicalString();\n      if (this.collectionGroup !== null) {\n        canonicalId += '|cg:' + this.collectionGroup;\n      }\n      canonicalId += '|f:';\n      canonicalId += this.filters.map(f => f.canonicalId()).join(',');\n      canonicalId += '|ob:';\n      canonicalId += this.orderBy.map(o => o.canonicalId()).join(',');\n\n      if (!isNullOrUndefined(this.limit)) {\n        canonicalId += '|l:';\n        canonicalId += this.limit!;\n      }\n      if (this.startAt) {\n        canonicalId += '|lb:';\n        canonicalId += this.startAt.canonicalId();\n      }\n      if (this.endAt) {\n        canonicalId += '|ub:';\n        canonicalId += this.endAt.canonicalId();\n      }\n      this.memoizedCanonicalId = canonicalId;\n    }\n    return this.memoizedCanonicalId;\n  }\n\n  toString(): string {\n    let str = this.path.canonicalString();\n    if (this.collectionGroup !== null) {\n      str += ' collectionGroup=' + this.collectionGroup;\n    }\n    if (this.filters.length > 0) {\n      str += `, filters: [${this.filters.join(', ')}]`;\n    }\n    if (!isNullOrUndefined(this.limit)) {\n      str += ', limit: ' + this.limit;\n    }\n    if (this.orderBy.length > 0) {\n      str += `, orderBy: [${this.orderBy.join(', ')}]`;\n    }\n    if (this.startAt) {\n      str += ', startAt: ' + this.startAt.canonicalId();\n    }\n    if (this.endAt) {\n      str += ', endAt: ' + this.endAt.canonicalId();\n    }\n    return `Target(${str})`;\n  }\n\n  isEqual(other: Target): boolean {\n    if (this.limit !== other.limit) {\n      return false;\n    }\n\n    if (this.orderBy.length !== other.orderBy.length) {\n      return false;\n    }\n\n    for (let i = 0; i < this.orderBy.length; i++) {\n      if (!this.orderBy[i].isEqual(other.orderBy[i])) {\n        return false;\n      }\n    }\n\n    if (this.filters.length !== other.filters.length) {\n      return false;\n    }\n\n    for (let i = 0; i < this.filters.length; i++) {\n      if (!this.filters[i].isEqual(other.filters[i])) {\n        return false;\n      }\n    }\n\n    if (this.collectionGroup !== other.collectionGroup) {\n      return false;\n    }\n\n    if (!this.path.isEqual(other.path)) {\n      return false;\n    }\n\n    if (\n      this.startAt !== null\n        ? !this.startAt.isEqual(other.startAt)\n        : other.startAt !== null\n    ) {\n      return false;\n    }\n\n    return this.endAt !== null\n      ? this.endAt.isEqual(other.endAt)\n      : other.endAt === null;\n  }\n\n  isDocumentQuery(): boolean {\n    return (\n      DocumentKey.isDocumentKey(this.path) &&\n      this.collectionGroup === null &&\n      this.filters.length === 0\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 * as api from '../protos/firestore_proto_api';\n\nimport { compareDocumentsByField, Document } from '../model/document';\nimport { DocumentKey } from '../model/document_key';\nimport {\n  canonicalId,\n  valueCompare,\n  arrayValueContains,\n  valueEquals,\n  isArray,\n  isNanValue,\n  isNullValue,\n  isReferenceValue,\n  typeOrder\n} from '../model/values';\nimport { FieldPath, ResourcePath } from '../model/path';\nimport { debugAssert, fail } from '../util/assert';\nimport { Code, FirestoreError } from '../util/error';\nimport { isNullOrUndefined } from '../util/types';\nimport { Target } from './target';\n\nexport const enum LimitType {\n  First = 'F',\n  Last = 'L'\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 */\nexport class Query {\n  static atPath(path: ResourcePath): Query {\n    return new Query(path);\n  }\n\n  private memoizedOrderBy: OrderBy[] | null = null;\n\n  // The corresponding `Target` of this `Query` instance.\n  private 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      this.assertValidBound(this.startAt);\n    }\n    if (this.endAt) {\n      this.assertValidBound(this.endAt);\n    }\n  }\n\n  get orderBy(): OrderBy[] {\n    if (this.memoizedOrderBy === null) {\n      this.memoizedOrderBy = [];\n\n      const inequalityField = this.getInequalityFilterField();\n      const firstOrderByField = this.getFirstOrderByField();\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          this.memoizedOrderBy.push(new OrderBy(inequalityField));\n        }\n        this.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 this.explicitOrderBy) {\n          this.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            this.explicitOrderBy.length > 0\n              ? this.explicitOrderBy[this.explicitOrderBy.length - 1].dir\n              : Direction.ASCENDING;\n          this.memoizedOrderBy.push(\n            new OrderBy(FieldPath.keyField(), lastDirection)\n          );\n        }\n      }\n    }\n    return this.memoizedOrderBy;\n  }\n\n  addFilter(filter: Filter): Query {\n    debugAssert(\n      this.getInequalityFilterField() == null ||\n        !(filter instanceof FieldFilter) ||\n        !filter.isInequality() ||\n        filter.field.isEqual(this.getInequalityFilterField()!),\n      'Query must only have one inequality field.'\n    );\n\n    debugAssert(\n      !this.isDocumentQuery(),\n      'No filtering allowed for document query'\n    );\n\n    const newFilters = this.filters.concat([filter]);\n    return new Query(\n      this.path,\n      this.collectionGroup,\n      this.explicitOrderBy.slice(),\n      newFilters,\n      this.limit,\n      this.limitType,\n      this.startAt,\n      this.endAt\n    );\n  }\n\n  addOrderBy(orderBy: OrderBy): Query {\n    debugAssert(\n      !this.startAt && !this.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 = this.explicitOrderBy.concat([orderBy]);\n    return new Query(\n      this.path,\n      this.collectionGroup,\n      newOrderBy,\n      this.filters.slice(),\n      this.limit,\n      this.limitType,\n      this.startAt,\n      this.endAt\n    );\n  }\n\n  withLimitToFirst(limit: number | null): Query {\n    return new Query(\n      this.path,\n      this.collectionGroup,\n      this.explicitOrderBy.slice(),\n      this.filters.slice(),\n      limit,\n      LimitType.First,\n      this.startAt,\n      this.endAt\n    );\n  }\n\n  withLimitToLast(limit: number | null): Query {\n    return new Query(\n      this.path,\n      this.collectionGroup,\n      this.explicitOrderBy.slice(),\n      this.filters.slice(),\n      limit,\n      LimitType.Last,\n      this.startAt,\n      this.endAt\n    );\n  }\n\n  withStartAt(bound: Bound): Query {\n    return new Query(\n      this.path,\n      this.collectionGroup,\n      this.explicitOrderBy.slice(),\n      this.filters.slice(),\n      this.limit,\n      this.limitType,\n      bound,\n      this.endAt\n    );\n  }\n\n  withEndAt(bound: Bound): Query {\n    return new Query(\n      this.path,\n      this.collectionGroup,\n      this.explicitOrderBy.slice(),\n      this.filters.slice(),\n      this.limit,\n      this.limitType,\n      this.startAt,\n      bound\n    );\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   */\n  asCollectionQueryAtPath(path: ResourcePath): Query {\n    return new Query(\n      path,\n      /*collectionGroup=*/ null,\n      this.explicitOrderBy.slice(),\n      this.filters.slice(),\n      this.limit,\n      this.limitType,\n      this.startAt,\n      this.endAt\n    );\n  }\n\n  /**\n   * Returns true if this query does not specify any query constraints that\n   * could remove results.\n   */\n  matchesAllDocuments(): boolean {\n    return (\n      this.filters.length === 0 &&\n      this.limit === null &&\n      this.startAt == null &&\n      this.endAt == null &&\n      (this.explicitOrderBy.length === 0 ||\n        (this.explicitOrderBy.length === 1 &&\n          this.explicitOrderBy[0].field.isKeyField()))\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.\n  canonicalId(): string {\n    return `${this.toTarget().canonicalId()}|lt:${this.limitType}`;\n  }\n\n  toString(): string {\n    return `Query(target=${this.toTarget().toString()}; limitType=${\n      this.limitType\n    })`;\n  }\n\n  isEqual(other: Query): boolean {\n    return (\n      this.toTarget().isEqual(other.toTarget()) &&\n      this.limitType === other.limitType\n    );\n  }\n\n  docComparator(d1: Document, d2: Document): number {\n    let comparedOnKeyField = false;\n    for (const orderBy of this.orderBy) {\n      const comp = orderBy.compare(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  matches(doc: Document): boolean {\n    return (\n      this.matchesPathAndCollectionGroup(doc) &&\n      this.matchesOrderBy(doc) &&\n      this.matchesFilters(doc) &&\n      this.matchesBounds(doc)\n    );\n  }\n\n  hasLimitToFirst(): boolean {\n    return !isNullOrUndefined(this.limit) && this.limitType === LimitType.First;\n  }\n\n  hasLimitToLast(): boolean {\n    return !isNullOrUndefined(this.limit) && this.limitType === LimitType.Last;\n  }\n\n  getFirstOrderByField(): FieldPath | null {\n    return this.explicitOrderBy.length > 0\n      ? this.explicitOrderBy[0].field\n      : null;\n  }\n\n  getInequalityFilterField(): FieldPath | null {\n    for (const filter of this.filters) {\n      if (filter instanceof FieldFilter && filter.isInequality()) {\n        return filter.field;\n      }\n    }\n    return null;\n  }\n\n  // Checks if any of the provided Operators are included in the query and\n  // returns the first one that is, or null if none are.\n  findFilterOperator(operators: Operator[]): Operator | null {\n    for (const filter of this.filters) {\n      if (filter instanceof FieldFilter) {\n        if (operators.indexOf(filter.op) >= 0) {\n          return filter.op;\n        }\n      }\n    }\n    return null;\n  }\n\n  isDocumentQuery(): boolean {\n    return this.toTarget().isDocumentQuery();\n  }\n\n  isCollectionGroupQuery(): boolean {\n    return this.collectionGroup !== null;\n  }\n\n  /**\n   * Converts this `Query` instance to it's corresponding `Target`\n   * representation.\n   */\n  toTarget(): Target {\n    if (!this.memoizedTarget) {\n      if (this.limitType === LimitType.First) {\n        this.memoizedTarget = new Target(\n          this.path,\n          this.collectionGroup,\n          this.orderBy,\n          this.filters,\n          this.limit,\n          this.startAt,\n          this.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 this.orderBy) {\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 = this.endAt\n          ? new Bound(this.endAt.position, !this.endAt.before)\n          : null;\n        const endAt = this.startAt\n          ? new Bound(this.startAt.position, !this.startAt.before)\n          : null;\n\n        // Now return as a LimitType.First query.\n        this.memoizedTarget = new Target(\n          this.path,\n          this.collectionGroup,\n          orderBys,\n          this.filters,\n          this.limit,\n          startAt,\n          endAt\n        );\n      }\n    }\n    return this.memoizedTarget!;\n  }\n\n  private matchesPathAndCollectionGroup(doc: Document): boolean {\n    const docPath = doc.key.path;\n    if (this.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(this.collectionGroup) &&\n        this.path.isPrefixOf(docPath)\n      );\n    } else if (DocumentKey.isDocumentKey(this.path)) {\n      // exact match for document queries\n      return this.path.isEqual(docPath);\n    } else {\n      // shallow ancestor queries by default\n      return this.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   */\n  private matchesOrderBy(doc: Document): boolean {\n    for (const orderBy of this.explicitOrderBy) {\n      // order by key always matches\n      if (!orderBy.field.isKeyField() && doc.field(orderBy.field) === null) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  private matchesFilters(doc: Document): boolean {\n    for (const filter of this.filters) {\n      if (!filter.matches(doc)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  /**\n   * Makes sure a document is within the bounds, if provided.\n   */\n  private matchesBounds(doc: Document): boolean {\n    if (this.startAt && !this.startAt.sortsBeforeDocument(this.orderBy, doc)) {\n      return false;\n    }\n    if (this.endAt && this.endAt.sortsBeforeDocument(this.orderBy, doc)) {\n      return false;\n    }\n    return true;\n  }\n\n  private assertValidBound(bound: Bound): void {\n    debugAssert(\n      bound.position.length <= this.orderBy.length,\n      'Bound is longer than orderBy'\n    );\n  }\n}\n\nexport abstract class Filter {\n  abstract matches(doc: Document): boolean;\n  abstract canonicalId(): string;\n  abstract isEqual(filter: Filter): boolean;\n}\n\nexport const enum Operator {\n  LESS_THAN = '<',\n  LESS_THAN_OR_EQUAL = '<=',\n  EQUAL = '==',\n  GREATER_THAN = '>',\n  GREATER_THAN_OR_EQUAL = '>=',\n  ARRAY_CONTAINS = 'array-contains',\n  IN = 'in',\n  ARRAY_CONTAINS_ANY = 'array-contains-any'\n}\n\nexport class FieldFilter extends Filter {\n  protected constructor(\n    public field: FieldPath,\n    public op: Operator,\n    public value: api.Value\n  ) {\n    super();\n  }\n\n  /**\n   * Creates a filter based on the provided arguments.\n   */\n  static create(field: FieldPath, op: Operator, value: api.Value): FieldFilter {\n    if (field.isKeyField()) {\n      if (op === Operator.IN) {\n        debugAssert(\n          isArray(value),\n          'Comparing on key with IN, but filter value not an ArrayValue'\n        );\n        debugAssert(\n          (value.arrayValue.values || []).every(elem => isReferenceValue(elem)),\n          'Comparing on key with IN, but an array value was not a RefValue'\n        );\n        return new KeyFieldInFilter(field, 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 (isNullValue(value)) {\n      if (op !== Operator.EQUAL) {\n        throw new FirestoreError(\n          Code.INVALID_ARGUMENT,\n          'Invalid query. Null supports only equality comparisons.'\n        );\n      }\n      return new FieldFilter(field, op, value);\n    } else if (isNanValue(value)) {\n      if (op !== Operator.EQUAL) {\n        throw new FirestoreError(\n          Code.INVALID_ARGUMENT,\n          'Invalid query. NaN supports only equality comparisons.'\n        );\n      }\n      return new FieldFilter(field, op, value);\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.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  matches(doc: Document): boolean {\n    const other = doc.field(this.field);\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.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      ].indexOf(this.op) >= 0\n    );\n  }\n\n  canonicalId(): string {\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      this.field.canonicalString() +\n      this.op.toString() +\n      canonicalId(this.value)\n    );\n  }\n\n  isEqual(other: Filter): boolean {\n    if (other instanceof FieldFilter) {\n      return (\n        this.op === other.op &&\n        this.field.isEqual(other.field) &&\n        valueEquals(this.value, other.value)\n      );\n    } else {\n      return false;\n    }\n  }\n\n  toString(): string {\n    return `${this.field.canonicalString()} ${this.op} ${canonicalId(\n      this.value\n    )}`;\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: api.Value) {\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: api.Value) {\n    super(field, Operator.IN, value);\n    debugAssert(isArray(value), 'KeyFieldInFilter expects an ArrayValue');\n    this.keys = (value.arrayValue.values || []).map(v => {\n      debugAssert(\n        isReferenceValue(v),\n        'Comparing on key with IN, but an array value was not a ReferenceValue'\n      );\n      return DocumentKey.fromName(v.referenceValue);\n    });\n  }\n\n  matches(doc: Document): boolean {\n    return this.keys.some(key => key.isEqual(doc.key));\n  }\n}\n\n/** A Filter that implements the array-contains operator. */\nexport class ArrayContainsFilter extends FieldFilter {\n  constructor(field: FieldPath, value: api.Value) {\n    super(field, Operator.ARRAY_CONTAINS, value);\n  }\n\n  matches(doc: Document): boolean {\n    const other = doc.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: api.Value) {\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.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: api.Value) {\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.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/**\n * The direction of sorting in an order by.\n */\nexport const enum Direction {\n  ASCENDING = 'asc',\n  DESCENDING = 'desc'\n}\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: api.Value[], readonly before: boolean) {}\n\n  canonicalId(): string {\n    // TODO(b/29183165): Make this collision robust.\n    return `${this.before ? 'b' : 'a'}:${this.position\n      .map(p => canonicalId(p))\n      .join(',')}`;\n  }\n\n  /**\n   * Returns true if a document sorts before a bound using the provided sort\n   * order.\n   */\n  sortsBeforeDocument(orderBy: OrderBy[], doc: Document): boolean {\n    debugAssert(\n      this.position.length <= orderBy.length,\n      \"Bound has more components than query's orderBy\"\n    );\n    let comparison = 0;\n    for (let i = 0; i < this.position.length; i++) {\n      const orderByComponent = orderBy[i];\n      const component = this.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.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 this.before ? comparison <= 0 : comparison < 0;\n  }\n\n  isEqual(other: Bound | null): boolean {\n    if (other === null) {\n      return false;\n    }\n    if (\n      this.before !== other.before ||\n      this.position.length !== other.position.length\n    ) {\n      return false;\n    }\n    for (let i = 0; i < this.position.length; i++) {\n      const thisPosition = this.position[i];\n      const otherPosition = other.position[i];\n      if (!valueEquals(thisPosition, otherPosition)) {\n        return false;\n      }\n    }\n    return true;\n  }\n}\n\n/**\n * An ordering on a field, in some Direction. Direction defaults to ASCENDING.\n */\nexport class OrderBy {\n  readonly dir: Direction;\n  private readonly isKeyOrderBy: boolean;\n\n  constructor(readonly field: FieldPath, dir?: Direction) {\n    if (dir === undefined) {\n      dir = Direction.ASCENDING;\n    }\n    this.dir = dir;\n    this.isKeyOrderBy = field.isKeyField();\n  }\n\n  compare(d1: Document, d2: Document): number {\n    const comparison = this.isKeyOrderBy\n      ? DocumentKey.comparator(d1.key, d2.key)\n      : compareDocumentsByField(this.field, d1, d2);\n    switch (this.dir) {\n      case Direction.ASCENDING:\n        return comparison;\n      case Direction.DESCENDING:\n        return -1 * comparison;\n      default:\n        return fail('Unknown direction: ' + this.dir);\n    }\n  }\n\n  canonicalId(): string {\n    // TODO(b/29183165): Make this collision robust.\n    return this.field.canonicalString() + this.dir.toString();\n  }\n\n  toString(): string {\n    return `${this.field.canonicalString()} (${this.dir})`;\n  }\n\n  isEqual(other: OrderBy): boolean {\n    return this.dir === other.dir && this.field.isEqual(other.field);\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 { Target } from '../core/target';\nimport { ListenSequenceNumber, TargetId } from '../core/types';\nimport { ByteString } from '../util/byte_string';\n\n/** An enumeration of the different purposes we have for targets. */\nexport const enum TargetPurpose {\n  /** A regular, normal query target. */\n  Listen,\n\n  /**\n   * The query target was used to refill a query after an existence filter mismatch.\n   */\n  ExistenceFilterMismatch,\n\n  /** The query target was used to resolve a limbo document. */\n  LimboResolution\n}\n\n/**\n * An immutable set of metadata that the local store tracks for each target.\n */\nexport class TargetData {\n  constructor(\n    /** The target being listened to. */\n    readonly target: Target,\n    /**\n     * The target ID to which the target corresponds; Assigned by the\n     * LocalStore for user listens and by the SyncEngine for limbo watches.\n     */\n    readonly targetId: TargetId,\n    /** The purpose of the target. */\n    readonly purpose: TargetPurpose,\n    /**\n     * The sequence number of the last transaction during which this target data\n     * was modified.\n     */\n    readonly sequenceNumber: ListenSequenceNumber,\n    /** The latest snapshot version seen for this target. */\n    readonly snapshotVersion: SnapshotVersion = SnapshotVersion.min(),\n    /**\n     * The maximum snapshot version at which the associated view\n     * contained no limbo documents.\n     */\n    readonly lastLimboFreeSnapshotVersion: SnapshotVersion = SnapshotVersion.min(),\n    /**\n     * An opaque, server-assigned token that allows watching a target to be\n     * resumed after disconnecting without retransmitting all the data that\n     * matches the target. The resume token essentially identifies a point in\n     * time from which the server should resume sending results.\n     */\n    readonly resumeToken: ByteString = ByteString.EMPTY_BYTE_STRING\n  ) {}\n\n  /** Creates a new target data instance with an updated sequence number. */\n  withSequenceNumber(sequenceNumber: number): TargetData {\n    return new TargetData(\n      this.target,\n      this.targetId,\n      this.purpose,\n      sequenceNumber,\n      this.snapshotVersion,\n      this.lastLimboFreeSnapshotVersion,\n      this.resumeToken\n    );\n  }\n\n  /**\n   * Creates a new target data instance with an updated resume token and\n   * snapshot version.\n   */\n  withResumeToken(\n    resumeToken: ByteString,\n    snapshotVersion: SnapshotVersion\n  ): TargetData {\n    return new TargetData(\n      this.target,\n      this.targetId,\n      this.purpose,\n      this.sequenceNumber,\n      snapshotVersion,\n      this.lastLimboFreeSnapshotVersion,\n      resumeToken\n    );\n  }\n\n  /**\n   * Creates a new target data instance with an updated last limbo free\n   * snapshot version number.\n   */\n  withLastLimboFreeSnapshotVersion(\n    lastLimboFreeSnapshotVersion: SnapshotVersion\n  ): TargetData {\n    return new TargetData(\n      this.target,\n      this.targetId,\n      this.purpose,\n      this.sequenceNumber,\n      this.snapshotVersion,\n      lastLimboFreeSnapshotVersion,\n      this.resumeToken\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\nexport class ExistenceFilter {\n  // TODO(b/33078163): just use simplest form of existence filter for now\n  constructor(public count: number) {}\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 (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 * @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 { SortedMap } from '../util/sorted_map';\nimport { SortedSet } from '../util/sorted_set';\n\nimport { TargetId } from '../core/types';\nimport { primitiveComparator } from '../util/misc';\nimport { Document, MaybeDocument } from './document';\nimport { DocumentKey } from './document_key';\n\n/** Miscellaneous collection types / constants. */\nexport interface DocumentSizeEntry {\n  maybeDocument: MaybeDocument;\n  size: number;\n}\n\nexport type MaybeDocumentMap = SortedMap<DocumentKey, MaybeDocument>;\nconst EMPTY_MAYBE_DOCUMENT_MAP = new SortedMap<DocumentKey, MaybeDocument>(\n  DocumentKey.comparator\n);\nexport function maybeDocumentMap(): MaybeDocumentMap {\n  return EMPTY_MAYBE_DOCUMENT_MAP;\n}\n\nexport type NullableMaybeDocumentMap = SortedMap<\n  DocumentKey,\n  MaybeDocument | null\n>;\n\nexport function nullableMaybeDocumentMap(): NullableMaybeDocumentMap {\n  return maybeDocumentMap();\n}\n\nexport interface DocumentSizeEntries {\n  maybeDocuments: NullableMaybeDocumentMap;\n  sizeMap: SortedMap<DocumentKey, number>;\n}\n\nexport type DocumentMap = SortedMap<DocumentKey, Document>;\nconst EMPTY_DOCUMENT_MAP = new SortedMap<DocumentKey, Document>(\n  DocumentKey.comparator\n);\nexport function documentMap(): DocumentMap {\n  return EMPTY_DOCUMENT_MAP;\n}\n\nexport type DocumentVersionMap = SortedMap<DocumentKey, SnapshotVersion>;\nconst EMPTY_DOCUMENT_VERSION_MAP = new SortedMap<DocumentKey, SnapshotVersion>(\n  DocumentKey.comparator\n);\nexport function documentVersionMap(): DocumentVersionMap {\n  return EMPTY_DOCUMENT_VERSION_MAP;\n}\n\nexport type DocumentKeySet = SortedSet<DocumentKey>;\nconst EMPTY_DOCUMENT_KEY_SET = new SortedSet(DocumentKey.comparator);\nexport function documentKeySet(...keys: DocumentKey[]): DocumentKeySet {\n  let set = EMPTY_DOCUMENT_KEY_SET;\n  for (const key of keys) {\n    set = set.add(key);\n  }\n  return set;\n}\n\nexport type TargetIdSet = SortedSet<TargetId>;\nconst EMPTY_TARGET_ID_SET = new SortedSet<TargetId>(primitiveComparator);\nexport function targetIdSet(): SortedSet<TargetId> {\n  return EMPTY_TARGET_ID_SET;\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 { SortedMap } from '../util/sorted_map';\n\nimport { documentMap } from './collections';\nimport { Document } from './document';\nimport { DocumentComparator } from './document_comparator';\nimport { DocumentKey } from './document_key';\n\n/**\n * DocumentSet is an immutable (copy-on-write) collection that holds documents\n * in order specified by the provided comparator. We always add a document key\n * comparator on top of what is provided to guarantee document equality based on\n * the key.\n */\n\nexport class DocumentSet {\n  /**\n   * Returns an empty copy of the existing DocumentSet, using the same\n   * comparator.\n   */\n  static emptySet(oldSet: DocumentSet): DocumentSet {\n    return new DocumentSet(oldSet.comparator);\n  }\n\n  private comparator: DocumentComparator;\n  private keyedMap: SortedMap<DocumentKey, Document>;\n  private sortedSet: SortedMap<Document, null>;\n\n  /** The default ordering is by key if the comparator is omitted */\n  constructor(comp?: DocumentComparator) {\n    // We are adding document key comparator to the end as it's the only\n    // guaranteed unique property of a document.\n    if (comp) {\n      this.comparator = (d1: Document, d2: Document) =>\n        comp(d1, d2) || DocumentKey.comparator(d1.key, d2.key);\n    } else {\n      this.comparator = (d1: Document, d2: Document) =>\n        DocumentKey.comparator(d1.key, d2.key);\n    }\n\n    this.keyedMap = documentMap();\n    this.sortedSet = new SortedMap<Document, null>(this.comparator);\n  }\n\n  has(key: DocumentKey): boolean {\n    return this.keyedMap.get(key) != null;\n  }\n\n  get(key: DocumentKey): Document | null {\n    return this.keyedMap.get(key);\n  }\n\n  first(): Document | null {\n    return this.sortedSet.minKey();\n  }\n\n  last(): Document | null {\n    return this.sortedSet.maxKey();\n  }\n\n  isEmpty(): boolean {\n    return this.sortedSet.isEmpty();\n  }\n\n  /**\n   * Returns the index of the provided key in the document set, or -1 if the\n   * document key is not present in the set;\n   */\n  indexOf(key: DocumentKey): number {\n    const doc = this.keyedMap.get(key);\n    return doc ? this.sortedSet.indexOf(doc) : -1;\n  }\n\n  get size(): number {\n    return this.sortedSet.size;\n  }\n\n  /** Iterates documents in order defined by \"comparator\" */\n  forEach(cb: (doc: Document) => void): void {\n    this.sortedSet.inorderTraversal((k, v) => {\n      cb(k);\n      return false;\n    });\n  }\n\n  /** Inserts or updates a document with the same key */\n  add(doc: Document): DocumentSet {\n    // First remove the element if we have it.\n    const set = this.delete(doc.key);\n    return set.copy(\n      set.keyedMap.insert(doc.key, doc),\n      set.sortedSet.insert(doc, null)\n    );\n  }\n\n  /** Deletes a document with a given key */\n  delete(key: DocumentKey): DocumentSet {\n    const doc = this.get(key);\n    if (!doc) {\n      return this;\n    }\n\n    return this.copy(this.keyedMap.remove(key), this.sortedSet.remove(doc));\n  }\n\n  isEqual(other: DocumentSet | null | undefined): boolean {\n    if (!(other instanceof DocumentSet)) {\n      return false;\n    }\n    if (this.size !== other.size) {\n      return false;\n    }\n\n    const thisIt = this.sortedSet.getIterator();\n    const otherIt = other.sortedSet.getIterator();\n    while (thisIt.hasNext()) {\n      const thisDoc = thisIt.getNext().key;\n      const otherDoc = otherIt.getNext().key;\n      if (!thisDoc.isEqual(otherDoc)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  toString(): string {\n    const docStrings: string[] = [];\n    this.forEach(doc => {\n      docStrings.push(doc.toString());\n    });\n    if (docStrings.length === 0) {\n      return 'DocumentSet ()';\n    } else {\n      return 'DocumentSet (\\n  ' + docStrings.join('  \\n') + '\\n)';\n    }\n  }\n\n  private copy(\n    keyedMap: SortedMap<DocumentKey, Document>,\n    sortedSet: SortedMap<Document, null>\n  ): DocumentSet {\n    const newSet = new DocumentSet();\n    newSet.comparator = this.comparator;\n    newSet.keyedMap = keyedMap;\n    newSet.sortedSet = sortedSet;\n    return newSet;\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 { Document } from '../model/document';\nimport { DocumentKey } from '../model/document_key';\nimport { DocumentSet } from '../model/document_set';\nimport { fail } from '../util/assert';\nimport { SortedMap } from '../util/sorted_map';\n\nimport { DocumentKeySet } from '../model/collections';\nimport { Query } from './query';\n\nexport const enum ChangeType {\n  Added,\n  Removed,\n  Modified,\n  Metadata\n}\n\nexport interface DocumentViewChange {\n  type: ChangeType;\n  doc: Document;\n}\n\nexport const enum SyncState {\n  Local,\n  Synced\n}\n\n/**\n * DocumentChangeSet keeps track of a set of changes to docs in a query, merging\n * duplicate events for the same doc.\n */\nexport class DocumentChangeSet {\n  private changeMap = new SortedMap<DocumentKey, DocumentViewChange>(\n    DocumentKey.comparator\n  );\n\n  track(change: DocumentViewChange): void {\n    const key = change.doc.key;\n    const oldChange = this.changeMap.get(key);\n    if (!oldChange) {\n      this.changeMap = this.changeMap.insert(key, change);\n      return;\n    }\n\n    // Merge the new change with the existing change.\n    if (\n      change.type !== ChangeType.Added &&\n      oldChange.type === ChangeType.Metadata\n    ) {\n      this.changeMap = this.changeMap.insert(key, change);\n    } else if (\n      change.type === ChangeType.Metadata &&\n      oldChange.type !== ChangeType.Removed\n    ) {\n      this.changeMap = this.changeMap.insert(key, {\n        type: oldChange.type,\n        doc: change.doc\n      });\n    } else if (\n      change.type === ChangeType.Modified &&\n      oldChange.type === ChangeType.Modified\n    ) {\n      this.changeMap = this.changeMap.insert(key, {\n        type: ChangeType.Modified,\n        doc: change.doc\n      });\n    } else if (\n      change.type === ChangeType.Modified &&\n      oldChange.type === ChangeType.Added\n    ) {\n      this.changeMap = this.changeMap.insert(key, {\n        type: ChangeType.Added,\n        doc: change.doc\n      });\n    } else if (\n      change.type === ChangeType.Removed &&\n      oldChange.type === ChangeType.Added\n    ) {\n      this.changeMap = this.changeMap.remove(key);\n    } else if (\n      change.type === ChangeType.Removed &&\n      oldChange.type === ChangeType.Modified\n    ) {\n      this.changeMap = this.changeMap.insert(key, {\n        type: ChangeType.Removed,\n        doc: oldChange.doc\n      });\n    } else if (\n      change.type === ChangeType.Added &&\n      oldChange.type === ChangeType.Removed\n    ) {\n      this.changeMap = this.changeMap.insert(key, {\n        type: ChangeType.Modified,\n        doc: change.doc\n      });\n    } else {\n      // This includes these cases, which don't make sense:\n      // Added->Added\n      // Removed->Removed\n      // Modified->Added\n      // Removed->Modified\n      // Metadata->Added\n      // Removed->Metadata\n      fail(\n        'unsupported combination of changes: ' +\n          JSON.stringify(change) +\n          ' after ' +\n          JSON.stringify(oldChange)\n      );\n    }\n  }\n\n  getChanges(): DocumentViewChange[] {\n    const changes: DocumentViewChange[] = [];\n    this.changeMap.inorderTraversal(\n      (key: DocumentKey, change: DocumentViewChange) => {\n        changes.push(change);\n      }\n    );\n    return changes;\n  }\n}\n\nexport class ViewSnapshot {\n  constructor(\n    readonly query: Query,\n    readonly docs: DocumentSet,\n    readonly oldDocs: DocumentSet,\n    readonly docChanges: DocumentViewChange[],\n    readonly mutatedKeys: DocumentKeySet,\n    readonly fromCache: boolean,\n    readonly syncStateChanged: boolean,\n    readonly excludesMetadataChanges: boolean\n  ) {}\n\n  /** Returns a view snapshot as if all documents in the snapshot were added. */\n  static fromInitialDocuments(\n    query: Query,\n    documents: DocumentSet,\n    mutatedKeys: DocumentKeySet,\n    fromCache: boolean\n  ): ViewSnapshot {\n    const changes: DocumentViewChange[] = [];\n    documents.forEach(doc => {\n      changes.push({ type: ChangeType.Added, doc });\n    });\n\n    return new ViewSnapshot(\n      query,\n      documents,\n      DocumentSet.emptySet(documents),\n      changes,\n      mutatedKeys,\n      fromCache,\n      /* syncStateChanged= */ true,\n      /* excludesMetadataChanges= */ false\n    );\n  }\n\n  get hasPendingWrites(): boolean {\n    return !this.mutatedKeys.isEmpty();\n  }\n\n  isEqual(other: ViewSnapshot): boolean {\n    if (\n      this.fromCache !== other.fromCache ||\n      this.syncStateChanged !== other.syncStateChanged ||\n      !this.mutatedKeys.isEqual(other.mutatedKeys) ||\n      !this.query.isEqual(other.query) ||\n      !this.docs.isEqual(other.docs) ||\n      !this.oldDocs.isEqual(other.oldDocs)\n    ) {\n      return false;\n    }\n    const changes: DocumentViewChange[] = this.docChanges;\n    const otherChanges: DocumentViewChange[] = other.docChanges;\n    if (changes.length !== otherChanges.length) {\n      return false;\n    }\n    for (let i = 0; i < changes.length; i++) {\n      if (\n        changes[i].type !== otherChanges[i].type ||\n        !changes[i].doc.isEqual(otherChanges[i].doc)\n      ) {\n        return false;\n      }\n    }\n    return true;\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 { TargetId } from '../core/types';\nimport {\n  documentKeySet,\n  DocumentKeySet,\n  maybeDocumentMap,\n  MaybeDocumentMap,\n  targetIdSet\n} from '../model/collections';\nimport { SortedSet } from '../util/sorted_set';\nimport { ByteString } from '../util/byte_string';\n\n/**\n * An event from the RemoteStore. It is split into targetChanges (changes to the\n * state or the set of documents in our watched targets) and documentUpdates\n * (changes to the actual documents).\n */\nexport class RemoteEvent {\n  constructor(\n    /**\n     * The snapshot version this event brings us up to, or MIN if not set.\n     */\n    readonly snapshotVersion: SnapshotVersion,\n    /**\n     * A map from target to changes to the target. See TargetChange.\n     */\n    readonly targetChanges: Map<TargetId, TargetChange>,\n    /**\n     * A set of targets that is known to be inconsistent. Listens for these\n     * targets should be re-established without resume tokens.\n     */\n    readonly targetMismatches: SortedSet<TargetId>,\n    /**\n     * A set of which documents have changed or been deleted, along with the\n     * doc's new values (if not deleted).\n     */\n    readonly documentUpdates: MaybeDocumentMap,\n    /**\n     * A set of which document updates are due only to limbo resolution targets.\n     */\n    readonly resolvedLimboDocuments: DocumentKeySet\n  ) {}\n\n  /**\n   * HACK: Views require RemoteEvents in order to determine whether the view is\n   * CURRENT, but secondary tabs don't receive remote events. So this method is\n   * used to create a synthesized RemoteEvent that can be used to apply a\n   * CURRENT status change to a View, for queries executed in a different tab.\n   */\n  // PORTING NOTE: Multi-tab only\n  static createSynthesizedRemoteEventForCurrentChange(\n    targetId: TargetId,\n    current: boolean\n  ): RemoteEvent {\n    const targetChanges = new Map<TargetId, TargetChange>();\n    targetChanges.set(\n      targetId,\n      TargetChange.createSynthesizedTargetChangeForCurrentChange(\n        targetId,\n        current\n      )\n    );\n    return new RemoteEvent(\n      SnapshotVersion.min(),\n      targetChanges,\n      targetIdSet(),\n      maybeDocumentMap(),\n      documentKeySet()\n    );\n  }\n}\n\n/**\n * A TargetChange specifies the set of changes for a specific target as part of\n * a RemoteEvent. These changes track which documents are added, modified or\n * removed, as well as the target's resume token and whether the target is\n * marked CURRENT.\n * The actual changes *to* documents are not part of the TargetChange since\n * documents may be part of multiple targets.\n */\nexport class TargetChange {\n  constructor(\n    /**\n     * An opaque, server-assigned token that allows watching a query to be resumed\n     * after disconnecting without retransmitting all the data that matches the\n     * query. The resume token essentially identifies a point in time from which\n     * the server should resume sending results.\n     */\n    readonly resumeToken: ByteString,\n    /**\n     * The \"current\" (synced) status of this target. Note that \"current\"\n     * has special meaning in the RPC protocol that implies that a target is\n     * both up-to-date and consistent with the rest of the watch stream.\n     */\n    readonly current: boolean,\n    /**\n     * The set of documents that were newly assigned to this target as part of\n     * this remote event.\n     */\n    readonly addedDocuments: DocumentKeySet,\n    /**\n     * The set of documents that were already assigned to this target but received\n     * an update during this remote event.\n     */\n    readonly modifiedDocuments: DocumentKeySet,\n    /**\n     * The set of documents that were removed from this target as part of this\n     * remote event.\n     */\n    readonly removedDocuments: DocumentKeySet\n  ) {}\n\n  /**\n   * This method is used to create a synthesized TargetChanges that can be used to\n   * apply a CURRENT status change to a View (for queries executed in a different\n   * tab) or for new queries (to raise snapshots with correct CURRENT status).\n   */\n  static createSynthesizedTargetChangeForCurrentChange(\n    targetId: TargetId,\n    current: boolean\n  ): TargetChange {\n    return new TargetChange(\n      ByteString.EMPTY_BYTE_STRING,\n      current,\n      documentKeySet(),\n      documentKeySet(),\n      documentKeySet()\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 { SnapshotVersion } from '../core/snapshot_version';\nimport { TargetId } from '../core/types';\nimport { ChangeType } from '../core/view_snapshot';\nimport { TargetData, TargetPurpose } from '../local/target_data';\nimport {\n  documentKeySet,\n  DocumentKeySet,\n  maybeDocumentMap\n} from '../model/collections';\nimport { Document, MaybeDocument, NoDocument } from '../model/document';\nimport { DocumentKey } from '../model/document_key';\nimport { debugAssert, fail, hardAssert } from '../util/assert';\nimport { FirestoreError } from '../util/error';\nimport { logDebug } from '../util/log';\nimport { primitiveComparator } from '../util/misc';\nimport { SortedMap } from '../util/sorted_map';\nimport { SortedSet } from '../util/sorted_set';\nimport { ExistenceFilter } from './existence_filter';\nimport { RemoteEvent, TargetChange } from './remote_event';\nimport { ByteString } from '../util/byte_string';\n\n/**\n * Internal representation of the watcher API protocol buffers.\n */\nexport type WatchChange =\n  | DocumentWatchChange\n  | WatchTargetChange\n  | ExistenceFilterChange;\n\n/**\n * Represents a changed document and a list of target ids to which this change\n * applies.\n *\n * If document has been deleted NoDocument will be provided.\n */\nexport class DocumentWatchChange {\n  constructor(\n    /** The new document applies to all of these targets. */\n    public updatedTargetIds: TargetId[],\n    /** The new document is removed from all of these targets. */\n    public removedTargetIds: TargetId[],\n    /** The key of the document for this change. */\n    public key: DocumentKey,\n    /**\n     * The new document or NoDocument if it was deleted. Is null if the\n     * document went out of view without the server sending a new document.\n     */\n    public newDoc: MaybeDocument | null\n  ) {}\n}\n\nexport class ExistenceFilterChange {\n  constructor(\n    public targetId: TargetId,\n    public existenceFilter: ExistenceFilter\n  ) {}\n}\n\nexport const enum WatchTargetChangeState {\n  NoChange,\n  Added,\n  Removed,\n  Current,\n  Reset\n}\n\nexport class WatchTargetChange {\n  constructor(\n    /** What kind of change occurred to the watch target. */\n    public state: WatchTargetChangeState,\n    /** The target IDs that were added/removed/set. */\n    public targetIds: TargetId[],\n    /**\n     * An opaque, server-assigned token that allows watching a target to be\n     * resumed after disconnecting without retransmitting all the data that\n     * matches the target. The resume token essentially identifies a point in\n     * time from which the server should resume sending results.\n     */\n    public resumeToken: ByteString = ByteString.EMPTY_BYTE_STRING,\n    /** An RPC error indicating why the watch failed. */\n    public cause: FirestoreError | null = null\n  ) {}\n}\n\n/** Tracks the internal state of a Watch target. */\nclass TargetState {\n  /**\n   * The number of pending responses (adds or removes) that we are waiting on.\n   * We only consider targets active that have no pending responses.\n   */\n  private pendingResponses = 0;\n\n  /**\n   * Keeps track of the document changes since the last raised snapshot.\n   *\n   * These changes are continuously updated as we receive document updates and\n   * always reflect the current set of changes against the last issued snapshot.\n   */\n  private documentChanges: SortedMap<\n    DocumentKey,\n    ChangeType\n  > = snapshotChangesMap();\n\n  /** See public getters for explanations of these fields. */\n  private _resumeToken: ByteString = ByteString.EMPTY_BYTE_STRING;\n  private _current = false;\n\n  /**\n   * Whether this target state should be included in the next snapshot. We\n   * initialize to true so that newly-added targets are included in the next\n   * RemoteEvent.\n   */\n  private _hasPendingChanges = true;\n\n  /**\n   * Whether this target has been marked 'current'.\n   *\n   * 'Current' has special meaning in the RPC protocol: It implies that the\n   * Watch backend has sent us all changes up to the point at which the target\n   * was added and that the target is consistent with the rest of the watch\n   * stream.\n   */\n  get current(): boolean {\n    return this._current;\n  }\n\n  /** The last resume token sent to us for this target. */\n  get resumeToken(): ByteString {\n    return this._resumeToken;\n  }\n\n  /** Whether this target has pending target adds or target removes. */\n  get isPending(): boolean {\n    return this.pendingResponses !== 0;\n  }\n\n  /** Whether we have modified any state that should trigger a snapshot. */\n  get hasPendingChanges(): boolean {\n    return this._hasPendingChanges;\n  }\n\n  /**\n   * Applies the resume token to the TargetChange, but only when it has a new\n   * value. Empty resumeTokens are discarded.\n   */\n  updateResumeToken(resumeToken: ByteString): void {\n    if (resumeToken.approximateByteSize() > 0) {\n      this._hasPendingChanges = true;\n      this._resumeToken = resumeToken;\n    }\n  }\n\n  /**\n   * Creates a target change from the current set of changes.\n   *\n   * To reset the document changes after raising this snapshot, call\n   * `clearPendingChanges()`.\n   */\n  toTargetChange(): TargetChange {\n    let addedDocuments = documentKeySet();\n    let modifiedDocuments = documentKeySet();\n    let removedDocuments = documentKeySet();\n\n    this.documentChanges.forEach((key, changeType) => {\n      switch (changeType) {\n        case ChangeType.Added:\n          addedDocuments = addedDocuments.add(key);\n          break;\n        case ChangeType.Modified:\n          modifiedDocuments = modifiedDocuments.add(key);\n          break;\n        case ChangeType.Removed:\n          removedDocuments = removedDocuments.add(key);\n          break;\n        default:\n          fail('Encountered invalid change type: ' + changeType);\n      }\n    });\n\n    return new TargetChange(\n      this._resumeToken,\n      this._current,\n      addedDocuments,\n      modifiedDocuments,\n      removedDocuments\n    );\n  }\n\n  /**\n   * Resets the document changes and sets `hasPendingChanges` to false.\n   */\n  clearPendingChanges(): void {\n    this._hasPendingChanges = false;\n    this.documentChanges = snapshotChangesMap();\n  }\n\n  addDocumentChange(key: DocumentKey, changeType: ChangeType): void {\n    this._hasPendingChanges = true;\n    this.documentChanges = this.documentChanges.insert(key, changeType);\n  }\n\n  removeDocumentChange(key: DocumentKey): void {\n    this._hasPendingChanges = true;\n    this.documentChanges = this.documentChanges.remove(key);\n  }\n\n  recordPendingTargetRequest(): void {\n    this.pendingResponses += 1;\n  }\n\n  recordTargetResponse(): void {\n    this.pendingResponses -= 1;\n  }\n\n  markCurrent(): void {\n    this._hasPendingChanges = true;\n    this._current = true;\n  }\n}\n\n/**\n * Interface implemented by RemoteStore to expose target metadata to the\n * WatchChangeAggregator.\n */\nexport interface TargetMetadataProvider {\n  /**\n   * Returns the set of remote document keys for the given target ID as of the\n   * last raised snapshot.\n   */\n  getRemoteKeysForTarget(targetId: TargetId): DocumentKeySet;\n\n  /**\n   * Returns the TargetData for an active target ID or 'null' if this target\n   * has become inactive\n   */\n  getTargetDataForTarget(targetId: TargetId): TargetData | null;\n}\n\nconst LOG_TAG = 'WatchChangeAggregator';\n\n/**\n * A helper class to accumulate watch changes into a RemoteEvent.\n */\nexport class WatchChangeAggregator {\n  constructor(private metadataProvider: TargetMetadataProvider) {}\n\n  /** The internal state of all tracked targets. */\n  private targetStates = new Map<TargetId, TargetState>();\n\n  /** Keeps track of the documents to update since the last raised snapshot. */\n  private pendingDocumentUpdates = maybeDocumentMap();\n\n  /** A mapping of document keys to their set of target IDs. */\n  private pendingDocumentTargetMapping = documentTargetMap();\n\n  /**\n   * A list of targets with existence filter mismatches. These targets are\n   * known to be inconsistent and their listens needs to be re-established by\n   * RemoteStore.\n   */\n  private pendingTargetResets = new SortedSet<TargetId>(primitiveComparator);\n\n  /**\n   * Processes and adds the DocumentWatchChange to the current set of changes.\n   */\n  handleDocumentChange(docChange: DocumentWatchChange): void {\n    for (const targetId of docChange.updatedTargetIds) {\n      if (docChange.newDoc instanceof Document) {\n        this.addDocumentToTarget(targetId, docChange.newDoc);\n      } else if (docChange.newDoc instanceof NoDocument) {\n        this.removeDocumentFromTarget(\n          targetId,\n          docChange.key,\n          docChange.newDoc\n        );\n      }\n    }\n\n    for (const targetId of docChange.removedTargetIds) {\n      this.removeDocumentFromTarget(targetId, docChange.key, docChange.newDoc);\n    }\n  }\n\n  /** Processes and adds the WatchTargetChange to the current set of changes. */\n  handleTargetChange(targetChange: WatchTargetChange): void {\n    this.forEachTarget(targetChange, targetId => {\n      const targetState = this.ensureTargetState(targetId);\n      switch (targetChange.state) {\n        case WatchTargetChangeState.NoChange:\n          if (this.isActiveTarget(targetId)) {\n            targetState.updateResumeToken(targetChange.resumeToken);\n          }\n          break;\n        case WatchTargetChangeState.Added:\n          // We need to decrement the number of pending acks needed from watch\n          // for this targetId.\n          targetState.recordTargetResponse();\n          if (!targetState.isPending) {\n            // We have a freshly added target, so we need to reset any state\n            // that we had previously. This can happen e.g. when remove and add\n            // back a target for existence filter mismatches.\n            targetState.clearPendingChanges();\n          }\n          targetState.updateResumeToken(targetChange.resumeToken);\n          break;\n        case WatchTargetChangeState.Removed:\n          // We need to keep track of removed targets to we can post-filter and\n          // remove any target changes.\n          // We need to decrement the number of pending acks needed from watch\n          // for this targetId.\n          targetState.recordTargetResponse();\n          if (!targetState.isPending) {\n            this.removeTarget(targetId);\n          }\n          debugAssert(\n            !targetChange.cause,\n            'WatchChangeAggregator does not handle errored targets'\n          );\n          break;\n        case WatchTargetChangeState.Current:\n          if (this.isActiveTarget(targetId)) {\n            targetState.markCurrent();\n            targetState.updateResumeToken(targetChange.resumeToken);\n          }\n          break;\n        case WatchTargetChangeState.Reset:\n          if (this.isActiveTarget(targetId)) {\n            // Reset the target and synthesizes removes for all existing\n            // documents. The backend will re-add any documents that still\n            // match the target before it sends the next global snapshot.\n            this.resetTarget(targetId);\n            targetState.updateResumeToken(targetChange.resumeToken);\n          }\n          break;\n        default:\n          fail('Unknown target watch change state: ' + targetChange.state);\n      }\n    });\n  }\n\n  /**\n   * Iterates over all targetIds that the watch change applies to: either the\n   * targetIds explicitly listed in the change or the targetIds of all currently\n   * active targets.\n   */\n  forEachTarget(\n    targetChange: WatchTargetChange,\n    fn: (targetId: TargetId) => void\n  ): void {\n    if (targetChange.targetIds.length > 0) {\n      targetChange.targetIds.forEach(fn);\n    } else {\n      this.targetStates.forEach((_, targetId) => {\n        if (this.isActiveTarget(targetId)) {\n          fn(targetId);\n        }\n      });\n    }\n  }\n\n  /**\n   * Handles existence filters and synthesizes deletes for filter mismatches.\n   * Targets that are invalidated by filter mismatches are added to\n   * `pendingTargetResets`.\n   */\n  handleExistenceFilter(watchChange: ExistenceFilterChange): void {\n    const targetId = watchChange.targetId;\n    const expectedCount = watchChange.existenceFilter.count;\n\n    const targetData = this.targetDataForActiveTarget(targetId);\n    if (targetData) {\n      const target = targetData.target;\n      if (target.isDocumentQuery()) {\n        if (expectedCount === 0) {\n          // The existence filter told us the document does not exist. We deduce\n          // that this document does not exist and apply a deleted document to\n          // our updates. Without applying this deleted document there might be\n          // another query that will raise this document as part of a snapshot\n          // until it is resolved, essentially exposing inconsistency between\n          // queries.\n          const key = new DocumentKey(target.path);\n          this.removeDocumentFromTarget(\n            targetId,\n            key,\n            new NoDocument(key, SnapshotVersion.min())\n          );\n        } else {\n          hardAssert(\n            expectedCount === 1,\n            'Single document existence filter with count: ' + expectedCount\n          );\n        }\n      } else {\n        const currentSize = this.getCurrentDocumentCountForTarget(targetId);\n        if (currentSize !== expectedCount) {\n          // Existence filter mismatch: We reset the mapping and raise a new\n          // snapshot with `isFromCache:true`.\n          this.resetTarget(targetId);\n          this.pendingTargetResets = this.pendingTargetResets.add(targetId);\n        }\n      }\n    }\n  }\n\n  /**\n   * Converts the currently accumulated state into a remote event at the\n   * provided snapshot version. Resets the accumulated changes before returning.\n   */\n  createRemoteEvent(snapshotVersion: SnapshotVersion): RemoteEvent {\n    const targetChanges = new Map<TargetId, TargetChange>();\n\n    this.targetStates.forEach((targetState, targetId) => {\n      const targetData = this.targetDataForActiveTarget(targetId);\n      if (targetData) {\n        if (targetState.current && targetData.target.isDocumentQuery()) {\n          // Document queries for document that don't exist can produce an empty\n          // result set. To update our local cache, we synthesize a document\n          // delete if we have not previously received the document. This\n          // resolves the limbo state of the document, removing it from\n          // limboDocumentRefs.\n          //\n          // TODO(dimond): Ideally we would have an explicit lookup target\n          // instead resulting in an explicit delete message and we could\n          // remove this special logic.\n          const key = new DocumentKey(targetData.target.path);\n          if (\n            this.pendingDocumentUpdates.get(key) === null &&\n            !this.targetContainsDocument(targetId, key)\n          ) {\n            this.removeDocumentFromTarget(\n              targetId,\n              key,\n              new NoDocument(key, snapshotVersion)\n            );\n          }\n        }\n\n        if (targetState.hasPendingChanges) {\n          targetChanges.set(targetId, targetState.toTargetChange());\n          targetState.clearPendingChanges();\n        }\n      }\n    });\n\n    let resolvedLimboDocuments = documentKeySet();\n\n    // We extract the set of limbo-only document updates as the GC logic\n    // special-cases documents that do not appear in the target cache.\n    //\n    // TODO(gsoltis): Expand on this comment once GC is available in the JS\n    // client.\n    this.pendingDocumentTargetMapping.forEach((key, targets) => {\n      let isOnlyLimboTarget = true;\n\n      targets.forEachWhile(targetId => {\n        const targetData = this.targetDataForActiveTarget(targetId);\n        if (\n          targetData &&\n          targetData.purpose !== TargetPurpose.LimboResolution\n        ) {\n          isOnlyLimboTarget = false;\n          return false;\n        }\n\n        return true;\n      });\n\n      if (isOnlyLimboTarget) {\n        resolvedLimboDocuments = resolvedLimboDocuments.add(key);\n      }\n    });\n\n    const remoteEvent = new RemoteEvent(\n      snapshotVersion,\n      targetChanges,\n      this.pendingTargetResets,\n      this.pendingDocumentUpdates,\n      resolvedLimboDocuments\n    );\n\n    this.pendingDocumentUpdates = maybeDocumentMap();\n    this.pendingDocumentTargetMapping = documentTargetMap();\n    this.pendingTargetResets = new SortedSet<TargetId>(primitiveComparator);\n\n    return remoteEvent;\n  }\n\n  /**\n   * Adds the provided document to the internal list of document updates and\n   * its document key to the given target's mapping.\n   */\n  // Visible for testing.\n  addDocumentToTarget(targetId: TargetId, document: MaybeDocument): void {\n    if (!this.isActiveTarget(targetId)) {\n      return;\n    }\n\n    const changeType = this.targetContainsDocument(targetId, document.key)\n      ? ChangeType.Modified\n      : ChangeType.Added;\n\n    const targetState = this.ensureTargetState(targetId);\n    targetState.addDocumentChange(document.key, changeType);\n\n    this.pendingDocumentUpdates = this.pendingDocumentUpdates.insert(\n      document.key,\n      document\n    );\n\n    this.pendingDocumentTargetMapping = this.pendingDocumentTargetMapping.insert(\n      document.key,\n      this.ensureDocumentTargetMapping(document.key).add(targetId)\n    );\n  }\n\n  /**\n   * Removes the provided document from the target mapping. If the\n   * document no longer matches the target, but the document's state is still\n   * known (e.g. we know that the document was deleted or we received the change\n   * that caused the filter mismatch), the new document can be provided\n   * to update the remote document cache.\n   */\n  // Visible for testing.\n  removeDocumentFromTarget(\n    targetId: TargetId,\n    key: DocumentKey,\n    updatedDocument: MaybeDocument | null\n  ): void {\n    if (!this.isActiveTarget(targetId)) {\n      return;\n    }\n\n    const targetState = this.ensureTargetState(targetId);\n    if (this.targetContainsDocument(targetId, key)) {\n      targetState.addDocumentChange(key, ChangeType.Removed);\n    } else {\n      // The document may have entered and left the target before we raised a\n      // snapshot, so we can just ignore the change.\n      targetState.removeDocumentChange(key);\n    }\n\n    this.pendingDocumentTargetMapping = this.pendingDocumentTargetMapping.insert(\n      key,\n      this.ensureDocumentTargetMapping(key).delete(targetId)\n    );\n\n    if (updatedDocument) {\n      this.pendingDocumentUpdates = this.pendingDocumentUpdates.insert(\n        key,\n        updatedDocument\n      );\n    }\n  }\n\n  removeTarget(targetId: TargetId): void {\n    this.targetStates.delete(targetId);\n  }\n\n  /**\n   * Returns the current count of documents in the target. This includes both\n   * the number of documents that the LocalStore considers to be part of the\n   * target as well as any accumulated changes.\n   */\n  private getCurrentDocumentCountForTarget(targetId: TargetId): number {\n    const targetState = this.ensureTargetState(targetId);\n    const targetChange = targetState.toTargetChange();\n    return (\n      this.metadataProvider.getRemoteKeysForTarget(targetId).size +\n      targetChange.addedDocuments.size -\n      targetChange.removedDocuments.size\n    );\n  }\n\n  /**\n   * Increment the number of acks needed from watch before we can consider the\n   * server to be 'in-sync' with the client's active targets.\n   */\n  recordPendingTargetRequest(targetId: TargetId): void {\n    // For each request we get we need to record we need a response for it.\n    const targetState = this.ensureTargetState(targetId);\n    targetState.recordPendingTargetRequest();\n  }\n\n  private ensureTargetState(targetId: TargetId): TargetState {\n    let result = this.targetStates.get(targetId);\n    if (!result) {\n      result = new TargetState();\n      this.targetStates.set(targetId, result);\n    }\n    return result;\n  }\n\n  private ensureDocumentTargetMapping(key: DocumentKey): SortedSet<TargetId> {\n    let targetMapping = this.pendingDocumentTargetMapping.get(key);\n\n    if (!targetMapping) {\n      targetMapping = new SortedSet<TargetId>(primitiveComparator);\n      this.pendingDocumentTargetMapping = this.pendingDocumentTargetMapping.insert(\n        key,\n        targetMapping\n      );\n    }\n\n    return targetMapping;\n  }\n\n  /**\n   * Verifies that the user is still interested in this target (by calling\n   * `getTargetDataForTarget()`) and that we are not waiting for pending ADDs\n   * from watch.\n   */\n  protected isActiveTarget(targetId: TargetId): boolean {\n    const targetActive = this.targetDataForActiveTarget(targetId) !== null;\n    if (!targetActive) {\n      logDebug(LOG_TAG, 'Detected inactive target', targetId);\n    }\n    return targetActive;\n  }\n\n  /**\n   * Returns the TargetData for an active target (i.e. a target that the user\n   * is still interested in that has no outstanding target change requests).\n   */\n  protected targetDataForActiveTarget(targetId: TargetId): TargetData | null {\n    const targetState = this.targetStates.get(targetId);\n    return targetState && targetState.isPending\n      ? null\n      : this.metadataProvider.getTargetDataForTarget(targetId);\n  }\n\n  /**\n   * Resets the state of a Watch target to its initial state (e.g. sets\n   * 'current' to false, clears the resume token and removes its target mapping\n   * from all documents).\n   */\n  private resetTarget(targetId: TargetId): void {\n    debugAssert(\n      !this.targetStates.get(targetId)!.isPending,\n      'Should only reset active targets'\n    );\n    this.targetStates.set(targetId, new TargetState());\n\n    // Trigger removal for any documents currently mapped to this target.\n    // These removals will be part of the initial snapshot if Watch does not\n    // resend these documents.\n    const existingKeys = this.metadataProvider.getRemoteKeysForTarget(targetId);\n    existingKeys.forEach(key => {\n      this.removeDocumentFromTarget(targetId, key, /*updatedDocument=*/ null);\n    });\n  }\n  /**\n   * Returns whether the LocalStore considers the document to be part of the\n   * specified target.\n   */\n  private targetContainsDocument(\n    targetId: TargetId,\n    key: DocumentKey\n  ): boolean {\n    const existingKeys = this.metadataProvider.getRemoteKeysForTarget(targetId);\n    return existingKeys.has(key);\n  }\n}\n\nfunction documentTargetMap(): SortedMap<DocumentKey, SortedSet<TargetId>> {\n  return new SortedMap<DocumentKey, SortedSet<TargetId>>(\n    DocumentKey.comparator\n  );\n}\n\nfunction snapshotChangesMap(): SortedMap<DocumentKey, ChangeType> {\n  return new SortedMap<DocumentKey, ChangeType>(DocumentKey.comparator);\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 { Blob } from '../api/blob';\nimport { Timestamp } from '../api/timestamp';\nimport { DatabaseId } from '../core/database_info';\nimport {\n  Bound,\n  Direction,\n  FieldFilter,\n  Filter,\n  LimitType,\n  Operator,\n  OrderBy,\n  Query\n} from '../core/query';\nimport { SnapshotVersion } from '../core/snapshot_version';\nimport { Target } from '../core/target';\nimport { TargetId } from '../core/types';\nimport { TargetData, TargetPurpose } from '../local/target_data';\nimport { Document, MaybeDocument, NoDocument } from '../model/document';\nimport { DocumentKey } from '../model/document_key';\nimport { ObjectValue } from '../model/object_value';\nimport {\n  DeleteMutation,\n  FieldMask,\n  FieldTransform,\n  Mutation,\n  MutationResult,\n  PatchMutation,\n  Precondition,\n  SetMutation,\n  TransformMutation,\n  VerifyMutation\n} from '../model/mutation';\nimport { FieldPath, ResourcePath } from '../model/path';\nimport * as api from '../protos/firestore_proto_api';\nimport { debugAssert, fail, hardAssert } from '../util/assert';\nimport { Code, FirestoreError } from '../util/error';\nimport { ByteString } from '../util/byte_string';\nimport {\n  isNegativeZero,\n  isNullOrUndefined,\n  isSafeInteger\n} from '../util/types';\nimport {\n  ArrayRemoveTransformOperation,\n  ArrayUnionTransformOperation,\n  NumericIncrementTransformOperation,\n  ServerTimestampTransform,\n  TransformOperation\n} from '../model/transform_operation';\nimport { ExistenceFilter } from './existence_filter';\nimport { mapCodeFromRpcCode } from './rpc_error';\nimport {\n  DocumentWatchChange,\n  ExistenceFilterChange,\n  WatchChange,\n  WatchTargetChange,\n  WatchTargetChangeState\n} from './watch_change';\nimport { isNanValue, isNullValue, normalizeTimestamp } from '../model/values';\n\nconst DIRECTIONS = (() => {\n  const dirs: { [dir: string]: api.OrderDirection } = {};\n  dirs[Direction.ASCENDING] = 'ASCENDING';\n  dirs[Direction.DESCENDING] = 'DESCENDING';\n  return dirs;\n})();\n\nconst OPERATORS = (() => {\n  const ops: { [op: string]: api.FieldFilterOp } = {};\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.ARRAY_CONTAINS] = 'ARRAY_CONTAINS';\n  ops[Operator.IN] = 'IN';\n  ops[Operator.ARRAY_CONTAINS_ANY] = 'ARRAY_CONTAINS_ANY';\n  return ops;\n})();\n\nfunction assertPresent(value: unknown, description: string): asserts value {\n  debugAssert(!isNullOrUndefined(value), description + ' is missing');\n}\n\nexport interface SerializerOptions {\n  /**\n   * The serializer supports both Protobuf.js and Proto3 JSON formats. By\n   * setting this flag to true, the serializer will use the Proto3 JSON format.\n   *\n   * For a description of the Proto3 JSON format check\n   * https://developers.google.com/protocol-buffers/docs/proto3#json\n   */\n  useProto3Json: boolean;\n}\n\n/**\n * Generates JsonObject values for the Datastore API suitable for sending to\n * either GRPC stub methods or via the JSON/HTTP REST API.\n * TODO(klimt): We can remove the databaseId argument if we keep the full\n * resource name in documents.\n */\nexport class JsonProtoSerializer {\n  constructor(\n    private databaseId: DatabaseId,\n    private options: SerializerOptions\n  ) {}\n\n  fromRpcStatus(status: api.Status): FirestoreError {\n    const code =\n      status.code === undefined\n        ? Code.UNKNOWN\n        : 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   */\n  private toInt32Proto(val: number | null): number | { value: number } | null {\n    if (this.options.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   */\n  private 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 an IntegerValue for `value`.\n   */\n  toInteger(value: number): api.Value {\n    return { integerValue: '' + value };\n  }\n\n  /**\n   * Returns an DoubleValue for `value` that is encoded based the serializer's\n   * `useProto3Json` setting.\n   */\n  toDouble(value: number): api.Value {\n    if (this.options.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 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   */\n  toNumber(value: number): api.Value {\n    return isSafeInteger(value) ? this.toInteger(value) : this.toDouble(value);\n  }\n\n  /**\n   * Returns a value for a Date that's appropriate to put into a proto.\n   */\n  toTimestamp(timestamp: Timestamp): api.Timestamp {\n    if (this.options.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\n  private fromTimestamp(date: api.Timestamp): 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   */\n  toBytes(bytes: Blob | ByteString): string | Uint8Array {\n    if (this.options.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   */\n  fromBytes(value: string | Uint8Array | undefined): ByteString {\n    if (this.options.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\n  toVersion(version: SnapshotVersion): api.Timestamp {\n    return this.toTimestamp(version.toTimestamp());\n  }\n\n  fromVersion(version: api.Timestamp): SnapshotVersion {\n    hardAssert(!!version, \"Trying to deserialize version that isn't set\");\n    return SnapshotVersion.fromTimestamp(this.fromTimestamp(version));\n  }\n\n  toResourceName(path: ResourcePath, databaseId?: DatabaseId): string {\n    return this.fullyQualifiedPrefixPath(databaseId || this.databaseId)\n      .child('documents')\n      .child(path)\n      .canonicalString();\n  }\n\n  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\n  toName(key: DocumentKey): string {\n    return this.toResourceName(key.path);\n  }\n\n  fromName(name: string): DocumentKey {\n    const resource = this.fromResourceName(name);\n    hardAssert(\n      resource.get(1) === this.databaseId.projectId,\n      'Tried to deserialize key from different project: ' +\n        resource.get(1) +\n        ' vs ' +\n        this.databaseId.projectId\n    );\n    hardAssert(\n      (!resource.get(3) && !this.databaseId.database) ||\n        resource.get(3) === this.databaseId.database,\n      'Tried to deserialize key from different database: ' +\n        resource.get(3) +\n        ' vs ' +\n        this.databaseId.database\n    );\n    return new DocumentKey(this.extractLocalPathFromResourceName(resource));\n  }\n\n  toQueryPath(path: ResourcePath): string {\n    return this.toResourceName(path);\n  }\n\n  fromQueryPath(name: string): ResourcePath {\n    const resourceName = this.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.EMPTY_PATH;\n    }\n    return this.extractLocalPathFromResourceName(resourceName);\n  }\n\n  get encodedDatabaseId(): string {\n    const path = new ResourcePath([\n      'projects',\n      this.databaseId.projectId,\n      'databases',\n      this.databaseId.database\n    ]);\n    return path.canonicalString();\n  }\n\n  private fullyQualifiedPrefixPath(databaseId: DatabaseId): ResourcePath {\n    return new ResourcePath([\n      'projects',\n      databaseId.projectId,\n      'databases',\n      databaseId.database\n    ]);\n  }\n\n  private 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 an api.Document from key and fields (but no create/update time) */\n  toMutationDocument(key: DocumentKey, fields: ObjectValue): api.Document {\n    return {\n      name: this.toName(key),\n      fields: fields.proto.mapValue.fields\n    };\n  }\n\n  toDocument(document: Document): api.Document {\n    debugAssert(\n      !document.hasLocalMutations,\n      \"Can't serialize documents with mutations.\"\n    );\n    return {\n      name: this.toName(document.key),\n      fields: document.toProto().mapValue.fields,\n      updateTime: this.toTimestamp(document.version.toTimestamp())\n    };\n  }\n\n  fromDocument(\n    document: api.Document,\n    hasCommittedMutations?: boolean\n  ): Document {\n    const key = this.fromName(document.name!);\n    const version = this.fromVersion(document.updateTime!);\n    const data = new ObjectValue({ mapValue: { fields: document.fields } });\n    return new Document(key, version, data, {\n      hasCommittedMutations: !!hasCommittedMutations\n    });\n  }\n\n  private fromFound(doc: api.BatchGetDocumentsResponse): Document {\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 = this.fromName(doc.found.name);\n    const version = this.fromVersion(doc.found.updateTime);\n    const data = new ObjectValue({ mapValue: { fields: doc.found.fields } });\n    return new Document(key, version, data, {});\n  }\n\n  private fromMissing(result: api.BatchGetDocumentsResponse): NoDocument {\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 = this.fromName(result.missing);\n    const version = this.fromVersion(result.readTime);\n    return new NoDocument(key, version);\n  }\n\n  fromMaybeDocument(result: api.BatchGetDocumentsResponse): MaybeDocument {\n    if ('found' in result) {\n      return this.fromFound(result);\n    } else if ('missing' in result) {\n      return this.fromMissing(result);\n    }\n    return fail('invalid batch get response: ' + JSON.stringify(result));\n  }\n\n  fromWatchChange(change: api.ListenResponse): 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 = this.fromWatchTargetChangeState(\n        change.targetChange.targetChangeType || 'NO_CHANGE'\n      );\n      const targetIds: TargetId[] = change.targetChange.targetIds || [];\n\n      const resumeToken = this.fromBytes(change.targetChange.resumeToken);\n      const causeProto = change.targetChange!.cause;\n      const cause = causeProto && this.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 = this.fromName(entityChange.document.name);\n      const version = this.fromVersion(entityChange.document.updateTime);\n      const data = new ObjectValue({\n        mapValue: { fields: entityChange.document.fields }\n      });\n      const doc = new Document(key, version, data, {});\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 = this.fromName(docDelete.document);\n      const version = docDelete.readTime\n        ? this.fromVersion(docDelete.readTime)\n        : SnapshotVersion.min();\n      const doc = new NoDocument(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 = this.fromName(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\n  fromWatchTargetChangeState(\n    state: api.TargetChangeTargetChangeType\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\n  versionFromListenResponse(change: api.ListenResponse): 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 this.fromVersion(targetChange.readTime);\n  }\n\n  toMutation(mutation: Mutation): api.Write {\n    let result: api.Write;\n    if (mutation instanceof SetMutation) {\n      result = {\n        update: this.toMutationDocument(mutation.key, mutation.value)\n      };\n    } else if (mutation instanceof DeleteMutation) {\n      result = { delete: this.toName(mutation.key) };\n    } else if (mutation instanceof PatchMutation) {\n      result = {\n        update: this.toMutationDocument(mutation.key, mutation.data),\n        updateMask: this.toDocumentMask(mutation.fieldMask)\n      };\n    } else if (mutation instanceof TransformMutation) {\n      result = {\n        transform: {\n          document: this.toName(mutation.key),\n          fieldTransforms: mutation.fieldTransforms.map(transform =>\n            this.toFieldTransform(transform)\n          )\n        }\n      };\n    } else if (mutation instanceof VerifyMutation) {\n      result = {\n        verify: this.toName(mutation.key)\n      };\n    } else {\n      return fail('Unknown mutation type ' + mutation.type);\n    }\n\n    if (!mutation.precondition.isNone) {\n      result.currentDocument = this.toPrecondition(mutation.precondition);\n    }\n\n    return result;\n  }\n\n  fromMutation(proto: api.Write): Mutation {\n    const precondition = proto.currentDocument\n      ? this.fromPrecondition(proto.currentDocument)\n      : Precondition.none();\n\n    if (proto.update) {\n      assertPresent(proto.update.name, 'name');\n      const key = this.fromName(proto.update.name);\n      const value = new ObjectValue({\n        mapValue: { fields: proto.update.fields }\n      });\n      if (proto.updateMask) {\n        const fieldMask = this.fromDocumentMask(proto.updateMask);\n        return new PatchMutation(key, value, fieldMask, precondition);\n      } else {\n        return new SetMutation(key, value, precondition);\n      }\n    } else if (proto.delete) {\n      const key = this.fromName(proto.delete);\n      return new DeleteMutation(key, precondition);\n    } else if (proto.transform) {\n      const key = this.fromName(proto.transform.document!);\n      const fieldTransforms = proto.transform.fieldTransforms!.map(transform =>\n        this.fromFieldTransform(transform)\n      );\n      hardAssert(\n        precondition.exists === true,\n        'Transforms only support precondition \"exists == true\"'\n      );\n      return new TransformMutation(key, fieldTransforms);\n    } else if (proto.verify) {\n      const key = this.fromName(proto.verify);\n      return new VerifyMutation(key, precondition);\n    } else {\n      return fail('unknown mutation proto: ' + JSON.stringify(proto));\n    }\n  }\n\n  private toPrecondition(precondition: Precondition): api.Precondition {\n    debugAssert(!precondition.isNone, \"Can't serialize an empty precondition\");\n    if (precondition.updateTime !== undefined) {\n      return {\n        updateTime: this.toVersion(precondition.updateTime)\n      };\n    } else if (precondition.exists !== undefined) {\n      return { exists: precondition.exists };\n    } else {\n      return fail('Unknown precondition');\n    }\n  }\n\n  private fromPrecondition(precondition: api.Precondition): Precondition {\n    if (precondition.updateTime !== undefined) {\n      return Precondition.updateTime(this.fromVersion(precondition.updateTime));\n    } else if (precondition.exists !== undefined) {\n      return Precondition.exists(precondition.exists);\n    } else {\n      return Precondition.none();\n    }\n  }\n\n  private fromWriteResult(\n    proto: api.WriteResult,\n    commitTime: api.Timestamp\n  ): MutationResult {\n    // NOTE: Deletes don't have an updateTime.\n    let version = proto.updateTime\n      ? this.fromVersion(proto.updateTime)\n      : this.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 = this.fromVersion(commitTime);\n    }\n\n    let transformResults: api.Value[] | null = null;\n    if (proto.transformResults && proto.transformResults.length > 0) {\n      transformResults = proto.transformResults;\n    }\n    return new MutationResult(version, transformResults);\n  }\n\n  fromWriteResults(\n    protos: api.WriteResult[] | undefined,\n    commitTime?: api.Timestamp\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 => this.fromWriteResult(proto, commitTime));\n    } else {\n      return [];\n    }\n  }\n\n  private toFieldTransform(fieldTransform: FieldTransform): api.FieldTransform {\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\n  private fromFieldTransform(proto: api.FieldTransform): 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 = ServerTimestampTransform.instance;\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        this,\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\n  toDocumentsTarget(target: Target): api.DocumentsTarget {\n    return { documents: [this.toQueryPath(target.path)] };\n  }\n\n  fromDocumentsTarget(documentsTarget: api.DocumentsTarget): 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 Query.atPath(this.fromQueryPath(name)).toTarget();\n  }\n\n  toQueryTarget(target: Target): api.QueryTarget {\n    // Dissect the path into parent, collectionId, and optional key filter.\n    const result: api.QueryTarget = { 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 = this.toQueryPath(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 = this.toQueryPath(path.popLast());\n      result.structuredQuery!.from = [{ collectionId: path.lastSegment() }];\n    }\n\n    const where = this.toFilter(target.filters);\n    if (where) {\n      result.structuredQuery!.where = where;\n    }\n\n    const orderBy = this.toOrder(target.orderBy);\n    if (orderBy) {\n      result.structuredQuery!.orderBy = orderBy;\n    }\n\n    const limit = this.toInt32Proto(target.limit);\n    if (limit !== null) {\n      result.structuredQuery!.limit = limit;\n    }\n\n    if (target.startAt) {\n      result.structuredQuery!.startAt = this.toCursor(target.startAt);\n    }\n    if (target.endAt) {\n      result.structuredQuery!.endAt = this.toCursor(target.endAt);\n    }\n\n    return result;\n  }\n\n  fromQueryTarget(target: api.QueryTarget): Target {\n    let path = this.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 = this.fromFilter(query.where);\n    }\n\n    let orderBy: OrderBy[] = [];\n    if (query.orderBy) {\n      orderBy = this.fromOrder(query.orderBy);\n    }\n\n    let limit: number | null = null;\n    if (query.limit) {\n      limit = this.fromInt32Proto(query.limit);\n    }\n\n    let startAt: Bound | null = null;\n    if (query.startAt) {\n      startAt = this.fromCursor(query.startAt);\n    }\n\n    let endAt: Bound | null = null;\n    if (query.endAt) {\n      endAt = this.fromCursor(query.endAt);\n    }\n\n    return new Query(\n      path,\n      collectionGroup,\n      orderBy,\n      filterBy,\n      limit,\n      LimitType.First,\n      startAt,\n      endAt\n    ).toTarget();\n  }\n\n  toListenRequestLabels(\n    targetData: TargetData\n  ): api.ApiClientObjectMap<string> | null {\n    const value = this.toLabel(targetData.purpose);\n    if (value == null) {\n      return null;\n    } else {\n      return {\n        'goog-listen-tags': value\n      };\n    }\n  }\n\n  private toLabel(purpose: TargetPurpose): 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\n  toTarget(targetData: TargetData): api.Target {\n    let result: api.Target;\n    const target = targetData.target;\n\n    if (target.isDocumentQuery()) {\n      result = { documents: this.toDocumentsTarget(target) };\n    } else {\n      result = { query: this.toQueryTarget(target) };\n    }\n\n    result.targetId = targetData.targetId;\n\n    if (targetData.resumeToken.approximateByteSize() > 0) {\n      result.resumeToken = this.toBytes(targetData.resumeToken);\n    }\n\n    return result;\n  }\n\n  private toFilter(filters: Filter[]): api.Filter | undefined {\n    if (filters.length === 0) {\n      return;\n    }\n    const protos = filters.map(filter => {\n      if (filter instanceof FieldFilter) {\n        return this.toUnaryOrFieldFilter(filter);\n      } else {\n        return fail('Unrecognized filter: ' + JSON.stringify(filter));\n      }\n    });\n    if (protos.length === 1) {\n      return protos[0];\n    }\n    return { compositeFilter: { op: 'AND', filters: protos } };\n  }\n\n  private fromFilter(filter: api.Filter | undefined): Filter[] {\n    if (!filter) {\n      return [];\n    } else if (filter.unaryFilter !== undefined) {\n      return [this.fromUnaryFilter(filter)];\n    } else if (filter.fieldFilter !== undefined) {\n      return [this.fromFieldFilter(filter)];\n    } else if (filter.compositeFilter !== undefined) {\n      return filter.compositeFilter\n        .filters!.map(f => this.fromFilter(f))\n        .reduce((accum, current) => accum.concat(current));\n    } else {\n      return fail('Unknown filter: ' + JSON.stringify(filter));\n    }\n  }\n\n  private toOrder(orderBys: OrderBy[]): api.Order[] | undefined {\n    if (orderBys.length === 0) {\n      return;\n    }\n    return orderBys.map(order => this.toPropertyOrder(order));\n  }\n\n  private fromOrder(orderBys: api.Order[]): OrderBy[] {\n    return orderBys.map(order => this.fromPropertyOrder(order));\n  }\n\n  private toCursor(cursor: Bound): api.Cursor {\n    return {\n      before: cursor.before,\n      values: cursor.position\n    };\n  }\n\n  private fromCursor(cursor: api.Cursor): Bound {\n    const before = !!cursor.before;\n    const position = cursor.values || [];\n    return new Bound(position, before);\n  }\n\n  // visible for testing\n  toDirection(dir: Direction): api.OrderDirection {\n    return DIRECTIONS[dir];\n  }\n\n  // visible for testing\n  fromDirection(dir: api.OrderDirection | undefined): 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\n  toOperatorName(op: Operator): api.FieldFilterOp {\n    return OPERATORS[op];\n  }\n\n  fromOperatorName(op: api.FieldFilterOp): Operator {\n    switch (op) {\n      case 'EQUAL':\n        return Operator.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 '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\n  toFieldPathReference(path: FieldPath): api.FieldReference {\n    return { fieldPath: path.canonicalString() };\n  }\n\n  fromFieldPathReference(fieldReference: api.FieldReference): FieldPath {\n    return FieldPath.fromServerFormat(fieldReference.fieldPath!);\n  }\n\n  // visible for testing\n  toPropertyOrder(orderBy: OrderBy): api.Order {\n    return {\n      field: this.toFieldPathReference(orderBy.field),\n      direction: this.toDirection(orderBy.dir)\n    };\n  }\n\n  fromPropertyOrder(orderBy: api.Order): OrderBy {\n    return new OrderBy(\n      this.fromFieldPathReference(orderBy.field!),\n      this.fromDirection(orderBy.direction)\n    );\n  }\n\n  fromFieldFilter(filter: api.Filter): Filter {\n    return FieldFilter.create(\n      this.fromFieldPathReference(filter.fieldFilter!.field!),\n      this.fromOperatorName(filter.fieldFilter!.op!),\n      filter.fieldFilter!.value!\n    );\n  }\n\n  // visible for testing\n  toUnaryOrFieldFilter(filter: FieldFilter): api.Filter {\n    if (filter.op === Operator.EQUAL) {\n      if (isNanValue(filter.value)) {\n        return {\n          unaryFilter: {\n            field: this.toFieldPathReference(filter.field),\n            op: 'IS_NAN'\n          }\n        };\n      } else if (isNullValue(filter.value)) {\n        return {\n          unaryFilter: {\n            field: this.toFieldPathReference(filter.field),\n            op: 'IS_NULL'\n          }\n        };\n      }\n    }\n    return {\n      fieldFilter: {\n        field: this.toFieldPathReference(filter.field),\n        op: this.toOperatorName(filter.op),\n        value: filter.value\n      }\n    };\n  }\n\n  fromUnaryFilter(filter: api.Filter): Filter {\n    switch (filter.unaryFilter!.op!) {\n      case 'IS_NAN':\n        const nanField = this.fromFieldPathReference(\n          filter.unaryFilter!.field!\n        );\n        return FieldFilter.create(nanField, Operator.EQUAL, {\n          doubleValue: NaN\n        });\n      case 'IS_NULL':\n        const nullField = this.fromFieldPathReference(\n          filter.unaryFilter!.field!\n        );\n        return FieldFilter.create(nullField, Operator.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\n  toDocumentMask(fieldMask: FieldMask): api.DocumentMask {\n    const canonicalFields: string[] = [];\n    fieldMask.fields.forEach(field =>\n      canonicalFields.push(field.canonicalString())\n    );\n    return {\n      fieldPaths: canonicalFields\n    };\n  }\n\n  fromDocumentMask(proto: api.DocumentMask): FieldMask {\n    const paths = proto.fieldPaths || [];\n    return new FieldMask(paths.map(path => FieldPath.fromServerFormat(path)));\n  }\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 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 { DatabaseId, DatabaseInfo } from '../core/database_info';\nimport { Connection } from '../remote/connection';\nimport { JsonProtoSerializer } from '../remote/serializer';\nimport { fail } from '../util/assert';\nimport { ConnectivityMonitor } from './../remote/connectivity_monitor';\n\n/**\n * Provides a common interface to load anything platform dependent, e.g.\n * the connection implementation.\n *\n * An implementation of this must be provided at compile time for the platform.\n */\n// TODO: Consider only exposing the APIs of 'document' and 'window' that we\n// use in our client.\nexport interface Platform {\n  loadConnection(databaseInfo: DatabaseInfo): Promise<Connection>;\n  newConnectivityMonitor(): ConnectivityMonitor;\n  newSerializer(databaseId: DatabaseId): JsonProtoSerializer;\n\n  /** Formats an object as a JSON string, suitable for logging. */\n  formatJSON(value: unknown): string;\n\n  /** Converts a Base64 encoded string to a binary string. */\n  atob(encoded: string): string;\n\n  /** Converts a binary string to a Base64 encoded string. */\n  btoa(raw: string): string;\n\n  /**\n   * Generates `nBytes` of random bytes.\n   *\n   * If `nBytes < 0` , an error will be thrown.\n   */\n  randomBytes(nBytes: number): Uint8Array;\n\n  /** The Platform's 'window' implementation or null if not available. */\n  readonly window: Window | null;\n\n  /** The Platform's 'document' implementation or null if not available. */\n  readonly document: Document | null;\n\n  /** True if and only if the Base64 conversion functions are available. */\n  readonly base64Available: boolean;\n}\n\n/**\n * Provides singleton helpers where setup code can inject a platform at runtime.\n * setPlatform needs to be set before Firestore is used and must be set exactly\n * once.\n */\nexport class PlatformSupport {\n  private static platform: Platform;\n  static setPlatform(platform: Platform): void {\n    if (PlatformSupport.platform) {\n      fail('Platform already defined');\n    }\n    PlatformSupport.platform = platform;\n  }\n\n  static getPlatform(): Platform {\n    if (!PlatformSupport.platform) {\n      fail('Platform not set');\n    }\n    return PlatformSupport.platform;\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 { Logger, LogLevel } from '@firebase/logger';\nimport { SDK_VERSION } from '../core/version';\nimport { PlatformSupport } from '../platform/platform';\n\nexport { LogLevel };\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\nexport function setLogLevel(newLevel: LogLevel): void {\n  logClient.logLevel = newLevel;\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 * 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    const platform = PlatformSupport.getPlatform();\n    try {\n      return platform.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 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';\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 */\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 {\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 { debugAssert } from './assert';\nimport { PlatformSupport } from '../platform/platform';\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 = PlatformSupport.getPlatform().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\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 { primitiveComparator } from '../util/misc';\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 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   */\n  constructor(\n    readonly databaseId: DatabaseId,\n    readonly persistenceKey: string,\n    readonly host: string,\n    readonly ssl: boolean,\n    readonly forceLongPolling: boolean\n  ) {}\n}\n\n/** The default database name for a project. */\nconst DEFAULT_DATABASE_NAME = '(default)';\n\n/** Represents the database ID a Firestore client is associated with. */\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  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  compareTo(other: DatabaseId): number {\n    return (\n      primitiveComparator(this.projectId, other.projectId) ||\n      primitiveComparator(this.database, other.database)\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 { Equatable } from './misc';\nimport { forEach, isEmpty } from './obj';\n\ntype Entry<K, V> = [K, V];\n\n/**\n * A map implementation that uses objects as keys. Objects must implement the\n * Equatable interface and must be immutable. Entries in the map are stored\n * together with the key being produced from the mapKeyFn. This map\n * automatically handles collisions of keys.\n */\nexport class ObjectMap<KeyType extends Equatable<KeyType>, ValueType> {\n  /**\n   * The inner map for a key -> value pair. Due to the possibility of\n   * collisions we keep a list of entries that we do a linear search through\n   * to find an actual match. Note that collisions should be rare, so we still\n   * expect near constant time lookups in practice.\n   */\n  private inner: {\n    [canonicalId: string]: Array<Entry<KeyType, ValueType>>;\n  } = {};\n\n  constructor(private mapKeyFn: (key: KeyType) => string) {}\n\n  /** Get a value for this key, or undefined if it does not exist. */\n  get(key: KeyType): ValueType | undefined {\n    const id = this.mapKeyFn(key);\n    const matches = this.inner[id];\n    if (matches === undefined) {\n      return undefined;\n    }\n    for (const [otherKey, value] of matches) {\n      if (otherKey.isEqual(key)) {\n        return value;\n      }\n    }\n    return undefined;\n  }\n\n  has(key: KeyType): boolean {\n    return this.get(key) !== undefined;\n  }\n\n  /** Put this key and value in the map. */\n  set(key: KeyType, value: ValueType): void {\n    const id = this.mapKeyFn(key);\n    const matches = this.inner[id];\n    if (matches === undefined) {\n      this.inner[id] = [[key, value]];\n      return;\n    }\n    for (let i = 0; i < matches.length; i++) {\n      if (matches[i][0].isEqual(key)) {\n        matches[i] = [key, value];\n        return;\n      }\n    }\n    matches.push([key, value]);\n  }\n\n  /**\n   * Remove this key from the map. Returns a boolean if anything was deleted.\n   */\n  delete(key: KeyType): boolean {\n    const id = this.mapKeyFn(key);\n    const matches = this.inner[id];\n    if (matches === undefined) {\n      return false;\n    }\n    for (let i = 0; i < matches.length; i++) {\n      if (matches[i][0].isEqual(key)) {\n        if (matches.length === 1) {\n          delete this.inner[id];\n        } else {\n          matches.splice(i, 1);\n        }\n        return true;\n      }\n    }\n    return false;\n  }\n\n  forEach(fn: (key: KeyType, val: ValueType) => void): void {\n    forEach(this.inner, (_, entries) => {\n      for (const [k, v] of entries) {\n        fn(k, v);\n      }\n    });\n  }\n\n  isEmpty(): boolean {\n    return isEmpty(this.inner);\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 { Timestamp } from '../api/timestamp';\nimport { SnapshotVersion } from '../core/snapshot_version';\nimport { BatchId } from '../core/types';\nimport { hardAssert, debugAssert } from '../util/assert';\nimport { arrayEquals } from '../util/misc';\nimport { ByteString } from '../util/byte_string';\nimport {\n  documentKeySet,\n  DocumentKeySet,\n  DocumentVersionMap,\n  documentVersionMap,\n  MaybeDocumentMap\n} from './collections';\nimport { MaybeDocument } from './document';\nimport { DocumentKey } from './document_key';\nimport { Mutation, MutationResult } from './mutation';\n\nexport const BATCHID_UNKNOWN = -1;\n\n/**\n * A batch of mutations that will be sent as one unit to the backend.\n */\nexport class MutationBatch {\n  /**\n   * @param batchId The unique ID of this mutation batch.\n   * @param localWriteTime The original write time of this mutation.\n   * @param baseMutations Mutations that are used to populate the base\n   * values when this mutation is applied locally. This can be used to locally\n   * overwrite values that are persisted in the remote document cache. Base\n   * mutations are never sent to the backend.\n   * @param mutations The user-provided mutations in this mutation batch.\n   * User-provided mutations are applied both locally and remotely on the\n   * backend.\n   */\n  constructor(\n    public batchId: BatchId,\n    public localWriteTime: Timestamp,\n    public baseMutations: Mutation[],\n    public mutations: Mutation[]\n  ) {\n    debugAssert(mutations.length > 0, 'Cannot create an empty mutation batch');\n  }\n\n  /**\n   * Applies all the mutations in this MutationBatch to the specified document\n   * to create a new remote document\n   *\n   * @param docKey The key of the document to apply mutations to.\n   * @param maybeDoc The document to apply mutations to.\n   * @param batchResult The result of applying the MutationBatch to the\n   * backend.\n   */\n  applyToRemoteDocument(\n    docKey: DocumentKey,\n    maybeDoc: MaybeDocument | null,\n    batchResult: MutationBatchResult\n  ): MaybeDocument | null {\n    if (maybeDoc) {\n      debugAssert(\n        maybeDoc.key.isEqual(docKey),\n        `applyToRemoteDocument: key ${docKey} should match maybeDoc key\n        ${maybeDoc.key}`\n      );\n    }\n\n    const mutationResults = batchResult.mutationResults;\n    debugAssert(\n      mutationResults.length === this.mutations.length,\n      `Mismatch between mutations length\n      (${this.mutations.length}) and mutation results length\n      (${mutationResults.length}).`\n    );\n\n    for (let i = 0; i < this.mutations.length; i++) {\n      const mutation = this.mutations[i];\n      if (mutation.key.isEqual(docKey)) {\n        const mutationResult = mutationResults[i];\n        maybeDoc = mutation.applyToRemoteDocument(maybeDoc, mutationResult);\n      }\n    }\n    return maybeDoc;\n  }\n\n  /**\n   * Computes the local view of a document given all the mutations in this\n   * batch.\n   *\n   * @param docKey The key of the document to apply mutations to.\n   * @param maybeDoc The document to apply mutations to.\n   */\n  applyToLocalView(\n    docKey: DocumentKey,\n    maybeDoc: MaybeDocument | null\n  ): MaybeDocument | null {\n    if (maybeDoc) {\n      debugAssert(\n        maybeDoc.key.isEqual(docKey),\n        `applyToLocalDocument: key ${docKey} should match maybeDoc key\n        ${maybeDoc.key}`\n      );\n    }\n\n    // First, apply the base state. This allows us to apply non-idempotent\n    // transform against a consistent set of values.\n    for (const mutation of this.baseMutations) {\n      if (mutation.key.isEqual(docKey)) {\n        maybeDoc = mutation.applyToLocalView(\n          maybeDoc,\n          maybeDoc,\n          this.localWriteTime\n        );\n      }\n    }\n\n    const baseDoc = maybeDoc;\n\n    // Second, apply all user-provided mutations.\n    for (const mutation of this.mutations) {\n      if (mutation.key.isEqual(docKey)) {\n        maybeDoc = mutation.applyToLocalView(\n          maybeDoc,\n          baseDoc,\n          this.localWriteTime\n        );\n      }\n    }\n    return maybeDoc;\n  }\n\n  /**\n   * Computes the local view for all provided documents given the mutations in\n   * this batch.\n   */\n  applyToLocalDocumentSet(maybeDocs: MaybeDocumentMap): MaybeDocumentMap {\n    // TODO(mrschmidt): This implementation is O(n^2). If we apply the mutations\n    // directly (as done in `applyToLocalView()`), we can reduce the complexity\n    // to O(n).\n    let mutatedDocuments = maybeDocs;\n    this.mutations.forEach(m => {\n      const mutatedDocument = this.applyToLocalView(\n        m.key,\n        maybeDocs.get(m.key)\n      );\n      if (mutatedDocument) {\n        mutatedDocuments = mutatedDocuments.insert(m.key, mutatedDocument);\n      }\n    });\n    return mutatedDocuments;\n  }\n\n  keys(): DocumentKeySet {\n    return this.mutations.reduce(\n      (keys, m) => keys.add(m.key),\n      documentKeySet()\n    );\n  }\n\n  isEqual(other: MutationBatch): boolean {\n    return (\n      this.batchId === other.batchId &&\n      arrayEquals(this.mutations, other.mutations, (l, r) => l.isEqual(r)) &&\n      arrayEquals(this.baseMutations, other.baseMutations, (l, r) =>\n        l.isEqual(r)\n      )\n    );\n  }\n}\n\n/** The result of applying a mutation batch to the backend. */\nexport class MutationBatchResult {\n  private constructor(\n    readonly batch: MutationBatch,\n    readonly commitVersion: SnapshotVersion,\n    readonly mutationResults: MutationResult[],\n    readonly streamToken: ByteString,\n    /**\n     * A pre-computed mapping from each mutated document to the resulting\n     * version.\n     */\n    readonly docVersions: DocumentVersionMap\n  ) {}\n\n  /**\n   * Creates a new MutationBatchResult for the given batch and results. There\n   * must be one result for each mutation in the batch. This static factory\n   * caches a document=>version mapping (docVersions).\n   */\n  static from(\n    batch: MutationBatch,\n    commitVersion: SnapshotVersion,\n    results: MutationResult[],\n    streamToken: ByteString\n  ): MutationBatchResult {\n    hardAssert(\n      batch.mutations.length === results.length,\n      'Mutations sent ' +\n        batch.mutations.length +\n        ' must equal results received ' +\n        results.length\n    );\n\n    let versionMap = documentVersionMap();\n    const mutations = batch.mutations;\n    for (let i = 0; i < mutations.length; i++) {\n      versionMap = versionMap.insert(mutations[i].key, results[i].version);\n    }\n\n    return new MutationBatchResult(\n      batch,\n      commitVersion,\n      results,\n      streamToken,\n      versionMap\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 { fail } from '../util/assert';\n\nexport type FulfilledHandler<T, R> =\n  | ((result: T) => R | PersistencePromise<R>)\n  | null;\nexport type RejectedHandler<R> =\n  | ((reason: Error) => R | PersistencePromise<R>)\n  | null;\nexport type Resolver<T> = (value?: T) => void;\nexport type Rejector = (error: Error) => void;\n\n/**\n * PersistencePromise<> is essentially a re-implementation of Promise<> except\n * it has a .next() method instead of .then() and .next() and .catch() callbacks\n * are executed synchronously when a PersistencePromise resolves rather than\n * asynchronously (Promise<> implementations use setImmediate() or similar).\n *\n * This is necessary to interoperate with IndexedDB which will automatically\n * commit transactions if control is returned to the event loop without\n * synchronously initiating another operation on the transaction.\n *\n * NOTE: .then() and .catch() only allow a single consumer, unlike normal\n * Promises.\n */\nexport class PersistencePromise<T> {\n  // NOTE: next/catchCallback will always point to our own wrapper functions,\n  // not the user's raw next() or catch() callbacks.\n  private nextCallback: FulfilledHandler<T, unknown> = null;\n  private catchCallback: RejectedHandler<unknown> = null;\n\n  // When the operation resolves, we'll set result or error and mark isDone.\n  private result: T | undefined = undefined;\n  private error: Error | undefined = undefined;\n  private isDone = false;\n\n  // Set to true when .then() or .catch() are called and prevents additional\n  // chaining.\n  private callbackAttached = false;\n\n  constructor(callback: (resolve: Resolver<T>, reject: Rejector) => void) {\n    callback(\n      value => {\n        this.isDone = true;\n        this.result = value;\n        if (this.nextCallback) {\n          // value should be defined unless T is Void, but we can't express\n          // that in the type system.\n          this.nextCallback(value!);\n        }\n      },\n      error => {\n        this.isDone = true;\n        this.error = error;\n        if (this.catchCallback) {\n          this.catchCallback(error);\n        }\n      }\n    );\n  }\n\n  catch<R>(\n    fn: (error: Error) => R | PersistencePromise<R>\n  ): PersistencePromise<R> {\n    return this.next(undefined, fn);\n  }\n\n  next<R>(\n    nextFn?: FulfilledHandler<T, R>,\n    catchFn?: RejectedHandler<R>\n  ): PersistencePromise<R> {\n    if (this.callbackAttached) {\n      fail('Called next() or catch() twice for PersistencePromise');\n    }\n    this.callbackAttached = true;\n    if (this.isDone) {\n      if (!this.error) {\n        return this.wrapSuccess(nextFn, this.result!);\n      } else {\n        return this.wrapFailure(catchFn, this.error);\n      }\n    } else {\n      return new PersistencePromise<R>((resolve, reject) => {\n        this.nextCallback = (value: T) => {\n          this.wrapSuccess(nextFn, value).next(resolve, reject);\n        };\n        this.catchCallback = (error: Error) => {\n          this.wrapFailure(catchFn, error).next(resolve, reject);\n        };\n      });\n    }\n  }\n\n  toPromise(): Promise<T> {\n    return new Promise((resolve, reject) => {\n      this.next(resolve, reject);\n    });\n  }\n\n  private wrapUserFunction<R>(\n    fn: () => R | PersistencePromise<R>\n  ): PersistencePromise<R> {\n    try {\n      const result = fn();\n      if (result instanceof PersistencePromise) {\n        return result;\n      } else {\n        return PersistencePromise.resolve(result);\n      }\n    } catch (e) {\n      return PersistencePromise.reject<R>(e);\n    }\n  }\n\n  private wrapSuccess<R>(\n    nextFn: FulfilledHandler<T, R> | undefined,\n    value: T\n  ): PersistencePromise<R> {\n    if (nextFn) {\n      return this.wrapUserFunction(() => nextFn(value));\n    } else {\n      // If there's no nextFn, then R must be the same as T\n      return PersistencePromise.resolve<R>((value as unknown) as R);\n    }\n  }\n\n  private wrapFailure<R>(\n    catchFn: RejectedHandler<R> | undefined,\n    error: Error\n  ): PersistencePromise<R> {\n    if (catchFn) {\n      return this.wrapUserFunction(() => catchFn(error));\n    } else {\n      return PersistencePromise.reject<R>(error);\n    }\n  }\n\n  static resolve(): PersistencePromise<void>;\n  static resolve<R>(result: R): PersistencePromise<R>;\n  static resolve<R>(result?: R): PersistencePromise<R | void> {\n    return new PersistencePromise<R | void>((resolve, reject) => {\n      resolve(result);\n    });\n  }\n\n  static reject<R>(error: Error): PersistencePromise<R> {\n    return new PersistencePromise<R>((resolve, reject) => {\n      reject(error);\n    });\n  }\n\n  static waitFor(\n    // Accept all Promise types in waitFor().\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    all: { forEach: (cb: (el: PersistencePromise<any>) => void) => void }\n  ): PersistencePromise<void> {\n    return new PersistencePromise<void>((resolve, reject) => {\n      let expectedCount = 0;\n      let resolvedCount = 0;\n      let done = false;\n\n      all.forEach(element => {\n        ++expectedCount;\n        element.next(\n          () => {\n            ++resolvedCount;\n            if (done && resolvedCount === expectedCount) {\n              resolve();\n            }\n          },\n          err => reject(err)\n        );\n      });\n\n      done = true;\n      if (resolvedCount === expectedCount) {\n        resolve();\n      }\n    });\n  }\n\n  /**\n   * Given an array of predicate functions that asynchronously evaluate to a\n   * boolean, implements a short-circuiting `or` between the results. Predicates\n   * will be evaluated until one of them returns `true`, then stop. The final\n   * result will be whether any of them returned `true`.\n   */\n  static or(\n    predicates: Array<() => PersistencePromise<boolean>>\n  ): PersistencePromise<boolean> {\n    let p: PersistencePromise<boolean> = PersistencePromise.resolve<boolean>(\n      false\n    );\n    for (const predicate of predicates) {\n      p = p.next(isTrue => {\n        if (isTrue) {\n          return PersistencePromise.resolve<boolean>(isTrue);\n        } else {\n          return predicate();\n        }\n      });\n    }\n    return p;\n  }\n\n  /**\n   * Given an iterable, call the given function on each element in the\n   * collection and wait for all of the resulting concurrent PersistencePromises\n   * to resolve.\n   */\n  static forEach<R, S>(\n    collection: { forEach: (cb: (r: R, s: S) => void) => void },\n    f:\n      | ((r: R, s: S) => PersistencePromise<void>)\n      | ((r: R) => PersistencePromise<void>)\n  ): PersistencePromise<void>;\n  static forEach<R>(\n    collection: { forEach: (cb: (r: R) => void) => void },\n    f: (r: R) => PersistencePromise<void>\n  ): PersistencePromise<void>;\n  static forEach<R, S>(\n    collection: { forEach: (cb: (r: R, s?: S) => void) => void },\n    f: (r: R, s?: S) => PersistencePromise<void>\n  ): PersistencePromise<void> {\n    const promises: Array<PersistencePromise<void>> = [];\n    collection.forEach((r, s) => {\n      promises.push(f.call(this, r, s));\n    });\n    return this.waitFor(promises);\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 { DocumentKeySet, NullableMaybeDocumentMap } from '../model/collections';\nimport { MaybeDocument } from '../model/document';\nimport { DocumentKey } from '../model/document_key';\nimport { debugAssert } from '../util/assert';\nimport { ObjectMap } from '../util/obj_map';\n\nimport { PersistenceTransaction } from './persistence';\nimport { PersistencePromise } from './persistence_promise';\nimport { SnapshotVersion } from '../core/snapshot_version';\n\n/**\n * An in-memory buffer of entries to be written to a RemoteDocumentCache.\n * It can be used to batch up a set of changes to be written to the cache, but\n * additionally supports reading entries back with the `getEntry()` method,\n * falling back to the underlying RemoteDocumentCache if no entry is\n * buffered.\n *\n * Entries added to the cache *must* be read first. This is to facilitate\n * calculating the size delta of the pending changes.\n *\n * PORTING NOTE: This class was implemented then removed from other platforms.\n * If byte-counting ends up being needed on the other platforms, consider\n * porting this class as part of that implementation work.\n */\nexport abstract class RemoteDocumentChangeBuffer {\n  // A mapping of document key to the new cache entry that should be written (or null if any\n  // existing cache entry should be removed).\n  protected changes: ObjectMap<\n    DocumentKey,\n    MaybeDocument | null\n  > = new ObjectMap(key => key.toString());\n\n  // The read time to use for all added documents in this change buffer.\n  private _readTime: SnapshotVersion | undefined;\n\n  private changesApplied = false;\n\n  protected abstract getFromCache(\n    transaction: PersistenceTransaction,\n    documentKey: DocumentKey\n  ): PersistencePromise<MaybeDocument | null>;\n\n  protected abstract getAllFromCache(\n    transaction: PersistenceTransaction,\n    documentKeys: DocumentKeySet\n  ): PersistencePromise<NullableMaybeDocumentMap>;\n\n  protected abstract applyChanges(\n    transaction: PersistenceTransaction\n  ): PersistencePromise<void>;\n\n  protected set readTime(value: SnapshotVersion) {\n    // Right now (for simplicity) we just track a single readTime for all the\n    // added entries since we expect them to all be the same, but we could\n    // rework to store per-entry readTimes if necessary.\n    debugAssert(\n      this._readTime === undefined || this._readTime.isEqual(value),\n      'All changes in a RemoteDocumentChangeBuffer must have the same read time'\n    );\n    this._readTime = value;\n  }\n\n  protected get readTime(): SnapshotVersion {\n    debugAssert(\n      this._readTime !== undefined,\n      'Read time is not set. All removeEntry() calls must include a readTime if `trackRemovals` is used.'\n    );\n    return this._readTime;\n  }\n\n  /**\n   * Buffers a `RemoteDocumentCache.addEntry()` call.\n   *\n   * You can only modify documents that have already been retrieved via\n   * `getEntry()/getEntries()` (enforced via IndexedDbs `apply()`).\n   */\n  addEntry(maybeDocument: MaybeDocument, readTime: SnapshotVersion): void {\n    this.assertNotApplied();\n    this.readTime = readTime;\n    this.changes.set(maybeDocument.key, maybeDocument);\n  }\n\n  /**\n   * Buffers a `RemoteDocumentCache.removeEntry()` call.\n   *\n   * You can only remove documents that have already been retrieved via\n   * `getEntry()/getEntries()` (enforced via IndexedDbs `apply()`).\n   */\n  removeEntry(key: DocumentKey, readTime?: SnapshotVersion): void {\n    this.assertNotApplied();\n    if (readTime) {\n      this.readTime = readTime;\n    }\n    this.changes.set(key, null);\n  }\n\n  /**\n   * Looks up an entry in the cache. The buffered changes will first be checked,\n   * and if no buffered change applies, this will forward to\n   * `RemoteDocumentCache.getEntry()`.\n   *\n   * @param transaction The transaction in which to perform any persistence\n   *     operations.\n   * @param documentKey The key of the entry to look up.\n   * @return The cached Document or NoDocument entry, or null if we have nothing\n   * cached.\n   */\n  getEntry(\n    transaction: PersistenceTransaction,\n    documentKey: DocumentKey\n  ): PersistencePromise<MaybeDocument | null> {\n    this.assertNotApplied();\n    const bufferedEntry = this.changes.get(documentKey);\n    if (bufferedEntry !== undefined) {\n      return PersistencePromise.resolve<MaybeDocument | null>(bufferedEntry);\n    } else {\n      return this.getFromCache(transaction, documentKey);\n    }\n  }\n\n  /**\n   * Looks up several entries in the cache, forwarding to\n   * `RemoteDocumentCache.getEntry()`.\n   *\n   * @param transaction The transaction in which to perform any persistence\n   *     operations.\n   * @param documentKeys The keys of the entries to look up.\n   * @return A map of cached `Document`s or `NoDocument`s, indexed by key. If an\n   *     entry cannot be found, the corresponding key will be mapped to a null\n   *     value.\n   */\n  getEntries(\n    transaction: PersistenceTransaction,\n    documentKeys: DocumentKeySet\n  ): PersistencePromise<NullableMaybeDocumentMap> {\n    return this.getAllFromCache(transaction, documentKeys);\n  }\n\n  /**\n   * Applies buffered changes to the underlying RemoteDocumentCache, using\n   * the provided transaction.\n   */\n  apply(transaction: PersistenceTransaction): PersistencePromise<void> {\n    this.assertNotApplied();\n    this.changesApplied = true;\n    return this.applyChanges(transaction);\n  }\n\n  /** Helper to assert this.changes is not null  */\n  protected assertNotApplied(): void {\n    debugAssert(!this.changesApplied, 'Changes have already been applied.');\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 { User } from '../auth/user';\nimport { ListenSequenceNumber, TargetId } from '../core/types';\nimport { DocumentKey } from '../model/document_key';\nimport { IndexManager } from './index_manager';\nimport { LocalStore } from './local_store';\nimport { MutationQueue } from './mutation_queue';\nimport { PersistencePromise } from './persistence_promise';\nimport { TargetCache } from './target_cache';\nimport { RemoteDocumentCache } from './remote_document_cache';\nimport { TargetData } from './target_data';\n\nexport const PRIMARY_LEASE_LOST_ERROR_MSG =\n  'The current tab is not in the required state to perform this operation. ' +\n  'It might be necessary to refresh the browser tab.';\n\n/**\n * A base class representing a persistence transaction, encapsulating both the\n * transaction's sequence numbers as well as a list of onCommitted listeners.\n *\n * When you call Persistence.runTransaction(), it will create a transaction and\n * pass it to your callback. You then pass it to any method that operates\n * on persistence.\n */\nexport abstract class PersistenceTransaction {\n  private readonly onCommittedListeners: Array<() => void> = [];\n\n  abstract readonly currentSequenceNumber: ListenSequenceNumber;\n\n  addOnCommittedListener(listener: () => void): void {\n    this.onCommittedListeners.push(listener);\n  }\n\n  raiseOnCommittedEvent(): void {\n    this.onCommittedListeners.forEach(listener => listener());\n  }\n}\n\n/** The different modes supported by `IndexedDbPersistence.runTransaction()`. */\nexport type PersistenceTransactionMode =\n  | 'readonly'\n  | 'readwrite'\n  | 'readwrite-primary';\n\n/**\n * Callback type for primary state notifications. This callback can be\n * registered with the persistence layer to get notified when we transition from\n * primary to secondary state and vice versa.\n *\n * Note: Instances can only toggle between Primary and Secondary state if\n * IndexedDB persistence is enabled and multiple clients are active. If this\n * listener is registered with MemoryPersistence, the callback will be called\n * exactly once marking the current instance as Primary.\n */\nexport type PrimaryStateListener = (isPrimary: boolean) => Promise<void>;\n\n/**\n * A ReferenceDelegate instance handles all of the hooks into the document-reference lifecycle. This\n * includes being added to a target, being removed from a target, being subject to mutation, and\n * being mutated by the user.\n *\n * Different implementations may do different things with each of these events. Not every\n * implementation needs to do something with every lifecycle hook.\n *\n * PORTING NOTE: since sequence numbers are attached to transactions in this\n * client, the ReferenceDelegate does not need to deal in transactional\n * semantics (onTransactionStarted/Committed()), nor does it need to track and\n * generate sequence numbers (getCurrentSequenceNumber()).\n */\nexport interface ReferenceDelegate {\n  /** Notify the delegate that the given document was added to a target. */\n  addReference(\n    txn: PersistenceTransaction,\n    targetId: TargetId,\n    doc: DocumentKey\n  ): PersistencePromise<void>;\n\n  /** Notify the delegate that the given document was removed from a target. */\n  removeReference(\n    txn: PersistenceTransaction,\n    targetId: TargetId,\n    doc: DocumentKey\n  ): PersistencePromise<void>;\n\n  /**\n   * Notify the delegate that a target was removed. The delegate may, but is not obligated to,\n   * actually delete the target and associated data.\n   */\n  removeTarget(\n    txn: PersistenceTransaction,\n    targetData: TargetData\n  ): PersistencePromise<void>;\n\n  /**\n   * Notify the delegate that a document may no longer be part of any views or\n   * have any mutations associated.\n   */\n  markPotentiallyOrphaned(\n    txn: PersistenceTransaction,\n    doc: DocumentKey\n  ): PersistencePromise<void>;\n\n  /** Notify the delegate that a limbo document was updated. */\n  updateLimboDocument(\n    txn: PersistenceTransaction,\n    doc: DocumentKey\n  ): PersistencePromise<void>;\n}\n\n/**\n * Persistence is the lowest-level shared interface to persistent storage in\n * Firestore.\n *\n * Persistence is used to create MutationQueue and RemoteDocumentCache\n * instances backed by persistence (which might be in-memory or LevelDB).\n *\n * Persistence also exposes an API to create and run PersistenceTransactions\n * against persistence. All read / write operations must be wrapped in a\n * transaction. Implementations of PersistenceTransaction / Persistence only\n * need to guarantee that writes made against the transaction are not made to\n * durable storage until the transaction resolves its PersistencePromise.\n * Since memory-only storage components do not alter durable storage, they are\n * free to ignore the transaction.\n *\n * This contract is enough to allow the LocalStore be be written\n * independently of whether or not the stored state actually is durably\n * persisted. If persistent storage is enabled, writes are grouped together to\n * avoid inconsistent state that could cause crashes.\n *\n * Concretely, when persistent storage is enabled, the persistent versions of\n * MutationQueue, RemoteDocumentCache, and others (the mutators) will\n * defer their writes into a transaction. Once the local store has completed\n * one logical operation, it commits the transaction.\n *\n * When persistent storage is disabled, the non-persistent versions of the\n * mutators ignore the transaction. This short-cut is allowed because\n * memory-only storage leaves no state so it cannot be inconsistent.\n *\n * This simplifies the implementations of the mutators and allows memory-only\n * implementations to supplement the persistent ones without requiring any\n * special dual-store implementation of Persistence. The cost is that the\n * LocalStore needs to be slightly careful about the order of its reads and\n * writes in order to avoid relying on being able to read back uncommitted\n * writes.\n */\nexport interface Persistence {\n  /**\n   * Whether or not this persistence instance has been started.\n   */\n  readonly started: boolean;\n\n  readonly referenceDelegate: ReferenceDelegate;\n\n  /** Starts persistence. */\n  start(): Promise<void>;\n\n  /**\n   * Releases any resources held during eager shutdown.\n   */\n  shutdown(): Promise<void>;\n\n  /**\n   * Registers a listener that gets called when the database receives a\n   * version change event indicating that it has deleted.\n   *\n   * PORTING NOTE: This is only used for Web multi-tab.\n   */\n  setDatabaseDeletedListener(\n    databaseDeletedListener: () => Promise<void>\n  ): void;\n\n  /**\n   * Returns a MutationQueue representing the persisted mutations for the\n   * given user.\n   *\n   * Note: The implementation is free to return the same instance every time\n   * this is called for a given user. In particular, the memory-backed\n   * implementation does this to emulate the persisted implementation to the\n   * extent possible (e.g. in the case of uid switching from\n   * sally=>jack=>sally, sally's mutation queue will be preserved).\n   */\n  getMutationQueue(user: User): MutationQueue;\n\n  /**\n   * Returns a TargetCache representing the persisted cache of targets.\n   *\n   * Note: The implementation is free to return the same instance every time\n   * this is called. In particular, the memory-backed implementation does this\n   * to emulate the persisted implementation to the extent possible.\n   */\n  getTargetCache(): TargetCache;\n\n  /**\n   * Returns a RemoteDocumentCache representing the persisted cache of remote\n   * documents.\n   *\n   * Note: The implementation is free to return the same instance every time\n   * this is called. In particular, the memory-backed implementation does this\n   * to emulate the persisted implementation to the extent possible.\n   */\n  getRemoteDocumentCache(): RemoteDocumentCache;\n\n  /**\n   * Returns an IndexManager instance that manages our persisted query indexes.\n   *\n   * Note: The implementation is free to return the same instance every time\n   * this is called. In particular, the memory-backed implementation does this\n   * to emulate the persisted implementation to the extent possible.\n   */\n  getIndexManager(): IndexManager;\n\n  /**\n   * Performs an operation inside a persistence transaction. Any reads or writes\n   * against persistence must be performed within a transaction. Writes will be\n   * committed atomically once the transaction completes.\n   *\n   * Persistence operations are asynchronous and therefore the provided\n   * transactionOperation must return a PersistencePromise. When it is resolved,\n   * the transaction will be committed and the Promise returned by this method\n   * will resolve.\n   *\n   * @param action A description of the action performed by this transaction,\n   * used for logging.\n   * @param mode The underlying mode of the IndexedDb transaction. Can be\n   * 'readonly`, 'readwrite' or 'readwrite-primary'. Transactions marked\n   * 'readwrite-primary' can only be executed by the primary client. In this\n   * mode, the transactionOperation will not be run if the primary lease cannot\n   * be acquired and the returned promise will be rejected with a\n   * FAILED_PRECONDITION error.\n   * @param transactionOperation The operation to run inside a transaction.\n   * @return A promise that is resolved once the transaction completes.\n   */\n  runTransaction<T>(\n    action: string,\n    mode: PersistenceTransactionMode,\n    transactionOperation: (\n      transaction: PersistenceTransaction\n    ) => PersistencePromise<T>\n  ): Promise<T>;\n}\n\n/**\n * Interface implemented by the LRU scheduler to start(), stop() and restart\n * garbage collection.\n */\nexport interface GarbageCollectionScheduler {\n  readonly started: boolean;\n  start(localStore: LocalStore): void;\n  stop(): void;\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 { Query } from '../core/query';\nimport { SnapshotVersion } from '../core/snapshot_version';\nimport {\n  DocumentKeySet,\n  documentKeySet,\n  DocumentMap,\n  documentMap,\n  MaybeDocumentMap,\n  maybeDocumentMap,\n  NullableMaybeDocumentMap,\n  nullableMaybeDocumentMap\n} from '../model/collections';\nimport { Document, MaybeDocument, NoDocument } from '../model/document';\nimport { DocumentKey } from '../model/document_key';\nimport { MutationBatch } from '../model/mutation_batch';\nimport { ResourcePath } from '../model/path';\n\nimport { debugAssert } from '../util/assert';\nimport { IndexManager } from './index_manager';\nimport { MutationQueue } from './mutation_queue';\nimport { PatchMutation } from '../model/mutation';\nimport { PersistenceTransaction } from './persistence';\nimport { PersistencePromise } from './persistence_promise';\nimport { RemoteDocumentCache } from './remote_document_cache';\n\n/**\n * A readonly view of the local state of all documents we're tracking (i.e. we\n * have a cached version in remoteDocumentCache or local mutations for the\n * document). The view is computed by applying the mutations in the\n * MutationQueue to the RemoteDocumentCache.\n */\nexport class LocalDocumentsView {\n  constructor(\n    readonly remoteDocumentCache: RemoteDocumentCache,\n    readonly mutationQueue: MutationQueue,\n    readonly indexManager: IndexManager\n  ) {}\n\n  /**\n   * Get the local view of the document identified by `key`.\n   *\n   * @return Local view of the document or null if we don't have any cached\n   * state for it.\n   */\n  getDocument(\n    transaction: PersistenceTransaction,\n    key: DocumentKey\n  ): PersistencePromise<MaybeDocument | null> {\n    return this.mutationQueue\n      .getAllMutationBatchesAffectingDocumentKey(transaction, key)\n      .next(batches => this.getDocumentInternal(transaction, key, batches));\n  }\n\n  /** Internal version of `getDocument` that allows reusing batches. */\n  private getDocumentInternal(\n    transaction: PersistenceTransaction,\n    key: DocumentKey,\n    inBatches: MutationBatch[]\n  ): PersistencePromise<MaybeDocument | null> {\n    return this.remoteDocumentCache.getEntry(transaction, key).next(doc => {\n      for (const batch of inBatches) {\n        doc = batch.applyToLocalView(key, doc);\n      }\n      return doc;\n    });\n  }\n\n  // Returns the view of the given `docs` as they would appear after applying\n  // all mutations in the given `batches`.\n  private applyLocalMutationsToDocuments(\n    transaction: PersistenceTransaction,\n    docs: NullableMaybeDocumentMap,\n    batches: MutationBatch[]\n  ): NullableMaybeDocumentMap {\n    let results = nullableMaybeDocumentMap();\n    docs.forEach((key, localView) => {\n      for (const batch of batches) {\n        localView = batch.applyToLocalView(key, localView);\n      }\n      results = results.insert(key, localView);\n    });\n    return results;\n  }\n\n  /**\n   * Gets the local view of the documents identified by `keys`.\n   *\n   * If we don't have cached state for a document in `keys`, a NoDocument will\n   * be stored for that key in the resulting set.\n   */\n  getDocuments(\n    transaction: PersistenceTransaction,\n    keys: DocumentKeySet\n  ): PersistencePromise<MaybeDocumentMap> {\n    return this.remoteDocumentCache\n      .getEntries(transaction, keys)\n      .next(docs => this.getLocalViewOfDocuments(transaction, docs));\n  }\n\n  /**\n   * Similar to `getDocuments`, but creates the local view from the given\n   * `baseDocs` without retrieving documents from the local store.\n   */\n  getLocalViewOfDocuments(\n    transaction: PersistenceTransaction,\n    baseDocs: NullableMaybeDocumentMap\n  ): PersistencePromise<MaybeDocumentMap> {\n    return this.mutationQueue\n      .getAllMutationBatchesAffectingDocumentKeys(transaction, baseDocs)\n      .next(batches => {\n        const docs = this.applyLocalMutationsToDocuments(\n          transaction,\n          baseDocs,\n          batches\n        );\n        let results = maybeDocumentMap();\n        docs.forEach((key, maybeDoc) => {\n          // TODO(http://b/32275378): Don't conflate missing / deleted.\n          if (!maybeDoc) {\n            maybeDoc = new NoDocument(key, SnapshotVersion.min());\n          }\n          results = results.insert(key, maybeDoc);\n        });\n\n        return results;\n      });\n  }\n\n  /**\n   * Performs a query against the local view of all documents.\n   *\n   * @param transaction The persistence transaction.\n   * @param query The query to match documents against.\n   * @param sinceReadTime If not set to SnapshotVersion.min(), return only\n   *     documents that have been read since this snapshot version (exclusive).\n   */\n  getDocumentsMatchingQuery(\n    transaction: PersistenceTransaction,\n    query: Query,\n    sinceReadTime: SnapshotVersion\n  ): PersistencePromise<DocumentMap> {\n    if (query.isDocumentQuery()) {\n      return this.getDocumentsMatchingDocumentQuery(transaction, query.path);\n    } else if (query.isCollectionGroupQuery()) {\n      return this.getDocumentsMatchingCollectionGroupQuery(\n        transaction,\n        query,\n        sinceReadTime\n      );\n    } else {\n      return this.getDocumentsMatchingCollectionQuery(\n        transaction,\n        query,\n        sinceReadTime\n      );\n    }\n  }\n\n  private getDocumentsMatchingDocumentQuery(\n    transaction: PersistenceTransaction,\n    docPath: ResourcePath\n  ): PersistencePromise<DocumentMap> {\n    // Just do a simple document lookup.\n    return this.getDocument(transaction, new DocumentKey(docPath)).next(\n      maybeDoc => {\n        let result = documentMap();\n        if (maybeDoc instanceof Document) {\n          result = result.insert(maybeDoc.key, maybeDoc);\n        }\n        return result;\n      }\n    );\n  }\n\n  private getDocumentsMatchingCollectionGroupQuery(\n    transaction: PersistenceTransaction,\n    query: Query,\n    sinceReadTime: SnapshotVersion\n  ): PersistencePromise<DocumentMap> {\n    debugAssert(\n      query.path.isEmpty(),\n      'Currently we only support collection group queries at the root.'\n    );\n    const collectionId = query.collectionGroup!;\n    let results = documentMap();\n    return this.indexManager\n      .getCollectionParents(transaction, collectionId)\n      .next(parents => {\n        // Perform a collection query against each parent that contains the\n        // collectionId and aggregate the results.\n        return PersistencePromise.forEach(parents, (parent: ResourcePath) => {\n          const collectionQuery = query.asCollectionQueryAtPath(\n            parent.child(collectionId)\n          );\n          return this.getDocumentsMatchingCollectionQuery(\n            transaction,\n            collectionQuery,\n            sinceReadTime\n          ).next(r => {\n            r.forEach((key, doc) => {\n              results = results.insert(key, doc);\n            });\n          });\n        }).next(() => results);\n      });\n  }\n\n  private getDocumentsMatchingCollectionQuery(\n    transaction: PersistenceTransaction,\n    query: Query,\n    sinceReadTime: SnapshotVersion\n  ): PersistencePromise<DocumentMap> {\n    // Query the remote documents and overlay mutations.\n    let results: DocumentMap;\n    let mutationBatches: MutationBatch[];\n    return this.remoteDocumentCache\n      .getDocumentsMatchingQuery(transaction, query, sinceReadTime)\n      .next(queryResults => {\n        results = queryResults;\n        return this.mutationQueue.getAllMutationBatchesAffectingQuery(\n          transaction,\n          query\n        );\n      })\n      .next(matchingMutationBatches => {\n        mutationBatches = matchingMutationBatches;\n        // It is possible that a PatchMutation can make a document match a query, even if\n        // the version in the RemoteDocumentCache is not a match yet (waiting for server\n        // to ack). To handle this, we find all document keys affected by the PatchMutations\n        // that are not in `result` yet, and back fill them via `remoteDocumentCache.getEntries`,\n        // otherwise those `PatchMutations` will be ignored because no base document can be found,\n        // and lead to missing result for the query.\n        return this.addMissingBaseDocuments(\n          transaction,\n          mutationBatches,\n          results\n        ).next(mergedDocuments => {\n          results = mergedDocuments;\n\n          for (const batch of mutationBatches) {\n            for (const mutation of batch.mutations) {\n              const key = mutation.key;\n              const baseDoc = results.get(key);\n              const mutatedDoc = mutation.applyToLocalView(\n                baseDoc,\n                baseDoc,\n                batch.localWriteTime\n              );\n              if (mutatedDoc instanceof Document) {\n                results = results.insert(key, mutatedDoc);\n              } else {\n                results = results.remove(key);\n              }\n            }\n          }\n        });\n      })\n      .next(() => {\n        // Finally, filter out any documents that don't actually match\n        // the query.\n        results.forEach((key, doc) => {\n          if (!query.matches(doc)) {\n            results = results.remove(key);\n          }\n        });\n\n        return results;\n      });\n  }\n\n  private addMissingBaseDocuments(\n    transaction: PersistenceTransaction,\n    matchingMutationBatches: MutationBatch[],\n    existingDocuments: DocumentMap\n  ): PersistencePromise<DocumentMap> {\n    let missingBaseDocEntriesForPatching = documentKeySet();\n    for (const batch of matchingMutationBatches) {\n      for (const mutation of batch.mutations) {\n        if (\n          mutation instanceof PatchMutation &&\n          existingDocuments.get(mutation.key) === null\n        ) {\n          missingBaseDocEntriesForPatching = missingBaseDocEntriesForPatching.add(\n            mutation.key\n          );\n        }\n      }\n    }\n\n    let mergedDocuments = existingDocuments;\n    return this.remoteDocumentCache\n      .getEntries(transaction, missingBaseDocEntriesForPatching)\n      .next(missingBaseDocs => {\n        missingBaseDocs.forEach((key, doc) => {\n          if (doc !== null && doc instanceof Document) {\n            mergedDocuments = mergedDocuments.insert(key, doc);\n          }\n        });\n        return mergedDocuments;\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 { TargetId } from '../core/types';\nimport { ChangeType, ViewSnapshot } from '../core/view_snapshot';\nimport { documentKeySet, DocumentKeySet } from '../model/collections';\n\n/**\n * A set of changes to what documents are currently in view and out of view for\n * a given query. These changes are sent to the LocalStore by the View (via\n * the SyncEngine) and are used to pin / unpin documents as appropriate.\n */\nexport class LocalViewChanges {\n  constructor(\n    readonly targetId: TargetId,\n    readonly fromCache: boolean,\n    readonly addedKeys: DocumentKeySet,\n    readonly removedKeys: DocumentKeySet\n  ) {}\n\n  static fromSnapshot(\n    targetId: TargetId,\n    viewSnapshot: ViewSnapshot\n  ): LocalViewChanges {\n    let addedKeys = documentKeySet();\n    let removedKeys = documentKeySet();\n\n    for (const docChange of viewSnapshot.docChanges) {\n      switch (docChange.type) {\n        case ChangeType.Added:\n          addedKeys = addedKeys.add(docChange.doc.key);\n          break;\n        case ChangeType.Removed:\n          removedKeys = removedKeys.add(docChange.doc.key);\n          break;\n        default:\n        // do nothing\n      }\n    }\n\n    return new LocalViewChanges(\n      targetId,\n      viewSnapshot.fromCache,\n      addedKeys,\n      removedKeys\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 } from './types';\n\n/**\n * `SequenceNumberSyncer` defines the methods required to keep multiple instances of a\n * `ListenSequence` in sync.\n */\nexport interface SequenceNumberSyncer {\n  // Notify the syncer that a new sequence number has been used.\n  writeSequenceNumber(sequenceNumber: ListenSequenceNumber): void;\n  // Setting this property allows the syncer to notify when a sequence number has been used, and\n  // and lets the ListenSequence adjust its internal previous value accordingly.\n  sequenceNumberHandler:\n    | ((sequenceNumber: ListenSequenceNumber) => void)\n    | null;\n}\n\n/**\n * `ListenSequence` is a monotonic sequence. It is initialized with a minimum value to\n * exceed. All subsequent calls to next will return increasing values. If provided with a\n * `SequenceNumberSyncer`, it will additionally bump its next value when told of a new value, as\n * well as write out sequence numbers that it produces via `next()`.\n */\nexport class ListenSequence {\n  static readonly INVALID: ListenSequenceNumber = -1;\n\n  private writeNewSequenceNumber?: (\n    newSequenceNumber: ListenSequenceNumber\n  ) => void;\n\n  constructor(\n    private previousValue: ListenSequenceNumber,\n    sequenceNumberSyncer?: SequenceNumberSyncer\n  ) {\n    if (sequenceNumberSyncer) {\n      sequenceNumberSyncer.sequenceNumberHandler = sequenceNumber =>\n        this.setPreviousValue(sequenceNumber);\n      this.writeNewSequenceNumber = sequenceNumber =>\n        sequenceNumberSyncer.writeSequenceNumber(sequenceNumber);\n    }\n  }\n\n  private setPreviousValue(\n    externalPreviousValue: ListenSequenceNumber\n  ): ListenSequenceNumber {\n    this.previousValue = Math.max(externalPreviousValue, this.previousValue);\n    return this.previousValue;\n  }\n\n  next(): ListenSequenceNumber {\n    const nextValue = ++this.previousValue;\n    if (this.writeNewSequenceNumber) {\n      this.writeNewSequenceNumber(nextValue);\n    }\n    return nextValue;\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> {\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 { 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 { ResourcePath } from '../model/path';\nimport { fail, hardAssert } from '../util/assert';\n\n/**\n * Helpers for dealing with resource paths stored in IndexedDB.\n *\n * Resource paths in their canonical string form do not sort as the server\n * sorts them. Specifically the server splits paths into segments first and then\n * sorts, putting end-of-segment before any character. In a UTF-8 string\n * encoding the slash ('/') that denotes the end-of-segment naturally comes\n * after other characters so the intent here is to encode the path delimiters in\n * such a way that the resulting strings sort naturally.\n *\n * Resource paths are also used for prefix scans so it's important to\n * distinguish whole segments from any longer segments of which they might be a\n * prefix. For example, it's important to make it possible to scan documents in\n * a collection \"foo\" without encountering documents in a collection \"foobar\".\n *\n * Separate from the concerns about resource path ordering and separation,\n * On Android, SQLite imposes additional restrictions since it does not handle\n * keys with embedded NUL bytes particularly well. Rather than change the\n * implementation we keep the encoding identical to keep the ports similar.\n *\n * Taken together this means resource paths when encoded for storage in\n * IndexedDB have the following characteristics:\n *\n *   * Segment separators (\"/\") sort before everything else.\n *   * All paths have a trailing separator.\n *   * NUL bytes do not exist in the output, since IndexedDB doesn't treat them\n * well.\n *\n * Therefore resource paths are encoded into string form using the following\n * rules:\n *\n *   * '\\x01' is used as an escape character.\n *   * Path separators are encoded as \"\\x01\\x01\"\n *   * NUL bytes are encoded as \"\\x01\\x10\"\n *   * '\\x01' is encoded as \"\\x01\\x11\"\n *\n * This encoding leaves some room between path separators and the NUL byte\n * just in case we decide to support integer document ids after all.\n *\n * Note that characters treated specially by the backend ('.', '/', and '~')\n * are not treated specially here. This class assumes that any unescaping of\n * resource path strings into actual ResourcePath objects will handle these\n * characters there.\n */\nexport type EncodedResourcePath = string;\n\nconst escapeChar = '\\u0001';\nconst encodedSeparatorChar = '\\u0001';\nconst encodedNul = '\\u0010';\nconst encodedEscape = '\\u0011';\n\n/**\n * Encodes a resource path into a IndexedDb-compatible string form.\n */\nexport function encodeResourcePath(path: ResourcePath): EncodedResourcePath {\n  let result = '';\n  for (let i = 0; i < path.length; i++) {\n    if (result.length > 0) {\n      result = encodeSeparator(result);\n    }\n    result = encodeSegment(path.get(i), result);\n  }\n  return encodeSeparator(result);\n}\n\n/** Encodes a single segment of a resource path into the given result */\nfunction encodeSegment(segment: string, resultBuf: string): string {\n  let result = resultBuf;\n  const length = segment.length;\n  for (let i = 0; i < length; i++) {\n    const c = segment.charAt(i);\n    switch (c) {\n      case '\\0':\n        result += escapeChar + encodedNul;\n        break;\n      case escapeChar:\n        result += escapeChar + encodedEscape;\n        break;\n      default:\n        result += c;\n    }\n  }\n  return result;\n}\n\n/** Encodes a path separator into the given result */\nfunction encodeSeparator(result: string): string {\n  return result + escapeChar + encodedSeparatorChar;\n}\n\n/**\n * Decodes the given IndexedDb-compatible string form of a resource path into\n * a ResourcePath instance. Note that this method is not suitable for use with\n * decoding resource names from the server; those are One Platform format\n * strings.\n */\nexport function decodeResourcePath(path: EncodedResourcePath): ResourcePath {\n  // Event the empty path must encode as a path of at least length 2. A path\n  // with exactly 2 must be the empty path.\n  const length = path.length;\n  hardAssert(length >= 2, 'Invalid path ' + path);\n  if (length === 2) {\n    hardAssert(\n      path.charAt(0) === escapeChar && path.charAt(1) === encodedSeparatorChar,\n      'Non-empty path ' + path + ' had length 2'\n    );\n    return ResourcePath.EMPTY_PATH;\n  }\n\n  // Escape characters cannot exist past the second-to-last position in the\n  // source value.\n  const lastReasonableEscapeIndex = length - 2;\n\n  const segments: string[] = [];\n  let segmentBuilder = '';\n\n  for (let start = 0; start < length; ) {\n    // The last two characters of a valid encoded path must be a separator, so\n    // there must be an end to this segment.\n    const end = path.indexOf(escapeChar, start);\n    if (end < 0 || end > lastReasonableEscapeIndex) {\n      fail('Invalid encoded resource path: \"' + path + '\"');\n    }\n\n    const next = path.charAt(end + 1);\n    switch (next) {\n      case encodedSeparatorChar:\n        const currentPiece = path.substring(start, end);\n        let segment;\n        if (segmentBuilder.length === 0) {\n          // Avoid copying for the common case of a segment that excludes \\0\n          // and \\001\n          segment = currentPiece;\n        } else {\n          segmentBuilder += currentPiece;\n          segment = segmentBuilder;\n          segmentBuilder = '';\n        }\n        segments.push(segment);\n        break;\n      case encodedNul:\n        segmentBuilder += path.substring(start, end);\n        segmentBuilder += '\\0';\n        break;\n      case encodedEscape:\n        // The escape character can be used in the output to encode itself.\n        segmentBuilder += path.substring(start, end + 1);\n        break;\n      default:\n        fail('Invalid encoded resource path: \"' + path + '\"');\n    }\n\n    start = end + 2;\n  }\n\n  return new ResourcePath(segments);\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 { ResourcePath } from '../model/path';\nimport { debugAssert } from '../util/assert';\nimport { SortedSet } from '../util/sorted_set';\nimport { IndexManager } from './index_manager';\nimport { PersistenceTransaction } from './persistence';\nimport { PersistencePromise } from './persistence_promise';\n\n/**\n * An in-memory implementation of IndexManager.\n */\nexport class MemoryIndexManager implements IndexManager {\n  private collectionParentIndex = new MemoryCollectionParentIndex();\n\n  addToCollectionParentIndex(\n    transaction: PersistenceTransaction,\n    collectionPath: ResourcePath\n  ): PersistencePromise<void> {\n    this.collectionParentIndex.add(collectionPath);\n    return PersistencePromise.resolve();\n  }\n\n  getCollectionParents(\n    transaction: PersistenceTransaction,\n    collectionId: string\n  ): PersistencePromise<ResourcePath[]> {\n    return PersistencePromise.resolve(\n      this.collectionParentIndex.getEntries(collectionId)\n    );\n  }\n}\n\n/**\n * Internal implementation of the collection-parent index exposed by MemoryIndexManager.\n * Also used for in-memory caching by IndexedDbIndexManager and initial index population\n * in indexeddb_schema.ts\n */\nexport class MemoryCollectionParentIndex {\n  private index = {} as {\n    [collectionId: string]: SortedSet<ResourcePath>;\n  };\n\n  // Returns false if the entry already existed.\n  add(collectionPath: ResourcePath): boolean {\n    debugAssert(collectionPath.length % 2 === 1, 'Expected a collection path.');\n    const collectionId = collectionPath.lastSegment();\n    const parentPath = collectionPath.popLast();\n    const existingParents =\n      this.index[collectionId] ||\n      new SortedSet<ResourcePath>(ResourcePath.comparator);\n    const added = !existingParents.has(parentPath);\n    this.index[collectionId] = existingParents.add(parentPath);\n    return added;\n  }\n\n  has(collectionPath: ResourcePath): boolean {\n    const collectionId = collectionPath.lastSegment();\n    const parentPath = collectionPath.popLast();\n    const existingParents = this.index[collectionId];\n    return existingParents && existingParents.has(parentPath);\n  }\n\n  getEntries(collectionId: string): ResourcePath[] {\n    const parentPaths =\n      this.index[collectionId] ||\n      new SortedSet<ResourcePath>(ResourcePath.comparator);\n    return parentPaths.toArray();\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 { ResourcePath } from '../model/path';\nimport { debugAssert } from '../util/assert';\nimport { immediateSuccessor } from '../util/misc';\nimport {\n  decodeResourcePath,\n  encodeResourcePath\n} from './encoded_resource_path';\nimport { IndexManager } from './index_manager';\nimport { IndexedDbPersistence } from './indexeddb_persistence';\nimport { DbCollectionParent, DbCollectionParentKey } from './indexeddb_schema';\nimport { MemoryCollectionParentIndex } from './memory_index_manager';\nimport { PersistenceTransaction } from './persistence';\nimport { PersistencePromise } from './persistence_promise';\nimport { SimpleDbStore } from './simple_db';\n\n/**\n * A persisted implementation of IndexManager.\n */\nexport class IndexedDbIndexManager implements IndexManager {\n  /**\n   * An in-memory copy of the index entries we've already written since the SDK\n   * launched. Used to avoid re-writing the same entry repeatedly.\n   *\n   * This is *NOT* a complete cache of what's in persistence and so can never be used to\n   * satisfy reads.\n   */\n  private collectionParentsCache = new MemoryCollectionParentIndex();\n\n  /**\n   * Adds a new entry to the collection parent index.\n   *\n   * Repeated calls for the same collectionPath should be avoided within a\n   * transaction as IndexedDbIndexManager only caches writes once a transaction\n   * has been committed.\n   */\n  addToCollectionParentIndex(\n    transaction: PersistenceTransaction,\n    collectionPath: ResourcePath\n  ): PersistencePromise<void> {\n    debugAssert(collectionPath.length % 2 === 1, 'Expected a collection path.');\n    if (!this.collectionParentsCache.has(collectionPath)) {\n      const collectionId = collectionPath.lastSegment();\n      const parentPath = collectionPath.popLast();\n\n      transaction.addOnCommittedListener(() => {\n        // Add the collection to the in memory cache only if the transaction was\n        // successfully committed.\n        this.collectionParentsCache.add(collectionPath);\n      });\n\n      const collectionParent: DbCollectionParent = {\n        collectionId,\n        parent: encodeResourcePath(parentPath)\n      };\n      return collectionParentsStore(transaction).put(collectionParent);\n    }\n    return PersistencePromise.resolve();\n  }\n\n  getCollectionParents(\n    transaction: PersistenceTransaction,\n    collectionId: string\n  ): PersistencePromise<ResourcePath[]> {\n    const parentPaths = [] as ResourcePath[];\n    const range = IDBKeyRange.bound(\n      [collectionId, ''],\n      [immediateSuccessor(collectionId), ''],\n      /*lowerOpen=*/ false,\n      /*upperOpen=*/ true\n    );\n    return collectionParentsStore(transaction)\n      .loadAll(range)\n      .next(entries => {\n        for (const entry of entries) {\n          // This collectionId guard shouldn't be necessary (and isn't as long\n          // as we're running in a real browser), but there's a bug in\n          // indexeddbshim that breaks our range in our tests running in node:\n          // https://github.com/axemclion/IndexedDBShim/issues/334\n          if (entry.collectionId !== collectionId) {\n            break;\n          }\n          parentPaths.push(decodeResourcePath(entry.parent));\n        }\n        return parentPaths;\n      });\n  }\n}\n\n/**\n * Helper to get a typed SimpleDbStore for the collectionParents\n * document store.\n */\nfunction collectionParentsStore(\n  txn: PersistenceTransaction\n): SimpleDbStore<DbCollectionParentKey, DbCollectionParent> {\n  return IndexedDbPersistence.getStore<\n    DbCollectionParentKey,\n    DbCollectionParent\n  >(txn, DbCollectionParent.store);\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 { Query } from '../core/query';\nimport {\n  DocumentKeySet,\n  DocumentMap,\n  documentMap,\n  DocumentSizeEntries,\n  DocumentSizeEntry,\n  MaybeDocumentMap,\n  maybeDocumentMap,\n  nullableMaybeDocumentMap,\n  NullableMaybeDocumentMap\n} from '../model/collections';\nimport { Document, MaybeDocument, NoDocument } from '../model/document';\nimport { DocumentKey } from '../model/document_key';\nimport { ResourcePath } from '../model/path';\nimport { primitiveComparator } from '../util/misc';\nimport { SortedMap } from '../util/sorted_map';\nimport { SortedSet } from '../util/sorted_set';\n\nimport { SnapshotVersion } from '../core/snapshot_version';\nimport { debugAssert, fail, hardAssert } from '../util/assert';\nimport { IndexManager } from './index_manager';\nimport { IndexedDbPersistence } from './indexeddb_persistence';\nimport {\n  DbRemoteDocument,\n  DbRemoteDocumentGlobal,\n  DbRemoteDocumentGlobalKey,\n  DbRemoteDocumentKey\n} from './indexeddb_schema';\nimport { LocalSerializer } from './local_serializer';\nimport { PersistenceTransaction } from './persistence';\nimport { PersistencePromise } from './persistence_promise';\nimport { RemoteDocumentCache } from './remote_document_cache';\nimport { RemoteDocumentChangeBuffer } from './remote_document_change_buffer';\nimport { IterateOptions, SimpleDbStore } from './simple_db';\nimport { ObjectMap } from '../util/obj_map';\n\nexport class IndexedDbRemoteDocumentCache implements RemoteDocumentCache {\n  /**\n   * @param {LocalSerializer} serializer The document serializer.\n   * @param {IndexManager} indexManager The query indexes that need to be maintained.\n   */\n  constructor(\n    readonly serializer: LocalSerializer,\n    private readonly indexManager: IndexManager\n  ) {}\n\n  /**\n   * Adds the supplied entries to the cache.\n   *\n   * All calls of `addEntry` are required to go through the RemoteDocumentChangeBuffer\n   * returned by `newChangeBuffer()` to ensure proper accounting of metadata.\n   */\n  private addEntry(\n    transaction: PersistenceTransaction,\n    key: DocumentKey,\n    doc: DbRemoteDocument\n  ): PersistencePromise<void> {\n    const documentStore = remoteDocumentsStore(transaction);\n    return documentStore.put(dbKey(key), doc);\n  }\n\n  /**\n   * Removes a document from the cache.\n   *\n   * All calls of `removeEntry`  are required to go through the RemoteDocumentChangeBuffer\n   * returned by `newChangeBuffer()` to ensure proper accounting of metadata.\n   */\n  private removeEntry(\n    transaction: PersistenceTransaction,\n    documentKey: DocumentKey\n  ): PersistencePromise<void> {\n    const store = remoteDocumentsStore(transaction);\n    const key = dbKey(documentKey);\n    return store.delete(key);\n  }\n\n  /**\n   * Updates the current cache size.\n   *\n   * Callers to `addEntry()` and `removeEntry()` *must* call this afterwards to update the\n   * cache's metadata.\n   */\n  private updateMetadata(\n    transaction: PersistenceTransaction,\n    sizeDelta: number\n  ): PersistencePromise<void> {\n    return this.getMetadata(transaction).next(metadata => {\n      metadata.byteSize += sizeDelta;\n      return this.setMetadata(transaction, metadata);\n    });\n  }\n\n  getEntry(\n    transaction: PersistenceTransaction,\n    documentKey: DocumentKey\n  ): PersistencePromise<MaybeDocument | null> {\n    return remoteDocumentsStore(transaction)\n      .get(dbKey(documentKey))\n      .next(dbRemoteDoc => {\n        return this.maybeDecodeDocument(dbRemoteDoc);\n      });\n  }\n\n  /**\n   * Looks up an entry in the cache.\n   *\n   * @param documentKey The key of the entry to look up.\n   * @return The cached MaybeDocument entry and its size, or null if we have nothing cached.\n   */\n  getSizedEntry(\n    transaction: PersistenceTransaction,\n    documentKey: DocumentKey\n  ): PersistencePromise<DocumentSizeEntry | null> {\n    return remoteDocumentsStore(transaction)\n      .get(dbKey(documentKey))\n      .next(dbRemoteDoc => {\n        const doc = this.maybeDecodeDocument(dbRemoteDoc);\n        return doc\n          ? {\n              maybeDocument: doc,\n              size: dbDocumentSize(dbRemoteDoc!)\n            }\n          : null;\n      });\n  }\n\n  getEntries(\n    transaction: PersistenceTransaction,\n    documentKeys: DocumentKeySet\n  ): PersistencePromise<NullableMaybeDocumentMap> {\n    let results = nullableMaybeDocumentMap();\n    return this.forEachDbEntry(\n      transaction,\n      documentKeys,\n      (key, dbRemoteDoc) => {\n        const doc = this.maybeDecodeDocument(dbRemoteDoc);\n        results = results.insert(key, doc);\n      }\n    ).next(() => results);\n  }\n\n  /**\n   * Looks up several entries in the cache.\n   *\n   * @param documentKeys The set of keys entries to look up.\n   * @return A map of MaybeDocuments indexed by key (if a document cannot be\n   *     found, the key will be mapped to null) and a map of sizes indexed by\n   *     key (zero if the key cannot be found).\n   */\n  getSizedEntries(\n    transaction: PersistenceTransaction,\n    documentKeys: DocumentKeySet\n  ): PersistencePromise<DocumentSizeEntries> {\n    let results = nullableMaybeDocumentMap();\n    let sizeMap = new SortedMap<DocumentKey, number>(DocumentKey.comparator);\n    return this.forEachDbEntry(\n      transaction,\n      documentKeys,\n      (key, dbRemoteDoc) => {\n        const doc = this.maybeDecodeDocument(dbRemoteDoc);\n        if (doc) {\n          results = results.insert(key, doc);\n          sizeMap = sizeMap.insert(key, dbDocumentSize(dbRemoteDoc!));\n        } else {\n          results = results.insert(key, null);\n          sizeMap = sizeMap.insert(key, 0);\n        }\n      }\n    ).next(() => {\n      return { maybeDocuments: results, sizeMap };\n    });\n  }\n\n  private forEachDbEntry(\n    transaction: PersistenceTransaction,\n    documentKeys: DocumentKeySet,\n    callback: (key: DocumentKey, doc: DbRemoteDocument | null) => void\n  ): PersistencePromise<void> {\n    if (documentKeys.isEmpty()) {\n      return PersistencePromise.resolve();\n    }\n\n    const range = IDBKeyRange.bound(\n      documentKeys.first()!.path.toArray(),\n      documentKeys.last()!.path.toArray()\n    );\n    const keyIter = documentKeys.getIterator();\n    let nextKey: DocumentKey | null = keyIter.getNext();\n\n    return remoteDocumentsStore(transaction)\n      .iterate({ range }, (potentialKeyRaw, dbRemoteDoc, control) => {\n        const potentialKey = DocumentKey.fromSegments(potentialKeyRaw);\n\n        // Go through keys not found in cache.\n        while (nextKey && DocumentKey.comparator(nextKey!, potentialKey) < 0) {\n          callback(nextKey!, null);\n          nextKey = keyIter.getNext();\n        }\n\n        if (nextKey && nextKey!.isEqual(potentialKey)) {\n          // Key found in cache.\n          callback(nextKey!, dbRemoteDoc);\n          nextKey = keyIter.hasNext() ? keyIter.getNext() : null;\n        }\n\n        // Skip to the next key (if there is one).\n        if (nextKey) {\n          control.skip(nextKey!.path.toArray());\n        } else {\n          control.done();\n        }\n      })\n      .next(() => {\n        // The rest of the keys are not in the cache. One case where `iterate`\n        // above won't go through them is when the cache is empty.\n        while (nextKey) {\n          callback(nextKey!, null);\n          nextKey = keyIter.hasNext() ? keyIter.getNext() : null;\n        }\n      });\n  }\n\n  getDocumentsMatchingQuery(\n    transaction: PersistenceTransaction,\n    query: Query,\n    sinceReadTime: SnapshotVersion\n  ): PersistencePromise<DocumentMap> {\n    debugAssert(\n      !query.isCollectionGroupQuery(),\n      'CollectionGroup queries should be handled in LocalDocumentsView'\n    );\n    let results = documentMap();\n\n    const immediateChildrenPathLength = query.path.length + 1;\n\n    const iterationOptions: IterateOptions = {};\n    if (sinceReadTime.isEqual(SnapshotVersion.min())) {\n      // Documents are ordered by key, so we can use a prefix scan to narrow\n      // down the documents we need to match the query against.\n      const startKey = query.path.toArray();\n      iterationOptions.range = IDBKeyRange.lowerBound(startKey);\n    } else {\n      // Execute an index-free query and filter by read time. This is safe\n      // since all document changes to queries that have a\n      // lastLimboFreeSnapshotVersion (`sinceReadTime`) have a read time set.\n      const collectionKey = query.path.toArray();\n      const readTimeKey = this.serializer.toDbTimestampKey(sinceReadTime);\n      iterationOptions.range = IDBKeyRange.lowerBound(\n        [collectionKey, readTimeKey],\n        /* open= */ true\n      );\n      iterationOptions.index = DbRemoteDocument.collectionReadTimeIndex;\n    }\n\n    return remoteDocumentsStore(transaction)\n      .iterate(iterationOptions, (key, dbRemoteDoc, control) => {\n        // The query is actually returning any path that starts with the query\n        // path prefix which may include documents in subcollections. For\n        // example, a query on 'rooms' will return rooms/abc/messages/xyx but we\n        // shouldn't match it. Fix this by discarding rows with document keys\n        // more than one segment longer than the query path.\n        if (key.length !== immediateChildrenPathLength) {\n          return;\n        }\n\n        const maybeDoc = this.serializer.fromDbRemoteDocument(dbRemoteDoc);\n        if (!query.path.isPrefixOf(maybeDoc.key.path)) {\n          control.done();\n        } else if (maybeDoc instanceof Document && query.matches(maybeDoc)) {\n          results = results.insert(maybeDoc.key, maybeDoc);\n        }\n      })\n      .next(() => results);\n  }\n\n  /**\n   * Returns the set of documents that have changed since the specified read\n   * time.\n   */\n  // PORTING NOTE: This is only used for multi-tab synchronization.\n  getNewDocumentChanges(\n    transaction: PersistenceTransaction,\n    sinceReadTime: SnapshotVersion\n  ): PersistencePromise<{\n    changedDocs: MaybeDocumentMap;\n    readTime: SnapshotVersion;\n  }> {\n    let changedDocs = maybeDocumentMap();\n\n    let lastReadTime = this.serializer.toDbTimestampKey(sinceReadTime);\n\n    const documentsStore = remoteDocumentsStore(transaction);\n    const range = IDBKeyRange.lowerBound(lastReadTime, true);\n    return documentsStore\n      .iterate(\n        { index: DbRemoteDocument.readTimeIndex, range },\n        (_, dbRemoteDoc) => {\n          // Unlike `getEntry()` and others, `getNewDocumentChanges()` parses\n          // the documents directly since we want to keep sentinel deletes.\n          const doc = this.serializer.fromDbRemoteDocument(dbRemoteDoc);\n          changedDocs = changedDocs.insert(doc.key, doc);\n          lastReadTime = dbRemoteDoc.readTime!;\n        }\n      )\n      .next(() => {\n        return {\n          changedDocs,\n          readTime: this.serializer.fromDbTimestampKey(lastReadTime)\n        };\n      });\n  }\n\n  /**\n   * Returns the read time of the most recently read document in the cache, or\n   * SnapshotVersion.min() if not available.\n   */\n  // PORTING NOTE: This is only used for multi-tab synchronization.\n  getLastReadTime(\n    transaction: PersistenceTransaction\n  ): PersistencePromise<SnapshotVersion> {\n    const documentsStore = remoteDocumentsStore(transaction);\n\n    // If there are no existing entries, we return SnapshotVersion.min().\n    let readTime = SnapshotVersion.min();\n\n    return documentsStore\n      .iterate(\n        { index: DbRemoteDocument.readTimeIndex, reverse: true },\n        (key, dbRemoteDoc, control) => {\n          if (dbRemoteDoc.readTime) {\n            readTime = this.serializer.fromDbTimestampKey(dbRemoteDoc.readTime);\n          }\n          control.done();\n        }\n      )\n      .next(() => readTime);\n  }\n\n  newChangeBuffer(options?: {\n    trackRemovals: boolean;\n  }): RemoteDocumentChangeBuffer {\n    return new IndexedDbRemoteDocumentCache.RemoteDocumentChangeBuffer(\n      this,\n      !!options && options.trackRemovals\n    );\n  }\n\n  getSize(txn: PersistenceTransaction): PersistencePromise<number> {\n    return this.getMetadata(txn).next(metadata => metadata.byteSize);\n  }\n\n  private getMetadata(\n    txn: PersistenceTransaction\n  ): PersistencePromise<DbRemoteDocumentGlobal> {\n    return documentGlobalStore(txn)\n      .get(DbRemoteDocumentGlobal.key)\n      .next(metadata => {\n        hardAssert(!!metadata, 'Missing document cache metadata');\n        return metadata!;\n      });\n  }\n\n  private setMetadata(\n    txn: PersistenceTransaction,\n    metadata: DbRemoteDocumentGlobal\n  ): PersistencePromise<void> {\n    return documentGlobalStore(txn).put(DbRemoteDocumentGlobal.key, metadata);\n  }\n\n  /**\n   * Decodes `remoteDoc` and returns the document (or null, if the document\n   * corresponds to the format used for sentinel deletes).\n   */\n  private maybeDecodeDocument(\n    dbRemoteDoc: DbRemoteDocument | null\n  ): MaybeDocument | null {\n    if (dbRemoteDoc) {\n      const doc = this.serializer.fromDbRemoteDocument(dbRemoteDoc);\n      if (\n        doc instanceof NoDocument &&\n        doc.version.isEqual(SnapshotVersion.min())\n      ) {\n        // The document is a sentinel removal and should only be used in the\n        // `getNewDocumentChanges()`.\n        return null;\n      }\n\n      return doc;\n    }\n    return null;\n  }\n\n  /**\n   * Handles the details of adding and updating documents in the IndexedDbRemoteDocumentCache.\n   *\n   * Unlike the MemoryRemoteDocumentChangeBuffer, the IndexedDb implementation computes the size\n   * delta for all submitted changes. This avoids having to re-read all documents from IndexedDb\n   * when we apply the changes.\n   */\n  private static RemoteDocumentChangeBuffer = class extends RemoteDocumentChangeBuffer {\n    // A map of document sizes prior to applying the changes in this buffer.\n    protected documentSizes: ObjectMap<\n      DocumentKey,\n      number\n    > = new ObjectMap(key => key.toString());\n\n    /**\n     * @param documentCache The IndexedDbRemoteDocumentCache to apply the changes to.\n     * @param trackRemovals Whether to create sentinel deletes that can be tracked by\n     * `getNewDocumentChanges()`.\n     */\n    constructor(\n      private readonly documentCache: IndexedDbRemoteDocumentCache,\n      private readonly trackRemovals: boolean\n    ) {\n      super();\n    }\n\n    protected applyChanges(\n      transaction: PersistenceTransaction\n    ): PersistencePromise<void> {\n      const promises: Array<PersistencePromise<void>> = [];\n\n      let sizeDelta = 0;\n\n      let collectionParents = new SortedSet<ResourcePath>((l, r) =>\n        primitiveComparator(l.canonicalString(), r.canonicalString())\n      );\n\n      this.changes.forEach((key, maybeDocument) => {\n        const previousSize = this.documentSizes.get(key);\n        debugAssert(\n          previousSize !== undefined,\n          `Cannot modify a document that wasn't read (for ${key})`\n        );\n        if (maybeDocument) {\n          debugAssert(\n            !this.readTime.isEqual(SnapshotVersion.min()),\n            'Cannot add a document with a read time of zero'\n          );\n          const doc = this.documentCache.serializer.toDbRemoteDocument(\n            maybeDocument,\n            this.readTime\n          );\n          collectionParents = collectionParents.add(key.path.popLast());\n\n          const size = dbDocumentSize(doc);\n          sizeDelta += size - previousSize!;\n          promises.push(this.documentCache.addEntry(transaction, key, doc));\n        } else {\n          sizeDelta -= previousSize!;\n          if (this.trackRemovals) {\n            // In order to track removals, we store a \"sentinel delete\" in the\n            // RemoteDocumentCache. This entry is represented by a NoDocument\n            // with a version of 0 and ignored by `maybeDecodeDocument()` but\n            // preserved in `getNewDocumentChanges()`.\n            const deletedDoc = this.documentCache.serializer.toDbRemoteDocument(\n              new NoDocument(key, SnapshotVersion.min()),\n              this.readTime\n            );\n            promises.push(\n              this.documentCache.addEntry(transaction, key, deletedDoc)\n            );\n          } else {\n            promises.push(this.documentCache.removeEntry(transaction, key));\n          }\n        }\n      });\n\n      collectionParents.forEach(parent => {\n        promises.push(\n          this.documentCache.indexManager.addToCollectionParentIndex(\n            transaction,\n            parent\n          )\n        );\n      });\n\n      promises.push(this.documentCache.updateMetadata(transaction, sizeDelta));\n\n      return PersistencePromise.waitFor(promises);\n    }\n\n    protected getFromCache(\n      transaction: PersistenceTransaction,\n      documentKey: DocumentKey\n    ): PersistencePromise<MaybeDocument | null> {\n      // Record the size of everything we load from the cache so we can compute a delta later.\n      return this.documentCache\n        .getSizedEntry(transaction, documentKey)\n        .next(getResult => {\n          if (getResult === null) {\n            this.documentSizes.set(documentKey, 0);\n            return null;\n          } else {\n            this.documentSizes.set(documentKey, getResult.size);\n            return getResult.maybeDocument;\n          }\n        });\n    }\n\n    protected getAllFromCache(\n      transaction: PersistenceTransaction,\n      documentKeys: DocumentKeySet\n    ): PersistencePromise<NullableMaybeDocumentMap> {\n      // Record the size of everything we load from the cache so we can compute\n      // a delta later.\n      return this.documentCache\n        .getSizedEntries(transaction, documentKeys)\n        .next(({ maybeDocuments, sizeMap }) => {\n          // Note: `getAllFromCache` returns two maps instead of a single map from\n          // keys to `DocumentSizeEntry`s. This is to allow returning the\n          // `NullableMaybeDocumentMap` directly, without a conversion.\n          sizeMap.forEach((documentKey, size) => {\n            this.documentSizes.set(documentKey, size);\n          });\n          return maybeDocuments;\n        });\n    }\n  };\n}\n\nfunction documentGlobalStore(\n  txn: PersistenceTransaction\n): SimpleDbStore<DbRemoteDocumentGlobalKey, DbRemoteDocumentGlobal> {\n  return IndexedDbPersistence.getStore<\n    DbRemoteDocumentGlobalKey,\n    DbRemoteDocumentGlobal\n  >(txn, DbRemoteDocumentGlobal.store);\n}\n\n/**\n * Helper to get a typed SimpleDbStore for the remoteDocuments object store.\n */\nfunction remoteDocumentsStore(\n  txn: PersistenceTransaction\n): SimpleDbStore<DbRemoteDocumentKey, DbRemoteDocument> {\n  return IndexedDbPersistence.getStore<DbRemoteDocumentKey, DbRemoteDocument>(\n    txn,\n    DbRemoteDocument.store\n  );\n}\n\nfunction dbKey(docKey: DocumentKey): DbRemoteDocumentKey {\n  return docKey.path.toArray();\n}\n\n/**\n * Retrusn an approximate size for the given document.\n */\nexport function dbDocumentSize(doc: DbRemoteDocument): number {\n  let value: unknown;\n  if (doc.document) {\n    value = doc.document;\n  } else if (doc.unknownDocument) {\n    value = doc.unknownDocument;\n  } else if (doc.noDocument) {\n    value = doc.noDocument;\n  } else {\n    throw fail('Unknown remote document type');\n  }\n  return JSON.stringify(value).length;\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 { TargetId } from './types';\n\n/** Offset to ensure non-overlapping target ids. */\nconst OFFSET = 2;\n\n/**\n * Generates monotonically increasing target IDs for sending targets to the\n * watch stream.\n *\n * The client constructs two generators, one for the target cache, and one for\n * for the sync engine (to generate limbo documents targets). These\n * generators produce non-overlapping IDs (by using even and odd IDs\n * respectively).\n *\n * By separating the target ID space, the query cache can generate target IDs\n * that persist across client restarts, while sync engine can independently\n * generate in-memory target IDs that are transient and can be reused after a\n * restart.\n */\nexport class TargetIdGenerator {\n  constructor(private lastId: number) {}\n\n  next(): TargetId {\n    this.lastId += OFFSET;\n    return this.lastId;\n  }\n\n  static forTargetCache(): TargetIdGenerator {\n    // The target cache generator must return '2' in its first call to `next()`\n    // as there is no differentiation in the protocol layer between an unset\n    // number and the number '0'. If we were to sent a target with target ID\n    // '0', the backend would consider it unset and replace it with its own ID.\n    return new TargetIdGenerator(2 - OFFSET);\n  }\n\n  static forSyncEngine(): TargetIdGenerator {\n    // Sync engine assigns target IDs for limbo document detection.\n    return new TargetIdGenerator(1 - OFFSET);\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 { Timestamp } from '../api/timestamp';\nimport { SnapshotVersion } from '../core/snapshot_version';\nimport { ListenSequenceNumber, TargetId } from '../core/types';\nimport { DocumentKeySet, documentKeySet } from '../model/collections';\nimport { DocumentKey } from '../model/document_key';\nimport { hardAssert } from '../util/assert';\nimport { immediateSuccessor } from '../util/misc';\nimport { TargetIdGenerator } from '../core/target_id_generator';\nimport {\n  decodeResourcePath,\n  encodeResourcePath\n} from './encoded_resource_path';\nimport {\n  IndexedDbLruDelegate,\n  IndexedDbPersistence\n} from './indexeddb_persistence';\nimport {\n  DbTarget,\n  DbTargetDocument,\n  DbTargetDocumentKey,\n  DbTargetGlobal,\n  DbTargetGlobalKey,\n  DbTargetKey\n} from './indexeddb_schema';\nimport { LocalSerializer } from './local_serializer';\nimport { ActiveTargets } from './lru_garbage_collector';\nimport { PersistenceTransaction } from './persistence';\nimport { PersistencePromise } from './persistence_promise';\nimport { TargetCache } from './target_cache';\nimport { TargetData } from './target_data';\nimport { SimpleDbStore } from './simple_db';\nimport { Target } from '../core/target';\n\nexport class IndexedDbTargetCache implements TargetCache {\n  constructor(\n    private readonly referenceDelegate: IndexedDbLruDelegate,\n    private serializer: LocalSerializer\n  ) {}\n\n  // PORTING NOTE: We don't cache global metadata for the target cache, since\n  // some of it (in particular `highestTargetId`) can be modified by secondary\n  // tabs. We could perhaps be more granular (and e.g. still cache\n  // `lastRemoteSnapshotVersion` in memory) but for simplicity we currently go\n  // to IndexedDb whenever we need to read metadata. We can revisit if it turns\n  // out to have a meaningful performance impact.\n\n  allocateTargetId(\n    transaction: PersistenceTransaction\n  ): PersistencePromise<TargetId> {\n    return this.retrieveMetadata(transaction).next(metadata => {\n      const targetIdGenerator = new TargetIdGenerator(metadata.highestTargetId);\n      metadata.highestTargetId = targetIdGenerator.next();\n      return this.saveMetadata(transaction, metadata).next(\n        () => metadata.highestTargetId\n      );\n    });\n  }\n\n  getLastRemoteSnapshotVersion(\n    transaction: PersistenceTransaction\n  ): PersistencePromise<SnapshotVersion> {\n    return this.retrieveMetadata(transaction).next(metadata => {\n      return SnapshotVersion.fromTimestamp(\n        new Timestamp(\n          metadata.lastRemoteSnapshotVersion.seconds,\n          metadata.lastRemoteSnapshotVersion.nanoseconds\n        )\n      );\n    });\n  }\n\n  getHighestSequenceNumber(\n    transaction: PersistenceTransaction\n  ): PersistencePromise<ListenSequenceNumber> {\n    return this.retrieveMetadata(transaction).next(\n      targetGlobal => targetGlobal.highestListenSequenceNumber\n    );\n  }\n\n  setTargetsMetadata(\n    transaction: PersistenceTransaction,\n    highestListenSequenceNumber: number,\n    lastRemoteSnapshotVersion?: SnapshotVersion\n  ): PersistencePromise<void> {\n    return this.retrieveMetadata(transaction).next(metadata => {\n      metadata.highestListenSequenceNumber = highestListenSequenceNumber;\n      if (lastRemoteSnapshotVersion) {\n        metadata.lastRemoteSnapshotVersion = lastRemoteSnapshotVersion.toTimestamp();\n      }\n      if (highestListenSequenceNumber > metadata.highestListenSequenceNumber) {\n        metadata.highestListenSequenceNumber = highestListenSequenceNumber;\n      }\n      return this.saveMetadata(transaction, metadata);\n    });\n  }\n\n  addTargetData(\n    transaction: PersistenceTransaction,\n    targetData: TargetData\n  ): PersistencePromise<void> {\n    return this.saveTargetData(transaction, targetData).next(() => {\n      return this.retrieveMetadata(transaction).next(metadata => {\n        metadata.targetCount += 1;\n        this.updateMetadataFromTargetData(targetData, metadata);\n        return this.saveMetadata(transaction, metadata);\n      });\n    });\n  }\n\n  updateTargetData(\n    transaction: PersistenceTransaction,\n    targetData: TargetData\n  ): PersistencePromise<void> {\n    return this.saveTargetData(transaction, targetData);\n  }\n\n  removeTargetData(\n    transaction: PersistenceTransaction,\n    targetData: TargetData\n  ): PersistencePromise<void> {\n    return this.removeMatchingKeysForTargetId(transaction, targetData.targetId)\n      .next(() => targetsStore(transaction).delete(targetData.targetId))\n      .next(() => this.retrieveMetadata(transaction))\n      .next(metadata => {\n        hardAssert(\n          metadata.targetCount > 0,\n          'Removing from an empty target cache'\n        );\n        metadata.targetCount -= 1;\n        return this.saveMetadata(transaction, metadata);\n      });\n  }\n\n  /**\n   * Drops any targets with sequence number less than or equal to the upper bound, excepting those\n   * present in `activeTargetIds`. Document associations for the removed targets are also removed.\n   * Returns the number of targets removed.\n   */\n  removeTargets(\n    txn: PersistenceTransaction,\n    upperBound: ListenSequenceNumber,\n    activeTargetIds: ActiveTargets\n  ): PersistencePromise<number> {\n    let count = 0;\n    const promises: Array<PersistencePromise<void>> = [];\n    return targetsStore(txn)\n      .iterate((key, value) => {\n        const targetData = this.serializer.fromDbTarget(value);\n        if (\n          targetData.sequenceNumber <= upperBound &&\n          activeTargetIds.get(targetData.targetId) === null\n        ) {\n          count++;\n          promises.push(this.removeTargetData(txn, targetData));\n        }\n      })\n      .next(() => PersistencePromise.waitFor(promises))\n      .next(() => count);\n  }\n\n  /**\n   * Call provided function with each `TargetData` that we have cached.\n   */\n  forEachTarget(\n    txn: PersistenceTransaction,\n    f: (q: TargetData) => void\n  ): PersistencePromise<void> {\n    return targetsStore(txn).iterate((key, value) => {\n      const targetData = this.serializer.fromDbTarget(value);\n      f(targetData);\n    });\n  }\n\n  private retrieveMetadata(\n    transaction: PersistenceTransaction\n  ): PersistencePromise<DbTargetGlobal> {\n    return globalTargetStore(transaction)\n      .get(DbTargetGlobal.key)\n      .next(metadata => {\n        hardAssert(metadata !== null, 'Missing metadata row.');\n        return metadata;\n      });\n  }\n\n  private saveMetadata(\n    transaction: PersistenceTransaction,\n    metadata: DbTargetGlobal\n  ): PersistencePromise<void> {\n    return globalTargetStore(transaction).put(DbTargetGlobal.key, metadata);\n  }\n\n  private saveTargetData(\n    transaction: PersistenceTransaction,\n    targetData: TargetData\n  ): PersistencePromise<void> {\n    return targetsStore(transaction).put(\n      this.serializer.toDbTarget(targetData)\n    );\n  }\n\n  /**\n   * In-place updates the provided metadata to account for values in the given\n   * TargetData. Saving is done separately. Returns true if there were any\n   * changes to the metadata.\n   */\n  private updateMetadataFromTargetData(\n    targetData: TargetData,\n    metadata: DbTargetGlobal\n  ): boolean {\n    let updated = false;\n    if (targetData.targetId > metadata.highestTargetId) {\n      metadata.highestTargetId = targetData.targetId;\n      updated = true;\n    }\n\n    if (targetData.sequenceNumber > metadata.highestListenSequenceNumber) {\n      metadata.highestListenSequenceNumber = targetData.sequenceNumber;\n      updated = true;\n    }\n    return updated;\n  }\n\n  getTargetCount(\n    transaction: PersistenceTransaction\n  ): PersistencePromise<number> {\n    return this.retrieveMetadata(transaction).next(\n      metadata => metadata.targetCount\n    );\n  }\n\n  getTargetData(\n    transaction: PersistenceTransaction,\n    target: Target\n  ): PersistencePromise<TargetData | null> {\n    // Iterating by the canonicalId may yield more than one result because\n    // canonicalId values are not required to be unique per target. This query\n    // depends on the queryTargets index to be efficient.\n    const canonicalId = target.canonicalId();\n    const range = IDBKeyRange.bound(\n      [canonicalId, Number.NEGATIVE_INFINITY],\n      [canonicalId, Number.POSITIVE_INFINITY]\n    );\n    let result: TargetData | null = null;\n    return targetsStore(transaction)\n      .iterate(\n        { range, index: DbTarget.queryTargetsIndexName },\n        (key, value, control) => {\n          const found = this.serializer.fromDbTarget(value);\n          // After finding a potential match, check that the target is\n          // actually equal to the requested target.\n          if (target.isEqual(found.target)) {\n            result = found;\n            control.done();\n          }\n        }\n      )\n      .next(() => result);\n  }\n\n  addMatchingKeys(\n    txn: PersistenceTransaction,\n    keys: DocumentKeySet,\n    targetId: TargetId\n  ): PersistencePromise<void> {\n    // PORTING NOTE: The reverse index (documentsTargets) is maintained by\n    // IndexedDb.\n    const promises: Array<PersistencePromise<void>> = [];\n    const store = documentTargetStore(txn);\n    keys.forEach(key => {\n      const path = encodeResourcePath(key.path);\n      promises.push(store.put(new DbTargetDocument(targetId, path)));\n      promises.push(this.referenceDelegate.addReference(txn, targetId, key));\n    });\n    return PersistencePromise.waitFor(promises);\n  }\n\n  removeMatchingKeys(\n    txn: PersistenceTransaction,\n    keys: DocumentKeySet,\n    targetId: TargetId\n  ): PersistencePromise<void> {\n    // PORTING NOTE: The reverse index (documentsTargets) is maintained by\n    // IndexedDb.\n    const store = documentTargetStore(txn);\n    return PersistencePromise.forEach(keys, (key: DocumentKey) => {\n      const path = encodeResourcePath(key.path);\n      return PersistencePromise.waitFor([\n        store.delete([targetId, path]),\n        this.referenceDelegate.removeReference(txn, targetId, key)\n      ]);\n    });\n  }\n\n  removeMatchingKeysForTargetId(\n    txn: PersistenceTransaction,\n    targetId: TargetId\n  ): PersistencePromise<void> {\n    const store = documentTargetStore(txn);\n    const range = IDBKeyRange.bound(\n      [targetId],\n      [targetId + 1],\n      /*lowerOpen=*/ false,\n      /*upperOpen=*/ true\n    );\n    return store.delete(range);\n  }\n\n  getMatchingKeysForTargetId(\n    txn: PersistenceTransaction,\n    targetId: TargetId\n  ): PersistencePromise<DocumentKeySet> {\n    const range = IDBKeyRange.bound(\n      [targetId],\n      [targetId + 1],\n      /*lowerOpen=*/ false,\n      /*upperOpen=*/ true\n    );\n    const store = documentTargetStore(txn);\n    let result = documentKeySet();\n\n    return store\n      .iterate({ range, keysOnly: true }, (key, _, control) => {\n        const path = decodeResourcePath(key[1]);\n        const docKey = new DocumentKey(path);\n        result = result.add(docKey);\n      })\n      .next(() => result);\n  }\n\n  containsKey(\n    txn: PersistenceTransaction,\n    key: DocumentKey\n  ): PersistencePromise<boolean> {\n    const path = encodeResourcePath(key.path);\n    const range = IDBKeyRange.bound(\n      [path],\n      [immediateSuccessor(path)],\n      /*lowerOpen=*/ false,\n      /*upperOpen=*/ true\n    );\n    let count = 0;\n    return documentTargetStore(txn!)\n      .iterate(\n        {\n          index: DbTargetDocument.documentTargetsIndex,\n          keysOnly: true,\n          range\n        },\n        ([targetId, path], _, control) => {\n          // Having a sentinel row for a document does not count as containing that document;\n          // For the target cache, containing the document means the document is part of some\n          // target.\n          if (targetId !== 0) {\n            count++;\n            control.done();\n          }\n        }\n      )\n      .next(() => count > 0);\n  }\n\n  /**\n   * Looks up a TargetData entry by target ID.\n   *\n   * @param targetId The target ID of the TargetData entry to look up.\n   * @return The cached TargetData entry, or null if the cache has no entry for\n   * the target.\n   */\n  // PORTING NOTE: Multi-tab only.\n  getTargetDataForTarget(\n    transaction: PersistenceTransaction,\n    targetId: TargetId\n  ): PersistencePromise<TargetData | null> {\n    return targetsStore(transaction)\n      .get(targetId)\n      .next(found => {\n        if (found) {\n          return this.serializer.fromDbTarget(found);\n        } else {\n          return null;\n        }\n      });\n  }\n}\n\n/**\n * Helper to get a typed SimpleDbStore for the queries object store.\n */\nfunction targetsStore(\n  txn: PersistenceTransaction\n): SimpleDbStore<DbTargetKey, DbTarget> {\n  return IndexedDbPersistence.getStore<DbTargetKey, DbTarget>(\n    txn,\n    DbTarget.store\n  );\n}\n\n/**\n * Helper to get a typed SimpleDbStore for the target globals object store.\n */\nfunction globalTargetStore(\n  txn: PersistenceTransaction\n): SimpleDbStore<DbTargetGlobalKey, DbTargetGlobal> {\n  return IndexedDbPersistence.getStore<DbTargetGlobalKey, DbTargetGlobal>(\n    txn,\n    DbTargetGlobal.store\n  );\n}\n\n/**\n * Helper to get a typed SimpleDbStore for the document target object store.\n */\nexport function documentTargetStore(\n  txn: PersistenceTransaction\n): SimpleDbStore<DbTargetDocumentKey, DbTargetDocument> {\n  return IndexedDbPersistence.getStore<DbTargetDocumentKey, DbTargetDocument>(\n    txn,\n    DbTargetDocument.store\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 { Timestamp } from '../api/timestamp';\nimport { SnapshotVersion } from '../core/snapshot_version';\nimport {\n  Document,\n  MaybeDocument,\n  NoDocument,\n  UnknownDocument\n} from '../model/document';\nimport { DocumentKey } from '../model/document_key';\nimport { MutationBatch } from '../model/mutation_batch';\nimport * as api from '../protos/firestore_proto_api';\nimport { JsonProtoSerializer } from '../remote/serializer';\nimport { debugAssert, fail } from '../util/assert';\nimport { ByteString } from '../util/byte_string';\nimport { Target } from '../core/target';\nimport {\n  DbMutationBatch,\n  DbNoDocument,\n  DbQuery,\n  DbRemoteDocument,\n  DbTarget,\n  DbTimestamp,\n  DbTimestampKey,\n  DbUnknownDocument\n} from './indexeddb_schema';\nimport { TargetData, TargetPurpose } from './target_data';\n\n/** Serializer for values stored in the LocalStore. */\nexport class LocalSerializer {\n  constructor(private remoteSerializer: JsonProtoSerializer) {}\n\n  /** Decodes a remote document from storage locally to a Document. */\n  fromDbRemoteDocument(remoteDoc: DbRemoteDocument): MaybeDocument {\n    if (remoteDoc.document) {\n      return this.remoteSerializer.fromDocument(\n        remoteDoc.document,\n        !!remoteDoc.hasCommittedMutations\n      );\n    } else if (remoteDoc.noDocument) {\n      const key = DocumentKey.fromSegments(remoteDoc.noDocument.path);\n      const version = this.fromDbTimestamp(remoteDoc.noDocument.readTime);\n      return new NoDocument(key, version, {\n        hasCommittedMutations: !!remoteDoc.hasCommittedMutations\n      });\n    } else if (remoteDoc.unknownDocument) {\n      const key = DocumentKey.fromSegments(remoteDoc.unknownDocument.path);\n      const version = this.fromDbTimestamp(remoteDoc.unknownDocument.version);\n      return new UnknownDocument(key, version);\n    } else {\n      return fail('Unexpected DbRemoteDocument');\n    }\n  }\n\n  /** Encodes a document for storage locally. */\n  toDbRemoteDocument(\n    maybeDoc: MaybeDocument,\n    readTime: SnapshotVersion\n  ): DbRemoteDocument {\n    const dbReadTime = this.toDbTimestampKey(readTime);\n    const parentPath = maybeDoc.key.path.popLast().toArray();\n    if (maybeDoc instanceof Document) {\n      const doc = this.remoteSerializer.toDocument(maybeDoc);\n      const hasCommittedMutations = maybeDoc.hasCommittedMutations;\n      return new DbRemoteDocument(\n        /* unknownDocument= */ null,\n        /* noDocument= */ null,\n        doc,\n        hasCommittedMutations,\n        dbReadTime,\n        parentPath\n      );\n    } else if (maybeDoc instanceof NoDocument) {\n      const path = maybeDoc.key.path.toArray();\n      const readTime = this.toDbTimestamp(maybeDoc.version);\n      const hasCommittedMutations = maybeDoc.hasCommittedMutations;\n      return new DbRemoteDocument(\n        /* unknownDocument= */ null,\n        new DbNoDocument(path, readTime),\n        /* document= */ null,\n        hasCommittedMutations,\n        dbReadTime,\n        parentPath\n      );\n    } else if (maybeDoc instanceof UnknownDocument) {\n      const path = maybeDoc.key.path.toArray();\n      const readTime = this.toDbTimestamp(maybeDoc.version);\n      return new DbRemoteDocument(\n        new DbUnknownDocument(path, readTime),\n        /* noDocument= */ null,\n        /* document= */ null,\n        /* hasCommittedMutations= */ true,\n        dbReadTime,\n        parentPath\n      );\n    } else {\n      return fail('Unexpected MaybeDocument');\n    }\n  }\n\n  toDbTimestampKey(snapshotVersion: SnapshotVersion): DbTimestampKey {\n    const timestamp = snapshotVersion.toTimestamp();\n    return [timestamp.seconds, timestamp.nanoseconds];\n  }\n\n  fromDbTimestampKey(dbTimestampKey: DbTimestampKey): SnapshotVersion {\n    const timestamp = new Timestamp(dbTimestampKey[0], dbTimestampKey[1]);\n    return SnapshotVersion.fromTimestamp(timestamp);\n  }\n\n  private toDbTimestamp(snapshotVersion: SnapshotVersion): DbTimestamp {\n    const timestamp = snapshotVersion.toTimestamp();\n    return new DbTimestamp(timestamp.seconds, timestamp.nanoseconds);\n  }\n\n  private fromDbTimestamp(dbTimestamp: DbTimestamp): SnapshotVersion {\n    const timestamp = new Timestamp(\n      dbTimestamp.seconds,\n      dbTimestamp.nanoseconds\n    );\n    return SnapshotVersion.fromTimestamp(timestamp);\n  }\n\n  /** Encodes a batch of mutations into a DbMutationBatch for local storage. */\n  toDbMutationBatch(userId: string, batch: MutationBatch): DbMutationBatch {\n    const serializedBaseMutations = batch.baseMutations.map(m =>\n      this.remoteSerializer.toMutation(m)\n    );\n    const serializedMutations = batch.mutations.map(m =>\n      this.remoteSerializer.toMutation(m)\n    );\n    return new DbMutationBatch(\n      userId,\n      batch.batchId,\n      batch.localWriteTime.toMillis(),\n      serializedBaseMutations,\n      serializedMutations\n    );\n  }\n\n  /** Decodes a DbMutationBatch into a MutationBatch */\n  fromDbMutationBatch(dbBatch: DbMutationBatch): MutationBatch {\n    const baseMutations = (dbBatch.baseMutations || []).map(m =>\n      this.remoteSerializer.fromMutation(m)\n    );\n    const mutations = dbBatch.mutations.map(m =>\n      this.remoteSerializer.fromMutation(m)\n    );\n    const timestamp = Timestamp.fromMillis(dbBatch.localWriteTimeMs);\n    return new MutationBatch(\n      dbBatch.batchId,\n      timestamp,\n      baseMutations,\n      mutations\n    );\n  }\n\n  /** Decodes a DbTarget into TargetData */\n  fromDbTarget(dbTarget: DbTarget): TargetData {\n    const version = this.fromDbTimestamp(dbTarget.readTime);\n    const lastLimboFreeSnapshotVersion =\n      dbTarget.lastLimboFreeSnapshotVersion !== undefined\n        ? this.fromDbTimestamp(dbTarget.lastLimboFreeSnapshotVersion)\n        : SnapshotVersion.min();\n\n    let target: Target;\n    if (isDocumentQuery(dbTarget.query)) {\n      target = this.remoteSerializer.fromDocumentsTarget(dbTarget.query);\n    } else {\n      target = this.remoteSerializer.fromQueryTarget(dbTarget.query);\n    }\n    return new TargetData(\n      target,\n      dbTarget.targetId,\n      TargetPurpose.Listen,\n      dbTarget.lastListenSequenceNumber,\n      version,\n      lastLimboFreeSnapshotVersion,\n      ByteString.fromBase64String(dbTarget.resumeToken)\n    );\n  }\n\n  /** Encodes TargetData into a DbTarget for storage locally. */\n  toDbTarget(targetData: TargetData): DbTarget {\n    debugAssert(\n      TargetPurpose.Listen === targetData.purpose,\n      'Only queries with purpose ' +\n        TargetPurpose.Listen +\n        ' may be stored, got ' +\n        targetData.purpose\n    );\n    const dbTimestamp = this.toDbTimestamp(targetData.snapshotVersion);\n    const dbLastLimboFreeTimestamp = this.toDbTimestamp(\n      targetData.lastLimboFreeSnapshotVersion\n    );\n    let queryProto: DbQuery;\n    if (targetData.target.isDocumentQuery()) {\n      queryProto = this.remoteSerializer.toDocumentsTarget(targetData.target);\n    } else {\n      queryProto = this.remoteSerializer.toQueryTarget(targetData.target);\n    }\n\n    // We can't store the resumeToken as a ByteString in IndexedDb, so we\n    // convert it to a base64 string for storage.\n    const resumeToken = targetData.resumeToken.toBase64();\n\n    // lastListenSequenceNumber is always 0 until we do real GC.\n    return new DbTarget(\n      targetData.targetId,\n      targetData.target.canonicalId(),\n      dbTimestamp,\n      resumeToken,\n      targetData.sequenceNumber,\n      dbLastLimboFreeTimestamp,\n      queryProto\n    );\n  }\n}\n\n/**\n * A helper function for figuring out what kind of query has been stored.\n */\nfunction isDocumentQuery(dbQuery: DbQuery): dbQuery is api.DocumentsTarget {\n  return (dbQuery as api.DocumentsTarget).documents !== undefined;\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 { User } from '../auth/user';\nimport { DatabaseInfo } from '../core/database_info';\nimport { ListenSequence, SequenceNumberSyncer } from '../core/listen_sequence';\nimport { ListenSequenceNumber, TargetId } from '../core/types';\nimport { DocumentKey } from '../model/document_key';\nimport { Platform } from '../platform/platform';\nimport { JsonProtoSerializer } from '../remote/serializer';\nimport { debugAssert, fail } from '../util/assert';\nimport { AsyncQueue, DelayedOperation, TimerId } from '../util/async_queue';\nimport { Code, FirestoreError } from '../util/error';\nimport { logDebug, logError } from '../util/log';\nimport {\n  decodeResourcePath,\n  EncodedResourcePath,\n  encodeResourcePath\n} from './encoded_resource_path';\nimport { IndexedDbIndexManager } from './indexeddb_index_manager';\nimport {\n  IndexedDbMutationQueue,\n  mutationQueuesContainKey\n} from './indexeddb_mutation_queue';\nimport { IndexedDbRemoteDocumentCache } from './indexeddb_remote_document_cache';\nimport {\n  ALL_STORES,\n  DbClientMetadata,\n  DbClientMetadataKey,\n  DbPrimaryClient,\n  DbPrimaryClientKey,\n  DbTargetDocument,\n  SCHEMA_VERSION,\n  SchemaConverter\n} from './indexeddb_schema';\nimport {\n  documentTargetStore,\n  IndexedDbTargetCache\n} from './indexeddb_target_cache';\nimport { LocalSerializer } from './local_serializer';\nimport {\n  ActiveTargets,\n  LruDelegate,\n  LruGarbageCollector,\n  LruParams\n} from './lru_garbage_collector';\nimport {\n  Persistence,\n  PersistenceTransaction,\n  PersistenceTransactionMode,\n  PRIMARY_LEASE_LOST_ERROR_MSG,\n  PrimaryStateListener,\n  ReferenceDelegate\n} from './persistence';\nimport { PersistencePromise } from './persistence_promise';\nimport { ClientId } from './shared_client_state';\nimport { TargetData } from './target_data';\nimport {\n  isIndexedDbTransactionError,\n  SimpleDb,\n  SimpleDbStore,\n  SimpleDbTransaction\n} from './simple_db';\n\nconst LOG_TAG = 'IndexedDbPersistence';\n\n/**\n * Oldest acceptable age in milliseconds for client metadata before the client\n * is considered inactive and its associated data is garbage collected.\n */\nconst MAX_CLIENT_AGE_MS = 30 * 60 * 1000; // 30 minutes\n\n/**\n * Oldest acceptable metadata age for clients that may participate in the\n * primary lease election. Clients that have not updated their client metadata\n * within 5 seconds are not eligible to receive a primary lease.\n */\nconst MAX_PRIMARY_ELIGIBLE_AGE_MS = 5000;\n\n/**\n * The interval at which clients will update their metadata, including\n * refreshing their primary lease if held or potentially trying to acquire it if\n * not held.\n *\n * Primary clients may opportunistically refresh their metadata earlier\n * if they're already performing an IndexedDB operation.\n */\nconst CLIENT_METADATA_REFRESH_INTERVAL_MS = 4000;\n/** User-facing error when the primary lease is required but not available. */\nconst PRIMARY_LEASE_EXCLUSIVE_ERROR_MSG =\n  'Failed to obtain exclusive access to the persistence layer. ' +\n  'To allow shared access, make sure to invoke ' +\n  '`enablePersistence()` with `synchronizeTabs:true` in all tabs.';\nconst UNSUPPORTED_PLATFORM_ERROR_MSG =\n  'This platform is either missing' +\n  ' IndexedDB or is known to have an incomplete implementation. Offline' +\n  ' persistence has been disabled.';\n\n// The format of the LocalStorage key that stores zombied client is:\n//     firestore_zombie_<persistence_prefix>_<instance_key>\nconst ZOMBIED_CLIENTS_KEY_PREFIX = 'firestore_zombie';\n\nexport class IndexedDbTransaction extends PersistenceTransaction {\n  constructor(\n    readonly simpleDbTransaction: SimpleDbTransaction,\n    readonly currentSequenceNumber: ListenSequenceNumber\n  ) {\n    super();\n  }\n}\n\n/**\n * An IndexedDB-backed instance of Persistence. Data is stored persistently\n * across sessions.\n *\n * On Web only, the Firestore SDKs support shared access to its persistence\n * layer. This allows multiple browser tabs to read and write to IndexedDb and\n * to synchronize state even without network connectivity. Shared access is\n * currently optional and not enabled unless all clients invoke\n * `enablePersistence()` with `{synchronizeTabs:true}`.\n *\n * In multi-tab mode, if multiple clients are active at the same time, the SDK\n * will designate one client as the “primary client”. An effort is made to pick\n * a visible, network-connected and active client, and this client is\n * responsible for letting other clients know about its presence. The primary\n * client writes a unique client-generated identifier (the client ID) to\n * IndexedDb’s “owner” store every 4 seconds. If the primary client fails to\n * update this entry, another client can acquire the lease and take over as\n * primary.\n *\n * Some persistence operations in the SDK are designated as primary-client only\n * operations. This includes the acknowledgment of mutations and all updates of\n * remote documents. The effects of these operations are written to persistence\n * and then broadcast to other tabs via LocalStorage (see\n * `WebStorageSharedClientState`), which then refresh their state from\n * persistence.\n *\n * Similarly, the primary client listens to notifications sent by secondary\n * clients to discover persistence changes written by secondary clients, such as\n * the addition of new mutations and query targets.\n *\n * If multi-tab is not enabled and another tab already obtained the primary\n * lease, IndexedDbPersistence enters a failed state and all subsequent\n * operations will automatically fail.\n *\n * Additionally, there is an optimization so that when a tab is closed, the\n * primary lease is released immediately (this is especially important to make\n * sure that a refreshed tab is able to immediately re-acquire the primary\n * lease). Unfortunately, IndexedDB cannot be reliably used in window.unload\n * since it is an asynchronous API. So in addition to attempting to give up the\n * lease, the leaseholder writes its client ID to a \"zombiedClient\" entry in\n * LocalStorage which acts as an indicator that another tab should go ahead and\n * take the primary lease immediately regardless of the current lease timestamp.\n *\n * TODO(b/114226234): Remove `synchronizeTabs` section when multi-tab is no\n * longer optional.\n */\nexport class IndexedDbPersistence implements Persistence {\n  static getStore<Key extends IDBValidKey, Value>(\n    txn: PersistenceTransaction,\n    store: string\n  ): SimpleDbStore<Key, Value> {\n    if (txn instanceof IndexedDbTransaction) {\n      return SimpleDb.getStore<Key, Value>(txn.simpleDbTransaction, store);\n    } else {\n      throw fail(\n        'IndexedDbPersistence must use instances of IndexedDbTransaction'\n      );\n    }\n  }\n\n  /**\n   * The name of the main (and currently only) IndexedDB database. this name is\n   * appended to the prefix provided to the IndexedDbPersistence constructor.\n   */\n  static MAIN_DATABASE = 'main';\n\n  private readonly document: Document | null;\n  private readonly window: Window;\n\n  // Technically `simpleDb` should be `| undefined` because it is\n  // initialized asynchronously by start(), but that would be more misleading\n  // than useful.\n  private simpleDb!: SimpleDb;\n\n  private listenSequence: ListenSequence | null = null;\n\n  private _started = false;\n  private isPrimary = false;\n  private networkEnabled = true;\n  private dbName: string;\n\n  /** Our window.unload handler, if registered. */\n  private windowUnloadHandler: (() => void) | null = null;\n  private inForeground = false;\n\n  private serializer: LocalSerializer;\n\n  /** Our 'visibilitychange' listener if registered. */\n  private documentVisibilityHandler: ((e?: Event) => void) | null = null;\n\n  /** The client metadata refresh task. */\n  private clientMetadataRefresher: DelayedOperation<void> | null = null;\n\n  /** The last time we garbage collected the client metadata object store. */\n  private lastGarbageCollectionTime = Number.NEGATIVE_INFINITY;\n\n  /** A listener to notify on primary state changes. */\n  private primaryStateListener: PrimaryStateListener = _ => Promise.resolve();\n\n  private readonly targetCache: IndexedDbTargetCache;\n  private readonly indexManager: IndexedDbIndexManager;\n  private readonly remoteDocumentCache: IndexedDbRemoteDocumentCache;\n  private readonly webStorage: Storage;\n  readonly referenceDelegate: IndexedDbLruDelegate;\n\n  constructor(\n    private readonly allowTabSynchronization: boolean,\n    private readonly persistenceKey: string,\n    private readonly clientId: ClientId,\n    platform: Platform,\n    lruParams: LruParams,\n    private readonly queue: AsyncQueue,\n    serializer: JsonProtoSerializer,\n    private readonly sequenceNumberSyncer: SequenceNumberSyncer\n  ) {\n    if (!IndexedDbPersistence.isAvailable()) {\n      throw new FirestoreError(\n        Code.UNIMPLEMENTED,\n        UNSUPPORTED_PLATFORM_ERROR_MSG\n      );\n    }\n\n    this.referenceDelegate = new IndexedDbLruDelegate(this, lruParams);\n    this.dbName = persistenceKey + IndexedDbPersistence.MAIN_DATABASE;\n    this.serializer = new LocalSerializer(serializer);\n    this.document = platform.document;\n    this.targetCache = new IndexedDbTargetCache(\n      this.referenceDelegate,\n      this.serializer\n    );\n    this.indexManager = new IndexedDbIndexManager();\n    this.remoteDocumentCache = new IndexedDbRemoteDocumentCache(\n      this.serializer,\n      this.indexManager\n    );\n    if (platform.window && platform.window.localStorage) {\n      this.window = platform.window;\n      this.webStorage = this.window.localStorage;\n    } else {\n      throw new FirestoreError(\n        Code.UNIMPLEMENTED,\n        'IndexedDB persistence is only available on platforms that support LocalStorage.'\n      );\n    }\n  }\n\n  /**\n   * Attempt to start IndexedDb persistence.\n   *\n   * @return {Promise<void>} Whether persistence was enabled.\n   */\n  start(): Promise<void> {\n    debugAssert(!this.started, 'IndexedDbPersistence double-started!');\n    debugAssert(this.window !== null, \"Expected 'window' to be defined\");\n\n    return SimpleDb.openOrCreate(\n      this.dbName,\n      SCHEMA_VERSION,\n      new SchemaConverter(this.serializer)\n    )\n      .then(db => {\n        this.simpleDb = db;\n        // NOTE: This is expected to fail sometimes (in the case of another tab already\n        // having the persistence lock), so it's the first thing we should do.\n        return this.updateClientMetadataAndTryBecomePrimary();\n      })\n      .then(() => {\n        if (!this.isPrimary && !this.allowTabSynchronization) {\n          // Fail `start()` if `synchronizeTabs` is disabled and we cannot\n          // obtain the primary lease.\n          throw new FirestoreError(\n            Code.FAILED_PRECONDITION,\n            PRIMARY_LEASE_EXCLUSIVE_ERROR_MSG\n          );\n        }\n        this.attachVisibilityHandler();\n        this.attachWindowUnloadHook();\n\n        this.scheduleClientMetadataAndPrimaryLeaseRefreshes();\n\n        return this.runTransaction(\n          'getHighestListenSequenceNumber',\n          'readonly',\n          txn => this.targetCache.getHighestSequenceNumber(txn)\n        );\n      })\n      .then(highestListenSequenceNumber => {\n        this.listenSequence = new ListenSequence(\n          highestListenSequenceNumber,\n          this.sequenceNumberSyncer\n        );\n      })\n      .then(() => {\n        this._started = true;\n      })\n      .catch(reason => {\n        this.simpleDb && this.simpleDb.close();\n        return Promise.reject(reason);\n      });\n  }\n\n  /**\n   * Registers a listener that gets called when the primary state of the\n   * instance changes. Upon registering, this listener is invoked immediately\n   * with the current primary state.\n   *\n   * PORTING NOTE: This is only used for Web multi-tab.\n   */\n  setPrimaryStateListener(\n    primaryStateListener: PrimaryStateListener\n  ): Promise<void> {\n    this.primaryStateListener = async primaryState => {\n      if (this.started) {\n        return primaryStateListener(primaryState);\n      }\n    };\n    return primaryStateListener(this.isPrimary);\n  }\n\n  /**\n   * Registers a listener that gets called when the database receives a\n   * version change event indicating that it has deleted.\n   *\n   * PORTING NOTE: This is only used for Web multi-tab.\n   */\n  setDatabaseDeletedListener(\n    databaseDeletedListener: () => Promise<void>\n  ): void {\n    this.simpleDb.setVersionChangeListener(async event => {\n      // Check if an attempt is made to delete IndexedDB.\n      if (event.newVersion === null) {\n        await databaseDeletedListener();\n      }\n    });\n  }\n\n  /**\n   * Adjusts the current network state in the client's metadata, potentially\n   * affecting the primary lease.\n   *\n   * PORTING NOTE: This is only used for Web multi-tab.\n   */\n  setNetworkEnabled(networkEnabled: boolean): void {\n    if (this.networkEnabled !== networkEnabled) {\n      this.networkEnabled = networkEnabled;\n      // Schedule a primary lease refresh for immediate execution. The eventual\n      // lease update will be propagated via `primaryStateListener`.\n      this.queue.enqueueAndForget(async () => {\n        if (this.started) {\n          await this.updateClientMetadataAndTryBecomePrimary();\n        }\n      });\n    }\n  }\n\n  /**\n   * Updates the client metadata in IndexedDb and attempts to either obtain or\n   * extend the primary lease for the local client. Asynchronously notifies the\n   * primary state listener if the client either newly obtained or released its\n   * primary lease.\n   */\n  private updateClientMetadataAndTryBecomePrimary(): Promise<void> {\n    return this.runTransaction(\n      'updateClientMetadataAndTryBecomePrimary',\n      'readwrite',\n      txn => {\n        const metadataStore = clientMetadataStore(txn);\n        return metadataStore\n          .put(\n            new DbClientMetadata(\n              this.clientId,\n              Date.now(),\n              this.networkEnabled,\n              this.inForeground\n            )\n          )\n          .next(() => {\n            if (this.isPrimary) {\n              return this.verifyPrimaryLease(txn).next(success => {\n                if (!success) {\n                  this.isPrimary = false;\n                  this.queue.enqueueAndForget(() =>\n                    this.primaryStateListener(false)\n                  );\n                }\n              });\n            }\n          })\n          .next(() => this.canActAsPrimary(txn))\n          .next(canActAsPrimary => {\n            if (this.isPrimary && !canActAsPrimary) {\n              return this.releasePrimaryLeaseIfHeld(txn).next(() => false);\n            } else if (canActAsPrimary) {\n              return this.acquireOrExtendPrimaryLease(txn).next(() => true);\n            } else {\n              return /* canActAsPrimary= */ false;\n            }\n          });\n      }\n    )\n      .catch(e => {\n        if (!this.allowTabSynchronization) {\n          if (isIndexedDbTransactionError(e)) {\n            logDebug(LOG_TAG, 'Failed to extend owner lease: ', e);\n            // Proceed with the existing state. Any subsequent access to\n            // IndexedDB will verify the lease.\n            return this.isPrimary;\n          } else {\n            throw e;\n          }\n        }\n\n        logDebug(\n          LOG_TAG,\n          'Releasing owner lease after error during lease refresh',\n          e\n        );\n        return /* isPrimary= */ false;\n      })\n      .then(isPrimary => {\n        if (this.isPrimary !== isPrimary) {\n          this.queue.enqueueAndForget(() =>\n            this.primaryStateListener(isPrimary)\n          );\n        }\n        this.isPrimary = isPrimary;\n      });\n  }\n\n  private verifyPrimaryLease(\n    txn: PersistenceTransaction\n  ): PersistencePromise<boolean> {\n    const store = primaryClientStore(txn);\n    return store.get(DbPrimaryClient.key).next(primaryClient => {\n      return PersistencePromise.resolve(this.isLocalClient(primaryClient));\n    });\n  }\n\n  private removeClientMetadata(\n    txn: PersistenceTransaction\n  ): PersistencePromise<void> {\n    const metadataStore = clientMetadataStore(txn);\n    return metadataStore.delete(this.clientId);\n  }\n\n  /**\n   * If the garbage collection threshold has passed, prunes the\n   * RemoteDocumentChanges and the ClientMetadata store based on the last update\n   * time of all clients.\n   */\n  private async maybeGarbageCollectMultiClientState(): Promise<void> {\n    if (\n      this.isPrimary &&\n      !this.isWithinAge(this.lastGarbageCollectionTime, MAX_CLIENT_AGE_MS)\n    ) {\n      this.lastGarbageCollectionTime = Date.now();\n\n      const inactiveClients = await this.runTransaction(\n        'maybeGarbageCollectMultiClientState',\n        'readwrite-primary',\n        txn => {\n          const metadataStore = IndexedDbPersistence.getStore<\n            DbClientMetadataKey,\n            DbClientMetadata\n          >(txn, DbClientMetadata.store);\n\n          return metadataStore.loadAll().next(existingClients => {\n            const active = this.filterActiveClients(\n              existingClients,\n              MAX_CLIENT_AGE_MS\n            );\n            const inactive = existingClients.filter(\n              client => active.indexOf(client) === -1\n            );\n\n            // Delete metadata for clients that are no longer considered active.\n            return PersistencePromise.forEach(\n              inactive,\n              (inactiveClient: DbClientMetadata) =>\n                metadataStore.delete(inactiveClient.clientId)\n            ).next(() => inactive);\n          });\n        }\n      ).catch(() => {\n        // Ignore primary lease violations or any other type of error. The next\n        // primary will run `maybeGarbageCollectMultiClientState()` again.\n        // We don't use `ignoreIfPrimaryLeaseLoss()` since we don't want to depend\n        // on LocalStore.\n        return [];\n      });\n\n      // Delete potential leftover entries that may continue to mark the\n      // inactive clients as zombied in LocalStorage.\n      // Ideally we'd delete the IndexedDb and LocalStorage zombie entries for\n      // the client atomically, but we can't. So we opt to delete the IndexedDb\n      // entries first to avoid potentially reviving a zombied client.\n      inactiveClients.forEach(inactiveClient => {\n        this.window.localStorage.removeItem(\n          this.zombiedClientLocalStorageKey(inactiveClient.clientId)\n        );\n      });\n    }\n  }\n\n  /**\n   * Schedules a recurring timer to update the client metadata and to either\n   * extend or acquire the primary lease if the client is eligible.\n   */\n  private scheduleClientMetadataAndPrimaryLeaseRefreshes(): void {\n    this.clientMetadataRefresher = this.queue.enqueueAfterDelay(\n      TimerId.ClientMetadataRefresh,\n      CLIENT_METADATA_REFRESH_INTERVAL_MS,\n      () => {\n        return this.updateClientMetadataAndTryBecomePrimary()\n          .then(() => this.maybeGarbageCollectMultiClientState())\n          .then(() => this.scheduleClientMetadataAndPrimaryLeaseRefreshes());\n      }\n    );\n  }\n\n  /** Checks whether `client` is the local client. */\n  private isLocalClient(client: DbPrimaryClient | null): boolean {\n    return client ? client.ownerId === this.clientId : false;\n  }\n\n  /**\n   * Evaluate the state of all active clients and determine whether the local\n   * client is or can act as the holder of the primary lease. Returns whether\n   * the client is eligible for the lease, but does not actually acquire it.\n   * May return 'false' even if there is no active leaseholder and another\n   * (foreground) client should become leaseholder instead.\n   */\n  private canActAsPrimary(\n    txn: PersistenceTransaction\n  ): PersistencePromise<boolean> {\n    const store = primaryClientStore(txn);\n    return store\n      .get(DbPrimaryClient.key)\n      .next(currentPrimary => {\n        const currentLeaseIsValid =\n          currentPrimary !== null &&\n          this.isWithinAge(\n            currentPrimary.leaseTimestampMs,\n            MAX_PRIMARY_ELIGIBLE_AGE_MS\n          ) &&\n          !this.isClientZombied(currentPrimary.ownerId);\n\n        // A client is eligible for the primary lease if:\n        // - its network is enabled and the client's tab is in the foreground.\n        // - its network is enabled and no other client's tab is in the\n        //   foreground.\n        // - every clients network is disabled and the client's tab is in the\n        //   foreground.\n        // - every clients network is disabled and no other client's tab is in\n        //   the foreground.\n        if (currentLeaseIsValid) {\n          if (this.isLocalClient(currentPrimary) && this.networkEnabled) {\n            return true;\n          }\n\n          if (!this.isLocalClient(currentPrimary)) {\n            if (!currentPrimary!.allowTabSynchronization) {\n              // Fail the `canActAsPrimary` check if the current leaseholder has\n              // not opted into multi-tab synchronization. If this happens at\n              // client startup, we reject the Promise returned by\n              // `enablePersistence()` and the user can continue to use Firestore\n              // with in-memory persistence.\n              // If this fails during a lease refresh, we will instead block the\n              // AsyncQueue from executing further operations. Note that this is\n              // acceptable since mixing & matching different `synchronizeTabs`\n              // settings is not supported.\n              //\n              // TODO(b/114226234): Remove this check when `synchronizeTabs` can\n              // no longer be turned off.\n              throw new FirestoreError(\n                Code.FAILED_PRECONDITION,\n                PRIMARY_LEASE_EXCLUSIVE_ERROR_MSG\n              );\n            }\n\n            return false;\n          }\n        }\n\n        if (this.networkEnabled && this.inForeground) {\n          return true;\n        }\n\n        return clientMetadataStore(txn)\n          .loadAll()\n          .next(existingClients => {\n            // Process all existing clients and determine whether at least one of\n            // them is better suited to obtain the primary lease.\n            const preferredCandidate = this.filterActiveClients(\n              existingClients,\n              MAX_PRIMARY_ELIGIBLE_AGE_MS\n            ).find(otherClient => {\n              if (this.clientId !== otherClient.clientId) {\n                const otherClientHasBetterNetworkState =\n                  !this.networkEnabled && otherClient.networkEnabled;\n                const otherClientHasBetterVisibility =\n                  !this.inForeground && otherClient.inForeground;\n                const otherClientHasSameNetworkState =\n                  this.networkEnabled === otherClient.networkEnabled;\n                if (\n                  otherClientHasBetterNetworkState ||\n                  (otherClientHasBetterVisibility &&\n                    otherClientHasSameNetworkState)\n                ) {\n                  return true;\n                }\n              }\n              return false;\n            });\n            return preferredCandidate === undefined;\n          });\n      })\n      .next(canActAsPrimary => {\n        if (this.isPrimary !== canActAsPrimary) {\n          logDebug(\n            LOG_TAG,\n            `Client ${\n              canActAsPrimary ? 'is' : 'is not'\n            } eligible for a primary lease.`\n          );\n        }\n        return canActAsPrimary;\n      });\n  }\n\n  async shutdown(): Promise<void> {\n    // The shutdown() operations are idempotent and can be called even when\n    // start() aborted (e.g. because it couldn't acquire the persistence lease).\n    this._started = false;\n\n    this.markClientZombied();\n    if (this.clientMetadataRefresher) {\n      this.clientMetadataRefresher.cancel();\n      this.clientMetadataRefresher = null;\n    }\n    this.detachVisibilityHandler();\n    this.detachWindowUnloadHook();\n    await this.runTransaction('shutdown', 'readwrite', txn => {\n      return this.releasePrimaryLeaseIfHeld(txn).next(() =>\n        this.removeClientMetadata(txn)\n      );\n    }).catch(e => {\n      logDebug(LOG_TAG, 'Proceeding with shutdown despite failure: ', e);\n    });\n    this.simpleDb.close();\n\n    // Remove the entry marking the client as zombied from LocalStorage since\n    // we successfully deleted its metadata from IndexedDb.\n    this.removeClientZombiedEntry();\n  }\n\n  /**\n   * Returns clients that are not zombied and have an updateTime within the\n   * provided threshold.\n   */\n  private filterActiveClients(\n    clients: DbClientMetadata[],\n    activityThresholdMs: number\n  ): DbClientMetadata[] {\n    return clients.filter(\n      client =>\n        this.isWithinAge(client.updateTimeMs, activityThresholdMs) &&\n        !this.isClientZombied(client.clientId)\n    );\n  }\n\n  /**\n   * Returns the IDs of the clients that are currently active. If multi-tab\n   * is not supported, returns an array that only contains the local client's\n   * ID.\n   *\n   * PORTING NOTE: This is only used for Web multi-tab.\n   */\n  getActiveClients(): Promise<ClientId[]> {\n    return this.runTransaction('getActiveClients', 'readonly', txn => {\n      return clientMetadataStore(txn)\n        .loadAll()\n        .next(clients =>\n          this.filterActiveClients(clients, MAX_CLIENT_AGE_MS).map(\n            clientMetadata => clientMetadata.clientId\n          )\n        );\n    });\n  }\n\n  static async clearPersistence(persistenceKey: string): Promise<void> {\n    if (!IndexedDbPersistence.isAvailable()) {\n      return Promise.resolve();\n    }\n    const dbName = persistenceKey + IndexedDbPersistence.MAIN_DATABASE;\n    await SimpleDb.delete(dbName);\n  }\n\n  get started(): boolean {\n    return this._started;\n  }\n\n  getMutationQueue(user: User): IndexedDbMutationQueue {\n    debugAssert(\n      this.started,\n      'Cannot initialize MutationQueue before persistence is started.'\n    );\n    return IndexedDbMutationQueue.forUser(\n      user,\n      this.serializer,\n      this.indexManager,\n      this.referenceDelegate\n    );\n  }\n\n  getTargetCache(): IndexedDbTargetCache {\n    debugAssert(\n      this.started,\n      'Cannot initialize TargetCache before persistence is started.'\n    );\n    return this.targetCache;\n  }\n\n  getRemoteDocumentCache(): IndexedDbRemoteDocumentCache {\n    debugAssert(\n      this.started,\n      'Cannot initialize RemoteDocumentCache before persistence is started.'\n    );\n    return this.remoteDocumentCache;\n  }\n\n  getIndexManager(): IndexedDbIndexManager {\n    debugAssert(\n      this.started,\n      'Cannot initialize IndexManager before persistence is started.'\n    );\n    return this.indexManager;\n  }\n\n  runTransaction<T>(\n    action: string,\n    mode: PersistenceTransactionMode,\n    transactionOperation: (\n      transaction: PersistenceTransaction\n    ) => PersistencePromise<T>\n  ): Promise<T> {\n    logDebug(LOG_TAG, 'Starting transaction:', action);\n\n    const simpleDbMode = mode === 'readonly' ? 'readonly' : 'readwrite';\n\n    let persistenceTransaction: PersistenceTransaction;\n\n    // Do all transactions as readwrite against all object stores, since we\n    // are the only reader/writer.\n    return this.simpleDb\n      .runTransaction(simpleDbMode, ALL_STORES, simpleDbTxn => {\n        persistenceTransaction = new IndexedDbTransaction(\n          simpleDbTxn,\n          this.listenSequence\n            ? this.listenSequence.next()\n            : ListenSequence.INVALID\n        );\n\n        if (mode === 'readwrite-primary') {\n          // While we merely verify that we have (or can acquire) the lease\n          // immediately, we wait to extend the primary lease until after\n          // executing transactionOperation(). This ensures that even if the\n          // transactionOperation takes a long time, we'll use a recent\n          // leaseTimestampMs in the extended (or newly acquired) lease.\n          return this.verifyPrimaryLease(persistenceTransaction)\n            .next(holdsPrimaryLease => {\n              if (holdsPrimaryLease) {\n                return /* holdsPrimaryLease= */ true;\n              }\n              return this.canActAsPrimary(persistenceTransaction);\n            })\n            .next(holdsPrimaryLease => {\n              if (!holdsPrimaryLease) {\n                logError(\n                  `Failed to obtain primary lease for action '${action}'.`\n                );\n                this.isPrimary = false;\n                this.queue.enqueueAndForget(() =>\n                  this.primaryStateListener(false)\n                );\n                throw new FirestoreError(\n                  Code.FAILED_PRECONDITION,\n                  PRIMARY_LEASE_LOST_ERROR_MSG\n                );\n              }\n              return transactionOperation(persistenceTransaction);\n            })\n            .next(result => {\n              return this.acquireOrExtendPrimaryLease(\n                persistenceTransaction\n              ).next(() => result);\n            });\n        } else {\n          return this.verifyAllowTabSynchronization(\n            persistenceTransaction\n          ).next(() => transactionOperation(persistenceTransaction));\n        }\n      })\n      .then(result => {\n        persistenceTransaction.raiseOnCommittedEvent();\n        return result;\n      });\n  }\n\n  /**\n   * Verifies that the current tab is the primary leaseholder or alternatively\n   * that the leaseholder has opted into multi-tab synchronization.\n   */\n  // TODO(b/114226234): Remove this check when `synchronizeTabs` can no longer\n  // be turned off.\n  private verifyAllowTabSynchronization(\n    txn: PersistenceTransaction\n  ): PersistencePromise<void> {\n    const store = primaryClientStore(txn);\n    return store.get(DbPrimaryClient.key).next(currentPrimary => {\n      const currentLeaseIsValid =\n        currentPrimary !== null &&\n        this.isWithinAge(\n          currentPrimary.leaseTimestampMs,\n          MAX_PRIMARY_ELIGIBLE_AGE_MS\n        ) &&\n        !this.isClientZombied(currentPrimary.ownerId);\n\n      if (currentLeaseIsValid && !this.isLocalClient(currentPrimary)) {\n        if (\n          !this.allowTabSynchronization ||\n          !currentPrimary!.allowTabSynchronization\n        ) {\n          throw new FirestoreError(\n            Code.FAILED_PRECONDITION,\n            PRIMARY_LEASE_EXCLUSIVE_ERROR_MSG\n          );\n        }\n      }\n    });\n  }\n\n  /**\n   * Obtains or extends the new primary lease for the local client. This\n   * method does not verify that the client is eligible for this lease.\n   */\n  private acquireOrExtendPrimaryLease(\n    txn: PersistenceTransaction\n  ): PersistencePromise<void> {\n    const newPrimary = new DbPrimaryClient(\n      this.clientId,\n      this.allowTabSynchronization,\n      Date.now()\n    );\n    return primaryClientStore(txn).put(DbPrimaryClient.key, newPrimary);\n  }\n\n  static isAvailable(): boolean {\n    return SimpleDb.isAvailable();\n  }\n\n  /**\n   * Generates a string used as a prefix when storing data in IndexedDB and\n   * LocalStorage.\n   */\n  static buildStoragePrefix(databaseInfo: DatabaseInfo): string {\n    // Use two different prefix formats:\n    //\n    //   * firestore / persistenceKey / projectID . databaseID / ...\n    //   * firestore / persistenceKey / projectID / ...\n    //\n    // projectIDs are DNS-compatible names and cannot contain dots\n    // so there's no danger of collisions.\n    let database = databaseInfo.databaseId.projectId;\n    if (!databaseInfo.databaseId.isDefaultDatabase) {\n      database += '.' + databaseInfo.databaseId.database;\n    }\n\n    return 'firestore/' + databaseInfo.persistenceKey + '/' + database + '/';\n  }\n\n  /** Checks the primary lease and removes it if we are the current primary. */\n  private releasePrimaryLeaseIfHeld(\n    txn: PersistenceTransaction\n  ): PersistencePromise<void> {\n    const store = primaryClientStore(txn);\n    return store.get(DbPrimaryClient.key).next(primaryClient => {\n      if (this.isLocalClient(primaryClient)) {\n        logDebug(LOG_TAG, 'Releasing primary lease.');\n        return store.delete(DbPrimaryClient.key);\n      } else {\n        return PersistencePromise.resolve();\n      }\n    });\n  }\n\n  /** Verifies that `updateTimeMs` is within `maxAgeMs`. */\n  private isWithinAge(updateTimeMs: number, maxAgeMs: number): boolean {\n    const now = Date.now();\n    const minAcceptable = now - maxAgeMs;\n    const maxAcceptable = now;\n    if (updateTimeMs < minAcceptable) {\n      return false;\n    } else if (updateTimeMs > maxAcceptable) {\n      logError(\n        `Detected an update time that is in the future: ${updateTimeMs} > ${maxAcceptable}`\n      );\n      return false;\n    }\n\n    return true;\n  }\n\n  private attachVisibilityHandler(): void {\n    if (\n      this.document !== null &&\n      typeof this.document.addEventListener === 'function'\n    ) {\n      this.documentVisibilityHandler = () => {\n        this.queue.enqueueAndForget(() => {\n          this.inForeground = this.document!.visibilityState === 'visible';\n          return this.updateClientMetadataAndTryBecomePrimary();\n        });\n      };\n\n      this.document.addEventListener(\n        'visibilitychange',\n        this.documentVisibilityHandler\n      );\n\n      this.inForeground = this.document.visibilityState === 'visible';\n    }\n  }\n\n  private detachVisibilityHandler(): void {\n    if (this.documentVisibilityHandler) {\n      debugAssert(\n        this.document !== null &&\n          typeof this.document.addEventListener === 'function',\n        \"Expected 'document.addEventListener' to be a function\"\n      );\n      this.document.removeEventListener(\n        'visibilitychange',\n        this.documentVisibilityHandler\n      );\n      this.documentVisibilityHandler = null;\n    }\n  }\n\n  /**\n   * Attaches a window.unload handler that will synchronously write our\n   * clientId to a \"zombie client id\" location in LocalStorage. This can be used\n   * by tabs trying to acquire the primary lease to determine that the lease\n   * is no longer valid even if the timestamp is recent. This is particularly\n   * important for the refresh case (so the tab correctly re-acquires the\n   * primary lease). LocalStorage is used for this rather than IndexedDb because\n   * it is a synchronous API and so can be used reliably from  an unload\n   * handler.\n   */\n  private attachWindowUnloadHook(): void {\n    if (typeof this.window.addEventListener === 'function') {\n      this.windowUnloadHandler = () => {\n        // Note: In theory, this should be scheduled on the AsyncQueue since it\n        // accesses internal state. We execute this code directly during shutdown\n        // to make sure it gets a chance to run.\n        this.markClientZombied();\n\n        this.queue.enqueueAndForget(() => {\n          // Attempt graceful shutdown (including releasing our primary lease),\n          // but there's no guarantee it will complete.\n          return this.shutdown();\n        });\n      };\n      this.window.addEventListener('unload', this.windowUnloadHandler);\n    }\n  }\n\n  private detachWindowUnloadHook(): void {\n    if (this.windowUnloadHandler) {\n      debugAssert(\n        typeof this.window.removeEventListener === 'function',\n        \"Expected 'window.removeEventListener' to be a function\"\n      );\n      this.window.removeEventListener('unload', this.windowUnloadHandler);\n      this.windowUnloadHandler = null;\n    }\n  }\n\n  /**\n   * Returns whether a client is \"zombied\" based on its LocalStorage entry.\n   * Clients become zombied when their tab closes without running all of the\n   * cleanup logic in `shutdown()`.\n   */\n  private isClientZombied(clientId: ClientId): boolean {\n    try {\n      const isZombied =\n        this.webStorage.getItem(this.zombiedClientLocalStorageKey(clientId)) !==\n        null;\n      logDebug(\n        LOG_TAG,\n        `Client '${clientId}' ${\n          isZombied ? 'is' : 'is not'\n        } zombied in LocalStorage`\n      );\n      return isZombied;\n    } catch (e) {\n      // Gracefully handle if LocalStorage isn't working.\n      logError(LOG_TAG, 'Failed to get zombied client id.', e);\n      return false;\n    }\n  }\n\n  /**\n   * Record client as zombied (a client that had its tab closed). Zombied\n   * clients are ignored during primary tab selection.\n   */\n  private markClientZombied(): void {\n    try {\n      this.webStorage.setItem(\n        this.zombiedClientLocalStorageKey(this.clientId),\n        String(Date.now())\n      );\n    } catch (e) {\n      // Gracefully handle if LocalStorage isn't available / working.\n      logError('Failed to set zombie client id.', e);\n    }\n  }\n\n  /** Removes the zombied client entry if it exists. */\n  private removeClientZombiedEntry(): void {\n    try {\n      this.webStorage.removeItem(\n        this.zombiedClientLocalStorageKey(this.clientId)\n      );\n    } catch (e) {\n      // Ignore\n    }\n  }\n\n  private zombiedClientLocalStorageKey(clientId: ClientId): string {\n    return `${ZOMBIED_CLIENTS_KEY_PREFIX}_${this.persistenceKey}_${clientId}`;\n  }\n}\n\n/**\n * Helper to get a typed SimpleDbStore for the primary client object store.\n */\nfunction primaryClientStore(\n  txn: PersistenceTransaction\n): SimpleDbStore<DbPrimaryClientKey, DbPrimaryClient> {\n  return IndexedDbPersistence.getStore<DbPrimaryClientKey, DbPrimaryClient>(\n    txn,\n    DbPrimaryClient.store\n  );\n}\n\n/**\n * Helper to get a typed SimpleDbStore for the client metadata object store.\n */\nfunction clientMetadataStore(\n  txn: PersistenceTransaction\n): SimpleDbStore<DbClientMetadataKey, DbClientMetadata> {\n  return IndexedDbPersistence.getStore<DbClientMetadataKey, DbClientMetadata>(\n    txn,\n    DbClientMetadata.store\n  );\n}\n\n/** Provides LRU functionality for IndexedDB persistence. */\nexport class IndexedDbLruDelegate implements ReferenceDelegate, LruDelegate {\n  readonly garbageCollector: LruGarbageCollector;\n\n  constructor(private readonly db: IndexedDbPersistence, params: LruParams) {\n    this.garbageCollector = new LruGarbageCollector(this, params);\n  }\n\n  getSequenceNumberCount(\n    txn: PersistenceTransaction\n  ): PersistencePromise<number> {\n    const docCountPromise = this.orphanedDocumentCount(txn);\n    const targetCountPromise = this.db.getTargetCache().getTargetCount(txn);\n    return targetCountPromise.next(targetCount =>\n      docCountPromise.next(docCount => targetCount + docCount)\n    );\n  }\n\n  private orphanedDocumentCount(\n    txn: PersistenceTransaction\n  ): PersistencePromise<number> {\n    let orphanedCount = 0;\n    return this.forEachOrphanedDocumentSequenceNumber(txn, _ => {\n      orphanedCount++;\n    }).next(() => orphanedCount);\n  }\n\n  forEachTarget(\n    txn: PersistenceTransaction,\n    f: (q: TargetData) => void\n  ): PersistencePromise<void> {\n    return this.db.getTargetCache().forEachTarget(txn, f);\n  }\n\n  forEachOrphanedDocumentSequenceNumber(\n    txn: PersistenceTransaction,\n    f: (sequenceNumber: ListenSequenceNumber) => void\n  ): PersistencePromise<void> {\n    return this.forEachOrphanedDocument(txn, (docKey, sequenceNumber) =>\n      f(sequenceNumber)\n    );\n  }\n\n  addReference(\n    txn: PersistenceTransaction,\n    targetId: TargetId,\n    key: DocumentKey\n  ): PersistencePromise<void> {\n    return writeSentinelKey(txn, key);\n  }\n\n  removeReference(\n    txn: PersistenceTransaction,\n    targetId: TargetId,\n    key: DocumentKey\n  ): PersistencePromise<void> {\n    return writeSentinelKey(txn, key);\n  }\n\n  removeTargets(\n    txn: PersistenceTransaction,\n    upperBound: ListenSequenceNumber,\n    activeTargetIds: ActiveTargets\n  ): PersistencePromise<number> {\n    return this.db\n      .getTargetCache()\n      .removeTargets(txn, upperBound, activeTargetIds);\n  }\n\n  markPotentiallyOrphaned(\n    txn: PersistenceTransaction,\n    key: DocumentKey\n  ): PersistencePromise<void> {\n    return writeSentinelKey(txn, key);\n  }\n\n  /**\n   * Returns true if anything would prevent this document from being garbage\n   * collected, given that the document in question is not present in any\n   * targets and has a sequence number less than or equal to the upper bound for\n   * the collection run.\n   */\n  private isPinned(\n    txn: PersistenceTransaction,\n    docKey: DocumentKey\n  ): PersistencePromise<boolean> {\n    return mutationQueuesContainKey(txn, docKey);\n  }\n\n  removeOrphanedDocuments(\n    txn: PersistenceTransaction,\n    upperBound: ListenSequenceNumber\n  ): PersistencePromise<number> {\n    const documentCache = this.db.getRemoteDocumentCache();\n    const changeBuffer = documentCache.newChangeBuffer();\n\n    const promises: Array<PersistencePromise<void>> = [];\n    let documentCount = 0;\n\n    const iteration = this.forEachOrphanedDocument(\n      txn,\n      (docKey, sequenceNumber) => {\n        if (sequenceNumber <= upperBound) {\n          const p = this.isPinned(txn, docKey).next(isPinned => {\n            if (!isPinned) {\n              documentCount++;\n              // Our size accounting requires us to read all documents before\n              // removing them.\n              return changeBuffer.getEntry(txn, docKey).next(() => {\n                changeBuffer.removeEntry(docKey);\n                return documentTargetStore(txn).delete(sentinelKey(docKey));\n              });\n            }\n          });\n          promises.push(p);\n        }\n      }\n    );\n\n    return iteration\n      .next(() => PersistencePromise.waitFor(promises))\n      .next(() => changeBuffer.apply(txn))\n      .next(() => documentCount);\n  }\n\n  removeTarget(\n    txn: PersistenceTransaction,\n    targetData: TargetData\n  ): PersistencePromise<void> {\n    const updated = targetData.withSequenceNumber(txn.currentSequenceNumber);\n    return this.db.getTargetCache().updateTargetData(txn, updated);\n  }\n\n  updateLimboDocument(\n    txn: PersistenceTransaction,\n    key: DocumentKey\n  ): PersistencePromise<void> {\n    return writeSentinelKey(txn, key);\n  }\n\n  /**\n   * Call provided function for each document in the cache that is 'orphaned'. Orphaned\n   * means not a part of any target, so the only entry in the target-document index for\n   * that document will be the sentinel row (targetId 0), which will also have the sequence\n   * number for the last time the document was accessed.\n   */\n  private forEachOrphanedDocument(\n    txn: PersistenceTransaction,\n    f: (docKey: DocumentKey, sequenceNumber: ListenSequenceNumber) => void\n  ): PersistencePromise<void> {\n    const store = documentTargetStore(txn);\n    let nextToReport: ListenSequenceNumber = ListenSequence.INVALID;\n    let nextPath: EncodedResourcePath;\n    return store\n      .iterate(\n        {\n          index: DbTargetDocument.documentTargetsIndex\n        },\n        ([targetId, docKey], { path, sequenceNumber }) => {\n          if (targetId === 0) {\n            // if nextToReport is valid, report it, this is a new key so the\n            // last one must not be a member of any targets.\n            if (nextToReport !== ListenSequence.INVALID) {\n              f(new DocumentKey(decodeResourcePath(nextPath)), nextToReport);\n            }\n            // set nextToReport to be this sequence number. It's the next one we\n            // might report, if we don't find any targets for this document.\n            // Note that the sequence number must be defined when the targetId\n            // is 0.\n            nextToReport = sequenceNumber!;\n            nextPath = path;\n          } else {\n            // set nextToReport to be invalid, we know we don't need to report\n            // this one since we found a target for it.\n            nextToReport = ListenSequence.INVALID;\n          }\n        }\n      )\n      .next(() => {\n        // Since we report sequence numbers after getting to the next key, we\n        // need to check if the last key we iterated over was an orphaned\n        // document and report it.\n        if (nextToReport !== ListenSequence.INVALID) {\n          f(new DocumentKey(decodeResourcePath(nextPath)), nextToReport);\n        }\n      });\n  }\n\n  getCacheSize(txn: PersistenceTransaction): PersistencePromise<number> {\n    return this.db.getRemoteDocumentCache().getSize(txn);\n  }\n}\n\nfunction sentinelKey(key: DocumentKey): [TargetId, EncodedResourcePath] {\n  return [0, encodeResourcePath(key.path)];\n}\n\n/**\n * @return A value suitable for writing a sentinel row in the target-document\n * store.\n */\nfunction sentinelRow(\n  key: DocumentKey,\n  sequenceNumber: ListenSequenceNumber\n): DbTargetDocument {\n  return new DbTargetDocument(0, encodeResourcePath(key.path), sequenceNumber);\n}\n\nfunction writeSentinelKey(\n  txn: PersistenceTransaction,\n  key: DocumentKey\n): PersistencePromise<void> {\n  return documentTargetStore(txn).put(\n    sentinelRow(key, txn.currentSequenceNumber)\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 { Timestamp } from '../api/timestamp';\nimport { User } from '../auth/user';\nimport { Query } from '../core/query';\nimport { BatchId } from '../core/types';\nimport { DocumentKeySet } from '../model/collections';\nimport { DocumentKey } from '../model/document_key';\nimport { Mutation } from '../model/mutation';\nimport { BATCHID_UNKNOWN, MutationBatch } from '../model/mutation_batch';\nimport { ResourcePath } from '../model/path';\nimport { debugAssert, fail, hardAssert } from '../util/assert';\nimport { primitiveComparator } from '../util/misc';\nimport { ByteString } from '../util/byte_string';\nimport { SortedMap } from '../util/sorted_map';\nimport { SortedSet } from '../util/sorted_set';\nimport { decodeResourcePath } from './encoded_resource_path';\nimport { IndexManager } from './index_manager';\nimport {\n  IndexedDbPersistence,\n  IndexedDbTransaction\n} from './indexeddb_persistence';\nimport {\n  DbDocumentMutation,\n  DbDocumentMutationKey,\n  DbMutationBatch,\n  DbMutationBatchKey,\n  DbMutationQueue,\n  DbMutationQueueKey\n} from './indexeddb_schema';\nimport { LocalSerializer } from './local_serializer';\nimport { MutationQueue } from './mutation_queue';\nimport { PersistenceTransaction, ReferenceDelegate } from './persistence';\nimport { PersistencePromise } from './persistence_promise';\nimport { SimpleDbStore, SimpleDbTransaction } from './simple_db';\n\n/** A mutation queue for a specific user, backed by IndexedDB. */\nexport class IndexedDbMutationQueue implements MutationQueue {\n  /**\n   * Caches the document keys for pending mutation batches. If the mutation\n   * has been removed from IndexedDb, the cached value may continue to\n   * be used to retrieve the batch's document keys. To remove a cached value\n   * locally, `removeCachedMutationKeys()` should be invoked either directly\n   * or through `removeMutationBatches()`.\n   *\n   * With multi-tab, when the primary client acknowledges or rejects a mutation,\n   * this cache is used by secondary clients to invalidate the local\n   * view of the documents that were previously affected by the mutation.\n   */\n  // PORTING NOTE: Multi-tab only.\n  private documentKeysByBatchId = {} as { [batchId: number]: DocumentKeySet };\n\n  constructor(\n    /**\n     * The normalized userId (e.g. null UID => \"\" userId) used to store /\n     * retrieve mutations.\n     */\n    private userId: string,\n    private readonly serializer: LocalSerializer,\n    private readonly indexManager: IndexManager,\n    private readonly referenceDelegate: ReferenceDelegate\n  ) {}\n\n  /**\n   * Creates a new mutation queue for the given user.\n   * @param user The user for which to create a mutation queue.\n   * @param serializer The serializer to use when persisting to IndexedDb.\n   */\n  static forUser(\n    user: User,\n    serializer: LocalSerializer,\n    indexManager: IndexManager,\n    referenceDelegate: ReferenceDelegate\n  ): IndexedDbMutationQueue {\n    // TODO(mcg): Figure out what constraints there are on userIDs\n    // In particular, are there any reserved characters? are empty ids allowed?\n    // For the moment store these together in the same mutations table assuming\n    // that empty userIDs aren't allowed.\n    hardAssert(user.uid !== '', 'UserID must not be an empty string.');\n    const userId = user.isAuthenticated() ? user.uid! : '';\n    return new IndexedDbMutationQueue(\n      userId,\n      serializer,\n      indexManager,\n      referenceDelegate\n    );\n  }\n\n  checkEmpty(transaction: PersistenceTransaction): PersistencePromise<boolean> {\n    let empty = true;\n    const range = IDBKeyRange.bound(\n      [this.userId, Number.NEGATIVE_INFINITY],\n      [this.userId, Number.POSITIVE_INFINITY]\n    );\n    return mutationsStore(transaction)\n      .iterate(\n        { index: DbMutationBatch.userMutationsIndex, range },\n        (key, value, control) => {\n          empty = false;\n          control.done();\n        }\n      )\n      .next(() => empty);\n  }\n\n  acknowledgeBatch(\n    transaction: PersistenceTransaction,\n    batch: MutationBatch,\n    streamToken: ByteString\n  ): PersistencePromise<void> {\n    return this.getMutationQueueMetadata(transaction).next(metadata => {\n      // We can't store the resumeToken as a ByteString in IndexedDB, so we\n      // convert it to a Base64 string for storage.\n      metadata.lastStreamToken = streamToken.toBase64();\n\n      return mutationQueuesStore(transaction).put(metadata);\n    });\n  }\n\n  getLastStreamToken(\n    transaction: PersistenceTransaction\n  ): PersistencePromise<ByteString> {\n    return this.getMutationQueueMetadata(transaction).next<ByteString>(\n      metadata => ByteString.fromBase64String(metadata.lastStreamToken)\n    );\n  }\n\n  setLastStreamToken(\n    transaction: PersistenceTransaction,\n    streamToken: ByteString\n  ): PersistencePromise<void> {\n    return this.getMutationQueueMetadata(transaction).next(metadata => {\n      // We can't store the resumeToken as a ByteString in IndexedDB, so we\n      // convert it to a Base64 string for storage.\n      metadata.lastStreamToken = streamToken.toBase64();\n      return mutationQueuesStore(transaction).put(metadata);\n    });\n  }\n\n  addMutationBatch(\n    transaction: PersistenceTransaction,\n    localWriteTime: Timestamp,\n    baseMutations: Mutation[],\n    mutations: Mutation[]\n  ): PersistencePromise<MutationBatch> {\n    const documentStore = documentMutationsStore(transaction);\n    const mutationStore = mutationsStore(transaction);\n\n    // The IndexedDb implementation in Chrome (and Firefox) does not handle\n    // compound indices that include auto-generated keys correctly. To ensure\n    // that the index entry is added correctly in all browsers, we perform two\n    // writes: The first write is used to retrieve the next auto-generated Batch\n    // ID, and the second write populates the index and stores the actual\n    // mutation batch.\n    // See: https://bugs.chromium.org/p/chromium/issues/detail?id=701972\n\n    // We write an empty object to obtain key\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    return mutationStore.add({} as any).next(batchId => {\n      hardAssert(\n        typeof batchId === 'number',\n        'Auto-generated key is not a number'\n      );\n\n      const batch = new MutationBatch(\n        batchId,\n        localWriteTime,\n        baseMutations,\n        mutations\n      );\n      const dbBatch = this.serializer.toDbMutationBatch(this.userId, batch);\n\n      const promises: Array<PersistencePromise<void>> = [];\n      let collectionParents = new SortedSet<ResourcePath>((l, r) =>\n        primitiveComparator(l.canonicalString(), r.canonicalString())\n      );\n      for (const mutation of mutations) {\n        const indexKey = DbDocumentMutation.key(\n          this.userId,\n          mutation.key.path,\n          batchId\n        );\n        collectionParents = collectionParents.add(mutation.key.path.popLast());\n        promises.push(mutationStore.put(dbBatch));\n        promises.push(\n          documentStore.put(indexKey, DbDocumentMutation.PLACEHOLDER)\n        );\n      }\n\n      collectionParents.forEach(parent => {\n        promises.push(\n          this.indexManager.addToCollectionParentIndex(transaction, parent)\n        );\n      });\n\n      transaction.addOnCommittedListener(() => {\n        this.documentKeysByBatchId[batchId] = batch.keys();\n      });\n\n      return PersistencePromise.waitFor(promises).next(() => batch);\n    });\n  }\n\n  lookupMutationBatch(\n    transaction: PersistenceTransaction,\n    batchId: BatchId\n  ): PersistencePromise<MutationBatch | null> {\n    return mutationsStore(transaction)\n      .get(batchId)\n      .next(dbBatch => {\n        if (dbBatch) {\n          hardAssert(\n            dbBatch.userId === this.userId,\n            `Unexpected user '${dbBatch.userId}' for mutation batch ${batchId}`\n          );\n          return this.serializer.fromDbMutationBatch(dbBatch);\n        }\n        return null;\n      });\n  }\n\n  /**\n   * Returns the document keys for the mutation batch with the given batchId.\n   * For primary clients, this method returns `null` after\n   * `removeMutationBatches()` has been called. Secondary clients return a\n   * cached result until `removeCachedMutationKeys()` is invoked.\n   */\n  // PORTING NOTE: Multi-tab only.\n  lookupMutationKeys(\n    transaction: PersistenceTransaction,\n    batchId: BatchId\n  ): PersistencePromise<DocumentKeySet | null> {\n    if (this.documentKeysByBatchId[batchId]) {\n      return PersistencePromise.resolve<DocumentKeySet | null>(\n        this.documentKeysByBatchId[batchId]\n      );\n    } else {\n      return this.lookupMutationBatch(transaction, batchId).next(batch => {\n        if (batch) {\n          const keys = batch.keys();\n          this.documentKeysByBatchId[batchId] = keys;\n          return keys;\n        } else {\n          return null;\n        }\n      });\n    }\n  }\n\n  getNextMutationBatchAfterBatchId(\n    transaction: PersistenceTransaction,\n    batchId: BatchId\n  ): PersistencePromise<MutationBatch | null> {\n    const nextBatchId = batchId + 1;\n\n    const range = IDBKeyRange.lowerBound([this.userId, nextBatchId]);\n    let foundBatch: MutationBatch | null = null;\n    return mutationsStore(transaction)\n      .iterate(\n        { index: DbMutationBatch.userMutationsIndex, range },\n        (key, dbBatch, control) => {\n          if (dbBatch.userId === this.userId) {\n            hardAssert(\n              dbBatch.batchId >= nextBatchId,\n              'Should have found mutation after ' + nextBatchId\n            );\n            foundBatch = this.serializer.fromDbMutationBatch(dbBatch);\n          }\n          control.done();\n        }\n      )\n      .next(() => foundBatch);\n  }\n\n  getHighestUnacknowledgedBatchId(\n    transaction: PersistenceTransaction\n  ): PersistencePromise<BatchId> {\n    const range = IDBKeyRange.upperBound([\n      this.userId,\n      Number.POSITIVE_INFINITY\n    ]);\n\n    let batchId = BATCHID_UNKNOWN;\n    return mutationsStore(transaction)\n      .iterate(\n        { index: DbMutationBatch.userMutationsIndex, range, reverse: true },\n        (key, dbBatch, control) => {\n          batchId = dbBatch.batchId;\n          control.done();\n        }\n      )\n      .next(() => batchId);\n  }\n\n  getAllMutationBatches(\n    transaction: PersistenceTransaction\n  ): PersistencePromise<MutationBatch[]> {\n    const range = IDBKeyRange.bound(\n      [this.userId, BATCHID_UNKNOWN],\n      [this.userId, Number.POSITIVE_INFINITY]\n    );\n    return mutationsStore(transaction)\n      .loadAll(DbMutationBatch.userMutationsIndex, range)\n      .next(dbBatches =>\n        dbBatches.map(dbBatch => this.serializer.fromDbMutationBatch(dbBatch))\n      );\n  }\n\n  getAllMutationBatchesAffectingDocumentKey(\n    transaction: PersistenceTransaction,\n    documentKey: DocumentKey\n  ): PersistencePromise<MutationBatch[]> {\n    // Scan the document-mutation index starting with a prefix starting with\n    // the given documentKey.\n    const indexPrefix = DbDocumentMutation.prefixForPath(\n      this.userId,\n      documentKey.path\n    );\n    const indexStart = IDBKeyRange.lowerBound(indexPrefix);\n\n    const results: MutationBatch[] = [];\n    return documentMutationsStore(transaction)\n      .iterate({ range: indexStart }, (indexKey, _, control) => {\n        const [userID, encodedPath, batchId] = indexKey;\n\n        // Only consider rows matching exactly the specific key of\n        // interest. Note that because we order by path first, and we\n        // order terminators before path separators, we'll encounter all\n        // the index rows for documentKey contiguously. In particular, all\n        // the rows for documentKey will occur before any rows for\n        // documents nested in a subcollection beneath documentKey so we\n        // can stop as soon as we hit any such row.\n        const path = decodeResourcePath(encodedPath);\n        if (userID !== this.userId || !documentKey.path.isEqual(path)) {\n          control.done();\n          return;\n        }\n        // Look up the mutation batch in the store.\n        return mutationsStore(transaction)\n          .get(batchId)\n          .next(mutation => {\n            if (!mutation) {\n              throw fail(\n                'Dangling document-mutation reference found: ' +\n                  indexKey +\n                  ' which points to ' +\n                  batchId\n              );\n            }\n            hardAssert(\n              mutation.userId === this.userId,\n              `Unexpected user '${mutation.userId}' for mutation batch ${batchId}`\n            );\n            results.push(this.serializer.fromDbMutationBatch(mutation));\n          });\n      })\n      .next(() => results);\n  }\n\n  getAllMutationBatchesAffectingDocumentKeys(\n    transaction: PersistenceTransaction,\n    documentKeys: SortedMap<DocumentKey, unknown>\n  ): PersistencePromise<MutationBatch[]> {\n    let uniqueBatchIDs = new SortedSet<BatchId>(primitiveComparator);\n\n    const promises: Array<PersistencePromise<void>> = [];\n    documentKeys.forEach(documentKey => {\n      const indexStart = DbDocumentMutation.prefixForPath(\n        this.userId,\n        documentKey.path\n      );\n      const range = IDBKeyRange.lowerBound(indexStart);\n\n      const promise = documentMutationsStore(transaction).iterate(\n        { range },\n        (indexKey, _, control) => {\n          const [userID, encodedPath, batchID] = indexKey;\n\n          // Only consider rows matching exactly the specific key of\n          // interest. Note that because we order by path first, and we\n          // order terminators before path separators, we'll encounter all\n          // the index rows for documentKey contiguously. In particular, all\n          // the rows for documentKey will occur before any rows for\n          // documents nested in a subcollection beneath documentKey so we\n          // can stop as soon as we hit any such row.\n          const path = decodeResourcePath(encodedPath);\n          if (userID !== this.userId || !documentKey.path.isEqual(path)) {\n            control.done();\n            return;\n          }\n\n          uniqueBatchIDs = uniqueBatchIDs.add(batchID);\n        }\n      );\n\n      promises.push(promise);\n    });\n\n    return PersistencePromise.waitFor(promises).next(() =>\n      this.lookupMutationBatches(transaction, uniqueBatchIDs)\n    );\n  }\n\n  getAllMutationBatchesAffectingQuery(\n    transaction: PersistenceTransaction,\n    query: Query\n  ): PersistencePromise<MutationBatch[]> {\n    debugAssert(\n      !query.isDocumentQuery(),\n      \"Document queries shouldn't go down this path\"\n    );\n    debugAssert(\n      !query.isCollectionGroupQuery(),\n      'CollectionGroup queries should be handled in LocalDocumentsView'\n    );\n\n    const queryPath = query.path;\n    const immediateChildrenLength = queryPath.length + 1;\n\n    // TODO(mcg): Actually implement a single-collection query\n    //\n    // This is actually executing an ancestor query, traversing the whole\n    // subtree below the collection which can be horrifically inefficient for\n    // some structures. The right way to solve this is to implement the full\n    // value index, but that's not in the cards in the near future so this is\n    // the best we can do for the moment.\n    //\n    // Since we don't yet index the actual properties in the mutations, our\n    // current approach is to just return all mutation batches that affect\n    // documents in the collection being queried.\n    const indexPrefix = DbDocumentMutation.prefixForPath(\n      this.userId,\n      queryPath\n    );\n    const indexStart = IDBKeyRange.lowerBound(indexPrefix);\n\n    // Collect up unique batchIDs encountered during a scan of the index. Use a\n    // SortedSet to accumulate batch IDs so they can be traversed in order in a\n    // scan of the main table.\n    let uniqueBatchIDs = new SortedSet<BatchId>(primitiveComparator);\n    return documentMutationsStore(transaction)\n      .iterate({ range: indexStart }, (indexKey, _, control) => {\n        const [userID, encodedPath, batchID] = indexKey;\n        const path = decodeResourcePath(encodedPath);\n        if (userID !== this.userId || !queryPath.isPrefixOf(path)) {\n          control.done();\n          return;\n        }\n        // Rows with document keys more than one segment longer than the\n        // query path can't be matches. For example, a query on 'rooms'\n        // can't match the document /rooms/abc/messages/xyx.\n        // TODO(mcg): we'll need a different scanner when we implement\n        // ancestor queries.\n        if (path.length !== immediateChildrenLength) {\n          return;\n        }\n        uniqueBatchIDs = uniqueBatchIDs.add(batchID);\n      })\n      .next(() => this.lookupMutationBatches(transaction, uniqueBatchIDs));\n  }\n\n  private lookupMutationBatches(\n    transaction: PersistenceTransaction,\n    batchIDs: SortedSet<BatchId>\n  ): PersistencePromise<MutationBatch[]> {\n    const results: MutationBatch[] = [];\n    const promises: Array<PersistencePromise<void>> = [];\n    // TODO(rockwood): Implement this using iterate.\n    batchIDs.forEach(batchId => {\n      promises.push(\n        mutationsStore(transaction)\n          .get(batchId)\n          .next(mutation => {\n            if (mutation === null) {\n              throw fail(\n                'Dangling document-mutation reference found, ' +\n                  'which points to ' +\n                  batchId\n              );\n            }\n            hardAssert(\n              mutation.userId === this.userId,\n              `Unexpected user '${mutation.userId}' for mutation batch ${batchId}`\n            );\n            results.push(this.serializer.fromDbMutationBatch(mutation));\n          })\n      );\n    });\n    return PersistencePromise.waitFor(promises).next(() => results);\n  }\n\n  removeMutationBatch(\n    transaction: PersistenceTransaction,\n    batch: MutationBatch\n  ): PersistencePromise<void> {\n    return removeMutationBatch(\n      (transaction as IndexedDbTransaction).simpleDbTransaction,\n      this.userId,\n      batch\n    ).next(removedDocuments => {\n      transaction.addOnCommittedListener(() => {\n        this.removeCachedMutationKeys(batch.batchId);\n      });\n      return PersistencePromise.forEach(\n        removedDocuments,\n        (key: DocumentKey) => {\n          return this.referenceDelegate.markPotentiallyOrphaned(\n            transaction,\n            key\n          );\n        }\n      );\n    });\n  }\n\n  /**\n   * Clears the cached keys for a mutation batch. This method should be\n   * called by secondary clients after they process mutation updates.\n   *\n   * Note that this method does not have to be called from primary clients as\n   * the corresponding cache entries are cleared when an acknowledged or\n   * rejected batch is removed from the mutation queue.\n   */\n  // PORTING NOTE: Multi-tab only\n  removeCachedMutationKeys(batchId: BatchId): void {\n    delete this.documentKeysByBatchId[batchId];\n  }\n\n  performConsistencyCheck(\n    txn: PersistenceTransaction\n  ): PersistencePromise<void> {\n    return this.checkEmpty(txn).next(empty => {\n      if (!empty) {\n        return PersistencePromise.resolve();\n      }\n\n      // Verify that there are no entries in the documentMutations index if\n      // the queue is empty.\n      const startRange = IDBKeyRange.lowerBound(\n        DbDocumentMutation.prefixForUser(this.userId)\n      );\n      const danglingMutationReferences: ResourcePath[] = [];\n      return documentMutationsStore(txn)\n        .iterate({ range: startRange }, (key, _, control) => {\n          const userID = key[0];\n          if (userID !== this.userId) {\n            control.done();\n            return;\n          } else {\n            const path = decodeResourcePath(key[1]);\n            danglingMutationReferences.push(path);\n          }\n        })\n        .next(() => {\n          hardAssert(\n            danglingMutationReferences.length === 0,\n            'Document leak -- detected dangling mutation references when queue is empty. ' +\n              'Dangling keys: ' +\n              danglingMutationReferences.map(p => p.canonicalString())\n          );\n        });\n    });\n  }\n\n  containsKey(\n    txn: PersistenceTransaction,\n    key: DocumentKey\n  ): PersistencePromise<boolean> {\n    return mutationQueueContainsKey(txn, this.userId, key);\n  }\n\n  // PORTING NOTE: Multi-tab only (state is held in memory in other clients).\n  /** Returns the mutation queue's metadata from IndexedDb. */\n  private getMutationQueueMetadata(\n    transaction: PersistenceTransaction\n  ): PersistencePromise<DbMutationQueue> {\n    return mutationQueuesStore(transaction)\n      .get(this.userId)\n      .next((metadata: DbMutationQueue | null) => {\n        return (\n          metadata ||\n          new DbMutationQueue(\n            this.userId,\n            BATCHID_UNKNOWN,\n            /*lastStreamToken=*/ ''\n          )\n        );\n      });\n  }\n}\n\n/**\n * @return true if the mutation queue for the given user contains a pending\n *         mutation for the given key.\n */\nfunction mutationQueueContainsKey(\n  txn: PersistenceTransaction,\n  userId: string,\n  key: DocumentKey\n): PersistencePromise<boolean> {\n  const indexKey = DbDocumentMutation.prefixForPath(userId, key.path);\n  const encodedPath = indexKey[1];\n  const startRange = IDBKeyRange.lowerBound(indexKey);\n  let containsKey = false;\n  return documentMutationsStore(txn)\n    .iterate({ range: startRange, keysOnly: true }, (key, value, control) => {\n      const [userID, keyPath, /*batchID*/ _] = key;\n      if (userID === userId && keyPath === encodedPath) {\n        containsKey = true;\n      }\n      control.done();\n    })\n    .next(() => containsKey);\n}\n\n/** Returns true if any mutation queue contains the given document. */\nexport function mutationQueuesContainKey(\n  txn: PersistenceTransaction,\n  docKey: DocumentKey\n): PersistencePromise<boolean> {\n  let found = false;\n  return mutationQueuesStore(txn)\n    .iterateSerial(userId => {\n      return mutationQueueContainsKey(txn, userId, docKey).next(containsKey => {\n        if (containsKey) {\n          found = true;\n        }\n        return PersistencePromise.resolve(!containsKey);\n      });\n    })\n    .next(() => found);\n}\n\n/**\n * Delete a mutation batch and the associated document mutations.\n * @return A PersistencePromise of the document mutations that were removed.\n */\nexport function removeMutationBatch(\n  txn: SimpleDbTransaction,\n  userId: string,\n  batch: MutationBatch\n): PersistencePromise<DocumentKey[]> {\n  const mutationStore = txn.store<DbMutationBatchKey, DbMutationBatch>(\n    DbMutationBatch.store\n  );\n  const indexTxn = txn.store<DbDocumentMutationKey, DbDocumentMutation>(\n    DbDocumentMutation.store\n  );\n  const promises: Array<PersistencePromise<void>> = [];\n\n  const range = IDBKeyRange.only(batch.batchId);\n  let numDeleted = 0;\n  const removePromise = mutationStore.iterate(\n    { range },\n    (key, value, control) => {\n      numDeleted++;\n      return control.delete();\n    }\n  );\n  promises.push(\n    removePromise.next(() => {\n      hardAssert(\n        numDeleted === 1,\n        'Dangling document-mutation reference found: Missing batch ' +\n          batch.batchId\n      );\n    })\n  );\n  const removedDocuments: DocumentKey[] = [];\n  for (const mutation of batch.mutations) {\n    const indexKey = DbDocumentMutation.key(\n      userId,\n      mutation.key.path,\n      batch.batchId\n    );\n    promises.push(indexTxn.delete(indexKey));\n    removedDocuments.push(mutation.key);\n  }\n  return PersistencePromise.waitFor(promises).next(() => removedDocuments);\n}\n\n/**\n * Helper to get a typed SimpleDbStore for the mutations object store.\n */\nfunction mutationsStore(\n  txn: PersistenceTransaction\n): SimpleDbStore<DbMutationBatchKey, DbMutationBatch> {\n  return IndexedDbPersistence.getStore<DbMutationBatchKey, DbMutationBatch>(\n    txn,\n    DbMutationBatch.store\n  );\n}\n\n/**\n * Helper to get a typed SimpleDbStore for the mutationQueues object store.\n */\nfunction documentMutationsStore(\n  txn: PersistenceTransaction\n): SimpleDbStore<DbDocumentMutationKey, DbDocumentMutation> {\n  return IndexedDbPersistence.getStore<\n    DbDocumentMutationKey,\n    DbDocumentMutation\n  >(txn, DbDocumentMutation.store);\n}\n\n/**\n * Helper to get a typed SimpleDbStore for the mutationQueues object store.\n */\nfunction mutationQueuesStore(\n  txn: PersistenceTransaction\n): SimpleDbStore<DbMutationQueueKey, DbMutationQueue> {\n  return IndexedDbPersistence.getStore<DbMutationQueueKey, DbMutationQueue>(\n    txn,\n    DbMutationQueue.store\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 { BatchId, ListenSequenceNumber, TargetId } from '../core/types';\nimport { ResourcePath } from '../model/path';\nimport * as api from '../protos/firestore_proto_api';\nimport { hardAssert, debugAssert } from '../util/assert';\n\nimport { SnapshotVersion } from '../core/snapshot_version';\nimport { BATCHID_UNKNOWN } from '../model/mutation_batch';\nimport {\n  decodeResourcePath,\n  encodeResourcePath,\n  EncodedResourcePath\n} from './encoded_resource_path';\nimport { removeMutationBatch } from './indexeddb_mutation_queue';\nimport { dbDocumentSize } from './indexeddb_remote_document_cache';\nimport { LocalSerializer } from './local_serializer';\nimport { MemoryCollectionParentIndex } from './memory_index_manager';\nimport { PersistencePromise } from './persistence_promise';\nimport { SimpleDbSchemaConverter, SimpleDbTransaction } from './simple_db';\n\n/**\n * Schema Version for the Web client:\n * 1.  Initial version including Mutation Queue, Query Cache, and Remote\n *     Document Cache\n * 2.  Used to ensure a targetGlobal object exists and add targetCount to it. No\n *     longer required because migration 3 unconditionally clears it.\n * 3.  Dropped and re-created Query Cache to deal with cache corruption related\n *     to limbo resolution. Addresses\n *     https://github.com/firebase/firebase-ios-sdk/issues/1548\n * 4.  Multi-Tab Support.\n * 5.  Removal of held write acks.\n * 6.  Create document global for tracking document cache size.\n * 7.  Ensure every cached document has a sentinel row with a sequence number.\n * 8.  Add collection-parent index for Collection Group queries.\n * 9.  Change RemoteDocumentChanges store to be keyed by readTime rather than\n *     an auto-incrementing ID. This is required for Index-Free queries.\n * 10. Rewrite the canonical IDs to the explicit Protobuf-based format.\n */\nexport const SCHEMA_VERSION = 10;\n\n/** Performs database creation and schema upgrades. */\nexport class SchemaConverter implements SimpleDbSchemaConverter {\n  constructor(private readonly serializer: LocalSerializer) {}\n\n  /**\n   * Performs database creation and schema upgrades.\n   *\n   * Note that in production, this method is only ever used to upgrade the schema\n   * to SCHEMA_VERSION. Different values of toVersion are only used for testing\n   * and local feature development.\n   */\n  createOrUpgrade(\n    db: IDBDatabase,\n    txn: IDBTransaction,\n    fromVersion: number,\n    toVersion: number\n  ): PersistencePromise<void> {\n    hardAssert(\n      fromVersion < toVersion &&\n        fromVersion >= 0 &&\n        toVersion <= SCHEMA_VERSION,\n      `Unexpected schema upgrade from v${fromVersion} to v${toVersion}.`\n    );\n\n    const simpleDbTransaction = new SimpleDbTransaction(txn);\n\n    if (fromVersion < 1 && toVersion >= 1) {\n      createPrimaryClientStore(db);\n      createMutationQueue(db);\n      createQueryCache(db);\n      createRemoteDocumentCache(db);\n    }\n\n    // Migration 2 to populate the targetGlobal object no longer needed since\n    // migration 3 unconditionally clears it.\n\n    let p = PersistencePromise.resolve();\n    if (fromVersion < 3 && toVersion >= 3) {\n      // Brand new clients don't need to drop and recreate--only clients that\n      // potentially have corrupt data.\n      if (fromVersion !== 0) {\n        dropQueryCache(db);\n        createQueryCache(db);\n      }\n      p = p.next(() => writeEmptyTargetGlobalEntry(simpleDbTransaction));\n    }\n\n    if (fromVersion < 4 && toVersion >= 4) {\n      if (fromVersion !== 0) {\n        // Schema version 3 uses auto-generated keys to generate globally unique\n        // mutation batch IDs (this was previously ensured internally by the\n        // client). To migrate to the new schema, we have to read all mutations\n        // and write them back out. We preserve the existing batch IDs to guarantee\n        // consistency with other object stores. Any further mutation batch IDs will\n        // be auto-generated.\n        p = p.next(() =>\n          upgradeMutationBatchSchemaAndMigrateData(db, simpleDbTransaction)\n        );\n      }\n\n      p = p.next(() => {\n        createClientMetadataStore(db);\n      });\n    }\n\n    if (fromVersion < 5 && toVersion >= 5) {\n      p = p.next(() => this.removeAcknowledgedMutations(simpleDbTransaction));\n    }\n\n    if (fromVersion < 6 && toVersion >= 6) {\n      p = p.next(() => {\n        createDocumentGlobalStore(db);\n        return this.addDocumentGlobal(simpleDbTransaction);\n      });\n    }\n\n    if (fromVersion < 7 && toVersion >= 7) {\n      p = p.next(() => this.ensureSequenceNumbers(simpleDbTransaction));\n    }\n\n    if (fromVersion < 8 && toVersion >= 8) {\n      p = p.next(() =>\n        this.createCollectionParentIndex(db, simpleDbTransaction)\n      );\n    }\n\n    if (fromVersion < 9 && toVersion >= 9) {\n      p = p.next(() => {\n        // Multi-Tab used to manage its own changelog, but this has been moved\n        // to the DbRemoteDocument object store itself. Since the previous change\n        // log only contained transient data, we can drop its object store.\n        dropRemoteDocumentChangesStore(db);\n        createRemoteDocumentReadTimeIndex(txn);\n      });\n    }\n\n    if (fromVersion < 10 && toVersion >= 10) {\n      p = p.next(() => this.rewriteCanonicalIds(simpleDbTransaction));\n    }\n    return p;\n  }\n\n  private addDocumentGlobal(\n    txn: SimpleDbTransaction\n  ): PersistencePromise<void> {\n    let byteCount = 0;\n    return txn\n      .store<DbRemoteDocumentKey, DbRemoteDocument>(DbRemoteDocument.store)\n      .iterate((_, doc) => {\n        byteCount += dbDocumentSize(doc);\n      })\n      .next(() => {\n        const metadata = new DbRemoteDocumentGlobal(byteCount);\n        return txn\n          .store<DbRemoteDocumentGlobalKey, DbRemoteDocumentGlobal>(\n            DbRemoteDocumentGlobal.store\n          )\n          .put(DbRemoteDocumentGlobal.key, metadata);\n      });\n  }\n\n  private removeAcknowledgedMutations(\n    txn: SimpleDbTransaction\n  ): PersistencePromise<void> {\n    const queuesStore = txn.store<DbMutationQueueKey, DbMutationQueue>(\n      DbMutationQueue.store\n    );\n    const mutationsStore = txn.store<DbMutationBatchKey, DbMutationBatch>(\n      DbMutationBatch.store\n    );\n\n    return queuesStore.loadAll().next(queues => {\n      return PersistencePromise.forEach(queues, (queue: DbMutationQueue) => {\n        const range = IDBKeyRange.bound(\n          [queue.userId, BATCHID_UNKNOWN],\n          [queue.userId, queue.lastAcknowledgedBatchId]\n        );\n\n        return mutationsStore\n          .loadAll(DbMutationBatch.userMutationsIndex, range)\n          .next(dbBatches => {\n            return PersistencePromise.forEach(\n              dbBatches,\n              (dbBatch: DbMutationBatch) => {\n                hardAssert(\n                  dbBatch.userId === queue.userId,\n                  `Cannot process batch ${dbBatch.batchId} from unexpected user`\n                );\n                const batch = this.serializer.fromDbMutationBatch(dbBatch);\n\n                return removeMutationBatch(\n                  txn,\n                  queue.userId,\n                  batch\n                ).next(() => {});\n              }\n            );\n          });\n      });\n    });\n  }\n\n  /**\n   * Ensures that every document in the remote document cache has a corresponding sentinel row\n   * with a sequence number. Missing rows are given the most recently used sequence number.\n   */\n  private ensureSequenceNumbers(\n    txn: SimpleDbTransaction\n  ): PersistencePromise<void> {\n    const documentTargetStore = txn.store<\n      DbTargetDocumentKey,\n      DbTargetDocument\n    >(DbTargetDocument.store);\n    const documentsStore = txn.store<DbRemoteDocumentKey, DbRemoteDocument>(\n      DbRemoteDocument.store\n    );\n    const globalTargetStore = txn.store<DbTargetGlobalKey, DbTargetGlobal>(\n      DbTargetGlobal.store\n    );\n\n    return globalTargetStore.get(DbTargetGlobal.key).next(metadata => {\n      debugAssert(\n        !!metadata,\n        'Metadata should have been written during the version 3 migration'\n      );\n      const writeSentinelKey = (\n        path: ResourcePath\n      ): PersistencePromise<void> => {\n        return documentTargetStore.put(\n          new DbTargetDocument(\n            0,\n            encodeResourcePath(path),\n            metadata!.highestListenSequenceNumber!\n          )\n        );\n      };\n\n      const promises: Array<PersistencePromise<void>> = [];\n      return documentsStore\n        .iterate((key, doc) => {\n          const path = new ResourcePath(key);\n          const docSentinelKey = sentinelKey(path);\n          promises.push(\n            documentTargetStore.get(docSentinelKey).next(maybeSentinel => {\n              if (!maybeSentinel) {\n                return writeSentinelKey(path);\n              } else {\n                return PersistencePromise.resolve();\n              }\n            })\n          );\n        })\n        .next(() => PersistencePromise.waitFor(promises));\n    });\n  }\n\n  private createCollectionParentIndex(\n    db: IDBDatabase,\n    txn: SimpleDbTransaction\n  ): PersistencePromise<void> {\n    // Create the index.\n    db.createObjectStore(DbCollectionParent.store, {\n      keyPath: DbCollectionParent.keyPath\n    });\n\n    const collectionParentsStore = txn.store<\n      DbCollectionParentKey,\n      DbCollectionParent\n    >(DbCollectionParent.store);\n\n    // Helper to add an index entry iff we haven't already written it.\n    const cache = new MemoryCollectionParentIndex();\n    const addEntry = (\n      collectionPath: ResourcePath\n    ): PersistencePromise<void> | undefined => {\n      if (cache.add(collectionPath)) {\n        const collectionId = collectionPath.lastSegment();\n        const parentPath = collectionPath.popLast();\n        return collectionParentsStore.put({\n          collectionId,\n          parent: encodeResourcePath(parentPath)\n        });\n      }\n    };\n\n    // Index existing remote documents.\n    return txn\n      .store<DbRemoteDocumentKey, DbRemoteDocument>(DbRemoteDocument.store)\n      .iterate({ keysOnly: true }, (pathSegments, _) => {\n        const path = new ResourcePath(pathSegments);\n        return addEntry(path.popLast());\n      })\n      .next(() => {\n        // Index existing mutations.\n        return txn\n          .store<DbDocumentMutationKey, DbDocumentMutation>(\n            DbDocumentMutation.store\n          )\n          .iterate({ keysOnly: true }, ([userID, encodedPath, batchId], _) => {\n            const path = decodeResourcePath(encodedPath);\n            return addEntry(path.popLast());\n          });\n      });\n  }\n\n  private rewriteCanonicalIds(\n    txn: SimpleDbTransaction\n  ): PersistencePromise<void> {\n    const targetStore = txn.store<DbTargetKey, DbTarget>(DbTarget.store);\n    return targetStore.iterate((key, originalDbTarget) => {\n      const originalTargetData = this.serializer.fromDbTarget(originalDbTarget);\n      const updatedDbTarget = this.serializer.toDbTarget(originalTargetData);\n      return targetStore.put(updatedDbTarget);\n    });\n  }\n}\n\nfunction sentinelKey(path: ResourcePath): DbTargetDocumentKey {\n  return [0, encodeResourcePath(path)];\n}\n\n/**\n * Wrapper class to store timestamps (seconds and nanos) in IndexedDb objects.\n */\nexport class DbTimestamp {\n  constructor(public seconds: number, public nanoseconds: number) {}\n}\n\n/** A timestamp type that can be used in IndexedDb keys. */\nexport type DbTimestampKey = [/* seconds */ number, /* nanos */ number];\n\n// The key for the singleton object in the DbPrimaryClient is a single string.\nexport type DbPrimaryClientKey = typeof DbPrimaryClient.key;\n\n/**\n * A singleton object to be stored in the 'owner' store in IndexedDb.\n *\n * A given database can have a single primary tab assigned at a given time. That\n * tab must validate that it is still holding the primary lease before every\n * operation that requires locked access. The primary tab should regularly\n * write an updated timestamp to this lease to prevent other tabs from\n * \"stealing\" the primary lease\n */\nexport class DbPrimaryClient {\n  /**\n   * Name of the IndexedDb object store.\n   *\n   * Note that the name 'owner' is chosen to ensure backwards compatibility with\n   * older clients that only supported single locked access to the persistence\n   * layer.\n   */\n  static store = 'owner';\n\n  /**\n   * The key string used for the single object that exists in the\n   * DbPrimaryClient store.\n   */\n  static key = 'owner';\n\n  constructor(\n    public ownerId: string,\n    /** Whether to allow shared access from multiple tabs. */\n    public allowTabSynchronization: boolean,\n    public leaseTimestampMs: number\n  ) {}\n}\n\nfunction createPrimaryClientStore(db: IDBDatabase): void {\n  db.createObjectStore(DbPrimaryClient.store);\n}\n\n/** Object keys in the 'mutationQueues' store are userId strings. */\nexport type DbMutationQueueKey = string;\n\n/**\n * An object to be stored in the 'mutationQueues' store in IndexedDb.\n *\n * Each user gets a single queue of MutationBatches to apply to the server.\n * DbMutationQueue tracks the metadata about the queue.\n */\nexport class DbMutationQueue {\n  /** Name of the IndexedDb object store.  */\n  static store = 'mutationQueues';\n\n  /** Keys are automatically assigned via the userId property. */\n  static keyPath = 'userId';\n\n  constructor(\n    /**\n     * The normalized user ID to which this queue belongs.\n     */\n    public userId: string,\n    /**\n     * An identifier for the highest numbered batch that has been acknowledged\n     * by the server. All MutationBatches in this queue with batchIds less\n     * than or equal to this value are considered to have been acknowledged by\n     * the server.\n     *\n     * NOTE: this is deprecated and no longer used by the code.\n     */\n    public lastAcknowledgedBatchId: number,\n    /**\n     * A stream token that was previously sent by the server.\n     *\n     * See StreamingWriteRequest in datastore.proto for more details about\n     * usage.\n     *\n     * After sending this token, earlier tokens may not be used anymore so\n     * only a single stream token is retained.\n     */\n    public lastStreamToken: string\n  ) {}\n}\n\n/** The 'mutations' store  is keyed by batch ID. */\nexport type DbMutationBatchKey = BatchId;\n\n/**\n * An object to be stored in the 'mutations' store in IndexedDb.\n *\n * Represents a batch of user-level mutations intended to be sent to the server\n * in a single write. Each user-level batch gets a separate DbMutationBatch\n * with a new batchId.\n */\nexport class DbMutationBatch {\n  /** Name of the IndexedDb object store.  */\n  static store = 'mutations';\n\n  /** Keys are automatically assigned via the userId, batchId properties. */\n  static keyPath = 'batchId';\n\n  /** The index name for lookup of mutations by user. */\n  static userMutationsIndex = 'userMutationsIndex';\n\n  /** The user mutations index is keyed by [userId, batchId] pairs. */\n  static userMutationsKeyPath = ['userId', 'batchId'];\n\n  constructor(\n    /**\n     * The normalized user ID to which this batch belongs.\n     */\n    public userId: string,\n    /**\n     * An identifier for this batch, allocated using an auto-generated key.\n     */\n    public batchId: BatchId,\n    /**\n     * The local write time of the batch, stored as milliseconds since the\n     * epoch.\n     */\n    public localWriteTimeMs: number,\n    /**\n     * A list of \"mutations\" that represent a partial base state from when this\n     * write batch was initially created. During local application of the write\n     * batch, these baseMutations are applied prior to the real writes in order\n     * to override certain document fields from the remote document cache. This\n     * is necessary in the case of non-idempotent writes (e.g. `increment()`\n     * transforms) to make sure that the local view of the modified documents\n     * doesn't flicker if the remote document cache receives the result of the\n     * non-idempotent write before the write is removed from the queue.\n     *\n     * These mutations are never sent to the backend.\n     */\n    public baseMutations: api.Write[] | undefined,\n    /**\n     * A list of mutations to apply. All mutations will be applied atomically.\n     *\n     * Mutations are serialized via JsonProtoSerializer.toMutation().\n     */\n    public mutations: api.Write[]\n  ) {}\n}\n\n/**\n * The key for a db document mutation, which is made up of a userID, path, and\n * batchId. Note that the path must be serialized into a form that indexedDB can\n * sort.\n */\nexport type DbDocumentMutationKey = [string, EncodedResourcePath, BatchId];\n\nfunction createMutationQueue(db: IDBDatabase): void {\n  db.createObjectStore(DbMutationQueue.store, {\n    keyPath: DbMutationQueue.keyPath\n  });\n\n  const mutationBatchesStore = db.createObjectStore(DbMutationBatch.store, {\n    keyPath: DbMutationBatch.keyPath,\n    autoIncrement: true\n  });\n  mutationBatchesStore.createIndex(\n    DbMutationBatch.userMutationsIndex,\n    DbMutationBatch.userMutationsKeyPath,\n    { unique: true }\n  );\n\n  db.createObjectStore(DbDocumentMutation.store);\n}\n\n/**\n * Upgrade function to migrate the 'mutations' store from V1 to V3. Loads\n * and rewrites all data.\n */\nfunction upgradeMutationBatchSchemaAndMigrateData(\n  db: IDBDatabase,\n  txn: SimpleDbTransaction\n): PersistencePromise<void> {\n  const v1MutationsStore = txn.store<[string, number], DbMutationBatch>(\n    DbMutationBatch.store\n  );\n  return v1MutationsStore.loadAll().next(existingMutations => {\n    db.deleteObjectStore(DbMutationBatch.store);\n\n    const mutationsStore = db.createObjectStore(DbMutationBatch.store, {\n      keyPath: DbMutationBatch.keyPath,\n      autoIncrement: true\n    });\n    mutationsStore.createIndex(\n      DbMutationBatch.userMutationsIndex,\n      DbMutationBatch.userMutationsKeyPath,\n      { unique: true }\n    );\n\n    const v3MutationsStore = txn.store<DbMutationBatchKey, DbMutationBatch>(\n      DbMutationBatch.store\n    );\n    const writeAll = existingMutations.map(mutation =>\n      v3MutationsStore.put(mutation)\n    );\n\n    return PersistencePromise.waitFor(writeAll);\n  });\n}\n\n/**\n * An object to be stored in the 'documentMutations' store in IndexedDb.\n *\n * A manually maintained index of all the mutation batches that affect a given\n * document key. The rows in this table are references based on the contents of\n * DbMutationBatch.mutations.\n */\nexport class DbDocumentMutation {\n  static store = 'documentMutations';\n\n  /**\n   * Creates a [userId] key for use in the DbDocumentMutations index to iterate\n   * over all of a user's document mutations.\n   */\n  static prefixForUser(userId: string): [string] {\n    return [userId];\n  }\n\n  /**\n   * Creates a [userId, encodedPath] key for use in the DbDocumentMutations\n   * index to iterate over all at document mutations for a given path or lower.\n   */\n  static prefixForPath(\n    userId: string,\n    path: ResourcePath\n  ): [string, EncodedResourcePath] {\n    return [userId, encodeResourcePath(path)];\n  }\n\n  /**\n   * Creates a full index key of [userId, encodedPath, batchId] for inserting\n   * and deleting into the DbDocumentMutations index.\n   */\n  static key(\n    userId: string,\n    path: ResourcePath,\n    batchId: BatchId\n  ): DbDocumentMutationKey {\n    return [userId, encodeResourcePath(path), batchId];\n  }\n\n  /**\n   * Because we store all the useful information for this store in the key,\n   * there is no useful information to store as the value. The raw (unencoded)\n   * path cannot be stored because IndexedDb doesn't store prototype\n   * information.\n   */\n  static PLACEHOLDER = new DbDocumentMutation();\n\n  private constructor() {}\n}\n\n/**\n * A key in the 'remoteDocuments' object store is a string array containing the\n * segments that make up the path.\n */\nexport type DbRemoteDocumentKey = string[];\n\nfunction createRemoteDocumentCache(db: IDBDatabase): void {\n  db.createObjectStore(DbRemoteDocument.store);\n}\n\n/**\n * Represents the known absence of a document at a particular version.\n * Stored in IndexedDb as part of a DbRemoteDocument object.\n */\nexport class DbNoDocument {\n  constructor(public path: string[], public readTime: DbTimestamp) {}\n}\n\n/**\n * Represents a document that is known to exist but whose data is unknown.\n * Stored in IndexedDb as part of a DbRemoteDocument object.\n */\nexport class DbUnknownDocument {\n  constructor(public path: string[], public version: DbTimestamp) {}\n}\n\n/**\n * An object to be stored in the 'remoteDocuments' store in IndexedDb.\n * It represents either:\n *\n * - A complete document.\n * - A \"no document\" representing a document that is known not to exist (at\n * some version).\n * - An \"unknown document\" representing a document that is known to exist (at\n * some version) but whose contents are unknown.\n *\n * Note: This is the persisted equivalent of a MaybeDocument and could perhaps\n * be made more general if necessary.\n */\nexport class DbRemoteDocument {\n  static store = 'remoteDocuments';\n\n  /**\n   * An index that provides access to all entries sorted by read time (which\n   * corresponds to the last modification time of each row).\n   *\n   * This index is used to provide a changelog for Multi-Tab.\n   */\n  static readTimeIndex = 'readTimeIndex';\n\n  static readTimeIndexPath = 'readTime';\n\n  /**\n   * An index that provides access to documents in a collection sorted by read\n   * time.\n   *\n   * This index is used to allow the RemoteDocumentCache to fetch newly changed\n   * documents in a collection.\n   */\n  static collectionReadTimeIndex = 'collectionReadTimeIndex';\n\n  static collectionReadTimeIndexPath = ['parentPath', 'readTime'];\n\n  // TODO: We are currently storing full document keys almost three times\n  // (once as part of the primary key, once - partly - as `parentPath` and once\n  // inside the encoded documents). During our next migration, we should\n  // rewrite the primary key as parentPath + document ID which would allow us\n  // to drop one value.\n\n  constructor(\n    /**\n     * Set to an instance of DbUnknownDocument if the data for a document is\n     * not known, but it is known that a document exists at the specified\n     * version (e.g. it had a successful update applied to it)\n     */\n    public unknownDocument: DbUnknownDocument | null | undefined,\n    /**\n     * Set to an instance of a DbNoDocument if it is known that no document\n     * exists.\n     */\n    public noDocument: DbNoDocument | null,\n    /**\n     * Set to an instance of a Document if there's a cached version of the\n     * document.\n     */\n    public document: api.Document | null,\n    /**\n     * Documents that were written to the remote document store based on\n     * a write acknowledgment are marked with `hasCommittedMutations`. These\n     * documents are potentially inconsistent with the backend's copy and use\n     * the write's commit version as their document version.\n     */\n    public hasCommittedMutations: boolean | undefined,\n\n    /**\n     * When the document was read from the backend. Undefined for data written\n     * prior to schema version 9.\n     */\n    public readTime: DbTimestampKey | undefined,\n\n    /**\n     * The path of the collection this document is part of. Undefined for data\n     * written prior to schema version 9.\n     */\n    public parentPath: string[] | undefined\n  ) {}\n}\n\n/**\n * Contains a single entry that has metadata about the remote document cache.\n */\nexport class DbRemoteDocumentGlobal {\n  static store = 'remoteDocumentGlobal';\n\n  static key = 'remoteDocumentGlobalKey';\n\n  /**\n   * @param byteSize Approximately the total size in bytes of all the documents in the document\n   * cache.\n   */\n  constructor(public byteSize: number) {}\n}\n\nexport type DbRemoteDocumentGlobalKey = typeof DbRemoteDocumentGlobal.key;\n\nfunction createDocumentGlobalStore(db: IDBDatabase): void {\n  db.createObjectStore(DbRemoteDocumentGlobal.store);\n}\n\n/**\n * A key in the 'targets' object store is a targetId of the query.\n */\nexport type DbTargetKey = TargetId;\n\n/**\n * The persisted type for a query nested with in the 'targets' store in\n * IndexedDb. We use the proto definitions for these two kinds of queries in\n * order to avoid writing extra serialization logic.\n */\nexport type DbQuery = api.QueryTarget | api.DocumentsTarget;\n\n/**\n * An object to be stored in the 'targets' store in IndexedDb.\n *\n * This is based on and should be kept in sync with the proto used in the iOS\n * client.\n *\n * Each query the client listens to against the server is tracked on disk so\n * that the query can be efficiently resumed on restart.\n */\nexport class DbTarget {\n  static store = 'targets';\n\n  /** Keys are automatically assigned via the targetId property. */\n  static keyPath = 'targetId';\n\n  /** The name of the queryTargets index. */\n  static queryTargetsIndexName = 'queryTargetsIndex';\n\n  /**\n   * The index of all canonicalIds to the targets that they match. This is not\n   * a unique mapping because canonicalId does not promise a unique name for all\n   * possible queries, so we append the targetId to make the mapping unique.\n   */\n  static queryTargetsKeyPath = ['canonicalId', 'targetId'];\n\n  constructor(\n    /**\n     * An auto-generated sequential numeric identifier for the query.\n     *\n     * Queries are stored using their canonicalId as the key, but these\n     * canonicalIds can be quite long so we additionally assign a unique\n     * queryId which can be used by referenced data structures (e.g.\n     * indexes) to minimize the on-disk cost.\n     */\n    public targetId: TargetId,\n    /**\n     * The canonical string representing this query. This is not unique.\n     */\n    public canonicalId: string,\n    /**\n     * The last readTime received from the Watch Service for this query.\n     *\n     * This is the same value as TargetChange.read_time in the protos.\n     */\n    public readTime: DbTimestamp,\n    /**\n     * An opaque, server-assigned token that allows watching a query to be\n     * resumed after disconnecting without retransmitting all the data\n     * that matches the query. The resume token essentially identifies a\n     * point in time from which the server should resume sending results.\n     *\n     * This is related to the snapshotVersion in that the resumeToken\n     * effectively also encodes that value, but the resumeToken is opaque\n     * and sometimes encodes additional information.\n     *\n     * A consequence of this is that the resumeToken should be used when\n     * asking the server to reason about where this client is in the watch\n     * stream, but the client should use the snapshotVersion for its own\n     * purposes.\n     *\n     * This is the same value as TargetChange.resume_token in the protos.\n     */\n    public resumeToken: string,\n    /**\n     * A sequence number representing the last time this query was\n     * listened to, used for garbage collection purposes.\n     *\n     * Conventionally this would be a timestamp value, but device-local\n     * clocks are unreliable and they must be able to create new listens\n     * even while disconnected. Instead this should be a monotonically\n     * increasing number that's incremented on each listen call.\n     *\n     * This is different from the queryId since the queryId is an\n     * immutable identifier assigned to the Query on first use while\n     * lastListenSequenceNumber is updated every time the query is\n     * listened to.\n     */\n    public lastListenSequenceNumber: number,\n    /**\n     * Denotes the maximum snapshot version at which the associated query view\n     * contained no limbo documents.  Undefined for data written prior to\n     * schema version 9.\n     */\n    public lastLimboFreeSnapshotVersion: DbTimestamp | undefined,\n    /**\n     * The query for this target.\n     *\n     * Because canonical ids are not unique we must store the actual query. We\n     * use the proto to have an object we can persist without having to\n     * duplicate translation logic to and from a `Query` object.\n     */\n    public query: DbQuery\n  ) {}\n}\n\n/**\n * The key for a DbTargetDocument, containing a targetId and an encoded resource\n * path.\n */\nexport type DbTargetDocumentKey = [TargetId, EncodedResourcePath];\n\n/**\n * An object representing an association between a target and a document, or a\n * sentinel row marking the last sequence number at which a document was used.\n * Each document cached must have a corresponding sentinel row before lru\n * garbage collection is enabled.\n *\n * The target associations and sentinel rows are co-located so that orphaned\n * documents and their sequence numbers can be identified efficiently via a scan\n * of this store.\n */\nexport class DbTargetDocument {\n  /** Name of the IndexedDb object store.  */\n  static store = 'targetDocuments';\n\n  /** Keys are automatically assigned via the targetId, path properties. */\n  static keyPath = ['targetId', 'path'];\n\n  /** The index name for the reverse index. */\n  static documentTargetsIndex = 'documentTargetsIndex';\n\n  /** We also need to create the reverse index for these properties. */\n  static documentTargetsKeyPath = ['path', 'targetId'];\n\n  constructor(\n    /**\n     * The targetId identifying a target or 0 for a sentinel row.\n     */\n    public targetId: TargetId,\n    /**\n     * The path to the document, as encoded in the key.\n     */\n    public path: EncodedResourcePath,\n    /**\n     * If this is a sentinel row, this should be the sequence number of the last\n     * time the document specified by `path` was used. Otherwise, it should be\n     * `undefined`.\n     */\n    public sequenceNumber?: ListenSequenceNumber\n  ) {\n    debugAssert(\n      (targetId === 0) === (sequenceNumber !== undefined),\n      'A target-document row must either have targetId == 0 and a defined sequence number, or a non-zero targetId and no sequence number'\n    );\n  }\n}\n\n/**\n * The type to represent the single allowed key for the DbTargetGlobal store.\n */\nexport type DbTargetGlobalKey = typeof DbTargetGlobal.key;\n\n/**\n * A record of global state tracked across all Targets, tracked separately\n * to avoid the need for extra indexes.\n *\n * This should be kept in-sync with the proto used in the iOS client.\n */\nexport class DbTargetGlobal {\n  /**\n   * The key string used for the single object that exists in the\n   * DbTargetGlobal store.\n   */\n  static key = 'targetGlobalKey';\n  static store = 'targetGlobal';\n\n  constructor(\n    /**\n     * The highest numbered target id across all targets.\n     *\n     * See DbTarget.targetId.\n     */\n    public highestTargetId: TargetId,\n    /**\n     * The highest numbered lastListenSequenceNumber across all targets.\n     *\n     * See DbTarget.lastListenSequenceNumber.\n     */\n    public highestListenSequenceNumber: number,\n    /**\n     * A global snapshot version representing the last consistent snapshot we\n     * received from the backend. This is monotonically increasing and any\n     * snapshots received from the backend prior to this version (e.g. for\n     * targets resumed with a resumeToken) should be suppressed (buffered)\n     * until the backend has caught up to this snapshot version again. This\n     * prevents our cache from ever going backwards in time.\n     */\n    public lastRemoteSnapshotVersion: DbTimestamp,\n    /**\n     * The number of targets persisted.\n     */\n    public targetCount: number\n  ) {}\n}\n\n/**\n * The key for a DbCollectionParent entry, containing the collection ID\n * and the parent path that contains it. Note that the parent path will be an\n * empty path in the case of root-level collections.\n */\nexport type DbCollectionParentKey = [string, EncodedResourcePath];\n\n/**\n * An object representing an association between a Collection id (e.g. 'messages')\n * to a parent path (e.g. '/chats/123') that contains it as a (sub)collection.\n * This is used to efficiently find all collections to query when performing\n * a Collection Group query.\n */\nexport class DbCollectionParent {\n  /** Name of the IndexedDb object store. */\n  static store = 'collectionParents';\n\n  /** Keys are automatically assigned via the collectionId, parent properties. */\n  static keyPath = ['collectionId', 'parent'];\n\n  constructor(\n    /**\n     * The collectionId (e.g. 'messages')\n     */\n    public collectionId: string,\n    /**\n     * The path to the parent (either a document location or an empty path for\n     * a root-level collection).\n     */\n    public parent: EncodedResourcePath\n  ) {}\n}\n\nfunction createQueryCache(db: IDBDatabase): void {\n  const targetDocumentsStore = db.createObjectStore(DbTargetDocument.store, {\n    keyPath: DbTargetDocument.keyPath\n  });\n  targetDocumentsStore.createIndex(\n    DbTargetDocument.documentTargetsIndex,\n    DbTargetDocument.documentTargetsKeyPath,\n    { unique: true }\n  );\n\n  const targetStore = db.createObjectStore(DbTarget.store, {\n    keyPath: DbTarget.keyPath\n  });\n\n  // NOTE: This is unique only because the TargetId is the suffix.\n  targetStore.createIndex(\n    DbTarget.queryTargetsIndexName,\n    DbTarget.queryTargetsKeyPath,\n    { unique: true }\n  );\n  db.createObjectStore(DbTargetGlobal.store);\n}\n\nfunction dropQueryCache(db: IDBDatabase): void {\n  db.deleteObjectStore(DbTargetDocument.store);\n  db.deleteObjectStore(DbTarget.store);\n  db.deleteObjectStore(DbTargetGlobal.store);\n}\n\nfunction dropRemoteDocumentChangesStore(db: IDBDatabase): void {\n  if (db.objectStoreNames.contains('remoteDocumentChanges')) {\n    db.deleteObjectStore('remoteDocumentChanges');\n  }\n}\n\n/**\n * Creates the target global singleton row.\n *\n * @param {IDBTransaction} txn The version upgrade transaction for indexeddb\n */\nfunction writeEmptyTargetGlobalEntry(\n  txn: SimpleDbTransaction\n): PersistencePromise<void> {\n  const globalStore = txn.store<DbTargetGlobalKey, DbTargetGlobal>(\n    DbTargetGlobal.store\n  );\n  const metadata = new DbTargetGlobal(\n    /*highestTargetId=*/ 0,\n    /*lastListenSequenceNumber=*/ 0,\n    SnapshotVersion.min().toTimestamp(),\n    /*targetCount=*/ 0\n  );\n  return globalStore.put(DbTargetGlobal.key, metadata);\n}\n\n/**\n * Creates indices on the RemoteDocuments store used for both multi-tab\n * and Index-Free queries.\n */\nfunction createRemoteDocumentReadTimeIndex(txn: IDBTransaction): void {\n  const remoteDocumentStore = txn.objectStore(DbRemoteDocument.store);\n  remoteDocumentStore.createIndex(\n    DbRemoteDocument.readTimeIndex,\n    DbRemoteDocument.readTimeIndexPath,\n    { unique: false }\n  );\n  remoteDocumentStore.createIndex(\n    DbRemoteDocument.collectionReadTimeIndex,\n    DbRemoteDocument.collectionReadTimeIndexPath,\n    { unique: false }\n  );\n}\n\n/**\n * A record of the metadata state of each client.\n *\n * PORTING NOTE: This is used to synchronize multi-tab state and does not need\n * to be ported to iOS or Android.\n */\nexport class DbClientMetadata {\n  /** Name of the IndexedDb object store. */\n  static store = 'clientMetadata';\n\n  /** Keys are automatically assigned via the clientId properties. */\n  static keyPath = 'clientId';\n\n  constructor(\n    // Note: Previous schema versions included a field\n    // \"lastProcessedDocumentChangeId\". Don't use anymore.\n\n    /** The auto-generated client id assigned at client startup. */\n    public clientId: string,\n    /** The last time this state was updated. */\n    public updateTimeMs: number,\n    /** Whether the client's network connection is enabled. */\n    public networkEnabled: boolean,\n    /** Whether this client is running in a foreground tab. */\n    public inForeground: boolean\n  ) {}\n}\n\n/** Object keys in the 'clientMetadata' store are clientId strings. */\nexport type DbClientMetadataKey = string;\n\nfunction createClientMetadataStore(db: IDBDatabase): void {\n  db.createObjectStore(DbClientMetadata.store, {\n    keyPath: DbClientMetadata.keyPath\n  });\n}\n\n// Visible for testing\nexport const V1_STORES = [\n  DbMutationQueue.store,\n  DbMutationBatch.store,\n  DbDocumentMutation.store,\n  DbRemoteDocument.store,\n  DbTarget.store,\n  DbPrimaryClient.store,\n  DbTargetGlobal.store,\n  DbTargetDocument.store\n];\n\n// V2 is no longer usable (see comment at top of file)\n\n// Visible for testing\nexport const V3_STORES = V1_STORES;\n\n// Visible for testing\n// Note: DbRemoteDocumentChanges is no longer used and dropped with v9.\nexport const V4_STORES = [...V3_STORES, DbClientMetadata.store];\n\n// V5 does not change the set of stores.\n\nexport const V6_STORES = [...V4_STORES, DbRemoteDocumentGlobal.store];\n\n// V7 does not change the set of stores.\n\nexport const V8_STORES = [...V6_STORES, DbCollectionParent.store];\n\n// V9 does not change the set of stores.\n\n// V10 does not change the set of stores.\n\n/**\n * The list of all default IndexedDB stores used throughout the SDK. This is\n * used when creating transactions so that access across all stores is done\n * atomically.\n */\nexport const ALL_STORES = V8_STORES;\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 } from '@firebase/util';\nimport { debugAssert } from '../util/assert';\nimport { Code, FirestoreError } from '../util/error';\nimport { logDebug, logError } from '../util/log';\nimport { Deferred } from '../util/promise';\nimport { SCHEMA_VERSION } from './indexeddb_schema';\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 * 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  /**\n   * Opens the specified database, creating or upgrading it if necessary.\n   *\n   * Note that `version` must not be a downgrade. IndexedDB does not support downgrading the schema\n   * version. We currently do not support any way to do versioning outside of IndexedDB's versioning\n   * mechanism, as only version-upgrade transactions are allowed to do things like create\n   * objectstores.\n   */\n  static openOrCreate(\n    name: string,\n    version: number,\n    schemaConverter: SimpleDbSchemaConverter\n  ): Promise<SimpleDb> {\n    debugAssert(\n      SimpleDb.isAvailable(),\n      'IndexedDB not supported in current environment.'\n    );\n    logDebug(LOG_TAG, 'Opening database:', name);\n    return new PersistencePromise<SimpleDb>((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 = window.indexedDB.open(name, version);\n\n      request.onsuccess = (event: Event) => {\n        const db = (event.target as IDBOpenDBRequest).result;\n        resolve(new SimpleDb(db));\n      };\n\n      request.onblocked = () => {\n        reject(\n          new FirestoreError(\n            Code.FAILED_PRECONDITION,\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 {\n          reject(error);\n        }\n      };\n\n      request.onupgradeneeded = (event: IDBVersionChangeEvent) => {\n        logDebug(\n          LOG_TAG,\n          'Database \"' + name + '\" requires upgrade from version:',\n          event.oldVersion\n        );\n        const db = (event.target as IDBOpenDBRequest).result;\n        schemaConverter\n          .createOrUpgrade(\n            db,\n            request.transaction!,\n            event.oldVersion,\n            SCHEMA_VERSION\n          )\n          .next(() => {\n            logDebug(\n              LOG_TAG,\n              'Database upgrade to version ' + SCHEMA_VERSION + ' complete'\n            );\n          });\n      };\n    }).toPromise();\n  }\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 (typeof window === 'undefined' || window.indexedDB == null) {\n      return false;\n    }\n\n    if (SimpleDb.isMockPersistence()) {\n      return true;\n    }\n\n    // In some Node environments, `window` is defined, but `window.navigator` is\n    // not. We don't support IndexedDB persistence in Node if the\n    // isMockPersistence() check above returns false.\n    if (window.navigator === undefined) {\n      return false;\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]\n          .split('_')\n          .slice(0, 2)\n          .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]\n          .split('.')\n          .slice(0, 2)\n          .join('.')\n      : '-1';\n    return Number(version);\n  }\n\n  constructor(private db: IDBDatabase) {\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  setVersionChangeListener(\n    versionChangeListener: (event: IDBVersionChangeEvent) => void\n  ): void {\n    this.db.onversionchange = (event: IDBVersionChangeEvent) => {\n      return versionChangeListener(event);\n    };\n  }\n\n  async runTransaction<T>(\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      const transaction = SimpleDbTransaction.open(\n        this.db,\n        readonly ? 'readonly' : 'readwrite',\n        objectStores\n      );\n      try {\n        const transactionFnResult = transactionFn(transaction)\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 (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: %s. Retrying: %s.',\n          error.message,\n          retryable\n        );\n\n        if (!retryable) {\n          return Promise.reject(error);\n        }\n      }\n    }\n  }\n\n  close(): void {\n    this.db.close();\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(cause: Error) {\n    super(Code.UNAVAILABLE, 'IndexedDB transaction failed: ' + cause);\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 * 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    mode: IDBTransactionMode,\n    objectStoreNames: string[]\n  ): SimpleDbTransaction {\n    return new SimpleDbTransaction(db.transaction(objectStoreNames, mode));\n  }\n\n  constructor(private readonly transaction: IDBTransaction) {\n    this.transaction.oncomplete = () => {\n      this.completionDeferred.resolve();\n    };\n    this.transaction.onabort = () => {\n      if (transaction.error) {\n        this.completionDeferred.reject(\n          new IndexedDbTransactionError(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(new IndexedDbTransactionError(error));\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  /**\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 * 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   * @return 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   * @return 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  loadAll(): PersistencePromise<ValueType[]>;\n  loadAll(range: IDBKeyRange): PersistencePromise<ValueType[]>;\n  loadAll(index: string, range: IDBKeyRange): PersistencePromise<ValueType[]>;\n  loadAll(\n    indexOrRange?: string | IDBKeyRange,\n    range?: IDBKeyRange\n  ): PersistencePromise<ValueType[]> {\n    const cursor = this.cursor(this.options(indexOrRange, range));\n    const results: ValueType[] = [];\n    return this.iterateCursor(cursor, (key, value) => {\n      results.push(value);\n    }).next(() => {\n      return results;\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 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(() => {\n      return PersistencePromise.waitFor(results);\n    });\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 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';\nimport { Code, FirestoreError } from './error';\nimport { logDebug, logError } from './log';\nimport { Deferred } from './promise';\nimport { ExponentialBackoff } from '../remote/backoff';\nimport { PlatformSupport } from '../platform/platform';\nimport { isIndexedDbTransactionError } from '../local/simple_db';\n\nconst LOG_TAG = 'AsyncQueue';\n\n// Accept any return type from setTimeout().\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 4 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.\n   */\n  ListenStreamIdle = 'listen_stream_idle',\n  ListenStreamConnectionBackoff = 'listen_stream_connection_backoff',\n  WriteStreamIdle = 'write_stream_idle',\n  WriteStreamConnectionBackoff = 'write_stream_connection_backoff',\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/**\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 class AsyncQueue {\n  // The last promise in the queue.\n  private tail: Promise<unknown> = Promise.resolve();\n\n  // The last retryable operation. Retryable operation are run in order and\n  // retried with backoff.\n  private retryableTail: Promise<void> = Promise.resolve();\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: Error | 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  // 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 => this.backoff.skipBackoff();\n\n  constructor() {\n    const window = PlatformSupport.getPlatform().window;\n    if (window && typeof window.addEventListener === 'function') {\n      window.addEventListener('visibilitychange', this.visibilityHandler);\n    }\n  }\n\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  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  /**\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  enqueueAndForgetEvenAfterShutdown<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  /**\n   * Regardless if the queue has initialized shutdown, adds a new operation to the\n   * queue.\n   */\n  private enqueueEvenAfterShutdown<T extends unknown>(\n    op: () => Promise<T>\n  ): Promise<T> {\n    this.verifyNotFailed();\n    return this.enqueueInternal(op);\n  }\n\n  /**\n   * Adds a new operation to the queue and initialize the shut down of this queue.\n   * Returns a promise that will be resolved when the promise returned by the new\n   * operation is (with its value).\n   * Once this method is called, the only possible way to request running an operation\n   * is through `enqueueAndForgetEvenAfterShutdown`.\n   */\n  async enqueueAndInitiateShutdown(op: () => Promise<void>): Promise<void> {\n    this.verifyNotFailed();\n    if (!this._isShuttingDown) {\n      this._isShuttingDown = true;\n      const window = PlatformSupport.getPlatform().window;\n      if (window) {\n        window.removeEventListener('visibilitychange', this.visibilityHandler);\n      }\n      await this.enqueueEvenAfterShutdown(op);\n    }\n  }\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    this.verifyNotFailed();\n    if (this._isShuttingDown) {\n      // Return a Promise which never resolves.\n      return new Promise<T>(resolve => {});\n    }\n    return this.enqueueInternal(op);\n  }\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    this.verifyNotFailed();\n\n    if (this._isShuttingDown) {\n      return;\n    }\n\n    this.retryableTail = this.retryableTail.then(() => {\n      const deferred = new Deferred<void>();\n      const retryingOp = async (): Promise<void> => {\n        try {\n          await op();\n          deferred.resolve();\n          this.backoff.reset();\n        } catch (e) {\n          if (isIndexedDbTransactionError(e)) {\n            logDebug(LOG_TAG, 'Operation failed with retryable error: ' + e);\n            this.backoff.backoffAndRun(retryingOp);\n          } else {\n            deferred.resolve();\n            throw e; // Failure will be handled by AsyncQueue\n          }\n        }\n      };\n      this.enqueueAndForget(retryingOp);\n      return deferred.promise;\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 = error.stack || error.message || '';\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  /**\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    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(\n        'AsyncQueue is already failed: ' +\n          (this.failure.stack || this.failure.message)\n      );\n    }\n  }\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    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 will\n   *  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\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 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 { ListenSequence } from '../core/listen_sequence';\nimport { ListenSequenceNumber, TargetId } 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 { SortedMap } from '../util/sorted_map';\nimport { SortedSet } from '../util/sorted_set';\nimport { ignoreIfPrimaryLeaseLoss, LocalStore } from './local_store';\nimport {\n  GarbageCollectionScheduler,\n  PersistenceTransaction\n} from './persistence';\nimport { PersistencePromise } from './persistence_promise';\nimport { TargetData } from './target_data';\nimport { isIndexedDbTransactionError } from './simple_db';\n\nconst LOG_TAG = 'LruGarbageCollector';\n\n/**\n * Persistence layers intending to use LRU Garbage collection should have reference delegates that\n * implement this interface. This interface defines the operations that the LRU garbage collector\n * 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 `upperBound`, and are not\n   * present in the `activeTargetIds` set.\n   *\n   * @return 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 number less than or\n   * equal to the given `upperBound`.\n   *\n   * @return 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/**\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\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];\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 * 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\nconst GC_DID_NOT_RUN: LruResults = {\n  didRun: false,\n  sequenceNumbersCollected: 0,\n  targetsRemoved: 0,\n  documentsRemoved: 0\n};\n\nexport class LruParams {\n  static readonly COLLECTION_DISABLED = -1;\n  static readonly MINIMUM_CACHE_SIZE_BYTES = 1 * 1024 * 1024;\n  static readonly DEFAULT_CACHE_SIZE_BYTES = 40 * 1024 * 1024;\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    LruParams.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    LruParams.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\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/**\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 GarbageCollectionScheduler {\n  private hasRun: boolean = false;\n  private gcTask: DelayedOperation<void> | null;\n\n  constructor(\n    private readonly garbageCollector: LruGarbageCollector,\n    private readonly asyncQueue: AsyncQueue\n  ) {\n    this.gcTask = null;\n  }\n\n  start(localStore: LocalStore): void {\n    debugAssert(\n      this.gcTask === null,\n      'Cannot start an already started LruScheduler'\n    );\n    if (\n      this.garbageCollector.params.cacheSizeCollectionThreshold !==\n      LruParams.COLLECTION_DISABLED\n    ) {\n      this.scheduleGC(localStore);\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(localStore: LocalStore): void {\n    debugAssert(\n      this.gcTask === null,\n      'Cannot schedule GC while a task is pending'\n    );\n    const delay = this.hasRun ? REGULAR_GC_DELAY_MS : INITIAL_GC_DELAY_MS;\n    logDebug(\n      'LruGarbageCollector',\n      `Garbage collection scheduled in ${delay}ms`\n    );\n    this.gcTask = this.asyncQueue.enqueueAfterDelay(\n      TimerId.LruGarbageCollection,\n      delay,\n      async () => {\n        this.gcTask = null;\n        this.hasRun = true;\n        try {\n          await localStore.collectGarbage(this.garbageCollector);\n        } catch (e) {\n          if (isIndexedDbTransactionError(e)) {\n            logDebug(\n              LOG_TAG,\n              'Ignoring IndexedDB error during garbage collection: ',\n              e\n            );\n          } else {\n            await ignoreIfPrimaryLeaseLoss(e);\n          }\n        }\n        await this.scheduleGC(localStore);\n      }\n    );\n  }\n}\n\n/** Implements the steps for LRU garbage collection. */\nexport class LruGarbageCollector {\n  constructor(\n    private readonly delegate: LruDelegate,\n    readonly params: LruParams\n  ) {}\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    return this.delegate.getSequenceNumberCount(txn).next(targetCount => {\n      return Math.floor((percentile / 100.0) * targetCount);\n    });\n  }\n\n  /** Returns the nth sequence number, counting in order from the smallest. */\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  /**\n   * Removes targets with a sequence number equal to or less than the given upper bound, and removes\n   * document associations with those targets.\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  /**\n   * Removes documents that have a sequence number equal to or less than the upper bound and are not\n   * otherwise pinned.\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 (\n      this.params.cacheSizeCollectionThreshold === LruParams.COLLECTION_DISABLED\n    ) {\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 = this.params\n            .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","/**\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 '../api/timestamp';\nimport { User } from '../auth/user';\nimport { Query } from '../core/query';\nimport { SnapshotVersion } from '../core/snapshot_version';\nimport { Target } from '../core/target';\nimport { BatchId, TargetId } from '../core/types';\nimport {\n  DocumentKeySet,\n  documentKeySet,\n  DocumentMap,\n  maybeDocumentMap,\n  MaybeDocumentMap\n} from '../model/collections';\nimport { MaybeDocument, NoDocument } from '../model/document';\nimport { DocumentKey } from '../model/document_key';\nimport { Mutation, PatchMutation, Precondition } from '../model/mutation';\nimport {\n  BATCHID_UNKNOWN,\n  MutationBatch,\n  MutationBatchResult\n} from '../model/mutation_batch';\nimport { RemoteEvent, TargetChange } from '../remote/remote_event';\nimport { hardAssert, debugAssert } from '../util/assert';\nimport { Code, FirestoreError } from '../util/error';\nimport { logDebug } from '../util/log';\nimport { primitiveComparator } from '../util/misc';\nimport { ObjectMap } from '../util/obj_map';\nimport { SortedMap } from '../util/sorted_map';\n\nimport { LocalDocumentsView } from './local_documents_view';\nimport { LocalViewChanges } from './local_view_changes';\nimport { LruGarbageCollector, LruResults } from './lru_garbage_collector';\nimport { MutationQueue } from './mutation_queue';\nimport {\n  Persistence,\n  PersistenceTransaction,\n  PRIMARY_LEASE_LOST_ERROR_MSG\n} from './persistence';\nimport { PersistencePromise } from './persistence_promise';\nimport { TargetCache } from './target_cache';\nimport { QueryEngine } from './query_engine';\nimport { RemoteDocumentCache } from './remote_document_cache';\nimport { RemoteDocumentChangeBuffer } from './remote_document_change_buffer';\nimport { ClientId } from './shared_client_state';\nimport { TargetData, TargetPurpose } from './target_data';\nimport { ByteString } from '../util/byte_string';\nimport { IndexedDbPersistence } from './indexeddb_persistence';\nimport { IndexedDbMutationQueue } from './indexeddb_mutation_queue';\nimport { IndexedDbRemoteDocumentCache } from './indexeddb_remote_document_cache';\nimport { IndexedDbTargetCache } from './indexeddb_target_cache';\nimport { extractFieldMask } from '../model/object_value';\nimport { isIndexedDbTransactionError } from './simple_db';\n\nconst LOG_TAG = 'LocalStore';\n\n/** The result of a write to the local store. */\nexport interface LocalWriteResult {\n  batchId: BatchId;\n  changes: MaybeDocumentMap;\n}\n\n/** The result of a user-change operation in the local store. */\nexport interface UserChangeResult {\n  readonly affectedDocuments: MaybeDocumentMap;\n  readonly removedBatchIds: BatchId[];\n  readonly addedBatchIds: BatchId[];\n}\n\n/** The result of executing a query against the local store. */\nexport interface QueryResult {\n  readonly documents: DocumentMap;\n  readonly remoteKeys: DocumentKeySet;\n}\n\n/**\n * Local storage in the Firestore client. Coordinates persistence components\n * like the mutation queue and remote document cache to present a\n * latency-compensated view of stored data.\n *\n * The LocalStore is responsible for accepting mutations from the Sync Engine.\n * Writes from the client are put into a queue as provisional Mutations until\n * they are processed by the RemoteStore and confirmed as having been written\n * to the server.\n *\n * The local store provides the local version of documents that have been\n * modified locally. It maintains the constraint:\n *\n *   LocalDocument = RemoteDocument + Active(LocalMutations)\n *\n * (Active mutations are those that are enqueued and have not been previously\n * acknowledged or rejected).\n *\n * The RemoteDocument (\"ground truth\") state is provided via the\n * applyChangeBatch method. It will be some version of a server-provided\n * document OR will be a server-provided document PLUS acknowledged mutations:\n *\n *   RemoteDocument' = RemoteDocument + Acknowledged(LocalMutations)\n *\n * Note that this \"dirty\" version of a RemoteDocument will not be identical to a\n * server base version, since it has LocalMutations added to it pending getting\n * an authoritative copy from the server.\n *\n * Since LocalMutations can be rejected by the server, we have to be able to\n * revert a LocalMutation that has already been applied to the LocalDocument\n * (typically done by replaying all remaining LocalMutations to the\n * RemoteDocument to re-apply).\n *\n * The LocalStore is responsible for the garbage collection of the documents it\n * contains. For now, it every doc referenced by a view, the mutation queue, or\n * the RemoteStore.\n *\n * It also maintains the persistence of mapping queries to resume tokens and\n * target ids. It needs to know this data about queries to properly know what\n * docs it would be allowed to garbage collect.\n *\n * The LocalStore must be able to efficiently execute queries against its local\n * cache of the documents, to provide the initial set of results before any\n * remote changes have been received.\n *\n * Note: In TypeScript, most methods return Promises since the implementation\n * may rely on fetching data from IndexedDB which is async.\n * These Promises will only be rejected on an I/O error or other internal\n * (unexpected) failure (e.g. failed assert) and always represent an\n * unrecoverable error (should be caught / reported by the async_queue).\n */\nexport class LocalStore {\n  /**\n   * The maximum time to leave a resume token buffered without writing it out.\n   * This value is arbitrary: it's long enough to avoid several writes\n   * (possibly indefinitely if updates come more frequently than this) but\n   * short enough that restarting after crashing will still have a pretty\n   * recent resume token.\n   */\n  private static readonly RESUME_TOKEN_MAX_AGE_MICROS = 5 * 60 * 1e6;\n\n  /**\n   * The set of all mutations that have been sent but not yet been applied to\n   * the backend.\n   */\n  protected mutationQueue: MutationQueue;\n\n  /** The set of all cached remote documents. */\n  protected remoteDocuments: RemoteDocumentCache;\n\n  /**\n   * The \"local\" view of all documents (layering mutationQueue on top of\n   * remoteDocumentCache).\n   */\n  protected localDocuments: LocalDocumentsView;\n\n  /** Maps a target to its `TargetData`. */\n  protected targetCache: TargetCache;\n\n  /**\n   * Maps a targetID to data about its target.\n   *\n   * PORTING NOTE: We are using an immutable data structure on Web to make re-runs\n   * of `applyRemoteEvent()` idempotent.\n   */\n  protected targetDataByTarget = new SortedMap<TargetId, TargetData>(\n    primitiveComparator\n  );\n\n  /** Maps a target to its targetID. */\n  // TODO(wuandy): Evaluate if TargetId can be part of Target.\n  private targetIdByTarget = new ObjectMap<Target, TargetId>(t =>\n    t.canonicalId()\n  );\n\n  /**\n   * The read time of the last entry processed by `getNewDocumentChanges()`.\n   *\n   * PORTING NOTE: This is only used for multi-tab synchronization.\n   */\n  protected lastDocumentChangeReadTime = SnapshotVersion.min();\n\n  constructor(\n    /** Manages our in-memory or durable persistence. */\n    protected persistence: Persistence,\n    private queryEngine: QueryEngine,\n    initialUser: User\n  ) {\n    debugAssert(\n      persistence.started,\n      'LocalStore was passed an unstarted persistence implementation'\n    );\n    this.mutationQueue = persistence.getMutationQueue(initialUser);\n    this.remoteDocuments = persistence.getRemoteDocumentCache();\n    this.targetCache = persistence.getTargetCache();\n    this.localDocuments = new LocalDocumentsView(\n      this.remoteDocuments,\n      this.mutationQueue,\n      this.persistence.getIndexManager()\n    );\n    this.queryEngine.setLocalDocumentsView(this.localDocuments);\n  }\n\n  /** Starts the LocalStore. */\n  start(): Promise<void> {\n    return Promise.resolve();\n  }\n\n  /**\n   * Tells the LocalStore that the currently authenticated user has changed.\n   *\n   * In response the local store switches the mutation queue to the new user and\n   * returns any resulting document changes.\n   */\n  // PORTING NOTE: Android and iOS only return the documents affected by the\n  // change.\n  async handleUserChange(user: User): Promise<UserChangeResult> {\n    let newMutationQueue = this.mutationQueue;\n    let newLocalDocuments = this.localDocuments;\n\n    const result = await this.persistence.runTransaction(\n      'Handle user change',\n      'readonly',\n      txn => {\n        // Swap out the mutation queue, grabbing the pending mutation batches\n        // before and after.\n        let oldBatches: MutationBatch[];\n        return this.mutationQueue\n          .getAllMutationBatches(txn)\n          .next(promisedOldBatches => {\n            oldBatches = promisedOldBatches;\n\n            newMutationQueue = this.persistence.getMutationQueue(user);\n\n            // Recreate our LocalDocumentsView using the new\n            // MutationQueue.\n            newLocalDocuments = new LocalDocumentsView(\n              this.remoteDocuments,\n              newMutationQueue,\n              this.persistence.getIndexManager()\n            );\n            return newMutationQueue.getAllMutationBatches(txn);\n          })\n          .next(newBatches => {\n            const removedBatchIds: BatchId[] = [];\n            const addedBatchIds: BatchId[] = [];\n\n            // Union the old/new changed keys.\n            let changedKeys = documentKeySet();\n\n            for (const batch of oldBatches) {\n              removedBatchIds.push(batch.batchId);\n              for (const mutation of batch.mutations) {\n                changedKeys = changedKeys.add(mutation.key);\n              }\n            }\n\n            for (const batch of newBatches) {\n              addedBatchIds.push(batch.batchId);\n              for (const mutation of batch.mutations) {\n                changedKeys = changedKeys.add(mutation.key);\n              }\n            }\n\n            // Return the set of all (potentially) changed documents and the list\n            // of mutation batch IDs that were affected by change.\n            return newLocalDocuments\n              .getDocuments(txn, changedKeys)\n              .next(affectedDocuments => {\n                return {\n                  affectedDocuments,\n                  removedBatchIds,\n                  addedBatchIds\n                };\n              });\n          });\n      }\n    );\n\n    this.mutationQueue = newMutationQueue;\n    this.localDocuments = newLocalDocuments;\n    this.queryEngine.setLocalDocumentsView(this.localDocuments);\n\n    return result;\n  }\n\n  /* Accept locally generated Mutations and commit them to storage. */\n  localWrite(mutations: Mutation[]): Promise<LocalWriteResult> {\n    const localWriteTime = Timestamp.now();\n    const keys = mutations.reduce(\n      (keys, m) => keys.add(m.key),\n      documentKeySet()\n    );\n\n    let existingDocs: MaybeDocumentMap;\n\n    return this.persistence\n      .runTransaction('Locally write mutations', 'readwrite', txn => {\n        // Load and apply all existing mutations. This lets us compute the\n        // current base state for all non-idempotent transforms before applying\n        // any additional user-provided writes.\n        return this.localDocuments.getDocuments(txn, keys).next(docs => {\n          existingDocs = docs;\n\n          // For non-idempotent mutations (such as `FieldValue.increment()`),\n          // we record the base state in a separate patch mutation. This is\n          // later used to guarantee consistent values and prevents flicker\n          // even if the backend sends us an update that already includes our\n          // transform.\n          const baseMutations: Mutation[] = [];\n\n          for (const mutation of mutations) {\n            const baseValue = mutation.extractBaseValue(\n              existingDocs.get(mutation.key)\n            );\n            if (baseValue != null) {\n              // NOTE: The base state should only be applied if there's some\n              // existing document to override, so use a Precondition of\n              // exists=true\n              baseMutations.push(\n                new PatchMutation(\n                  mutation.key,\n                  baseValue,\n                  extractFieldMask(baseValue.proto.mapValue!),\n                  Precondition.exists(true)\n                )\n              );\n            }\n          }\n\n          return this.mutationQueue.addMutationBatch(\n            txn,\n            localWriteTime,\n            baseMutations,\n            mutations\n          );\n        });\n      })\n      .then(batch => {\n        const changes = batch.applyToLocalDocumentSet(existingDocs);\n        return { batchId: batch.batchId, changes };\n      });\n  }\n\n  /**\n   * Acknowledge the given batch.\n   *\n   * On the happy path when a batch is acknowledged, the local store will\n   *\n   *  + remove the batch from the mutation queue;\n   *  + apply the changes to the remote document cache;\n   *  + recalculate the latency compensated view implied by those changes (there\n   *    may be mutations in the queue that affect the documents but haven't been\n   *    acknowledged yet); and\n   *  + give the changed documents back the sync engine\n   *\n   * @returns The resulting (modified) documents.\n   */\n  acknowledgeBatch(\n    batchResult: MutationBatchResult\n  ): Promise<MaybeDocumentMap> {\n    return this.persistence.runTransaction(\n      'Acknowledge batch',\n      'readwrite-primary',\n      txn => {\n        const affected = batchResult.batch.keys();\n        const documentBuffer = this.remoteDocuments.newChangeBuffer({\n          trackRemovals: true // Make sure document removals show up in `getNewDocumentChanges()`\n        });\n        return this.mutationQueue\n          .acknowledgeBatch(txn, batchResult.batch, batchResult.streamToken)\n          .next(() =>\n            this.applyWriteToRemoteDocuments(txn, batchResult, documentBuffer)\n          )\n          .next(() => documentBuffer.apply(txn))\n          .next(() => this.mutationQueue.performConsistencyCheck(txn))\n          .next(() => this.localDocuments.getDocuments(txn, affected));\n      }\n    );\n  }\n\n  /**\n   * Remove mutations from the MutationQueue for the specified batch;\n   * LocalDocuments will be recalculated.\n   *\n   * @returns The resulting modified documents.\n   */\n  rejectBatch(batchId: BatchId): Promise<MaybeDocumentMap> {\n    return this.persistence.runTransaction(\n      'Reject batch',\n      'readwrite-primary',\n      txn => {\n        let affectedKeys: DocumentKeySet;\n        return this.mutationQueue\n          .lookupMutationBatch(txn, batchId)\n          .next((batch: MutationBatch | null) => {\n            hardAssert(batch !== null, 'Attempt to reject nonexistent batch!');\n            affectedKeys = batch.keys();\n            return this.mutationQueue.removeMutationBatch(txn, batch);\n          })\n          .next(() => {\n            return this.mutationQueue.performConsistencyCheck(txn);\n          })\n          .next(() => {\n            return this.localDocuments.getDocuments(txn, affectedKeys);\n          });\n      }\n    );\n  }\n\n  /**\n   * Returns the largest (latest) batch id in mutation queue that is pending server response.\n   * Returns `BATCHID_UNKNOWN` if the queue is empty.\n   */\n  getHighestUnacknowledgedBatchId(): Promise<BatchId> {\n    return this.persistence.runTransaction(\n      'Get highest unacknowledged batch id',\n      'readonly',\n      txn => {\n        return this.mutationQueue.getHighestUnacknowledgedBatchId(txn);\n      }\n    );\n  }\n\n  /** Returns the last recorded stream token for the current user. */\n  getLastStreamToken(): Promise<ByteString> {\n    return this.persistence.runTransaction(\n      'Get last stream token',\n      'readonly',\n      txn => {\n        return this.mutationQueue.getLastStreamToken(txn);\n      }\n    );\n  }\n\n  /**\n   * Sets the stream token for the current user without acknowledging any\n   * mutation batch. This is usually only useful after a stream handshake or in\n   * response to an error that requires clearing the stream token.\n   */\n  setLastStreamToken(streamToken: ByteString): Promise<void> {\n    return this.persistence.runTransaction(\n      'Set last stream token',\n      'readwrite-primary',\n      txn => {\n        return this.mutationQueue.setLastStreamToken(txn, streamToken);\n      }\n    );\n  }\n\n  /**\n   * Returns the last consistent snapshot processed (used by the RemoteStore to\n   * determine whether to buffer incoming snapshots from the backend).\n   */\n  getLastRemoteSnapshotVersion(): Promise<SnapshotVersion> {\n    return this.persistence.runTransaction(\n      'Get last remote snapshot version',\n      'readonly',\n      txn => this.targetCache.getLastRemoteSnapshotVersion(txn)\n    );\n  }\n\n  /**\n   * Update the \"ground-state\" (remote) documents. We assume that the remote\n   * event reflects any write batches that have been acknowledged or rejected\n   * (i.e. we do not re-apply local mutations to updates from this event).\n   *\n   * LocalDocuments are re-calculated if there are remaining mutations in the\n   * queue.\n   */\n  applyRemoteEvent(remoteEvent: RemoteEvent): Promise<MaybeDocumentMap> {\n    const remoteVersion = remoteEvent.snapshotVersion;\n    let newTargetDataByTargetMap = this.targetDataByTarget;\n\n    return this.persistence\n      .runTransaction('Apply remote event', 'readwrite-primary', txn => {\n        const documentBuffer = this.remoteDocuments.newChangeBuffer({\n          trackRemovals: true // Make sure document removals show up in `getNewDocumentChanges()`\n        });\n\n        // Reset newTargetDataByTargetMap in case this transaction gets re-run.\n        newTargetDataByTargetMap = this.targetDataByTarget;\n\n        const promises = [] as Array<PersistencePromise<void>>;\n        remoteEvent.targetChanges.forEach((change, targetId) => {\n          const oldTargetData = newTargetDataByTargetMap.get(targetId);\n          if (!oldTargetData) {\n            return;\n          }\n\n          // Only update the remote keys if the target is still active. This\n          // ensures that we can persist the updated target data along with\n          // the updated assignment.\n          promises.push(\n            this.targetCache\n              .removeMatchingKeys(txn, change.removedDocuments, targetId)\n              .next(() => {\n                return this.targetCache.addMatchingKeys(\n                  txn,\n                  change.addedDocuments,\n                  targetId\n                );\n              })\n          );\n\n          const resumeToken = change.resumeToken;\n          // Update the resume token if the change includes one.\n          if (resumeToken.approximateByteSize() > 0) {\n            const newTargetData = oldTargetData\n              .withResumeToken(resumeToken, remoteVersion)\n              .withSequenceNumber(txn.currentSequenceNumber);\n            newTargetDataByTargetMap = newTargetDataByTargetMap.insert(\n              targetId,\n              newTargetData\n            );\n\n            // Update the target data if there are target changes (or if\n            // sufficient time has passed since the last update).\n            if (\n              LocalStore.shouldPersistTargetData(\n                oldTargetData,\n                newTargetData,\n                change\n              )\n            ) {\n              promises.push(\n                this.targetCache.updateTargetData(txn, newTargetData)\n              );\n            }\n          }\n        });\n\n        let changedDocs = maybeDocumentMap();\n        let updatedKeys = documentKeySet();\n        remoteEvent.documentUpdates.forEach((key, doc) => {\n          updatedKeys = updatedKeys.add(key);\n        });\n\n        // Each loop iteration only affects its \"own\" doc, so it's safe to get all the remote\n        // documents in advance in a single call.\n        promises.push(\n          documentBuffer.getEntries(txn, updatedKeys).next(existingDocs => {\n            remoteEvent.documentUpdates.forEach((key, doc) => {\n              const existingDoc = existingDocs.get(key);\n\n              // Note: The order of the steps below is important, since we want\n              // to ensure that rejected limbo resolutions (which fabricate\n              // NoDocuments with SnapshotVersion.min()) never add documents to\n              // cache.\n              if (\n                doc instanceof NoDocument &&\n                doc.version.isEqual(SnapshotVersion.min())\n              ) {\n                // NoDocuments with SnapshotVersion.min() are used in manufactured\n                // events. We remove these documents from cache since we lost\n                // access.\n                documentBuffer.removeEntry(key, remoteVersion);\n                changedDocs = changedDocs.insert(key, doc);\n              } else if (\n                existingDoc == null ||\n                doc.version.compareTo(existingDoc.version) > 0 ||\n                (doc.version.compareTo(existingDoc.version) === 0 &&\n                  existingDoc.hasPendingWrites)\n              ) {\n                debugAssert(\n                  !SnapshotVersion.min().isEqual(remoteVersion),\n                  'Cannot add a document when the remote version is zero'\n                );\n                documentBuffer.addEntry(doc, remoteVersion);\n                changedDocs = changedDocs.insert(key, doc);\n              } else {\n                logDebug(\n                  LOG_TAG,\n                  'Ignoring outdated watch update for ',\n                  key,\n                  '. Current version:',\n                  existingDoc.version,\n                  ' Watch version:',\n                  doc.version\n                );\n              }\n\n              if (remoteEvent.resolvedLimboDocuments.has(key)) {\n                promises.push(\n                  this.persistence.referenceDelegate.updateLimboDocument(\n                    txn,\n                    key\n                  )\n                );\n              }\n            });\n          })\n        );\n\n        // HACK: The only reason we allow a null snapshot version is so that we\n        // can synthesize remote events when we get permission denied errors while\n        // trying to resolve the state of a locally cached document that is in\n        // limbo.\n        if (!remoteVersion.isEqual(SnapshotVersion.min())) {\n          const updateRemoteVersion = this.targetCache\n            .getLastRemoteSnapshotVersion(txn)\n            .next(lastRemoteSnapshotVersion => {\n              debugAssert(\n                remoteVersion.compareTo(lastRemoteSnapshotVersion) >= 0,\n                'Watch stream reverted to previous snapshot?? ' +\n                  remoteVersion +\n                  ' < ' +\n                  lastRemoteSnapshotVersion\n              );\n              return this.targetCache.setTargetsMetadata(\n                txn,\n                txn.currentSequenceNumber,\n                remoteVersion\n              );\n            });\n          promises.push(updateRemoteVersion);\n        }\n\n        return PersistencePromise.waitFor(promises)\n          .next(() => documentBuffer.apply(txn))\n          .next(() => {\n            return this.localDocuments.getLocalViewOfDocuments(\n              txn,\n              changedDocs\n            );\n          });\n      })\n      .then(changedDocs => {\n        this.targetDataByTarget = newTargetDataByTargetMap;\n        return changedDocs;\n      });\n  }\n\n  /**\n   * Returns true if the newTargetData should be persisted during an update of\n   * an active target. TargetData should always be persisted when a target is\n   * being released and should not call this function.\n   *\n   * While the target is active, TargetData updates can be omitted when nothing\n   * about the target has changed except metadata like the resume token or\n   * snapshot version. Occasionally it's worth the extra write to prevent these\n   * values from getting too stale after a crash, but this doesn't have to be\n   * too frequent.\n   */\n  private static shouldPersistTargetData(\n    oldTargetData: TargetData,\n    newTargetData: TargetData,\n    change: TargetChange\n  ): boolean {\n    hardAssert(\n      newTargetData.resumeToken.approximateByteSize() > 0,\n      'Attempted to persist target data with no resume token'\n    );\n\n    // Always persist target data if we don't already have a resume token.\n    if (oldTargetData.resumeToken.approximateByteSize() === 0) {\n      return true;\n    }\n\n    // Don't allow resume token changes to be buffered indefinitely. This\n    // allows us to be reasonably up-to-date after a crash and avoids needing\n    // to loop over all active queries on shutdown. Especially in the browser\n    // we may not get time to do anything interesting while the current tab is\n    // closing.\n    const timeDelta =\n      newTargetData.snapshotVersion.toMicroseconds() -\n      oldTargetData.snapshotVersion.toMicroseconds();\n    if (timeDelta >= this.RESUME_TOKEN_MAX_AGE_MICROS) {\n      return true;\n    }\n\n    // Otherwise if the only thing that has changed about a target is its resume\n    // token it's not worth persisting. Note that the RemoteStore keeps an\n    // in-memory view of the currently active targets which includes the current\n    // resume token, so stream failure or user changes will still use an\n    // up-to-date resume token regardless of what we do here.\n    const changes =\n      change.addedDocuments.size +\n      change.modifiedDocuments.size +\n      change.removedDocuments.size;\n    return changes > 0;\n  }\n\n  /**\n   * Notify local store of the changed views to locally pin documents.\n   */\n  async notifyLocalViewChanges(viewChanges: LocalViewChanges[]): Promise<void> {\n    try {\n      await this.persistence.runTransaction(\n        'notifyLocalViewChanges',\n        'readwrite',\n        txn => {\n          return PersistencePromise.forEach(\n            viewChanges,\n            (viewChange: LocalViewChanges) => {\n              return PersistencePromise.forEach(\n                viewChange.addedKeys,\n                (key: DocumentKey) =>\n                  this.persistence.referenceDelegate.addReference(\n                    txn,\n                    viewChange.targetId,\n                    key\n                  )\n              ).next(() =>\n                PersistencePromise.forEach(\n                  viewChange.removedKeys,\n                  (key: DocumentKey) =>\n                    this.persistence.referenceDelegate.removeReference(\n                      txn,\n                      viewChange.targetId,\n                      key\n                    )\n                )\n              );\n            }\n          );\n        }\n      );\n    } catch (e) {\n      if (isIndexedDbTransactionError(e)) {\n        // If `notifyLocalViewChanges` fails, we did not advance the sequence\n        // number for the documents that were included in this transaction.\n        // This might trigger them to be deleted earlier than they otherwise\n        // would have, but it should not invalidate the integrity of the data.\n        logDebug(LOG_TAG, 'Failed to update sequence numbers: ' + e);\n      } else {\n        throw e;\n      }\n    }\n\n    for (const viewChange of viewChanges) {\n      const targetId = viewChange.targetId;\n\n      if (!viewChange.fromCache) {\n        const targetData = this.targetDataByTarget.get(targetId);\n        debugAssert(\n          targetData !== null,\n          `Can't set limbo-free snapshot version for unknown target: ${targetId}`\n        );\n\n        // Advance the last limbo free snapshot version\n        const lastLimboFreeSnapshotVersion = targetData.snapshotVersion;\n        const updatedTargetData = targetData.withLastLimboFreeSnapshotVersion(\n          lastLimboFreeSnapshotVersion\n        );\n        this.targetDataByTarget = this.targetDataByTarget.insert(\n          targetId,\n          updatedTargetData\n        );\n      }\n    }\n  }\n\n  /**\n   * Gets the mutation batch after the passed in batchId in the mutation queue\n   * or null if empty.\n   * @param afterBatchId If provided, the batch to search after.\n   * @returns The next mutation or null if there wasn't one.\n   */\n  nextMutationBatch(afterBatchId?: BatchId): Promise<MutationBatch | null> {\n    return this.persistence.runTransaction(\n      'Get next mutation batch',\n      'readonly',\n      txn => {\n        if (afterBatchId === undefined) {\n          afterBatchId = BATCHID_UNKNOWN;\n        }\n        return this.mutationQueue.getNextMutationBatchAfterBatchId(\n          txn,\n          afterBatchId\n        );\n      }\n    );\n  }\n\n  /**\n   * Read the current value of a Document with a given key or null if not\n   * found - used for testing.\n   */\n  readDocument(key: DocumentKey): Promise<MaybeDocument | null> {\n    return this.persistence.runTransaction('read document', 'readonly', txn => {\n      return this.localDocuments.getDocument(txn, key);\n    });\n  }\n\n  /**\n   * Assigns the given target an internal ID so that its results can be pinned so\n   * they don't get GC'd. A target must be allocated in the local store before\n   * the store can be used to manage its view.\n   *\n   * Allocating an already allocated `Target` will return the existing `TargetData`\n   * for that `Target`.\n   */\n  allocateTarget(target: Target): Promise<TargetData> {\n    return this.persistence\n      .runTransaction('Allocate target', 'readwrite', txn => {\n        let targetData: TargetData;\n        return this.targetCache\n          .getTargetData(txn, target)\n          .next((cached: TargetData | null) => {\n            if (cached) {\n              // This target has been listened to previously, so reuse the\n              // previous targetID.\n              // TODO(mcg): freshen last accessed date?\n              targetData = cached;\n              return PersistencePromise.resolve(targetData);\n            } else {\n              return this.targetCache.allocateTargetId(txn).next(targetId => {\n                targetData = new TargetData(\n                  target,\n                  targetId,\n                  TargetPurpose.Listen,\n                  txn.currentSequenceNumber\n                );\n                return this.targetCache\n                  .addTargetData(txn, targetData)\n                  .next(() => targetData);\n              });\n            }\n          });\n      })\n      .then(targetData => {\n        if (this.targetDataByTarget.get(targetData.targetId) === null) {\n          this.targetDataByTarget = this.targetDataByTarget.insert(\n            targetData.targetId,\n            targetData\n          );\n          this.targetIdByTarget.set(target, targetData.targetId);\n        }\n        return targetData;\n      });\n  }\n\n  /**\n   * Returns the TargetData as seen by the LocalStore, including updates that may\n   * have not yet been persisted to the TargetCache.\n   */\n  // Visible for testing.\n  getTargetData(\n    transaction: PersistenceTransaction,\n    target: Target\n  ): PersistencePromise<TargetData | null> {\n    const targetId = this.targetIdByTarget.get(target);\n    if (targetId !== undefined) {\n      return PersistencePromise.resolve<TargetData | null>(\n        this.targetDataByTarget.get(targetId)\n      );\n    } else {\n      return this.targetCache.getTargetData(transaction, target);\n    }\n  }\n\n  /**\n   * Unpin all the documents associated with the given target. If\n   * `keepPersistedTargetData` is set to false and Eager GC enabled, the method\n   * directly removes the associated target data from the target cache.\n   *\n   * Releasing a non-existing `Target` is a no-op.\n   */\n  // PORTING NOTE: `keepPersistedTargetData` is multi-tab only.\n  releaseTarget(\n    targetId: number,\n    keepPersistedTargetData: boolean\n  ): Promise<void> {\n    const targetData = this.targetDataByTarget.get(targetId);\n    debugAssert(\n      targetData !== null,\n      `Tried to release nonexistent target: ${targetId}`\n    );\n\n    const mode = keepPersistedTargetData ? 'readwrite' : 'readwrite-primary';\n    return this.persistence\n      .runTransaction('Release target', mode, txn => {\n        if (!keepPersistedTargetData) {\n          return this.persistence.referenceDelegate.removeTarget(\n            txn,\n            targetData!\n          );\n        } else {\n          return PersistencePromise.resolve();\n        }\n      })\n      .then(() => {\n        this.targetDataByTarget = this.targetDataByTarget.remove(targetId);\n        this.targetIdByTarget.delete(targetData!.target);\n      });\n  }\n\n  /**\n   * Runs the specified query against the local store and returns the results,\n   * potentially taking advantage of query data from previous executions (such\n   * as the set of remote keys).\n   *\n   * @param usePreviousResults Whether results from previous executions can\n   * be used to optimize this query execution.\n   */\n  executeQuery(\n    query: Query,\n    usePreviousResults: boolean\n  ): Promise<QueryResult> {\n    let lastLimboFreeSnapshotVersion = SnapshotVersion.min();\n    let remoteKeys = documentKeySet();\n\n    return this.persistence.runTransaction('Execute query', 'readonly', txn => {\n      return this.getTargetData(txn, query.toTarget())\n        .next(targetData => {\n          if (targetData) {\n            lastLimboFreeSnapshotVersion =\n              targetData.lastLimboFreeSnapshotVersion;\n            return this.targetCache\n              .getMatchingKeysForTargetId(txn, targetData.targetId)\n              .next(result => {\n                remoteKeys = result;\n              });\n          }\n        })\n        .next(() =>\n          this.queryEngine.getDocumentsMatchingQuery(\n            txn,\n            query,\n            usePreviousResults\n              ? lastLimboFreeSnapshotVersion\n              : SnapshotVersion.min(),\n            usePreviousResults ? remoteKeys : documentKeySet()\n          )\n        )\n        .next(documents => {\n          return { documents, remoteKeys };\n        });\n    });\n  }\n\n  private applyWriteToRemoteDocuments(\n    txn: PersistenceTransaction,\n    batchResult: MutationBatchResult,\n    documentBuffer: RemoteDocumentChangeBuffer\n  ): PersistencePromise<void> {\n    const batch = batchResult.batch;\n    const docKeys = batch.keys();\n    let promiseChain = PersistencePromise.resolve();\n    docKeys.forEach(docKey => {\n      promiseChain = promiseChain\n        .next(() => {\n          return documentBuffer.getEntry(txn, docKey);\n        })\n        .next((remoteDoc: MaybeDocument | null) => {\n          let doc = remoteDoc;\n          const ackVersion = batchResult.docVersions.get(docKey);\n          hardAssert(\n            ackVersion !== null,\n            'ackVersions should contain every doc in the write.'\n          );\n          if (!doc || doc.version.compareTo(ackVersion!) < 0) {\n            doc = batch.applyToRemoteDocument(docKey, doc, batchResult);\n            if (!doc) {\n              debugAssert(\n                !remoteDoc,\n                'Mutation batch ' +\n                  batch +\n                  ' applied to document ' +\n                  remoteDoc +\n                  ' resulted in null'\n              );\n            } else {\n              // We use the commitVersion as the readTime rather than the\n              // document's updateTime since the updateTime is not advanced\n              // for updates that do not modify the underlying document.\n              documentBuffer.addEntry(doc, batchResult.commitVersion);\n            }\n          }\n        });\n    });\n    return promiseChain.next(() =>\n      this.mutationQueue.removeMutationBatch(txn, batch)\n    );\n  }\n\n  collectGarbage(garbageCollector: LruGarbageCollector): Promise<LruResults> {\n    return this.persistence.runTransaction(\n      'Collect garbage',\n      'readwrite-primary',\n      txn => garbageCollector.collect(txn, this.targetDataByTarget)\n    );\n  }\n}\n\n/**\n * An implementation of LocalStore that provides additional functionality\n * for MultiTabSyncEngine.\n */\n// PORTING NOTE: Web only.\nexport class MultiTabLocalStore extends LocalStore {\n  protected mutationQueue: IndexedDbMutationQueue;\n  protected remoteDocuments: IndexedDbRemoteDocumentCache;\n  protected targetCache: IndexedDbTargetCache;\n\n  constructor(\n    protected persistence: IndexedDbPersistence,\n    queryEngine: QueryEngine,\n    initialUser: User\n  ) {\n    super(persistence, queryEngine, initialUser);\n\n    this.mutationQueue = persistence.getMutationQueue(initialUser);\n    this.remoteDocuments = persistence.getRemoteDocumentCache();\n    this.targetCache = persistence.getTargetCache();\n  }\n\n  /** Starts the LocalStore. */\n  start(): Promise<void> {\n    return this.synchronizeLastDocumentChangeReadTime();\n  }\n\n  /** Returns the local view of the documents affected by a mutation batch. */\n  lookupMutationDocuments(batchId: BatchId): Promise<MaybeDocumentMap | null> {\n    return this.persistence.runTransaction(\n      'Lookup mutation documents',\n      'readonly',\n      txn => {\n        return this.mutationQueue\n          .lookupMutationKeys(txn, batchId)\n          .next(keys => {\n            if (keys) {\n              return this.localDocuments.getDocuments(\n                txn,\n                keys\n              ) as PersistencePromise<MaybeDocumentMap | null>;\n            } else {\n              return PersistencePromise.resolve<MaybeDocumentMap | null>(null);\n            }\n          });\n      }\n    );\n  }\n\n  removeCachedMutationBatchMetadata(batchId: BatchId): void {\n    this.mutationQueue.removeCachedMutationKeys(batchId);\n  }\n\n  setNetworkEnabled(networkEnabled: boolean): void {\n    this.persistence.setNetworkEnabled(networkEnabled);\n  }\n\n  getActiveClients(): Promise<ClientId[]> {\n    return this.persistence.getActiveClients();\n  }\n\n  getTarget(targetId: TargetId): Promise<Target | null> {\n    const cachedTargetData = this.targetDataByTarget.get(targetId);\n\n    if (cachedTargetData) {\n      return Promise.resolve(cachedTargetData.target);\n    } else {\n      return this.persistence.runTransaction(\n        'Get target data',\n        'readonly',\n        txn => {\n          return this.targetCache\n            .getTargetDataForTarget(txn, targetId)\n            .next(targetData => (targetData ? targetData.target : null));\n        }\n      );\n    }\n  }\n\n  /**\n   * Returns the set of documents that have been updated since the last call.\n   * If this is the first call, returns the set of changes since client\n   * initialization. Further invocations will return document changes since\n   * the point of rejection.\n   */\n  getNewDocumentChanges(): Promise<MaybeDocumentMap> {\n    return this.persistence\n      .runTransaction('Get new document changes', 'readonly', txn =>\n        this.remoteDocuments.getNewDocumentChanges(\n          txn,\n          this.lastDocumentChangeReadTime\n        )\n      )\n      .then(({ changedDocs, readTime }) => {\n        this.lastDocumentChangeReadTime = readTime;\n        return changedDocs;\n      });\n  }\n\n  /**\n   * Reads the newest document change from persistence and forwards the internal\n   * synchronization marker so that calls to `getNewDocumentChanges()`\n   * only return changes that happened after client initialization.\n   */\n  async synchronizeLastDocumentChangeReadTime(): Promise<void> {\n    this.lastDocumentChangeReadTime = await this.persistence.runTransaction(\n      'Synchronize last document change read time',\n      'readonly',\n      txn => this.remoteDocuments.getLastReadTime(txn)\n    );\n  }\n}\n\n/**\n * Verifies the error thrown by a LocalStore operation. If a LocalStore\n * operation fails because the primary lease has been taken by another client,\n * we ignore the error (the persistence layer will immediately call\n * `applyPrimaryLease` to propagate the primary state change). All other errors\n * are re-thrown.\n *\n * @param err An error returned by a LocalStore operation.\n * @return A Promise that resolves after we recovered, or the original error.\n */\nexport async function ignoreIfPrimaryLeaseLoss(\n  err: FirestoreError\n): Promise<void> {\n  if (\n    err.code === Code.FAILED_PRECONDITION &&\n    err.message === PRIMARY_LEASE_LOST_ERROR_MSG\n  ) {\n    logDebug(LOG_TAG, 'Unexpectedly lost primary lease');\n  } else {\n    throw err;\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 { BatchId, TargetId } from '../core/types';\nimport { documentKeySet, DocumentKeySet } from '../model/collections';\nimport { DocumentKey } from '../model/document_key';\nimport { primitiveComparator } from '../util/misc';\nimport { SortedSet } from '../util/sorted_set';\n\n/**\n * A collection of references to a document from some kind of numbered entity\n * (either a target ID or batch ID). As references are added to or removed from\n * the set corresponding events are emitted to a registered garbage collector.\n *\n * Each reference is represented by a DocumentReference object. Each of them\n * contains enough information to uniquely identify the reference. They are all\n * stored primarily in a set sorted by key. A document is considered garbage if\n * there's no references in that set (this can be efficiently checked thanks to\n * sorting by key).\n *\n * ReferenceSet also keeps a secondary set that contains references sorted by\n * IDs. This one is used to efficiently implement removal of all references by\n * some target ID.\n */\nexport class ReferenceSet {\n  // A set of outstanding references to a document sorted by key.\n  private refsByKey = new SortedSet(DocReference.compareByKey);\n\n  // A set of outstanding references to a document sorted by target id.\n  private refsByTarget = new SortedSet(DocReference.compareByTargetId);\n\n  /** Returns true if the reference set contains no references. */\n  isEmpty(): boolean {\n    return this.refsByKey.isEmpty();\n  }\n\n  /** Adds a reference to the given document key for the given ID. */\n  addReference(key: DocumentKey, id: TargetId | BatchId): void {\n    const ref = new DocReference(key, id);\n    this.refsByKey = this.refsByKey.add(ref);\n    this.refsByTarget = this.refsByTarget.add(ref);\n  }\n\n  /** Add references to the given document keys for the given ID. */\n  addReferences(keys: DocumentKeySet, id: TargetId | BatchId): void {\n    keys.forEach(key => this.addReference(key, id));\n  }\n\n  /**\n   * Removes a reference to the given document key for the given\n   * ID.\n   */\n  removeReference(key: DocumentKey, id: TargetId | BatchId): void {\n    this.removeRef(new DocReference(key, id));\n  }\n\n  removeReferences(keys: DocumentKeySet, id: TargetId | BatchId): void {\n    keys.forEach(key => this.removeReference(key, id));\n  }\n\n  /**\n   * Clears all references with a given ID. Calls removeRef() for each key\n   * removed.\n   */\n  removeReferencesForId(id: TargetId | BatchId): DocumentKey[] {\n    const emptyKey = DocumentKey.EMPTY;\n    const startRef = new DocReference(emptyKey, id);\n    const endRef = new DocReference(emptyKey, id + 1);\n    const keys: DocumentKey[] = [];\n    this.refsByTarget.forEachInRange([startRef, endRef], ref => {\n      this.removeRef(ref);\n      keys.push(ref.key);\n    });\n    return keys;\n  }\n\n  removeAllReferences(): void {\n    this.refsByKey.forEach(ref => this.removeRef(ref));\n  }\n\n  private removeRef(ref: DocReference): void {\n    this.refsByKey = this.refsByKey.delete(ref);\n    this.refsByTarget = this.refsByTarget.delete(ref);\n  }\n\n  referencesForId(id: TargetId | BatchId): DocumentKeySet {\n    const emptyKey = DocumentKey.EMPTY;\n    const startRef = new DocReference(emptyKey, id);\n    const endRef = new DocReference(emptyKey, id + 1);\n    let keys = documentKeySet();\n    this.refsByTarget.forEachInRange([startRef, endRef], ref => {\n      keys = keys.add(ref.key);\n    });\n    return keys;\n  }\n\n  containsKey(key: DocumentKey): boolean {\n    const ref = new DocReference(key, 0);\n    const firstRef = this.refsByKey.firstAfterOrEqual(ref);\n    return firstRef !== null && key.isEqual(firstRef.key);\n  }\n}\n\nexport class DocReference {\n  constructor(\n    public key: DocumentKey,\n    public targetOrBatchId: TargetId | BatchId\n  ) {}\n\n  /** Compare by key then by ID */\n  static compareByKey(left: DocReference, right: DocReference): number {\n    return (\n      DocumentKey.comparator(left.key, right.key) ||\n      primitiveComparator(left.targetOrBatchId, right.targetOrBatchId)\n    );\n  }\n\n  /** Compare by ID then by key */\n  static compareByTargetId(left: DocReference, right: DocReference): number {\n    return (\n      primitiveComparator(left.targetOrBatchId, right.targetOrBatchId) ||\n      DocumentKey.comparator(left.key, right.key)\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 */\nimport { fail } from './assert';\nimport { Code, FirestoreError } from './error';\nimport { Dict, forEach } from './obj';\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\n/**\n * Validates that no arguments were passed in the invocation of functionName.\n *\n * Forward the magic \"arguments\" variable as second parameter on which the\n * parameter validation is performed:\n * validateNoArgs('myFunction', arguments);\n */\nexport function validateNoArgs(functionName: string, args: IArguments): void {\n  if (args.length !== 0) {\n    throw new FirestoreError(\n      Code.INVALID_ARGUMENT,\n      `Function ${functionName}() does not support arguments, ` +\n        'but was called with ' +\n        formatPlural(args.length, 'argument') +\n        '.'\n    );\n  }\n}\n\n/**\n * Validates the invocation of functionName has the exact number of arguments.\n *\n * Forward the magic \"arguments\" variable as second parameter on which the\n * parameter validation is performed:\n * validateExactNumberOfArgs('myFunction', arguments, 2);\n */\nexport function validateExactNumberOfArgs(\n  functionName: string,\n  args: IArguments,\n  numberOfArgs: number\n): void {\n  if (args.length !== numberOfArgs) {\n    throw new FirestoreError(\n      Code.INVALID_ARGUMENT,\n      `Function ${functionName}() requires ` +\n        formatPlural(numberOfArgs, 'argument') +\n        ', but was called with ' +\n        formatPlural(args.length, 'argument') +\n        '.'\n    );\n  }\n}\n\n/**\n * Validates the invocation of functionName has at least the provided number of\n * arguments (but can have many more).\n *\n * Forward the magic \"arguments\" variable as second parameter on which the\n * parameter validation is performed:\n * validateAtLeastNumberOfArgs('myFunction', arguments, 2);\n */\nexport function validateAtLeastNumberOfArgs(\n  functionName: string,\n  args: IArguments,\n  minNumberOfArgs: number\n): void {\n  if (args.length < minNumberOfArgs) {\n    throw new FirestoreError(\n      Code.INVALID_ARGUMENT,\n      `Function ${functionName}() requires at least ` +\n        formatPlural(minNumberOfArgs, 'argument') +\n        ', but was called with ' +\n        formatPlural(args.length, 'argument') +\n        '.'\n    );\n  }\n}\n\n/**\n * Validates the invocation of functionName has number of arguments between\n * the values provided.\n *\n * Forward the magic \"arguments\" variable as second parameter on which the\n * parameter validation is performed:\n * validateBetweenNumberOfArgs('myFunction', arguments, 2, 3);\n */\nexport function validateBetweenNumberOfArgs(\n  functionName: string,\n  args: IArguments,\n  minNumberOfArgs: number,\n  maxNumberOfArgs: number\n): void {\n  if (args.length < minNumberOfArgs || args.length > maxNumberOfArgs) {\n    throw new FirestoreError(\n      Code.INVALID_ARGUMENT,\n      `Function ${functionName}() requires between ${minNumberOfArgs} and ` +\n        `${maxNumberOfArgs} arguments, but was called with ` +\n        formatPlural(args.length, 'argument') +\n        '.'\n    );\n  }\n}\n\n/**\n * Validates the provided argument is an array and has as least the expected\n * number of elements.\n */\nexport function validateNamedArrayAtLeastNumberOfElements<T>(\n  functionName: string,\n  value: T[],\n  name: string,\n  minNumberOfElements: number\n): void {\n  if (!(value instanceof Array) || value.length < minNumberOfElements) {\n    throw new FirestoreError(\n      Code.INVALID_ARGUMENT,\n      `Function ${functionName}() requires its ${name} argument to be an ` +\n        'array with at least ' +\n        `${formatPlural(minNumberOfElements, 'element')}.`\n    );\n  }\n}\n\n/**\n * Validates the provided positional argument has the native JavaScript type\n * using typeof checks.\n */\nexport function validateArgType(\n  functionName: string,\n  type: ValidationType,\n  position: number,\n  argument: unknown\n): void {\n  validateType(functionName, type, `${ordinal(position)} argument`, argument);\n}\n\n/**\n * Validates the provided argument has the native JavaScript type using\n * typeof checks or is undefined.\n */\nexport function validateOptionalArgType(\n  functionName: string,\n  type: ValidationType,\n  position: number,\n  argument: unknown\n): void {\n  if (argument !== undefined) {\n    validateArgType(functionName, type, position, argument);\n  }\n}\n\n/**\n * Validates the provided named option has the native JavaScript type using\n * typeof checks.\n */\nexport function validateNamedType(\n  functionName: string,\n  type: ValidationType,\n  optionName: string,\n  argument: unknown\n): void {\n  validateType(functionName, type, `${optionName} option`, argument);\n}\n\n/**\n * Validates the provided named option has the native JavaScript type using\n * typeof checks or is undefined.\n */\nexport function validateNamedOptionalType(\n  functionName: string,\n  type: ValidationType,\n  optionName: string,\n  argument: unknown\n): void {\n  if (argument !== undefined) {\n    validateNamedType(functionName, type, optionName, argument);\n  }\n}\n\nexport function validateArrayElements<T>(\n  functionName: string,\n  optionName: string,\n  typeDescription: string,\n  argument: T[],\n  validator: (arg0: T) => boolean\n): void {\n  if (!(argument instanceof Array)) {\n    throw new FirestoreError(\n      Code.INVALID_ARGUMENT,\n      `Function ${functionName}() requires its ${optionName} ` +\n        `option to be an array, but it was: ${valueDescription(argument)}`\n    );\n  }\n\n  for (let i = 0; i < argument.length; ++i) {\n    if (!validator(argument[i])) {\n      throw new FirestoreError(\n        Code.INVALID_ARGUMENT,\n        `Function ${functionName}() requires all ${optionName} ` +\n          `elements to be ${typeDescription}, but the value at index ${i} ` +\n          `was: ${valueDescription(argument[i])}`\n      );\n    }\n  }\n}\n\nexport function validateOptionalArrayElements<T>(\n  functionName: string,\n  optionName: string,\n  typeDescription: string,\n  argument: T[] | undefined,\n  validator: (arg0: T) => boolean\n): void {\n  if (argument !== undefined) {\n    validateArrayElements(\n      functionName,\n      optionName,\n      typeDescription,\n      argument,\n      validator\n    );\n  }\n}\n\n/**\n * Validates that the provided named option equals one of the expected values.\n */\nexport function validateNamedPropertyEquals<T>(\n  functionName: string,\n  inputName: string,\n  optionName: string,\n  input: T,\n  expected: T[]\n): void {\n  const expectedDescription: string[] = [];\n\n  for (const val of expected) {\n    if (val === input) {\n      return;\n    }\n    expectedDescription.push(valueDescription(val));\n  }\n\n  const actualDescription = valueDescription(input);\n  throw new FirestoreError(\n    Code.INVALID_ARGUMENT,\n    `Invalid value ${actualDescription} provided to function ${functionName}() for option ` +\n      `\"${optionName}\". Acceptable values: ${expectedDescription.join(', ')}`\n  );\n}\n\n/**\n * Validates that the provided named option equals one of the expected values or\n * is undefined.\n */\nexport function validateNamedOptionalPropertyEquals<T>(\n  functionName: string,\n  inputName: string,\n  optionName: string,\n  input: T,\n  expected: T[]\n): void {\n  if (input !== undefined) {\n    validateNamedPropertyEquals(\n      functionName,\n      inputName,\n      optionName,\n      input,\n      expected\n    );\n  }\n}\n\n/**\n * Validates that the provided argument is a valid enum.\n *\n * @param functionName Function making the validation call.\n * @param enums Array containing all possible values for the enum.\n * @param position Position of the argument in `functionName`.\n * @param argument Argument to validate.\n * @return The value as T if the argument can be converted.\n */\nexport function validateStringEnum<T>(\n  functionName: string,\n  enums: T[],\n  position: number,\n  argument: unknown\n): T {\n  if (!enums.some(element => element === argument)) {\n    throw new FirestoreError(\n      Code.INVALID_ARGUMENT,\n      `Invalid value ${valueDescription(argument)} provided to function ` +\n        `${functionName}() for its ${ordinal(position)} argument. Acceptable ` +\n        `values: ${enums.join(', ')}`\n    );\n  }\n  return argument as T;\n}\n\n/** Helper to validate the type of a provided input. */\nfunction validateType(\n  functionName: string,\n  type: ValidationType,\n  inputName: string,\n  input: unknown\n): void {\n  let valid = false;\n  if (type === 'object') {\n    valid = isPlainObject(input);\n  } else if (type === 'non-empty string') {\n    valid = typeof input === 'string' && input !== '';\n  } else {\n    valid = typeof input === type;\n  }\n\n  if (!valid) {\n    const description = valueDescription(input);\n    throw new FirestoreError(\n      Code.INVALID_ARGUMENT,\n      `Function ${functionName}() requires its ${inputName} ` +\n        `to be of type ${type}, but it was: ${description}`\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/** Hacky method to try to get the constructor name for an object. */\nexport function tryGetCustomObjectType(input: object): string | null {\n  if (input.constructor) {\n    const funcNameRegex = /function\\s+([^\\s(]+)\\s*\\(/;\n    const results = funcNameRegex.exec(input.constructor.toString());\n    if (results && results.length > 1) {\n      return results[1];\n    }\n  }\n  return null;\n}\n\n/** Validates the provided argument is defined. */\nexport function validateDefined(\n  functionName: string,\n  position: number,\n  argument: unknown\n): void {\n  if (argument === undefined) {\n    throw new FirestoreError(\n      Code.INVALID_ARGUMENT,\n      `Function ${functionName}() requires a valid ${ordinal(position)} ` +\n        `argument, but it was undefined.`\n    );\n  }\n}\n\n/**\n * Validates the provided positional argument is an object, and its keys and\n * values match the expected keys and types provided in optionTypes.\n */\nexport function validateOptionNames(\n  functionName: string,\n  options: object,\n  optionNames: string[]\n): void {\n  forEach(options as Dict<unknown>, (key, _) => {\n    if (optionNames.indexOf(key) < 0) {\n      throw new FirestoreError(\n        Code.INVALID_ARGUMENT,\n        `Unknown option '${key}' passed to function ${functionName}(). ` +\n          'Available options: ' +\n          optionNames.join(', ')\n      );\n    }\n  });\n}\n\n/**\n * Helper method to throw an error that the provided argument did not pass\n * an instanceof check.\n */\nexport function invalidClassError(\n  functionName: string,\n  type: string,\n  position: number,\n  argument: unknown\n): Error {\n  const description = valueDescription(argument);\n  return new FirestoreError(\n    Code.INVALID_ARGUMENT,\n    `Function ${functionName}() requires its ${ordinal(position)} ` +\n      `argument to be a ${type}, but it was: ${description}`\n  );\n}\n\nexport function validatePositiveNumber(\n  functionName: string,\n  position: number,\n  n: number\n): void {\n  if (n <= 0) {\n    throw new FirestoreError(\n      Code.INVALID_ARGUMENT,\n      `Function ${functionName}() requires its ${ordinal(\n        position\n      )} argument to be a positive number, but it was: ${n}.`\n    );\n  }\n}\n\n/** Converts a number to its english word representation */\nfunction ordinal(num: number): string {\n  switch (num) {\n    case 1:\n      return 'first';\n    case 2:\n      return 'second';\n    case 3:\n      return 'third';\n    default:\n      return num + 'th';\n  }\n}\n\n/**\n * Formats the given word as plural conditionally given the preceding number.\n */\nfunction formatPlural(num: number, str: string): string {\n  return `${num} ${str}` + (num === 1 ? '' : 's');\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 { PlatformSupport } from '../platform/platform';\nimport { Code, FirestoreError } from '../util/error';\nimport {\n  invalidClassError,\n  validateArgType,\n  validateExactNumberOfArgs\n} from '../util/input_validation';\nimport { ByteString } from '../util/byte_string';\n\n/** Helper function to assert Uint8Array is available at runtime. */\nfunction assertUint8ArrayAvailable(): void {\n  if (typeof Uint8Array === 'undefined') {\n    throw new FirestoreError(\n      Code.UNIMPLEMENTED,\n      'Uint8Arrays are not available in this environment.'\n    );\n  }\n}\n\n/** Helper function to assert Base64 functions are available at runtime. */\nfunction assertBase64Available(): void {\n  if (!PlatformSupport.getPlatform().base64Available) {\n    throw new FirestoreError(\n      Code.UNIMPLEMENTED,\n      'Blobs are unavailable in Firestore in this environment.'\n    );\n  }\n}\n\n/**\n * Immutable class holding a blob (binary data).\n * This class is directly exposed in the public API.\n *\n * Note that while you can't hide the constructor in JavaScript code, we are\n * using the hack above to make sure no-one outside this module can call it.\n */\nexport class Blob {\n  // Prefix with underscore to signal that we consider this not part of the\n  // public API and to prevent it from showing up for autocompletion.\n  _byteString: ByteString;\n\n  constructor(byteString: ByteString) {\n    assertBase64Available();\n    this._byteString = byteString;\n  }\n\n  static fromBase64String(base64: string): Blob {\n    validateExactNumberOfArgs('Blob.fromBase64String', arguments, 1);\n    validateArgType('Blob.fromBase64String', 'string', 1, base64);\n    assertBase64Available();\n    try {\n      return new Blob(ByteString.fromBase64String(base64));\n    } catch (e) {\n      throw new FirestoreError(\n        Code.INVALID_ARGUMENT,\n        'Failed to construct Blob from Base64 string: ' + e\n      );\n    }\n  }\n\n  static fromUint8Array(array: Uint8Array): Blob {\n    validateExactNumberOfArgs('Blob.fromUint8Array', arguments, 1);\n    assertUint8ArrayAvailable();\n    if (!(array instanceof Uint8Array)) {\n      throw invalidClassError('Blob.fromUint8Array', 'Uint8Array', 1, array);\n    }\n    return new Blob(ByteString.fromUint8Array(array));\n  }\n\n  toBase64(): string {\n    validateExactNumberOfArgs('Blob.toBase64', arguments, 0);\n    assertBase64Available();\n    return this._byteString.toBase64();\n  }\n\n  toUint8Array(): Uint8Array {\n    validateExactNumberOfArgs('Blob.toUint8Array', arguments, 0);\n    assertUint8ArrayAvailable();\n    return this._byteString.toUint8Array();\n  }\n\n  toString(): string {\n    return 'Blob(base64: ' + this.toBase64() + ')';\n  }\n\n  isEqual(other: Blob): boolean {\n    return this._byteString.isEqual(other._byteString);\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 * as firestore from '@firebase/firestore-types';\n\nimport { FieldPath as InternalFieldPath } from '../model/path';\nimport { Code, FirestoreError } from '../util/error';\nimport {\n  invalidClassError,\n  validateArgType,\n  validateNamedArrayAtLeastNumberOfElements\n} from '../util/input_validation';\n\n// The objects that are a part of this API are exposed to third-parties as\n// compiled javascript so we want to flag our private members with a leading\n// underscore to discourage their use.\n\n/**\n * A FieldPath refers to a field in a document. The path may consist of a single\n * field name (referring to a top-level field in the document), or a list of\n * field names (referring to a nested field in the document).\n */\nexport class FieldPath implements firestore.FieldPath {\n  /** Internal representation of a Firestore field path. */\n  _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    validateNamedArrayAtLeastNumberOfElements(\n      'FieldPath',\n      fieldNames,\n      'fieldNames',\n      1\n    );\n\n    for (let i = 0; i < fieldNames.length; ++i) {\n      validateArgType('FieldPath', 'string', i, fieldNames[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   * Internal Note: The backend doesn't technically support querying by\n   * document ID. Instead it queries by the entire document name (full path\n   * included), but in the cases we currently support documentId(), the net\n   * effect is the same.\n   */\n  private static readonly _DOCUMENT_ID = new FieldPath(\n    InternalFieldPath.keyField().canonicalString()\n  );\n\n  static documentId(): FieldPath {\n    return FieldPath._DOCUMENT_ID;\n  }\n\n  isEqual(other: firestore.FieldPath): boolean {\n    if (!(other instanceof FieldPath)) {\n      throw invalidClassError('isEqual', 'FieldPath', 1, other);\n    }\n    return this._internalPath.isEqual(other._internalPath);\n  }\n}\n\n/**\n * Matches any characters in a field path string that are reserved.\n */\nconst RESERVED = new RegExp('[~\\\\*/\\\\[\\\\]]');\n\n/**\n * Parses a field path string into a FieldPath, treating dots as separators.\n */\nexport function fromDotSeparatedString(path: string): FieldPath {\n  const found = path.search(RESERVED);\n  if (found >= 0) {\n    throw new FirestoreError(\n      Code.INVALID_ARGUMENT,\n      `Invalid field path (${path}). Paths must not contain ` +\n        `'~', '*', '/', '[', or ']'`\n    );\n  }\n  try {\n    return new FieldPath(...path.split('.'));\n  } catch (e) {\n    throw new FirestoreError(\n      Code.INVALID_ARGUMENT,\n      `Invalid field path (${path}). Paths must not be empty, ` +\n        `begin with '.', end with '.', or contain '..'`\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 * as firestore from '@firebase/firestore-types';\nimport {\n  validateArgType,\n  validateAtLeastNumberOfArgs,\n  validateExactNumberOfArgs,\n  validateNoArgs\n} from '../util/input_validation';\nimport { FieldTransform } from '../model/mutation';\nimport {\n  ArrayRemoveTransformOperation,\n  ArrayUnionTransformOperation,\n  NumericIncrementTransformOperation,\n  ServerTimestampTransform\n} from '../model/transform_operation';\nimport { ParseContext, parseData, UserDataSource } from './user_data_reader';\nimport { debugAssert } from '../util/assert';\n\n/**\n * An opaque base class for FieldValue sentinel objects in our public API,\n * with public static methods for creating said sentinel objects.\n */\nexport abstract class FieldValueImpl {\n  protected constructor(readonly _methodName: string) {}\n\n  abstract toFieldTransform(context: ParseContext): FieldTransform | null;\n\n  abstract isEqual(other: FieldValue): boolean;\n}\n\nexport class DeleteFieldValueImpl extends FieldValueImpl {\n  constructor() {\n    super('FieldValue.delete');\n  }\n\n  toFieldTransform(context: ParseContext): 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        'FieldValue.delete() at the top level should have already' +\n          ' been handled.'\n      );\n      throw context.createError(\n        'FieldValue.delete() 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        'FieldValue.delete() 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\nexport class ServerTimestampFieldValueImpl extends FieldValueImpl {\n  constructor() {\n    super('FieldValue.serverTimestamp');\n  }\n\n  toFieldTransform(context: ParseContext): FieldTransform {\n    return new FieldTransform(context.path!, ServerTimestampTransform.instance);\n  }\n\n  isEqual(other: FieldValue): boolean {\n    return other instanceof ServerTimestampFieldValueImpl;\n  }\n}\n\nexport class ArrayUnionFieldValueImpl extends FieldValueImpl {\n  constructor(private readonly _elements: unknown[]) {\n    super('FieldValue.arrayUnion');\n  }\n\n  toFieldTransform(context: ParseContext): FieldTransform {\n    // Although array transforms are used with writes, the actual elements\n    // being uniomed or removed are not considered writes since they cannot\n    // contain any FieldValue sentinels, etc.\n    const parseContext = new ParseContext(\n      {\n        dataSource: UserDataSource.Argument,\n        methodName: this._methodName,\n        arrayElement: true\n      },\n      context.databaseId,\n      context.serializer,\n      context.ignoreUndefinedProperties\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 FieldValueImpl {\n  constructor(readonly _elements: unknown[]) {\n    super('FieldValue.arrayRemove');\n  }\n\n  toFieldTransform(context: ParseContext): FieldTransform {\n    // Although array transforms are used with writes, the actual elements\n    // being unioned or removed are not considered writes since they cannot\n    // contain any FieldValue sentinels, etc.\n    const parseContext = new ParseContext(\n      {\n        dataSource: UserDataSource.Argument,\n        methodName: this._methodName,\n        arrayElement: true\n      },\n      context.databaseId,\n      context.serializer,\n      context.ignoreUndefinedProperties\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 FieldValueImpl {\n  constructor(private readonly _operand: number) {\n    super('FieldValue.increment');\n  }\n\n  toFieldTransform(context: ParseContext): FieldTransform {\n    const parseContext = new ParseContext(\n      {\n        dataSource: UserDataSource.Argument,\n        methodName: this._methodName\n      },\n      context.databaseId,\n      context.serializer,\n      context.ignoreUndefinedProperties\n    );\n    const operand = parseData(this._operand, parseContext)!;\n    const numericIncrement = new NumericIncrementTransformOperation(\n      context.serializer,\n      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\nexport class FieldValue implements firestore.FieldValue {\n  static delete(): FieldValueImpl {\n    validateNoArgs('FieldValue.delete', arguments);\n    return new DeleteFieldValueImpl();\n  }\n\n  static serverTimestamp(): FieldValueImpl {\n    validateNoArgs('FieldValue.serverTimestamp', arguments);\n    return new ServerTimestampFieldValueImpl();\n  }\n\n  static arrayUnion(...elements: unknown[]): FieldValueImpl {\n    validateAtLeastNumberOfArgs('FieldValue.arrayUnion', arguments, 1);\n    // NOTE: We don't actually parse the data until it's used in set() or\n    // update() since we need access to the Firestore instance.\n    return new ArrayUnionFieldValueImpl(elements);\n  }\n\n  static arrayRemove(...elements: unknown[]): FieldValueImpl {\n    validateAtLeastNumberOfArgs('FieldValue.arrayRemove', arguments, 1);\n    // NOTE: We don't actually parse the data until it's used in set() or\n    // update() since we need access to the Firestore instance.\n    return new ArrayRemoveFieldValueImpl(elements);\n  }\n\n  static increment(n: number): FieldValueImpl {\n    validateArgType('FieldValue.increment', 'number', 1, n);\n    validateExactNumberOfArgs('FieldValue.increment', arguments, 1);\n    return new NumericIncrementFieldValueImpl(n);\n  }\n\n  isEqual(other: FieldValue): boolean {\n    return this === other;\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 {\n  validateArgType,\n  validateExactNumberOfArgs\n} from '../util/input_validation';\nimport { primitiveComparator } from '../util/misc';\n\n/**\n * Immutable class representing a geo point as latitude-longitude pair.\n * This class is directly exposed in the public API, including its constructor.\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  constructor(latitude: number, longitude: number) {\n    validateExactNumberOfArgs('GeoPoint', arguments, 2);\n    validateArgType('GeoPoint', 'number', 1, latitude);\n    validateArgType('GeoPoint', 'number', 2, longitude);\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   * Returns the latitude of this geo point, a number between -90 and 90.\n   */\n  get latitude(): number {\n    return this._lat;\n  }\n\n  /**\n   * Returns the longitude of this geo point, a number between -180 and 180.\n   */\n  get longitude(): number {\n    return this._long;\n  }\n\n  isEqual(other: GeoPoint): boolean {\n    return this._lat === other._lat && this._long === other._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 * as firestore from '@firebase/firestore-types';\n\nimport * as api from '../protos/firestore_proto_api';\n\nimport { Timestamp } from './timestamp';\nimport { DatabaseId } from '../core/database_info';\nimport { DocumentKey } from '../model/document_key';\nimport {\n  FieldMask,\n  FieldTransform,\n  Mutation,\n  PatchMutation,\n  Precondition,\n  SetMutation,\n  TransformMutation\n} from '../model/mutation';\nimport { FieldPath } from '../model/path';\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';\nimport { ObjectValue, ObjectValueBuilder } from '../model/object_value';\nimport { JsonProtoSerializer } from '../remote/serializer';\nimport { Blob } from './blob';\nimport {\n  FieldPath as ExternalFieldPath,\n  fromDotSeparatedString\n} from './field_path';\nimport { DeleteFieldValueImpl, FieldValueImpl } from './field_value';\nimport { GeoPoint } from './geo_point';\nimport { PlatformSupport } from '../platform/platform';\nimport { DocumentReference } from './database';\n\nconst RESERVED_FIELD_REGEX = /^__.*__$/;\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  toMutations(key: DocumentKey, precondition: Precondition): Mutation[] {\n    const mutations = [] as Mutation[];\n    if (this.fieldMask !== null) {\n      mutations.push(\n        new PatchMutation(key, this.data, this.fieldMask, precondition)\n      );\n    } else {\n      mutations.push(new SetMutation(key, this.data, precondition));\n    }\n    if (this.fieldTransforms.length > 0) {\n      mutations.push(new TransformMutation(key, this.fieldTransforms));\n    }\n    return mutations;\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    readonly fieldMask: FieldMask,\n    readonly fieldTransforms: FieldTransform[]\n  ) {}\n\n  toMutations(key: DocumentKey, precondition: Precondition): Mutation[] {\n    const mutations = [\n      new PatchMutation(key, this.data, this.fieldMask, precondition)\n    ] as Mutation[];\n    if (this.fieldTransforms.length > 0) {\n      mutations.push(new TransformMutation(key, this.fieldTransforms));\n    }\n    return mutations;\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  /**\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?: FieldPath;\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\n/** A \"context\" object passed around while parsing user data. */\nexport class ParseContext {\n  readonly fieldTransforms: FieldTransform[];\n  readonly fieldMask: FieldPath[];\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 while\n   *     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?: FieldPath[]\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(): FieldPath | 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>): ParseContext {\n    return new ParseContext(\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): ParseContext {\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: FieldPath): ParseContext {\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): ParseContext {\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): Error {\n    const fieldDescription =\n      !this.path || this.path.isEmpty()\n        ? ''\n        : ` (found in field ${this.path.toString()})`;\n    return new FirestoreError(\n      Code.INVALID_ARGUMENT,\n      `Function ${this.settings.methodName}() called with invalid data. ` +\n        reason +\n        fieldDescription\n    );\n  }\n\n  /** Returns 'true' if 'fieldPath' was traversed when creating this context. */\n  contains(fieldPath: FieldPath): 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 =\n      serializer || PlatformSupport.getPlatform().newSerializer(databaseId);\n  }\n\n  /** Parse document data from a non-merge set() call. */\n  parseSetData(methodName: string, input: unknown): ParsedSetData {\n    const context = this.createContext(UserDataSource.Set, methodName);\n    validatePlainObject('Data must be an object, but it was:', context, input);\n    const updateData = parseObject(input, context)!;\n\n    return new ParsedSetData(\n      new ObjectValue(updateData),\n      /* fieldMask= */ null,\n      context.fieldTransforms\n    );\n  }\n\n  /** Parse document data from a set() call with '{merge:true}'. */\n  parseMergeData(\n    methodName: string,\n    input: unknown,\n    fieldPaths?: Array<string | firestore.FieldPath>\n  ): ParsedSetData {\n    const context = this.createContext(UserDataSource.MergeSet, methodName);\n    validatePlainObject('Data must be an object, but it was:', context, input);\n    const updateData = parseObject(input, context);\n\n    let fieldMask: FieldMask;\n    let fieldTransforms: FieldTransform[];\n\n    if (!fieldPaths) {\n      fieldMask = new FieldMask(context.fieldMask);\n      fieldTransforms = context.fieldTransforms;\n    } else {\n      const validatedFieldPaths: FieldPath[] = [];\n\n      for (const stringOrFieldPath of fieldPaths) {\n        let fieldPath: FieldPath;\n\n        if (stringOrFieldPath instanceof ExternalFieldPath) {\n          fieldPath = stringOrFieldPath._internalPath;\n        } else if (typeof stringOrFieldPath === 'string') {\n          fieldPath = fieldPathFromDotSeparatedString(\n            methodName,\n            stringOrFieldPath\n          );\n        } else {\n          throw fail(\n            'Expected stringOrFieldPath to be a string or a FieldPath'\n          );\n        }\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    }\n    return new ParsedSetData(\n      new ObjectValue(updateData),\n      fieldMask,\n      fieldTransforms\n    );\n  }\n\n  /** Parse update data from an update() call. */\n  parseUpdateData(methodName: string, input: unknown): ParsedUpdateData {\n    const context = this.createContext(UserDataSource.Update, methodName);\n    validatePlainObject('Data must be an object, but it was:', context, input);\n\n    const fieldMaskPaths: FieldPath[] = [];\n    const updateData = new ObjectValueBuilder();\n    forEach(input as Dict<unknown>, (key, value) => {\n      const path = fieldPathFromDotSeparatedString(methodName, key);\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(\n      updateData.build(),\n      mask,\n      context.fieldTransforms\n    );\n  }\n\n  /** Parse update data from a list of field/value arguments. */\n  parseUpdateVarargs(\n    methodName: string,\n    field: string | ExternalFieldPath,\n    value: unknown,\n    moreFieldsAndValues: unknown[]\n  ): ParsedUpdateData {\n    const context = this.createContext(UserDataSource.Update, methodName);\n    const keys = [fieldPathFromArgument(methodName, field)];\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 | ExternalFieldPath\n        )\n      );\n      values.push(moreFieldsAndValues[i + 1]);\n    }\n\n    const fieldMaskPaths: FieldPath[] = [];\n    const updateData = new ObjectValueBuilder();\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        const value = values[i];\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(\n      updateData.build(),\n      mask,\n      context.fieldTransforms\n    );\n  }\n\n  /** Creates a new top-level parse context. */\n  private createContext(\n    dataSource: UserDataSource,\n    methodName: string\n  ): ParseContext {\n    return new ParseContext(\n      {\n        dataSource,\n        methodName,\n        path: FieldPath.EMPTY_PATH,\n        arrayElement: false\n      },\n      this.databaseId,\n      this.serializer,\n      this.ignoreUndefinedProperties\n    );\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   */\n  parseQueryValue(\n    methodName: string,\n    input: unknown,\n    allowArrays = false\n  ): api.Value {\n    const context = this.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/**\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 * @return 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: ParseContext\n): api.Value | null {\n  if (looksLikeJsonObject(input)) {\n    validatePlainObject('Unsupported field value:', context, input);\n    return parseObject(input, context);\n  } else if (input instanceof FieldValueImpl) {\n    // FieldValues usually parse into transforms (except FieldValue.delete())\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 {\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: ParseContext\n): { mapValue: api.MapValue } {\n  const fields: Dict<api.Value> = {};\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: ParseContext): api.Value {\n  const values: api.Value[] = [];\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: FieldValueImpl,\n  context: ParseContext\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 === null) {\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 * @return The parsed value\n */\nfunction parseScalarValue(\n  value: unknown,\n  context: ParseContext\n): api.Value | null {\n  if (value === null) {\n    return { nullValue: 'NULL_VALUE' };\n  } else if (typeof value === 'number') {\n    return context.serializer.toNumber(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 { timestampValue: context.serializer.toTimestamp(timestamp) };\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 { timestampValue: context.serializer.toTimestamp(timestamp) };\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 Blob) {\n    return { bytesValue: context.serializer.toBytes(value) };\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: context.serializer.toResourceName(\n        value._key.path,\n        value.firestore._databaseId\n      )\n    };\n  } else if (value === undefined && context.ignoreUndefinedProperties) {\n    return null;\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 Blob) &&\n    !(input instanceof DocumentReference) &&\n    !(input instanceof FieldValueImpl)\n  );\n}\n\nfunction validatePlainObject(\n  message: string,\n  context: ParseContext,\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 | ExternalFieldPath\n): FieldPath {\n  if (path instanceof ExternalFieldPath) {\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 FieldPath.';\n    throw new FirestoreError(\n      Code.INVALID_ARGUMENT,\n      `Function ${methodName}() called with invalid data. ${message}`\n    );\n  }\n}\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 split\n * on dots.\n */\nfunction fieldPathFromDotSeparatedString(\n  methodName: string,\n  path: string\n): FieldPath {\n  try {\n    return fromDotSeparatedString(path)._internalPath;\n  } catch (e) {\n    const message = errorMessage(e);\n    throw new FirestoreError(\n      Code.INVALID_ARGUMENT,\n      `Function ${methodName}() called with invalid data. ${message}`\n    );\n  }\n}\n\n/**\n * Extracts the message from a caught exception, which should be an Error object\n * though JS doesn't guarantee that.\n */\nfunction errorMessage(error: Error | object): string {\n  return error instanceof Error ? error.message : error.toString();\n}\n\n/** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */\nfunction fieldMaskContains(haystack: FieldPath[], needle: FieldPath): boolean {\n  return haystack.some(v => v.isEqual(needle));\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, Token } from '../api/credentials';\nimport { SnapshotVersion } from '../core/snapshot_version';\nimport { TargetId } from '../core/types';\nimport { TargetData } from '../local/target_data';\nimport { Mutation, MutationResult } from '../model/mutation';\nimport * as api from '../protos/firestore_proto_api';\nimport { hardAssert, debugAssert } from '../util/assert';\nimport { AsyncQueue, DelayedOperation, TimerId } from '../util/async_queue';\nimport { Code, FirestoreError } from '../util/error';\nimport { logError, logDebug } from '../util/log';\n\nimport { isNullOrUndefined } from '../util/types';\nimport { ExponentialBackoff } from './backoff';\nimport { Connection, Stream } from './connection';\nimport { JsonProtoSerializer } from './serializer';\nimport { WatchChange } from './watch_change';\nimport { ByteString } from '../util/byte_string';\n\nconst LOG_TAG = 'PersistentStream';\n\n// The generated proto interfaces for these class are missing the database\n// field. So we add it here.\n// TODO(b/36015800): Remove this once the api generator is fixed.\ninterface ListenRequest extends api.ListenRequest {\n  database?: string;\n}\nexport interface WriteRequest extends api.WriteRequest {\n  database?: string;\n}\n/**\n * PersistentStream can be in one of 5 states (each described in detail below)\n * based on the following state transition diagram:\n *\n *          start() called             auth & connection succeeded\n * INITIAL ----------------> STARTING -----------------------------> OPEN\n *                             ^  |                                   |\n *                             |  |                    error occurred |\n *                             |  \\-----------------------------v-----/\n *                             |                                |\n *                    backoff  |                                |\n *                    elapsed  |              start() called    |\n *                             \\--- BACKOFF <---------------- ERROR\n *\n * [any state] --------------------------> INITIAL\n *               stop() called or\n *               idle timer expired\n */\nconst enum PersistentStreamState {\n  /**\n   * The streaming RPC is not yet running and there's no error condition.\n   * Calling start() will start the stream immediately without backoff.\n   * While in this state isStarted() will return false.\n   */\n  Initial,\n\n  /**\n   * The stream is starting, either waiting for an auth token or for the stream\n   * to successfully open. While in this state, isStarted() will return true but\n   * isOpen() will return false.\n   */\n  Starting,\n\n  /**\n   * The streaming RPC is up and running. Requests and responses can flow\n   * freely. Both isStarted() and isOpen() will return true.\n   */\n  Open,\n\n  /**\n   * The stream encountered an error. The next start attempt will back off.\n   * While in this state isStarted() will return false.\n   */\n  Error,\n\n  /**\n   * An in-between state after an error where the stream is waiting before\n   * re-starting. After waiting is complete, the stream will try to open.\n   * While in this state isStarted() will return true but isOpen() will return\n   * false.\n   */\n  Backoff\n}\n\n/**\n * Provides a common interface that is shared by the listeners for stream\n * events by the concrete implementation classes.\n */\nexport interface PersistentStreamListener {\n  /**\n   * Called after the stream was established and can accept outgoing\n   * messages\n   */\n  onOpen: () => Promise<void>;\n  /**\n   * Called after the stream has closed. If there was an error, the\n   * FirestoreError will be set.\n   */\n  onClose: (err?: FirestoreError) => Promise<void>;\n}\n\n/** The time a stream stays open after it is marked idle. */\nconst IDLE_TIMEOUT_MS = 60 * 1000;\n\n/**\n * A PersistentStream is an abstract base class that represents a streaming RPC\n * to the Firestore backend. It's built on top of the connections own support\n * for streaming RPCs, and adds several critical features for our clients:\n *\n *   - Exponential backoff on failure\n *   - Authentication via CredentialsProvider\n *   - Dispatching all callbacks into the shared worker queue\n *   - Closing idle streams after 60 seconds of inactivity\n *\n * Subclasses of PersistentStream implement serialization of models to and\n * from the JSON representation of the protocol buffers for a specific\n * streaming RPC.\n *\n * ## Starting and Stopping\n *\n * Streaming RPCs are stateful and need to be start()ed before messages can\n * be sent and received. The PersistentStream will call the onOpen() function\n * of the listener once the stream is ready to accept requests.\n *\n * Should a start() fail, PersistentStream will call the registered onClose()\n * listener with a FirestoreError indicating what went wrong.\n *\n * A PersistentStream can be started and stopped repeatedly.\n *\n * Generic types:\n *  SendType: The type of the outgoing message of the underlying\n *    connection stream\n *  ReceiveType: The type of the incoming message of the underlying\n *    connection stream\n *  ListenerType: The type of the listener that will be used for callbacks\n */\nexport abstract class PersistentStream<\n  SendType,\n  ReceiveType,\n  ListenerType extends PersistentStreamListener\n> {\n  private state = PersistentStreamState.Initial;\n  /**\n   * A close count that's incremented every time the stream is closed; used by\n   * getCloseGuardedDispatcher() to invalidate callbacks that happen after\n   * close.\n   */\n  private closeCount = 0;\n\n  private idleTimer: DelayedOperation<void> | null = null;\n  private stream: Stream<SendType, ReceiveType> | null = null;\n\n  protected backoff: ExponentialBackoff;\n\n  constructor(\n    private queue: AsyncQueue,\n    connectionTimerId: TimerId,\n    private idleTimerId: TimerId,\n    protected connection: Connection,\n    private credentialsProvider: CredentialsProvider,\n    protected listener: ListenerType\n  ) {\n    this.backoff = new ExponentialBackoff(queue, connectionTimerId);\n  }\n\n  /**\n   * Returns true if start() has been called and no error has occurred. True\n   * indicates the stream is open or in the process of opening (which\n   * encompasses respecting backoff, getting auth tokens, and starting the\n   * actual RPC). Use isOpen() to determine if the stream is open and ready for\n   * outbound requests.\n   */\n  isStarted(): boolean {\n    return (\n      this.state === PersistentStreamState.Starting ||\n      this.state === PersistentStreamState.Open ||\n      this.state === PersistentStreamState.Backoff\n    );\n  }\n\n  /**\n   * Returns true if the underlying RPC is open (the onOpen() listener has been\n   * called) and the stream is ready for outbound requests.\n   */\n  isOpen(): boolean {\n    return this.state === PersistentStreamState.Open;\n  }\n\n  /**\n   * Starts the RPC. Only allowed if isStarted() returns false. The stream is\n   * not immediately ready for use: onOpen() will be invoked when the RPC is\n   * ready for outbound requests, at which point isOpen() will return true.\n   *\n   * When start returns, isStarted() will return true.\n   */\n  start(): void {\n    if (this.state === PersistentStreamState.Error) {\n      this.performBackoff();\n      return;\n    }\n\n    debugAssert(\n      this.state === PersistentStreamState.Initial,\n      'Already started'\n    );\n    this.auth();\n  }\n\n  /**\n   * Stops the RPC. This call is idempotent and allowed regardless of the\n   * current isStarted() state.\n   *\n   * When stop returns, isStarted() and isOpen() will both return false.\n   */\n  async stop(): Promise<void> {\n    if (this.isStarted()) {\n      await this.close(PersistentStreamState.Initial);\n    }\n  }\n\n  /**\n   * After an error the stream will usually back off on the next attempt to\n   * start it. If the error warrants an immediate restart of the stream, the\n   * sender can use this to indicate that the receiver should not back off.\n   *\n   * Each error will call the onClose() listener. That function can decide to\n   * inhibit backoff if required.\n   */\n  inhibitBackoff(): void {\n    debugAssert(\n      !this.isStarted(),\n      'Can only inhibit backoff in a stopped state'\n    );\n\n    this.state = PersistentStreamState.Initial;\n    this.backoff.reset();\n  }\n\n  /**\n   * Marks this stream as idle. If no further actions are performed on the\n   * stream for one minute, the stream will automatically close itself and\n   * notify the stream's onClose() handler with Status.OK. The stream will then\n   * be in a !isStarted() state, requiring the caller to start the stream again\n   * before further use.\n   *\n   * Only streams that are in state 'Open' can be marked idle, as all other\n   * states imply pending network operations.\n   */\n  markIdle(): void {\n    // Starts the idle time if we are in state 'Open' and are not yet already\n    // running a timer (in which case the previous idle timeout still applies).\n    if (this.isOpen() && this.idleTimer === null) {\n      this.idleTimer = this.queue.enqueueAfterDelay(\n        this.idleTimerId,\n        IDLE_TIMEOUT_MS,\n        () => this.handleIdleCloseTimer()\n      );\n    }\n  }\n\n  /** Sends a message to the underlying stream. */\n  protected sendRequest(msg: SendType): void {\n    this.cancelIdleCheck();\n    this.stream!.send(msg);\n  }\n\n  /** Called by the idle timer when the stream should close due to inactivity. */\n  private async handleIdleCloseTimer(): Promise<void> {\n    if (this.isOpen()) {\n      // When timing out an idle stream there's no reason to force the stream into backoff when\n      // it restarts so set the stream state to Initial instead of Error.\n      return this.close(PersistentStreamState.Initial);\n    }\n  }\n\n  /** Marks the stream as active again. */\n  private cancelIdleCheck(): void {\n    if (this.idleTimer) {\n      this.idleTimer.cancel();\n      this.idleTimer = null;\n    }\n  }\n\n  /**\n   * Closes the stream and cleans up as necessary:\n   *\n   * * closes the underlying GRPC stream;\n   * * calls the onClose handler with the given 'error';\n   * * sets internal stream state to 'finalState';\n   * * adjusts the backoff timer based on the error\n   *\n   * A new stream can be opened by calling start().\n   *\n   * @param finalState the intended state of the stream after closing.\n   * @param error the error the connection was closed with.\n   */\n  private async close(\n    finalState: PersistentStreamState,\n    error?: FirestoreError\n  ): Promise<void> {\n    debugAssert(this.isStarted(), 'Only started streams should be closed.');\n    debugAssert(\n      finalState === PersistentStreamState.Error || isNullOrUndefined(error),\n      \"Can't provide an error when not in an error state.\"\n    );\n\n    // Cancel any outstanding timers (they're guaranteed not to execute).\n    this.cancelIdleCheck();\n    this.backoff.cancel();\n\n    // Invalidates any stream-related callbacks (e.g. from auth or the\n    // underlying stream), guaranteeing they won't execute.\n    this.closeCount++;\n\n    if (finalState !== PersistentStreamState.Error) {\n      // If this is an intentional close ensure we don't delay our next connection attempt.\n      this.backoff.reset();\n    } else if (error && error.code === Code.RESOURCE_EXHAUSTED) {\n      // Log the error. (Probably either 'quota exceeded' or 'max queue length reached'.)\n      logError(error.toString());\n      logError(\n        'Using maximum backoff delay to prevent overloading the backend.'\n      );\n      this.backoff.resetToMax();\n    } else if (error && error.code === Code.UNAUTHENTICATED) {\n      // \"unauthenticated\" error means the token was rejected. Try force refreshing it in case it\n      // just expired.\n      this.credentialsProvider.invalidateToken();\n    }\n\n    // Clean up the underlying stream because we are no longer interested in events.\n    if (this.stream !== null) {\n      this.tearDown();\n      this.stream.close();\n      this.stream = null;\n    }\n\n    // This state must be assigned before calling onClose() to allow the callback to\n    // inhibit backoff or otherwise manipulate the state in its non-started state.\n    this.state = finalState;\n\n    // Notify the listener that the stream closed.\n    await this.listener.onClose(error);\n  }\n\n  /**\n   * Can be overridden to perform additional cleanup before the stream is closed.\n   * Calling super.tearDown() is not required.\n   */\n  protected tearDown(): void {}\n\n  /**\n   * Used by subclasses to start the concrete RPC and return the underlying\n   * connection stream.\n   */\n  protected abstract startRpc(\n    token: Token | null\n  ): Stream<SendType, ReceiveType>;\n\n  /**\n   * Called after the stream has received a message. The function will be\n   * called on the right queue and must return a Promise.\n   * @param message The message received from the stream.\n   */\n  protected abstract onMessage(message: ReceiveType): Promise<void>;\n\n  private auth(): void {\n    debugAssert(\n      this.state === PersistentStreamState.Initial,\n      'Must be in initial state to auth'\n    );\n\n    this.state = PersistentStreamState.Starting;\n\n    const dispatchIfNotClosed = this.getCloseGuardedDispatcher(this.closeCount);\n\n    // TODO(mikelehen): Just use dispatchIfNotClosed, but see TODO below.\n    const closeCount = this.closeCount;\n\n    this.credentialsProvider.getToken().then(\n      token => {\n        // Stream can be stopped while waiting for authentication.\n        // TODO(mikelehen): We really should just use dispatchIfNotClosed\n        // and let this dispatch onto the queue, but that opened a spec test can\n        // of worms that I don't want to deal with in this PR.\n        if (this.closeCount === closeCount) {\n          // Normally we'd have to schedule the callback on the AsyncQueue.\n          // However, the following calls are safe to be called outside the\n          // AsyncQueue since they don't chain asynchronous calls\n          this.startStream(token);\n        }\n      },\n      (error: Error) => {\n        dispatchIfNotClosed(() => {\n          const rpcError = new FirestoreError(\n            Code.UNKNOWN,\n            'Fetching auth token failed: ' + error.message\n          );\n          return this.handleStreamClose(rpcError);\n        });\n      }\n    );\n  }\n\n  private startStream(token: Token | null): void {\n    debugAssert(\n      this.state === PersistentStreamState.Starting,\n      'Trying to start stream in a non-starting state'\n    );\n\n    const dispatchIfNotClosed = this.getCloseGuardedDispatcher(this.closeCount);\n\n    this.stream = this.startRpc(token);\n    this.stream.onOpen(() => {\n      dispatchIfNotClosed(() => {\n        debugAssert(\n          this.state === PersistentStreamState.Starting,\n          'Expected stream to be in state Starting, but was ' + this.state\n        );\n        this.state = PersistentStreamState.Open;\n        return this.listener!.onOpen();\n      });\n    });\n    this.stream.onClose((error?: FirestoreError) => {\n      dispatchIfNotClosed(() => {\n        return this.handleStreamClose(error);\n      });\n    });\n    this.stream.onMessage((msg: ReceiveType) => {\n      dispatchIfNotClosed(() => {\n        return this.onMessage(msg);\n      });\n    });\n  }\n\n  private performBackoff(): void {\n    debugAssert(\n      this.state === PersistentStreamState.Error,\n      'Should only perform backoff when in Error state'\n    );\n    this.state = PersistentStreamState.Backoff;\n\n    this.backoff.backoffAndRun(async () => {\n      debugAssert(\n        this.state === PersistentStreamState.Backoff,\n        'Backoff elapsed but state is now: ' + this.state\n      );\n\n      this.state = PersistentStreamState.Initial;\n      this.start();\n      debugAssert(this.isStarted(), 'PersistentStream should have started');\n    });\n  }\n\n  // Visible for tests\n  handleStreamClose(error?: FirestoreError): Promise<void> {\n    debugAssert(\n      this.isStarted(),\n      \"Can't handle server close on non-started stream\"\n    );\n    logDebug(LOG_TAG, `close with error: ${error}`);\n\n    this.stream = null;\n\n    // In theory the stream could close cleanly, however, in our current model\n    // we never expect this to happen because if we stop a stream ourselves,\n    // this callback will never be called. To prevent cases where we retry\n    // without a backoff accidentally, we set the stream to error in all cases.\n    return this.close(PersistentStreamState.Error, error);\n  }\n\n  /**\n   * Returns a \"dispatcher\" function that dispatches operations onto the\n   * AsyncQueue but only runs them if closeCount remains unchanged. This allows\n   * us to turn auth / stream callbacks into no-ops if the stream is closed /\n   * re-opened, etc.\n   */\n  private getCloseGuardedDispatcher(\n    startCloseCount: number\n  ): (fn: () => Promise<void>) => void {\n    return (fn: () => Promise<void>): void => {\n      this.queue.enqueueAndForget(() => {\n        if (this.closeCount === startCloseCount) {\n          return fn();\n        } else {\n          logDebug(\n            LOG_TAG,\n            'stream callback skipped by getCloseGuardedDispatcher.'\n          );\n          return Promise.resolve();\n        }\n      });\n    };\n  }\n}\n\n/** Listener for the PersistentWatchStream */\nexport interface WatchStreamListener extends PersistentStreamListener {\n  /**\n   * Called on a watchChange. The snapshot parameter will be MIN if the watch\n   * change did not have a snapshot associated with it.\n   */\n  onWatchChange: (\n    watchChange: WatchChange,\n    snapshot: SnapshotVersion\n  ) => Promise<void>;\n}\n\n/**\n * A PersistentStream that implements the Listen RPC.\n *\n * Once the Listen stream has called the onOpen() listener, any number of\n * listen() and unlisten() calls can be made to control what changes will be\n * sent from the server for ListenResponses.\n */\nexport class PersistentListenStream extends PersistentStream<\n  api.ListenRequest,\n  api.ListenResponse,\n  WatchStreamListener\n> {\n  constructor(\n    queue: AsyncQueue,\n    connection: Connection,\n    credentials: CredentialsProvider,\n    private serializer: JsonProtoSerializer,\n    listener: WatchStreamListener\n  ) {\n    super(\n      queue,\n      TimerId.ListenStreamConnectionBackoff,\n      TimerId.ListenStreamIdle,\n      connection,\n      credentials,\n      listener\n    );\n  }\n\n  protected startRpc(\n    token: Token | null\n  ): Stream<api.ListenRequest, api.ListenResponse> {\n    return this.connection.openStream<api.ListenRequest, api.ListenResponse>(\n      'Listen',\n      token\n    );\n  }\n\n  protected onMessage(watchChangeProto: api.ListenResponse): Promise<void> {\n    // A successful response means the stream is healthy\n    this.backoff.reset();\n\n    const watchChange = this.serializer.fromWatchChange(watchChangeProto);\n    const snapshot = this.serializer.versionFromListenResponse(\n      watchChangeProto\n    );\n    return this.listener!.onWatchChange(watchChange, snapshot);\n  }\n\n  /**\n   * Registers interest in the results of the given target. If the target\n   * includes a resumeToken it will be included in the request. Results that\n   * affect the target will be streamed back as WatchChange messages that\n   * reference the targetId.\n   */\n  watch(targetData: TargetData): void {\n    const request: ListenRequest = {};\n    request.database = this.serializer.encodedDatabaseId;\n    request.addTarget = this.serializer.toTarget(targetData);\n\n    const labels = this.serializer.toListenRequestLabels(targetData);\n    if (labels) {\n      request.labels = labels;\n    }\n\n    this.sendRequest(request);\n  }\n\n  /**\n   * Unregisters interest in the results of the target associated with the\n   * given targetId.\n   */\n  unwatch(targetId: TargetId): void {\n    const request: ListenRequest = {};\n    request.database = this.serializer.encodedDatabaseId;\n    request.removeTarget = targetId;\n    this.sendRequest(request);\n  }\n}\n\n/** Listener for the PersistentWriteStream */\nexport interface WriteStreamListener extends PersistentStreamListener {\n  /**\n   * Called by the PersistentWriteStream upon a successful handshake response\n   * from the server, which is the receiver's cue to send any pending writes.\n   */\n  onHandshakeComplete: () => Promise<void>;\n\n  /**\n   * Called by the PersistentWriteStream upon receiving a StreamingWriteResponse\n   * from the server that contains a mutation result.\n   */\n  onMutationResult: (\n    commitVersion: SnapshotVersion,\n    results: MutationResult[]\n  ) => Promise<void>;\n}\n\n/**\n * A Stream that implements the Write RPC.\n *\n * The Write RPC requires the caller to maintain special streamToken\n * state in between calls, to help the server understand which responses the\n * client has processed by the time the next request is made. Every response\n * will contain a streamToken; this value must be passed to the next\n * request.\n *\n * After calling start() on this stream, the next request must be a handshake,\n * containing whatever streamToken is on hand. Once a response to this\n * request is received, all pending mutations may be submitted. When\n * submitting multiple batches of mutations at the same time, it's\n * okay to use the same streamToken for the calls to writeMutations.\n *\n * TODO(b/33271235): Use proto types\n */\nexport class PersistentWriteStream extends PersistentStream<\n  api.WriteRequest,\n  api.WriteResponse,\n  WriteStreamListener\n> {\n  private handshakeComplete_ = false;\n\n  constructor(\n    queue: AsyncQueue,\n    connection: Connection,\n    credentials: CredentialsProvider,\n    private serializer: JsonProtoSerializer,\n    listener: WriteStreamListener\n  ) {\n    super(\n      queue,\n      TimerId.WriteStreamConnectionBackoff,\n      TimerId.WriteStreamIdle,\n      connection,\n      credentials,\n      listener\n    );\n  }\n\n  /**\n   * The last received stream token from the server, used to acknowledge which\n   * responses the client has processed. Stream tokens are opaque checkpoint\n   * markers whose only real value is their inclusion in the next request.\n   *\n   * PersistentWriteStream manages propagating this value from responses to the\n   * next request.\n   */\n  lastStreamToken: ByteString = ByteString.EMPTY_BYTE_STRING;\n\n  /**\n   * Tracks whether or not a handshake has been successfully exchanged and\n   * the stream is ready to accept mutations.\n   */\n  get handshakeComplete(): boolean {\n    return this.handshakeComplete_;\n  }\n\n  // Override of PersistentStream.start\n  start(): void {\n    this.handshakeComplete_ = false;\n    super.start();\n  }\n\n  protected tearDown(): void {\n    if (this.handshakeComplete_) {\n      this.writeMutations([]);\n    }\n  }\n\n  protected startRpc(\n    token: Token | null\n  ): Stream<api.WriteRequest, api.WriteResponse> {\n    return this.connection.openStream<api.WriteRequest, api.WriteResponse>(\n      'Write',\n      token\n    );\n  }\n\n  protected onMessage(responseProto: api.WriteResponse): Promise<void> {\n    // Always capture the last stream token.\n    hardAssert(\n      !!responseProto.streamToken,\n      'Got a write response without a stream token'\n    );\n    this.lastStreamToken = this.serializer.fromBytes(responseProto.streamToken);\n\n    if (!this.handshakeComplete_) {\n      // The first response is always the handshake response\n      hardAssert(\n        !responseProto.writeResults || responseProto.writeResults.length === 0,\n        'Got mutation results for handshake'\n      );\n      this.handshakeComplete_ = true;\n      return this.listener!.onHandshakeComplete();\n    } else {\n      // A successful first write response means the stream is healthy,\n      // Note, that we could consider a successful handshake healthy, however,\n      // the write itself might be causing an error we want to back off from.\n      this.backoff.reset();\n\n      const results = this.serializer.fromWriteResults(\n        responseProto.writeResults,\n        responseProto.commitTime\n      );\n      const commitVersion = this.serializer.fromVersion(\n        responseProto.commitTime!\n      );\n      return this.listener!.onMutationResult(commitVersion, results);\n    }\n  }\n\n  /**\n   * Sends an initial streamToken to the server, performing the handshake\n   * required to make the StreamingWrite RPC work. Subsequent\n   * calls should wait until onHandshakeComplete was called.\n   */\n  writeHandshake(): void {\n    debugAssert(this.isOpen(), 'Writing handshake requires an opened stream');\n    debugAssert(!this.handshakeComplete_, 'Handshake already completed');\n    // TODO(dimond): Support stream resumption. We intentionally do not set the\n    // stream token on the handshake, ignoring any stream token we might have.\n    const request: WriteRequest = {};\n    request.database = this.serializer.encodedDatabaseId;\n    this.sendRequest(request);\n  }\n\n  /** Sends a group of mutations to the Firestore backend to apply. */\n  writeMutations(mutations: Mutation[]): void {\n    debugAssert(this.isOpen(), 'Writing mutations requires an opened stream');\n    debugAssert(\n      this.handshakeComplete_,\n      'Handshake must be complete before writing mutations'\n    );\n    debugAssert(\n      this.lastStreamToken.approximateByteSize() > 0,\n      'Trying to write mutation without a token'\n    );\n\n    const request: WriteRequest = {\n      streamToken: this.serializer.toBytes(this.lastStreamToken),\n      writes: mutations.map(mutation => this.serializer.toMutation(mutation))\n    };\n\n    this.sendRequest(request);\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 { MaybeDocument, Document } from '../model/document';\nimport { DocumentKey } from '../model/document_key';\nimport { Mutation, MutationResult } from '../model/mutation';\nimport * as api from '../protos/firestore_proto_api';\nimport { debugCast, hardAssert } from '../util/assert';\nimport { Code, FirestoreError } from '../util/error';\nimport { Connection } from './connection';\nimport { JsonProtoSerializer } from './serializer';\nimport {\n  PersistentListenStream,\n  PersistentWriteStream,\n  WatchStreamListener,\n  WriteStreamListener\n} from './persistent_stream';\nimport { AsyncQueue } from '../util/async_queue';\nimport { Query } from '../core/query';\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 class Datastore {\n  // Make sure that the structural type of `Datastore` is unique.\n  // See https://github.com/microsoft/TypeScript/issues/5451\n  private _ = undefined;\n}\n\n/**\n * An implementation of Datastore that exposes additional state for internal\n * consumption.\n */\nclass DatastoreImpl extends Datastore {\n  constructor(\n    public readonly connection: Connection,\n    public readonly credentials: CredentialsProvider,\n    public readonly serializer: JsonProtoSerializer\n  ) {\n    super();\n  }\n\n  /** Gets an auth token and invokes the provided RPC. */\n  invokeRPC<Req, Resp>(rpcName: string, request: Req): Promise<Resp> {\n    return this.credentials\n      .getToken()\n      .then(token => {\n        return this.connection.invokeRPC<Req, Resp>(rpcName, request, token);\n      })\n      .catch((error: FirestoreError) => {\n        if (error.code === Code.UNAUTHENTICATED) {\n          this.credentials.invalidateToken();\n        }\n        throw error;\n      });\n  }\n\n  /** Gets an auth token and invokes the provided RPC with streamed results. */\n  invokeStreamingRPC<Req, Resp>(\n    rpcName: string,\n    request: Req\n  ): Promise<Resp[]> {\n    return this.credentials\n      .getToken()\n      .then(token => {\n        return this.connection.invokeStreamingRPC<Req, Resp>(\n          rpcName,\n          request,\n          token\n        );\n      })\n      .catch((error: FirestoreError) => {\n        if (error.code === Code.UNAUTHENTICATED) {\n          this.credentials.invalidateToken();\n        }\n        throw error;\n      });\n  }\n}\n\nexport function newDatastore(\n  connection: Connection,\n  credentials: CredentialsProvider,\n  serializer: JsonProtoSerializer\n): Datastore {\n  return new DatastoreImpl(connection, credentials, serializer);\n}\n\nexport async function invokeCommitRpc(\n  datastore: Datastore,\n  mutations: Mutation[]\n): Promise<MutationResult[]> {\n  const datastoreImpl = debugCast(datastore, DatastoreImpl);\n  const params = {\n    database: datastoreImpl.serializer.encodedDatabaseId,\n    writes: mutations.map(m => datastoreImpl.serializer.toMutation(m))\n  };\n  const response = await datastoreImpl.invokeRPC<\n    api.CommitRequest,\n    api.CommitResponse\n  >('Commit', params);\n  return datastoreImpl.serializer.fromWriteResults(\n    response.writeResults,\n    response.commitTime\n  );\n}\n\nexport async function invokeBatchGetDocumentsRpc(\n  datastore: Datastore,\n  keys: DocumentKey[]\n): Promise<MaybeDocument[]> {\n  const datastoreImpl = debugCast(datastore, DatastoreImpl);\n  const params = {\n    database: datastoreImpl.serializer.encodedDatabaseId,\n    documents: keys.map(k => datastoreImpl.serializer.toName(k))\n  };\n  const response = await datastoreImpl.invokeStreamingRPC<\n    api.BatchGetDocumentsRequest,\n    api.BatchGetDocumentsResponse\n  >('BatchGetDocuments', params);\n\n  const docs = new Map<string, MaybeDocument>();\n  response.forEach(proto => {\n    const doc = datastoreImpl.serializer.fromMaybeDocument(proto);\n    docs.set(doc.key.toString(), doc);\n  });\n  const result: MaybeDocument[] = [];\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 { structuredQuery, parent } = datastoreImpl.serializer.toQueryTarget(\n    query.toTarget()\n  );\n  const params = {\n    database: datastoreImpl.serializer.encodedDatabaseId,\n    parent,\n    structuredQuery\n  };\n\n  const response = await datastoreImpl.invokeStreamingRPC<\n    api.RunQueryRequest,\n    api.RunQueryResponse\n  >('RunQuery', params);\n\n  return (\n    response\n      // Omit RunQueryResponses that only contain readTimes.\n      .filter(proto => !!proto.document)\n      .map(proto => datastoreImpl.serializer.fromDocument(proto.document!))\n  );\n}\n\nexport function newPersistentWriteStream(\n  datastore: Datastore,\n  queue: AsyncQueue,\n  listener: WriteStreamListener\n): PersistentWriteStream {\n  const datastoreImpl = debugCast(datastore, DatastoreImpl);\n  return new PersistentWriteStream(\n    queue,\n    datastoreImpl.connection,\n    datastoreImpl.credentials,\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  return new PersistentListenStream(\n    queue,\n    datastoreImpl.connection,\n    datastoreImpl.credentials,\n    datastoreImpl.serializer,\n    listener\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 '../api/user_data_reader';\nimport { documentVersionMap } from '../model/collections';\nimport { Document, MaybeDocument, NoDocument } from '../model/document';\n\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';\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 = documentVersionMap();\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<DocumentKey> = new Set();\n\n  constructor(private datastore: Datastore) {}\n\n  async lookup(keys: DocumentKey[]): Promise<MaybeDocument[]> {\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 => {\n      if (doc instanceof NoDocument || doc instanceof Document) {\n        this.recordVersion(doc);\n      } else {\n        fail('Document in a transaction was a ' + doc.constructor.name);\n      }\n    });\n    return docs;\n  }\n\n  set(key: DocumentKey, data: ParsedSetData): void {\n    this.write(data.toMutations(key, this.precondition(key)));\n    this.writtenDocs.add(key);\n  }\n\n  update(key: DocumentKey, data: ParsedUpdateData): void {\n    try {\n      this.write(data.toMutations(key, this.preconditionForUpdate(key)));\n    } catch (e) {\n      this.lastWriteError = e;\n    }\n    this.writtenDocs.add(key);\n  }\n\n  delete(key: DocumentKey): void {\n    this.write([new DeleteMutation(key, this.precondition(key))]);\n    this.writtenDocs.add(key);\n  }\n\n  async commit(): Promise<void> {\n    this.ensureCommitNotCalled();\n\n    if (this.lastWriteError) {\n      throw this.lastWriteError;\n    }\n    let unwritten = this.readVersions;\n    // For each mutation, note that the doc was written.\n    this.mutations.forEach(mutation => {\n      unwritten = unwritten.remove(mutation.key);\n    });\n    // For each document that was read but not written to, we want to perform\n    // a `verify` operation.\n    unwritten.forEach((key, _version) => {\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: MaybeDocument): void {\n    let docVersion: SnapshotVersion;\n\n    if (doc instanceof Document) {\n      docVersion = doc.version;\n    } else if (doc instanceof NoDocument) {\n      // For deleted docs, we must use baseVersion 0 when we overwrite them.\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);\n    if (existingVersion !== null) {\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 = this.readVersions.insert(doc.key, 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);\n    if (!this.writtenDocs.has(key) && version) {\n      return Precondition.updateTime(version);\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);\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) && 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(mutations: Mutation[]): void {\n    this.ensureCommitNotCalled();\n    this.mutations = this.mutations.concat(mutations);\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 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 { OnlineState } from '../core/types';\nimport { debugAssert } from '../util/assert';\nimport { AsyncQueue, DelayedOperation, TimerId } from '../util/async_queue';\nimport { FirestoreError } from '../util/error';\nimport { logError, logDebug } from '../util/log';\n\nconst LOG_TAG = 'OnlineStateTracker';\n\n// To deal with transient failures, we allow multiple stream attempts before\n// giving up and transitioning from OnlineState.Unknown to Offline.\n// TODO(mikelehen): This used to be set to 2 as a mitigation for b/66228394.\n// @jdimond thinks that bug is sufficiently fixed so that we can set this back\n// to 1. If that works okay, we could potentially remove this logic entirely.\nconst MAX_WATCH_STREAM_FAILURES = 1;\n\n// To deal with stream attempts that don't succeed or fail in a timely manner,\n// we have a timeout for OnlineState to reach Online or Offline.\n// If the timeout is reached, we transition to Offline rather than waiting\n// indefinitely.\nconst ONLINE_STATE_TIMEOUT_MS = 10 * 1000;\n\n/**\n * A component used by the RemoteStore to track the OnlineState (that is,\n * whether or not the client as a whole should be considered to be online or\n * offline), implementing the appropriate heuristics.\n *\n * In particular, when the client is trying to connect to the backend, we\n * allow up to MAX_WATCH_STREAM_FAILURES within ONLINE_STATE_TIMEOUT_MS for\n * a connection to succeed. If we have too many failures or the timeout elapses,\n * then we set the OnlineState to Offline, and the client will behave as if\n * it is offline (get()s will return cached data, etc.).\n */\nexport class OnlineStateTracker {\n  /** The current OnlineState. */\n  private state = OnlineState.Unknown;\n\n  /**\n   * A count of consecutive failures to open the stream. If it reaches the\n   * maximum defined by MAX_WATCH_STREAM_FAILURES, we'll set the OnlineState to\n   * Offline.\n   */\n  private watchStreamFailures = 0;\n\n  /**\n   * A timer that elapses after ONLINE_STATE_TIMEOUT_MS, at which point we\n   * transition from OnlineState.Unknown to OnlineState.Offline without waiting\n   * for the stream to actually fail (MAX_WATCH_STREAM_FAILURES times).\n   */\n  private onlineStateTimer: DelayedOperation<void> | null = null;\n\n  /**\n   * Whether the client should log a warning message if it fails to connect to\n   * the backend (initially true, cleared after a successful stream, or if we've\n   * logged the message already).\n   */\n  private shouldWarnClientIsOffline = true;\n\n  constructor(\n    private asyncQueue: AsyncQueue,\n    private onlineStateHandler: (onlineState: OnlineState) => void\n  ) {}\n\n  /**\n   * Called by RemoteStore when a watch stream is started (including on each\n   * backoff attempt).\n   *\n   * If this is the first attempt, it sets the OnlineState to Unknown and starts\n   * the onlineStateTimer.\n   */\n  handleWatchStreamStart(): void {\n    if (this.watchStreamFailures === 0) {\n      this.setAndBroadcast(OnlineState.Unknown);\n\n      debugAssert(\n        this.onlineStateTimer === null,\n        `onlineStateTimer shouldn't be started yet`\n      );\n      this.onlineStateTimer = this.asyncQueue.enqueueAfterDelay(\n        TimerId.OnlineStateTimeout,\n        ONLINE_STATE_TIMEOUT_MS,\n        () => {\n          this.onlineStateTimer = null;\n          debugAssert(\n            this.state === OnlineState.Unknown,\n            'Timer should be canceled if we transitioned to a different state.'\n          );\n          this.logClientOfflineWarningIfNecessary(\n            `Backend didn't respond within ${ONLINE_STATE_TIMEOUT_MS / 1000} ` +\n              `seconds.`\n          );\n          this.setAndBroadcast(OnlineState.Offline);\n\n          // NOTE: handleWatchStreamFailure() will continue to increment\n          // watchStreamFailures even though we are already marked Offline,\n          // but this is non-harmful.\n\n          return Promise.resolve();\n        }\n      );\n    }\n  }\n\n  /**\n   * Updates our OnlineState as appropriate after the watch stream reports a\n   * failure. The first failure moves us to the 'Unknown' state. We then may\n   * allow multiple failures (based on MAX_WATCH_STREAM_FAILURES) before we\n   * actually transition to the 'Offline' state.\n   */\n  handleWatchStreamFailure(error: FirestoreError): void {\n    if (this.state === OnlineState.Online) {\n      this.setAndBroadcast(OnlineState.Unknown);\n\n      // To get to OnlineState.Online, set() must have been called which would\n      // have reset our heuristics.\n      debugAssert(\n        this.watchStreamFailures === 0,\n        'watchStreamFailures must be 0'\n      );\n      debugAssert(\n        this.onlineStateTimer === null,\n        'onlineStateTimer must be null'\n      );\n    } else {\n      this.watchStreamFailures++;\n      if (this.watchStreamFailures >= MAX_WATCH_STREAM_FAILURES) {\n        this.clearOnlineStateTimer();\n\n        this.logClientOfflineWarningIfNecessary(\n          `Connection failed ${MAX_WATCH_STREAM_FAILURES} ` +\n            `times. Most recent error: ${error.toString()}`\n        );\n\n        this.setAndBroadcast(OnlineState.Offline);\n      }\n    }\n  }\n\n  /**\n   * Explicitly sets the OnlineState to the specified state.\n   *\n   * Note that this resets our timers / failure counters, etc. used by our\n   * Offline heuristics, so must not be used in place of\n   * handleWatchStreamStart() and handleWatchStreamFailure().\n   */\n  set(newState: OnlineState): void {\n    this.clearOnlineStateTimer();\n    this.watchStreamFailures = 0;\n\n    if (newState === OnlineState.Online) {\n      // We've connected to watch at least once. Don't warn the developer\n      // about being offline going forward.\n      this.shouldWarnClientIsOffline = false;\n    }\n\n    this.setAndBroadcast(newState);\n  }\n\n  private setAndBroadcast(newState: OnlineState): void {\n    if (newState !== this.state) {\n      this.state = newState;\n      this.onlineStateHandler(newState);\n    }\n  }\n\n  private logClientOfflineWarningIfNecessary(details: string): void {\n    const message =\n      `Could not reach Cloud Firestore backend. ${details}\\n` +\n      `This typically indicates that your device does not have a healthy ` +\n      `Internet connection at the moment. The client will operate in offline ` +\n      `mode until it is able to successfully connect to the backend.`;\n    if (this.shouldWarnClientIsOffline) {\n      logError(message);\n      this.shouldWarnClientIsOffline = false;\n    } else {\n      logDebug(LOG_TAG, message);\n    }\n  }\n\n  private clearOnlineStateTimer(): void {\n    if (this.onlineStateTimer !== null) {\n      this.onlineStateTimer.cancel();\n      this.onlineStateTimer = null;\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 { SnapshotVersion } from '../core/snapshot_version';\nimport { Transaction } from '../core/transaction';\nimport { OnlineState, TargetId } from '../core/types';\nimport { ignoreIfPrimaryLeaseLoss, LocalStore } from '../local/local_store';\nimport { TargetData, TargetPurpose } from '../local/target_data';\nimport { MutationResult } from '../model/mutation';\nimport {\n  BATCHID_UNKNOWN,\n  MutationBatch,\n  MutationBatchResult\n} from '../model/mutation_batch';\nimport { debugAssert } from '../util/assert';\nimport { FirestoreError } from '../util/error';\nimport { logDebug } from '../util/log';\nimport { DocumentKeySet } from '../model/collections';\nimport { AsyncQueue } from '../util/async_queue';\nimport { ConnectivityMonitor, NetworkStatus } from './connectivity_monitor';\nimport {\n  Datastore,\n  newPersistentWatchStream,\n  newPersistentWriteStream\n} from './datastore';\nimport { OnlineStateTracker } from './online_state_tracker';\nimport {\n  PersistentListenStream,\n  PersistentWriteStream\n} from './persistent_stream';\nimport { RemoteSyncer } from './remote_syncer';\nimport { isPermanentError, isPermanentWriteError } from './rpc_error';\nimport {\n  DocumentWatchChange,\n  ExistenceFilterChange,\n  TargetMetadataProvider,\n  WatchChange,\n  WatchChangeAggregator,\n  WatchTargetChange,\n  WatchTargetChangeState\n} from './watch_change';\nimport { ByteString } from '../util/byte_string';\nimport { isIndexedDbTransactionError } from '../local/simple_db';\n\nconst LOG_TAG = 'RemoteStore';\n\n// TODO(b/35853402): Negotiate this with the stream.\nconst MAX_PENDING_WRITES = 10;\n\n/**\n * RemoteStore - An interface to remotely stored data, basically providing a\n * wrapper around the Datastore that is more reliable for the rest of the\n * system.\n *\n * RemoteStore is responsible for maintaining the connection to the server.\n * - maintaining a list of active listens.\n * - reconnecting when the connection is dropped.\n * - resuming all the active listens on reconnect.\n *\n * RemoteStore handles all incoming events from the Datastore.\n * - listening to the watch stream and repackaging the events as RemoteEvents\n * - notifying SyncEngine of any changes to the active listens.\n *\n * RemoteStore takes writes from other components and handles them reliably.\n * - pulling pending mutations from LocalStore and sending them to Datastore.\n * - retrying mutations that failed because of network problems.\n * - acking mutations to the SyncEngine once they are accepted or rejected.\n */\nexport class RemoteStore implements TargetMetadataProvider {\n  /**\n   * A list of up to MAX_PENDING_WRITES writes that we have fetched from the\n   * LocalStore via fillWritePipeline() and have or will send to the write\n   * stream.\n   *\n   * Whenever writePipeline.length > 0 the RemoteStore will attempt to start or\n   * restart the write stream. When the stream is established the writes in the\n   * pipeline will be sent in order.\n   *\n   * Writes remain in writePipeline until they are acknowledged by the backend\n   * and thus will automatically be re-sent if the stream is interrupted /\n   * restarted before they're acknowledged.\n   *\n   * Write responses from the backend are linked to their originating request\n   * purely based on order, and so we can just shift() writes from the front of\n   * the writePipeline as we receive responses.\n   */\n  private writePipeline: MutationBatch[] = [];\n\n  /**\n   * A mapping of watched targets that the client cares about tracking and the\n   * user has explicitly called a 'listen' for this target.\n   *\n   * These targets may or may not have been sent to or acknowledged by the\n   * server. On re-establishing the listen stream, these targets should be sent\n   * to the server. The targets removed with unlistens are removed eagerly\n   * without waiting for confirmation from the listen stream.\n   */\n  private listenTargets = new Map<TargetId, TargetData>();\n\n  private connectivityMonitor: ConnectivityMonitor;\n  private watchStream: PersistentListenStream;\n  private writeStream: PersistentWriteStream;\n  private watchChangeAggregator: WatchChangeAggregator | null = null;\n\n  /**\n   * Set to true by enableNetwork() and false by disableNetwork() and indicates\n   * the user-preferred network state.\n   */\n  private networkEnabled = false;\n\n  private isPrimary = false;\n\n  /**\n   * When set to `true`, the network was taken offline due to an IndexedDB\n   * failure. The state is flipped to `false` when access becomes available\n   * again.\n   */\n  private indexedDbFailed = false;\n\n  private onlineStateTracker: OnlineStateTracker;\n\n  constructor(\n    /**\n     * The local store, used to fill the write pipeline with outbound mutations.\n     */\n    private localStore: LocalStore,\n    /** The client-side proxy for interacting with the backend. */\n    private datastore: Datastore,\n    private asyncQueue: AsyncQueue,\n    onlineStateHandler: (onlineState: OnlineState) => void,\n    connectivityMonitor: ConnectivityMonitor\n  ) {\n    this.connectivityMonitor = connectivityMonitor;\n    this.connectivityMonitor.addCallback((status: NetworkStatus) => {\n      asyncQueue.enqueueAndForget(async () => {\n        if (this.canUseNetwork()) {\n          logDebug(\n            LOG_TAG,\n            'Restarting streams for network reachability change.'\n          );\n          await this.restartNetwork();\n        }\n      });\n    });\n\n    this.onlineStateTracker = new OnlineStateTracker(\n      asyncQueue,\n      onlineStateHandler\n    );\n\n    // Create streams (but note they're not started yet).\n    this.watchStream = newPersistentWatchStream(this.datastore, asyncQueue, {\n      onOpen: this.onWatchStreamOpen.bind(this),\n      onClose: this.onWatchStreamClose.bind(this),\n      onWatchChange: this.onWatchStreamChange.bind(this)\n    });\n\n    this.writeStream = newPersistentWriteStream(this.datastore, asyncQueue, {\n      onOpen: this.onWriteStreamOpen.bind(this),\n      onClose: this.onWriteStreamClose.bind(this),\n      onHandshakeComplete: this.onWriteHandshakeComplete.bind(this),\n      onMutationResult: this.onMutationResult.bind(this)\n    });\n  }\n\n  /**\n   * SyncEngine to notify of watch and write events. This must be set\n   * immediately after construction.\n   */\n  syncEngine!: RemoteSyncer;\n\n  /**\n   * Starts up the remote store, creating streams, restoring state from\n   * LocalStore, etc.\n   */\n  start(): Promise<void> {\n    return this.enableNetwork();\n  }\n\n  /** Re-enables the network. Idempotent. */\n  enableNetwork(): Promise<void> {\n    this.networkEnabled = true;\n    return this.enableNetworkInternal();\n  }\n\n  private async enableNetworkInternal(): Promise<void> {\n    if (this.canUseNetwork()) {\n      this.writeStream.lastStreamToken = await this.localStore.getLastStreamToken();\n\n      if (this.shouldStartWatchStream()) {\n        this.startWatchStream();\n      } else {\n        this.onlineStateTracker.set(OnlineState.Unknown);\n      }\n\n      // This will start the write stream if necessary.\n      await this.fillWritePipeline();\n    }\n  }\n\n  /**\n   * Temporarily disables the network. The network can be re-enabled using\n   * enableNetwork().\n   */\n  async disableNetwork(): Promise<void> {\n    this.networkEnabled = false;\n    await this.disableNetworkInternal();\n\n    // Set the OnlineState to Offline so get()s return from cache, etc.\n    this.onlineStateTracker.set(OnlineState.Offline);\n  }\n\n  private async disableNetworkInternal(): Promise<void> {\n    await this.writeStream.stop();\n    await this.watchStream.stop();\n\n    if (this.writePipeline.length > 0) {\n      logDebug(\n        LOG_TAG,\n        `Stopping write stream with ${this.writePipeline.length} pending writes`\n      );\n      this.writePipeline = [];\n    }\n\n    this.cleanUpWatchStreamState();\n  }\n\n  async shutdown(): Promise<void> {\n    logDebug(LOG_TAG, 'RemoteStore shutting down.');\n    this.networkEnabled = false;\n    await this.disableNetworkInternal();\n    this.connectivityMonitor.shutdown();\n\n    // Set the OnlineState to Unknown (rather than Offline) to avoid potentially\n    // triggering spurious listener events with cached data, etc.\n    this.onlineStateTracker.set(OnlineState.Unknown);\n  }\n\n  /**\n   * Starts new listen for the given target. Uses resume token if provided. It\n   * is a no-op if the target of given `TargetData` is already being listened to.\n   */\n  listen(targetData: TargetData): void {\n    if (this.listenTargets.has(targetData.targetId)) {\n      return;\n    }\n\n    // Mark this as something the client is currently listening for.\n    this.listenTargets.set(targetData.targetId, targetData);\n\n    if (this.shouldStartWatchStream()) {\n      // The listen will be sent in onWatchStreamOpen\n      this.startWatchStream();\n    } else if (this.watchStream.isOpen()) {\n      this.sendWatchRequest(targetData);\n    }\n  }\n\n  /**\n   * Removes the listen from server. It is a no-op if the given target id is\n   * not being listened to.\n   */\n  unlisten(targetId: TargetId): void {\n    debugAssert(\n      this.listenTargets.has(targetId),\n      `unlisten called on target no currently watched: ${targetId}`\n    );\n\n    this.listenTargets.delete(targetId);\n    if (this.watchStream.isOpen()) {\n      this.sendUnwatchRequest(targetId);\n    }\n\n    if (this.listenTargets.size === 0) {\n      if (this.watchStream.isOpen()) {\n        this.watchStream.markIdle();\n      } else if (this.canUseNetwork()) {\n        // Revert to OnlineState.Unknown if the watch stream is not open and we\n        // have no listeners, since without any listens to send we cannot\n        // confirm if the stream is healthy and upgrade to OnlineState.Online.\n        this.onlineStateTracker.set(OnlineState.Unknown);\n      }\n    }\n  }\n\n  /** {@link TargetMetadataProvider.getTargetDataForTarget} */\n  getTargetDataForTarget(targetId: TargetId): TargetData | null {\n    return this.listenTargets.get(targetId) || null;\n  }\n\n  /** {@link TargetMetadataProvider.getRemoteKeysForTarget} */\n  getRemoteKeysForTarget(targetId: TargetId): DocumentKeySet {\n    return this.syncEngine.getRemoteKeysForTarget(targetId);\n  }\n\n  /**\n   * We need to increment the the expected number of pending responses we're due\n   * from watch so we wait for the ack to process any messages from this target.\n   */\n  private sendWatchRequest(targetData: TargetData): void {\n    this.watchChangeAggregator!.recordPendingTargetRequest(targetData.targetId);\n    this.watchStream.watch(targetData);\n  }\n\n  /**\n   * We need to increment the expected number of pending responses we're due\n   * from watch so we wait for the removal on the server before we process any\n   * messages from this target.\n   */\n  private sendUnwatchRequest(targetId: TargetId): void {\n    this.watchChangeAggregator!.recordPendingTargetRequest(targetId);\n    this.watchStream.unwatch(targetId);\n  }\n\n  private startWatchStream(): void {\n    debugAssert(\n      this.shouldStartWatchStream(),\n      'startWatchStream() called when shouldStartWatchStream() is false.'\n    );\n\n    this.watchChangeAggregator = new WatchChangeAggregator(this);\n    this.watchStream.start();\n    this.onlineStateTracker.handleWatchStreamStart();\n  }\n\n  /**\n   * Returns whether the watch stream should be started because it's necessary\n   * and has not yet been started.\n   */\n  private shouldStartWatchStream(): boolean {\n    return (\n      this.canUseNetwork() &&\n      !this.watchStream.isStarted() &&\n      this.listenTargets.size > 0\n    );\n  }\n\n  canUseNetwork(): boolean {\n    return !this.indexedDbFailed && this.isPrimary && this.networkEnabled;\n  }\n\n  private cleanUpWatchStreamState(): void {\n    this.watchChangeAggregator = null;\n  }\n\n  private async onWatchStreamOpen(): Promise<void> {\n    this.listenTargets.forEach((targetData, targetId) => {\n      this.sendWatchRequest(targetData);\n    });\n  }\n\n  private async onWatchStreamClose(error?: FirestoreError): Promise<void> {\n    if (error === undefined) {\n      // Graceful stop (due to stop() or idle timeout). Make sure that's\n      // desirable.\n      debugAssert(\n        !this.shouldStartWatchStream(),\n        'Watch stream was stopped gracefully while still needed.'\n      );\n    }\n\n    this.cleanUpWatchStreamState();\n\n    // If we still need the watch stream, retry the connection.\n    if (this.shouldStartWatchStream()) {\n      this.onlineStateTracker.handleWatchStreamFailure(error!);\n\n      this.startWatchStream();\n    } else {\n      // No need to restart watch stream because there are no active targets.\n      // The online state is set to unknown because there is no active attempt\n      // at establishing a connection\n      this.onlineStateTracker.set(OnlineState.Unknown);\n    }\n  }\n\n  private async onWatchStreamChange(\n    watchChange: WatchChange,\n    snapshotVersion: SnapshotVersion\n  ): Promise<void> {\n    // Mark the client as online since we got a message from the server\n    this.onlineStateTracker.set(OnlineState.Online);\n\n    if (\n      watchChange instanceof WatchTargetChange &&\n      watchChange.state === WatchTargetChangeState.Removed &&\n      watchChange.cause\n    ) {\n      // There was an error on a target, don't wait for a consistent snapshot\n      // to raise events\n      try {\n        await this.handleTargetError(watchChange);\n      } catch (e) {\n        logDebug(\n          LOG_TAG,\n          'Failed to remove targets %s: %s ',\n          watchChange.targetIds.join(','),\n          e\n        );\n        await this.disableNetworkUntilRecovery(e);\n      }\n      return;\n    }\n\n    if (watchChange instanceof DocumentWatchChange) {\n      this.watchChangeAggregator!.handleDocumentChange(watchChange);\n    } else if (watchChange instanceof ExistenceFilterChange) {\n      this.watchChangeAggregator!.handleExistenceFilter(watchChange);\n    } else {\n      debugAssert(\n        watchChange instanceof WatchTargetChange,\n        'Expected watchChange to be an instance of WatchTargetChange'\n      );\n      this.watchChangeAggregator!.handleTargetChange(watchChange);\n    }\n\n    if (!snapshotVersion.isEqual(SnapshotVersion.min())) {\n      try {\n        const lastRemoteSnapshotVersion = await this.localStore.getLastRemoteSnapshotVersion();\n        if (snapshotVersion.compareTo(lastRemoteSnapshotVersion) >= 0) {\n          // We have received a target change with a global snapshot if the snapshot\n          // version is not equal to SnapshotVersion.min().\n          await this.raiseWatchSnapshot(snapshotVersion);\n        }\n      } catch (e) {\n        logDebug(LOG_TAG, 'Failed to raise snapshot:', e);\n        await this.disableNetworkUntilRecovery(e);\n      }\n    }\n  }\n\n  /**\n   * Recovery logic for IndexedDB errors that takes the network offline until\n   * IndexedDb probing succeeds. Retries are scheduled with backoff using\n   * `enqueueRetryable()`.\n   */\n  private async disableNetworkUntilRecovery(e: FirestoreError): Promise<void> {\n    if (isIndexedDbTransactionError(e)) {\n      debugAssert(\n        !this.indexedDbFailed,\n        'Unexpected network event when IndexedDB was marked failed.'\n      );\n      this.indexedDbFailed = true;\n\n      // Disable network and raise offline snapshots\n      await this.disableNetworkInternal();\n      this.onlineStateTracker.set(OnlineState.Offline);\n\n      // Probe IndexedDB periodically and re-enable network\n      this.asyncQueue.enqueueRetryable(async () => {\n        logDebug(LOG_TAG, 'Retrying IndexedDB access');\n        // Issue a simple read operation to determine if IndexedDB recovered.\n        // Ideally, we would expose a health check directly on SimpleDb, but\n        // RemoteStore only has access to persistence through LocalStore.\n        await this.localStore.getLastRemoteSnapshotVersion();\n        this.indexedDbFailed = false;\n        await this.enableNetworkInternal();\n      });\n    } else {\n      throw e;\n    }\n  }\n\n  /**\n   * Takes a batch of changes from the Datastore, repackages them as a\n   * RemoteEvent, and passes that on to the listener, which is typically the\n   * SyncEngine.\n   */\n  private raiseWatchSnapshot(snapshotVersion: SnapshotVersion): Promise<void> {\n    debugAssert(\n      !snapshotVersion.isEqual(SnapshotVersion.min()),\n      \"Can't raise event for unknown SnapshotVersion\"\n    );\n    const remoteEvent = this.watchChangeAggregator!.createRemoteEvent(\n      snapshotVersion\n    );\n\n    // Update in-memory resume tokens. LocalStore will update the\n    // persistent view of these when applying the completed RemoteEvent.\n    remoteEvent.targetChanges.forEach((change, targetId) => {\n      if (change.resumeToken.approximateByteSize() > 0) {\n        const targetData = this.listenTargets.get(targetId);\n        // A watched target might have been removed already.\n        if (targetData) {\n          this.listenTargets.set(\n            targetId,\n            targetData.withResumeToken(change.resumeToken, snapshotVersion)\n          );\n        }\n      }\n    });\n\n    // Re-establish listens for the targets that have been invalidated by\n    // existence filter mismatches.\n    remoteEvent.targetMismatches.forEach(targetId => {\n      const targetData = this.listenTargets.get(targetId);\n      if (!targetData) {\n        // A watched target might have been removed already.\n        return;\n      }\n\n      // Clear the resume token for the target, since we're in a known mismatch\n      // state.\n      this.listenTargets.set(\n        targetId,\n        targetData.withResumeToken(\n          ByteString.EMPTY_BYTE_STRING,\n          targetData.snapshotVersion\n        )\n      );\n\n      // Cause a hard reset by unwatching and rewatching immediately, but\n      // deliberately don't send a resume token so that we get a full update.\n      this.sendUnwatchRequest(targetId);\n\n      // Mark the target we send as being on behalf of an existence filter\n      // mismatch, but don't actually retain that in listenTargets. This ensures\n      // that we flag the first re-listen this way without impacting future\n      // listens of this target (that might happen e.g. on reconnect).\n      const requestTargetData = new TargetData(\n        targetData.target,\n        targetId,\n        TargetPurpose.ExistenceFilterMismatch,\n        targetData.sequenceNumber\n      );\n      this.sendWatchRequest(requestTargetData);\n    });\n\n    // Finally raise remote event\n    return this.syncEngine.applyRemoteEvent(remoteEvent);\n  }\n\n  /** Handles an error on a target */\n  private async handleTargetError(\n    watchChange: WatchTargetChange\n  ): Promise<void> {\n    debugAssert(!!watchChange.cause, 'Handling target error without a cause');\n    const error = watchChange.cause!;\n    for (const targetId of watchChange.targetIds) {\n      // A watched target might have been removed already.\n      if (this.listenTargets.has(targetId)) {\n        await this.syncEngine.rejectListen(targetId, error);\n        this.listenTargets.delete(targetId);\n        this.watchChangeAggregator!.removeTarget(targetId);\n      }\n    }\n  }\n\n  /**\n   * Attempts to fill our write pipeline with writes from the LocalStore.\n   *\n   * Called internally to bootstrap or refill the write pipeline and by\n   * SyncEngine whenever there are new mutations to process.\n   *\n   * Starts the write stream if necessary.\n   */\n  async fillWritePipeline(): Promise<void> {\n    if (this.canAddToWritePipeline()) {\n      const lastBatchIdRetrieved =\n        this.writePipeline.length > 0\n          ? this.writePipeline[this.writePipeline.length - 1].batchId\n          : BATCHID_UNKNOWN;\n      const batch = await this.localStore.nextMutationBatch(\n        lastBatchIdRetrieved\n      );\n\n      if (batch === null) {\n        if (this.writePipeline.length === 0) {\n          this.writeStream.markIdle();\n        }\n      } else {\n        this.addToWritePipeline(batch);\n        await this.fillWritePipeline();\n      }\n    }\n\n    if (this.shouldStartWriteStream()) {\n      this.startWriteStream();\n    }\n  }\n\n  /**\n   * Returns true if we can add to the write pipeline (i.e. the network is\n   * enabled and the write pipeline is not full).\n   */\n  private canAddToWritePipeline(): boolean {\n    return (\n      this.canUseNetwork() && this.writePipeline.length < MAX_PENDING_WRITES\n    );\n  }\n\n  // For testing\n  outstandingWrites(): number {\n    return this.writePipeline.length;\n  }\n\n  /**\n   * Queues additional writes to be sent to the write stream, sending them\n   * immediately if the write stream is established.\n   */\n  private addToWritePipeline(batch: MutationBatch): void {\n    debugAssert(\n      this.canAddToWritePipeline(),\n      'addToWritePipeline called when pipeline is full'\n    );\n    this.writePipeline.push(batch);\n\n    if (this.writeStream.isOpen() && this.writeStream.handshakeComplete) {\n      this.writeStream.writeMutations(batch.mutations);\n    }\n  }\n\n  private shouldStartWriteStream(): boolean {\n    return (\n      this.canUseNetwork() &&\n      !this.writeStream.isStarted() &&\n      this.writePipeline.length > 0\n    );\n  }\n\n  private startWriteStream(): void {\n    debugAssert(\n      this.shouldStartWriteStream(),\n      'startWriteStream() called when shouldStartWriteStream() is false.'\n    );\n    this.writeStream.start();\n  }\n\n  private async onWriteStreamOpen(): Promise<void> {\n    this.writeStream.writeHandshake();\n  }\n\n  private onWriteHandshakeComplete(): Promise<void> {\n    // Record the stream token.\n    return this.localStore\n      .setLastStreamToken(this.writeStream.lastStreamToken)\n      .then(() => {\n        // Send the write pipeline now that the stream is established.\n        for (const batch of this.writePipeline) {\n          this.writeStream.writeMutations(batch.mutations);\n        }\n      })\n      .catch(ignoreIfPrimaryLeaseLoss);\n  }\n\n  private onMutationResult(\n    commitVersion: SnapshotVersion,\n    results: MutationResult[]\n  ): Promise<void> {\n    // This is a response to a write containing mutations and should be\n    // correlated to the first write in our write pipeline.\n    debugAssert(\n      this.writePipeline.length > 0,\n      'Got result for empty write pipeline'\n    );\n    const batch = this.writePipeline.shift()!;\n    const success = MutationBatchResult.from(\n      batch,\n      commitVersion,\n      results,\n      this.writeStream.lastStreamToken\n    );\n    return this.syncEngine.applySuccessfulWrite(success).then(() => {\n      // It's possible that with the completion of this mutation another\n      // slot has freed up.\n      return this.fillWritePipeline();\n    });\n  }\n\n  private async onWriteStreamClose(error?: FirestoreError): Promise<void> {\n    if (error === undefined) {\n      // Graceful stop (due to stop() or idle timeout). Make sure that's\n      // desirable.\n      debugAssert(\n        !this.shouldStartWriteStream(),\n        'Write stream was stopped gracefully while still needed.'\n      );\n    }\n\n    // If the write stream closed due to an error, invoke the error callbacks if\n    // there are pending writes.\n    if (error && this.writePipeline.length > 0) {\n      if (this.writeStream.handshakeComplete) {\n        // This error affects the actual write.\n        await this.handleWriteError(error!);\n      } else {\n        // If there was an error before the handshake has finished, it's\n        // possible that the server is unable to process the stream token\n        // we're sending. (Perhaps it's too old?)\n        await this.handleHandshakeError(error!);\n      }\n\n      // The write stream might have been started by refilling the write\n      // pipeline for failed writes\n      if (this.shouldStartWriteStream()) {\n        this.startWriteStream();\n      }\n    }\n    // No pending writes, nothing to do\n  }\n\n  private async handleHandshakeError(error: FirestoreError): Promise<void> {\n    // Reset the token if it's a permanent error, signaling the write stream is\n    // no longer valid. Note that the handshake does not count as a write: see\n    // comments on isPermanentWriteError for details.\n    if (isPermanentError(error.code)) {\n      logDebug(\n        LOG_TAG,\n        'RemoteStore error before completed handshake; resetting stream token: ',\n        this.writeStream.lastStreamToken\n      );\n      this.writeStream.lastStreamToken = ByteString.EMPTY_BYTE_STRING;\n\n      return this.localStore\n        .setLastStreamToken(ByteString.EMPTY_BYTE_STRING)\n        .catch(ignoreIfPrimaryLeaseLoss);\n    } else {\n      // Some other error, don't reset stream token. Our stream logic will\n      // just retry with exponential backoff.\n    }\n  }\n\n  private async handleWriteError(error: FirestoreError): Promise<void> {\n    // Only handle permanent errors here. If it's transient, just let the retry\n    // logic kick in.\n    if (isPermanentWriteError(error.code)) {\n      // This was a permanent error, the request itself was the problem\n      // so it's not going to succeed if we resend it.\n      const batch = this.writePipeline.shift()!;\n\n      // In this case it's also unlikely that the server itself is melting\n      // down -- this was just a bad request so inhibit backoff on the next\n      // restart.\n      this.writeStream.inhibitBackoff();\n\n      return this.syncEngine\n        .rejectFailedWrite(batch.batchId, error)\n        .then(() => {\n          // It's possible that with the completion of this mutation\n          // another slot has freed up.\n          return this.fillWritePipeline();\n        });\n    } else {\n      // Transient error, just let the retry logic kick in.\n    }\n  }\n\n  createTransaction(): Transaction {\n    return new Transaction(this.datastore);\n  }\n\n  private async restartNetwork(): Promise<void> {\n    this.networkEnabled = false;\n    await this.disableNetworkInternal();\n    this.onlineStateTracker.set(OnlineState.Unknown);\n    await this.enableNetwork();\n  }\n\n  async handleCredentialChange(): Promise<void> {\n    if (this.canUseNetwork()) {\n      // Tear down and re-create our network streams. This will ensure we get a fresh auth token\n      // for the new user and re-fill the write pipeline with new mutations from the LocalStore\n      // (since mutations are per-user).\n      logDebug(LOG_TAG, 'RemoteStore restarting streams for new credential');\n      await this.restartNetwork();\n    }\n  }\n\n  /**\n   * Toggles the network state when the client gains or loses its primary lease.\n   */\n  async applyPrimaryState(isPrimary: boolean): Promise<void> {\n    this.isPrimary = isPrimary;\n\n    if (isPrimary && this.networkEnabled) {\n      await this.enableNetwork();\n    } else if (!isPrimary) {\n      await this.disableNetworkInternal();\n      this.onlineStateTracker.set(OnlineState.Unknown);\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 { BatchId, MutationBatchState, TargetId } from '../core/types';\nimport { QueryTargetState } from './shared_client_state_syncer';\nimport { debugAssert } from '../util/assert';\nimport { ClientId } from './shared_client_state';\nimport { User } from '../auth/user';\n\n// The format of the LocalStorage key that stores the client state is:\n//     firestore_clients_<persistence_prefix>_<instance_key>\nexport const CLIENT_STATE_KEY_PREFIX = 'firestore_clients';\n\n/** Assembles the key for a client state in WebStorage */\nexport function createWebStorageClientStateKey(\n  persistenceKey: string,\n  clientId: ClientId\n): string {\n  debugAssert(\n    clientId.indexOf('_') === -1,\n    `Client key cannot contain '_', but was '${clientId}'`\n  );\n\n  return `${CLIENT_STATE_KEY_PREFIX}_${persistenceKey}_${clientId}`;\n}\n\n/**\n * The JSON representation of a clients's metadata as used during WebStorage\n * serialization. The ClientId is omitted here as it is encoded as part of the\n * key.\n */\nexport interface ClientStateSchema {\n  activeTargetIds: number[];\n  updateTimeMs: number;\n}\n\n// The format of the WebStorage key that stores the mutation state is:\n//     firestore_mutations_<persistence_prefix>_<batch_id>\n//     (for unauthenticated users)\n// or: firestore_mutations_<persistence_prefix>_<batch_id>_<user_uid>\n//\n// 'user_uid' is last to avoid needing to escape '_' characters that it might\n// contain.\nexport const MUTATION_BATCH_KEY_PREFIX = 'firestore_mutations';\n\n/** Assembles the key for a mutation batch in WebStorage */\nexport function createWebStorageMutationBatchKey(\n  persistenceKey: string,\n  user: User,\n  batchId: BatchId\n): string {\n  let mutationKey = `${MUTATION_BATCH_KEY_PREFIX}_${persistenceKey}_${batchId}`;\n\n  if (user.isAuthenticated()) {\n    mutationKey += `_${user.uid}`;\n  }\n\n  return mutationKey;\n}\n\n/**\n * The JSON representation of a mutation batch's metadata as used during\n * WebStorage serialization. The UserId and BatchId is omitted as it is\n * encoded as part of the key.\n */\nexport interface MutationMetadataSchema {\n  state: MutationBatchState;\n  error?: { code: string; message: string }; // Only set when state === 'rejected'\n  updateTimeMs: number;\n}\n\n// The format of the WebStorage key that stores a query target's metadata is:\n//     firestore_targets_<persistence_prefix>_<target_id>\nexport const QUERY_TARGET_KEY_PREFIX = 'firestore_targets';\n\n/** Assembles the key for a query state in WebStorage */\nexport function createWebStorageQueryTargetMetadataKey(\n  persistenceKey: string,\n  targetId: TargetId\n): string {\n  return `${QUERY_TARGET_KEY_PREFIX}_${persistenceKey}_${targetId}`;\n}\n\n/**\n * The JSON representation of a query target's state as used during WebStorage\n * serialization. The TargetId is omitted as it is encoded as part of the key.\n */\nexport interface QueryTargetStateSchema {\n  state: QueryTargetState;\n  error?: { code: string; message: string }; // Only set when state === 'rejected'\n  updateTimeMs: number;\n}\n\n// The WebStorage prefix that stores the primary tab's online state. The\n// format of the key is:\n//     firestore_online_state_<persistence_prefix>\nexport const ONLINE_STATE_KEY_PREFIX = 'firestore_online_state';\n\n/** Assembles the key for the online state of the primary tab. */\nexport function createWebStorageOnlineStateKey(persistenceKey: string): string {\n  return `${ONLINE_STATE_KEY_PREFIX}_${persistenceKey}`;\n}\n\n/**\n * The JSON representation of the system's online state, as written by the\n * primary client.\n */\nexport interface SharedOnlineStateSchema {\n  /**\n   * The clientId of the client that wrote this onlineState value. Tracked so\n   * that on startup, clients can check if this client is still active when\n   * determining whether to apply this value or not.\n   */\n  readonly clientId: string;\n  readonly onlineState: string;\n}\n\n// The WebStorage key prefix for the key that stores the last sequence number allocated. The key\n// looks like 'firestore_sequence_number_<persistence_prefix>'.\nexport const SEQUENCE_NUMBER_KEY_PREFIX = 'firestore_sequence_number';\n\n/** Assembles the key for the current sequence number. */\nexport function createWebStorageSequenceNumberKey(\n  persistenceKey: string\n): string {\n  return `${SEQUENCE_NUMBER_KEY_PREFIX}_${persistenceKey}`;\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 { User } from '../auth/user';\nimport { ListenSequence } from '../core/listen_sequence';\nimport {\n  BatchId,\n  ListenSequenceNumber,\n  MutationBatchState,\n  OnlineState,\n  TargetId\n} from '../core/types';\nimport { TargetIdSet, targetIdSet } from '../model/collections';\nimport { Platform } from '../platform/platform';\nimport { hardAssert, debugAssert } from '../util/assert';\nimport { AsyncQueue } from '../util/async_queue';\nimport { Code, FirestoreError } from '../util/error';\nimport { logError, logDebug } from '../util/log';\nimport { SortedSet } from '../util/sorted_set';\nimport { SortedMap } from '../util/sorted_map';\nimport { primitiveComparator } from '../util/misc';\nimport { isSafeInteger } from '../util/types';\nimport {\n  QueryTargetState,\n  SharedClientStateSyncer\n} from './shared_client_state_syncer';\nimport {\n  CLIENT_STATE_KEY_PREFIX,\n  ClientStateSchema,\n  createWebStorageClientStateKey,\n  createWebStorageMutationBatchKey,\n  createWebStorageOnlineStateKey,\n  createWebStorageQueryTargetMetadataKey,\n  createWebStorageSequenceNumberKey,\n  MUTATION_BATCH_KEY_PREFIX,\n  MutationMetadataSchema,\n  QUERY_TARGET_KEY_PREFIX,\n  QueryTargetStateSchema,\n  SharedOnlineStateSchema\n} from './shared_client_state_schema';\n\nconst LOG_TAG = 'SharedClientState';\n\n/**\n * A randomly-generated key assigned to each Firestore instance at startup.\n */\nexport type ClientId = string;\n\n/**\n * A `SharedClientState` keeps track of the global state of the mutations\n * and query targets for all active clients with the same persistence key (i.e.\n * project ID and FirebaseApp name). It relays local changes to other clients\n * and updates its local state as new state is observed.\n *\n * `SharedClientState` is primarily used for synchronization in Multi-Tab\n * environments. Each tab is responsible for registering its active query\n * targets and mutations. `SharedClientState` will then notify the listener\n * assigned to `.syncEngine` for updates to mutations and queries that\n * originated in other clients.\n *\n * To receive notifications, `.syncEngine` and `.onlineStateHandler` has to be\n * assigned before calling `start()`.\n */\nexport interface SharedClientState {\n  syncEngine: SharedClientStateSyncer | null;\n  onlineStateHandler: ((onlineState: OnlineState) => void) | null;\n  sequenceNumberHandler:\n    | ((sequenceNumber: ListenSequenceNumber) => void)\n    | null;\n\n  /** Registers the Mutation Batch ID of a newly pending mutation. */\n  addPendingMutation(batchId: BatchId): void;\n\n  /**\n   * Records that a pending mutation has been acknowledged or rejected.\n   * Called by the primary client to notify secondary clients of mutation\n   * results as they come back from the backend.\n   */\n  updateMutationState(\n    batchId: BatchId,\n    state: 'acknowledged' | 'rejected',\n    error?: FirestoreError\n  ): void;\n\n  /**\n   * Associates a new Query Target ID with the local Firestore client. Returns\n   * the new query state for the query (which can be 'current' if the query is\n   * already associated with another tab).\n   *\n   * If the target id is already associated with local client, the method simply\n   * returns its `QueryTargetState`.\n   */\n  addLocalQueryTarget(targetId: TargetId): QueryTargetState;\n\n  /** Removes the Query Target ID association from the local client. */\n  removeLocalQueryTarget(targetId: TargetId): void;\n\n  /** Checks whether the target is associated with the local client. */\n  isLocalQueryTarget(targetId: TargetId): boolean;\n\n  /**\n   * Processes an update to a query target.\n   *\n   * Called by the primary client to notify secondary clients of document\n   * changes or state transitions that affect the provided query target.\n   */\n  updateQueryState(\n    targetId: TargetId,\n    state: QueryTargetState,\n    error?: FirestoreError\n  ): void;\n\n  /**\n   * Removes the target's metadata entry.\n   *\n   * Called by the primary client when all clients stopped listening to a query\n   * target.\n   */\n  clearQueryState(targetId: TargetId): void;\n\n  /**\n   * Gets the active Query Targets IDs for all active clients.\n   *\n   * The implementation for this may require O(n) runtime, where 'n' is the size\n   * of the result set.\n   */\n  // Visible for testing\n  getAllActiveQueryTargets(): SortedSet<TargetId>;\n\n  /**\n   * Checks whether the provided target ID is currently being listened to by\n   * any of the active clients.\n   *\n   * The implementation may require O(n*log m) runtime, where 'n' is the number\n   * of clients and 'm' the number of targets.\n   */\n  isActiveQueryTarget(targetId: TargetId): boolean;\n\n  /**\n   * Starts the SharedClientState, reads existing client data and registers\n   * listeners for updates to new and existing clients.\n   */\n  start(): Promise<void>;\n\n  /** Shuts down the `SharedClientState` and its listeners. */\n  shutdown(): void;\n\n  /**\n   * Changes the active user and removes all existing user-specific data. The\n   * user change does not call back into SyncEngine (for example, no mutations\n   * will be marked as removed).\n   */\n  handleUserChange(\n    user: User,\n    removedBatchIds: BatchId[],\n    addedBatchIds: BatchId[]\n  ): void;\n\n  /** Changes the shared online state of all clients. */\n  setOnlineState(onlineState: OnlineState): void;\n\n  writeSequenceNumber(sequenceNumber: ListenSequenceNumber): void;\n}\n\n/**\n * Holds the state of a mutation batch, including its user ID, batch ID and\n * whether the batch is 'pending', 'acknowledged' or 'rejected'.\n */\n// Visible for testing\nexport class MutationMetadata {\n  constructor(\n    readonly user: User,\n    readonly batchId: BatchId,\n    readonly state: MutationBatchState,\n    readonly error?: FirestoreError\n  ) {\n    debugAssert(\n      (error !== undefined) === (state === 'rejected'),\n      `MutationMetadata must contain an error iff state is 'rejected'`\n    );\n  }\n\n  /**\n   * Parses a MutationMetadata from its JSON representation in WebStorage.\n   * Logs a warning and returns null if the format of the data is not valid.\n   */\n  static fromWebStorageEntry(\n    user: User,\n    batchId: BatchId,\n    value: string\n  ): MutationMetadata | null {\n    const mutationBatch = JSON.parse(value) as MutationMetadataSchema;\n\n    let validData =\n      typeof mutationBatch === 'object' &&\n      ['pending', 'acknowledged', 'rejected'].indexOf(mutationBatch.state) !==\n        -1 &&\n      (mutationBatch.error === undefined ||\n        typeof mutationBatch.error === 'object');\n\n    let firestoreError: FirestoreError | undefined = undefined;\n\n    if (validData && mutationBatch.error) {\n      validData =\n        typeof mutationBatch.error.message === 'string' &&\n        typeof mutationBatch.error.code === 'string';\n      if (validData) {\n        firestoreError = new FirestoreError(\n          mutationBatch.error.code as Code,\n          mutationBatch.error.message\n        );\n      }\n    }\n\n    if (validData) {\n      return new MutationMetadata(\n        user,\n        batchId,\n        mutationBatch.state,\n        firestoreError\n      );\n    } else {\n      logError(\n        LOG_TAG,\n        `Failed to parse mutation state for ID '${batchId}': ${value}`\n      );\n      return null;\n    }\n  }\n\n  toWebStorageJSON(): string {\n    const batchMetadata: MutationMetadataSchema = {\n      state: this.state,\n      updateTimeMs: Date.now() // Modify the existing value to trigger update.\n    };\n\n    if (this.error) {\n      batchMetadata.error = {\n        code: this.error.code,\n        message: this.error.message\n      };\n    }\n\n    return JSON.stringify(batchMetadata);\n  }\n}\n\n/**\n * Holds the state of a query target, including its target ID and whether the\n * target is 'not-current', 'current' or 'rejected'.\n */\n// Visible for testing\nexport class QueryTargetMetadata {\n  constructor(\n    readonly targetId: TargetId,\n    readonly state: QueryTargetState,\n    readonly error?: FirestoreError\n  ) {\n    debugAssert(\n      (error !== undefined) === (state === 'rejected'),\n      `QueryTargetMetadata must contain an error iff state is 'rejected'`\n    );\n  }\n\n  /**\n   * Parses a QueryTargetMetadata from its JSON representation in WebStorage.\n   * Logs a warning and returns null if the format of the data is not valid.\n   */\n  static fromWebStorageEntry(\n    targetId: TargetId,\n    value: string\n  ): QueryTargetMetadata | null {\n    const targetState = JSON.parse(value) as QueryTargetStateSchema;\n\n    let validData =\n      typeof targetState === 'object' &&\n      ['not-current', 'current', 'rejected'].indexOf(targetState.state) !==\n        -1 &&\n      (targetState.error === undefined ||\n        typeof targetState.error === 'object');\n\n    let firestoreError: FirestoreError | undefined = undefined;\n\n    if (validData && targetState.error) {\n      validData =\n        typeof targetState.error.message === 'string' &&\n        typeof targetState.error.code === 'string';\n      if (validData) {\n        firestoreError = new FirestoreError(\n          targetState.error.code as Code,\n          targetState.error.message\n        );\n      }\n    }\n\n    if (validData) {\n      return new QueryTargetMetadata(\n        targetId,\n        targetState.state,\n        firestoreError\n      );\n    } else {\n      logError(\n        LOG_TAG,\n        `Failed to parse target state for ID '${targetId}': ${value}`\n      );\n      return null;\n    }\n  }\n\n  toWebStorageJSON(): string {\n    const targetState: QueryTargetStateSchema = {\n      state: this.state,\n      updateTimeMs: Date.now() // Modify the existing value to trigger update.\n    };\n\n    if (this.error) {\n      targetState.error = {\n        code: this.error.code,\n        message: this.error.message\n      };\n    }\n\n    return JSON.stringify(targetState);\n  }\n}\n\n/**\n * Metadata state of a single client denoting the query targets it is actively\n * listening to.\n */\n// Visible for testing.\nexport interface ClientState {\n  readonly activeTargetIds: TargetIdSet;\n}\n\n/**\n * This class represents the immutable ClientState for a client read from\n * WebStorage, containing the list of active query targets.\n */\nclass RemoteClientState implements ClientState {\n  private constructor(\n    readonly clientId: ClientId,\n    readonly activeTargetIds: TargetIdSet\n  ) {}\n\n  /**\n   * Parses a RemoteClientState from the JSON representation in WebStorage.\n   * Logs a warning and returns null if the format of the data is not valid.\n   */\n  static fromWebStorageEntry(\n    clientId: ClientId,\n    value: string\n  ): RemoteClientState | null {\n    const clientState = JSON.parse(value) as ClientStateSchema;\n\n    let validData =\n      typeof clientState === 'object' &&\n      clientState.activeTargetIds instanceof Array;\n\n    let activeTargetIdsSet = targetIdSet();\n\n    for (let i = 0; validData && i < clientState.activeTargetIds.length; ++i) {\n      validData = isSafeInteger(clientState.activeTargetIds[i]);\n      activeTargetIdsSet = activeTargetIdsSet.add(\n        clientState.activeTargetIds[i]\n      );\n    }\n\n    if (validData) {\n      return new RemoteClientState(clientId, activeTargetIdsSet);\n    } else {\n      logError(\n        LOG_TAG,\n        `Failed to parse client data for instance '${clientId}': ${value}`\n      );\n      return null;\n    }\n  }\n}\n\n/**\n * This class represents the online state for all clients participating in\n * multi-tab. The online state is only written to by the primary client, and\n * used in secondary clients to update their query views.\n */\nexport class SharedOnlineState {\n  constructor(readonly clientId: string, readonly onlineState: OnlineState) {}\n\n  /**\n   * Parses a SharedOnlineState from its JSON representation in WebStorage.\n   * Logs a warning and returns null if the format of the data is not valid.\n   */\n  static fromWebStorageEntry(value: string): SharedOnlineState | null {\n    const onlineState = JSON.parse(value) as SharedOnlineStateSchema;\n\n    const validData =\n      typeof onlineState === 'object' &&\n      ['Unknown', 'Online', 'Offline'].indexOf(onlineState.onlineState) !==\n        -1 &&\n      typeof onlineState.clientId === 'string';\n\n    if (validData) {\n      return new SharedOnlineState(\n        onlineState.clientId,\n        onlineState.onlineState as OnlineState\n      );\n    } else {\n      logError(LOG_TAG, `Failed to parse online state: ${value}`);\n      return null;\n    }\n  }\n}\n\n/**\n * Metadata state of the local client. Unlike `RemoteClientState`, this class is\n * mutable and keeps track of all pending mutations, which allows us to\n * update the range of pending mutation batch IDs as new mutations are added or\n * removed.\n *\n * The data in `LocalClientState` is not read from WebStorage and instead\n * updated via its instance methods. The updated state can be serialized via\n * `toWebStorageJSON()`.\n */\n// Visible for testing.\nexport class LocalClientState implements ClientState {\n  activeTargetIds = targetIdSet();\n\n  addQueryTarget(targetId: TargetId): void {\n    this.activeTargetIds = this.activeTargetIds.add(targetId);\n  }\n\n  removeQueryTarget(targetId: TargetId): void {\n    this.activeTargetIds = this.activeTargetIds.delete(targetId);\n  }\n\n  /**\n   * Converts this entry into a JSON-encoded format we can use for WebStorage.\n   * Does not encode `clientId` as it is part of the key in WebStorage.\n   */\n  toWebStorageJSON(): string {\n    const data: ClientStateSchema = {\n      activeTargetIds: this.activeTargetIds.toArray(),\n      updateTimeMs: Date.now() // Modify the existing value to trigger update.\n    };\n    return JSON.stringify(data);\n  }\n}\n\n/**\n * `WebStorageSharedClientState` uses WebStorage (window.localStorage) as the\n * backing store for the SharedClientState. It keeps track of all active\n * clients and supports modifications of the local client's data.\n */\nexport class WebStorageSharedClientState implements SharedClientState {\n  syncEngine: SharedClientStateSyncer | null = null;\n  onlineStateHandler: ((onlineState: OnlineState) => void) | null = null;\n  sequenceNumberHandler:\n    | ((sequenceNumber: ListenSequenceNumber) => void)\n    | null = null;\n\n  private readonly storage: Storage;\n  private readonly localClientStorageKey: string;\n  private readonly sequenceNumberKey: string;\n  private readonly storageListener = this.handleWebStorageEvent.bind(this);\n  private readonly onlineStateKey: string;\n  private readonly clientStateKeyRe: RegExp;\n  private readonly mutationBatchKeyRe: RegExp;\n  private readonly queryTargetKeyRe: RegExp;\n  private activeClients = new SortedMap<string, ClientState>(\n    primitiveComparator\n  );\n  private started = false;\n  private currentUser: User;\n\n  /**\n   * Captures WebStorage events that occur before `start()` is called. These\n   * events are replayed once `WebStorageSharedClientState` is started.\n   */\n  private earlyEvents: StorageEvent[] = [];\n\n  constructor(\n    private readonly queue: AsyncQueue,\n    private readonly platform: Platform,\n    private readonly persistenceKey: string,\n    private readonly localClientId: ClientId,\n    initialUser: User\n  ) {\n    if (!WebStorageSharedClientState.isAvailable(this.platform)) {\n      throw new FirestoreError(\n        Code.UNIMPLEMENTED,\n        'LocalStorage is not available on this platform.'\n      );\n    }\n    // Escape the special characters mentioned here:\n    // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Regular_Expressions\n    const escapedPersistenceKey = persistenceKey.replace(\n      /[.*+?^${}()|[\\]\\\\]/g,\n      '\\\\$&'\n    );\n\n    this.storage = this.platform.window!.localStorage;\n    this.currentUser = initialUser;\n    this.localClientStorageKey = createWebStorageClientStateKey(\n      this.persistenceKey,\n      this.localClientId\n    );\n    this.sequenceNumberKey = createWebStorageSequenceNumberKey(\n      this.persistenceKey\n    );\n    this.activeClients = this.activeClients.insert(\n      this.localClientId,\n      new LocalClientState()\n    );\n\n    this.clientStateKeyRe = new RegExp(\n      `^${CLIENT_STATE_KEY_PREFIX}_${escapedPersistenceKey}_([^_]*)$`\n    );\n    this.mutationBatchKeyRe = new RegExp(\n      `^${MUTATION_BATCH_KEY_PREFIX}_${escapedPersistenceKey}_(\\\\d+)(?:_(.*))?$`\n    );\n    this.queryTargetKeyRe = new RegExp(\n      `^${QUERY_TARGET_KEY_PREFIX}_${escapedPersistenceKey}_(\\\\d+)$`\n    );\n\n    this.onlineStateKey = createWebStorageOnlineStateKey(this.persistenceKey);\n\n    // Rather than adding the storage observer during start(), we add the\n    // storage observer during initialization. This ensures that we collect\n    // events before other components populate their initial state (during their\n    // respective start() calls). Otherwise, we might for example miss a\n    // mutation that is added after LocalStore's start() processed the existing\n    // mutations but before we observe WebStorage events.\n    this.platform.window!.addEventListener('storage', this.storageListener);\n  }\n\n  /** Returns 'true' if WebStorage is available in the current environment. */\n  static isAvailable(platform: Platform): boolean {\n    return !!(platform.window && platform.window.localStorage != null);\n  }\n\n  async start(): Promise<void> {\n    debugAssert(!this.started, 'WebStorageSharedClientState already started');\n    debugAssert(\n      this.syncEngine !== null,\n      'syncEngine property must be set before calling start()'\n    );\n    debugAssert(\n      this.onlineStateHandler !== null,\n      'onlineStateHandler property must be set before calling start()'\n    );\n\n    // Retrieve the list of existing clients to backfill the data in\n    // SharedClientState.\n    const existingClients = await this.syncEngine!.getActiveClients();\n\n    for (const clientId of existingClients) {\n      if (clientId === this.localClientId) {\n        continue;\n      }\n\n      const storageItem = this.getItem(\n        createWebStorageClientStateKey(this.persistenceKey, clientId)\n      );\n      if (storageItem) {\n        const clientState = RemoteClientState.fromWebStorageEntry(\n          clientId,\n          storageItem\n        );\n        if (clientState) {\n          this.activeClients = this.activeClients.insert(\n            clientState.clientId,\n            clientState\n          );\n        }\n      }\n    }\n\n    this.persistClientState();\n\n    // Check if there is an existing online state and call the callback handler\n    // if applicable.\n    const onlineStateJSON = this.storage.getItem(this.onlineStateKey);\n    if (onlineStateJSON) {\n      const onlineState = this.fromWebStorageOnlineState(onlineStateJSON);\n      if (onlineState) {\n        this.handleOnlineStateEvent(onlineState);\n      }\n    }\n\n    for (const event of this.earlyEvents) {\n      this.handleWebStorageEvent(event);\n    }\n\n    this.earlyEvents = [];\n\n    // Register a window unload hook to remove the client metadata entry from\n    // WebStorage even if `shutdown()` was not called.\n    this.platform.window!.addEventListener('unload', () => this.shutdown());\n\n    this.started = true;\n  }\n\n  writeSequenceNumber(sequenceNumber: ListenSequenceNumber): void {\n    this.setItem(this.sequenceNumberKey, JSON.stringify(sequenceNumber));\n  }\n\n  getAllActiveQueryTargets(): TargetIdSet {\n    return this.extractActiveQueryTargets(this.activeClients);\n  }\n\n  isActiveQueryTarget(targetId: TargetId): boolean {\n    let found = false;\n    this.activeClients.forEach((key, value) => {\n      if (value.activeTargetIds.has(targetId)) {\n        found = true;\n      }\n    });\n    return found;\n  }\n\n  addPendingMutation(batchId: BatchId): void {\n    this.persistMutationState(batchId, 'pending');\n  }\n\n  updateMutationState(\n    batchId: BatchId,\n    state: 'acknowledged' | 'rejected',\n    error?: FirestoreError\n  ): void {\n    this.persistMutationState(batchId, state, error);\n\n    // Once a final mutation result is observed by other clients, they no longer\n    // access the mutation's metadata entry. Since WebStorage replays events\n    // in order, it is safe to delete the entry right after updating it.\n    this.removeMutationState(batchId);\n  }\n\n  addLocalQueryTarget(targetId: TargetId): QueryTargetState {\n    let queryState: QueryTargetState = 'not-current';\n\n    // Lookup an existing query state if the target ID was already registered\n    // by another tab\n    if (this.isActiveQueryTarget(targetId)) {\n      const storageItem = this.storage.getItem(\n        createWebStorageQueryTargetMetadataKey(this.persistenceKey, targetId)\n      );\n\n      if (storageItem) {\n        const metadata = QueryTargetMetadata.fromWebStorageEntry(\n          targetId,\n          storageItem\n        );\n        if (metadata) {\n          queryState = metadata.state;\n        }\n      }\n    }\n\n    this.localClientState.addQueryTarget(targetId);\n    this.persistClientState();\n\n    return queryState;\n  }\n\n  removeLocalQueryTarget(targetId: TargetId): void {\n    this.localClientState.removeQueryTarget(targetId);\n    this.persistClientState();\n  }\n\n  isLocalQueryTarget(targetId: TargetId): boolean {\n    return this.localClientState.activeTargetIds.has(targetId);\n  }\n\n  clearQueryState(targetId: TargetId): void {\n    this.removeItem(\n      createWebStorageQueryTargetMetadataKey(this.persistenceKey, targetId)\n    );\n  }\n\n  updateQueryState(\n    targetId: TargetId,\n    state: QueryTargetState,\n    error?: FirestoreError\n  ): void {\n    this.persistQueryTargetState(targetId, state, error);\n  }\n\n  handleUserChange(\n    user: User,\n    removedBatchIds: BatchId[],\n    addedBatchIds: BatchId[]\n  ): void {\n    removedBatchIds.forEach(batchId => {\n      this.removeMutationState(batchId);\n    });\n    this.currentUser = user;\n    addedBatchIds.forEach(batchId => {\n      this.addPendingMutation(batchId);\n    });\n  }\n\n  setOnlineState(onlineState: OnlineState): void {\n    this.persistOnlineState(onlineState);\n  }\n\n  shutdown(): void {\n    if (this.started) {\n      this.platform.window!.removeEventListener(\n        'storage',\n        this.storageListener\n      );\n      this.removeItem(this.localClientStorageKey);\n      this.started = false;\n    }\n  }\n\n  private getItem(key: string): string | null {\n    const value = this.storage.getItem(key);\n    logDebug(LOG_TAG, 'READ', key, value);\n    return value;\n  }\n\n  private setItem(key: string, value: string): void {\n    logDebug(LOG_TAG, 'SET', key, value);\n    this.storage.setItem(key, value);\n  }\n\n  private removeItem(key: string): void {\n    logDebug(LOG_TAG, 'REMOVE', key);\n    this.storage.removeItem(key);\n  }\n\n  private handleWebStorageEvent(event: StorageEvent): void {\n    if (event.storageArea === this.storage) {\n      logDebug(LOG_TAG, 'EVENT', event.key, event.newValue);\n\n      if (event.key === this.localClientStorageKey) {\n        logError(\n          'Received WebStorage notification for local change. Another client might have ' +\n            'garbage-collected our state'\n        );\n        return;\n      }\n\n      this.queue.enqueueRetryable(async () => {\n        if (!this.started) {\n          this.earlyEvents.push(event);\n          return;\n        }\n\n        if (event.key === null) {\n          return;\n        }\n\n        if (this.clientStateKeyRe.test(event.key)) {\n          if (event.newValue != null) {\n            const clientState = this.fromWebStorageClientState(\n              event.key,\n              event.newValue\n            );\n            if (clientState) {\n              return this.handleClientStateEvent(\n                clientState.clientId,\n                clientState\n              );\n            }\n          } else {\n            const clientId = this.fromWebStorageClientStateKey(event.key)!;\n            return this.handleClientStateEvent(clientId, null);\n          }\n        } else if (this.mutationBatchKeyRe.test(event.key)) {\n          if (event.newValue !== null) {\n            const mutationMetadata = this.fromWebStorageMutationMetadata(\n              event.key,\n              event.newValue\n            );\n            if (mutationMetadata) {\n              return this.handleMutationBatchEvent(mutationMetadata);\n            }\n          }\n        } else if (this.queryTargetKeyRe.test(event.key)) {\n          if (event.newValue !== null) {\n            const queryTargetMetadata = this.fromWebStorageQueryTargetMetadata(\n              event.key,\n              event.newValue\n            );\n            if (queryTargetMetadata) {\n              return this.handleQueryTargetEvent(queryTargetMetadata);\n            }\n          }\n        } else if (event.key === this.onlineStateKey) {\n          if (event.newValue !== null) {\n            const onlineState = this.fromWebStorageOnlineState(event.newValue);\n            if (onlineState) {\n              return this.handleOnlineStateEvent(onlineState);\n            }\n          }\n        } else if (event.key === this.sequenceNumberKey) {\n          debugAssert(\n            !!this.sequenceNumberHandler,\n            'Missing sequenceNumberHandler'\n          );\n          const sequenceNumber = fromWebStorageSequenceNumber(event.newValue);\n          if (sequenceNumber !== ListenSequence.INVALID) {\n            this.sequenceNumberHandler!(sequenceNumber);\n          }\n        }\n      });\n    }\n  }\n\n  private get localClientState(): LocalClientState {\n    return this.activeClients.get(this.localClientId) as LocalClientState;\n  }\n\n  private persistClientState(): void {\n    this.setItem(\n      this.localClientStorageKey,\n      this.localClientState.toWebStorageJSON()\n    );\n  }\n\n  private persistMutationState(\n    batchId: BatchId,\n    state: MutationBatchState,\n    error?: FirestoreError\n  ): void {\n    const mutationState = new MutationMetadata(\n      this.currentUser,\n      batchId,\n      state,\n      error\n    );\n    const mutationKey = createWebStorageMutationBatchKey(\n      this.persistenceKey,\n      this.currentUser,\n      batchId\n    );\n    this.setItem(mutationKey, mutationState.toWebStorageJSON());\n  }\n\n  private removeMutationState(batchId: BatchId): void {\n    const mutationKey = createWebStorageMutationBatchKey(\n      this.persistenceKey,\n      this.currentUser,\n      batchId\n    );\n    this.removeItem(mutationKey);\n  }\n\n  private persistOnlineState(onlineState: OnlineState): void {\n    const entry: SharedOnlineStateSchema = {\n      clientId: this.localClientId,\n      onlineState\n    };\n    this.storage.setItem(this.onlineStateKey, JSON.stringify(entry));\n  }\n\n  private persistQueryTargetState(\n    targetId: TargetId,\n    state: QueryTargetState,\n    error?: FirestoreError\n  ): void {\n    const targetKey = createWebStorageQueryTargetMetadataKey(\n      this.persistenceKey,\n      targetId\n    );\n    const targetMetadata = new QueryTargetMetadata(targetId, state, error);\n    this.setItem(targetKey, targetMetadata.toWebStorageJSON());\n  }\n\n  /**\n   * Parses a client state key in WebStorage. Returns null if the key does not\n   * match the expected key format.\n   */\n  private fromWebStorageClientStateKey(key: string): ClientId | null {\n    const match = this.clientStateKeyRe.exec(key);\n    return match ? match[1] : null;\n  }\n\n  /**\n   * Parses a client state in WebStorage. Returns 'null' if the value could not\n   * be parsed.\n   */\n  private fromWebStorageClientState(\n    key: string,\n    value: string\n  ): RemoteClientState | null {\n    const clientId = this.fromWebStorageClientStateKey(key);\n    debugAssert(clientId !== null, `Cannot parse client state key '${key}'`);\n    return RemoteClientState.fromWebStorageEntry(clientId, value);\n  }\n\n  /**\n   * Parses a mutation batch state in WebStorage. Returns 'null' if the value\n   * could not be parsed.\n   */\n  private fromWebStorageMutationMetadata(\n    key: string,\n    value: string\n  ): MutationMetadata | null {\n    const match = this.mutationBatchKeyRe.exec(key);\n    debugAssert(match !== null, `Cannot parse mutation batch key '${key}'`);\n\n    const batchId = Number(match[1]);\n    const userId = match[2] !== undefined ? match[2] : null;\n    return MutationMetadata.fromWebStorageEntry(\n      new User(userId),\n      batchId,\n      value\n    );\n  }\n\n  /**\n   * Parses a query target state from WebStorage. Returns 'null' if the value\n   * could not be parsed.\n   */\n  private fromWebStorageQueryTargetMetadata(\n    key: string,\n    value: string\n  ): QueryTargetMetadata | null {\n    const match = this.queryTargetKeyRe.exec(key);\n    debugAssert(match !== null, `Cannot parse query target key '${key}'`);\n\n    const targetId = Number(match[1]);\n    return QueryTargetMetadata.fromWebStorageEntry(targetId, value);\n  }\n\n  /**\n   * Parses an online state from WebStorage. Returns 'null' if the value\n   * could not be parsed.\n   */\n  private fromWebStorageOnlineState(value: string): SharedOnlineState | null {\n    return SharedOnlineState.fromWebStorageEntry(value);\n  }\n\n  private async handleMutationBatchEvent(\n    mutationBatch: MutationMetadata\n  ): Promise<void> {\n    if (mutationBatch.user.uid !== this.currentUser.uid) {\n      logDebug(\n        LOG_TAG,\n        `Ignoring mutation for non-active user ${mutationBatch.user.uid}`\n      );\n      return;\n    }\n\n    return this.syncEngine!.applyBatchState(\n      mutationBatch.batchId,\n      mutationBatch.state,\n      mutationBatch.error\n    );\n  }\n\n  private handleQueryTargetEvent(\n    targetMetadata: QueryTargetMetadata\n  ): Promise<void> {\n    return this.syncEngine!.applyTargetState(\n      targetMetadata.targetId,\n      targetMetadata.state,\n      targetMetadata.error\n    );\n  }\n\n  private handleClientStateEvent(\n    clientId: ClientId,\n    clientState: RemoteClientState | null\n  ): Promise<void> {\n    const updatedClients = clientState\n      ? this.activeClients.insert(clientId, clientState)\n      : this.activeClients.remove(clientId);\n\n    const existingTargets = this.extractActiveQueryTargets(this.activeClients);\n    const newTargets = this.extractActiveQueryTargets(updatedClients);\n\n    const addedTargets: TargetId[] = [];\n    const removedTargets: TargetId[] = [];\n\n    newTargets.forEach(targetId => {\n      if (!existingTargets.has(targetId)) {\n        addedTargets.push(targetId);\n      }\n    });\n\n    existingTargets.forEach(targetId => {\n      if (!newTargets.has(targetId)) {\n        removedTargets.push(targetId);\n      }\n    });\n\n    return this.syncEngine!.applyActiveTargetsChange(\n      addedTargets,\n      removedTargets\n    ).then(() => {\n      this.activeClients = updatedClients;\n    });\n  }\n\n  private handleOnlineStateEvent(onlineState: SharedOnlineState): void {\n    // We check whether the client that wrote this online state is still active\n    // by comparing its client ID to the list of clients kept active in\n    // IndexedDb. If a client does not update their IndexedDb client state\n    // within 5 seconds, it is considered inactive and we don't emit an online\n    // state event.\n    if (this.activeClients.get(onlineState.clientId)) {\n      this.onlineStateHandler!(onlineState.onlineState);\n    }\n  }\n\n  private extractActiveQueryTargets(\n    clients: SortedMap<string, ClientState>\n  ): SortedSet<TargetId> {\n    let activeTargets = targetIdSet();\n    clients.forEach((kev, value) => {\n      activeTargets = activeTargets.unionWith(value.activeTargetIds);\n    });\n    return activeTargets;\n  }\n}\n\nfunction fromWebStorageSequenceNumber(\n  seqString: string | null\n): ListenSequenceNumber {\n  let sequenceNumber = ListenSequence.INVALID;\n  if (seqString != null) {\n    try {\n      const parsed = JSON.parse(seqString);\n      hardAssert(\n        typeof parsed === 'number',\n        'Found non-numeric sequence number'\n      );\n      sequenceNumber = parsed;\n    } catch (e) {\n      logError(LOG_TAG, 'Failed to read sequence number from WebStorage', e);\n    }\n  }\n  return sequenceNumber;\n}\n\n/**\n * `MemorySharedClientState` is a simple implementation of SharedClientState for\n * clients using memory persistence. The state in this class remains fully\n * isolated and no synchronization is performed.\n */\nexport class MemorySharedClientState implements SharedClientState {\n  private localState = new LocalClientState();\n  private queryState: { [targetId: number]: QueryTargetState } = {};\n\n  syncEngine: SharedClientStateSyncer | null = null;\n  onlineStateHandler: ((onlineState: OnlineState) => void) | null = null;\n  sequenceNumberHandler:\n    | ((sequenceNumber: ListenSequenceNumber) => void)\n    | null = null;\n\n  addPendingMutation(batchId: BatchId): void {\n    // No op.\n  }\n\n  updateMutationState(\n    batchId: BatchId,\n    state: 'acknowledged' | 'rejected',\n    error?: FirestoreError\n  ): void {\n    // No op.\n  }\n\n  addLocalQueryTarget(targetId: TargetId): QueryTargetState {\n    this.localState.addQueryTarget(targetId);\n    return this.queryState[targetId] || 'not-current';\n  }\n\n  updateQueryState(\n    targetId: TargetId,\n    state: QueryTargetState,\n    error?: FirestoreError\n  ): void {\n    this.queryState[targetId] = state;\n  }\n\n  removeLocalQueryTarget(targetId: TargetId): void {\n    this.localState.removeQueryTarget(targetId);\n  }\n\n  isLocalQueryTarget(targetId: TargetId): boolean {\n    return this.localState.activeTargetIds.has(targetId);\n  }\n\n  clearQueryState(targetId: TargetId): void {\n    delete this.queryState[targetId];\n  }\n\n  getAllActiveQueryTargets(): TargetIdSet {\n    return this.localState.activeTargetIds;\n  }\n\n  isActiveQueryTarget(targetId: TargetId): boolean {\n    return this.localState.activeTargetIds.has(targetId);\n  }\n\n  start(): Promise<void> {\n    this.localState = new LocalClientState();\n    return Promise.resolve();\n  }\n\n  handleUserChange(\n    user: User,\n    removedBatchIds: BatchId[],\n    addedBatchIds: BatchId[]\n  ): void {\n    // No op.\n  }\n\n  setOnlineState(onlineState: OnlineState): void {\n    // No op.\n  }\n\n  shutdown(): void {}\n\n  writeSequenceNumber(sequenceNumber: ListenSequenceNumber): void {}\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 { QueryResult } from '../local/local_store';\nimport {\n  documentKeySet,\n  DocumentKeySet,\n  MaybeDocumentMap\n} from '../model/collections';\nimport { Document, MaybeDocument } from '../model/document';\nimport { DocumentKey } from '../model/document_key';\nimport { DocumentSet } from '../model/document_set';\nimport { TargetChange } from '../remote/remote_event';\nimport { debugAssert, fail } from '../util/assert';\n\nimport { Query } from './query';\nimport { OnlineState } from './types';\nimport {\n  ChangeType,\n  DocumentChangeSet,\n  SyncState,\n  ViewSnapshot\n} from './view_snapshot';\n\nexport type LimboDocumentChange = AddedLimboDocument | RemovedLimboDocument;\nexport class AddedLimboDocument {\n  constructor(public key: DocumentKey) {}\n}\nexport class RemovedLimboDocument {\n  constructor(public key: DocumentKey) {}\n}\n\n/** The result of applying a set of doc changes to a view. */\nexport interface ViewDocumentChanges {\n  /** The new set of docs that should be in the view. */\n  documentSet: DocumentSet;\n  /** The diff of these docs with the previous set of docs. */\n  changeSet: DocumentChangeSet;\n  /**\n   * Whether the set of documents passed in was not sufficient to calculate the\n   * new state of the view and there needs to be another pass based on the\n   * local cache.\n   */\n  needsRefill: boolean;\n\n  mutatedKeys: DocumentKeySet;\n}\n\nexport interface ViewChange {\n  snapshot?: ViewSnapshot;\n  limboChanges: LimboDocumentChange[];\n}\n\n/**\n * View is responsible for computing the final merged truth of what docs are in\n * a query. It gets notified of local and remote changes to docs, and applies\n * the query filters and limits to determine the most correct possible results.\n */\nexport class View {\n  private syncState: SyncState | null = null;\n  /**\n   * A flag whether the view is current with the backend. A view is considered\n   * current after it has seen the current flag from the backend and did not\n   * lose consistency within the watch stream (e.g. because of an existence\n   * filter mismatch).\n   */\n  private current = false;\n  private documentSet: DocumentSet;\n  /** Documents in the view but not in the remote target */\n  private limboDocuments = documentKeySet();\n  /** Document Keys that have local changes */\n  private mutatedKeys = documentKeySet();\n\n  constructor(\n    private query: Query,\n    /** Documents included in the remote target */\n    private _syncedDocuments: DocumentKeySet\n  ) {\n    this.documentSet = new DocumentSet(query.docComparator.bind(query));\n  }\n\n  /**\n   * The set of remote documents that the server has told us belongs to the target associated with\n   * this view.\n   */\n  get syncedDocuments(): DocumentKeySet {\n    return this._syncedDocuments;\n  }\n\n  /**\n   * Iterates over a set of doc changes, applies the query limit, and computes\n   * what the new results should be, what the changes were, and whether we may\n   * need to go back to the local cache for more results. Does not make any\n   * changes to the view.\n   * @param docChanges The doc changes to apply to this view.\n   * @param previousChanges If this is being called with a refill, then start\n   *        with this set of docs and changes instead of the current view.\n   * @return a new set of docs, changes, and refill flag.\n   */\n  computeDocChanges(\n    docChanges: MaybeDocumentMap,\n    previousChanges?: ViewDocumentChanges\n  ): ViewDocumentChanges {\n    const changeSet = previousChanges\n      ? previousChanges.changeSet\n      : new DocumentChangeSet();\n    const oldDocumentSet = previousChanges\n      ? previousChanges.documentSet\n      : this.documentSet;\n    let newMutatedKeys = previousChanges\n      ? previousChanges.mutatedKeys\n      : this.mutatedKeys;\n    let newDocumentSet = oldDocumentSet;\n    let needsRefill = false;\n\n    // Track the last doc in a (full) limit. This is necessary, because some\n    // update (a delete, or an update moving a doc past the old limit) might\n    // mean there is some other document in the local cache that either should\n    // come (1) between the old last limit doc and the new last document, in the\n    // case of updates, or (2) after the new last document, in the case of\n    // deletes. So we keep this doc at the old limit to compare the updates to.\n    //\n    // Note that this should never get used in a refill (when previousChanges is\n    // set), because there will only be adds -- no deletes or updates.\n    const lastDocInLimit =\n      this.query.hasLimitToFirst() && oldDocumentSet.size === this.query.limit\n        ? oldDocumentSet.last()\n        : null;\n    const firstDocInLimit =\n      this.query.hasLimitToLast() && oldDocumentSet.size === this.query.limit\n        ? oldDocumentSet.first()\n        : null;\n\n    docChanges.inorderTraversal(\n      (key: DocumentKey, newMaybeDoc: MaybeDocument) => {\n        const oldDoc = oldDocumentSet.get(key);\n        let newDoc = newMaybeDoc instanceof Document ? newMaybeDoc : null;\n        if (newDoc) {\n          debugAssert(\n            key.isEqual(newDoc.key),\n            'Mismatching keys found in document changes: ' +\n              key +\n              ' != ' +\n              newDoc.key\n          );\n          newDoc = this.query.matches(newDoc) ? newDoc : null;\n        }\n\n        const oldDocHadPendingMutations = oldDoc\n          ? this.mutatedKeys.has(oldDoc.key)\n          : false;\n        const newDocHasPendingMutations = newDoc\n          ? newDoc.hasLocalMutations ||\n            // We only consider committed mutations for documents that were\n            // mutated during the lifetime of the view.\n            (this.mutatedKeys.has(newDoc.key) && newDoc.hasCommittedMutations)\n          : false;\n\n        let changeApplied = false;\n\n        // Calculate change\n        if (oldDoc && newDoc) {\n          const docsEqual = oldDoc.data().isEqual(newDoc.data());\n          if (!docsEqual) {\n            if (!this.shouldWaitForSyncedDocument(oldDoc, newDoc)) {\n              changeSet.track({\n                type: ChangeType.Modified,\n                doc: newDoc\n              });\n              changeApplied = true;\n\n              if (\n                (lastDocInLimit &&\n                  this.query.docComparator(newDoc, lastDocInLimit) > 0) ||\n                (firstDocInLimit &&\n                  this.query.docComparator(newDoc, firstDocInLimit) < 0)\n              ) {\n                // This doc moved from inside the limit to outside the limit.\n                // That means there may be some other doc in the local cache\n                // that should be included instead.\n                needsRefill = true;\n              }\n            }\n          } else if (oldDocHadPendingMutations !== newDocHasPendingMutations) {\n            changeSet.track({ type: ChangeType.Metadata, doc: newDoc });\n            changeApplied = true;\n          }\n        } else if (!oldDoc && newDoc) {\n          changeSet.track({ type: ChangeType.Added, doc: newDoc });\n          changeApplied = true;\n        } else if (oldDoc && !newDoc) {\n          changeSet.track({ type: ChangeType.Removed, doc: oldDoc });\n          changeApplied = true;\n\n          if (lastDocInLimit || firstDocInLimit) {\n            // A doc was removed from a full limit query. We'll need to\n            // requery from the local cache to see if we know about some other\n            // doc that should be in the results.\n            needsRefill = true;\n          }\n        }\n\n        if (changeApplied) {\n          if (newDoc) {\n            newDocumentSet = newDocumentSet.add(newDoc);\n            if (newDocHasPendingMutations) {\n              newMutatedKeys = newMutatedKeys.add(key);\n            } else {\n              newMutatedKeys = newMutatedKeys.delete(key);\n            }\n          } else {\n            newDocumentSet = newDocumentSet.delete(key);\n            newMutatedKeys = newMutatedKeys.delete(key);\n          }\n        }\n      }\n    );\n\n    // Drop documents out to meet limit/limitToLast requirement.\n    if (this.query.hasLimitToFirst() || this.query.hasLimitToLast()) {\n      while (newDocumentSet.size > this.query.limit!) {\n        const oldDoc = this.query.hasLimitToFirst()\n          ? newDocumentSet.last()\n          : newDocumentSet.first();\n        newDocumentSet = newDocumentSet.delete(oldDoc!.key);\n        newMutatedKeys = newMutatedKeys.delete(oldDoc!.key);\n        changeSet.track({ type: ChangeType.Removed, doc: oldDoc! });\n      }\n    }\n\n    debugAssert(\n      !needsRefill || !previousChanges,\n      'View was refilled using docs that themselves needed refilling.'\n    );\n    return {\n      documentSet: newDocumentSet,\n      changeSet,\n      needsRefill,\n      mutatedKeys: newMutatedKeys\n    };\n  }\n\n  private shouldWaitForSyncedDocument(\n    oldDoc: Document,\n    newDoc: Document\n  ): boolean {\n    // We suppress the initial change event for documents that were modified as\n    // part of a write acknowledgment (e.g. when the value of a server transform\n    // is applied) as Watch will send us the same document again.\n    // By suppressing the event, we only raise two user visible events (one with\n    // `hasPendingWrites` and the final state of the document) instead of three\n    // (one with `hasPendingWrites`, the modified document with\n    // `hasPendingWrites` and the final state of the document).\n    return (\n      oldDoc.hasLocalMutations &&\n      newDoc.hasCommittedMutations &&\n      !newDoc.hasLocalMutations\n    );\n  }\n\n  /**\n   * Updates the view with the given ViewDocumentChanges and optionally updates\n   * limbo docs and sync state from the provided target change.\n   * @param docChanges The set of changes to make to the view's docs.\n   * @param updateLimboDocuments Whether to update limbo documents based on this\n   *        change.\n   * @param targetChange A target change to apply for computing limbo docs and\n   *        sync state.\n   * @return A new ViewChange with the given docs, changes, and sync state.\n   */\n  // PORTING NOTE: The iOS/Android clients always compute limbo document changes.\n  applyChanges(\n    docChanges: ViewDocumentChanges,\n    updateLimboDocuments: boolean,\n    targetChange?: TargetChange\n  ): ViewChange {\n    debugAssert(\n      !docChanges.needsRefill,\n      'Cannot apply changes that need a refill'\n    );\n    const oldDocs = this.documentSet;\n    this.documentSet = docChanges.documentSet;\n    this.mutatedKeys = docChanges.mutatedKeys;\n    // Sort changes based on type and query comparator\n    const changes = docChanges.changeSet.getChanges();\n    changes.sort((c1, c2) => {\n      return (\n        compareChangeType(c1.type, c2.type) ||\n        this.query.docComparator(c1.doc, c2.doc)\n      );\n    });\n\n    this.applyTargetChange(targetChange);\n    const limboChanges = updateLimboDocuments\n      ? this.updateLimboDocuments()\n      : [];\n    const synced = this.limboDocuments.size === 0 && this.current;\n    const newSyncState = synced ? SyncState.Synced : SyncState.Local;\n    const syncStateChanged = newSyncState !== this.syncState;\n    this.syncState = newSyncState;\n\n    if (changes.length === 0 && !syncStateChanged) {\n      // no changes\n      return { limboChanges };\n    } else {\n      const snap: ViewSnapshot = new ViewSnapshot(\n        this.query,\n        docChanges.documentSet,\n        oldDocs,\n        changes,\n        docChanges.mutatedKeys,\n        newSyncState === SyncState.Local,\n        syncStateChanged,\n        /* excludesMetadataChanges= */ false\n      );\n      return {\n        snapshot: snap,\n        limboChanges\n      };\n    }\n  }\n\n  /**\n   * Applies an OnlineState change to the view, potentially generating a\n   * ViewChange if the view's syncState changes as a result.\n   */\n  applyOnlineStateChange(onlineState: OnlineState): ViewChange {\n    if (this.current && onlineState === OnlineState.Offline) {\n      // If we're offline, set `current` to false and then call applyChanges()\n      // to refresh our syncState and generate a ViewChange as appropriate. We\n      // are guaranteed to get a new TargetChange that sets `current` back to\n      // true once the client is back online.\n      this.current = false;\n      return this.applyChanges(\n        {\n          documentSet: this.documentSet,\n          changeSet: new DocumentChangeSet(),\n          mutatedKeys: this.mutatedKeys,\n          needsRefill: false\n        },\n        /* updateLimboDocuments= */ false\n      );\n    } else {\n      // No effect, just return a no-op ViewChange.\n      return { limboChanges: [] };\n    }\n  }\n\n  /**\n   * Returns whether the doc for the given key should be in limbo.\n   */\n  private shouldBeInLimbo(key: DocumentKey): boolean {\n    // If the remote end says it's part of this query, it's not in limbo.\n    if (this._syncedDocuments.has(key)) {\n      return false;\n    }\n    // The local store doesn't think it's a result, so it shouldn't be in limbo.\n    if (!this.documentSet.has(key)) {\n      return false;\n    }\n    // If there are local changes to the doc, they might explain why the server\n    // doesn't know that it's part of the query. So don't put it in limbo.\n    // TODO(klimt): Ideally, we would only consider changes that might actually\n    // affect this specific query.\n    if (this.documentSet.get(key)!.hasLocalMutations) {\n      return false;\n    }\n    // Everything else is in limbo.\n    return true;\n  }\n\n  /**\n   * Updates syncedDocuments, current, and limbo docs based on the given change.\n   * Returns the list of changes to which docs are in limbo.\n   */\n  private applyTargetChange(targetChange?: TargetChange): void {\n    if (targetChange) {\n      targetChange.addedDocuments.forEach(\n        key => (this._syncedDocuments = this._syncedDocuments.add(key))\n      );\n      targetChange.modifiedDocuments.forEach(key => {\n        debugAssert(\n          this._syncedDocuments.has(key),\n          `Modified document ${key} not found in view.`\n        );\n      });\n      targetChange.removedDocuments.forEach(\n        key => (this._syncedDocuments = this._syncedDocuments.delete(key))\n      );\n      this.current = targetChange.current;\n    }\n  }\n\n  private updateLimboDocuments(): LimboDocumentChange[] {\n    // We can only determine limbo documents when we're in-sync with the server.\n    if (!this.current) {\n      return [];\n    }\n\n    // TODO(klimt): Do this incrementally so that it's not quadratic when\n    // updating many documents.\n    const oldLimboDocuments = this.limboDocuments;\n    this.limboDocuments = documentKeySet();\n    this.documentSet.forEach(doc => {\n      if (this.shouldBeInLimbo(doc.key)) {\n        this.limboDocuments = this.limboDocuments.add(doc.key);\n      }\n    });\n\n    // Diff the new limbo docs with the old limbo docs.\n    const changes: LimboDocumentChange[] = [];\n    oldLimboDocuments.forEach(key => {\n      if (!this.limboDocuments.has(key)) {\n        changes.push(new RemovedLimboDocument(key));\n      }\n    });\n    this.limboDocuments.forEach(key => {\n      if (!oldLimboDocuments.has(key)) {\n        changes.push(new AddedLimboDocument(key));\n      }\n    });\n    return changes;\n  }\n\n  /**\n   * Update the in-memory state of the current view with the state read from\n   * persistence.\n   *\n   * We update the query view whenever a client's primary status changes:\n   * - When a client transitions from primary to secondary, it can miss\n   *   LocalStorage updates and its query views may temporarily not be\n   *   synchronized with the state on disk.\n   * - For secondary to primary transitions, the client needs to update the list\n   *   of `syncedDocuments` since secondary clients update their query views\n   *   based purely on synthesized RemoteEvents.\n   *\n   * @param queryResult.documents - The documents that match the query according\n   * to the LocalStore.\n   * @param queryResult.remoteKeys - The keys of the documents that match the\n   * query according to the backend.\n   *\n   * @return The ViewChange that resulted from this synchronization.\n   */\n  // PORTING NOTE: Multi-tab only.\n  synchronizeWithPersistedState(queryResult: QueryResult): ViewChange {\n    this._syncedDocuments = queryResult.remoteKeys;\n    this.limboDocuments = documentKeySet();\n    const docChanges = this.computeDocChanges(queryResult.documents);\n    return this.applyChanges(docChanges, /*updateLimboDocuments=*/ true);\n  }\n\n  /**\n   * Returns a view snapshot as if this query was just listened to. Contains\n   * a document add for every existing document and the `fromCache` and\n   * `hasPendingWrites` status of the already established view.\n   */\n  // PORTING NOTE: Multi-tab only.\n  computeInitialSnapshot(): ViewSnapshot {\n    return ViewSnapshot.fromInitialDocuments(\n      this.query,\n      this.documentSet,\n      this.mutatedKeys,\n      this.syncState === SyncState.Local\n    );\n  }\n}\n\nfunction compareChangeType(c1: ChangeType, c2: ChangeType): number {\n  const order = (change: ChangeType): 0 | 1 | 2 => {\n    switch (change) {\n      case ChangeType.Added:\n        return 1;\n      case ChangeType.Modified:\n        return 2;\n      case ChangeType.Metadata:\n        // A metadata change is converted to a modified change at the public\n        // api layer.  Since we sort by document key and then change type,\n        // metadata and modified changes must be sorted equivalently.\n        return 2;\n      case ChangeType.Removed:\n        return 0;\n      default:\n        return fail('Unknown ChangeType: ' + change);\n    }\n  };\n\n  return order(c1) - order(c2);\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 { Deferred } from '../util/promise';\nimport { TimerId, AsyncQueue } from '../util/async_queue';\nimport { ExponentialBackoff } from '../remote/backoff';\nimport { Transaction } from './transaction';\nimport { RemoteStore } from '../remote/remote_store';\nimport { isNullOrUndefined } from '../util/types';\nimport { isPermanentError } from '../remote/rpc_error';\nimport { FirestoreError } from '../util/error';\n\nconst RETRY_COUNT = 5;\n\n/**\n * TransactionRunner encapsulates the logic needed to run and retry transactions\n * with backoff.\n */\nexport class TransactionRunner<T> {\n  private retries = RETRY_COUNT;\n  private backoff: ExponentialBackoff;\n\n  constructor(\n    private readonly asyncQueue: AsyncQueue,\n    private readonly remoteStore: RemoteStore,\n    private readonly updateFunction: (transaction: Transaction) => Promise<T>,\n    private readonly deferred: Deferred<T>\n  ) {\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.runWithBackOff();\n  }\n\n  private runWithBackOff(): void {\n    this.backoff.backoffAndRun(async () => {\n      const transaction = this.remoteStore.createTransaction();\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);\n      return null;\n    }\n  }\n\n  private handleTransactionError(error: Error): void {\n    if (this.retries > 0 && this.isRetryableTransactionError(error)) {\n      this.retries -= 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        !isPermanentError(code)\n      );\n    }\n    return false;\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 { User } from '../auth/user';\nimport {\n  ignoreIfPrimaryLeaseLoss,\n  LocalStore,\n  MultiTabLocalStore\n} from '../local/local_store';\nimport { LocalViewChanges } from '../local/local_view_changes';\nimport { ReferenceSet } from '../local/reference_set';\nimport { TargetData, TargetPurpose } from '../local/target_data';\nimport {\n  documentKeySet,\n  DocumentKeySet,\n  MaybeDocumentMap\n} from '../model/collections';\nimport { MaybeDocument, NoDocument } from '../model/document';\nimport { DocumentKey } from '../model/document_key';\nimport { Mutation } from '../model/mutation';\nimport { BATCHID_UNKNOWN, MutationBatchResult } from '../model/mutation_batch';\nimport { RemoteEvent, TargetChange } from '../remote/remote_event';\nimport { RemoteStore } from '../remote/remote_store';\nimport { RemoteSyncer } from '../remote/remote_syncer';\nimport { debugAssert, fail, hardAssert } from '../util/assert';\nimport { Code, FirestoreError } from '../util/error';\nimport { logDebug } from '../util/log';\nimport { primitiveComparator } from '../util/misc';\nimport { ObjectMap } from '../util/obj_map';\nimport { Deferred } from '../util/promise';\nimport { SortedMap } from '../util/sorted_map';\n\nimport { ClientId, SharedClientState } from '../local/shared_client_state';\nimport {\n  QueryTargetState,\n  SharedClientStateSyncer\n} from '../local/shared_client_state_syncer';\nimport { SortedSet } from '../util/sorted_set';\nimport { ListenSequence } from './listen_sequence';\nimport { LimitType, Query } from './query';\nimport { SnapshotVersion } from './snapshot_version';\nimport { Target } from './target';\nimport { TargetIdGenerator } from './target_id_generator';\nimport { Transaction } from './transaction';\nimport {\n  BatchId,\n  MutationBatchState,\n  OnlineState,\n  OnlineStateSource,\n  TargetId\n} from './types';\nimport {\n  AddedLimboDocument,\n  LimboDocumentChange,\n  RemovedLimboDocument,\n  View,\n  ViewChange,\n  ViewDocumentChanges\n} from './view';\nimport { ViewSnapshot } from './view_snapshot';\nimport { AsyncQueue, wrapInUserErrorIfRecoverable } from '../util/async_queue';\nimport { TransactionRunner } from './transaction_runner';\n\nconst LOG_TAG = 'SyncEngine';\n\n/**\n * QueryView contains all of the data that SyncEngine needs to keep track of for\n * a particular query.\n */\nclass QueryView {\n  constructor(\n    /**\n     * The query itself.\n     */\n    public query: Query,\n    /**\n     * The target number created by the client that is used in the watch\n     * stream to identify this query.\n     */\n    public targetId: TargetId,\n    /**\n     * The view is responsible for computing the final merged truth of what\n     * docs are in the query. It gets notified of local and remote changes,\n     * and applies the query filters and limits to determine the most correct\n     * possible results.\n     */\n    public view: View\n  ) {}\n}\n\n/** Tracks a limbo resolution. */\nclass LimboResolution {\n  constructor(public key: DocumentKey) {}\n\n  /**\n   * Set to true once we've received a document. This is used in\n   * getRemoteKeysForTarget() and ultimately used by WatchChangeAggregator to\n   * decide whether it needs to manufacture a delete event for the target once\n   * the target is CURRENT.\n   */\n  receivedDocument: boolean = false;\n}\n\n/**\n * Interface implemented by EventManager to handle notifications from\n * SyncEngine.\n */\nexport interface SyncEngineListener {\n  /** Handles new view snapshots. */\n  onWatchChange(snapshots: ViewSnapshot[]): void;\n\n  /** Handles the failure of a query. */\n  onWatchError(query: Query, error: Error): void;\n\n  /** Handles a change in online state. */\n  onOnlineStateChange(onlineState: OnlineState): void;\n}\n\n/**\n * SyncEngine is the central controller in the client SDK architecture. It is\n * the glue code between the EventManager, LocalStore, and RemoteStore. Some of\n * SyncEngine's responsibilities include:\n * 1. Coordinating client requests and remote events between the EventManager\n *    and the local and remote data stores.\n * 2. Managing a View object for each query, providing the unified view between\n *    the local and remote data stores.\n * 3. Notifying the RemoteStore when the LocalStore has new mutations in its\n *    queue that need sending to the backend.\n *\n * The SyncEngine’s methods should only ever be called by methods running in the\n * global async queue.\n */\nexport class SyncEngine implements RemoteSyncer {\n  protected syncEngineListener: SyncEngineListener | null = null;\n\n  protected queryViewsByQuery = new ObjectMap<Query, QueryView>(q =>\n    q.canonicalId()\n  );\n  protected queriesByTarget = new Map<TargetId, Query[]>();\n  /**\n   * The keys of documents that are in limbo for which we haven't yet started a\n   * limbo resolution query.\n   */\n  private enqueuedLimboResolutions: DocumentKey[] = [];\n  /**\n   * Keeps track of the target ID for each document that is in limbo with an\n   * active target.\n   */\n  protected activeLimboTargetsByKey = new SortedMap<DocumentKey, TargetId>(\n    DocumentKey.comparator\n  );\n  /**\n   * Keeps track of the information about an active limbo resolution for each\n   * active target ID that was started for the purpose of limbo resolution.\n   */\n  protected activeLimboResolutionsByTarget = new Map<\n    TargetId,\n    LimboResolution\n  >();\n  protected limboDocumentRefs = new ReferenceSet();\n  /** Stores user completion handlers, indexed by User and BatchId. */\n  private mutationUserCallbacks = {} as {\n    [uidKey: string]: SortedMap<BatchId, Deferred<void>>;\n  };\n  /** Stores user callbacks waiting for all pending writes to be acknowledged. */\n  private pendingWritesCallbacks = new Map<BatchId, Array<Deferred<void>>>();\n  private limboTargetIdGenerator = TargetIdGenerator.forSyncEngine();\n\n  private onlineState = OnlineState.Unknown;\n\n  constructor(\n    protected localStore: LocalStore,\n    protected remoteStore: RemoteStore,\n    // PORTING NOTE: Manages state synchronization in multi-tab environments.\n    protected sharedClientState: SharedClientState,\n    private currentUser: User,\n    private maxConcurrentLimboResolutions: number\n  ) {}\n\n  get isPrimaryClient(): boolean {\n    return true;\n  }\n\n  /** Subscribes to SyncEngine notifications. Has to be called exactly once. */\n  subscribe(syncEngineListener: SyncEngineListener): void {\n    debugAssert(\n      syncEngineListener !== null,\n      'SyncEngine listener cannot be null'\n    );\n    debugAssert(\n      this.syncEngineListener === null,\n      'SyncEngine already has a subscriber.'\n    );\n\n    this.syncEngineListener = syncEngineListener;\n  }\n\n  /**\n   * Initiates the new listen, resolves promise when listen enqueued to the\n   * server. All the subsequent view snapshots or errors are sent to the\n   * subscribed handlers. Returns the initial snapshot.\n   */\n  async listen(query: Query): Promise<ViewSnapshot> {\n    this.assertSubscribed('listen()');\n\n    let targetId;\n    let viewSnapshot;\n\n    const queryView = this.queryViewsByQuery.get(query);\n    if (queryView) {\n      // PORTING NOTE: With Multi-Tab Web, it is possible that a query view\n      // already exists when EventManager calls us for the first time. This\n      // happens when the primary tab is already listening to this query on\n      // behalf of another tab and the user of the primary also starts listening\n      // to the query. EventManager will not have an assigned target ID in this\n      // case and calls `listen` to obtain this ID.\n      targetId = queryView.targetId;\n      this.sharedClientState.addLocalQueryTarget(targetId);\n      viewSnapshot = queryView.view.computeInitialSnapshot();\n    } else {\n      const targetData = await this.localStore.allocateTarget(query.toTarget());\n\n      const status = this.sharedClientState.addLocalQueryTarget(\n        targetData.targetId\n      );\n      targetId = targetData.targetId;\n      viewSnapshot = await this.initializeViewAndComputeSnapshot(\n        query,\n        targetId,\n        status === 'current'\n      );\n      if (this.isPrimaryClient) {\n        this.remoteStore.listen(targetData);\n      }\n    }\n\n    return viewSnapshot;\n  }\n\n  /**\n   * Registers a view for a previously unknown query and computes its initial\n   * snapshot.\n   */\n  protected async initializeViewAndComputeSnapshot(\n    query: Query,\n    targetId: TargetId,\n    current: boolean\n  ): Promise<ViewSnapshot> {\n    const queryResult = await this.localStore.executeQuery(\n      query,\n      /* usePreviousResults= */ true\n    );\n    const view = new View(query, queryResult.remoteKeys);\n    const viewDocChanges = view.computeDocChanges(queryResult.documents);\n    const synthesizedTargetChange = TargetChange.createSynthesizedTargetChangeForCurrentChange(\n      targetId,\n      current && this.onlineState !== OnlineState.Offline\n    );\n    const viewChange = view.applyChanges(\n      viewDocChanges,\n      /* updateLimboDocuments= */ this.isPrimaryClient,\n      synthesizedTargetChange\n    );\n    this.updateTrackedLimbos(targetId, viewChange.limboChanges);\n\n    debugAssert(\n      !!viewChange.snapshot,\n      'applyChanges for new view should always return a snapshot'\n    );\n\n    const data = new QueryView(query, targetId, view);\n    this.queryViewsByQuery.set(query, data);\n    if (this.queriesByTarget.has(targetId)) {\n      this.queriesByTarget.get(targetId)!.push(query);\n    } else {\n      this.queriesByTarget.set(targetId, [query]);\n    }\n    return viewChange.snapshot!;\n  }\n\n  /** Stops listening to the query. */\n  async unlisten(query: Query): Promise<void> {\n    this.assertSubscribed('unlisten()');\n\n    const queryView = this.queryViewsByQuery.get(query)!;\n    debugAssert(!!queryView, 'Trying to unlisten on query not found:' + query);\n\n    // Only clean up the query view and target if this is the only query mapped\n    // to the target.\n    const queries = this.queriesByTarget.get(queryView.targetId)!;\n    if (queries.length > 1) {\n      this.queriesByTarget.set(\n        queryView.targetId,\n        queries.filter(q => !q.isEqual(query))\n      );\n      this.queryViewsByQuery.delete(query);\n      return;\n    }\n\n    // No other queries are mapped to the target, clean up the query and the target.\n    if (this.isPrimaryClient) {\n      // We need to remove the local query target first to allow us to verify\n      // whether any other client is still interested in this target.\n      this.sharedClientState.removeLocalQueryTarget(queryView.targetId);\n      const targetRemainsActive = this.sharedClientState.isActiveQueryTarget(\n        queryView.targetId\n      );\n\n      if (!targetRemainsActive) {\n        await this.localStore\n          .releaseTarget(queryView.targetId, /*keepPersistedTargetData=*/ false)\n          .then(() => {\n            this.sharedClientState.clearQueryState(queryView.targetId);\n            this.remoteStore.unlisten(queryView.targetId);\n            this.removeAndCleanupTarget(queryView.targetId);\n          })\n          .catch(ignoreIfPrimaryLeaseLoss);\n      }\n    } else {\n      this.removeAndCleanupTarget(queryView.targetId);\n      await this.localStore.releaseTarget(\n        queryView.targetId,\n        /*keepPersistedTargetData=*/ true\n      );\n    }\n  }\n\n  /**\n   * Initiates the write of local mutation batch which involves adding the\n   * writes to the mutation queue, notifying the remote store about new\n   * mutations and raising events for any changes this write caused.\n   *\n   * The promise returned by this call is resolved when the above steps\n   * have completed, *not* when the write was acked by the backend. The\n   * userCallback is resolved once the write was acked/rejected by the\n   * backend (or failed locally for any other reason).\n   */\n  async write(batch: Mutation[], userCallback: Deferred<void>): Promise<void> {\n    this.assertSubscribed('write()');\n\n    try {\n      const result = await this.localStore.localWrite(batch);\n      this.sharedClientState.addPendingMutation(result.batchId);\n      this.addMutationCallback(result.batchId, userCallback);\n      await this.emitNewSnapsAndNotifyLocalStore(result.changes);\n      await this.remoteStore.fillWritePipeline();\n    } catch (e) {\n      // If we can't persist the mutation, we reject the user callback and\n      // don't send the mutation. The user can then retry the write.\n      const error = wrapInUserErrorIfRecoverable(e, `Failed to persist write`);\n      userCallback.reject(error);\n    }\n  }\n\n  /**\n   * Takes an updateFunction in which a set of reads and writes can be performed\n   * atomically. In the updateFunction, the client can read and write values\n   * using the supplied transaction object. After the updateFunction, all\n   * changes will be committed. If a retryable error occurs (ex: some other\n   * client has changed any of the data referenced), then the updateFunction\n   * will be called again after a backoff. If the updateFunction still fails\n   * after all retries, then the transaction will be rejected.\n   *\n   * The transaction object passed to the updateFunction contains methods for\n   * accessing documents and collections. Unlike other datastore access, data\n   * accessed with the transaction will not reflect local changes that have not\n   * been committed. For this reason, it is required that all reads are\n   * performed before any writes. Transactions must be performed while online.\n   *\n   * The Deferred input is resolved when the transaction is fully committed.\n   */\n  runTransaction<T>(\n    asyncQueue: AsyncQueue,\n    updateFunction: (transaction: Transaction) => Promise<T>,\n    deferred: Deferred<T>\n  ): void {\n    new TransactionRunner<T>(\n      asyncQueue,\n      this.remoteStore,\n      updateFunction,\n      deferred\n    ).run();\n  }\n\n  async applyRemoteEvent(remoteEvent: RemoteEvent): Promise<void> {\n    this.assertSubscribed('applyRemoteEvent()');\n    try {\n      const changes = await this.localStore.applyRemoteEvent(remoteEvent);\n      // Update `receivedDocument` as appropriate for any limbo targets.\n      remoteEvent.targetChanges.forEach((targetChange, targetId) => {\n        const limboResolution = this.activeLimboResolutionsByTarget.get(\n          targetId\n        );\n        if (limboResolution) {\n          // Since this is a limbo resolution lookup, it's for a single document\n          // and it could be added, modified, or removed, but not a combination.\n          hardAssert(\n            targetChange.addedDocuments.size +\n              targetChange.modifiedDocuments.size +\n              targetChange.removedDocuments.size <=\n              1,\n            'Limbo resolution for single document contains multiple changes.'\n          );\n          if (targetChange.addedDocuments.size > 0) {\n            limboResolution.receivedDocument = true;\n          } else if (targetChange.modifiedDocuments.size > 0) {\n            hardAssert(\n              limboResolution.receivedDocument,\n              'Received change for limbo target document without add.'\n            );\n          } else if (targetChange.removedDocuments.size > 0) {\n            hardAssert(\n              limboResolution.receivedDocument,\n              'Received remove for limbo target document without add.'\n            );\n            limboResolution.receivedDocument = false;\n          } else {\n            // This was probably just a CURRENT targetChange or similar.\n          }\n        }\n      });\n      await this.emitNewSnapsAndNotifyLocalStore(changes, remoteEvent);\n    } catch (error) {\n      await ignoreIfPrimaryLeaseLoss(error);\n    }\n  }\n\n  /**\n   * Applies an OnlineState change to the sync engine and notifies any views of\n   * the change.\n   */\n  applyOnlineStateChange(\n    onlineState: OnlineState,\n    source: OnlineStateSource\n  ): void {\n    this.assertSubscribed('applyOnlineStateChange()');\n    const newViewSnapshots = [] as ViewSnapshot[];\n    this.queryViewsByQuery.forEach((query, queryView) => {\n      const viewChange = queryView.view.applyOnlineStateChange(onlineState);\n      debugAssert(\n        viewChange.limboChanges.length === 0,\n        'OnlineState should not affect limbo documents.'\n      );\n      if (viewChange.snapshot) {\n        newViewSnapshots.push(viewChange.snapshot);\n      }\n    });\n    this.syncEngineListener!.onOnlineStateChange(onlineState);\n    this.syncEngineListener!.onWatchChange(newViewSnapshots);\n    this.onlineState = onlineState;\n  }\n\n  async rejectListen(targetId: TargetId, err: FirestoreError): Promise<void> {\n    this.assertSubscribed('rejectListens()');\n\n    // PORTING NOTE: Multi-tab only.\n    this.sharedClientState.updateQueryState(targetId, 'rejected', err);\n\n    const limboResolution = this.activeLimboResolutionsByTarget.get(targetId);\n    const limboKey = limboResolution && limboResolution.key;\n    if (limboKey) {\n      // TODO(klimt): We really only should do the following on permission\n      // denied errors, but we don't have the cause code here.\n\n      // It's a limbo doc. Create a synthetic event saying it was deleted.\n      // This is kind of a hack. Ideally, we would have a method in the local\n      // store to purge a document. However, it would be tricky to keep all of\n      // the local store's invariants with another method.\n      let documentUpdates = new SortedMap<DocumentKey, MaybeDocument>(\n        DocumentKey.comparator\n      );\n      documentUpdates = documentUpdates.insert(\n        limboKey,\n        new NoDocument(limboKey, SnapshotVersion.min())\n      );\n      const resolvedLimboDocuments = documentKeySet().add(limboKey);\n      const event = new RemoteEvent(\n        SnapshotVersion.min(),\n        /* targetChanges= */ new Map<TargetId, TargetChange>(),\n        /* targetMismatches= */ new SortedSet<TargetId>(primitiveComparator),\n        documentUpdates,\n        resolvedLimboDocuments\n      );\n\n      await this.applyRemoteEvent(event);\n\n      // Since this query failed, we won't want to manually unlisten to it.\n      // We only remove it from bookkeeping after we successfully applied the\n      // RemoteEvent. If `applyRemoteEvent()` throws, we want to re-listen to\n      // this query when the RemoteStore restarts the Watch stream, which should\n      // re-trigger the target failure.\n      this.activeLimboTargetsByKey = this.activeLimboTargetsByKey.remove(\n        limboKey\n      );\n      this.activeLimboResolutionsByTarget.delete(targetId);\n      this.pumpEnqueuedLimboResolutions();\n    } else {\n      await this.localStore\n        .releaseTarget(targetId, /* keepPersistedTargetData */ false)\n        .then(() => this.removeAndCleanupTarget(targetId, err))\n        .catch(ignoreIfPrimaryLeaseLoss);\n    }\n  }\n\n  async applySuccessfulWrite(\n    mutationBatchResult: MutationBatchResult\n  ): Promise<void> {\n    this.assertSubscribed('applySuccessfulWrite()');\n\n    const batchId = mutationBatchResult.batch.batchId;\n\n    // The local store may or may not be able to apply the write result and\n    // raise events immediately (depending on whether the watcher is caught\n    // up), so we raise user callbacks first so that they consistently happen\n    // before listen events.\n    this.processUserCallback(batchId, /*error=*/ null);\n\n    this.triggerPendingWritesCallbacks(batchId);\n\n    try {\n      const changes = await this.localStore.acknowledgeBatch(\n        mutationBatchResult\n      );\n      this.sharedClientState.updateMutationState(batchId, 'acknowledged');\n      await this.emitNewSnapsAndNotifyLocalStore(changes);\n    } catch (error) {\n      await ignoreIfPrimaryLeaseLoss(error);\n    }\n  }\n\n  async rejectFailedWrite(\n    batchId: BatchId,\n    error: FirestoreError\n  ): Promise<void> {\n    this.assertSubscribed('rejectFailedWrite()');\n\n    // The local store may or may not be able to apply the write result and\n    // raise events immediately (depending on whether the watcher is caught up),\n    // so we raise user callbacks first so that they consistently happen before\n    // listen events.\n    this.processUserCallback(batchId, error);\n\n    this.triggerPendingWritesCallbacks(batchId);\n\n    try {\n      const changes = await this.localStore.rejectBatch(batchId);\n      this.sharedClientState.updateMutationState(batchId, 'rejected', error);\n      await this.emitNewSnapsAndNotifyLocalStore(changes);\n    } catch (error) {\n      await ignoreIfPrimaryLeaseLoss(error);\n    }\n  }\n\n  /**\n   * Registers a user callback that resolves when all pending mutations at the moment of calling\n   * are acknowledged .\n   */\n  async registerPendingWritesCallback(callback: Deferred<void>): Promise<void> {\n    if (!this.remoteStore.canUseNetwork()) {\n      logDebug(\n        LOG_TAG,\n        'The network is disabled. The task returned by ' +\n          \"'awaitPendingWrites()' will not complete until the network is enabled.\"\n      );\n    }\n\n    try {\n      const highestBatchId = await this.localStore.getHighestUnacknowledgedBatchId();\n      if (highestBatchId === BATCHID_UNKNOWN) {\n        // Trigger the callback right away if there is no pending writes at the moment.\n        callback.resolve();\n        return;\n      }\n\n      const callbacks = this.pendingWritesCallbacks.get(highestBatchId) || [];\n      callbacks.push(callback);\n      this.pendingWritesCallbacks.set(highestBatchId, callbacks);\n    } catch (e) {\n      const firestoreError = wrapInUserErrorIfRecoverable(\n        e,\n        'Initialization of waitForPendingWrites() operation failed'\n      );\n      callback.reject(firestoreError);\n    }\n  }\n\n  /**\n   * Triggers the callbacks that are waiting for this batch id to get acknowledged by server,\n   * if there are any.\n   */\n  private triggerPendingWritesCallbacks(batchId: BatchId): void {\n    (this.pendingWritesCallbacks.get(batchId) || []).forEach(callback => {\n      callback.resolve();\n    });\n\n    this.pendingWritesCallbacks.delete(batchId);\n  }\n\n  /** Reject all outstanding callbacks waiting for pending writes to complete. */\n  private rejectOutstandingPendingWritesCallbacks(errorMessage: string): void {\n    this.pendingWritesCallbacks.forEach(callbacks => {\n      callbacks.forEach(callback => {\n        callback.reject(new FirestoreError(Code.CANCELLED, errorMessage));\n      });\n    });\n\n    this.pendingWritesCallbacks.clear();\n  }\n\n  private addMutationCallback(\n    batchId: BatchId,\n    callback: Deferred<void>\n  ): void {\n    let newCallbacks = this.mutationUserCallbacks[this.currentUser.toKey()];\n    if (!newCallbacks) {\n      newCallbacks = new SortedMap<BatchId, Deferred<void>>(\n        primitiveComparator\n      );\n    }\n    newCallbacks = newCallbacks.insert(batchId, callback);\n    this.mutationUserCallbacks[this.currentUser.toKey()] = newCallbacks;\n  }\n\n  /**\n   * Resolves or rejects the user callback for the given batch and then discards\n   * it.\n   */\n  protected processUserCallback(batchId: BatchId, error: Error | null): void {\n    let newCallbacks = this.mutationUserCallbacks[this.currentUser.toKey()];\n\n    // NOTE: Mutations restored from persistence won't have callbacks, so it's\n    // okay for there to be no callback for this ID.\n    if (newCallbacks) {\n      const callback = newCallbacks.get(batchId);\n      if (callback) {\n        debugAssert(\n          batchId === newCallbacks.minKey(),\n          'Mutation callbacks processed out-of-order?'\n        );\n        if (error) {\n          callback.reject(error);\n        } else {\n          callback.resolve();\n        }\n        newCallbacks = newCallbacks.remove(batchId);\n      }\n      this.mutationUserCallbacks[this.currentUser.toKey()] = newCallbacks;\n    }\n  }\n\n  protected removeAndCleanupTarget(\n    targetId: number,\n    error: Error | null = null\n  ): void {\n    this.sharedClientState.removeLocalQueryTarget(targetId);\n\n    debugAssert(\n      this.queriesByTarget.has(targetId) &&\n        this.queriesByTarget.get(targetId)!.length !== 0,\n      `There are no queries mapped to target id ${targetId}`\n    );\n\n    for (const query of this.queriesByTarget.get(targetId)!) {\n      this.queryViewsByQuery.delete(query);\n      if (error) {\n        this.syncEngineListener!.onWatchError(query, error);\n      }\n    }\n\n    this.queriesByTarget.delete(targetId);\n\n    if (this.isPrimaryClient) {\n      const limboKeys = this.limboDocumentRefs.removeReferencesForId(targetId);\n      limboKeys.forEach(limboKey => {\n        const isReferenced = this.limboDocumentRefs.containsKey(limboKey);\n        if (!isReferenced) {\n          // We removed the last reference for this key\n          this.removeLimboTarget(limboKey);\n        }\n      });\n    }\n  }\n\n  private removeLimboTarget(key: DocumentKey): void {\n    // It's possible that the target already got removed because the query failed. In that case,\n    // the key won't exist in `limboTargetsByKey`. Only do the cleanup if we still have the target.\n    const limboTargetId = this.activeLimboTargetsByKey.get(key);\n    if (limboTargetId === null) {\n      // This target already got removed, because the query failed.\n      return;\n    }\n\n    this.remoteStore.unlisten(limboTargetId);\n    this.activeLimboTargetsByKey = this.activeLimboTargetsByKey.remove(key);\n    this.activeLimboResolutionsByTarget.delete(limboTargetId);\n    this.pumpEnqueuedLimboResolutions();\n  }\n\n  protected updateTrackedLimbos(\n    targetId: TargetId,\n    limboChanges: LimboDocumentChange[]\n  ): void {\n    for (const limboChange of limboChanges) {\n      if (limboChange instanceof AddedLimboDocument) {\n        this.limboDocumentRefs.addReference(limboChange.key, targetId);\n        this.trackLimboChange(limboChange);\n      } else if (limboChange instanceof RemovedLimboDocument) {\n        logDebug(LOG_TAG, 'Document no longer in limbo: ' + limboChange.key);\n        this.limboDocumentRefs.removeReference(limboChange.key, targetId);\n        const isReferenced = this.limboDocumentRefs.containsKey(\n          limboChange.key\n        );\n        if (!isReferenced) {\n          // We removed the last reference for this key\n          this.removeLimboTarget(limboChange.key);\n        }\n      } else {\n        fail('Unknown limbo change: ' + JSON.stringify(limboChange));\n      }\n    }\n  }\n\n  private trackLimboChange(limboChange: AddedLimboDocument): void {\n    const key = limboChange.key;\n    if (!this.activeLimboTargetsByKey.get(key)) {\n      logDebug(LOG_TAG, 'New document in limbo: ' + key);\n      this.enqueuedLimboResolutions.push(key);\n      this.pumpEnqueuedLimboResolutions();\n    }\n  }\n\n  /**\n   * Starts listens for documents in limbo that are enqueued for resolution,\n   * subject to a maximum number of concurrent resolutions.\n   *\n   * Without bounding the number of concurrent resolutions, the server can fail\n   * with \"resource exhausted\" errors which can lead to pathological client\n   * behavior as seen in https://github.com/firebase/firebase-js-sdk/issues/2683.\n   */\n  private pumpEnqueuedLimboResolutions(): void {\n    while (\n      this.enqueuedLimboResolutions.length > 0 &&\n      this.activeLimboTargetsByKey.size < this.maxConcurrentLimboResolutions\n    ) {\n      const key = this.enqueuedLimboResolutions.shift()!;\n      const limboTargetId = this.limboTargetIdGenerator.next();\n      this.activeLimboResolutionsByTarget.set(\n        limboTargetId,\n        new LimboResolution(key)\n      );\n      this.activeLimboTargetsByKey = this.activeLimboTargetsByKey.insert(\n        key,\n        limboTargetId\n      );\n      this.remoteStore.listen(\n        new TargetData(\n          Query.atPath(key.path).toTarget(),\n          limboTargetId,\n          TargetPurpose.LimboResolution,\n          ListenSequence.INVALID\n        )\n      );\n    }\n  }\n\n  // Visible for testing\n  activeLimboDocumentResolutions(): SortedMap<DocumentKey, TargetId> {\n    return this.activeLimboTargetsByKey;\n  }\n\n  // Visible for testing\n  enqueuedLimboDocumentResolutions(): DocumentKey[] {\n    return this.enqueuedLimboResolutions;\n  }\n\n  protected async emitNewSnapsAndNotifyLocalStore(\n    changes: MaybeDocumentMap,\n    remoteEvent?: RemoteEvent\n  ): Promise<void> {\n    const newSnaps: ViewSnapshot[] = [];\n    const docChangesInAllViews: LocalViewChanges[] = [];\n    const queriesProcessed: Array<Promise<void>> = [];\n\n    this.queryViewsByQuery.forEach((_, queryView) => {\n      queriesProcessed.push(\n        Promise.resolve()\n          .then(() => {\n            const viewDocChanges = queryView.view.computeDocChanges(changes);\n            if (!viewDocChanges.needsRefill) {\n              return viewDocChanges;\n            }\n            // The query has a limit and some docs were removed, so we need\n            // to re-run the query against the local store to make sure we\n            // didn't lose any good docs that had been past the limit.\n            return this.localStore\n              .executeQuery(queryView.query, /* usePreviousResults= */ false)\n              .then(({ documents }) => {\n                return queryView.view.computeDocChanges(\n                  documents,\n                  viewDocChanges\n                );\n              });\n          })\n          .then((viewDocChanges: ViewDocumentChanges) => {\n            const targetChange =\n              remoteEvent && remoteEvent.targetChanges.get(queryView.targetId);\n            const viewChange = queryView.view.applyChanges(\n              viewDocChanges,\n              /* updateLimboDocuments= */ this.isPrimaryClient,\n              targetChange\n            );\n            this.updateTrackedLimbos(\n              queryView.targetId,\n              viewChange.limboChanges\n            );\n            if (viewChange.snapshot) {\n              if (this.isPrimaryClient) {\n                this.sharedClientState.updateQueryState(\n                  queryView.targetId,\n                  viewChange.snapshot.fromCache ? 'not-current' : 'current'\n                );\n              }\n\n              newSnaps.push(viewChange.snapshot);\n              const docChanges = LocalViewChanges.fromSnapshot(\n                queryView.targetId,\n                viewChange.snapshot\n              );\n              docChangesInAllViews.push(docChanges);\n            }\n          })\n      );\n    });\n\n    await Promise.all(queriesProcessed);\n    this.syncEngineListener!.onWatchChange(newSnaps);\n    await this.localStore.notifyLocalViewChanges(docChangesInAllViews);\n  }\n\n  protected assertSubscribed(fnName: string): void {\n    debugAssert(\n      this.syncEngineListener !== null,\n      'Trying to call ' + fnName + ' before calling subscribe().'\n    );\n  }\n\n  async handleCredentialChange(user: User): Promise<void> {\n    const userChanged = !this.currentUser.isEqual(user);\n\n    if (userChanged) {\n      const result = await this.localStore.handleUserChange(user);\n      this.currentUser = user;\n\n      // Fails tasks waiting for pending writes requested by previous user.\n      this.rejectOutstandingPendingWritesCallbacks(\n        \"'waitForPendingWrites' promise is rejected due to a user change.\"\n      );\n      // TODO(b/114226417): Consider calling this only in the primary tab.\n      this.sharedClientState.handleUserChange(\n        user,\n        result.removedBatchIds,\n        result.addedBatchIds\n      );\n      await this.emitNewSnapsAndNotifyLocalStore(result.affectedDocuments);\n    }\n\n    await this.remoteStore.handleCredentialChange();\n  }\n\n  enableNetwork(): Promise<void> {\n    return this.remoteStore.enableNetwork();\n  }\n\n  disableNetwork(): Promise<void> {\n    return this.remoteStore.disableNetwork();\n  }\n\n  getRemoteKeysForTarget(targetId: TargetId): DocumentKeySet {\n    const limboResolution = this.activeLimboResolutionsByTarget.get(targetId);\n    if (limboResolution && limboResolution.receivedDocument) {\n      return documentKeySet().add(limboResolution.key);\n    } else {\n      let keySet = documentKeySet();\n      const queries = this.queriesByTarget.get(targetId);\n      if (!queries) {\n        return keySet;\n      }\n      for (const query of queries) {\n        const queryView = this.queryViewsByQuery.get(query);\n        debugAssert(!!queryView, `No query view found for ${query}`);\n        keySet = keySet.unionWith(queryView.view.syncedDocuments);\n      }\n      return keySet;\n    }\n  }\n}\n\n/**\n * An impplementation of SyncEngine that implement SharedClientStateSyncer for\n * Multi-Tab synchronization.\n */\n// PORTING NOTE: Web only\nexport class MultiTabSyncEngine extends SyncEngine\n  implements SharedClientStateSyncer {\n  // The primary state is set to `true` or `false` immediately after Firestore\n  // startup. In the interim, a client should only be considered primary if\n  // `isPrimary` is true.\n  private _isPrimaryClient: undefined | boolean = undefined;\n\n  constructor(\n    protected localStore: MultiTabLocalStore,\n    remoteStore: RemoteStore,\n    sharedClientState: SharedClientState,\n    currentUser: User,\n    maxConcurrentLimboResolutions: number\n  ) {\n    super(\n      localStore,\n      remoteStore,\n      sharedClientState,\n      currentUser,\n      maxConcurrentLimboResolutions\n    );\n  }\n\n  get isPrimaryClient(): boolean {\n    return this._isPrimaryClient === true;\n  }\n\n  enableNetwork(): Promise<void> {\n    this.localStore.setNetworkEnabled(true);\n    return super.enableNetwork();\n  }\n\n  disableNetwork(): Promise<void> {\n    this.localStore.setNetworkEnabled(false);\n    return super.disableNetwork();\n  }\n\n  /**\n   * Reconcile the list of synced documents in an existing view with those\n   * from persistence.\n   */\n  private async synchronizeViewAndComputeSnapshot(\n    queryView: QueryView\n  ): Promise<ViewChange> {\n    const queryResult = await this.localStore.executeQuery(\n      queryView.query,\n      /* usePreviousResults= */ true\n    );\n    const viewSnapshot = queryView.view.synchronizeWithPersistedState(\n      queryResult\n    );\n    if (this._isPrimaryClient) {\n      this.updateTrackedLimbos(queryView.targetId, viewSnapshot.limboChanges);\n    }\n    return viewSnapshot;\n  }\n\n  applyOnlineStateChange(\n    onlineState: OnlineState,\n    source: OnlineStateSource\n  ): void {\n    // If we are the primary client, the online state of all clients only\n    // depends on the online state of the local RemoteStore.\n    if (this.isPrimaryClient && source === OnlineStateSource.RemoteStore) {\n      super.applyOnlineStateChange(onlineState, source);\n      this.sharedClientState.setOnlineState(onlineState);\n    }\n\n    // If we are the secondary client, we explicitly ignore the remote store's\n    // online state (the local client may go offline, even though the primary\n    // tab remains online) and only apply the primary tab's online state from\n    // SharedClientState.\n    if (\n      !this.isPrimaryClient &&\n      source === OnlineStateSource.SharedClientState\n    ) {\n      super.applyOnlineStateChange(onlineState, source);\n    }\n  }\n\n  async applyBatchState(\n    batchId: BatchId,\n    batchState: MutationBatchState,\n    error?: FirestoreError\n  ): Promise<void> {\n    this.assertSubscribed('applyBatchState()');\n    const documents = await this.localStore.lookupMutationDocuments(batchId);\n\n    if (documents === null) {\n      // A throttled tab may not have seen the mutation before it was completed\n      // and removed from the mutation queue, in which case we won't have cached\n      // the affected documents. In this case we can safely ignore the update\n      // since that means we didn't apply the mutation locally at all (if we\n      // had, we would have cached the affected documents), and so we will just\n      // see any resulting document changes via normal remote document updates\n      // as applicable.\n      logDebug(LOG_TAG, 'Cannot apply mutation batch with id: ' + batchId);\n      return;\n    }\n\n    if (batchState === 'pending') {\n      // If we are the primary client, we need to send this write to the\n      // backend. Secondary clients will ignore these writes since their remote\n      // connection is disabled.\n      await this.remoteStore.fillWritePipeline();\n    } else if (batchState === 'acknowledged' || batchState === 'rejected') {\n      // NOTE: Both these methods are no-ops for batches that originated from\n      // other clients.\n      this.processUserCallback(batchId, error ? error : null);\n      this.localStore.removeCachedMutationBatchMetadata(batchId);\n    } else {\n      fail(`Unknown batchState: ${batchState}`);\n    }\n\n    await this.emitNewSnapsAndNotifyLocalStore(documents);\n  }\n\n  async applyPrimaryState(isPrimary: boolean): Promise<void> {\n    if (isPrimary === true && this._isPrimaryClient !== true) {\n      // Secondary tabs only maintain Views for their local listeners and the\n      // Views internal state may not be 100% populated (in particular\n      // secondary tabs don't track syncedDocuments, the set of documents the\n      // server considers to be in the target). So when a secondary becomes\n      // primary, we need to need to make sure that all views for all targets\n      // match the state on disk.\n      const activeTargets = this.sharedClientState.getAllActiveQueryTargets();\n      const activeQueries = await this.synchronizeQueryViewsAndRaiseSnapshots(\n        activeTargets.toArray(),\n        /*transitionToPrimary=*/ true\n      );\n      this._isPrimaryClient = true;\n      await this.remoteStore.applyPrimaryState(true);\n      for (const targetData of activeQueries) {\n        this.remoteStore.listen(targetData);\n      }\n    } else if (isPrimary === false && this._isPrimaryClient !== false) {\n      const activeTargets: TargetId[] = [];\n\n      let p = Promise.resolve();\n      this.queriesByTarget.forEach((_, targetId) => {\n        if (this.sharedClientState.isLocalQueryTarget(targetId)) {\n          activeTargets.push(targetId);\n        } else {\n          p = p.then(() => {\n            this.removeAndCleanupTarget(targetId);\n            return this.localStore.releaseTarget(\n              targetId,\n              /*keepPersistedTargetData=*/ true\n            );\n          });\n        }\n        this.remoteStore.unlisten(targetId);\n      });\n      await p;\n\n      await this.synchronizeQueryViewsAndRaiseSnapshots(\n        activeTargets,\n        /*transitionToPrimary=*/ false\n      );\n      this.resetLimboDocuments();\n      this._isPrimaryClient = false;\n      await this.remoteStore.applyPrimaryState(false);\n    }\n  }\n\n  private resetLimboDocuments(): void {\n    this.activeLimboResolutionsByTarget.forEach((_, targetId) => {\n      this.remoteStore.unlisten(targetId);\n    });\n    this.limboDocumentRefs.removeAllReferences();\n    this.activeLimboResolutionsByTarget = new Map<TargetId, LimboResolution>();\n    this.activeLimboTargetsByKey = new SortedMap<DocumentKey, TargetId>(\n      DocumentKey.comparator\n    );\n  }\n\n  /**\n   * Reconcile the query views of the provided query targets with the state from\n   * persistence. Raises snapshots for any changes that affect the local\n   * client and returns the updated state of all target's query data.\n   *\n   * @param targets the list of targets with views that need to be recomputed\n   * @param transitionToPrimary `true` iff the tab transitions from a secondary\n   * tab to a primary tab\n   */\n  private async synchronizeQueryViewsAndRaiseSnapshots(\n    targets: TargetId[],\n    transitionToPrimary: boolean\n  ): Promise<TargetData[]> {\n    const activeQueries: TargetData[] = [];\n    const newViewSnapshots: ViewSnapshot[] = [];\n    for (const targetId of targets) {\n      let targetData: TargetData;\n      const queries = this.queriesByTarget.get(targetId);\n\n      if (queries && queries.length !== 0) {\n        // For queries that have a local View, we need to update their state\n        // in LocalStore (as the resume token and the snapshot version\n        // might have changed) and reconcile their views with the persisted\n        // state (the list of syncedDocuments may have gotten out of sync).\n        await this.localStore.releaseTarget(\n          targetId,\n          /*keepPersistedTargetData=*/ true\n        );\n        targetData = await this.localStore.allocateTarget(\n          queries[0].toTarget()\n        );\n\n        for (const query of queries) {\n          const queryView = this.queryViewsByQuery.get(query);\n          debugAssert(!!queryView, `No query view found for ${query}`);\n\n          const viewChange = await this.synchronizeViewAndComputeSnapshot(\n            queryView\n          );\n          if (viewChange.snapshot) {\n            newViewSnapshots.push(viewChange.snapshot);\n          }\n        }\n      } else {\n        debugAssert(\n          transitionToPrimary,\n          'A secondary tab should never have an active target without an active query.'\n        );\n        // For queries that never executed on this client, we need to\n        // allocate the target in LocalStore and initialize a new View.\n        const target = await this.localStore.getTarget(targetId);\n        debugAssert(!!target, `Target for id ${targetId} not found`);\n        targetData = await this.localStore.allocateTarget(target);\n        await this.initializeViewAndComputeSnapshot(\n          this.synthesizeTargetToQuery(target!),\n          targetId,\n          /*current=*/ false\n        );\n      }\n\n      activeQueries.push(targetData!);\n    }\n\n    this.syncEngineListener!.onWatchChange(newViewSnapshots);\n    return activeQueries;\n  }\n\n  /**\n   * Creates a `Query` object from the specified `Target`. There is no way to\n   * obtain the original `Query`, so we synthesize a `Query` from the `Target`\n   * object.\n   *\n   * The synthesized result might be different from the original `Query`, but\n   * since the synthesized `Query` should return the same results as the\n   * original one (only the presentation of results might differ), the potential\n   * difference will not cause issues.\n   */\n  private synthesizeTargetToQuery(target: Target): Query {\n    return new Query(\n      target.path,\n      target.collectionGroup,\n      target.orderBy,\n      target.filters,\n      target.limit,\n      LimitType.First,\n      target.startAt,\n      target.endAt\n    );\n  }\n\n  getActiveClients(): Promise<ClientId[]> {\n    return this.localStore.getActiveClients();\n  }\n\n  async applyTargetState(\n    targetId: TargetId,\n    state: QueryTargetState,\n    error?: FirestoreError\n  ): Promise<void> {\n    if (this._isPrimaryClient) {\n      // If we receive a target state notification via WebStorage, we are\n      // either already secondary or another tab has taken the primary lease.\n      logDebug(LOG_TAG, 'Ignoring unexpected query state notification.');\n      return;\n    }\n\n    if (this.queriesByTarget.has(targetId)) {\n      switch (state) {\n        case 'current':\n        case 'not-current': {\n          const changes = await this.localStore.getNewDocumentChanges();\n          const synthesizedRemoteEvent = RemoteEvent.createSynthesizedRemoteEventForCurrentChange(\n            targetId,\n            state === 'current'\n          );\n          await this.emitNewSnapsAndNotifyLocalStore(\n            changes,\n            synthesizedRemoteEvent\n          );\n          break;\n        }\n        case 'rejected': {\n          await this.localStore.releaseTarget(\n            targetId,\n            /* keepPersistedTargetData */ true\n          );\n          this.removeAndCleanupTarget(targetId, error);\n          break;\n        }\n        default:\n          fail('Unexpected target state: ' + state);\n      }\n    }\n  }\n\n  async applyActiveTargetsChange(\n    added: TargetId[],\n    removed: TargetId[]\n  ): Promise<void> {\n    if (!this._isPrimaryClient) {\n      return;\n    }\n\n    for (const targetId of added) {\n      if (this.queriesByTarget.has(targetId)) {\n        // A target might have been added in a previous attempt\n        logDebug(LOG_TAG, 'Adding an already active target ' + targetId);\n        continue;\n      }\n\n      const target = await this.localStore.getTarget(targetId);\n      debugAssert(\n        !!target,\n        `Query data for active target ${targetId} not found`\n      );\n      const targetData = await this.localStore.allocateTarget(target);\n      await this.initializeViewAndComputeSnapshot(\n        this.synthesizeTargetToQuery(target),\n        targetData.targetId,\n        /*current=*/ false\n      );\n      this.remoteStore.listen(targetData);\n    }\n\n    for (const targetId of removed) {\n      // Check that the target is still active since the target might have been\n      // removed if it has been rejected by the backend.\n      if (!this.queriesByTarget.has(targetId)) {\n        continue;\n      }\n\n      // Release queries that are still active.\n      await this.localStore\n        .releaseTarget(targetId, /* keepPersistedTargetData */ false)\n        .then(() => {\n          this.remoteStore.unlisten(targetId);\n          this.removeAndCleanupTarget(targetId);\n        })\n        .catch(ignoreIfPrimaryLeaseLoss);\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 { debugAssert } from '../util/assert';\nimport { EventHandler } from '../util/misc';\nimport { ObjectMap } from '../util/obj_map';\nimport { Query } from './query';\nimport { SyncEngine, SyncEngineListener } from './sync_engine';\nimport { OnlineState } from './types';\nimport { ChangeType, DocumentViewChange, ViewSnapshot } from './view_snapshot';\nimport { wrapInUserErrorIfRecoverable } from '../util/async_queue';\n\n/**\n * Holds the listeners and the last received ViewSnapshot for a query being\n * tracked by EventManager.\n */\nclass QueryListenersInfo {\n  viewSnap: ViewSnapshot | undefined = undefined;\n  listeners: QueryListener[] = [];\n}\n\n/**\n * Interface for handling events from the EventManager.\n */\nexport interface Observer<T> {\n  next: EventHandler<T>;\n  error: EventHandler<Error>;\n}\n\n/**\n * EventManager is responsible for mapping queries to query event emitters.\n * It handles \"fan-out\". -- Identical queries will re-use the same watch on the\n * backend.\n */\nexport class EventManager implements SyncEngineListener {\n  private queries = new ObjectMap<Query, QueryListenersInfo>(q =>\n    q.canonicalId()\n  );\n\n  private onlineState = OnlineState.Unknown;\n\n  private snapshotsInSyncListeners: Set<Observer<void>> = new Set();\n\n  constructor(private syncEngine: SyncEngine) {\n    this.syncEngine.subscribe(this);\n  }\n\n  async listen(listener: QueryListener): Promise<void> {\n    const query = listener.query;\n    let firstListen = false;\n\n    let queryInfo = this.queries.get(query);\n    if (!queryInfo) {\n      firstListen = true;\n      queryInfo = new QueryListenersInfo();\n    }\n\n    if (firstListen) {\n      try {\n        queryInfo.viewSnap = await this.syncEngine.listen(query);\n      } catch (e) {\n        const firestoreError = wrapInUserErrorIfRecoverable(\n          e,\n          `Initialization of query '${listener.query}' failed`\n        );\n        listener.onError(firestoreError);\n        return;\n      }\n    }\n\n    this.queries.set(query, queryInfo);\n    queryInfo.listeners.push(listener);\n\n    // Run global snapshot listeners if a consistent snapshot has been emitted.\n    const raisedEvent = listener.applyOnlineStateChange(this.onlineState);\n    debugAssert(\n      !raisedEvent,\n      \"applyOnlineStateChange() shouldn't raise an event for brand-new listeners.\"\n    );\n\n    if (queryInfo.viewSnap) {\n      const raisedEvent = listener.onViewSnapshot(queryInfo.viewSnap);\n      if (raisedEvent) {\n        this.raiseSnapshotsInSyncEvent();\n      }\n    }\n  }\n\n  async unlisten(listener: QueryListener): Promise<void> {\n    const query = listener.query;\n    let lastListen = false;\n\n    const queryInfo = this.queries.get(query);\n    if (queryInfo) {\n      const i = queryInfo.listeners.indexOf(listener);\n      if (i >= 0) {\n        queryInfo.listeners.splice(i, 1);\n        lastListen = queryInfo.listeners.length === 0;\n      }\n    }\n\n    if (lastListen) {\n      this.queries.delete(query);\n      return this.syncEngine.unlisten(query);\n    }\n  }\n\n  onWatchChange(viewSnaps: ViewSnapshot[]): void {\n    let raisedEvent = false;\n    for (const viewSnap of viewSnaps) {\n      const query = viewSnap.query;\n      const queryInfo = this.queries.get(query);\n      if (queryInfo) {\n        for (const listener of queryInfo.listeners) {\n          if (listener.onViewSnapshot(viewSnap)) {\n            raisedEvent = true;\n          }\n        }\n        queryInfo.viewSnap = viewSnap;\n      }\n    }\n    if (raisedEvent) {\n      this.raiseSnapshotsInSyncEvent();\n    }\n  }\n\n  onWatchError(query: Query, error: Error): void {\n    const queryInfo = this.queries.get(query);\n    if (queryInfo) {\n      for (const listener of queryInfo.listeners) {\n        listener.onError(error);\n      }\n    }\n\n    // Remove all listeners. NOTE: We don't need to call syncEngine.unlisten()\n    // after an error.\n    this.queries.delete(query);\n  }\n\n  onOnlineStateChange(onlineState: OnlineState): void {\n    this.onlineState = onlineState;\n    let raisedEvent = false;\n    this.queries.forEach((_, queryInfo) => {\n      for (const listener of queryInfo.listeners) {\n        // Run global snapshot listeners if a consistent snapshot has been emitted.\n        if (listener.applyOnlineStateChange(onlineState)) {\n          raisedEvent = true;\n        }\n      }\n    });\n    if (raisedEvent) {\n      this.raiseSnapshotsInSyncEvent();\n    }\n  }\n\n  addSnapshotsInSyncListener(observer: Observer<void>): void {\n    this.snapshotsInSyncListeners.add(observer);\n    // Immediately fire an initial event, indicating all existing listeners\n    // are in-sync.\n    observer.next();\n  }\n\n  removeSnapshotsInSyncListener(observer: Observer<void>): void {\n    this.snapshotsInSyncListeners.delete(observer);\n  }\n\n  // Call all global snapshot listeners that have been set.\n  private raiseSnapshotsInSyncEvent(): void {\n    this.snapshotsInSyncListeners.forEach(observer => {\n      observer.next();\n    });\n  }\n}\n\nexport interface ListenOptions {\n  /** Raise events even when only the metadata changes */\n  readonly includeMetadataChanges?: boolean;\n\n  /**\n   * Wait for a sync with the server when online, but still raise events while\n   * offline.\n   */\n  readonly waitForSyncWhenOnline?: boolean;\n}\n\n/**\n * QueryListener takes a series of internal view snapshots and determines\n * when to raise the event.\n *\n * It uses an Observer to dispatch events.\n */\nexport class QueryListener {\n  /**\n   * Initial snapshots (e.g. from cache) may not be propagated to the wrapped\n   * observer. This flag is set to true once we've actually raised an event.\n   */\n  private raisedInitialEvent = false;\n\n  private options: ListenOptions;\n\n  private snap: ViewSnapshot | null = null;\n\n  private onlineState = OnlineState.Unknown;\n\n  constructor(\n    readonly query: Query,\n    private queryObserver: Observer<ViewSnapshot>,\n    options?: ListenOptions\n  ) {\n    this.options = options || {};\n  }\n\n  /**\n   * Applies the new ViewSnapshot to this listener, raising a user-facing event\n   * if applicable (depending on what changed, whether the user has opted into\n   * metadata-only changes, etc.). Returns true if a user-facing event was\n   * indeed raised.\n   */\n  onViewSnapshot(snap: ViewSnapshot): boolean {\n    debugAssert(\n      snap.docChanges.length > 0 || snap.syncStateChanged,\n      'We got a new snapshot with no changes?'\n    );\n\n    if (!this.options.includeMetadataChanges) {\n      // Remove the metadata only changes.\n      const docChanges: DocumentViewChange[] = [];\n      for (const docChange of snap.docChanges) {\n        if (docChange.type !== ChangeType.Metadata) {\n          docChanges.push(docChange);\n        }\n      }\n      snap = new ViewSnapshot(\n        snap.query,\n        snap.docs,\n        snap.oldDocs,\n        docChanges,\n        snap.mutatedKeys,\n        snap.fromCache,\n        snap.syncStateChanged,\n        /* excludesMetadataChanges= */ true\n      );\n    }\n    let raisedEvent = false;\n    if (!this.raisedInitialEvent) {\n      if (this.shouldRaiseInitialEvent(snap, this.onlineState)) {\n        this.raiseInitialEvent(snap);\n        raisedEvent = true;\n      }\n    } else if (this.shouldRaiseEvent(snap)) {\n      this.queryObserver.next(snap);\n      raisedEvent = true;\n    }\n\n    this.snap = snap;\n    return raisedEvent;\n  }\n\n  onError(error: Error): void {\n    this.queryObserver.error(error);\n  }\n\n  /** Returns whether a snapshot was raised. */\n  applyOnlineStateChange(onlineState: OnlineState): boolean {\n    this.onlineState = onlineState;\n    let raisedEvent = false;\n    if (\n      this.snap &&\n      !this.raisedInitialEvent &&\n      this.shouldRaiseInitialEvent(this.snap, onlineState)\n    ) {\n      this.raiseInitialEvent(this.snap);\n      raisedEvent = true;\n    }\n    return raisedEvent;\n  }\n\n  private shouldRaiseInitialEvent(\n    snap: ViewSnapshot,\n    onlineState: OnlineState\n  ): boolean {\n    debugAssert(\n      !this.raisedInitialEvent,\n      'Determining whether to raise first event but already had first event'\n    );\n\n    // Always raise the first event when we're synced\n    if (!snap.fromCache) {\n      return true;\n    }\n\n    // NOTE: We consider OnlineState.Unknown as online (it should become Offline\n    // or Online if we wait long enough).\n    const maybeOnline = onlineState !== OnlineState.Offline;\n    // Don't raise the event if we're online, aren't synced yet (checked\n    // above) and are waiting for a sync.\n    if (this.options.waitForSyncWhenOnline && maybeOnline) {\n      debugAssert(\n        snap.fromCache,\n        'Waiting for sync, but snapshot is not from cache'\n      );\n      return false;\n    }\n\n    // Raise data from cache if we have any documents or we are offline\n    return !snap.docs.isEmpty() || onlineState === OnlineState.Offline;\n  }\n\n  private shouldRaiseEvent(snap: ViewSnapshot): boolean {\n    // We don't need to handle includeDocumentMetadataChanges here because\n    // the Metadata only changes have already been stripped out if needed.\n    // At this point the only changes we will see are the ones we should\n    // propagate.\n    if (snap.docChanges.length > 0) {\n      return true;\n    }\n\n    const hasPendingWritesChanged =\n      this.snap && this.snap.hasPendingWrites !== snap.hasPendingWrites;\n    if (snap.syncStateChanged || hasPendingWritesChanged) {\n      return this.options.includeMetadataChanges === true;\n    }\n\n    // Generally we should have hit one of the cases above, but it's possible\n    // to get here if there were only metadata docChanges and they got\n    // stripped out.\n    return false;\n  }\n\n  private raiseInitialEvent(snap: ViewSnapshot): void {\n    debugAssert(\n      !this.raisedInitialEvent,\n      'Trying to raise initial events for second time'\n    );\n    snap = ViewSnapshot.fromInitialDocuments(\n      snap.query,\n      snap.docs,\n      snap.mutatedKeys,\n      snap.fromCache\n    );\n    this.raisedInitialEvent = true;\n    this.queryObserver.next(snap);\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 { QueryEngine } from './query_engine';\nimport { LocalDocumentsView } from './local_documents_view';\nimport { PersistenceTransaction } from './persistence';\nimport { PersistencePromise } from './persistence_promise';\nimport { LimitType, Query } from '../core/query';\nimport { SnapshotVersion } from '../core/snapshot_version';\nimport {\n  DocumentKeySet,\n  DocumentMap,\n  MaybeDocumentMap\n} from '../model/collections';\nimport { Document } from '../model/document';\nimport { debugAssert } from '../util/assert';\nimport { getLogLevel, LogLevel, logDebug } from '../util/log';\nimport { SortedSet } from '../util/sorted_set';\n\n// TOOD(b/140938512): Drop SimpleQueryEngine and rename IndexFreeQueryEngine.\n\n/**\n * A query engine that takes advantage of the target document mapping in the\n * QueryCache. The IndexFreeQueryEngine optimizes query execution by only\n * reading the documents that previously matched a query plus any documents that were\n * edited after the query was last listened to.\n *\n * There are some cases where Index-Free queries are not guaranteed to produce\n * the same results as full collection scans. In these cases, the\n * IndexFreeQueryEngine falls back to full query processing. These cases are:\n *\n * - Limit queries where a document that matched the query previously no longer\n *   matches the query.\n *\n * - Limit queries where a document edit may cause the document to sort below\n *   another document that is in the local cache.\n *\n * - Queries that have never been CURRENT or free of Limbo documents.\n */\nexport class IndexFreeQueryEngine implements QueryEngine {\n  private localDocumentsView: LocalDocumentsView | undefined;\n\n  setLocalDocumentsView(localDocuments: LocalDocumentsView): void {\n    this.localDocumentsView = localDocuments;\n  }\n\n  getDocumentsMatchingQuery(\n    transaction: PersistenceTransaction,\n    query: Query,\n    lastLimboFreeSnapshotVersion: SnapshotVersion,\n    remoteKeys: DocumentKeySet\n  ): PersistencePromise<DocumentMap> {\n    debugAssert(\n      this.localDocumentsView !== undefined,\n      'setLocalDocumentsView() not called'\n    );\n\n    // Queries that match all documents don't benefit from using\n    // IndexFreeQueries. It is more efficient to scan all documents in a\n    // collection, rather than to perform individual lookups.\n    if (query.matchesAllDocuments()) {\n      return this.executeFullCollectionScan(transaction, query);\n    }\n\n    // Queries that have never seen a snapshot without limbo free documents\n    // should also be run as a full collection scan.\n    if (lastLimboFreeSnapshotVersion.isEqual(SnapshotVersion.min())) {\n      return this.executeFullCollectionScan(transaction, query);\n    }\n\n    return this.localDocumentsView!.getDocuments(transaction, remoteKeys).next(\n      documents => {\n        const previousResults = this.applyQuery(query, documents);\n\n        if (\n          (query.hasLimitToFirst() || query.hasLimitToLast()) &&\n          this.needsRefill(\n            query.limitType,\n            previousResults,\n            remoteKeys,\n            lastLimboFreeSnapshotVersion\n          )\n        ) {\n          return this.executeFullCollectionScan(transaction, query);\n        }\n\n        if (getLogLevel() <= LogLevel.DEBUG) {\n          logDebug(\n            'IndexFreeQueryEngine',\n            'Re-using previous result from %s to execute query: %s',\n            lastLimboFreeSnapshotVersion.toString(),\n            query.toString()\n          );\n        }\n\n        // Retrieve all results for documents that were updated since the last\n        // limbo-document free remote snapshot.\n        return this.localDocumentsView!.getDocumentsMatchingQuery(\n          transaction,\n          query,\n          lastLimboFreeSnapshotVersion\n        ).next(updatedResults => {\n          // We merge `previousResults` into `updateResults`, since\n          // `updateResults` is already a DocumentMap. If a document is\n          // contained in both lists, then its contents are the same.\n          previousResults.forEach(doc => {\n            updatedResults = updatedResults.insert(doc.key, doc);\n          });\n          return updatedResults;\n        });\n      }\n    );\n  }\n\n  /** Applies the query filter and sorting to the provided documents.  */\n  private applyQuery(\n    query: Query,\n    documents: MaybeDocumentMap\n  ): SortedSet<Document> {\n    // Sort the documents and re-apply the query filter since previously\n    // matching documents do not necessarily still match the query.\n    let queryResults = new SortedSet<Document>((d1, d2) =>\n      query.docComparator(d1, d2)\n    );\n    documents.forEach((_, maybeDoc) => {\n      if (maybeDoc instanceof Document && query.matches(maybeDoc)) {\n        queryResults = queryResults.add(maybeDoc);\n      }\n    });\n    return queryResults;\n  }\n\n  /**\n   * Determines if a limit query needs to be refilled from cache, making it\n   * ineligible for index-free execution.\n   *\n   * @param sortedPreviousResults The documents that matched the query when it\n   * was last synchronized, sorted by the query's comparator.\n   * @param remoteKeys The document keys that matched the query at the last\n   * snapshot.\n   * @param limboFreeSnapshotVersion The version of the snapshot when the query\n   * was last synchronized.\n   */\n  private needsRefill(\n    limitType: LimitType,\n    sortedPreviousResults: SortedSet<Document>,\n    remoteKeys: DocumentKeySet,\n    limboFreeSnapshotVersion: SnapshotVersion\n  ): boolean {\n    // The query needs to be refilled if a previously matching document no\n    // longer matches.\n    if (remoteKeys.size !== sortedPreviousResults.size) {\n      return true;\n    }\n\n    // Limit queries are not eligible for index-free query execution if there is\n    // a potential that an older document from cache now sorts before a document\n    // that was previously part of the limit. This, however, can only happen if\n    // the document at the edge of the limit goes out of limit.\n    // If a document that is not the limit boundary sorts differently,\n    // the boundary of the limit itself did not change and documents from cache\n    // will continue to be \"rejected\" by this boundary. Therefore, we can ignore\n    // any modifications that don't affect the last document.\n    const docAtLimitEdge =\n      limitType === LimitType.First\n        ? sortedPreviousResults.last()\n        : sortedPreviousResults.first();\n    if (!docAtLimitEdge) {\n      // We don't need to refill the query if there were already no documents.\n      return false;\n    }\n    return (\n      docAtLimitEdge.hasPendingWrites ||\n      docAtLimitEdge.version.compareTo(limboFreeSnapshotVersion) > 0\n    );\n  }\n\n  private executeFullCollectionScan(\n    transaction: PersistenceTransaction,\n    query: Query\n  ): PersistencePromise<DocumentMap> {\n    if (getLogLevel() <= LogLevel.DEBUG) {\n      logDebug(\n        'IndexFreeQueryEngine',\n        'Using full collection scan to execute query:',\n        query.toString()\n      );\n    }\n\n    return this.localDocumentsView!.getDocumentsMatchingQuery(\n      transaction,\n      query,\n      SnapshotVersion.min()\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 { Timestamp } from '../api/timestamp';\nimport { Query } from '../core/query';\nimport { BatchId } from '../core/types';\nimport { DocumentKey } from '../model/document_key';\nimport { Mutation } from '../model/mutation';\nimport { MutationBatch, BATCHID_UNKNOWN } from '../model/mutation_batch';\nimport { debugAssert, hardAssert } from '../util/assert';\nimport { primitiveComparator } from '../util/misc';\nimport { ByteString } from '../util/byte_string';\nimport { SortedMap } from '../util/sorted_map';\nimport { SortedSet } from '../util/sorted_set';\n\nimport { IndexManager } from './index_manager';\nimport { MutationQueue } from './mutation_queue';\nimport { PersistenceTransaction, ReferenceDelegate } from './persistence';\nimport { PersistencePromise } from './persistence_promise';\nimport { DocReference } from './reference_set';\n\nexport class MemoryMutationQueue implements MutationQueue {\n  /**\n   * The set of all mutations that have been sent but not yet been applied to\n   * the backend.\n   */\n  private mutationQueue: MutationBatch[] = [];\n\n  /** Next value to use when assigning sequential IDs to each mutation batch. */\n  private nextBatchId: BatchId = 1;\n\n  /** The last received stream token from the server, used to acknowledge which\n   * responses the client has processed. Stream tokens are opaque checkpoint\n   * markers whose only real value is their inclusion in the next request.\n   */\n  private lastStreamToken: ByteString = ByteString.EMPTY_BYTE_STRING;\n\n  /** An ordered mapping between documents and the mutations batch IDs. */\n  private batchesByDocumentKey = new SortedSet(DocReference.compareByKey);\n\n  constructor(\n    private readonly indexManager: IndexManager,\n    private readonly referenceDelegate: ReferenceDelegate\n  ) {}\n\n  checkEmpty(transaction: PersistenceTransaction): PersistencePromise<boolean> {\n    return PersistencePromise.resolve(this.mutationQueue.length === 0);\n  }\n\n  acknowledgeBatch(\n    transaction: PersistenceTransaction,\n    batch: MutationBatch,\n    streamToken: ByteString\n  ): PersistencePromise<void> {\n    const batchId = batch.batchId;\n    const batchIndex = this.indexOfExistingBatchId(batchId, 'acknowledged');\n    hardAssert(\n      batchIndex === 0,\n      'Can only acknowledge the first batch in the mutation queue'\n    );\n\n    // Verify that the batch in the queue is the one to be acknowledged.\n    const check = this.mutationQueue[batchIndex];\n    debugAssert(\n      batchId === check.batchId,\n      'Queue ordering failure: expected batch ' +\n        batchId +\n        ', got batch ' +\n        check.batchId\n    );\n\n    this.lastStreamToken = streamToken;\n    return PersistencePromise.resolve();\n  }\n\n  getLastStreamToken(\n    transaction: PersistenceTransaction\n  ): PersistencePromise<ByteString> {\n    return PersistencePromise.resolve(this.lastStreamToken);\n  }\n\n  setLastStreamToken(\n    transaction: PersistenceTransaction,\n    streamToken: ByteString\n  ): PersistencePromise<void> {\n    this.lastStreamToken = streamToken;\n    return PersistencePromise.resolve();\n  }\n\n  addMutationBatch(\n    transaction: PersistenceTransaction,\n    localWriteTime: Timestamp,\n    baseMutations: Mutation[],\n    mutations: Mutation[]\n  ): PersistencePromise<MutationBatch> {\n    debugAssert(mutations.length !== 0, 'Mutation batches should not be empty');\n\n    const batchId = this.nextBatchId;\n    this.nextBatchId++;\n\n    if (this.mutationQueue.length > 0) {\n      const prior = this.mutationQueue[this.mutationQueue.length - 1];\n      debugAssert(\n        prior.batchId < batchId,\n        'Mutation batchIDs must be monotonically increasing order'\n      );\n    }\n\n    const batch = new MutationBatch(\n      batchId,\n      localWriteTime,\n      baseMutations,\n      mutations\n    );\n    this.mutationQueue.push(batch);\n\n    // Track references by document key and index collection parents.\n    for (const mutation of mutations) {\n      this.batchesByDocumentKey = this.batchesByDocumentKey.add(\n        new DocReference(mutation.key, batchId)\n      );\n\n      this.indexManager.addToCollectionParentIndex(\n        transaction,\n        mutation.key.path.popLast()\n      );\n    }\n\n    return PersistencePromise.resolve(batch);\n  }\n\n  lookupMutationBatch(\n    transaction: PersistenceTransaction,\n    batchId: BatchId\n  ): PersistencePromise<MutationBatch | null> {\n    return PersistencePromise.resolve(this.findMutationBatch(batchId));\n  }\n\n  getNextMutationBatchAfterBatchId(\n    transaction: PersistenceTransaction,\n    batchId: BatchId\n  ): PersistencePromise<MutationBatch | null> {\n    const nextBatchId = batchId + 1;\n\n    // The requested batchId may still be out of range so normalize it to the\n    // start of the queue.\n    const rawIndex = this.indexOfBatchId(nextBatchId);\n    const index = rawIndex < 0 ? 0 : rawIndex;\n    return PersistencePromise.resolve(\n      this.mutationQueue.length > index ? this.mutationQueue[index] : null\n    );\n  }\n\n  getHighestUnacknowledgedBatchId(): PersistencePromise<BatchId> {\n    return PersistencePromise.resolve(\n      this.mutationQueue.length === 0 ? BATCHID_UNKNOWN : this.nextBatchId - 1\n    );\n  }\n\n  getAllMutationBatches(\n    transaction: PersistenceTransaction\n  ): PersistencePromise<MutationBatch[]> {\n    return PersistencePromise.resolve(this.mutationQueue.slice());\n  }\n\n  getAllMutationBatchesAffectingDocumentKey(\n    transaction: PersistenceTransaction,\n    documentKey: DocumentKey\n  ): PersistencePromise<MutationBatch[]> {\n    const start = new DocReference(documentKey, 0);\n    const end = new DocReference(documentKey, Number.POSITIVE_INFINITY);\n    const result: MutationBatch[] = [];\n    this.batchesByDocumentKey.forEachInRange([start, end], ref => {\n      debugAssert(\n        documentKey.isEqual(ref.key),\n        \"Should only iterate over a single key's batches\"\n      );\n      const batch = this.findMutationBatch(ref.targetOrBatchId);\n      debugAssert(\n        batch !== null,\n        'Batches in the index must exist in the main table'\n      );\n      result.push(batch!);\n    });\n\n    return PersistencePromise.resolve(result);\n  }\n\n  getAllMutationBatchesAffectingDocumentKeys(\n    transaction: PersistenceTransaction,\n    documentKeys: SortedMap<DocumentKey, unknown>\n  ): PersistencePromise<MutationBatch[]> {\n    let uniqueBatchIDs = new SortedSet<number>(primitiveComparator);\n\n    documentKeys.forEach(documentKey => {\n      const start = new DocReference(documentKey, 0);\n      const end = new DocReference(documentKey, Number.POSITIVE_INFINITY);\n      this.batchesByDocumentKey.forEachInRange([start, end], ref => {\n        debugAssert(\n          documentKey.isEqual(ref.key),\n          \"For each key, should only iterate over a single key's batches\"\n        );\n\n        uniqueBatchIDs = uniqueBatchIDs.add(ref.targetOrBatchId);\n      });\n    });\n\n    return PersistencePromise.resolve(this.findMutationBatches(uniqueBatchIDs));\n  }\n\n  getAllMutationBatchesAffectingQuery(\n    transaction: PersistenceTransaction,\n    query: Query\n  ): PersistencePromise<MutationBatch[]> {\n    debugAssert(\n      !query.isCollectionGroupQuery(),\n      'CollectionGroup queries should be handled in LocalDocumentsView'\n    );\n    // Use the query path as a prefix for testing if a document matches the\n    // query.\n    const prefix = query.path;\n    const immediateChildrenPathLength = prefix.length + 1;\n\n    // Construct a document reference for actually scanning the index. Unlike\n    // the prefix the document key in this reference must have an even number of\n    // segments. The empty segment can be used a suffix of the query path\n    // because it precedes all other segments in an ordered traversal.\n    let startPath = prefix;\n    if (!DocumentKey.isDocumentKey(startPath)) {\n      startPath = startPath.child('');\n    }\n\n    const start = new DocReference(new DocumentKey(startPath), 0);\n\n    // Find unique batchIDs referenced by all documents potentially matching the\n    // query.\n    let uniqueBatchIDs = new SortedSet<number>(primitiveComparator);\n\n    this.batchesByDocumentKey.forEachWhile(ref => {\n      const rowKeyPath = ref.key.path;\n      if (!prefix.isPrefixOf(rowKeyPath)) {\n        return false;\n      } else {\n        // Rows with document keys more than one segment longer than the query\n        // path can't be matches. For example, a query on 'rooms' can't match\n        // the document /rooms/abc/messages/xyx.\n        // TODO(mcg): we'll need a different scanner when we implement\n        // ancestor queries.\n        if (rowKeyPath.length === immediateChildrenPathLength) {\n          uniqueBatchIDs = uniqueBatchIDs.add(ref.targetOrBatchId);\n        }\n        return true;\n      }\n    }, start);\n\n    return PersistencePromise.resolve(this.findMutationBatches(uniqueBatchIDs));\n  }\n\n  private findMutationBatches(batchIDs: SortedSet<number>): MutationBatch[] {\n    // Construct an array of matching batches, sorted by batchID to ensure that\n    // multiple mutations affecting the same document key are applied in order.\n    const result: MutationBatch[] = [];\n    batchIDs.forEach(batchId => {\n      const batch = this.findMutationBatch(batchId);\n      if (batch !== null) {\n        result.push(batch);\n      }\n    });\n    return result;\n  }\n\n  removeMutationBatch(\n    transaction: PersistenceTransaction,\n    batch: MutationBatch\n  ): PersistencePromise<void> {\n    // Find the position of the first batch for removal.\n    const batchIndex = this.indexOfExistingBatchId(batch.batchId, 'removed');\n    hardAssert(\n      batchIndex === 0,\n      'Can only remove the first entry of the mutation queue'\n    );\n    this.mutationQueue.shift();\n\n    let references = this.batchesByDocumentKey;\n    return PersistencePromise.forEach(batch.mutations, (mutation: Mutation) => {\n      const ref = new DocReference(mutation.key, batch.batchId);\n      references = references.delete(ref);\n      return this.referenceDelegate.markPotentiallyOrphaned(\n        transaction,\n        mutation.key\n      );\n    }).next(() => {\n      this.batchesByDocumentKey = references;\n    });\n  }\n\n  removeCachedMutationKeys(batchId: BatchId): void {\n    // No-op since the memory mutation queue does not maintain a separate cache.\n  }\n\n  containsKey(\n    txn: PersistenceTransaction,\n    key: DocumentKey\n  ): PersistencePromise<boolean> {\n    const ref = new DocReference(key, 0);\n    const firstRef = this.batchesByDocumentKey.firstAfterOrEqual(ref);\n    return PersistencePromise.resolve(key.isEqual(firstRef && firstRef.key));\n  }\n\n  performConsistencyCheck(\n    txn: PersistenceTransaction\n  ): PersistencePromise<void> {\n    if (this.mutationQueue.length === 0) {\n      debugAssert(\n        this.batchesByDocumentKey.isEmpty(),\n        'Document leak -- detected dangling mutation references when queue is empty.'\n      );\n    }\n    return PersistencePromise.resolve();\n  }\n\n  /**\n   * Finds the index of the given batchId in the mutation queue and asserts that\n   * the resulting index is within the bounds of the queue.\n   *\n   * @param batchId The batchId to search for\n   * @param action A description of what the caller is doing, phrased in passive\n   * form (e.g. \"acknowledged\" in a routine that acknowledges batches).\n   */\n  private indexOfExistingBatchId(batchId: BatchId, action: string): number {\n    const index = this.indexOfBatchId(batchId);\n    debugAssert(\n      index >= 0 && index < this.mutationQueue.length,\n      'Batches must exist to be ' + action\n    );\n    return index;\n  }\n\n  /**\n   * Finds the index of the given batchId in the mutation queue. This operation\n   * is O(1).\n   *\n   * @return The computed index of the batch with the given batchId, based on\n   * the state of the queue. Note this index can be negative if the requested\n   * batchId has already been remvoed from the queue or past the end of the\n   * queue if the batchId is larger than the last added batch.\n   */\n  private indexOfBatchId(batchId: BatchId): number {\n    if (this.mutationQueue.length === 0) {\n      // As an index this is past the end of the queue\n      return 0;\n    }\n\n    // Examine the front of the queue to figure out the difference between the\n    // batchId and indexes in the array. Note that since the queue is ordered\n    // by batchId, if the first batch has a larger batchId then the requested\n    // batchId doesn't exist in the queue.\n    const firstBatchId = this.mutationQueue[0].batchId;\n    return batchId - firstBatchId;\n  }\n\n  /**\n   * A version of lookupMutationBatch that doesn't return a promise, this makes\n   * other functions that uses this code easier to read and more efficent.\n   */\n  private findMutationBatch(batchId: BatchId): MutationBatch | null {\n    const index = this.indexOfBatchId(batchId);\n    if (index < 0 || index >= this.mutationQueue.length) {\n      return null;\n    }\n\n    const batch = this.mutationQueue[index];\n    debugAssert(batch.batchId === batchId, 'If found batch must match');\n    return batch;\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 { Query } from '../core/query';\nimport {\n  DocumentKeySet,\n  DocumentMap,\n  documentMap,\n  DocumentSizeEntry,\n  NullableMaybeDocumentMap,\n  nullableMaybeDocumentMap\n} from '../model/collections';\nimport { Document, MaybeDocument } from '../model/document';\nimport { DocumentKey } from '../model/document_key';\n\nimport { SnapshotVersion } from '../core/snapshot_version';\nimport { debugAssert } from '../util/assert';\nimport { SortedMap } from '../util/sorted_map';\nimport { IndexManager } from './index_manager';\nimport { PersistenceTransaction } from './persistence';\nimport { PersistencePromise } from './persistence_promise';\nimport { RemoteDocumentCache } from './remote_document_cache';\nimport { RemoteDocumentChangeBuffer } from './remote_document_change_buffer';\n\nexport type DocumentSizer = (doc: MaybeDocument) => number;\n\n/** Miscellaneous collection types / constants. */\ninterface MemoryRemoteDocumentCacheEntry extends DocumentSizeEntry {\n  readTime: SnapshotVersion;\n}\n\ntype DocumentEntryMap = SortedMap<DocumentKey, MemoryRemoteDocumentCacheEntry>;\nfunction documentEntryMap(): DocumentEntryMap {\n  return new SortedMap<DocumentKey, MemoryRemoteDocumentCacheEntry>(\n    DocumentKey.comparator\n  );\n}\n\nexport class MemoryRemoteDocumentCache implements RemoteDocumentCache {\n  /** Underlying cache of documents and their read times. */\n  private docs = documentEntryMap();\n\n  /** Size of all cached documents. */\n  private size = 0;\n\n  /**\n   * @param sizer Used to assess the size of a document. For eager GC, this is expected to just\n   * return 0 to avoid unnecessarily doing the work of calculating the size.\n   */\n  constructor(\n    private readonly indexManager: IndexManager,\n    private readonly sizer: DocumentSizer\n  ) {}\n\n  /**\n   * Adds the supplied entry to the cache and updates the cache size as appropriate.\n   *\n   * All calls of `addEntry`  are required to go through the RemoteDocumentChangeBuffer\n   * returned by `newChangeBuffer()`.\n   */\n  private addEntry(\n    transaction: PersistenceTransaction,\n    doc: MaybeDocument,\n    readTime: SnapshotVersion\n  ): PersistencePromise<void> {\n    debugAssert(\n      !readTime.isEqual(SnapshotVersion.min()),\n      'Cannot add a document with a read time of zero'\n    );\n\n    const key = doc.key;\n    const entry = this.docs.get(key);\n    const previousSize = entry ? entry.size : 0;\n    const currentSize = this.sizer(doc);\n\n    this.docs = this.docs.insert(key, {\n      maybeDocument: doc,\n      size: currentSize,\n      readTime\n    });\n\n    this.size += currentSize - previousSize;\n\n    return this.indexManager.addToCollectionParentIndex(\n      transaction,\n      key.path.popLast()\n    );\n  }\n\n  /**\n   * Removes the specified entry from the cache and updates the cache size as appropriate.\n   *\n   * All calls of `removeEntry` are required to go through the RemoteDocumentChangeBuffer\n   * returned by `newChangeBuffer()`.\n   */\n  private removeEntry(documentKey: DocumentKey): void {\n    const entry = this.docs.get(documentKey);\n    if (entry) {\n      this.docs = this.docs.remove(documentKey);\n      this.size -= entry.size;\n    }\n  }\n\n  getEntry(\n    transaction: PersistenceTransaction,\n    documentKey: DocumentKey\n  ): PersistencePromise<MaybeDocument | null> {\n    const entry = this.docs.get(documentKey);\n    return PersistencePromise.resolve(entry ? entry.maybeDocument : null);\n  }\n\n  getEntries(\n    transaction: PersistenceTransaction,\n    documentKeys: DocumentKeySet\n  ): PersistencePromise<NullableMaybeDocumentMap> {\n    let results = nullableMaybeDocumentMap();\n    documentKeys.forEach(documentKey => {\n      const entry = this.docs.get(documentKey);\n      results = results.insert(documentKey, entry ? entry.maybeDocument : null);\n    });\n    return PersistencePromise.resolve(results);\n  }\n\n  getDocumentsMatchingQuery(\n    transaction: PersistenceTransaction,\n    query: Query,\n    sinceReadTime: SnapshotVersion\n  ): PersistencePromise<DocumentMap> {\n    debugAssert(\n      !query.isCollectionGroupQuery(),\n      'CollectionGroup queries should be handled in LocalDocumentsView'\n    );\n    let results = documentMap();\n\n    // Documents are ordered by key, so we can use a prefix scan to narrow down\n    // the documents we need to match the query against.\n    const prefix = new DocumentKey(query.path.child(''));\n    const iterator = this.docs.getIteratorFrom(prefix);\n    while (iterator.hasNext()) {\n      const {\n        key,\n        value: { maybeDocument, readTime }\n      } = iterator.getNext();\n      if (!query.path.isPrefixOf(key.path)) {\n        break;\n      }\n      if (readTime.compareTo(sinceReadTime) <= 0) {\n        continue;\n      }\n      if (maybeDocument instanceof Document && query.matches(maybeDocument)) {\n        results = results.insert(maybeDocument.key, maybeDocument);\n      }\n    }\n    return PersistencePromise.resolve(results);\n  }\n\n  forEachDocumentKey(\n    transaction: PersistenceTransaction,\n    f: (key: DocumentKey) => PersistencePromise<void>\n  ): PersistencePromise<void> {\n    return PersistencePromise.forEach(this.docs, (key: DocumentKey) => f(key));\n  }\n\n  newChangeBuffer(options?: {\n    trackRemovals: boolean;\n  }): RemoteDocumentChangeBuffer {\n    // `trackRemovals` is ignores since the MemoryRemoteDocumentCache keeps\n    // a separate changelog and does not need special handling for removals.\n    return new MemoryRemoteDocumentCache.RemoteDocumentChangeBuffer(this);\n  }\n\n  getSize(txn: PersistenceTransaction): PersistencePromise<number> {\n    return PersistencePromise.resolve(this.size);\n  }\n\n  /**\n   * Handles the details of adding and updating documents in the MemoryRemoteDocumentCache.\n   */\n  private static RemoteDocumentChangeBuffer = class extends RemoteDocumentChangeBuffer {\n    constructor(private readonly documentCache: MemoryRemoteDocumentCache) {\n      super();\n    }\n\n    protected applyChanges(\n      transaction: PersistenceTransaction\n    ): PersistencePromise<void> {\n      const promises: Array<PersistencePromise<void>> = [];\n      this.changes.forEach((key, doc) => {\n        if (doc) {\n          promises.push(\n            this.documentCache.addEntry(transaction, doc, this.readTime)\n          );\n        } else {\n          this.documentCache.removeEntry(key);\n        }\n      });\n      return PersistencePromise.waitFor(promises);\n    }\n\n    protected getFromCache(\n      transaction: PersistenceTransaction,\n      documentKey: DocumentKey\n    ): PersistencePromise<MaybeDocument | null> {\n      return this.documentCache.getEntry(transaction, documentKey);\n    }\n\n    protected getAllFromCache(\n      transaction: PersistenceTransaction,\n      documentKeys: DocumentKeySet\n    ): PersistencePromise<NullableMaybeDocumentMap> {\n      return this.documentCache.getEntries(transaction, documentKeys);\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 { SnapshotVersion } from '../core/snapshot_version';\nimport { TargetIdGenerator } from '../core/target_id_generator';\nimport { ListenSequenceNumber, TargetId } from '../core/types';\nimport { DocumentKeySet } from '../model/collections';\nimport { DocumentKey } from '../model/document_key';\nimport { debugAssert } from '../util/assert';\nimport { ObjectMap } from '../util/obj_map';\n\nimport { ActiveTargets } from './lru_garbage_collector';\nimport { MemoryPersistence } from './memory_persistence';\nimport { PersistenceTransaction } from './persistence';\nimport { PersistencePromise } from './persistence_promise';\nimport { ReferenceSet } from './reference_set';\nimport { TargetCache } from './target_cache';\nimport { TargetData } from './target_data';\nimport { Target } from '../core/target';\n\nexport class MemoryTargetCache implements TargetCache {\n  /**\n   * Maps a target to the data about that target\n   */\n  private targets = new ObjectMap<Target, TargetData>(t => t.canonicalId());\n\n  /** The last received snapshot version. */\n  private lastRemoteSnapshotVersion = SnapshotVersion.min();\n  /** The highest numbered target ID encountered. */\n  private highestTargetId: TargetId = 0;\n  /** The highest sequence number encountered. */\n  private highestSequenceNumber: ListenSequenceNumber = 0;\n  /**\n   * A ordered bidirectional mapping between documents and the remote target\n   * IDs.\n   */\n  private references = new ReferenceSet();\n\n  private targetCount = 0;\n\n  private targetIdGenerator = TargetIdGenerator.forTargetCache();\n\n  constructor(private readonly persistence: MemoryPersistence) {}\n\n  forEachTarget(\n    txn: PersistenceTransaction,\n    f: (q: TargetData) => void\n  ): PersistencePromise<void> {\n    this.targets.forEach((_, targetData) => f(targetData));\n    return PersistencePromise.resolve();\n  }\n\n  getLastRemoteSnapshotVersion(\n    transaction: PersistenceTransaction\n  ): PersistencePromise<SnapshotVersion> {\n    return PersistencePromise.resolve(this.lastRemoteSnapshotVersion);\n  }\n\n  getHighestSequenceNumber(\n    transaction: PersistenceTransaction\n  ): PersistencePromise<ListenSequenceNumber> {\n    return PersistencePromise.resolve(this.highestSequenceNumber);\n  }\n\n  allocateTargetId(\n    transaction: PersistenceTransaction\n  ): PersistencePromise<TargetId> {\n    this.highestTargetId = this.targetIdGenerator.next();\n    return PersistencePromise.resolve(this.highestTargetId);\n  }\n\n  setTargetsMetadata(\n    transaction: PersistenceTransaction,\n    highestListenSequenceNumber: number,\n    lastRemoteSnapshotVersion?: SnapshotVersion\n  ): PersistencePromise<void> {\n    if (lastRemoteSnapshotVersion) {\n      this.lastRemoteSnapshotVersion = lastRemoteSnapshotVersion;\n    }\n    if (highestListenSequenceNumber > this.highestSequenceNumber) {\n      this.highestSequenceNumber = highestListenSequenceNumber;\n    }\n    return PersistencePromise.resolve();\n  }\n\n  private saveTargetData(targetData: TargetData): void {\n    this.targets.set(targetData.target, targetData);\n    const targetId = targetData.targetId;\n    if (targetId > this.highestTargetId) {\n      this.targetIdGenerator = new TargetIdGenerator(targetId);\n      this.highestTargetId = targetId;\n    }\n    if (targetData.sequenceNumber > this.highestSequenceNumber) {\n      this.highestSequenceNumber = targetData.sequenceNumber;\n    }\n  }\n\n  addTargetData(\n    transaction: PersistenceTransaction,\n    targetData: TargetData\n  ): PersistencePromise<void> {\n    debugAssert(\n      !this.targets.has(targetData.target),\n      'Adding a target that already exists'\n    );\n    this.saveTargetData(targetData);\n    this.targetCount += 1;\n    return PersistencePromise.resolve();\n  }\n\n  updateTargetData(\n    transaction: PersistenceTransaction,\n    targetData: TargetData\n  ): PersistencePromise<void> {\n    debugAssert(\n      this.targets.has(targetData.target),\n      'Updating a non-existent target'\n    );\n    this.saveTargetData(targetData);\n    return PersistencePromise.resolve();\n  }\n\n  removeTargetData(\n    transaction: PersistenceTransaction,\n    targetData: TargetData\n  ): PersistencePromise<void> {\n    debugAssert(this.targetCount > 0, 'Removing a target from an empty cache');\n    debugAssert(\n      this.targets.has(targetData.target),\n      'Removing a non-existent target from the cache'\n    );\n    this.targets.delete(targetData.target);\n    this.references.removeReferencesForId(targetData.targetId);\n    this.targetCount -= 1;\n    return PersistencePromise.resolve();\n  }\n\n  removeTargets(\n    transaction: PersistenceTransaction,\n    upperBound: ListenSequenceNumber,\n    activeTargetIds: ActiveTargets\n  ): PersistencePromise<number> {\n    let count = 0;\n    const removals: Array<PersistencePromise<void>> = [];\n    this.targets.forEach((key, targetData) => {\n      if (\n        targetData.sequenceNumber <= upperBound &&\n        activeTargetIds.get(targetData.targetId) === null\n      ) {\n        this.targets.delete(key);\n        removals.push(\n          this.removeMatchingKeysForTargetId(transaction, targetData.targetId)\n        );\n        count++;\n      }\n    });\n    return PersistencePromise.waitFor(removals).next(() => count);\n  }\n\n  getTargetCount(\n    transaction: PersistenceTransaction\n  ): PersistencePromise<number> {\n    return PersistencePromise.resolve(this.targetCount);\n  }\n\n  getTargetData(\n    transaction: PersistenceTransaction,\n    target: Target\n  ): PersistencePromise<TargetData | null> {\n    const targetData = this.targets.get(target) || null;\n    return PersistencePromise.resolve(targetData);\n  }\n\n  addMatchingKeys(\n    txn: PersistenceTransaction,\n    keys: DocumentKeySet,\n    targetId: TargetId\n  ): PersistencePromise<void> {\n    this.references.addReferences(keys, targetId);\n    return PersistencePromise.resolve();\n  }\n\n  removeMatchingKeys(\n    txn: PersistenceTransaction,\n    keys: DocumentKeySet,\n    targetId: TargetId\n  ): PersistencePromise<void> {\n    this.references.removeReferences(keys, targetId);\n    const referenceDelegate = this.persistence.referenceDelegate;\n    const promises: Array<PersistencePromise<void>> = [];\n    if (referenceDelegate) {\n      keys.forEach(key => {\n        promises.push(referenceDelegate.markPotentiallyOrphaned(txn, key));\n      });\n    }\n    return PersistencePromise.waitFor(promises);\n  }\n\n  removeMatchingKeysForTargetId(\n    txn: PersistenceTransaction,\n    targetId: TargetId\n  ): PersistencePromise<void> {\n    this.references.removeReferencesForId(targetId);\n    return PersistencePromise.resolve();\n  }\n\n  getMatchingKeysForTargetId(\n    txn: PersistenceTransaction,\n    targetId: TargetId\n  ): PersistencePromise<DocumentKeySet> {\n    const matchingKeys = this.references.referencesForId(targetId);\n    return PersistencePromise.resolve(matchingKeys);\n  }\n\n  containsKey(\n    txn: PersistenceTransaction,\n    key: DocumentKey\n  ): PersistencePromise<boolean> {\n    return PersistencePromise.resolve(this.references.containsKey(key));\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 { User } from '../auth/user';\nimport { Document, MaybeDocument } from '../model/document';\nimport { DocumentKey } from '../model/document_key';\nimport { fail } from '../util/assert';\nimport { logDebug } from '../util/log';\nimport { ObjectMap } from '../util/obj_map';\nimport { encodeResourcePath } from './encoded_resource_path';\nimport {\n  ActiveTargets,\n  LruDelegate,\n  LruGarbageCollector,\n  LruParams\n} from './lru_garbage_collector';\nimport { ListenSequence } from '../core/listen_sequence';\nimport { ListenSequenceNumber, TargetId } from '../core/types';\nimport { estimateByteSize } from '../model/values';\nimport { MemoryIndexManager } from './memory_index_manager';\nimport { MemoryMutationQueue } from './memory_mutation_queue';\nimport { MemoryRemoteDocumentCache } from './memory_remote_document_cache';\nimport { MemoryTargetCache } from './memory_target_cache';\nimport { MutationQueue } from './mutation_queue';\nimport {\n  Persistence,\n  PersistenceTransaction,\n  PersistenceTransactionMode,\n  ReferenceDelegate\n} from './persistence';\nimport { PersistencePromise } from './persistence_promise';\nimport { ReferenceSet } from './reference_set';\nimport { TargetData } from './target_data';\n\nconst LOG_TAG = 'MemoryPersistence';\n/**\n * A memory-backed instance of Persistence. Data is stored only in RAM and\n * not persisted across sessions.\n */\nexport class MemoryPersistence implements Persistence {\n  /**\n   * Note that these are retained here to make it easier to write tests\n   * affecting both the in-memory and IndexedDB-backed persistence layers. Tests\n   * can create a new LocalStore wrapping this Persistence instance and this\n   * will make the in-memory persistence layer behave as if it were actually\n   * persisting values.\n   */\n  private readonly indexManager: MemoryIndexManager;\n  private mutationQueues: { [user: string]: MemoryMutationQueue } = {};\n  private readonly remoteDocumentCache: MemoryRemoteDocumentCache;\n  private readonly targetCache: MemoryTargetCache;\n  private readonly listenSequence = new ListenSequence(0);\n\n  private _started = false;\n\n  readonly referenceDelegate: MemoryReferenceDelegate;\n\n  /**\n   * The constructor accepts a factory for creating a reference delegate. This\n   * allows both the delegate and this instance to have strong references to\n   * each other without having nullable fields that would then need to be\n   * checked or asserted on every access.\n   */\n  constructor(\n    referenceDelegateFactory: (p: MemoryPersistence) => MemoryReferenceDelegate\n  ) {\n    this._started = true;\n    this.referenceDelegate = referenceDelegateFactory(this);\n    this.targetCache = new MemoryTargetCache(this);\n    const sizer = (doc: MaybeDocument): number =>\n      this.referenceDelegate.documentSize(doc);\n    this.indexManager = new MemoryIndexManager();\n    this.remoteDocumentCache = new MemoryRemoteDocumentCache(\n      this.indexManager,\n      sizer\n    );\n  }\n\n  start(): Promise<void> {\n    return Promise.resolve();\n  }\n\n  shutdown(): Promise<void> {\n    // No durable state to ensure is closed on shutdown.\n    this._started = false;\n    return Promise.resolve();\n  }\n\n  get started(): boolean {\n    return this._started;\n  }\n\n  setDatabaseDeletedListener(): void {\n    // No op.\n  }\n\n  getIndexManager(): MemoryIndexManager {\n    return this.indexManager;\n  }\n\n  getMutationQueue(user: User): MutationQueue {\n    let queue = this.mutationQueues[user.toKey()];\n    if (!queue) {\n      queue = new MemoryMutationQueue(\n        this.indexManager,\n        this.referenceDelegate\n      );\n      this.mutationQueues[user.toKey()] = queue;\n    }\n    return queue;\n  }\n\n  getTargetCache(): MemoryTargetCache {\n    return this.targetCache;\n  }\n\n  getRemoteDocumentCache(): MemoryRemoteDocumentCache {\n    return this.remoteDocumentCache;\n  }\n\n  runTransaction<T>(\n    action: string,\n    mode: PersistenceTransactionMode,\n    transactionOperation: (\n      transaction: PersistenceTransaction\n    ) => PersistencePromise<T>\n  ): Promise<T> {\n    logDebug(LOG_TAG, 'Starting transaction:', action);\n    const txn = new MemoryTransaction(this.listenSequence.next());\n    this.referenceDelegate.onTransactionStarted();\n    return transactionOperation(txn)\n      .next(result => {\n        return this.referenceDelegate\n          .onTransactionCommitted(txn)\n          .next(() => result);\n      })\n      .toPromise()\n      .then(result => {\n        txn.raiseOnCommittedEvent();\n        return result;\n      });\n  }\n\n  mutationQueuesContainKey(\n    transaction: PersistenceTransaction,\n    key: DocumentKey\n  ): PersistencePromise<boolean> {\n    return PersistencePromise.or(\n      Object.values(this.mutationQueues).map(queue => () =>\n        queue.containsKey(transaction, key)\n      )\n    );\n  }\n}\n\n/**\n * Memory persistence is not actually transactional, but future implementations\n * may have transaction-scoped state.\n */\nexport class MemoryTransaction extends PersistenceTransaction {\n  constructor(readonly currentSequenceNumber: ListenSequenceNumber) {\n    super();\n  }\n}\n\nexport interface MemoryReferenceDelegate extends ReferenceDelegate {\n  documentSize(doc: MaybeDocument): number;\n  onTransactionStarted(): void;\n  onTransactionCommitted(txn: PersistenceTransaction): PersistencePromise<void>;\n}\n\nexport class MemoryEagerDelegate implements MemoryReferenceDelegate {\n  /** Tracks all documents that are active in Query views. */\n  private localViewReferences: ReferenceSet = new ReferenceSet();\n  /** The list of documents that are potentially GCed after each transaction. */\n  private _orphanedDocuments: Set<DocumentKey> | null = null;\n\n  private constructor(private readonly persistence: MemoryPersistence) {}\n\n  static factory(persistence: MemoryPersistence): MemoryEagerDelegate {\n    return new MemoryEagerDelegate(persistence);\n  }\n\n  private get orphanedDocuments(): Set<DocumentKey> {\n    if (!this._orphanedDocuments) {\n      throw fail('orphanedDocuments is only valid during a transaction.');\n    } else {\n      return this._orphanedDocuments;\n    }\n  }\n\n  addReference(\n    txn: PersistenceTransaction,\n    targetId: TargetId,\n    key: DocumentKey\n  ): PersistencePromise<void> {\n    this.localViewReferences.addReference(key, targetId);\n    this.orphanedDocuments.delete(key);\n    return PersistencePromise.resolve();\n  }\n\n  removeReference(\n    txn: PersistenceTransaction,\n    targetId: TargetId,\n    key: DocumentKey\n  ): PersistencePromise<void> {\n    this.localViewReferences.removeReference(key, targetId);\n    this.orphanedDocuments.add(key);\n    return PersistencePromise.resolve();\n  }\n\n  markPotentiallyOrphaned(\n    txn: PersistenceTransaction,\n    key: DocumentKey\n  ): PersistencePromise<void> {\n    this.orphanedDocuments.add(key);\n    return PersistencePromise.resolve();\n  }\n\n  removeTarget(\n    txn: PersistenceTransaction,\n    targetData: TargetData\n  ): PersistencePromise<void> {\n    const orphaned = this.localViewReferences.removeReferencesForId(\n      targetData.targetId\n    );\n    orphaned.forEach(key => this.orphanedDocuments.add(key));\n    const cache = this.persistence.getTargetCache();\n    return cache\n      .getMatchingKeysForTargetId(txn, targetData.targetId)\n      .next(keys => {\n        keys.forEach(key => this.orphanedDocuments.add(key));\n      })\n      .next(() => cache.removeTargetData(txn, targetData));\n  }\n\n  onTransactionStarted(): void {\n    this._orphanedDocuments = new Set<DocumentKey>();\n  }\n\n  onTransactionCommitted(\n    txn: PersistenceTransaction\n  ): PersistencePromise<void> {\n    // Remove newly orphaned documents.\n    const cache = this.persistence.getRemoteDocumentCache();\n    const changeBuffer = cache.newChangeBuffer();\n    return PersistencePromise.forEach(\n      this.orphanedDocuments,\n      (key: DocumentKey) => {\n        return this.isReferenced(txn, key).next(isReferenced => {\n          if (!isReferenced) {\n            changeBuffer.removeEntry(key);\n          }\n        });\n      }\n    ).next(() => {\n      this._orphanedDocuments = null;\n      return changeBuffer.apply(txn);\n    });\n  }\n\n  updateLimboDocument(\n    txn: PersistenceTransaction,\n    key: DocumentKey\n  ): PersistencePromise<void> {\n    return this.isReferenced(txn, key).next(isReferenced => {\n      if (isReferenced) {\n        this.orphanedDocuments.delete(key);\n      } else {\n        this.orphanedDocuments.add(key);\n      }\n    });\n  }\n\n  documentSize(doc: MaybeDocument): number {\n    // For eager GC, we don't care about the document size, there are no size thresholds.\n    return 0;\n  }\n\n  private isReferenced(\n    txn: PersistenceTransaction,\n    key: DocumentKey\n  ): PersistencePromise<boolean> {\n    return PersistencePromise.or([\n      () =>\n        PersistencePromise.resolve(this.localViewReferences.containsKey(key)),\n      () => this.persistence.getTargetCache().containsKey(txn, key),\n      () => this.persistence.mutationQueuesContainKey(txn, key)\n    ]);\n  }\n}\n\nexport class MemoryLruDelegate implements ReferenceDelegate, LruDelegate {\n  private orphanedSequenceNumbers: ObjectMap<\n    DocumentKey,\n    ListenSequenceNumber\n  > = new ObjectMap(k => encodeResourcePath(k.path));\n\n  readonly garbageCollector: LruGarbageCollector;\n\n  constructor(\n    private readonly persistence: MemoryPersistence,\n    lruParams: LruParams\n  ) {\n    this.garbageCollector = new LruGarbageCollector(this, lruParams);\n  }\n\n  // No-ops, present so memory persistence doesn't have to care which delegate\n  // it has.\n  onTransactionStarted(): void {}\n\n  onTransactionCommitted(\n    txn: PersistenceTransaction\n  ): PersistencePromise<void> {\n    return PersistencePromise.resolve();\n  }\n\n  forEachTarget(\n    txn: PersistenceTransaction,\n    f: (q: TargetData) => void\n  ): PersistencePromise<void> {\n    return this.persistence.getTargetCache().forEachTarget(txn, f);\n  }\n\n  getSequenceNumberCount(\n    txn: PersistenceTransaction\n  ): PersistencePromise<number> {\n    const docCountPromise = this.orphanedDocumentCount(txn);\n    const targetCountPromise = this.persistence\n      .getTargetCache()\n      .getTargetCount(txn);\n    return targetCountPromise.next(targetCount =>\n      docCountPromise.next(docCount => targetCount + docCount)\n    );\n  }\n\n  private orphanedDocumentCount(\n    txn: PersistenceTransaction\n  ): PersistencePromise<number> {\n    let orphanedCount = 0;\n    return this.forEachOrphanedDocumentSequenceNumber(txn, _ => {\n      orphanedCount++;\n    }).next(() => orphanedCount);\n  }\n\n  forEachOrphanedDocumentSequenceNumber(\n    txn: PersistenceTransaction,\n    f: (sequenceNumber: ListenSequenceNumber) => void\n  ): PersistencePromise<void> {\n    return PersistencePromise.forEach(\n      this.orphanedSequenceNumbers,\n      (key, sequenceNumber) => {\n        // Pass in the exact sequence number as the upper bound so we know it won't be pinned by\n        // being too recent.\n        return this.isPinned(txn, key, sequenceNumber).next(isPinned => {\n          if (!isPinned) {\n            return f(sequenceNumber);\n          } else {\n            return PersistencePromise.resolve();\n          }\n        });\n      }\n    );\n  }\n\n  removeTargets(\n    txn: PersistenceTransaction,\n    upperBound: ListenSequenceNumber,\n    activeTargetIds: ActiveTargets\n  ): PersistencePromise<number> {\n    return this.persistence\n      .getTargetCache()\n      .removeTargets(txn, upperBound, activeTargetIds);\n  }\n\n  removeOrphanedDocuments(\n    txn: PersistenceTransaction,\n    upperBound: ListenSequenceNumber\n  ): PersistencePromise<number> {\n    let count = 0;\n    const cache = this.persistence.getRemoteDocumentCache();\n    const changeBuffer = cache.newChangeBuffer();\n    const p = cache.forEachDocumentKey(txn, key => {\n      return this.isPinned(txn, key, upperBound).next(isPinned => {\n        if (!isPinned) {\n          count++;\n          changeBuffer.removeEntry(key);\n        }\n      });\n    });\n    return p.next(() => changeBuffer.apply(txn)).next(() => count);\n  }\n\n  markPotentiallyOrphaned(\n    txn: PersistenceTransaction,\n    key: DocumentKey\n  ): PersistencePromise<void> {\n    this.orphanedSequenceNumbers.set(key, txn.currentSequenceNumber);\n    return PersistencePromise.resolve();\n  }\n\n  removeTarget(\n    txn: PersistenceTransaction,\n    targetData: TargetData\n  ): PersistencePromise<void> {\n    const updated = targetData.withSequenceNumber(txn.currentSequenceNumber);\n    return this.persistence.getTargetCache().updateTargetData(txn, updated);\n  }\n\n  addReference(\n    txn: PersistenceTransaction,\n    targetId: TargetId,\n    key: DocumentKey\n  ): PersistencePromise<void> {\n    this.orphanedSequenceNumbers.set(key, txn.currentSequenceNumber);\n    return PersistencePromise.resolve();\n  }\n\n  removeReference(\n    txn: PersistenceTransaction,\n    targetId: TargetId,\n    key: DocumentKey\n  ): PersistencePromise<void> {\n    this.orphanedSequenceNumbers.set(key, txn.currentSequenceNumber);\n    return PersistencePromise.resolve();\n  }\n\n  updateLimboDocument(\n    txn: PersistenceTransaction,\n    key: DocumentKey\n  ): PersistencePromise<void> {\n    this.orphanedSequenceNumbers.set(key, txn.currentSequenceNumber);\n    return PersistencePromise.resolve();\n  }\n\n  documentSize(maybeDoc: MaybeDocument): number {\n    let documentSize = maybeDoc.key.toString().length;\n    if (maybeDoc instanceof Document) {\n      documentSize += estimateByteSize(maybeDoc.toProto());\n    }\n    return documentSize;\n  }\n\n  private isPinned(\n    txn: PersistenceTransaction,\n    key: DocumentKey,\n    upperBound: ListenSequenceNumber\n  ): PersistencePromise<boolean> {\n    return PersistencePromise.or([\n      () => this.persistence.mutationQueuesContainKey(txn, key),\n      () => this.persistence.getTargetCache().containsKey(txn, key),\n      () => {\n        const orphanedAt = this.orphanedSequenceNumbers.get(key);\n        return PersistencePromise.resolve(\n          orphanedAt !== undefined && orphanedAt > upperBound\n        );\n      }\n    ]);\n  }\n\n  getCacheSize(txn: PersistenceTransaction): PersistencePromise<number> {\n    return this.persistence.getRemoteDocumentCache().getSize(txn);\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  ClientId,\n  MemorySharedClientState,\n  SharedClientState,\n  WebStorageSharedClientState\n} from '../local/shared_client_state';\nimport { LocalStore, MultiTabLocalStore } from '../local/local_store';\nimport { MultiTabSyncEngine, SyncEngine } from './sync_engine';\nimport { RemoteStore } from '../remote/remote_store';\nimport { EventManager } from './event_manager';\nimport { AsyncQueue } from '../util/async_queue';\nimport { DatabaseInfo } from './database_info';\nimport { Platform } from '../platform/platform';\nimport { Datastore } from '../remote/datastore';\nimport { User } from '../auth/user';\nimport { PersistenceSettings } from './firestore_client';\nimport { debugAssert } from '../util/assert';\nimport { GarbageCollectionScheduler, Persistence } from '../local/persistence';\nimport { Code, FirestoreError } from '../util/error';\nimport { OnlineStateSource } from './types';\nimport { LruParams, LruScheduler } from '../local/lru_garbage_collector';\nimport { IndexFreeQueryEngine } from '../local/index_free_query_engine';\nimport { IndexedDbPersistence } from '../local/indexeddb_persistence';\nimport {\n  MemoryEagerDelegate,\n  MemoryPersistence\n} from '../local/memory_persistence';\n\nconst MEMORY_ONLY_PERSISTENCE_ERROR_MESSAGE =\n  'You are using the memory-only build of Firestore. Persistence support is ' +\n  'only available via the @firebase/firestore bundle or the ' +\n  'firebase-firestore.js build.';\n\nexport interface ComponentConfiguration {\n  asyncQueue: AsyncQueue;\n  databaseInfo: DatabaseInfo;\n  platform: Platform;\n  datastore: Datastore;\n  clientId: ClientId;\n  initialUser: User;\n  maxConcurrentLimboResolutions: number;\n  persistenceSettings: PersistenceSettings;\n}\n\n/**\n * Initializes and wires up all core components for Firestore. Implementations\n * override `initialize()` to provide all components.\n */\nexport interface ComponentProvider {\n  persistence: Persistence;\n  sharedClientState: SharedClientState;\n  localStore: LocalStore;\n  syncEngine: SyncEngine;\n  gcScheduler: GarbageCollectionScheduler | null;\n  remoteStore: RemoteStore;\n  eventManager: EventManager;\n\n  initialize(cfg: ComponentConfiguration): Promise<void>;\n\n  clearPersistence(databaseId: DatabaseInfo): Promise<void>;\n}\n\n/**\n * Provides all components needed for Firestore with in-memory persistence.\n * Uses EagerGC garbage collection.\n */\nexport class MemoryComponentProvider implements ComponentProvider {\n  persistence!: Persistence;\n  sharedClientState!: SharedClientState;\n  localStore!: LocalStore;\n  syncEngine!: SyncEngine;\n  gcScheduler!: GarbageCollectionScheduler | null;\n  remoteStore!: RemoteStore;\n  eventManager!: EventManager;\n\n  async initialize(cfg: ComponentConfiguration): Promise<void> {\n    this.sharedClientState = this.createSharedClientState(cfg);\n    this.persistence = this.createPersistence(cfg);\n    await this.persistence.start();\n    this.gcScheduler = this.createGarbageCollectionScheduler(cfg);\n    this.localStore = this.createLocalStore(cfg);\n    this.remoteStore = this.createRemoteStore(cfg);\n    this.syncEngine = this.createSyncEngine(cfg);\n    this.eventManager = this.createEventManager(cfg);\n\n    this.sharedClientState.onlineStateHandler = onlineState =>\n      this.syncEngine.applyOnlineStateChange(\n        onlineState,\n        OnlineStateSource.SharedClientState\n      );\n    this.remoteStore.syncEngine = this.syncEngine;\n\n    await this.localStore.start();\n    await this.sharedClientState.start();\n    await this.remoteStore.start();\n\n    await this.remoteStore.applyPrimaryState(this.syncEngine.isPrimaryClient);\n  }\n\n  createEventManager(cfg: ComponentConfiguration): EventManager {\n    return new EventManager(this.syncEngine);\n  }\n\n  createGarbageCollectionScheduler(\n    cfg: ComponentConfiguration\n  ): GarbageCollectionScheduler | null {\n    return null;\n  }\n\n  createLocalStore(cfg: ComponentConfiguration): LocalStore {\n    return new LocalStore(\n      this.persistence,\n      new IndexFreeQueryEngine(),\n      cfg.initialUser\n    );\n  }\n\n  createPersistence(cfg: ComponentConfiguration): Persistence {\n    debugAssert(\n      !cfg.persistenceSettings.durable,\n      'Can only start memory persistence'\n    );\n    return new MemoryPersistence(MemoryEagerDelegate.factory);\n  }\n\n  createRemoteStore(cfg: ComponentConfiguration): RemoteStore {\n    return new RemoteStore(\n      this.localStore,\n      cfg.datastore,\n      cfg.asyncQueue,\n      onlineState =>\n        this.syncEngine.applyOnlineStateChange(\n          onlineState,\n          OnlineStateSource.RemoteStore\n        ),\n      cfg.platform.newConnectivityMonitor()\n    );\n  }\n\n  createSharedClientState(cfg: ComponentConfiguration): SharedClientState {\n    return new MemorySharedClientState();\n  }\n\n  createSyncEngine(cfg: ComponentConfiguration): SyncEngine {\n    return new SyncEngine(\n      this.localStore,\n      this.remoteStore,\n      this.sharedClientState,\n      cfg.initialUser,\n      cfg.maxConcurrentLimboResolutions\n    );\n  }\n\n  clearPersistence(databaseInfo: DatabaseInfo): Promise<void> {\n    throw new FirestoreError(\n      Code.FAILED_PRECONDITION,\n      MEMORY_ONLY_PERSISTENCE_ERROR_MESSAGE\n    );\n  }\n}\n\n/**\n * Provides all components needed for Firestore with IndexedDB persistence.\n */\nexport class IndexedDbComponentProvider extends MemoryComponentProvider {\n  persistence!: IndexedDbPersistence;\n\n  // TODO(tree-shaking): Create an IndexedDbComponentProvider and a\n  // MultiTabComponentProvider. The IndexedDbComponentProvider should depend\n  // on LocalStore and SyncEngine.\n  localStore!: MultiTabLocalStore;\n  syncEngine!: MultiTabSyncEngine;\n\n  async initialize(cfg: ComponentConfiguration): Promise<void> {\n    await super.initialize(cfg);\n\n    // NOTE: This will immediately call the listener, so we make sure to\n    // set it after localStore / remoteStore are started.\n    await this.persistence.setPrimaryStateListener(async isPrimary => {\n      await (this.syncEngine as MultiTabSyncEngine).applyPrimaryState(\n        isPrimary\n      );\n      if (this.gcScheduler) {\n        if (isPrimary && !this.gcScheduler.started) {\n          this.gcScheduler.start(this.localStore);\n        } else if (!isPrimary) {\n          this.gcScheduler.stop();\n        }\n      }\n    });\n  }\n\n  createLocalStore(cfg: ComponentConfiguration): LocalStore {\n    return new MultiTabLocalStore(\n      this.persistence,\n      new IndexFreeQueryEngine(),\n      cfg.initialUser\n    );\n  }\n\n  createSyncEngine(cfg: ComponentConfiguration): SyncEngine {\n    const syncEngine = new MultiTabSyncEngine(\n      this.localStore,\n      this.remoteStore,\n      this.sharedClientState,\n      cfg.initialUser,\n      cfg.maxConcurrentLimboResolutions\n    );\n    if (this.sharedClientState instanceof WebStorageSharedClientState) {\n      this.sharedClientState.syncEngine = syncEngine;\n    }\n    return syncEngine;\n  }\n\n  createGarbageCollectionScheduler(\n    cfg: ComponentConfiguration\n  ): GarbageCollectionScheduler | null {\n    const garbageCollector = this.persistence.referenceDelegate\n      .garbageCollector;\n    return new LruScheduler(garbageCollector, cfg.asyncQueue);\n  }\n\n  createPersistence(cfg: ComponentConfiguration): Persistence {\n    debugAssert(\n      cfg.persistenceSettings.durable,\n      'Can only start durable persistence'\n    );\n\n    const persistenceKey = IndexedDbPersistence.buildStoragePrefix(\n      cfg.databaseInfo\n    );\n    const serializer = cfg.platform.newSerializer(cfg.databaseInfo.databaseId);\n    return new IndexedDbPersistence(\n      cfg.persistenceSettings.synchronizeTabs,\n      persistenceKey,\n      cfg.clientId,\n      cfg.platform,\n      LruParams.withCacheSize(cfg.persistenceSettings.cacheSizeBytes),\n      cfg.asyncQueue,\n      serializer,\n      this.sharedClientState\n    );\n  }\n\n  createSharedClientState(cfg: ComponentConfiguration): SharedClientState {\n    if (\n      cfg.persistenceSettings.durable &&\n      cfg.persistenceSettings.synchronizeTabs\n    ) {\n      if (!WebStorageSharedClientState.isAvailable(cfg.platform)) {\n        throw new FirestoreError(\n          Code.UNIMPLEMENTED,\n          'IndexedDB persistence is only available on platforms that support LocalStorage.'\n        );\n      }\n      const persistenceKey = IndexedDbPersistence.buildStoragePrefix(\n        cfg.databaseInfo\n      );\n      return new WebStorageSharedClientState(\n        cfg.asyncQueue,\n        cfg.platform,\n        persistenceKey,\n        cfg.clientId,\n        cfg.initialUser\n      );\n    }\n    return new MemorySharedClientState();\n  }\n\n  clearPersistence(databaseInfo: DatabaseInfo): Promise<void> {\n    const persistenceKey = IndexedDbPersistence.buildStoragePrefix(\n      databaseInfo\n    );\n    return IndexedDbPersistence.clearPersistence(persistenceKey);\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 { LocalStore } from '../local/local_store';\nimport { GarbageCollectionScheduler, Persistence } from '../local/persistence';\nimport { Document, NoDocument } from '../model/document';\nimport { DocumentKey } from '../model/document_key';\nimport { Mutation } from '../model/mutation';\nimport { Platform } from '../platform/platform';\nimport { newDatastore } from '../remote/datastore';\nimport { RemoteStore } from '../remote/remote_store';\nimport { AsyncQueue, wrapInUserErrorIfRecoverable } from '../util/async_queue';\nimport { Code, FirestoreError } from '../util/error';\nimport { logDebug } from '../util/log';\nimport { Deferred } from '../util/promise';\nimport {\n  EventManager,\n  ListenOptions,\n  Observer,\n  QueryListener\n} from './event_manager';\nimport { SyncEngine } from './sync_engine';\nimport { View } from './view';\n\nimport { SharedClientState } from '../local/shared_client_state';\nimport { AutoId } from '../util/misc';\nimport { DatabaseId, DatabaseInfo } from './database_info';\nimport { Query } from './query';\nimport { Transaction } from './transaction';\nimport { ViewSnapshot } from './view_snapshot';\nimport {\n  ComponentProvider,\n  MemoryComponentProvider\n} from './component_provider';\n\nconst LOG_TAG = 'FirestoreClient';\nconst MAX_CONCURRENT_LIMBO_RESOLUTIONS = 100;\n\n/** DOMException error code constants. */\nconst DOM_EXCEPTION_INVALID_STATE = 11;\nconst DOM_EXCEPTION_ABORTED = 20;\nconst DOM_EXCEPTION_QUOTA_EXCEEDED = 22;\n\nexport type PersistenceSettings =\n  | {\n      readonly durable: false;\n    }\n  | {\n      readonly durable: true;\n      readonly cacheSizeBytes: number;\n      readonly synchronizeTabs: boolean;\n    };\n\n/**\n * FirestoreClient is a top-level class that constructs and owns all of the\n * pieces of the client SDK architecture. It is responsible for creating the\n * async queue that is shared by all of the other components in the system.\n */\nexport class FirestoreClient {\n  // NOTE: These should technically have '|undefined' in the types, since\n  // they're initialized asynchronously rather than in the constructor, but\n  // given that all work is done on the async queue and we assert that\n  // initialization completes before any other work is queued, we're cheating\n  // with the types rather than littering the code with '!' or unnecessary\n  // undefined checks.\n  private eventMgr!: EventManager;\n  private persistence!: Persistence;\n  private localStore!: LocalStore;\n  private remoteStore!: RemoteStore;\n  private syncEngine!: SyncEngine;\n  private gcScheduler!: GarbageCollectionScheduler | null;\n\n  // PORTING NOTE: SharedClientState is only used for multi-tab web.\n  private sharedClientState!: SharedClientState;\n\n  private readonly clientId = AutoId.newId();\n\n  constructor(\n    private platform: Platform,\n    private databaseInfo: DatabaseInfo,\n    private credentials: CredentialsProvider,\n    /**\n     * Asynchronous queue responsible for all of our internal processing. When\n     * we get incoming work from the user (via public API) or the network\n     * (incoming GRPC messages), we should always schedule onto this queue.\n     * This ensures all of our work is properly serialized (e.g. we don't\n     * start processing a new operation while the previous one is waiting for\n     * an async I/O to complete).\n     */\n    private asyncQueue: AsyncQueue\n  ) {}\n\n  /**\n   * Starts up the FirestoreClient, returning only whether or not enabling\n   * persistence succeeded.\n   *\n   * The intent here is to \"do the right thing\" as far as users are concerned.\n   * Namely, in cases where offline persistence is requested and possible,\n   * enable it, but otherwise fall back to persistence disabled. For the most\n   * part we expect this to succeed one way or the other so we don't expect our\n   * users to actually wait on the firestore.enablePersistence Promise since\n   * they generally won't care.\n   *\n   * Of course some users actually do care about whether or not persistence\n   * was successfully enabled, so the Promise returned from this method\n   * indicates this outcome.\n   *\n   * This presents a problem though: even before enablePersistence resolves or\n   * rejects, users may have made calls to e.g. firestore.collection() which\n   * means that the FirestoreClient in there will be available and will be\n   * enqueuing actions on the async queue.\n   *\n   * Meanwhile any failure of an operation on the async queue causes it to\n   * panic and reject any further work, on the premise that unhandled errors\n   * are fatal.\n   *\n   * Consequently the fallback is handled internally here in start, and if the\n   * fallback succeeds we signal success to the async queue even though the\n   * start() itself signals failure.\n   *\n   * @param componentProvider Provider that returns all core components.\n   * @param persistenceSettings Settings object to configure offline\n   *     persistence.\n   * @returns A deferred result indicating the user-visible result of enabling\n   *     offline persistence. This method will reject this if IndexedDB fails to\n   *     start for any reason. If usePersistence is false this is\n   *     unconditionally resolved.\n   */\n  start(\n    componentProvider: ComponentProvider,\n    persistenceSettings: PersistenceSettings\n  ): Promise<void> {\n    this.verifyNotTerminated();\n    // We defer our initialization until we get the current user from\n    // setChangeListener(). We block the async queue until we got the initial\n    // user and the initialization is completed. This will prevent any scheduled\n    // work from happening before initialization is completed.\n    //\n    // If initializationDone resolved then the FirestoreClient is in a usable\n    // state.\n    const initializationDone = new Deferred<void>();\n\n    // If usePersistence is true, certain classes of errors while starting are\n    // recoverable but only by falling back to persistence disabled.\n    //\n    // If there's an error in the first case but not in recovery we cannot\n    // reject the promise blocking the async queue because this will cause the\n    // async queue to panic.\n    const persistenceResult = new Deferred<void>();\n\n    let initialized = false;\n    this.credentials.setChangeListener(user => {\n      if (!initialized) {\n        initialized = true;\n\n        logDebug(LOG_TAG, 'Initializing. user=', user.uid);\n\n        return this.initializeComponents(\n          componentProvider,\n          persistenceSettings,\n          user,\n          persistenceResult\n        ).then(initializationDone.resolve, initializationDone.reject);\n      } else {\n        this.asyncQueue.enqueueRetryable(() => {\n          return this.handleCredentialChange(user);\n        });\n      }\n    });\n\n    // Block the async queue until initialization is done\n    this.asyncQueue.enqueueAndForget(() => {\n      return initializationDone.promise;\n    });\n\n    // Return only the result of enabling persistence. Note that this does not\n    // need to await the completion of initializationDone because the result of\n    // this method should not reflect any other kind of failure to start.\n    return persistenceResult.promise;\n  }\n\n  /** Enables the network connection and requeues all pending operations. */\n  enableNetwork(): Promise<void> {\n    this.verifyNotTerminated();\n    return this.asyncQueue.enqueue(() => {\n      return this.syncEngine.enableNetwork();\n    });\n  }\n\n  /**\n   * Initializes persistent storage, attempting to use IndexedDB if\n   * usePersistence is true or memory-only if false.\n   *\n   * If IndexedDB fails because it's already open in another tab or because the\n   * platform can't possibly support our implementation then this method rejects\n   * the persistenceResult and falls back on memory-only persistence.\n   *\n   * @param componentProvider The provider that provides all core componennts\n   *     for IndexedDB or memory-backed persistence\n   * @param persistenceSettings Settings object to configure offline persistence\n   * @param user The initial user\n   * @param persistenceResult A deferred result indicating the user-visible\n   *     result of enabling offline persistence. This method will reject this if\n   *     IndexedDB fails to start for any reason. If usePersistence is false\n   *     this is unconditionally resolved.\n   * @returns a Promise indicating whether or not initialization should\n   *     continue, i.e. that one of the persistence implementations actually\n   *     succeeded.\n   */\n  private async initializeComponents(\n    componentProvider: ComponentProvider,\n    persistenceSettings: PersistenceSettings,\n    user: User,\n    persistenceResult: Deferred<void>\n  ): Promise<void> {\n    try {\n      // TODO(mrschmidt): Ideally, ComponentProvider would also initialize\n      // Datastore (without duplicating the initializing logic once per\n      // provider).\n\n      const connection = await this.platform.loadConnection(this.databaseInfo);\n      const serializer = this.platform.newSerializer(\n        this.databaseInfo.databaseId\n      );\n      const datastore = newDatastore(connection, this.credentials, serializer);\n\n      await componentProvider.initialize({\n        asyncQueue: this.asyncQueue,\n        databaseInfo: this.databaseInfo,\n        platform: this.platform,\n        datastore,\n        clientId: this.clientId,\n        initialUser: user,\n        maxConcurrentLimboResolutions: MAX_CONCURRENT_LIMBO_RESOLUTIONS,\n        persistenceSettings\n      });\n\n      this.persistence = componentProvider.persistence;\n      this.sharedClientState = componentProvider.sharedClientState;\n      this.localStore = componentProvider.localStore;\n      this.remoteStore = componentProvider.remoteStore;\n      this.syncEngine = componentProvider.syncEngine;\n      this.gcScheduler = componentProvider.gcScheduler;\n      this.eventMgr = componentProvider.eventManager;\n\n      // When a user calls clearPersistence() in one client, all other clients\n      // need to be terminated to allow the delete to succeed.\n      this.persistence.setDatabaseDeletedListener(async () => {\n        await this.terminate();\n      });\n\n      persistenceResult.resolve();\n    } catch (error) {\n      // Regardless of whether or not the retry succeeds, from an user\n      // perspective, offline persistence has failed.\n      persistenceResult.reject(error);\n\n      // An unknown failure on the first stage shuts everything down.\n      if (!this.canFallback(error)) {\n        throw error;\n      }\n      console.warn(\n        'Error enabling offline persistence. Falling back to' +\n          ' persistence disabled: ' +\n          error\n      );\n      return this.initializeComponents(\n        new MemoryComponentProvider(),\n        { durable: false },\n        user,\n        persistenceResult\n      );\n    }\n  }\n\n  /**\n   * Decides whether the provided error allows us to gracefully disable\n   * persistence (as opposed to crashing the client).\n   */\n  private canFallback(error: FirestoreError | DOMException): boolean {\n    if (error.name === 'FirebaseError') {\n      return (\n        error.code === Code.FAILED_PRECONDITION ||\n        error.code === Code.UNIMPLEMENTED\n      );\n    } else if (\n      typeof DOMException !== 'undefined' &&\n      error instanceof DOMException\n    ) {\n      // There are a few known circumstances where we can open IndexedDb but\n      // trying to read/write will fail (e.g. quota exceeded). For\n      // well-understood cases, we attempt to detect these and then gracefully\n      // fall back to memory persistence.\n      // NOTE: Rather than continue to add to this list, we could decide to\n      // always fall back, with the risk that we might accidentally hide errors\n      // representing actual SDK bugs.\n      return (\n        // When the browser is out of quota we could get either quota exceeded\n        // or an aborted error depending on whether the error happened during\n        // schema migration.\n        error.code === DOM_EXCEPTION_QUOTA_EXCEEDED ||\n        error.code === DOM_EXCEPTION_ABORTED ||\n        // Firefox Private Browsing mode disables IndexedDb and returns\n        // INVALID_STATE for any usage.\n        error.code === DOM_EXCEPTION_INVALID_STATE\n      );\n    }\n\n    return true;\n  }\n\n  /**\n   * Checks that the client has not been terminated. Ensures that other methods on\n   * this class cannot be called after the client is terminated.\n   */\n  private verifyNotTerminated(): void {\n    if (this.asyncQueue.isShuttingDown) {\n      throw new FirestoreError(\n        Code.FAILED_PRECONDITION,\n        'The client has already been terminated.'\n      );\n    }\n  }\n\n  private handleCredentialChange(user: User): Promise<void> {\n    this.asyncQueue.verifyOperationInProgress();\n\n    logDebug(LOG_TAG, 'Credential Changed. Current user: ' + user.uid);\n    return this.syncEngine.handleCredentialChange(user);\n  }\n\n  /** Disables the network connection. Pending operations will not complete. */\n  disableNetwork(): Promise<void> {\n    this.verifyNotTerminated();\n    return this.asyncQueue.enqueue(() => {\n      return this.syncEngine.disableNetwork();\n    });\n  }\n\n  terminate(): Promise<void> {\n    return this.asyncQueue.enqueueAndInitiateShutdown(async () => {\n      // PORTING NOTE: LocalStore does not need an explicit shutdown on web.\n      if (this.gcScheduler) {\n        this.gcScheduler.stop();\n      }\n\n      await this.remoteStore.shutdown();\n      await this.sharedClientState.shutdown();\n      await this.persistence.shutdown();\n\n      // `removeChangeListener` must be called after shutting down the\n      // RemoteStore as it will prevent the RemoteStore from retrieving\n      // auth tokens.\n      this.credentials.removeChangeListener();\n    });\n  }\n\n  /**\n   * Returns a Promise that resolves when all writes that were pending at the time this\n   * method was called received server acknowledgement. An acknowledgement can be either acceptance\n   * or rejection.\n   */\n  waitForPendingWrites(): Promise<void> {\n    this.verifyNotTerminated();\n\n    const deferred = new Deferred<void>();\n    this.asyncQueue.enqueueAndForget(() => {\n      return this.syncEngine.registerPendingWritesCallback(deferred);\n    });\n    return deferred.promise;\n  }\n\n  listen(\n    query: Query,\n    observer: Observer<ViewSnapshot>,\n    options: ListenOptions\n  ): QueryListener {\n    this.verifyNotTerminated();\n    const listener = new QueryListener(query, observer, options);\n    this.asyncQueue.enqueueAndForget(() => this.eventMgr.listen(listener));\n    return listener;\n  }\n\n  unlisten(listener: QueryListener): void {\n    // Checks for termination but does not raise error, allowing unlisten after\n    // termination to be a no-op.\n    if (this.clientTerminated) {\n      return;\n    }\n    this.asyncQueue.enqueueAndForget(() => {\n      return this.eventMgr.unlisten(listener);\n    });\n  }\n\n  async getDocumentFromLocalCache(\n    docKey: DocumentKey\n  ): Promise<Document | null> {\n    this.verifyNotTerminated();\n    const deferred = new Deferred<Document | null>();\n    await this.asyncQueue.enqueue(async () => {\n      try {\n        const maybeDoc = await this.localStore.readDocument(docKey);\n        if (maybeDoc instanceof Document) {\n          deferred.resolve(maybeDoc);\n        } else if (maybeDoc instanceof NoDocument) {\n          deferred.resolve(null);\n        } else {\n          deferred.reject(\n            new FirestoreError(\n              Code.UNAVAILABLE,\n              'Failed to get document from cache. (However, this document may ' +\n                \"exist on the server. Run again without setting 'source' in \" +\n                'the GetOptions to attempt to retrieve the document from the ' +\n                'server.)'\n            )\n          );\n        }\n      } catch (e) {\n        const firestoreError = wrapInUserErrorIfRecoverable(\n          e,\n          `Failed to get document '${docKey} from cache`\n        );\n        deferred.reject(firestoreError);\n      }\n    });\n\n    return deferred.promise;\n  }\n\n  async getDocumentsFromLocalCache(query: Query): Promise<ViewSnapshot> {\n    this.verifyNotTerminated();\n    const deferred = new Deferred<ViewSnapshot>();\n    await this.asyncQueue.enqueue(async () => {\n      try {\n        const queryResult = await this.localStore.executeQuery(\n          query,\n          /* usePreviousResults= */ true\n        );\n        const view = new View(query, queryResult.remoteKeys);\n        const viewDocChanges = view.computeDocChanges(queryResult.documents);\n        const viewChange = view.applyChanges(\n          viewDocChanges,\n          /* updateLimboDocuments= */ false\n        );\n        deferred.resolve(viewChange.snapshot!);\n      } catch (e) {\n        const firestoreError = wrapInUserErrorIfRecoverable(\n          e,\n          `Failed to execute query '${query} against cache`\n        );\n        deferred.reject(firestoreError);\n      }\n    });\n    return deferred.promise;\n  }\n\n  write(mutations: Mutation[]): Promise<void> {\n    this.verifyNotTerminated();\n    const deferred = new Deferred<void>();\n    this.asyncQueue.enqueueAndForget(() =>\n      this.syncEngine.write(mutations, deferred)\n    );\n    return deferred.promise;\n  }\n\n  databaseId(): DatabaseId {\n    return this.databaseInfo.databaseId;\n  }\n\n  addSnapshotsInSyncListener(observer: Observer<void>): void {\n    this.verifyNotTerminated();\n    this.asyncQueue.enqueueAndForget(() => {\n      this.eventMgr.addSnapshotsInSyncListener(observer);\n      return Promise.resolve();\n    });\n  }\n\n  removeSnapshotsInSyncListener(observer: Observer<void>): void {\n    // Checks for shutdown but does not raise error, allowing remove after\n    // shutdown to be a no-op.\n    if (this.clientTerminated) {\n      return;\n    }\n    this.asyncQueue.enqueueAndForget(() => {\n      this.eventMgr.removeSnapshotsInSyncListener(observer);\n      return Promise.resolve();\n    });\n  }\n\n  get clientTerminated(): boolean {\n    // Technically, the asyncQueue is still running, but only accepting operations\n    // related to termination or supposed to be run after termination. It is effectively\n    // terminated to the eyes of users.\n    return this.asyncQueue.isShuttingDown;\n  }\n\n  transaction<T>(\n    updateFunction: (transaction: Transaction) => Promise<T>\n  ): Promise<T> {\n    this.verifyNotTerminated();\n    const deferred = new Deferred<T>();\n    this.asyncQueue.enqueueAndForget(() => {\n      this.syncEngine.runTransaction(this.asyncQueue, updateFunction, deferred);\n      return Promise.resolve();\n    });\n    return deferred.promise;\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 { Observer } from '../core/event_manager';\nimport { EventHandler } from './misc';\n\n/*\n * A wrapper implementation of Observer<T> that will dispatch events\n * asynchronously. To allow immediate silencing, a mute call is added which\n * causes events scheduled to no longer be raised.\n */\nexport class AsyncObserver<T> implements Observer<T> {\n  /**\n   * When set to true, will not raise future events. Necessary to deal with\n   * async detachment of listener.\n   */\n  private muted = false;\n\n  constructor(private observer: Observer<T>) {}\n\n  next(value: T): void {\n    this.scheduleEvent(this.observer.next, value);\n  }\n\n  error(error: Error): void {\n    this.scheduleEvent(this.observer.error, error);\n  }\n\n  mute(): void {\n    this.muted = true;\n  }\n\n  private scheduleEvent<E>(eventHandler: EventHandler<E>, event: E): void {\n    if (!this.muted) {\n      setTimeout(() => {\n        if (!this.muted) {\n          eventHandler(event);\n        }\n      }, 0);\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 { JsonObject } from '../model/object_value';\n\n/**\n * Observer/Subscribe interfaces.\n */\nexport type NextFn<T> = (value: T) => void;\nexport type ErrorFn = (error: Error) => void;\nexport type CompleteFn = () => void;\n\n// Allow for any of the Observer methods to be undefined.\nexport interface PartialObserver<T> {\n  next?: NextFn<T>;\n  error?: ErrorFn;\n  complete?: CompleteFn;\n}\n\nexport interface Unsubscribe {\n  (): void;\n}\n\nexport function isPartialObserver(obj: unknown): boolean {\n  return implementsAnyMethods(obj, ['next', 'error', 'complete']);\n}\n\n/**\n * Returns true if obj is an object and contains at least one of the specified\n * methods.\n */\nfunction implementsAnyMethods(obj: unknown, methods: string[]): boolean {\n  if (typeof obj !== 'object' || obj === null) {\n    return false;\n  }\n\n  const object = obj as JsonObject<unknown>;\n  for (const method of methods) {\n    if (method in object && typeof object[method] === 'function') {\n      return true;\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 * as firestore from '@firebase/firestore-types';\n\nimport * as api from '../protos/firestore_proto_api';\n\nimport { DocumentReference, Firestore } from './database';\nimport { Blob } from './blob';\nimport { GeoPoint } from './geo_point';\nimport { Timestamp } from './timestamp';\nimport { DatabaseId } from '../core/database_info';\nimport { DocumentKey } from '../model/document_key';\nimport {\n  normalizeByteString,\n  normalizeNumber,\n  normalizeTimestamp,\n  typeOrder\n} from '../model/values';\nimport {\n  getLocalWriteTime,\n  getPreviousValue\n} from '../model/server_timestamps';\nimport { fail, hardAssert } from '../util/assert';\nimport { forEach } from '../util/obj';\nimport { TypeOrder } from '../model/object_value';\nimport { ResourcePath } from '../model/path';\nimport { isValidResourceName } from '../remote/serializer';\nimport { logError } from '../util/log';\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 */\nexport class UserDataWriter<T = firestore.DocumentData> {\n  constructor(\n    private readonly firestore: Firestore,\n    private readonly timestampsInSnapshots: boolean,\n    private readonly serverTimestampBehavior?: ServerTimestampBehavior,\n    private readonly converter?: firestore.FirestoreDataConverter<T>\n  ) {}\n\n  convertValue(value: api.Value): 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);\n      case TypeOrder.StringValue:\n        return value.stringValue!;\n      case TypeOrder.BlobValue:\n        return new Blob(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!);\n      case TypeOrder.ObjectValue:\n        return this.convertObject(value.mapValue!);\n      default:\n        throw fail('Invalid value type: ' + JSON.stringify(value));\n    }\n  }\n\n  private convertObject(mapValue: api.MapValue): firestore.DocumentData {\n    const result: firestore.DocumentData = {};\n    forEach(mapValue.fields || {}, (key, value) => {\n      result[key] = this.convertValue(value);\n    });\n    return result;\n  }\n\n  private convertGeoPoint(value: api.LatLng): GeoPoint {\n    return new GeoPoint(\n      normalizeNumber(value.latitude),\n      normalizeNumber(value.longitude)\n    );\n  }\n\n  private convertArray(arrayValue: api.ArrayValue): unknown[] {\n    return (arrayValue.values || []).map(value => this.convertValue(value));\n  }\n\n  private convertServerTimestamp(value: api.Value): unknown {\n    switch (this.serverTimestampBehavior) {\n      case 'previous':\n        const previousValue = getPreviousValue(value);\n        if (previousValue == null) {\n          return null;\n        }\n        return this.convertValue(previousValue);\n      case 'estimate':\n        return this.convertTimestamp(getLocalWriteTime(value));\n      default:\n        return null;\n    }\n  }\n\n  private convertTimestamp(value: api.Timestamp): Timestamp | Date {\n    const normalizedValue = normalizeTimestamp(value);\n    const timestamp = new Timestamp(\n      normalizedValue.seconds,\n      normalizedValue.nanos\n    );\n    if (this.timestampsInSnapshots) {\n      return timestamp;\n    } else {\n      return timestamp.toDate();\n    }\n  }\n\n  private convertReference(name: string): DocumentReference<T> {\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(this.firestore._databaseId)) {\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 (${this.firestore._databaseId.projectId}/${this.firestore._databaseId.database}) ` +\n          `instead.`\n      );\n    }\n\n    return new DocumentReference(key, this.firestore, this.converter);\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 * as firestore from '@firebase/firestore-types';\n\nimport * as api from '../protos/firestore_proto_api';\n\nimport { FirebaseApp } from '@firebase/app-types';\nimport { _FirebaseApp, FirebaseService } from '@firebase/app-types/private';\nimport { DatabaseId, DatabaseInfo } from '../core/database_info';\nimport { ListenOptions } from '../core/event_manager';\nimport {\n  ComponentProvider,\n  MemoryComponentProvider\n} from '../core/component_provider';\nimport { FirestoreClient, PersistenceSettings } from '../core/firestore_client';\nimport {\n  Bound,\n  Direction,\n  FieldFilter,\n  Filter,\n  Operator,\n  OrderBy,\n  Query as InternalQuery\n} from '../core/query';\nimport { Transaction as InternalTransaction } from '../core/transaction';\nimport { ChangeType, ViewSnapshot } from '../core/view_snapshot';\nimport { LruParams } from '../local/lru_garbage_collector';\nimport { Document, MaybeDocument, NoDocument } from '../model/document';\nimport { DocumentKey } from '../model/document_key';\nimport { DeleteMutation, Mutation, Precondition } from '../model/mutation';\nimport { FieldPath, ResourcePath } from '../model/path';\nimport { isServerTimestamp } from '../model/server_timestamps';\nimport { refValue } from '../model/values';\nimport { PlatformSupport } from '../platform/platform';\nimport { debugAssert, fail } from '../util/assert';\nimport { AsyncObserver } from '../util/async_observer';\nimport { AsyncQueue } from '../util/async_queue';\nimport { Code, FirestoreError } from '../util/error';\nimport {\n  invalidClassError,\n  validateArgType,\n  validateAtLeastNumberOfArgs,\n  validateBetweenNumberOfArgs,\n  validateDefined,\n  validateExactNumberOfArgs,\n  validateNamedOptionalPropertyEquals,\n  validateNamedOptionalType,\n  validateNamedType,\n  validateOptionalArgType,\n  validateOptionalArrayElements,\n  validateOptionNames,\n  validatePositiveNumber,\n  validateStringEnum,\n  valueDescription\n} from '../util/input_validation';\nimport { getLogLevel, logError, LogLevel, setLogLevel } from '../util/log';\nimport { AutoId } from '../util/misc';\nimport { Deferred, Rejecter, Resolver } from '../util/promise';\nimport { FieldPath as ExternalFieldPath } from './field_path';\n\nimport {\n  CredentialsProvider,\n  CredentialsSettings,\n  EmptyCredentialsProvider,\n  FirebaseCredentialsProvider,\n  makeCredentialsProvider\n} from './credentials';\nimport {\n  CompleteFn,\n  ErrorFn,\n  isPartialObserver,\n  NextFn,\n  PartialObserver,\n  Unsubscribe\n} from './observer';\nimport { fieldPathFromArgument, UserDataReader } from './user_data_reader';\nimport { UserDataWriter } from './user_data_writer';\nimport { FirebaseAuthInternalName } from '@firebase/auth-interop-types';\nimport { Provider } from '@firebase/component';\n\n// settings() defaults:\nconst DEFAULT_HOST = 'firestore.googleapis.com';\nconst DEFAULT_SSL = true;\nconst DEFAULT_TIMESTAMPS_IN_SNAPSHOTS = true;\nconst DEFAULT_FORCE_LONG_POLLING = false;\nconst DEFAULT_IGNORE_UNDEFINED_PROPERTIES = false;\n\n/**\n * Constant used to indicate the LRU garbage collection should be disabled.\n * Set this value as the `cacheSizeBytes` on the settings passed to the\n * `Firestore` instance.\n */\nexport const CACHE_SIZE_UNLIMITED = LruParams.COLLECTION_DISABLED;\n\n// enablePersistence() defaults:\nconst DEFAULT_SYNCHRONIZE_TABS = false;\n\n/** Undocumented, private additional settings not exposed in our public API. */\ninterface PrivateSettings extends firestore.Settings {\n  // Can be a google-auth-library or gapi client.\n  credentials?: CredentialsSettings;\n}\n\n/**\n * Options that can be provided in the Firestore constructor when not using\n * Firebase (aka standalone mode).\n */\nexport interface FirestoreDatabase {\n  projectId: string;\n  database?: string;\n}\n\n/**\n * A concrete type describing all the values that can be applied via a\n * user-supplied firestore.Settings object. This is a separate type so that\n * defaults can be supplied and the value can be checked for equality.\n */\nclass FirestoreSettings {\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 timestampsInSnapshots: boolean;\n\n  readonly cacheSizeBytes: number;\n\n  readonly forceLongPolling: boolean;\n\n  readonly ignoreUndefinedProperties: 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      validateNamedType('settings', 'non-empty string', 'host', settings.host);\n      this.host = settings.host;\n\n      validateNamedOptionalType('settings', 'boolean', 'ssl', settings.ssl);\n      this.ssl = settings.ssl ?? DEFAULT_SSL;\n    }\n    validateOptionNames('settings', settings, [\n      'host',\n      'ssl',\n      'credentials',\n      'timestampsInSnapshots',\n      'cacheSizeBytes',\n      'experimentalForceLongPolling',\n      'ignoreUndefinedProperties'\n    ]);\n\n    validateNamedOptionalType(\n      'settings',\n      'object',\n      'credentials',\n      settings.credentials\n    );\n    this.credentials = settings.credentials;\n\n    validateNamedOptionalType(\n      'settings',\n      'boolean',\n      'timestampsInSnapshots',\n      settings.timestampsInSnapshots\n    );\n\n    validateNamedOptionalType(\n      'settings',\n      'boolean',\n      'ignoreUndefinedProperties',\n      settings.ignoreUndefinedProperties\n    );\n\n    // Nobody should set timestampsInSnapshots anymore, but the error depends on\n    // whether they set it to true or false...\n    if (settings.timestampsInSnapshots === true) {\n      logError(\n        \"The setting 'timestampsInSnapshots: true' is no longer required \" +\n          'and should be removed.'\n      );\n    } else if (settings.timestampsInSnapshots === false) {\n      logError(\n        \"Support for 'timestampsInSnapshots: false' will be removed soon. \" +\n          'You must update your code to handle Timestamp objects.'\n      );\n    }\n    this.timestampsInSnapshots =\n      settings.timestampsInSnapshots ?? DEFAULT_TIMESTAMPS_IN_SNAPSHOTS;\n    this.ignoreUndefinedProperties =\n      settings.ignoreUndefinedProperties ?? DEFAULT_IGNORE_UNDEFINED_PROPERTIES;\n\n    validateNamedOptionalType(\n      'settings',\n      'number',\n      'cacheSizeBytes',\n      settings.cacheSizeBytes\n    );\n    if (settings.cacheSizeBytes === undefined) {\n      this.cacheSizeBytes = LruParams.DEFAULT_CACHE_SIZE_BYTES;\n    } else {\n      if (\n        settings.cacheSizeBytes !== CACHE_SIZE_UNLIMITED &&\n        settings.cacheSizeBytes < LruParams.MINIMUM_CACHE_SIZE_BYTES\n      ) {\n        throw new FirestoreError(\n          Code.INVALID_ARGUMENT,\n          `cacheSizeBytes must be at least ${LruParams.MINIMUM_CACHE_SIZE_BYTES}`\n        );\n      } else {\n        this.cacheSizeBytes = settings.cacheSizeBytes;\n      }\n    }\n\n    validateNamedOptionalType(\n      'settings',\n      'boolean',\n      'experimentalForceLongPolling',\n      settings.experimentalForceLongPolling\n    );\n    this.forceLongPolling =\n      settings.experimentalForceLongPolling ?? DEFAULT_FORCE_LONG_POLLING;\n  }\n\n  isEqual(other: FirestoreSettings): boolean {\n    return (\n      this.host === other.host &&\n      this.ssl === other.ssl &&\n      this.timestampsInSnapshots === other.timestampsInSnapshots &&\n      this.credentials === other.credentials &&\n      this.cacheSizeBytes === other.cacheSizeBytes &&\n      this.forceLongPolling === other.forceLongPolling &&\n      this.ignoreUndefinedProperties === other.ignoreUndefinedProperties\n    );\n  }\n}\n\n/**\n * The root reference to the database.\n */\nexport class Firestore implements firestore.FirebaseFirestore, FirebaseService {\n  // The objects that are a part of this API are exposed to third-parties as\n  // compiled javascript so we want to flag our private members with a leading\n  // underscore to discourage their use.\n  readonly _databaseId: DatabaseId;\n  private readonly _persistenceKey: string;\n  private readonly _componentProvider: ComponentProvider;\n  private _credentials: CredentialsProvider;\n  private readonly _firebaseApp: FirebaseApp | null = null;\n  private _settings: FirestoreSettings;\n\n  // The firestore client instance. This will be available as soon as\n  // configureClient is called, but any calls against it will block until\n  // setup has completed.\n  //\n  // Operations on the _firestoreClient don't block on _firestoreReady. Those\n  // are already set to synchronize on the async queue.\n  private _firestoreClient: FirestoreClient | undefined;\n\n  // Public for use in tests.\n  // TODO(mikelehen): Use modularized initialization instead.\n  readonly _queue = new AsyncQueue();\n\n  _userDataReader: UserDataReader | undefined;\n\n  // Note: We are using `MemoryComponentProvider` as a default\n  // ComponentProvider to ensure backwards compatibility with the format\n  // expected by the console build.\n  constructor(\n    databaseIdOrApp: FirestoreDatabase | FirebaseApp,\n    authProvider: Provider<FirebaseAuthInternalName>,\n    componentProvider: ComponentProvider = new MemoryComponentProvider()\n  ) {\n    if (typeof (databaseIdOrApp as FirebaseApp).options === 'object') {\n      // This is very likely a Firebase app object\n      // TODO(b/34177605): Can we somehow use instanceof?\n      const app = databaseIdOrApp as FirebaseApp;\n      this._firebaseApp = app;\n      this._databaseId = Firestore.databaseIdFromApp(app);\n      this._persistenceKey = app.name;\n      this._credentials = new FirebaseCredentialsProvider(authProvider);\n    } else {\n      const external = databaseIdOrApp as FirestoreDatabase;\n      if (!external.projectId) {\n        throw new FirestoreError(\n          Code.INVALID_ARGUMENT,\n          'Must provide projectId'\n        );\n      }\n\n      this._databaseId = new DatabaseId(external.projectId, external.database);\n      // Use a default persistenceKey that lines up with FirebaseApp.\n      this._persistenceKey = '[DEFAULT]';\n      this._credentials = new EmptyCredentialsProvider();\n    }\n\n    this._componentProvider = componentProvider;\n    this._settings = new FirestoreSettings({});\n  }\n\n  get _dataReader(): UserDataReader {\n    debugAssert(\n      !!this._firestoreClient,\n      'Cannot obtain UserDataReader before instance is intitialized'\n    );\n    if (!this._userDataReader) {\n      // Lazy initialize UserDataReader once the settings are frozen\n      this._userDataReader = new UserDataReader(\n        this._databaseId,\n        this._settings.ignoreUndefinedProperties\n      );\n    }\n    return this._userDataReader;\n  }\n\n  settings(settingsLiteral: firestore.Settings): void {\n    validateExactNumberOfArgs('Firestore.settings', arguments, 1);\n    validateArgType('Firestore.settings', 'object', 1, settingsLiteral);\n\n    const newSettings = new FirestoreSettings(settingsLiteral);\n    if (this._firestoreClient && !this._settings.isEqual(newSettings)) {\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 call settings() before calling any other ' +\n          'methods on a Firestore object.'\n      );\n    }\n\n    this._settings = newSettings;\n    if (newSettings.credentials !== undefined) {\n      this._credentials = makeCredentialsProvider(newSettings.credentials);\n    }\n  }\n\n  enableNetwork(): Promise<void> {\n    this.ensureClientConfigured();\n    return this._firestoreClient!.enableNetwork();\n  }\n\n  disableNetwork(): Promise<void> {\n    this.ensureClientConfigured();\n    return this._firestoreClient!.disableNetwork();\n  }\n\n  enablePersistence(settings?: firestore.PersistenceSettings): Promise<void> {\n    if (this._firestoreClient) {\n      throw new FirestoreError(\n        Code.FAILED_PRECONDITION,\n        'Firestore has already been started and persistence can no longer ' +\n          'be enabled. You can only call enablePersistence() before calling ' +\n          'any other methods on a Firestore object.'\n      );\n    }\n\n    let synchronizeTabs = false;\n\n    if (settings) {\n      if (settings.experimentalTabSynchronization !== undefined) {\n        logError(\n          \"The 'experimentalTabSynchronization' setting will be removed. Use 'synchronizeTabs' instead.\"\n        );\n      }\n      synchronizeTabs =\n        settings.synchronizeTabs ??\n        settings.experimentalTabSynchronization ??\n        DEFAULT_SYNCHRONIZE_TABS;\n    }\n\n    return this.configureClient(this._componentProvider, {\n      durable: true,\n      cacheSizeBytes: this._settings.cacheSizeBytes,\n      synchronizeTabs\n    });\n  }\n\n  async clearPersistence(): Promise<void> {\n    if (\n      this._firestoreClient !== undefined &&\n      !this._firestoreClient.clientTerminated\n    ) {\n      throw new FirestoreError(\n        Code.FAILED_PRECONDITION,\n        'Persistence cannot be cleared after this Firestore instance is initialized.'\n      );\n    }\n\n    const deferred = new Deferred<void>();\n    this._queue.enqueueAndForgetEvenAfterShutdown(async () => {\n      try {\n        const databaseInfo = this.makeDatabaseInfo();\n        await this._componentProvider.clearPersistence(databaseInfo);\n        deferred.resolve();\n      } catch (e) {\n        deferred.reject(e);\n      }\n    });\n    return deferred.promise;\n  }\n\n  terminate(): Promise<void> {\n    (this.app as _FirebaseApp)._removeServiceInstance('firestore');\n    return this.INTERNAL.delete();\n  }\n\n  get _isTerminated(): boolean {\n    this.ensureClientConfigured();\n    return this._firestoreClient!.clientTerminated;\n  }\n\n  waitForPendingWrites(): Promise<void> {\n    this.ensureClientConfigured();\n    return this._firestoreClient!.waitForPendingWrites();\n  }\n\n  onSnapshotsInSync(observer: PartialObserver<void>): Unsubscribe;\n  onSnapshotsInSync(onSync: () => void): Unsubscribe;\n  onSnapshotsInSync(arg: unknown): Unsubscribe {\n    this.ensureClientConfigured();\n\n    if (isPartialObserver(arg)) {\n      return this.onSnapshotsInSyncInternal(arg as PartialObserver<void>);\n    } else {\n      validateArgType('Firestore.onSnapshotsInSync', 'function', 1, arg);\n      const observer: PartialObserver<void> = {\n        next: arg as () => void\n      };\n      return this.onSnapshotsInSyncInternal(observer);\n    }\n  }\n\n  private onSnapshotsInSyncInternal(\n    observer: PartialObserver<void>\n  ): Unsubscribe {\n    const errHandler = (err: Error): void => {\n      throw fail('Uncaught Error in onSnapshotsInSync');\n    };\n    const asyncObserver = new AsyncObserver<void>({\n      next: () => {\n        if (observer.next) {\n          observer.next();\n        }\n      },\n      error: errHandler\n    });\n    this._firestoreClient!.addSnapshotsInSyncListener(asyncObserver);\n    return () => {\n      asyncObserver.mute();\n      this._firestoreClient!.removeSnapshotsInSyncListener(asyncObserver);\n    };\n  }\n\n  ensureClientConfigured(): FirestoreClient {\n    if (!this._firestoreClient) {\n      // Kick off starting the client but don't actually wait for it.\n      // eslint-disable-next-line @typescript-eslint/no-floating-promises\n      this.configureClient(new MemoryComponentProvider(), {\n        durable: false\n      });\n    }\n    return this._firestoreClient as FirestoreClient;\n  }\n\n  private makeDatabaseInfo(): DatabaseInfo {\n    return new DatabaseInfo(\n      this._databaseId,\n      this._persistenceKey,\n      this._settings.host,\n      this._settings.ssl,\n      this._settings.forceLongPolling\n    );\n  }\n\n  private configureClient(\n    componentProvider: ComponentProvider,\n    persistenceSettings: PersistenceSettings\n  ): Promise<void> {\n    debugAssert(!!this._settings.host, 'FirestoreSettings.host is not set');\n\n    debugAssert(\n      !this._firestoreClient,\n      'configureClient() called multiple times'\n    );\n\n    const databaseInfo = this.makeDatabaseInfo();\n\n    this._firestoreClient = new FirestoreClient(\n      PlatformSupport.getPlatform(),\n      databaseInfo,\n      this._credentials,\n      this._queue\n    );\n\n    return this._firestoreClient.start(componentProvider, persistenceSettings);\n  }\n\n  private static databaseIdFromApp(app: FirebaseApp): DatabaseId {\n    if (!contains(app.options, 'projectId')) {\n      throw new FirestoreError(\n        Code.INVALID_ARGUMENT,\n        '\"projectId\" not provided in firebase.initializeApp.'\n      );\n    }\n\n    const projectId = app.options.projectId;\n    if (!projectId || typeof projectId !== 'string') {\n      throw new FirestoreError(\n        Code.INVALID_ARGUMENT,\n        'projectId must be a string in FirebaseApp.options'\n      );\n    }\n    return new DatabaseId(projectId);\n  }\n\n  get app(): FirebaseApp {\n    if (!this._firebaseApp) {\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._firebaseApp;\n  }\n\n  INTERNAL = {\n    delete: async (): Promise<void> => {\n      // The client must be initalized to ensure that all subsequent API usage\n      // throws an exception.\n      this.ensureClientConfigured();\n      await this._firestoreClient!.terminate();\n    }\n  };\n\n  collection(pathString: string): firestore.CollectionReference {\n    validateExactNumberOfArgs('Firestore.collection', arguments, 1);\n    validateArgType('Firestore.collection', 'non-empty string', 1, pathString);\n    this.ensureClientConfigured();\n    return new CollectionReference(ResourcePath.fromString(pathString), this);\n  }\n\n  doc(pathString: string): firestore.DocumentReference {\n    validateExactNumberOfArgs('Firestore.doc', arguments, 1);\n    validateArgType('Firestore.doc', 'non-empty string', 1, pathString);\n    this.ensureClientConfigured();\n    return DocumentReference.forPath(ResourcePath.fromString(pathString), this);\n  }\n\n  collectionGroup(collectionId: string): firestore.Query {\n    validateExactNumberOfArgs('Firestore.collectionGroup', arguments, 1);\n    validateArgType(\n      'Firestore.collectionGroup',\n      'non-empty string',\n      1,\n      collectionId\n    );\n    if (collectionId.indexOf('/') >= 0) {\n      throw new FirestoreError(\n        Code.INVALID_ARGUMENT,\n        `Invalid collection ID '${collectionId}' passed to function ` +\n          `Firestore.collectionGroup(). Collection IDs must not contain '/'.`\n      );\n    }\n    this.ensureClientConfigured();\n    return new Query(\n      new InternalQuery(ResourcePath.EMPTY_PATH, collectionId),\n      this\n    );\n  }\n\n  runTransaction<T>(\n    updateFunction: (transaction: firestore.Transaction) => Promise<T>\n  ): Promise<T> {\n    validateExactNumberOfArgs('Firestore.runTransaction', arguments, 1);\n    validateArgType('Firestore.runTransaction', 'function', 1, updateFunction);\n    return this.ensureClientConfigured().transaction(\n      (transaction: InternalTransaction) => {\n        return updateFunction(new Transaction(this, transaction));\n      }\n    );\n  }\n\n  batch(): firestore.WriteBatch {\n    this.ensureClientConfigured();\n\n    return new WriteBatch(this);\n  }\n\n  static get logLevel(): firestore.LogLevel {\n    switch (getLogLevel()) {\n      case LogLevel.DEBUG:\n        return 'debug';\n      case LogLevel.SILENT:\n        return 'silent';\n      default:\n        // The default log level is error\n        return 'error';\n    }\n  }\n\n  static setLogLevel(level: firestore.LogLevel): void {\n    validateExactNumberOfArgs('Firestore.setLogLevel', arguments, 1);\n    validateArgType('Firestore.setLogLevel', 'non-empty string', 1, level);\n    switch (level) {\n      case 'debug':\n        setLogLevel(LogLevel.DEBUG);\n        break;\n      case 'error':\n        setLogLevel(LogLevel.ERROR);\n        break;\n      case 'silent':\n        setLogLevel(LogLevel.SILENT);\n        break;\n      default:\n        throw new FirestoreError(\n          Code.INVALID_ARGUMENT,\n          'Invalid log level: ' + level\n        );\n    }\n  }\n\n  // Note: this is not a property because the minifier can't work correctly with\n  // the way TypeScript compiler outputs properties.\n  _areTimestampsInSnapshotsEnabled(): boolean {\n    return this._settings.timestampsInSnapshots;\n  }\n}\n\n/**\n * A reference to a transaction.\n */\nexport class Transaction implements firestore.Transaction {\n  constructor(\n    private _firestore: Firestore,\n    private _transaction: InternalTransaction\n  ) {}\n\n  get<T>(\n    documentRef: firestore.DocumentReference<T>\n  ): Promise<firestore.DocumentSnapshot<T>> {\n    validateExactNumberOfArgs('Transaction.get', arguments, 1);\n    const ref = validateReference(\n      'Transaction.get',\n      documentRef,\n      this._firestore\n    );\n    return this._transaction\n      .lookup([ref._key])\n      .then((docs: MaybeDocument[]) => {\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 instanceof NoDocument) {\n          return new DocumentSnapshot<T>(\n            this._firestore,\n            ref._key,\n            null,\n            /* fromCache= */ false,\n            /* hasPendingWrites= */ false,\n            ref._converter\n          );\n        } else if (doc instanceof Document) {\n          return new DocumentSnapshot<T>(\n            this._firestore,\n            ref._key,\n            doc,\n            /* fromCache= */ false,\n            /* hasPendingWrites= */ false,\n            ref._converter\n          );\n        } else {\n          throw fail(\n            `BatchGetDocumentsRequest returned unexpected document type: ${doc.constructor.name}`\n          );\n        }\n      });\n  }\n\n  set<T>(\n    documentRef: firestore.DocumentReference<T>,\n    value: T,\n    options?: firestore.SetOptions\n  ): Transaction {\n    validateBetweenNumberOfArgs('Transaction.set', arguments, 2, 3);\n    const ref = validateReference(\n      'Transaction.set',\n      documentRef,\n      this._firestore\n    );\n    options = validateSetOptions('Transaction.set', options);\n    const [convertedValue, functionName] = applyFirestoreDataConverter(\n      ref._converter,\n      value,\n      'Transaction.set'\n    );\n    const parsed =\n      options.merge || options.mergeFields\n        ? this._firestore._dataReader.parseMergeData(\n            functionName,\n            convertedValue,\n            options.mergeFields\n          )\n        : this._firestore._dataReader.parseSetData(\n            functionName,\n            convertedValue\n          );\n    this._transaction.set(ref._key, parsed);\n    return this;\n  }\n\n  update(\n    documentRef: firestore.DocumentReference<unknown>,\n    value: firestore.UpdateData\n  ): Transaction;\n  update(\n    documentRef: firestore.DocumentReference<unknown>,\n    field: string | ExternalFieldPath,\n    value: unknown,\n    ...moreFieldsAndValues: unknown[]\n  ): Transaction;\n  update(\n    documentRef: firestore.DocumentReference<unknown>,\n    fieldOrUpdateData: string | ExternalFieldPath | firestore.UpdateData,\n    value?: unknown,\n    ...moreFieldsAndValues: unknown[]\n  ): Transaction {\n    let ref;\n    let parsed;\n\n    if (\n      typeof fieldOrUpdateData === 'string' ||\n      fieldOrUpdateData instanceof ExternalFieldPath\n    ) {\n      validateAtLeastNumberOfArgs('Transaction.update', arguments, 3);\n      ref = validateReference(\n        'Transaction.update',\n        documentRef,\n        this._firestore\n      );\n      parsed = this._firestore._dataReader.parseUpdateVarargs(\n        'Transaction.update',\n        fieldOrUpdateData,\n        value,\n        moreFieldsAndValues\n      );\n    } else {\n      validateExactNumberOfArgs('Transaction.update', arguments, 2);\n      ref = validateReference(\n        'Transaction.update',\n        documentRef,\n        this._firestore\n      );\n      parsed = this._firestore._dataReader.parseUpdateData(\n        'Transaction.update',\n        fieldOrUpdateData\n      );\n    }\n\n    this._transaction.update(ref._key, parsed);\n    return this;\n  }\n\n  delete(documentRef: firestore.DocumentReference<unknown>): Transaction {\n    validateExactNumberOfArgs('Transaction.delete', arguments, 1);\n    const ref = validateReference(\n      'Transaction.delete',\n      documentRef,\n      this._firestore\n    );\n    this._transaction.delete(ref._key);\n    return this;\n  }\n}\n\nexport class WriteBatch implements firestore.WriteBatch {\n  private _mutations = [] as Mutation[];\n  private _committed = false;\n\n  constructor(private _firestore: Firestore) {}\n\n  set<T>(\n    documentRef: firestore.DocumentReference<T>,\n    value: T,\n    options?: firestore.SetOptions\n  ): WriteBatch {\n    validateBetweenNumberOfArgs('WriteBatch.set', arguments, 2, 3);\n    this.verifyNotCommitted();\n    const ref = validateReference(\n      'WriteBatch.set',\n      documentRef,\n      this._firestore\n    );\n    options = validateSetOptions('WriteBatch.set', options);\n    const [convertedValue, functionName] = applyFirestoreDataConverter(\n      ref._converter,\n      value,\n      'WriteBatch.set'\n    );\n    const parsed =\n      options.merge || options.mergeFields\n        ? this._firestore._dataReader.parseMergeData(\n            functionName,\n            convertedValue,\n            options.mergeFields\n          )\n        : this._firestore._dataReader.parseSetData(\n            functionName,\n            convertedValue\n          );\n    this._mutations = this._mutations.concat(\n      parsed.toMutations(ref._key, Precondition.none())\n    );\n    return this;\n  }\n\n  update(\n    documentRef: firestore.DocumentReference<unknown>,\n    value: firestore.UpdateData\n  ): WriteBatch;\n  update(\n    documentRef: firestore.DocumentReference<unknown>,\n    field: string | ExternalFieldPath,\n    value: unknown,\n    ...moreFieldsAndValues: unknown[]\n  ): WriteBatch;\n  update(\n    documentRef: firestore.DocumentReference<unknown>,\n    fieldOrUpdateData: string | ExternalFieldPath | firestore.UpdateData,\n    value?: unknown,\n    ...moreFieldsAndValues: unknown[]\n  ): WriteBatch {\n    this.verifyNotCommitted();\n\n    let ref;\n    let parsed;\n\n    if (\n      typeof fieldOrUpdateData === 'string' ||\n      fieldOrUpdateData instanceof ExternalFieldPath\n    ) {\n      validateAtLeastNumberOfArgs('WriteBatch.update', arguments, 3);\n      ref = validateReference(\n        'WriteBatch.update',\n        documentRef,\n        this._firestore\n      );\n      parsed = this._firestore._dataReader.parseUpdateVarargs(\n        'WriteBatch.update',\n        fieldOrUpdateData,\n        value,\n        moreFieldsAndValues\n      );\n    } else {\n      validateExactNumberOfArgs('WriteBatch.update', arguments, 2);\n      ref = validateReference(\n        'WriteBatch.update',\n        documentRef,\n        this._firestore\n      );\n      parsed = this._firestore._dataReader.parseUpdateData(\n        'WriteBatch.update',\n        fieldOrUpdateData\n      );\n    }\n\n    this._mutations = this._mutations.concat(\n      parsed.toMutations(ref._key, Precondition.exists(true))\n    );\n    return this;\n  }\n\n  delete(documentRef: firestore.DocumentReference<unknown>): WriteBatch {\n    validateExactNumberOfArgs('WriteBatch.delete', arguments, 1);\n    this.verifyNotCommitted();\n    const ref = validateReference(\n      'WriteBatch.delete',\n      documentRef,\n      this._firestore\n    );\n    this._mutations = this._mutations.concat(\n      new DeleteMutation(ref._key, Precondition.none())\n    );\n    return this;\n  }\n\n  commit(): Promise<void> {\n    this.verifyNotCommitted();\n    this._committed = true;\n    if (this._mutations.length > 0) {\n      return this._firestore.ensureClientConfigured().write(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\n/**\n * A reference to a particular document in a collection in the database.\n */\nexport class DocumentReference<T = firestore.DocumentData>\n  implements firestore.DocumentReference<T> {\n  private _firestoreClient: FirestoreClient;\n\n  constructor(\n    public _key: DocumentKey,\n    readonly firestore: Firestore,\n    readonly _converter?: firestore.FirestoreDataConverter<T>\n  ) {\n    this._firestoreClient = this.firestore.ensureClientConfigured();\n  }\n\n  static forPath<U>(\n    path: ResourcePath,\n    firestore: Firestore,\n    converter?: firestore.FirestoreDataConverter<U>\n  ): DocumentReference<U> {\n    if (path.length % 2 !== 0) {\n      throw new FirestoreError(\n        Code.INVALID_ARGUMENT,\n        'Invalid document reference. Document ' +\n          'references must have an even number of segments, but ' +\n          `${path.canonicalString()} has ${path.length}`\n      );\n    }\n    return new DocumentReference(new DocumentKey(path), firestore, converter);\n  }\n\n  get id(): string {\n    return this._key.path.lastSegment();\n  }\n\n  get parent(): firestore.CollectionReference<T> {\n    return new CollectionReference(\n      this._key.path.popLast(),\n      this.firestore,\n      this._converter\n    );\n  }\n\n  get path(): string {\n    return this._key.path.canonicalString();\n  }\n\n  collection(\n    pathString: string\n  ): firestore.CollectionReference<firestore.DocumentData> {\n    validateExactNumberOfArgs('DocumentReference.collection', arguments, 1);\n    validateArgType(\n      'DocumentReference.collection',\n      'non-empty string',\n      1,\n      pathString\n    );\n    if (!pathString) {\n      throw new FirestoreError(\n        Code.INVALID_ARGUMENT,\n        'Must provide a non-empty collection name to collection()'\n      );\n    }\n    const path = ResourcePath.fromString(pathString);\n    return new CollectionReference(this._key.path.child(path), this.firestore);\n  }\n\n  isEqual(other: firestore.DocumentReference<T>): boolean {\n    if (!(other instanceof DocumentReference)) {\n      throw invalidClassError('isEqual', 'DocumentReference', 1, other);\n    }\n    return (\n      this.firestore === other.firestore &&\n      this._key.isEqual(other._key) &&\n      this._converter === other._converter\n    );\n  }\n\n  set(\n    value: firestore.DocumentData,\n    options?: firestore.SetOptions\n  ): Promise<void>;\n  set(value: T, options?: firestore.SetOptions): Promise<void> {\n    validateBetweenNumberOfArgs('DocumentReference.set', arguments, 1, 2);\n    options = validateSetOptions('DocumentReference.set', options);\n    const [convertedValue, functionName] = applyFirestoreDataConverter(\n      this._converter,\n      value,\n      'DocumentReference.set'\n    );\n    const parsed =\n      options.merge || options.mergeFields\n        ? this.firestore._dataReader.parseMergeData(\n            functionName,\n            convertedValue,\n            options.mergeFields\n          )\n        : this.firestore._dataReader.parseSetData(functionName, convertedValue);\n    return this._firestoreClient.write(\n      parsed.toMutations(this._key, Precondition.none())\n    );\n  }\n\n  update(value: firestore.UpdateData): Promise<void>;\n  update(\n    field: string | ExternalFieldPath,\n    value: unknown,\n    ...moreFieldsAndValues: unknown[]\n  ): Promise<void>;\n  update(\n    fieldOrUpdateData: string | ExternalFieldPath | firestore.UpdateData,\n    value?: unknown,\n    ...moreFieldsAndValues: unknown[]\n  ): Promise<void> {\n    let parsed;\n\n    if (\n      typeof fieldOrUpdateData === 'string' ||\n      fieldOrUpdateData instanceof ExternalFieldPath\n    ) {\n      validateAtLeastNumberOfArgs('DocumentReference.update', arguments, 2);\n      parsed = this.firestore._dataReader.parseUpdateVarargs(\n        'DocumentReference.update',\n        fieldOrUpdateData,\n        value,\n        moreFieldsAndValues\n      );\n    } else {\n      validateExactNumberOfArgs('DocumentReference.update', arguments, 1);\n      parsed = this.firestore._dataReader.parseUpdateData(\n        'DocumentReference.update',\n        fieldOrUpdateData\n      );\n    }\n\n    return this._firestoreClient.write(\n      parsed.toMutations(this._key, Precondition.exists(true))\n    );\n  }\n\n  delete(): Promise<void> {\n    validateExactNumberOfArgs('DocumentReference.delete', arguments, 0);\n    return this._firestoreClient.write([\n      new DeleteMutation(this._key, Precondition.none())\n    ]);\n  }\n\n  onSnapshot(\n    observer: PartialObserver<firestore.DocumentSnapshot<T>>\n  ): Unsubscribe;\n  onSnapshot(\n    options: firestore.SnapshotListenOptions,\n    observer: PartialObserver<firestore.DocumentSnapshot<T>>\n  ): Unsubscribe;\n  onSnapshot(\n    onNext: NextFn<firestore.DocumentSnapshot<T>>,\n    onError?: ErrorFn,\n    onCompletion?: CompleteFn\n  ): Unsubscribe;\n  onSnapshot(\n    options: firestore.SnapshotListenOptions,\n    onNext: NextFn<firestore.DocumentSnapshot<T>>,\n    onError?: ErrorFn,\n    onCompletion?: CompleteFn\n  ): Unsubscribe;\n\n  onSnapshot(...args: unknown[]): Unsubscribe {\n    validateBetweenNumberOfArgs(\n      'DocumentReference.onSnapshot',\n      arguments,\n      1,\n      4\n    );\n    let options: firestore.SnapshotListenOptions = {\n      includeMetadataChanges: false\n    };\n    let observer: PartialObserver<firestore.DocumentSnapshot<T>>;\n    let currArg = 0;\n    if (\n      typeof args[currArg] === 'object' &&\n      !isPartialObserver(args[currArg])\n    ) {\n      options = args[currArg] as firestore.SnapshotListenOptions;\n      validateOptionNames('DocumentReference.onSnapshot', options, [\n        'includeMetadataChanges'\n      ]);\n      validateNamedOptionalType(\n        'DocumentReference.onSnapshot',\n        'boolean',\n        'includeMetadataChanges',\n        options.includeMetadataChanges\n      );\n      currArg++;\n    }\n\n    const internalOptions = {\n      includeMetadataChanges: options.includeMetadataChanges\n    };\n\n    if (isPartialObserver(args[currArg])) {\n      observer = args[currArg] as PartialObserver<\n        firestore.DocumentSnapshot<T>\n      >;\n    } else {\n      validateArgType(\n        'DocumentReference.onSnapshot',\n        'function',\n        currArg,\n        args[currArg]\n      );\n      validateOptionalArgType(\n        'DocumentReference.onSnapshot',\n        'function',\n        currArg + 1,\n        args[currArg + 1]\n      );\n      validateOptionalArgType(\n        'DocumentReference.onSnapshot',\n        'function',\n        currArg + 2,\n        args[currArg + 2]\n      );\n      observer = {\n        next: args[currArg] as NextFn<firestore.DocumentSnapshot<T>>,\n        error: args[currArg + 1] as ErrorFn,\n        complete: args[currArg + 2] as CompleteFn\n      };\n    }\n    return this.onSnapshotInternal(internalOptions, observer);\n  }\n\n  private onSnapshotInternal(\n    options: ListenOptions,\n    observer: PartialObserver<firestore.DocumentSnapshot<T>>\n  ): Unsubscribe {\n    let errHandler = (err: Error): void => {\n      console.error('Uncaught Error in onSnapshot:', err);\n    };\n    if (observer.error) {\n      errHandler = observer.error.bind(observer);\n    }\n\n    const asyncObserver = new AsyncObserver<ViewSnapshot>({\n      next: snapshot => {\n        if (observer.next) {\n          debugAssert(\n            snapshot.docs.size <= 1,\n            'Too many documents returned on a document query'\n          );\n          const doc = snapshot.docs.get(this._key);\n\n          observer.next(\n            new DocumentSnapshot(\n              this.firestore,\n              this._key,\n              doc,\n              snapshot.fromCache,\n              snapshot.hasPendingWrites,\n              this._converter\n            )\n          );\n        }\n      },\n      error: errHandler\n    });\n    const internalListener = this._firestoreClient.listen(\n      InternalQuery.atPath(this._key.path),\n      asyncObserver,\n      options\n    );\n\n    return () => {\n      asyncObserver.mute();\n      this._firestoreClient.unlisten(internalListener);\n    };\n  }\n\n  get(options?: firestore.GetOptions): Promise<firestore.DocumentSnapshot<T>> {\n    validateBetweenNumberOfArgs('DocumentReference.get', arguments, 0, 1);\n    validateGetOptions('DocumentReference.get', options);\n    return new Promise(\n      (resolve: Resolver<firestore.DocumentSnapshot<T>>, reject: Rejecter) => {\n        if (options && options.source === 'cache') {\n          this.firestore\n            .ensureClientConfigured()\n            .getDocumentFromLocalCache(this._key)\n            .then(doc => {\n              resolve(\n                new DocumentSnapshot(\n                  this.firestore,\n                  this._key,\n                  doc,\n                  /*fromCache=*/ true,\n                  doc instanceof Document ? doc.hasLocalMutations : false,\n                  this._converter\n                )\n              );\n            }, reject);\n        } else {\n          this.getViaSnapshotListener(resolve, reject, options);\n        }\n      }\n    );\n  }\n\n  private getViaSnapshotListener(\n    resolve: Resolver<firestore.DocumentSnapshot<T>>,\n    reject: Rejecter,\n    options?: firestore.GetOptions\n  ): void {\n    const unlisten = this.onSnapshotInternal(\n      {\n        includeMetadataChanges: true,\n        waitForSyncWhenOnline: true\n      },\n      {\n        next: (snap: firestore.DocumentSnapshot<T>) => {\n          // Remove query first before passing event to user to avoid\n          // user actions affecting the now stale query.\n          unlisten();\n\n          if (!snap.exists && snap.metadata.fromCache) {\n            // TODO(dimond): If we're online and the document doesn't\n            // exist then we resolve with a doc.exists set to false. If\n            // we're offline however, we reject the Promise in this\n            // case. Two options: 1) Cache the negative response from\n            // the server so we can deliver that even when you're\n            // offline 2) Actually reject the Promise in the online case\n            // if the document doesn't exist.\n            reject(\n              new FirestoreError(\n                Code.UNAVAILABLE,\n                'Failed to get document because the client is ' + 'offline.'\n              )\n            );\n          } else if (\n            snap.exists &&\n            snap.metadata.fromCache &&\n            options &&\n            options.source === 'server'\n          ) {\n            reject(\n              new FirestoreError(\n                Code.UNAVAILABLE,\n                'Failed to get document from server. (However, this ' +\n                  'document does exist in the local cache. Run again ' +\n                  'without setting source to \"server\" to ' +\n                  'retrieve the cached document.)'\n              )\n            );\n          } else {\n            resolve(snap);\n          }\n        },\n        error: reject\n      }\n    );\n  }\n\n  withConverter<U>(\n    converter: firestore.FirestoreDataConverter<U>\n  ): firestore.DocumentReference<U> {\n    return new DocumentReference<U>(this._key, this.firestore, converter);\n  }\n}\n\nclass SnapshotMetadata implements firestore.SnapshotMetadata {\n  constructor(\n    readonly hasPendingWrites: boolean,\n    readonly fromCache: boolean\n  ) {}\n\n  isEqual(other: firestore.SnapshotMetadata): boolean {\n    return (\n      this.hasPendingWrites === other.hasPendingWrites &&\n      this.fromCache === other.fromCache\n    );\n  }\n}\n\n/**\n * Options interface that can be provided to configure the deserialization of\n * DocumentSnapshots.\n */\nexport interface SnapshotOptions extends firestore.SnapshotOptions {}\n\nexport class DocumentSnapshot<T = firestore.DocumentData>\n  implements firestore.DocumentSnapshot<T> {\n  constructor(\n    private _firestore: Firestore,\n    private _key: DocumentKey,\n    public _document: Document | null,\n    private _fromCache: boolean,\n    private _hasPendingWrites: boolean,\n    private readonly _converter?: firestore.FirestoreDataConverter<T>\n  ) {}\n\n  data(options?: firestore.SnapshotOptions): T | undefined {\n    validateBetweenNumberOfArgs('DocumentSnapshot.data', arguments, 0, 1);\n    options = validateSnapshotOptions('DocumentSnapshot.data', options);\n    if (!this._document) {\n      return undefined;\n    } else {\n      // We only want to use the converter and create a new DocumentSnapshot\n      // if a converter has been provided.\n      if (this._converter) {\n        const snapshot = new QueryDocumentSnapshot(\n          this._firestore,\n          this._key,\n          this._document,\n          this._fromCache,\n          this._hasPendingWrites\n        );\n        return this._converter.fromFirestore(snapshot, options);\n      } else {\n        const userDataWriter = new UserDataWriter(\n          this._firestore,\n          this._firestore._areTimestampsInSnapshotsEnabled(),\n          options.serverTimestamps,\n          /* converter= */ undefined\n        );\n        return userDataWriter.convertValue(this._document.toProto()) as T;\n      }\n    }\n  }\n\n  get(\n    fieldPath: string | ExternalFieldPath,\n    options?: firestore.SnapshotOptions\n  ): unknown {\n    validateBetweenNumberOfArgs('DocumentSnapshot.get', arguments, 1, 2);\n    options = validateSnapshotOptions('DocumentSnapshot.get', options);\n    if (this._document) {\n      const value = this._document\n        .data()\n        .field(fieldPathFromArgument('DocumentSnapshot.get', fieldPath));\n      if (value !== null) {\n        const userDataWriter = new UserDataWriter(\n          this._firestore,\n          this._firestore._areTimestampsInSnapshotsEnabled(),\n          options.serverTimestamps,\n          this._converter\n        );\n        return userDataWriter.convertValue(value);\n      }\n    }\n    return undefined;\n  }\n\n  get id(): string {\n    return this._key.path.lastSegment();\n  }\n\n  get ref(): firestore.DocumentReference<T> {\n    return new DocumentReference<T>(\n      this._key,\n      this._firestore,\n      this._converter\n    );\n  }\n\n  get exists(): boolean {\n    return this._document !== null;\n  }\n\n  get metadata(): firestore.SnapshotMetadata {\n    return new SnapshotMetadata(this._hasPendingWrites, this._fromCache);\n  }\n\n  isEqual(other: firestore.DocumentSnapshot<T>): boolean {\n    if (!(other instanceof DocumentSnapshot)) {\n      throw invalidClassError('isEqual', 'DocumentSnapshot', 1, other);\n    }\n    return (\n      this._firestore === other._firestore &&\n      this._fromCache === other._fromCache &&\n      this._key.isEqual(other._key) &&\n      (this._document === null\n        ? other._document === null\n        : this._document.isEqual(other._document)) &&\n      this._converter === other._converter\n    );\n  }\n}\n\nexport class QueryDocumentSnapshot<T = firestore.DocumentData>\n  extends DocumentSnapshot<T>\n  implements firestore.QueryDocumentSnapshot<T> {\n  data(options?: SnapshotOptions): T {\n    const data = super.data(options);\n    debugAssert(\n      data !== undefined,\n      'Document in a QueryDocumentSnapshot should exist'\n    );\n    return data;\n  }\n}\n\nexport class Query<T = firestore.DocumentData> implements firestore.Query<T> {\n  constructor(\n    public _query: InternalQuery,\n    readonly firestore: Firestore,\n    protected readonly _converter?: firestore.FirestoreDataConverter<T>\n  ) {}\n\n  where(\n    field: string | ExternalFieldPath,\n    opStr: firestore.WhereFilterOp,\n    value: unknown\n  ): firestore.Query<T> {\n    validateExactNumberOfArgs('Query.where', arguments, 3);\n    validateDefined('Query.where', 3, value);\n\n    // Enumerated from the WhereFilterOp type in index.d.ts.\n    const whereFilterOpEnums = [\n      Operator.LESS_THAN,\n      Operator.LESS_THAN_OR_EQUAL,\n      Operator.EQUAL,\n      Operator.GREATER_THAN_OR_EQUAL,\n      Operator.GREATER_THAN,\n      Operator.ARRAY_CONTAINS,\n      Operator.IN,\n      Operator.ARRAY_CONTAINS_ANY\n    ];\n    const op = validateStringEnum('Query.where', whereFilterOpEnums, 2, opStr);\n\n    let fieldValue: api.Value;\n    const fieldPath = fieldPathFromArgument('Query.where', field);\n    if (fieldPath.isKeyField()) {\n      if (\n        op === Operator.ARRAY_CONTAINS ||\n        op === Operator.ARRAY_CONTAINS_ANY\n      ) {\n        throw new FirestoreError(\n          Code.INVALID_ARGUMENT,\n          `Invalid Query. You can't perform '${op}' ` +\n            'queries on FieldPath.documentId().'\n        );\n      } else if (op === Operator.IN) {\n        this.validateDisjunctiveFilterElements(value, op);\n        const referenceList: api.Value[] = [];\n        for (const arrayValue of value as api.Value[]) {\n          referenceList.push(this.parseDocumentIdValue(arrayValue));\n        }\n        fieldValue = { arrayValue: { values: referenceList } };\n      } else {\n        fieldValue = this.parseDocumentIdValue(value);\n      }\n    } else {\n      if (op === Operator.IN || op === Operator.ARRAY_CONTAINS_ANY) {\n        this.validateDisjunctiveFilterElements(value, op);\n      }\n      fieldValue = this.firestore._dataReader.parseQueryValue(\n        'Query.where',\n        value,\n        // We only allow nested arrays for IN queries.\n        /** allowArrays = */ op === Operator.IN\n      );\n    }\n    const filter = FieldFilter.create(fieldPath, op, fieldValue);\n    this.validateNewFilter(filter);\n    return new Query(\n      this._query.addFilter(filter),\n      this.firestore,\n      this._converter\n    );\n  }\n\n  orderBy(\n    field: string | ExternalFieldPath,\n    directionStr?: firestore.OrderByDirection\n  ): firestore.Query<T> {\n    validateBetweenNumberOfArgs('Query.orderBy', arguments, 1, 2);\n    validateOptionalArgType(\n      'Query.orderBy',\n      'non-empty string',\n      2,\n      directionStr\n    );\n    let direction: Direction;\n    if (directionStr === undefined || directionStr === 'asc') {\n      direction = Direction.ASCENDING;\n    } else if (directionStr === 'desc') {\n      direction = Direction.DESCENDING;\n    } else {\n      throw new FirestoreError(\n        Code.INVALID_ARGUMENT,\n        `Function Query.orderBy() has unknown direction '${directionStr}', ` +\n          `expected 'asc' or 'desc'.`\n      );\n    }\n    if (this._query.startAt !== null) {\n      throw new FirestoreError(\n        Code.INVALID_ARGUMENT,\n        'Invalid query. You must not call Query.startAt() or ' +\n          'Query.startAfter() before calling Query.orderBy().'\n      );\n    }\n    if (this._query.endAt !== null) {\n      throw new FirestoreError(\n        Code.INVALID_ARGUMENT,\n        'Invalid query. You must not call Query.endAt() or ' +\n          'Query.endBefore() before calling Query.orderBy().'\n      );\n    }\n    const fieldPath = fieldPathFromArgument('Query.orderBy', field);\n    const orderBy = new OrderBy(fieldPath, direction);\n    this.validateNewOrderBy(orderBy);\n    return new Query(\n      this._query.addOrderBy(orderBy),\n      this.firestore,\n      this._converter\n    );\n  }\n\n  limit(n: number): firestore.Query<T> {\n    validateExactNumberOfArgs('Query.limit', arguments, 1);\n    validateArgType('Query.limit', 'number', 1, n);\n    validatePositiveNumber('Query.limit', 1, n);\n    return new Query(\n      this._query.withLimitToFirst(n),\n      this.firestore,\n      this._converter\n    );\n  }\n\n  limitToLast(n: number): firestore.Query<T> {\n    validateExactNumberOfArgs('Query.limitToLast', arguments, 1);\n    validateArgType('Query.limitToLast', 'number', 1, n);\n    validatePositiveNumber('Query.limitToLast', 1, n);\n    return new Query(\n      this._query.withLimitToLast(n),\n      this.firestore,\n      this._converter\n    );\n  }\n\n  startAt(\n    docOrField: unknown | firestore.DocumentSnapshot<unknown>,\n    ...fields: unknown[]\n  ): firestore.Query<T> {\n    validateAtLeastNumberOfArgs('Query.startAt', arguments, 1);\n    const bound = this.boundFromDocOrFields(\n      'Query.startAt',\n      docOrField,\n      fields,\n      /*before=*/ true\n    );\n    return new Query(\n      this._query.withStartAt(bound),\n      this.firestore,\n      this._converter\n    );\n  }\n\n  startAfter(\n    docOrField: unknown | firestore.DocumentSnapshot<unknown>,\n    ...fields: unknown[]\n  ): firestore.Query<T> {\n    validateAtLeastNumberOfArgs('Query.startAfter', arguments, 1);\n    const bound = this.boundFromDocOrFields(\n      'Query.startAfter',\n      docOrField,\n      fields,\n      /*before=*/ false\n    );\n    return new Query(\n      this._query.withStartAt(bound),\n      this.firestore,\n      this._converter\n    );\n  }\n\n  endBefore(\n    docOrField: unknown | firestore.DocumentSnapshot<unknown>,\n    ...fields: unknown[]\n  ): firestore.Query<T> {\n    validateAtLeastNumberOfArgs('Query.endBefore', arguments, 1);\n    const bound = this.boundFromDocOrFields(\n      'Query.endBefore',\n      docOrField,\n      fields,\n      /*before=*/ true\n    );\n    return new Query(\n      this._query.withEndAt(bound),\n      this.firestore,\n      this._converter\n    );\n  }\n\n  endAt(\n    docOrField: unknown | firestore.DocumentSnapshot<unknown>,\n    ...fields: unknown[]\n  ): firestore.Query<T> {\n    validateAtLeastNumberOfArgs('Query.endAt', arguments, 1);\n    const bound = this.boundFromDocOrFields(\n      'Query.endAt',\n      docOrField,\n      fields,\n      /*before=*/ false\n    );\n    return new Query(\n      this._query.withEndAt(bound),\n      this.firestore,\n      this._converter\n    );\n  }\n\n  isEqual(other: firestore.Query<T>): boolean {\n    if (!(other instanceof Query)) {\n      throw invalidClassError('isEqual', 'Query', 1, other);\n    }\n    return (\n      this.firestore === other.firestore && this._query.isEqual(other._query)\n    );\n  }\n\n  withConverter<U>(\n    converter: firestore.FirestoreDataConverter<U>\n  ): firestore.Query<U> {\n    return new Query<U>(this._query, this.firestore, converter);\n  }\n\n  /** Helper function to create a bound from a document or fields */\n  private boundFromDocOrFields(\n    methodName: string,\n    docOrField: unknown | firestore.DocumentSnapshot<T>,\n    fields: unknown[],\n    before: boolean\n  ): Bound {\n    validateDefined(methodName, 1, docOrField);\n    if (docOrField instanceof DocumentSnapshot) {\n      if (fields.length > 0) {\n        throw new FirestoreError(\n          Code.INVALID_ARGUMENT,\n          `Too many arguments provided to ${methodName}().`\n        );\n      }\n      const snap = docOrField;\n      if (!snap.exists) {\n        throw new FirestoreError(\n          Code.NOT_FOUND,\n          `Can't use a DocumentSnapshot that doesn't exist for ` +\n            `${methodName}().`\n        );\n      }\n      return this.boundFromDocument(snap._document!, before);\n    } else {\n      const allFields = [docOrField].concat(fields);\n      return this.boundFromFields(methodName, allFields, before);\n    }\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   */\n  private boundFromDocument(doc: Document, before: boolean): Bound {\n    const components: api.Value[] = [];\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 this._query.orderBy) {\n      if (orderBy.field.isKeyField()) {\n        components.push(refValue(this.firestore._databaseId, doc.key));\n      } else {\n        const value = doc.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, before);\n  }\n\n  /**\n   * Converts a list of field values to a Bound for the given query.\n   */\n  private boundFromFields(\n    methodName: string,\n    values: unknown[],\n    before: boolean\n  ): Bound {\n    // Use explicit order by's because it has to match the query the user made\n    const orderBy = this._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 Query.orderBy() clauses`\n      );\n    }\n\n    const components: api.Value[] = [];\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 (\n          !this._query.isCollectionGroupQuery() &&\n          rawValue.indexOf('/') !== -1\n        ) {\n          throw new FirestoreError(\n            Code.INVALID_ARGUMENT,\n            `Invalid query. When querying a collection and ordering by FieldPath.documentId(), ` +\n              `the value passed to ${methodName}() must be a plain document ID, but ` +\n              `'${rawValue}' contains a slash.`\n          );\n        }\n        const path = this._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              `FieldPath.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(this.firestore._databaseId, key));\n      } else {\n        const wrapped = this.firestore._dataReader.parseQueryValue(\n          methodName,\n          rawValue\n        );\n        components.push(wrapped);\n      }\n    }\n\n    return new Bound(components, before);\n  }\n\n  onSnapshot(\n    observer: PartialObserver<firestore.QuerySnapshot<T>>\n  ): Unsubscribe;\n  onSnapshot(\n    options: firestore.SnapshotListenOptions,\n    observer: PartialObserver<firestore.QuerySnapshot<T>>\n  ): Unsubscribe;\n  onSnapshot(\n    onNext: NextFn<firestore.QuerySnapshot<T>>,\n    onError?: ErrorFn,\n    onCompletion?: CompleteFn\n  ): Unsubscribe;\n  onSnapshot(\n    options: firestore.SnapshotListenOptions,\n    onNext: NextFn<firestore.QuerySnapshot<T>>,\n    onError?: ErrorFn,\n    onCompletion?: CompleteFn\n  ): Unsubscribe;\n\n  onSnapshot(...args: unknown[]): Unsubscribe {\n    validateBetweenNumberOfArgs('Query.onSnapshot', arguments, 1, 4);\n    let options: firestore.SnapshotListenOptions = {};\n    let observer: PartialObserver<firestore.QuerySnapshot<T>>;\n    let currArg = 0;\n    if (\n      typeof args[currArg] === 'object' &&\n      !isPartialObserver(args[currArg])\n    ) {\n      options = args[currArg] as firestore.SnapshotListenOptions;\n      validateOptionNames('Query.onSnapshot', options, [\n        'includeMetadataChanges'\n      ]);\n      validateNamedOptionalType(\n        'Query.onSnapshot',\n        'boolean',\n        'includeMetadataChanges',\n        options.includeMetadataChanges\n      );\n      currArg++;\n    }\n\n    if (isPartialObserver(args[currArg])) {\n      observer = args[currArg] as PartialObserver<firestore.QuerySnapshot<T>>;\n    } else {\n      validateArgType('Query.onSnapshot', 'function', currArg, args[currArg]);\n      validateOptionalArgType(\n        'Query.onSnapshot',\n        'function',\n        currArg + 1,\n        args[currArg + 1]\n      );\n      validateOptionalArgType(\n        'Query.onSnapshot',\n        'function',\n        currArg + 2,\n        args[currArg + 2]\n      );\n      observer = {\n        next: args[currArg] as NextFn<firestore.QuerySnapshot<T>>,\n        error: args[currArg + 1] as ErrorFn,\n        complete: args[currArg + 2] as CompleteFn\n      };\n    }\n    this.validateHasExplicitOrderByForLimitToLast(this._query);\n    return this.onSnapshotInternal(options, observer);\n  }\n\n  private onSnapshotInternal(\n    options: ListenOptions,\n    observer: PartialObserver<firestore.QuerySnapshot<T>>\n  ): Unsubscribe {\n    let errHandler = (err: Error): void => {\n      console.error('Uncaught Error in onSnapshot:', err);\n    };\n    if (observer.error) {\n      errHandler = observer.error.bind(observer);\n    }\n\n    const asyncObserver = new AsyncObserver<ViewSnapshot>({\n      next: (result: ViewSnapshot): void => {\n        if (observer.next) {\n          observer.next(\n            new QuerySnapshot(\n              this.firestore,\n              this._query,\n              result,\n              this._converter\n            )\n          );\n        }\n      },\n      error: errHandler\n    });\n\n    const firestoreClient = this.firestore.ensureClientConfigured();\n    const internalListener = firestoreClient.listen(\n      this._query,\n      asyncObserver,\n      options\n    );\n    return (): void => {\n      asyncObserver.mute();\n      firestoreClient.unlisten(internalListener);\n    };\n  }\n\n  private validateHasExplicitOrderByForLimitToLast(query: InternalQuery): void {\n    if (query.hasLimitToLast() && query.explicitOrderBy.length === 0) {\n      throw new FirestoreError(\n        Code.UNIMPLEMENTED,\n        'limitToLast() queries require specifying at least one orderBy() clause'\n      );\n    }\n  }\n\n  get(options?: firestore.GetOptions): Promise<firestore.QuerySnapshot<T>> {\n    validateBetweenNumberOfArgs('Query.get', arguments, 0, 1);\n    validateGetOptions('Query.get', options);\n    this.validateHasExplicitOrderByForLimitToLast(this._query);\n    return new Promise(\n      (resolve: Resolver<firestore.QuerySnapshot<T>>, reject: Rejecter) => {\n        if (options && options.source === 'cache') {\n          this.firestore\n            .ensureClientConfigured()\n            .getDocumentsFromLocalCache(this._query)\n            .then((viewSnap: ViewSnapshot) => {\n              resolve(\n                new QuerySnapshot(\n                  this.firestore,\n                  this._query,\n                  viewSnap,\n                  this._converter\n                )\n              );\n            }, reject);\n        } else {\n          this.getViaSnapshotListener(resolve, reject, options);\n        }\n      }\n    );\n  }\n\n  private getViaSnapshotListener(\n    resolve: Resolver<firestore.QuerySnapshot<T>>,\n    reject: Rejecter,\n    options?: firestore.GetOptions\n  ): void {\n    const unlisten = this.onSnapshotInternal(\n      {\n        includeMetadataChanges: true,\n        waitForSyncWhenOnline: true\n      },\n      {\n        next: (result: firestore.QuerySnapshot<T>) => {\n          // Remove query first before passing event to user to avoid\n          // user actions affecting the now stale query.\n          unlisten();\n\n          if (\n            result.metadata.fromCache &&\n            options &&\n            options.source === 'server'\n          ) {\n            reject(\n              new FirestoreError(\n                Code.UNAVAILABLE,\n                'Failed to get documents from server. (However, these ' +\n                  'documents may exist in the local cache. Run again ' +\n                  'without setting source to \"server\" to ' +\n                  'retrieve the cached documents.)'\n              )\n            );\n          } else {\n            resolve(result);\n          }\n        },\n        error: reject\n      }\n    );\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   */\n  private parseDocumentIdValue(documentIdValue: unknown): api.Value {\n    if (typeof documentIdValue === 'string') {\n      if (documentIdValue === '') {\n        throw new FirestoreError(\n          Code.INVALID_ARGUMENT,\n          'Invalid query. When querying with FieldPath.documentId(), you ' +\n            'must provide a valid document ID, but it was an empty string.'\n        );\n      }\n      if (\n        !this._query.isCollectionGroupQuery() &&\n        documentIdValue.indexOf('/') !== -1\n      ) {\n        throw new FirestoreError(\n          Code.INVALID_ARGUMENT,\n          `Invalid query. When querying a collection by ` +\n            `FieldPath.documentId(), you must provide a plain document ID, but ` +\n            `'${documentIdValue}' contains a '/' character.`\n        );\n      }\n      const path = this._query.path.child(\n        ResourcePath.fromString(documentIdValue)\n      );\n      if (!DocumentKey.isDocumentKey(path)) {\n        throw new FirestoreError(\n          Code.INVALID_ARGUMENT,\n          `Invalid query. When querying a collection group by ` +\n            `FieldPath.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(this.firestore._databaseId, new DocumentKey(path));\n    } else if (documentIdValue instanceof DocumentReference) {\n      const ref = documentIdValue as DocumentReference<T>;\n      return refValue(this.firestore._databaseId, ref._key);\n    } else {\n      throw new FirestoreError(\n        Code.INVALID_ARGUMENT,\n        `Invalid query. When querying with FieldPath.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 disjunctrive filter satisfies all\n   * array requirements.\n   */\n  private 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    if (value.indexOf(null) >= 0) {\n      throw new FirestoreError(\n        Code.INVALID_ARGUMENT,\n        `Invalid Query. '${operator.toString()}' filters cannot contain 'null' ` +\n          'in the value array.'\n      );\n    }\n    if (value.filter(element => Number.isNaN(element)).length > 0) {\n      throw new FirestoreError(\n        Code.INVALID_ARGUMENT,\n        `Invalid Query. '${operator.toString()}' filters cannot contain 'NaN' ` +\n          'in the value array.'\n      );\n    }\n  }\n\n  private validateNewFilter(filter: Filter): void {\n    if (filter instanceof FieldFilter) {\n      const arrayOps = [Operator.ARRAY_CONTAINS, Operator.ARRAY_CONTAINS_ANY];\n      const disjunctiveOps = [Operator.IN, Operator.ARRAY_CONTAINS_ANY];\n      const isArrayOp = arrayOps.indexOf(filter.op) >= 0;\n      const isDisjunctiveOp = disjunctiveOps.indexOf(filter.op) >= 0;\n\n      if (filter.isInequality()) {\n        const existingField = this._query.getInequalityFilterField();\n        if (existingField !== null && !existingField.isEqual(filter.field)) {\n          throw new FirestoreError(\n            Code.INVALID_ARGUMENT,\n            'Invalid query. All where filters with an inequality' +\n              ' (<, <=, >, or >=) must be on the same field. But you have' +\n              ` inequality filters on '${existingField.toString()}'` +\n              ` and '${filter.field.toString()}'`\n          );\n        }\n\n        const firstOrderByField = this._query.getFirstOrderByField();\n        if (firstOrderByField !== null) {\n          this.validateOrderByAndInequalityMatch(\n            filter.field,\n            firstOrderByField\n          );\n        }\n      } else if (isDisjunctiveOp || isArrayOp) {\n        // You can have at most 1 disjunctive filter and 1 array filter. Check if\n        // the new filter conflicts with an existing one.\n        let conflictingOp: Operator | null = null;\n        if (isDisjunctiveOp) {\n          conflictingOp = this._query.findFilterOperator(disjunctiveOps);\n        }\n        if (conflictingOp === null && isArrayOp) {\n          conflictingOp = this._query.findFilterOperator(arrayOps);\n        }\n        if (conflictingOp != null) {\n          // We special case when it's a duplicate op to give a slightly clearer error message.\n          if (conflictingOp === filter.op) {\n            throw new FirestoreError(\n              Code.INVALID_ARGUMENT,\n              'Invalid query. You cannot use more than one ' +\n                `'${filter.op.toString()}' filter.`\n            );\n          } else {\n            throw new FirestoreError(\n              Code.INVALID_ARGUMENT,\n              `Invalid query. You cannot use '${filter.op.toString()}' filters ` +\n                `with '${conflictingOp.toString()}' filters.`\n            );\n          }\n        }\n      }\n    }\n  }\n\n  private validateNewOrderBy(orderBy: OrderBy): void {\n    if (this._query.getFirstOrderByField() === null) {\n      // This is the first order by. It must match any inequality.\n      const inequalityField = this._query.getInequalityFilterField();\n      if (inequalityField !== null) {\n        this.validateOrderByAndInequalityMatch(inequalityField, orderBy.field);\n      }\n    }\n  }\n\n  private validateOrderByAndInequalityMatch(\n    inequality: FieldPath,\n    orderBy: FieldPath\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          `(<, <=, >, or >=) on field '${inequality.toString()}' ` +\n          `and so you must also use '${inequality.toString()}' ` +\n          `as your first Query.orderBy(), but your first Query.orderBy() ` +\n          `is on field '${orderBy.toString()}' instead.`\n      );\n    }\n  }\n}\n\nexport class QuerySnapshot<T = firestore.DocumentData>\n  implements firestore.QuerySnapshot<T> {\n  private _cachedChanges: Array<firestore.DocumentChange<T>> | null = null;\n  private _cachedChangesIncludeMetadataChanges: boolean | null = null;\n\n  readonly metadata: firestore.SnapshotMetadata;\n\n  constructor(\n    private readonly _firestore: Firestore,\n    private readonly _originalQuery: InternalQuery,\n    private readonly _snapshot: ViewSnapshot,\n    private readonly _converter?: firestore.FirestoreDataConverter<T>\n  ) {\n    this.metadata = new SnapshotMetadata(\n      _snapshot.hasPendingWrites,\n      _snapshot.fromCache\n    );\n  }\n\n  get docs(): Array<firestore.QueryDocumentSnapshot<T>> {\n    const result: Array<firestore.QueryDocumentSnapshot<T>> = [];\n    this.forEach(doc => result.push(doc));\n    return result;\n  }\n\n  get empty(): boolean {\n    return this._snapshot.docs.isEmpty();\n  }\n\n  get size(): number {\n    return this._snapshot.docs.size;\n  }\n\n  forEach(\n    callback: (result: firestore.QueryDocumentSnapshot<T>) => void,\n    thisArg?: unknown\n  ): void {\n    validateBetweenNumberOfArgs('QuerySnapshot.forEach', arguments, 1, 2);\n    validateArgType('QuerySnapshot.forEach', 'function', 1, callback);\n    this._snapshot.docs.forEach(doc => {\n      callback.call(thisArg, this.convertToDocumentImpl(doc));\n    });\n  }\n\n  get query(): firestore.Query<T> {\n    return new Query(this._originalQuery, this._firestore, this._converter);\n  }\n\n  docChanges(\n    options?: firestore.SnapshotListenOptions\n  ): Array<firestore.DocumentChange<T>> {\n    if (options) {\n      validateOptionNames('QuerySnapshot.docChanges', options, [\n        'includeMetadataChanges'\n      ]);\n      validateNamedOptionalType(\n        'QuerySnapshot.docChanges',\n        'boolean',\n        'includeMetadataChanges',\n        options.includeMetadataChanges\n      );\n    }\n\n    const includeMetadataChanges = !!(\n      options && options.includeMetadataChanges\n    );\n\n    if (includeMetadataChanges && this._snapshot.excludesMetadataChanges) {\n      throw new FirestoreError(\n        Code.INVALID_ARGUMENT,\n        'To include metadata changes with your document changes, you must ' +\n          'also pass { includeMetadataChanges:true } to onSnapshot().'\n      );\n    }\n\n    if (\n      !this._cachedChanges ||\n      this._cachedChangesIncludeMetadataChanges !== includeMetadataChanges\n    ) {\n      this._cachedChanges = changesFromSnapshot<T>(\n        this._firestore,\n        includeMetadataChanges,\n        this._snapshot,\n        this._converter\n      );\n      this._cachedChangesIncludeMetadataChanges = includeMetadataChanges;\n    }\n\n    return this._cachedChanges;\n  }\n\n  /** Check the equality. The call can be very expensive. */\n  isEqual(other: firestore.QuerySnapshot<T>): boolean {\n    if (!(other instanceof QuerySnapshot)) {\n      throw invalidClassError('isEqual', 'QuerySnapshot', 1, other);\n    }\n\n    return (\n      this._firestore === other._firestore &&\n      this._originalQuery.isEqual(other._originalQuery) &&\n      this._snapshot.isEqual(other._snapshot) &&\n      this._converter === other._converter\n    );\n  }\n\n  private convertToDocumentImpl(doc: Document): QueryDocumentSnapshot<T> {\n    return new QueryDocumentSnapshot(\n      this._firestore,\n      doc.key,\n      doc,\n      this.metadata.fromCache,\n      this._snapshot.mutatedKeys.has(doc.key),\n      this._converter\n    );\n  }\n}\n\nexport class CollectionReference<T = firestore.DocumentData> extends Query<T>\n  implements firestore.CollectionReference<T> {\n  constructor(\n    readonly _path: ResourcePath,\n    firestore: Firestore,\n    _converter?: firestore.FirestoreDataConverter<T>\n  ) {\n    super(InternalQuery.atPath(_path), firestore, _converter);\n    if (_path.length % 2 !== 1) {\n      throw new FirestoreError(\n        Code.INVALID_ARGUMENT,\n        'Invalid collection reference. Collection ' +\n          'references must have an odd number of segments, but ' +\n          `${_path.canonicalString()} has ${_path.length}`\n      );\n    }\n  }\n\n  get id(): string {\n    return this._query.path.lastSegment();\n  }\n\n  get parent(): firestore.DocumentReference<firestore.DocumentData> | null {\n    const parentPath = this._query.path.popLast();\n    if (parentPath.isEmpty()) {\n      return null;\n    } else {\n      return new DocumentReference<firestore.DocumentData>(\n        new DocumentKey(parentPath),\n        this.firestore\n      );\n    }\n  }\n\n  get path(): string {\n    return this._query.path.canonicalString();\n  }\n\n  doc(pathString?: string): firestore.DocumentReference<T> {\n    validateBetweenNumberOfArgs('CollectionReference.doc', arguments, 0, 1);\n    // We allow omission of 'pathString' but explicitly prohibit passing in both\n    // 'undefined' and 'null'.\n    if (arguments.length === 0) {\n      pathString = AutoId.newId();\n    }\n    validateArgType(\n      'CollectionReference.doc',\n      'non-empty string',\n      1,\n      pathString\n    );\n    if (pathString === '') {\n      throw new FirestoreError(\n        Code.INVALID_ARGUMENT,\n        'Document path must be a non-empty string'\n      );\n    }\n    const path = ResourcePath.fromString(pathString!);\n    return DocumentReference.forPath<T>(\n      this._query.path.child(path),\n      this.firestore,\n      this._converter\n    );\n  }\n\n  add(value: T): Promise<firestore.DocumentReference<T>> {\n    validateExactNumberOfArgs('CollectionReference.add', arguments, 1);\n    const convertedValue = this._converter\n      ? this._converter.toFirestore(value)\n      : value;\n    validateArgType('CollectionReference.add', 'object', 1, convertedValue);\n    const docRef = this.doc();\n    return docRef.set(value).then(() => docRef);\n  }\n\n  withConverter<U>(\n    converter: firestore.FirestoreDataConverter<U>\n  ): firestore.CollectionReference<U> {\n    return new CollectionReference<U>(this._path, this.firestore, converter);\n  }\n}\n\nfunction validateSetOptions(\n  methodName: string,\n  options: firestore.SetOptions | undefined\n): firestore.SetOptions {\n  if (options === undefined) {\n    return {\n      merge: false\n    };\n  }\n\n  validateOptionNames(methodName, options, ['merge', 'mergeFields']);\n  validateNamedOptionalType(methodName, 'boolean', 'merge', options.merge);\n  validateOptionalArrayElements(\n    methodName,\n    'mergeFields',\n    'a string or a FieldPath',\n    options.mergeFields,\n    element =>\n      typeof element === 'string' || element instanceof ExternalFieldPath\n  );\n\n  if (options.mergeFields !== undefined && options.merge !== undefined) {\n    throw new FirestoreError(\n      Code.INVALID_ARGUMENT,\n      `Invalid options passed to function ${methodName}(): You cannot specify both \"merge\" ` +\n        `and \"mergeFields\".`\n    );\n  }\n\n  return options;\n}\n\nfunction validateSnapshotOptions(\n  methodName: string,\n  options: firestore.SnapshotOptions | undefined\n): firestore.SnapshotOptions {\n  if (options === undefined) {\n    return {};\n  }\n\n  validateOptionNames(methodName, options, ['serverTimestamps']);\n  validateNamedOptionalPropertyEquals(\n    methodName,\n    'options',\n    'serverTimestamps',\n    options.serverTimestamps,\n    ['estimate', 'previous', 'none']\n  );\n  return options;\n}\n\nfunction validateGetOptions(\n  methodName: string,\n  options: firestore.GetOptions | undefined\n): void {\n  validateOptionalArgType(methodName, 'object', 1, options);\n  if (options) {\n    validateOptionNames(methodName, options, ['source']);\n    validateNamedOptionalPropertyEquals(\n      methodName,\n      'options',\n      'source',\n      options.source,\n      ['default', 'server', 'cache']\n    );\n  }\n}\n\nfunction validateReference<T>(\n  methodName: string,\n  documentRef: firestore.DocumentReference<T>,\n  firestore: Firestore\n): DocumentReference<T> {\n  if (!(documentRef instanceof DocumentReference)) {\n    throw invalidClassError(methodName, 'DocumentReference', 1, documentRef);\n  } else 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;\n  }\n}\n\n/**\n * Calculates the array of firestore.DocumentChange's for a given ViewSnapshot.\n *\n * Exported for testing.\n */\nexport function changesFromSnapshot<T>(\n  firestore: Firestore,\n  includeMetadataChanges: boolean,\n  snapshot: ViewSnapshot,\n  converter?: firestore.FirestoreDataConverter<T>\n): Array<firestore.DocumentChange<T>> {\n  if (snapshot.oldDocs.isEmpty()) {\n    // Special case the first snapshot because index calculation is easy and\n    // fast\n    let lastDoc: Document;\n    let index = 0;\n    return snapshot.docChanges.map(change => {\n      const doc = new QueryDocumentSnapshot<T>(\n        firestore,\n        change.doc.key,\n        change.doc,\n        snapshot.fromCache,\n        snapshot.mutatedKeys.has(change.doc.key),\n        converter\n      );\n      debugAssert(\n        change.type === ChangeType.Added,\n        'Invalid event type for first snapshot'\n      );\n      debugAssert(\n        !lastDoc || snapshot.query.docComparator(lastDoc, change.doc) < 0,\n        'Got added events in wrong order'\n      );\n      lastDoc = change.doc;\n      return {\n        type: 'added' as firestore.DocumentChangeType,\n        doc,\n        oldIndex: -1,\n        newIndex: index++\n      };\n    });\n  } else {\n    // A DocumentSet that is updated incrementally as changes are applied to use\n    // to lookup the index of a document.\n    let indexTracker = snapshot.oldDocs;\n    return snapshot.docChanges\n      .filter(\n        change => includeMetadataChanges || change.type !== ChangeType.Metadata\n      )\n      .map(change => {\n        const doc = new QueryDocumentSnapshot<T>(\n          firestore,\n          change.doc.key,\n          change.doc,\n          snapshot.fromCache,\n          snapshot.mutatedKeys.has(change.doc.key),\n          converter\n        );\n        let oldIndex = -1;\n        let newIndex = -1;\n        if (change.type !== ChangeType.Added) {\n          oldIndex = indexTracker.indexOf(change.doc.key);\n          debugAssert(oldIndex >= 0, 'Index for document not found');\n          indexTracker = indexTracker.delete(change.doc.key);\n        }\n        if (change.type !== ChangeType.Removed) {\n          indexTracker = indexTracker.add(change.doc);\n          newIndex = indexTracker.indexOf(change.doc.key);\n        }\n        return { type: resultChangeType(change.type), doc, oldIndex, newIndex };\n      });\n  }\n}\n\nfunction resultChangeType(type: ChangeType): firestore.DocumentChangeType {\n  switch (type) {\n    case ChangeType.Added:\n      return 'added';\n    case ChangeType.Modified:\n    case ChangeType.Metadata:\n      return 'modified';\n    case ChangeType.Removed:\n      return 'removed';\n    default:\n      return fail('Unknown change type: ' + type);\n  }\n}\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 */\nfunction applyFirestoreDataConverter<T>(\n  converter: firestore.FirestoreDataConverter<T> | undefined,\n  value: T,\n  functionName: string\n): [firestore.DocumentData, string] {\n  let convertedValue;\n  if (converter) {\n    convertedValue = converter.toFirestore(value);\n    functionName = 'toFirestore() in ' + functionName;\n  } else {\n    convertedValue = value as firestore.DocumentData;\n  }\n  return [convertedValue, functionName];\n}\n\nfunction contains(obj: object, key: string): obj is { key: unknown } {\n  return Object.prototype.hasOwnProperty.call(obj, key);\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 './error';\n\n/**\n * Helper function to prevent instantiation through the constructor.\n *\n * This method creates a new constructor that throws when it's invoked.\n * The prototype of that constructor is then set to the prototype of the hidden\n * \"class\" to expose all the prototype methods and allow for instanceof\n * checks.\n *\n * To also make all the static methods available, all properties of the\n * original constructor are copied to the new constructor.\n */\nexport function makeConstructorPrivate<T extends Function>(\n  cls: T,\n  optionalMessage?: string\n): T {\n  function PublicConstructor(): never {\n    let error = 'This constructor is private.';\n    if (optionalMessage) {\n      error += ' ';\n      error += optionalMessage;\n    }\n    throw new FirestoreError(Code.INVALID_ARGUMENT, error);\n  }\n\n  // Make sure instanceof checks work and all methods are exposed on the public\n  // constructor\n  PublicConstructor.prototype = cls.prototype;\n\n  // Copy any static methods/members\n  Object.assign(PublicConstructor, cls);\n\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  return PublicConstructor as any;\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 { FirebaseApp, FirebaseNamespace } from '@firebase/app-types';\nimport { FirebaseAuthInternalName } from '@firebase/auth-interop-types';\nimport { _FirebaseNamespace } from '@firebase/app-types/private';\nimport { Component, ComponentType, Provider } from '@firebase/component';\nimport {\n  CACHE_SIZE_UNLIMITED,\n  Firestore,\n  DocumentReference,\n  DocumentSnapshot,\n  QueryDocumentSnapshot,\n  Query,\n  QuerySnapshot,\n  CollectionReference,\n  Transaction,\n  WriteBatch\n} from '../api/database';\nimport { Blob } from '../api/blob';\nimport { FieldPath } from '../api/field_path';\nimport { GeoPoint } from '../api/geo_point';\nimport { Timestamp } from '../api/timestamp';\nimport { makeConstructorPrivate } from '../util/api';\nimport { FieldValue } from '../api/field_value';\n\n// Public instance that disallows construction at runtime. Note that this still\n// allows instanceof checks.\nexport const PublicFirestore = makeConstructorPrivate(\n  Firestore,\n  'Use firebase.firestore() instead.'\n);\nexport const PublicTransaction = makeConstructorPrivate(\n  Transaction,\n  'Use firebase.firestore().runTransaction() instead.'\n);\nexport const PublicWriteBatch = makeConstructorPrivate(\n  WriteBatch,\n  'Use firebase.firestore().batch() instead.'\n);\nexport const PublicDocumentReference = makeConstructorPrivate(\n  DocumentReference,\n  'Use firebase.firestore().doc() instead.'\n);\nexport const PublicDocumentSnapshot = makeConstructorPrivate(DocumentSnapshot);\nexport const PublicQueryDocumentSnapshot = makeConstructorPrivate(\n  QueryDocumentSnapshot\n);\nexport const PublicQuery = makeConstructorPrivate(Query);\nexport const PublicQuerySnapshot = makeConstructorPrivate(QuerySnapshot);\nexport const PublicCollectionReference = makeConstructorPrivate(\n  CollectionReference,\n  'Use firebase.firestore().collection() instead.'\n);\nexport const PublicFieldValue = makeConstructorPrivate(\n  FieldValue,\n  'Use FieldValue.<field>() instead.'\n);\nexport const PublicBlob = makeConstructorPrivate(\n  Blob,\n  'Use Blob.fromUint8Array() or Blob.fromBase64String() instead.'\n);\n\nconst firestoreNamespace = {\n  Firestore: PublicFirestore,\n  GeoPoint,\n  Timestamp,\n  Blob: PublicBlob,\n  Transaction: PublicTransaction,\n  WriteBatch: PublicWriteBatch,\n  DocumentReference: PublicDocumentReference,\n  DocumentSnapshot: PublicDocumentSnapshot,\n  Query: PublicQuery,\n  QueryDocumentSnapshot: PublicQueryDocumentSnapshot,\n  QuerySnapshot: PublicQuerySnapshot,\n  CollectionReference: PublicCollectionReference,\n  FieldPath,\n  FieldValue: PublicFieldValue,\n  setLogLevel: Firestore.setLogLevel,\n  CACHE_SIZE_UNLIMITED\n};\n\n/**\n * Configures Firestore as part of the Firebase SDK by calling registerService.\n *\n * @param firebase The FirebaseNamespace to register Firestore with\n * @param firestoreFactory A factory function that returns a new Firestore\n *    instance.\n */\nexport function configureForFirebase(\n  firebase: FirebaseNamespace,\n  firestoreFactory: (\n    app: FirebaseApp,\n    auth: Provider<FirebaseAuthInternalName>\n  ) => Firestore\n): void {\n  (firebase as _FirebaseNamespace).INTERNAL.registerComponent(\n    new Component(\n      'firestore',\n      container => {\n        const app = container.getProvider('app').getImmediate()!;\n        return firestoreFactory(app, container.getProvider('auth-internal'));\n      },\n      ComponentType.PUBLIC\n    ).setServiceProps({ ...firestoreNamespace })\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 { ConnectivityMonitor, NetworkStatus } from './connectivity_monitor';\n\nexport class NoopConnectivityMonitor implements ConnectivityMonitor {\n  addCallback(callback: (status: NetworkStatus) => void): void {\n    // No-op.\n  }\n\n  shutdown(): void {\n    // No-op.\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 { logDebug } from '../util/log';\nimport {\n  ConnectivityMonitor,\n  ConnectivityMonitorCallback,\n  NetworkStatus\n} from './../remote/connectivity_monitor';\n\n// References to `window` are guarded by BrowserConnectivityMonitor.isAvailable()\n/* eslint-disable no-restricted-globals */\n\nconst LOG_TAG = 'ConnectivityMonitor';\n\n/**\n * Browser implementation of ConnectivityMonitor.\n */\nexport class BrowserConnectivityMonitor implements ConnectivityMonitor {\n  private readonly networkAvailableListener = (): void =>\n    this.onNetworkAvailable();\n  private readonly networkUnavailableListener = (): void =>\n    this.onNetworkUnavailable();\n  private callbacks: ConnectivityMonitorCallback[] = [];\n\n  constructor() {\n    this.configureNetworkMonitoring();\n  }\n\n  addCallback(callback: (status: NetworkStatus) => void): void {\n    this.callbacks.push(callback);\n  }\n\n  shutdown(): void {\n    window.removeEventListener('online', this.networkAvailableListener);\n    window.removeEventListener('offline', this.networkUnavailableListener);\n  }\n\n  private configureNetworkMonitoring(): void {\n    window.addEventListener('online', this.networkAvailableListener);\n    window.addEventListener('offline', this.networkUnavailableListener);\n  }\n\n  private onNetworkAvailable(): void {\n    logDebug(LOG_TAG, 'Network connectivity changed: AVAILABLE');\n    for (const callback of this.callbacks) {\n      callback(NetworkStatus.AVAILABLE);\n    }\n  }\n\n  private onNetworkUnavailable(): void {\n    logDebug(LOG_TAG, 'Network connectivity changed: UNAVAILABLE');\n    for (const callback of this.callbacks) {\n      callback(NetworkStatus.UNAVAILABLE);\n    }\n  }\n\n  // TODO(chenbrian): Consider passing in window either into this component or\n  // here for testing via FakeWindow.\n  /** Checks that all used attributes of window are available. */\n  static isAvailable(): boolean {\n    return (\n      typeof window !== 'undefined' &&\n      window.addEventListener !== undefined &&\n      window.removeEventListener !== undefined\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 { debugAssert } from '../util/assert';\nimport { FirestoreError } from '../util/error';\n\nimport { Stream } from './connection';\n\n/**\n * Provides a simple helper class that implements the Stream interface to\n * bridge to other implementations that are streams but do not implement the\n * interface. The stream callbacks are invoked with the callOn... methods.\n */\nexport class StreamBridge<I, O> implements Stream<I, O> {\n  private wrappedOnOpen: (() => void) | undefined;\n  private wrappedOnClose: ((err?: FirestoreError) => void) | undefined;\n  private wrappedOnMessage: ((msg: O) => void) | undefined;\n\n  private sendFn: (msg: I) => void;\n  private closeFn: () => void;\n\n  constructor(args: { sendFn: (msg: I) => void; closeFn: () => void }) {\n    this.sendFn = args.sendFn;\n    this.closeFn = args.closeFn;\n  }\n\n  onOpen(callback: () => void): void {\n    debugAssert(!this.wrappedOnOpen, 'Called onOpen on stream twice!');\n    this.wrappedOnOpen = callback;\n  }\n\n  onClose(callback: (err?: FirestoreError) => void): void {\n    debugAssert(!this.wrappedOnClose, 'Called onClose on stream twice!');\n    this.wrappedOnClose = callback;\n  }\n\n  onMessage(callback: (msg: O) => void): void {\n    debugAssert(!this.wrappedOnMessage, 'Called onMessage on stream twice!');\n    this.wrappedOnMessage = callback;\n  }\n\n  close(): void {\n    this.closeFn();\n  }\n\n  send(msg: I): void {\n    this.sendFn(msg);\n  }\n\n  callOnOpen(): void {\n    debugAssert(\n      this.wrappedOnOpen !== undefined,\n      'Cannot call onOpen because no callback was set'\n    );\n    this.wrappedOnOpen();\n  }\n\n  callOnClose(err?: FirestoreError): void {\n    debugAssert(\n      this.wrappedOnClose !== undefined,\n      'Cannot call onClose because no callback was set'\n    );\n    this.wrappedOnClose(err);\n  }\n\n  callOnMessage(msg: O): void {\n    debugAssert(\n      this.wrappedOnMessage !== undefined,\n      'Cannot call onMessage because no callback was set'\n    );\n    this.wrappedOnMessage(msg);\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  createWebChannelTransport,\n  ErrorCode,\n  EventType,\n  WebChannel,\n  WebChannelError,\n  WebChannelOptions,\n  XhrIo\n} from '@firebase/webchannel-wrapper';\n\nimport {\n  isBrowserExtension,\n  isElectron,\n  isIE,\n  isMobileCordova,\n  isReactNative,\n  isUWP\n} from '@firebase/util';\n\nimport { Token } from '../api/credentials';\nimport { DatabaseId, DatabaseInfo } from '../core/database_info';\nimport { SDK_VERSION } from '../core/version';\nimport { Connection, Stream } from '../remote/connection';\nimport {\n  mapCodeFromRpcStatus,\n  mapCodeFromHttpResponseErrorStatus\n} from '../remote/rpc_error';\nimport { StreamBridge } from '../remote/stream_bridge';\nimport { debugAssert, fail, hardAssert } from '../util/assert';\nimport { Code, FirestoreError } from '../util/error';\nimport { logDebug } from '../util/log';\nimport { Indexable } from '../util/misc';\nimport { Rejecter, Resolver } from '../util/promise';\nimport { StringMap } from '../util/types';\n\nconst LOG_TAG = 'Connection';\n\nconst RPC_STREAM_SERVICE = 'google.firestore.v1.Firestore';\nconst RPC_URL_VERSION = 'v1';\n\n/**\n * Maps RPC names to the corresponding REST endpoint name.\n * Uses Object Literal notation to avoid renaming.\n */\nconst RPC_NAME_REST_MAPPING: { [key: string]: string } = {};\nRPC_NAME_REST_MAPPING['BatchGetDocuments'] = 'batchGet';\nRPC_NAME_REST_MAPPING['Commit'] = 'commit';\n\n// TODO(b/38203344): The SDK_VERSION is set independently from Firebase because\n// we are doing out-of-band releases. Once we release as part of Firebase, we\n// should use the Firebase version instead.\nconst X_GOOG_API_CLIENT_VALUE = 'gl-js/ fire/' + SDK_VERSION;\n\nconst XHR_TIMEOUT_SECS = 15;\n\nexport class WebChannelConnection implements Connection {\n  private readonly databaseId: DatabaseId;\n  private readonly baseUrl: string;\n  private readonly forceLongPolling: boolean;\n\n  constructor(info: DatabaseInfo) {\n    this.databaseId = info.databaseId;\n    const proto = info.ssl ? 'https' : 'http';\n    this.baseUrl = proto + '://' + info.host;\n    this.forceLongPolling = info.forceLongPolling;\n  }\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  private modifyHeadersForRequest(\n    headers: StringMap,\n    token: Token | null\n  ): void {\n    if (token) {\n      for (const header in token.authHeaders) {\n        if (token.authHeaders.hasOwnProperty(header)) {\n          headers[header] = token.authHeaders[header];\n        }\n      }\n    }\n    headers['X-Goog-Api-Client'] = X_GOOG_API_CLIENT_VALUE;\n  }\n\n  invokeRPC<Req, Resp>(\n    rpcName: string,\n    request: Req,\n    token: Token | null\n  ): Promise<Resp> {\n    const url = this.makeUrl(rpcName);\n\n    return new Promise((resolve: Resolver<Resp>, reject: Rejecter) => {\n      const xhr = new XhrIo();\n      xhr.listenOnce(EventType.COMPLETE, () => {\n        try {\n          switch (xhr.getLastErrorCode()) {\n            case ErrorCode.NO_ERROR:\n              const json = xhr.getResponseJson() as Resp;\n              logDebug(LOG_TAG, 'XHR received:', JSON.stringify(json));\n              resolve(json);\n              break;\n            case ErrorCode.TIMEOUT:\n              logDebug(LOG_TAG, 'RPC \"' + rpcName + '\" timed out');\n              reject(\n                new FirestoreError(Code.DEADLINE_EXCEEDED, 'Request time out')\n              );\n              break;\n            case ErrorCode.HTTP_ERROR:\n              const status = xhr.getStatus();\n              logDebug(\n                LOG_TAG,\n                'RPC \"' + rpcName + '\" failed with status:',\n                status,\n                'response text:',\n                xhr.getResponseText()\n              );\n              if (status > 0) {\n                const responseError = (xhr.getResponseJson() as WebChannelError)\n                  .error;\n                if (\n                  !!responseError &&\n                  !!responseError.status &&\n                  !!responseError.message\n                ) {\n                  const firestoreErrorCode = mapCodeFromHttpResponseErrorStatus(\n                    responseError.status\n                  );\n                  reject(\n                    new FirestoreError(\n                      firestoreErrorCode,\n                      responseError.message\n                    )\n                  );\n                } else {\n                  reject(\n                    new FirestoreError(\n                      Code.UNKNOWN,\n                      'Server responded with status ' + xhr.getStatus()\n                    )\n                  );\n                }\n              } else {\n                // If we received an HTTP_ERROR but there's no status code,\n                // it's most probably a connection issue\n                logDebug(LOG_TAG, 'RPC \"' + rpcName + '\" failed');\n                reject(\n                  new FirestoreError(Code.UNAVAILABLE, 'Connection failed.')\n                );\n              }\n              break;\n            default:\n              fail(\n                'RPC \"' +\n                  rpcName +\n                  '\" failed with unanticipated ' +\n                  'webchannel error ' +\n                  xhr.getLastErrorCode() +\n                  ': ' +\n                  xhr.getLastError() +\n                  ', giving up.'\n              );\n          }\n        } finally {\n          logDebug(LOG_TAG, 'RPC \"' + rpcName + '\" completed.');\n        }\n      });\n\n      // The database field is already encoded in URL. Specifying it again in\n      // the body is not necessary in production, and will cause duplicate field\n      // errors in the Firestore Emulator. Let's remove it.\n      const jsonObj = ({ ...request } as unknown) as Indexable;\n      delete jsonObj.database;\n\n      const requestString = JSON.stringify(jsonObj);\n      logDebug(LOG_TAG, 'XHR sending: ', url + ' ' + requestString);\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\n      // $httpOverwrite parameter supported by ESF to avoid\n      // triggering preflight requests.\n      const headers: StringMap = { 'Content-Type': 'text/plain' };\n\n      this.modifyHeadersForRequest(headers, token);\n\n      xhr.send(url, 'POST', requestString, headers, XHR_TIMEOUT_SECS);\n    });\n  }\n\n  invokeStreamingRPC<Req, Resp>(\n    rpcName: string,\n    request: Req,\n    token: Token | null\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[]>(rpcName, request, token);\n  }\n\n  openStream<Req, Resp>(\n    rpcName: string,\n    token: Token | null\n  ): Stream<Req, Resp> {\n    const urlParts = [\n      this.baseUrl,\n      '/',\n      RPC_STREAM_SERVICE,\n      '/',\n      rpcName,\n      '/channel'\n    ];\n    const webchannelTransport = createWebChannelTransport();\n    const request: WebChannelOptions = {\n      // Required for backend stickiness, routing behavior is based on this\n      // parameter.\n      httpSessionIdParam: 'gsessionid',\n      initMessageHeaders: {},\n      messageUrlParams: {\n        // This param is used to improve routing and project isolation by the\n        // backend and must be included in every request.\n        database: `projects/${this.databaseId.projectId}/databases/${this.databaseId.database}`\n      },\n      sendRawJson: true,\n      supportsCrossDomainXhr: true,\n      internalChannelParams: {\n        // Override the default timeout (randomized between 10-20 seconds) since\n        // a large write batch on a slow internet connection may take a long\n        // time to send to the backend. Rather than have WebChannel impose a\n        // tight timeout which could lead to infinite timeouts and retries, we\n        // set it very large (5-10 minutes) and rely on the browser's builtin\n        // timeouts to kick in if the request isn't working.\n        forwardChannelRequestTimeoutMs: 10 * 60 * 1000\n      },\n      forceLongPolling: this.forceLongPolling\n    };\n\n    this.modifyHeadersForRequest(request.initMessageHeaders!, token);\n\n    // Sending the custom headers we just added to request.initMessageHeaders\n    // (Authorization, etc.) will trigger the browser to make a CORS preflight\n    // request because the XHR will no longer meet the criteria for a \"simple\"\n    // CORS request:\n    // https://developer.mozilla.org/en-US/docs/Web/HTTP/CORS#Simple_requests\n    //\n    // Therefore to avoid the CORS preflight request (an extra network\n    // roundtrip), we use the httpHeadersOverwriteParam option to specify that\n    // the headers should instead be encoded into a special \"$httpHeaders\" query\n    // parameter, which is recognized by the webchannel backend. This is\n    // formally defined here:\n    // https://github.com/google/closure-library/blob/b0e1815b13fb92a46d7c9b3c30de5d6a396a3245/closure/goog/net/rpc/httpcors.js#L32\n    //\n    // TODO(b/145624756): There is a backend bug where $httpHeaders isn't respected if the request\n    // doesn't have an Origin header. So we have to exclude a few browser environments that are\n    // known to (sometimes) not include an Origin. See\n    // https://github.com/firebase/firebase-js-sdk/issues/1491.\n    if (\n      !isMobileCordova() &&\n      !isReactNative() &&\n      !isElectron() &&\n      !isIE() &&\n      !isUWP() &&\n      !isBrowserExtension()\n    ) {\n      request.httpHeadersOverwriteParam = '$httpHeaders';\n    }\n\n    const url = urlParts.join('');\n    logDebug(LOG_TAG, 'Creating WebChannel: ' + url + ' ' + request);\n    const channel = webchannelTransport.createWebChannel(url, request);\n\n    // WebChannel supports sending the first message with the handshake - saving\n    // a network round trip. However, it will have to call send in the same\n    // JS event loop as open. In order to enforce this, we delay actually\n    // opening the WebChannel until send is called. Whether we have called\n    // open is tracked with this variable.\n    let opened = false;\n\n    // A flag to determine whether the stream was closed (by us or through an\n    // error/close event) to avoid delivering multiple close events or sending\n    // on a closed stream\n    let closed = false;\n\n    const streamBridge = new StreamBridge<Req, Resp>({\n      sendFn: (msg: Req) => {\n        if (!closed) {\n          if (!opened) {\n            logDebug(LOG_TAG, 'Opening WebChannel transport.');\n            channel.open();\n            opened = true;\n          }\n          logDebug(LOG_TAG, 'WebChannel sending:', msg);\n          channel.send(msg);\n        } else {\n          logDebug(LOG_TAG, 'Not sending because WebChannel is closed:', msg);\n        }\n      },\n      closeFn: () => channel.close()\n    });\n\n    // Closure events are guarded and exceptions are swallowed, so catch any\n    // exception and rethrow using a setTimeout so they become visible again.\n    // Note that eventually this function could go away if we are confident\n    // enough the code is exception free.\n    const unguardedEventListen = <T>(\n      type: string,\n      fn: (param?: T) => void\n    ): void => {\n      // TODO(dimond): closure typing seems broken because WebChannel does\n      // not implement goog.events.Listenable\n      channel.listen(type, (param: unknown) => {\n        try {\n          fn(param as T);\n        } catch (e) {\n          setTimeout(() => {\n            throw e;\n          }, 0);\n        }\n      });\n    };\n\n    unguardedEventListen(WebChannel.EventType.OPEN, () => {\n      if (!closed) {\n        logDebug(LOG_TAG, 'WebChannel transport opened.');\n      }\n    });\n\n    unguardedEventListen(WebChannel.EventType.CLOSE, () => {\n      if (!closed) {\n        closed = true;\n        logDebug(LOG_TAG, 'WebChannel transport closed');\n        streamBridge.callOnClose();\n      }\n    });\n\n    unguardedEventListen<Error>(WebChannel.EventType.ERROR, err => {\n      if (!closed) {\n        closed = true;\n        logDebug(LOG_TAG, 'WebChannel transport errored:', err);\n        streamBridge.callOnClose(\n          new FirestoreError(\n            Code.UNAVAILABLE,\n            'The operation could not be completed'\n          )\n        );\n      }\n    });\n\n    // WebChannel delivers message events as array. If batching is not enabled\n    // (it's off by default) each message will be delivered alone, resulting in\n    // a single element array.\n    interface WebChannelResponse {\n      data: Resp[];\n    }\n\n    unguardedEventListen<WebChannelResponse>(\n      WebChannel.EventType.MESSAGE,\n      msg => {\n        if (!closed) {\n          const msgData = msg!.data[0];\n          hardAssert(!!msgData, 'Got a webchannel message without data.');\n          // TODO(b/35143891): There is a bug in One Platform that caused errors\n          // (and only errors) to be wrapped in an extra array. To be forward\n          // compatible with the bug we need to check either condition. The latter\n          // can be removed once the fix has been rolled out.\n          // Use any because msgData.error is not typed.\n          const msgDataOrError: WebChannelError | object = msgData;\n          const error =\n            msgDataOrError.error ||\n            (msgDataOrError as WebChannelError[])[0]?.error;\n          if (error) {\n            logDebug(LOG_TAG, 'WebChannel received error:', error);\n            // error.status will be a string like 'OK' or 'NOT_FOUND'.\n            const status: string = error.status;\n            let code = mapCodeFromRpcStatus(status);\n            let message = error.message;\n            if (code === undefined) {\n              code = Code.INTERNAL;\n              message =\n                'Unknown error status: ' +\n                status +\n                ' with message ' +\n                error.message;\n            }\n            // Mark closed so no further events are propagated\n            closed = true;\n            streamBridge.callOnClose(new FirestoreError(code, message));\n            channel.close();\n          } else {\n            logDebug(LOG_TAG, 'WebChannel received:', msgData);\n            streamBridge.callOnMessage(msgData);\n          }\n        }\n      }\n    );\n\n    setTimeout(() => {\n      // Technically we could/should wait for the WebChannel opened event,\n      // but because we want to send the first message with the WebChannel\n      // handshake we pretend the channel opened here (asynchronously), and\n      // then delay the actual open until the first message is sent.\n      streamBridge.callOnOpen();\n    }, 0);\n    return streamBridge;\n  }\n\n  // visible for testing\n  makeUrl(rpcName: string): string {\n    const urlRpcName = RPC_NAME_REST_MAPPING[rpcName];\n    debugAssert(\n      urlRpcName !== undefined,\n      'Unknown REST mapping for: ' + rpcName\n    );\n    return (\n      this.baseUrl +\n      '/' +\n      RPC_URL_VERSION +\n      '/projects/' +\n      this.databaseId.projectId +\n      '/databases/' +\n      this.databaseId.database +\n      '/documents:' +\n      urlRpcName\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 firebase from '@firebase/app';\nimport { FirebaseNamespace } from '@firebase/app-types';\n\nimport { Firestore } from './src/api/database';\nimport { IndexedDbComponentProvider } from './src/core/component_provider';\nimport { configureForFirebase } from './src/platform/config';\nimport { name, version } from './package.json';\n\nimport './register-module';\nimport './src/platform_browser/browser_init';\n\n/**\n * Registers the main Firestore build with the components framework.\n * Persistence can be enabled via `firebase.firestore().enablePersistence()`.\n */\nexport function registerFirestore(instance: FirebaseNamespace): void {\n  configureForFirebase(\n    instance,\n    (app, auth) => new Firestore(app, auth, new IndexedDbComponentProvider())\n  );\n  instance.registerVersion(name, version);\n}\n\nregisterFirestore(firebase);\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 { PlatformSupport } from '../platform/platform';\nimport { BrowserPlatform } from './browser_platform';\n\n/**\n * This code needs to run before Firestore is used. This can be achieved in\n * several ways:\n *   1) Through the JSCompiler compiling this code and then (automatically)\n *      executing it before exporting the Firestore symbols.\n *   2) Through importing this module first in a Firestore main module\n */\nPlatformSupport.setPlatform(new BrowserPlatform());\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 { DatabaseId, DatabaseInfo } from '../core/database_info';\nimport { Platform } from '../platform/platform';\nimport { Connection } from '../remote/connection';\nimport { JsonProtoSerializer } from '../remote/serializer';\nimport { ConnectivityMonitor } from './../remote/connectivity_monitor';\n\nimport { NoopConnectivityMonitor } from '../remote/connectivity_monitor_noop';\nimport { BrowserConnectivityMonitor } from './browser_connectivity_monitor';\nimport { WebChannelConnection } from './webchannel_connection';\nimport { debugAssert } from '../util/assert';\n\n// Implements the Platform API for browsers and some browser-like environments\n// (including ReactNative).\nexport class BrowserPlatform implements Platform {\n  readonly base64Available: boolean;\n\n  constructor() {\n    this.base64Available = typeof atob !== 'undefined';\n  }\n\n  get document(): 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  get window(): 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  loadConnection(databaseInfo: DatabaseInfo): Promise<Connection> {\n    return Promise.resolve(new WebChannelConnection(databaseInfo));\n  }\n\n  newConnectivityMonitor(): ConnectivityMonitor {\n    if (BrowserConnectivityMonitor.isAvailable()) {\n      return new BrowserConnectivityMonitor();\n    } else {\n      return new NoopConnectivityMonitor();\n    }\n  }\n\n  newSerializer(databaseId: DatabaseId): JsonProtoSerializer {\n    return new JsonProtoSerializer(databaseId, { useProto3Json: true });\n  }\n\n  formatJSON(value: unknown): string {\n    return JSON.stringify(value);\n  }\n\n  atob(encoded: string): string {\n    return atob(encoded);\n  }\n\n  btoa(raw: string): string {\n    return btoa(raw);\n  }\n\n  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) {\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"],"names":["SDK_VERSION","firebase","[object Object]","uid","this","__PRIVATE_isAuthenticated","__PRIVATE_otherUser","User","Code","OK","CANCELLED","UNKNOWN","INVALID_ARGUMENT","DEADLINE_EXCEEDED","NOT_FOUND","ALREADY_EXISTS","PERMISSION_DENIED","UNAUTHENTICATED","RESOURCE_EXHAUSTED","FAILED_PRECONDITION","ABORTED","OUT_OF_RANGE","UNIMPLEMENTED","INTERNAL","UNAVAILABLE","DATA_LOSS","code","message","super","toString","name","Error","value","user","__PRIVATE_authHeaders","Authorization","Promise","resolve","__PRIVATE_changeListener","__PRIVATE_authProvider","__PRIVATE_tokenListener","__PRIVATE_tokenCounter","currentUser","__PRIVATE_getUser","__PRIVATE_receivedInitialUser","auth","getImmediate","optional","addAuthTokenListener","I","get","then","__PRIVATE_initialTokenCounter","forceRefresh","getToken","__PRIVATE_tokenData","FirestoreError","__PRIVATE_hardAssert","accessToken","__PRIVATE_OAuthToken","removeAuthTokenListener","__PRIVATE_currentUid","getUid","__PRIVATE_gapi","__PRIVATE_sessionIndex","__PRIVATE_FIRST_PARTY","o","headers","X-Goog-AuthUser","__PRIVATE_authHeader","__PRIVATE_getAuthHeaderValueForFirstParty","__PRIVATE_FirstPartyToken","seconds","nanoseconds","Timestamp","fromMillis","Date","now","date","getTime","milliseconds","Math","floor","toMillis","other","__PRIVATE_primitiveComparator","__PRIVATE_adjustedSeconds","String","padStart","timestamp","__PRIVATE_SnapshotVersion","__PRIVATE__compareTo","isEqual","segments","offset","length","fail","__PRIVATE_len","__PRIVATE_BasePath","__PRIVATE_comparator","__PRIVATE_nameOrPath","slice","limit","forEach","__PRIVATE_segment","push","__PRIVATE_construct","size","index","__PRIVATE_i","__PRIVATE_potentialChild","fn","end","p1","p2","min","left","right","ResourcePath","__PRIVATE_toArray","join","__PRIVATE_canonicalString","path","indexOf","split","filter","__PRIVATE_identifierRegExp","FieldPath","test","map","str","replace","__PRIVATE_isValidIdentifier","__PRIVATE_current","__PRIVATE_addCurrentSegment","__PRIVATE_inBackticks","c","next","__PRIVATE_DocumentKey","__PRIVATE_fromString","__PRIVATE_popFirst","collectionId","k1","k2","__PRIVATE_objectSize","obj","count","key","Object","prototype","hasOwnProperty","call","__PRIVATE_isEmpty","__PRIVATE_binaryString","base64","__PRIVATE_ByteString","__PRIVATE_PlatformSupport","__PRIVATE_getPlatform","atob","array","fromCharCode","btoa","buffer","Uint8Array","charCodeAt","__PRIVATE_isNullOrUndefined","__PRIVATE_isNegativeZero","isSafeInteger","Number","isInteger","MAX_SAFE_INTEGER","MIN_SAFE_INTEGER","__PRIVATE_isServerTimestamp","mapValue","fields","__type__","stringValue","__PRIVATE_getLocalWriteTime","__PRIVATE_localWriteTime","__PRIVATE_normalizeTimestamp","__local_write_time__","timestampValue","nanos","__PRIVATE_ISO_TIMESTAMP_REG_EXP","RegExp","__PRIVATE_typeOrder","__PRIVATE_valueEquals","__PRIVATE_leftType","booleanValue","__PRIVATE_leftTimestamp","__PRIVATE_rightTimestamp","__PRIVATE_normalizeByteString","bytesValue","referenceValue","__PRIVATE_normalizeNumber","geoPointValue","latitude","longitude","integerValue","__PRIVATE_n1","doubleValue","__PRIVATE_n2","isNaN","__PRIVATE_arrayEquals","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_compareTo","__PRIVATE_leftPath","__PRIVATE_rightPath","__PRIVATE_leftSegments","__PRIVATE_rightSegments","__PRIVATE_comparison","__PRIVATE_leftArray","__PRIVATE_rightArray","compare","__PRIVATE_leftKeys","keys","__PRIVATE_rightKeys","sort","__PRIVATE_keyCompare","canonicalId","__PRIVATE_canonifyValue","__PRIVATE_normalizedTimestamp","toBase64","__PRIVATE_fromName","__PRIVATE_geoPoint","result","first","__PRIVATE_sortedKeys","__PRIVATE_fraction","exec","__PRIVATE_nanoStr","substr","__PRIVATE_parsedDate","blob","fromBase64String","fromUint8Array","__PRIVATE_refValue","__PRIVATE_databaseId","projectId","database","isArray","__PRIVATE_isNullValue","__PRIVATE_isNanValue","__PRIVATE_isMapValue","previousValue","__previous_value__","__PRIVATE_transformResult","__PRIVATE_ServerTimestampTransform","elements","apply","__PRIVATE_coercedFieldValuesArray","__PRIVATE_toUnion","some","element","__PRIVATE_ArrayUnionTransformOperation","__PRIVATE_toRemove","__PRIVATE_ArrayRemoveTransformOperation","serializer","__PRIVATE_operand","__PRIVATE_baseValue","__PRIVATE_computeBaseValue","__PRIVATE_sum","asNumber","__PRIVATE_toInteger","__PRIVATE_toDouble","__PRIVATE_NumericIncrementTransformOperation","fieldPath","__PRIVATE_isPrefixOf","__PRIVATE_l","r","field","transform","version","transformResults","updateTime","exists","Precondition","Tt","__PRIVATE_maybeDoc","Document","__PRIVATE_precondition","__PRIVATE_Mutation","__PRIVATE_mutationResult","__PRIVATE_verifyKeyMatches","hasCommittedMutations","__PRIVATE_baseDoc","__PRIVATE_isValidFor","__PRIVATE_getPostMutationVersion","At","__PRIVATE_SetMutation","data","__PRIVATE_fieldMask","__PRIVATE_UnknownDocument","__PRIVATE_newData","__PRIVATE_patchDocument","__PRIVATE_PatchMutation","__PRIVATE_ObjectValue","empty","__PRIVATE_patchObject","__PRIVATE_builder","__PRIVATE_ObjectValueBuilder","newValue","set","delete","__PRIVATE_build","fieldTransforms","doc","__PRIVATE_requireDocument","__PRIVATE_serverTransformResults","__PRIVATE_transformObject","__PRIVATE_localTransformResults","__PRIVATE_baseObject","__PRIVATE_fieldTransform","__PRIVATE_existingValue","__PRIVATE_coercedValue","__PRIVATE_TransformMutation","__PRIVATE_applyToRemoteDocument","__PRIVATE_applyToLocalView","__PRIVATE_NoDocument","__PRIVATE_DeleteMutation","__PRIVATE_VerifyMutation","proto","__PRIVATE_lastSegment","Map","__PRIVATE_setOverlay","__PRIVATE_currentLevel","__PRIVATE_overlayMap","__PRIVATE_currentSegment","currentValue","entries","__PRIVATE_mergedResult","__PRIVATE_applyOverlay","__PRIVATE_EMPTY_PATH","__PRIVATE_currentPath","__PRIVATE_currentOverlays","__PRIVATE_modified","__PRIVATE_resultAtPath","__PRIVATE_pathSegment","__PRIVATE_nested","child","__PRIVATE_extractFieldMask","__PRIVATE_nestedFields","__PRIVATE_nestedPath","__PRIVATE_FieldMask","__PRIVATE_RpcCode","__PRIVATE_objectValue","options","__PRIVATE_hasLocalMutations","__PRIVATE_MaybeDocument","hasPendingWrites","collectionGroup","orderBy","filters","startAt","endAt","__PRIVATE_memoizedCanonicalId","f","__PRIVATE_isDocumentKey","__PRIVATE_explicitOrderBy","__PRIVATE_limitType","__PRIVATE_assertValidBound","Query","__PRIVATE_memoizedOrderBy","__PRIVATE_inequalityField","__PRIVATE_getInequalityFilterField","__PRIVATE_firstOrderByField","__PRIVATE_getFirstOrderByField","__PRIVATE_isKeyField","__PRIVATE_OrderBy","__PRIVATE_keyField","__PRIVATE_foundKeyOrdering","__PRIVATE_lastDirection","dir","__PRIVATE_newFilters","concat","__PRIVATE_newOrderBy","bound","__PRIVATE_toTarget","__PRIVATE_d1","__PRIVATE_d2","__PRIVATE_comparedOnKeyField","__PRIVATE_comp","__PRIVATE_matchesPathAndCollectionGroup","__PRIVATE_matchesOrderBy","__PRIVATE_matchesFilters","__PRIVATE_matchesBounds","FieldFilter","__PRIVATE_isInequality","__PRIVATE_operators","op","__PRIVATE_isDocumentQuery","__PRIVATE_memoizedTarget","Target","__PRIVATE_orderBys","__PRIVATE_Bound","position","before","__PRIVATE_docPath","__PRIVATE_hasCollectionId","__PRIVATE_isImmediateParentOf","matches","__PRIVATE_sortsBeforeDocument","__PRIVATE_KeyFieldInFilter","__PRIVATE_KeyFieldFilter","__PRIVATE_ArrayContainsFilter","__PRIVATE_InFilter","__PRIVATE_ArrayContainsAnyFilter","__PRIVATE_matchesComparison","val","p","__PRIVATE_orderByComponent","component","__PRIVATE_isKeyOrderBy","v1","v2","target","targetId","__PRIVATE_purpose","sequenceNumber","__PRIVATE_snapshotVersion","lastLimboFreeSnapshotVersion","resumeToken","__PRIVATE_EMPTY_BYTE_STRING","__PRIVATE_TargetData","__PRIVATE_isPermanentError","__PRIVATE_mapCodeFromRpcCode","__PRIVATE_logError","RpcCode","root","__PRIVATE_LLRBNode","EMPTY","__PRIVATE_SortedMap","__PRIVATE_insert","__PRIVATE_copy","__PRIVATE_BLACK","remove","node","cmp","__PRIVATE_prunedNodes","__PRIVATE_minKey","__PRIVATE_maxKey","action","__PRIVATE_inorderTraversal","k","__PRIVATE_descriptions","__PRIVATE_reverseTraversal","__PRIVATE_SortedMapIterator","__PRIVATE_startKey","__PRIVATE_isReverse","__PRIVATE_nodeStack","pop","color","RED","n","__PRIVATE_fixUp","__PRIVATE_isRed","__PRIVATE_moveRedLeft","__PRIVATE_removeMin","__PRIVATE_smallest","__PRIVATE_rotateRight","__PRIVATE_moveRedRight","__PRIVATE_rotateLeft","__PRIVATE_colorFlip","__PRIVATE_nl","__PRIVATE_nr","__PRIVATE_blackDepth","__PRIVATE_check","pow","__PRIVATE_elem","cb","range","__PRIVATE_iter","__PRIVATE_getIteratorFrom","__PRIVATE_hasNext","__PRIVATE_getNext","start","__PRIVATE_getIterator","__PRIVATE_SortedSetIterator","has","add","__PRIVATE_SortedSet","__PRIVATE_thisIt","__PRIVATE_otherIt","__PRIVATE_thisElem","__PRIVATE_otherElem","__PRIVATE_res","__PRIVATE_EMPTY_MAYBE_DOCUMENT_MAP","__PRIVATE_maybeDocumentMap","__PRIVATE_nullableMaybeDocumentMap","__PRIVATE_EMPTY_DOCUMENT_MAP","__PRIVATE_documentMap","__PRIVATE_EMPTY_DOCUMENT_VERSION_MAP","__PRIVATE_documentVersionMap","__PRIVATE_EMPTY_DOCUMENT_KEY_SET","__PRIVATE_documentKeySet","__PRIVATE_EMPTY_TARGET_ID_SET","__PRIVATE_targetIdSet","__PRIVATE_keyedMap","__PRIVATE_sortedSet","__PRIVATE_oldSet","__PRIVATE_DocumentSet","__PRIVATE_thisDoc","__PRIVATE_otherDoc","__PRIVATE_docStrings","__PRIVATE_newSet","__PRIVATE_change","__PRIVATE_oldChange","__PRIVATE_changeMap","type","__PRIVATE_changes","query","docs","__PRIVATE_oldDocs","docChanges","__PRIVATE_mutatedKeys","fromCache","__PRIVATE_syncStateChanged","__PRIVATE_excludesMetadataChanges","documents","__PRIVATE_ViewSnapshot","__PRIVATE_emptySet","__PRIVATE_otherChanges","__PRIVATE_targetChanges","__PRIVATE_targetMismatches","__PRIVATE_documentUpdates","__PRIVATE_resolvedLimboDocuments","TargetChange","__PRIVATE_createSynthesizedTargetChangeForCurrentChange","__PRIVATE_RemoteEvent","__PRIVATE_addedDocuments","__PRIVATE_modifiedDocuments","__PRIVATE_removedDocuments","__PRIVATE_updatedTargetIds","removedTargetIds","__PRIVATE_newDoc","__PRIVATE_existenceFilter","state","targetIds","cause","__PRIVATE_snapshotChangesMap","fs","__PRIVATE__current","__PRIVATE__resumeToken","ys","__PRIVATE_pendingResponses","bs","__PRIVATE__hasPendingChanges","__PRIVATE_approximateByteSize","__PRIVATE_documentChanges","__PRIVATE_changeType","__PRIVATE_metadataProvider","__PRIVATE_documentTargetMap","__PRIVATE_docChange","__PRIVATE_addDocumentToTarget","__PRIVATE_removeDocumentFromTarget","targetChange","__PRIVATE_forEachTarget","__PRIVATE_targetState","__PRIVATE_ensureTargetState","__PRIVATE_isActiveTarget","__PRIVATE_updateResumeToken","__PRIVATE_recordTargetResponse","__PRIVATE_isPending","__PRIVATE_clearPendingChanges","removeTarget","__PRIVATE_markCurrent","__PRIVATE_resetTarget","__PRIVATE_targetStates","__PRIVATE__","__PRIVATE_watchChange","__PRIVATE_expectedCount","__PRIVATE_targetData","__PRIVATE_targetDataForActiveTarget","__PRIVATE_getCurrentDocumentCountForTarget","__PRIVATE_pendingTargetResets","__PRIVATE_pendingDocumentUpdates","__PRIVATE_targetContainsDocument","__PRIVATE_hasPendingChanges","__PRIVATE_toTargetChange","__PRIVATE_pendingDocumentTargetMapping","__PRIVATE_targets","__PRIVATE_isOnlyLimboTarget","__PRIVATE_forEachWhile","__PRIVATE_remoteEvent","document","__PRIVATE_addDocumentChange","__PRIVATE_ensureDocumentTargetMapping","__PRIVATE_updatedDocument","__PRIVATE_removeDocumentChange","__PRIVATE_getRemoteKeysForTarget","__PRIVATE_recordPendingTargetRequest","__PRIVATE_TargetState","__PRIVATE_targetMapping","__PRIVATE_targetActive","__PRIVATE_logDebug","__PRIVATE_getTargetDataForTarget","__PRIVATE_DIRECTIONS","asc","desc","__PRIVATE_OPERATORS","<","<=",">",">=","==","array-contains","in","array-contains-any","status","__PRIVATE_useProto3Json","Infinity","toISOString","bytes","toUint8Array","__PRIVATE_toTimestamp","__PRIVATE_fromTimestamp","__PRIVATE_fullyQualifiedPrefixPath","__PRIVATE_resource","__PRIVATE_isValidResourceName","__PRIVATE_toResourceName","__PRIVATE_fromResourceName","__PRIVATE_extractLocalPathFromResourceName","__PRIVATE_resourceName","wi","__PRIVATE_toName","__PRIVATE_toProto","fromVersion","found","missing","readTime","__PRIVATE_fromFound","__PRIVATE_fromMissing","__PRIVATE_fromWatchTargetChangeState","targetChangeType","__PRIVATE_fromBytes","__PRIVATE_causeProto","__PRIVATE_fromRpcStatus","__PRIVATE_WatchTargetChange","documentChange","__PRIVATE_entityChange","__PRIVATE_DocumentWatchChange","documentDelete","__PRIVATE_docDelete","documentRemove","__PRIVATE_docRemove","ExistenceFilter","__PRIVATE_ExistenceFilterChange","__PRIVATE_mutation","update","__PRIVATE_toMutationDocument","updateMask","__PRIVATE_toDocumentMask","__PRIVATE_toFieldTransform","verify","__PRIVATE_isNone","currentDocument","__PRIVATE_toPrecondition","__PRIVATE_fromPrecondition","__PRIVATE_none","__PRIVATE_fromDocumentMask","__PRIVATE_fromFieldTransform","toVersion","commitTime","__PRIVATE_MutationResult","__PRIVATE_protos","__PRIVATE_fromWriteResult","setToServerValue","appendMissingElements","removeAllFromArray","increment","instance","__PRIVATE_fromServerFormat","FieldTransform","__PRIVATE_toQueryPath","__PRIVATE_documentsTarget","__PRIVATE_atPath","__PRIVATE_fromQueryPath","structuredQuery","parent","from","allDescendants","__PRIVATE_popLast","where","__PRIVATE_toFilter","__PRIVATE_toOrder","__PRIVATE_toInt32Proto","__PRIVATE_toCursor","__PRIVATE_fromCount","__PRIVATE_filterBy","__PRIVATE_fromFilter","__PRIVATE_fromOrder","__PRIVATE_fromInt32Proto","__PRIVATE_fromCursor","__PRIVATE_toLabel","goog-listen-tags","__PRIVATE_toDocumentsTarget","__PRIVATE_toQueryTarget","__PRIVATE_toBytes","__PRIVATE_toUnaryOrFieldFilter","compositeFilter","unaryFilter","__PRIVATE_fromUnaryFilter","fieldFilter","__PRIVATE_fromFieldFilter","reduce","__PRIVATE_accum","order","__PRIVATE_toPropertyOrder","__PRIVATE_fromPropertyOrder","cursor","__PRIVATE_fieldReference","__PRIVATE_toFieldPathReference","direction","__PRIVATE_toDirection","__PRIVATE_fromFieldPathReference","__PRIVATE_fromDirection","create","__PRIVATE_fromOperatorName","__PRIVATE_toOperatorName","__PRIVATE_nanField","NaN","__PRIVATE_nullField","nullValue","__PRIVATE_canonicalFields","fieldPaths","__PRIVATE_paths","platform","__PRIVATE_logClient","Logger","__PRIVATE_getLogLevel","logLevel","setLogLevel","__PRIVATE_newLevel","msg","LogLevel","DEBUG","args","__PRIVATE_argToString","debug","ERROR","error","__PRIVATE_formatJSON","e","__PRIVATE_failure","assertion","__PRIVATE_debugCast","constructor","__PRIVATE_chars","__PRIVATE_maxMultiple","__PRIVATE_autoId","__PRIVATE_randomBytes","charAt","every","__PRIVATE_immediateSuccessor","s","persistenceKey","host","ssl","forceLongPolling","ln","__PRIVATE_DatabaseId","__PRIVATE_mapKeyFn","id","__PRIVATE_inner","__PRIVATE_otherKey","splice","batchId","baseMutations","mutations","__PRIVATE_docKey","__PRIVATE_batchResult","__PRIVATE_mutationResults","__PRIVATE_maybeDocs","__PRIVATE_mutatedDocuments","__PRIVATE_m","__PRIVATE_mutatedDocument","batch","__PRIVATE_commitVersion","streamToken","__PRIVATE_docVersions","results","__PRIVATE_versionMap","__PRIVATE_MutationBatchResult","callback","__PRIVATE_isDone","__PRIVATE_nextCallback","__PRIVATE_catchCallback","__PRIVATE_nextFn","__PRIVATE_catchFn","__PRIVATE_callbackAttached","__PRIVATE_wrapFailure","__PRIVATE_wrapSuccess","PersistencePromise","reject","__PRIVATE_wrapUserFunction","all","__PRIVATE_resolvedCount","done","__PRIVATE_err","__PRIVATE_predicates","predicate","__PRIVATE_isTrue","collection","__PRIVATE_promises","__PRIVATE_waitFor","__PRIVATE_ObjectMap","__PRIVATE__readTime","__PRIVATE_maybeDocument","__PRIVATE_assertNotApplied","transaction","__PRIVATE_documentKey","__PRIVATE_bufferedEntry","__PRIVATE_getFromCache","__PRIVATE_documentKeys","__PRIVATE_getAllFromCache","__PRIVATE_changesApplied","__PRIVATE_applyChanges","__PRIVATE_PRIMARY_LEASE_LOST_ERROR_MSG","listener","__PRIVATE_onCommittedListeners","__PRIVATE_remoteDocumentCache","__PRIVATE_mutationQueue","__PRIVATE_indexManager","__PRIVATE_getAllMutationBatchesAffectingDocumentKey","__PRIVATE_batches","__PRIVATE_getDocumentInternal","__PRIVATE_inBatches","__PRIVATE_getEntry","__PRIVATE_localView","getEntries","__PRIVATE_getLocalViewOfDocuments","__PRIVATE_baseDocs","__PRIVATE_getAllMutationBatchesAffectingDocumentKeys","__PRIVATE_applyLocalMutationsToDocuments","__PRIVATE_sinceReadTime","__PRIVATE_getDocumentsMatchingDocumentQuery","__PRIVATE_isCollectionGroupQuery","__PRIVATE_getDocumentsMatchingCollectionGroupQuery","__PRIVATE_getDocumentsMatchingCollectionQuery","__PRIVATE_getDocument","__PRIVATE_getCollectionParents","__PRIVATE_parents","__PRIVATE_collectionQuery","__PRIVATE_asCollectionQueryAtPath","__PRIVATE_mutationBatches","__PRIVATE_getDocumentsMatchingQuery","__PRIVATE_queryResults","__PRIVATE_getAllMutationBatchesAffectingQuery","__PRIVATE_matchingMutationBatches","__PRIVATE_addMissingBaseDocuments","__PRIVATE_mergedDocuments","__PRIVATE_mutatedDoc","__PRIVATE_existingDocuments","__PRIVATE_missingBaseDocEntriesForPatching","__PRIVATE_missingBaseDocs","__PRIVATE_addedKeys","__PRIVATE_removedKeys","__PRIVATE_viewSnapshot","__PRIVATE_LocalViewChanges","__PRIVATE_sequenceNumberSyncer","__PRIVATE_sequenceNumberHandler","__PRIVATE_setPreviousValue","__PRIVATE_writeNewSequenceNumber","__PRIVATE_writeSequenceNumber","__PRIVATE_externalPreviousValue","max","__PRIVATE_nextValue","__PRIVATE_ListenSequence","promise","__PRIVATE_queue","__PRIVATE_timerId","__PRIVATE_initialDelayMs","__PRIVATE_backoffFactor","__PRIVATE_maxDelayMs","reset","__PRIVATE_currentBaseMs","cancel","__PRIVATE_desiredDelayWithJitterMs","__PRIVATE_jitterDelayMs","__PRIVATE_delaySoFarMs","__PRIVATE_lastAttemptTime","__PRIVATE_remainingDelayMs","__PRIVATE_timerPromise","__PRIVATE_enqueueAfterDelay","__PRIVATE_skipDelay","random","__PRIVATE_encodeResourcePath","__PRIVATE_encodeSeparator","__PRIVATE_encodeSegment","__PRIVATE_resultBuf","__PRIVATE_escapeChar","__PRIVATE_decodeResourcePath","__PRIVATE_lastReasonableEscapeIndex","__PRIVATE_segmentBuilder","__PRIVATE_currentPiece","substring","__PRIVATE_MemoryCollectionParentIndex","collectionPath","__PRIVATE_collectionParentIndex","parentPath","__PRIVATE_existingParents","__PRIVATE_added","__PRIVATE_collectionParentsCache","__PRIVATE_addOnCommittedListener","__PRIVATE_collectionParent","__PRIVATE_collectionParentsStore","put","__PRIVATE_parentPaths","IDBKeyRange","__PRIVATE_loadAll","__PRIVATE_entry","txn","__PRIVATE_IndexedDbPersistence","__PRIVATE_getStore","DbCollectionParent","store","__PRIVATE_remoteDocumentsStore","__PRIVATE_dbKey","__PRIVATE_sizeDelta","getMetadata","metadata","byteSize","__PRIVATE_setMetadata","__PRIVATE_dbRemoteDoc","__PRIVATE_maybeDecodeDocument","Mr","__PRIVATE_dbDocumentSize","__PRIVATE_forEachDbEntry","__PRIVATE_sizeMap","Br","qr","last","__PRIVATE_keyIter","__PRIVATE_nextKey","__PRIVATE_iterate","__PRIVATE_potentialKeyRaw","control","__PRIVATE_potentialKey","__PRIVATE_fromSegments","__PRIVATE_skip","__PRIVATE_immediateChildrenPathLength","__PRIVATE_iterationOptions","lowerBound","__PRIVATE_collectionKey","__PRIVATE_readTimeKey","__PRIVATE_toDbTimestampKey","DbRemoteDocument","collectionReadTimeIndex","__PRIVATE_fromDbRemoteDocument","__PRIVATE_changedDocs","__PRIVATE_lastReadTime","__PRIVATE_documentsStore","readTimeIndex","Gr","__PRIVATE_fromDbTimestampKey","reverse","__PRIVATE_IndexedDbRemoteDocumentCache","__PRIVATE_RemoteDocumentChangeBuffer","__PRIVATE_trackRemovals","__PRIVATE_documentGlobalStore","DbRemoteDocumentGlobal","unknownDocument","noDocument","JSON","stringify","__PRIVATE_documentCache","__PRIVATE_collectionParents","__PRIVATE_previousSize","__PRIVATE_documentSizes","__PRIVATE_toDbRemoteDocument","__PRIVATE_addEntry","__PRIVATE_deletedDoc","__PRIVATE_removeEntry","__PRIVATE_addToCollectionParentIndex","updateMetadata","__PRIVATE_getSizedEntry","__PRIVATE_getResult","__PRIVATE_getSizedEntries","__PRIVATE_maybeDocuments","__PRIVATE_lastId","__PRIVATE_TargetIdGenerator","__PRIVATE_referenceDelegate","__PRIVATE_retrieveMetadata","__PRIVATE_targetIdGenerator","highestTargetId","__PRIVATE_saveMetadata","lastRemoteSnapshotVersion","__PRIVATE_targetGlobal","highestListenSequenceNumber","__PRIVATE_saveTargetData","targetCount","__PRIVATE_updateMetadataFromTargetData","__PRIVATE_removeMatchingKeysForTargetId","__PRIVATE_targetsStore","upperBound","activeTargetIds","__PRIVATE_fromDbTarget","__PRIVATE_removeTargetData","__PRIVATE_globalTargetStore","DbTargetGlobal","__PRIVATE_toDbTarget","updated","NEGATIVE_INFINITY","POSITIVE_INFINITY","DbTarget","queryTargetsIndexName","__PRIVATE_documentTargetStore","DbTargetDocument","__PRIVATE_addReference","__PRIVATE_removeReference","Dh","documentTargetsIndex","__PRIVATE_remoteSerializer","__PRIVATE_remoteDoc","__PRIVATE_fromDocument","__PRIVATE_fromDbTimestamp","__PRIVATE_dbReadTime","__PRIVATE_toDocument","__PRIVATE_toDbTimestamp","DbNoDocument","DbUnknownDocument","__PRIVATE_dbTimestampKey","DbTimestamp","__PRIVATE_dbTimestamp","userId","__PRIVATE_serializedBaseMutations","__PRIVATE_toMutation","__PRIVATE_serializedMutations","DbMutationBatch","__PRIVATE_dbBatch","__PRIVATE_fromMutation","localWriteTimeMs","__PRIVATE_MutationBatch","__PRIVATE_dbTarget","__PRIVATE_fromDocumentsTarget","__PRIVATE_fromQueryTarget","lastListenSequenceNumber","__PRIVATE_queryProto","__PRIVATE_dbLastLimboFreeTimestamp","__PRIVATE_PRIMARY_LEASE_EXCLUSIVE_ERROR_MSG","__PRIVATE_simpleDbTransaction","__PRIVATE_currentSequenceNumber","__PRIVATE_PersistenceTransaction","allowTabSynchronization","clientId","__PRIVATE_lruParams","__PRIVATE_isAvailable","__PRIVATE_IndexedDbLruDelegate","__PRIVATE_dbName","__PRIVATE_MAIN_DATABASE","LocalSerializer","__PRIVATE_targetCache","__PRIVATE_IndexedDbTargetCache","__PRIVATE_IndexedDbIndexManager","window","localStorage","__PRIVATE_webStorage","__PRIVATE_IndexedDbTransaction","__PRIVATE_SimpleDb","__PRIVATE_openOrCreate","SCHEMA_VERSION","SchemaConverter","db","__PRIVATE_simpleDb","__PRIVATE_updateClientMetadataAndTryBecomePrimary","isPrimary","__PRIVATE_attachVisibilityHandler","__PRIVATE_attachWindowUnloadHook","__PRIVATE_scheduleClientMetadataAndPrimaryLeaseRefreshes","runTransaction","__PRIVATE_getHighestSequenceNumber","__PRIVATE_listenSequence","__PRIVATE__started","catch","reason","close","__PRIVATE_primaryStateListener","async","__PRIVATE_primaryState","__PRIVATE_started","__PRIVATE_databaseDeletedListener","__PRIVATE_setVersionChangeListener","event","newVersion","networkEnabled","__PRIVATE_enqueueAndForget","__PRIVATE_clientMetadataStore","DbClientMetadata","inForeground","__PRIVATE_verifyPrimaryLease","__PRIVATE_success","__PRIVATE_canActAsPrimary","__PRIVATE_releasePrimaryLeaseIfHeld","__PRIVATE_acquireOrExtendPrimaryLease","__PRIVATE_isIndexedDbTransactionError","__PRIVATE_primaryClientStore","DbPrimaryClient","__PRIVATE_primaryClient","__PRIVATE_isLocalClient","__PRIVATE_isWithinAge","__PRIVATE_lastGarbageCollectionTime","__PRIVATE_metadataStore","__PRIVATE_existingClients","active","__PRIVATE_filterActiveClients","__PRIVATE_inactive","__PRIVATE_client","__PRIVATE_inactiveClient","removeItem","__PRIVATE_zombiedClientLocalStorageKey","__PRIVATE_clientMetadataRefresher","__PRIVATE_maybeGarbageCollectMultiClientState","ownerId","__PRIVATE_currentPrimary","leaseTimestampMs","__PRIVATE_isClientZombied","__PRIVATE_otherClient","__PRIVATE_otherClientHasBetterNetworkState","__PRIVATE_otherClientHasBetterVisibility","__PRIVATE_otherClientHasSameNetworkState","__PRIVATE_markClientZombied","__PRIVATE_detachVisibilityHandler","__PRIVATE_detachWindowUnloadHook","__PRIVATE_removeClientMetadata","__PRIVATE_removeClientZombiedEntry","__PRIVATE_clients","__PRIVATE_activityThresholdMs","updateTimeMs","__PRIVATE_clientMetadata","ro","__PRIVATE_IndexedDbMutationQueue","__PRIVATE_forUser","mode","__PRIVATE_transactionOperation","__PRIVATE_persistenceTransaction","__PRIVATE_simpleDbMode","ALL_STORES","__PRIVATE_simpleDbTxn","__PRIVATE_INVALID","__PRIVATE_holdsPrimaryLease","__PRIVATE_verifyAllowTabSynchronization","__PRIVATE_raiseOnCommittedEvent","__PRIVATE_newPrimary","__PRIVATE_databaseInfo","__PRIVATE_isDefaultDatabase","__PRIVATE_maxAgeMs","addEventListener","__PRIVATE_documentVisibilityHandler","visibilityState","removeEventListener","__PRIVATE_windowUnloadHandler","__PRIVATE_shutdown","__PRIVATE_isZombied","getItem","setItem","__PRIVATE_params","__PRIVATE_garbageCollector","__PRIVATE_LruGarbageCollector","__PRIVATE_docCountPromise","__PRIVATE_orphanedDocumentCount","__PRIVATE_getTargetCache","__PRIVATE_getTargetCount","__PRIVATE_docCount","__PRIVATE_orphanedCount","__PRIVATE_forEachOrphanedDocumentSequenceNumber","__PRIVATE_forEachOrphanedDocument","__PRIVATE_writeSentinelKey","__PRIVATE_removeTargets","__PRIVATE_mutationQueuesStore","__PRIVATE_iterateSerial","__PRIVATE_mutationQueueContainsKey","__PRIVATE_containsKey","__PRIVATE_changeBuffer","__PRIVATE_getRemoteDocumentCache","__PRIVATE_newChangeBuffer","__PRIVATE_documentCount","__PRIVATE_isPinned","__PRIVATE_withSequenceNumber","__PRIVATE_updateTargetData","__PRIVATE_nextPath","__PRIVATE_nextToReport","__PRIVATE_getSize","__PRIVATE_mutationsStore","userMutationsIndex","__PRIVATE_getMutationQueueMetadata","lastStreamToken","__PRIVATE_documentStore","__PRIVATE_documentMutationsStore","__PRIVATE_mutationStore","__PRIVATE_toDbMutationBatch","__PRIVATE_indexKey","DbDocumentMutation","PLACEHOLDER","__PRIVATE_documentKeysByBatchId","__PRIVATE_fromDbMutationBatch","__PRIVATE_lookupMutationBatch","__PRIVATE_nextBatchId","__PRIVATE_foundBatch","__PRIVATE_dbBatches","__PRIVATE_indexPrefix","prefixForPath","__PRIVATE_indexStart","__PRIVATE_userID","__PRIVATE_encodedPath","__PRIVATE_uniqueBatchIDs","__PRIVATE_batchID","__PRIVATE_lookupMutationBatches","__PRIVATE_queryPath","__PRIVATE_immediateChildrenLength","__PRIVATE_batchIDs","__PRIVATE_removeMutationBatch","__PRIVATE_removeCachedMutationKeys","__PRIVATE_markPotentiallyOrphaned","__PRIVATE_checkEmpty","__PRIVATE_startRange","prefixForUser","__PRIVATE_danglingMutationReferences","DbMutationQueue","keyPath","__PRIVATE_indexTxn","only","__PRIVATE_numDeleted","__PRIVATE_removePromise","__PRIVATE_SimpleDbTransaction","createObjectStore","autoIncrement","createIndex","userMutationsKeyPath","unique","__PRIVATE_createQueryCache","deleteObjectStore","__PRIVATE_globalStore","__PRIVATE_existingMutations","__PRIVATE_v3MutationsStore","__PRIVATE_writeAll","removeAcknowledgedMutations","addDocumentGlobal","ensureSequenceNumbers","createCollectionParentIndex","objectStoreNames","contains","__PRIVATE_remoteDocumentStore","objectStore","readTimeIndexPath","collectionReadTimeIndexPath","rewriteCanonicalIds","__PRIVATE_byteCount","__PRIVATE_queuesStore","__PRIVATE_queues","lastAcknowledgedBatchId","__PRIVATE_docSentinelKey","__PRIVATE_maybeSentinel","cache","__PRIVATE_pathSegments","__PRIVATE_targetStore","__PRIVATE_originalDbTarget","__PRIVATE_originalTargetData","__PRIVATE_updatedDbTarget","documentTargetsKeyPath","queryTargetsKeyPath","__PRIVATE_getIOSVersion","getUA","__PRIVATE_schemaConverter","request","indexedDB","open","onsuccess","onblocked","onerror","onupgradeneeded","oldVersion","createOrUpgrade","__PRIVATE_toPromise","__PRIVATE_wrapRequest","deleteDatabase","__PRIVATE_isMockPersistence","navigator","__PRIVATE_ua","__PRIVATE_iOSVersion","__PRIVATE_isUnsupportedIOS","__PRIVATE_androidVersion","__PRIVATE_getAndroidVersion","__PRIVATE_isUnsupportedAndroid","__PRIVATE_process","__PRIVATE_env","__PRIVATE_USE_MOCK_PERSISTENCE","__PRIVATE_iOSVersionRegex","match","__PRIVATE_androidVersionRegex","__PRIVATE_versionChangeListener","onversionchange","__PRIVATE_objectStores","__PRIVATE_transactionFn","__PRIVATE_readonly","__PRIVATE_attemptNumber","__PRIVATE_transactionFnResult","abort","__PRIVATE_completionPromise","__PRIVATE_retryable","__PRIVATE_dbCursor","Pn","__PRIVATE_shouldStop","Ea","__PRIVATE_Deferred","oncomplete","__PRIVATE_completionDeferred","onabort","__PRIVATE_IndexedDbTransactionError","__PRIVATE_checkForAndReportiOSError","la","aborted","__PRIVATE_storeName","__PRIVATE_SimpleDbStore","__PRIVATE_keyOrValue","__PRIVATE_indexOrRange","__PRIVATE_iterateCursor","__PRIVATE_keysOnly","__PRIVATE_optionsOrCallback","__PRIVATE_cursorRequest","primaryKey","__PRIVATE_shouldContinue","continue","controller","__PRIVATE_IterationController","__PRIVATE_userResult","__PRIVATE_userPromise","__PRIVATE_skipToKey","__PRIVATE_indexName","openKeyCursor","openCursor","__PRIVATE_reportedIOSError","__PRIVATE_IOS_ERROR","__PRIVATE_newError","setTimeout","__PRIVATE_asyncQueue","__PRIVATE_targetTimeMs","__PRIVATE_removalCallback","__PRIVATE_deferred","bind","__PRIVATE_delayMs","__PRIVATE_delayedOp","__PRIVATE_DelayedOperation","__PRIVATE_timerHandle","__PRIVATE_handleDelayElapsed","clearTimeout","__PRIVATE_ExponentialBackoff","__PRIVATE_backoff","__PRIVATE_skipBackoff","__PRIVATE_visibilityHandler","La","__PRIVATE__isShuttingDown","enqueue","__PRIVATE_verifyNotFailed","__PRIVATE_enqueueInternal","__PRIVATE_enqueueEvenAfterShutdown","__PRIVATE_retryableTail","__PRIVATE_retryingOp","__PRIVATE_backoffAndRun","__PRIVATE_newTail","__PRIVATE_tail","__PRIVATE_operationInProgress","stack","__PRIVATE_timerIdsToSkip","__PRIVATE_createAndSchedule","__PRIVATE_removedOp","__PRIVATE_removeDelayedOperation","__PRIVATE_delayedOperations","__PRIVATE_currentTail","__PRIVATE_lastTimerId","__PRIVATE_drain","a","b","__PRIVATE_wrapInUserErrorIfRecoverable","__PRIVATE_bufferEntryComparator","__PRIVATE_aSequence","__PRIVATE_aIndex","__PRIVATE_bSequence","__PRIVATE_bIndex","__PRIVATE_seqCmp","__PRIVATE_maxElements","__PRIVATE_previousIndex","__PRIVATE_nextIndex","__PRIVATE_highestValue","maxValue","__PRIVATE_GC_DID_NOT_RUN","Za","tu","eu","su","__PRIVATE_cacheSizeCollectionThreshold","__PRIVATE_percentileToCollect","__PRIVATE_maximumSequenceNumbersToCollect","__PRIVATE_cacheSize","__PRIVATE_LruParams","__PRIVATE_DEFAULT_COLLECTION_PERCENTILE","__PRIVATE_DEFAULT_MAX_SEQUENCE_NUMBERS_TO_COLLECT","__PRIVATE_DEFAULT_CACHE_SIZE_BYTES","__PRIVATE_COLLECTION_DISABLED","__PRIVATE_gcTask","__PRIVATE_localStore","__PRIVATE_scheduleGC","delay","__PRIVATE_hasRun","__PRIVATE_collectGarbage","__PRIVATE_ignoreIfPrimaryLeaseLoss","__PRIVATE_delegate","__PRIVATE_percentile","__PRIVATE_getSequenceNumberCount","__PRIVATE_RollingSequenceNumberBuffer","__PRIVATE_addElement","__PRIVATE_removeOrphanedDocuments","__PRIVATE_getCacheSize","__PRIVATE_runGarbageCollection","__PRIVATE_upperBoundSequenceNumber","__PRIVATE_sequenceNumbersToCollect","__PRIVATE_targetsRemoved","__PRIVATE_countedTargetsTs","__PRIVATE_foundUpperBoundTs","__PRIVATE_removedTargetsTs","__PRIVATE_removedDocumentsTs","__PRIVATE_startTs","__PRIVATE_calculateTargetCount","__PRIVATE_sequenceNumbers","__PRIVATE_nthSequenceNumber","__PRIVATE_numTargetsRemoved","__PRIVATE_documentsRemoved","persistence","__PRIVATE_queryEngine","__PRIVATE_initialUser","t","__PRIVATE_getMutationQueue","__PRIVATE_remoteDocuments","__PRIVATE_localDocuments","__PRIVATE_LocalDocumentsView","__PRIVATE_getIndexManager","__PRIVATE_setLocalDocumentsView","__PRIVATE_newMutationQueue","__PRIVATE_newLocalDocuments","__PRIVATE_oldBatches","__PRIVATE_getAllMutationBatches","__PRIVATE_promisedOldBatches","__PRIVATE_newBatches","__PRIVATE_removedBatchIds","__PRIVATE_addedBatchIds","__PRIVATE_changedKeys","__PRIVATE_getDocuments","__PRIVATE_affectedDocuments","Cu","Fu","Nu","__PRIVATE_existingDocs","__PRIVATE_extractBaseValue","__PRIVATE_addMutationBatch","__PRIVATE_applyToLocalDocumentSet","Dn","__PRIVATE_affected","__PRIVATE_documentBuffer","Xr","__PRIVATE_acknowledgeBatch","__PRIVATE_applyWriteToRemoteDocuments","__PRIVATE_performConsistencyCheck","__PRIVATE_affectedKeys","__PRIVATE_getHighestUnacknowledgedBatchId","__PRIVATE_getLastStreamToken","__PRIVATE_setLastStreamToken","__PRIVATE_getLastRemoteSnapshotVersion","__PRIVATE_remoteVersion","__PRIVATE_newTargetDataByTargetMap","__PRIVATE_targetDataByTarget","__PRIVATE_oldTargetData","__PRIVATE_removeMatchingKeys","__PRIVATE_addMatchingKeys","__PRIVATE_newTargetData","__PRIVATE_withResumeToken","__PRIVATE_LocalStore","__PRIVATE_shouldPersistTargetData","__PRIVATE_updatedKeys","__PRIVATE_existingDoc","__PRIVATE_updateLimboDocument","__PRIVATE_updateRemoteVersion","__PRIVATE_setTargetsMetadata","__PRIVATE_toMicroseconds","__PRIVATE_RESUME_TOKEN_MAX_AGE_MICROS","__PRIVATE_viewChanges","__PRIVATE_viewChange","e_59","__PRIVATE_updatedTargetData","__PRIVATE_withLastLimboFreeSnapshotVersion","__PRIVATE_afterBatchId","__PRIVATE_getNextMutationBatchAfterBatchId","__PRIVATE_getTargetData","__PRIVATE_cached","__PRIVATE_allocateTargetId","__PRIVATE_addTargetData","__PRIVATE_targetIdByTarget","__PRIVATE_keepPersistedTargetData","__PRIVATE_usePreviousResults","__PRIVATE_remoteKeys","__PRIVATE_getMatchingKeysForTargetId","Ku","__PRIVATE_docKeys","__PRIVATE_promiseChain","__PRIVATE_ackVersion","__PRIVATE_collect","__PRIVATE_synchronizeLastDocumentChangeReadTime","__PRIVATE_lookupMutationKeys","__PRIVATE_setNetworkEnabled","__PRIVATE_getActiveClients","__PRIVATE_cachedTargetData","__PRIVATE_getNewDocumentChanges","__PRIVATE_lastDocumentChangeReadTime","__PRIVATE_getLastReadTime","__PRIVATE_DocReference","__PRIVATE_compareByKey","__PRIVATE_compareByTargetId","__PRIVATE_refsByKey","ref","__PRIVATE_refsByTarget","__PRIVATE_removeRef","__PRIVATE_emptyKey","__PRIVATE_startRef","__PRIVATE_endRef","__PRIVATE_forEachInRange","__PRIVATE_firstRef","__PRIVATE_firstAfterOrEqual","__PRIVATE_targetOrBatchId","__PRIVATE_validateNoArgs","functionName","__PRIVATE_formatPlural","__PRIVATE_validateExactNumberOfArgs","__PRIVATE_numberOfArgs","__PRIVATE_validateAtLeastNumberOfArgs","__PRIVATE_minNumberOfArgs","__PRIVATE_validateBetweenNumberOfArgs","__PRIVATE_maxNumberOfArgs","__PRIVATE_validateArgType","__PRIVATE_argument","__PRIVATE_validateType","__PRIVATE_ordinal","__PRIVATE_validateOptionalArgType","__PRIVATE_validateNamedType","__PRIVATE_optionName","__PRIVATE_validateNamedOptionalType","__PRIVATE_validateNamedOptionalPropertyEquals","__PRIVATE_inputName","input","__PRIVATE_expected","__PRIVATE_expectedDescription","__PRIVATE_valueDescription","__PRIVATE_actualDescription","__PRIVATE_isPlainObject","description","getPrototypeOf","Array","__PRIVATE_customObjectName","__PRIVATE_validateDefined","__PRIVATE_validateOptionNames","__PRIVATE_optionNames","__PRIVATE_invalidClassError","__PRIVATE_validatePositiveNumber","num","__PRIVATE_assertUint8ArrayAvailable","__PRIVATE_assertBase64Available","__PRIVATE_base64Available","__PRIVATE_byteString","__PRIVATE__byteString","arguments","Blob","__PRIVATE_minNumberOfElements","fieldNames","__PRIVATE__internalPath","__PRIVATE_InternalFieldPath","__PRIVATE__DOCUMENT_ID","__PRIVATE_RESERVED","__PRIVATE__methodName","__PRIVATE_FieldValueImpl","context","__PRIVATE_dataSource","__PRIVATE_createError","__PRIVATE_DeleteFieldValueImpl","__PRIVATE_ServerTimestampFieldValueImpl","__PRIVATE__elements","__PRIVATE_parseContext","__PRIVATE_ParseContext","dc","methodName","Ec","ignoreUndefinedProperties","__PRIVATE_parsedElements","__PRIVATE_parseData","arrayUnion","__PRIVATE__operand","__PRIVATE_numericIncrement","isFinite","__PRIVATE__lat","__PRIVATE__long","__PRIVATE_RESERVED_FIELD_REGEX","__PRIVATE_isWrite","settings","__PRIVATE_validatePath","configuration","__PRIVATE_childPath","__PRIVATE_contextWith","__PRIVATE_validatePathSegment","__PRIVATE_fieldDescription","__PRIVATE_newSerializer","__PRIVATE_createContext","__PRIVATE_validatePlainObject","__PRIVATE_updateData","__PRIVATE_parseObject","__PRIVATE_ParsedSetData","__PRIVATE_validatedFieldPaths","__PRIVATE_stringOrFieldPath","__PRIVATE_ExternalFieldPath","__PRIVATE_fieldPathFromDotSeparatedString","__PRIVATE_fieldMaskContains","__PRIVATE_covers","__PRIVATE_fieldMaskPaths","__PRIVATE_childContext","__PRIVATE_childContextForFieldPath","__PRIVATE_parsedValue","mask","__PRIVATE_ParsedUpdateData","moreFieldsAndValues","__PRIVATE_fieldPathFromArgument","__PRIVATE_allowArrays","__PRIVATE_looksLikeJsonObject","__PRIVATE_arrayElement","__PRIVATE_entryIndex","__PRIVATE_parsedEntry","__PRIVATE_childContextForArray","__PRIVATE_toNumber","fromDate","GeoPoint","DocumentReference","__PRIVATE_thisDb","__PRIVATE_otherDb","firestore","__PRIVATE__databaseId","__PRIVATE__key","__PRIVATE_childContextForField","search","__PRIVATE_connectionTimerId","__PRIVATE_idleTimerId","__PRIVATE_connection","__PRIVATE_credentialsProvider","__PRIVATE_performBackoff","__PRIVATE_isStarted","__PRIVATE_isOpen","__PRIVATE_idleTimer","__PRIVATE_handleIdleCloseTimer","__PRIVATE_cancelIdleCheck","stream","send","__PRIVATE_finalState","__PRIVATE_closeCount","__PRIVATE_resetToMax","__PRIVATE_invalidateToken","__PRIVATE_tearDown","__PRIVATE_onClose","__PRIVATE_dispatchIfNotClosed","__PRIVATE_getCloseGuardedDispatcher","token","__PRIVATE_startStream","__PRIVATE_rpcError","__PRIVATE_handleStreamClose","__PRIVATE_startRpc","__PRIVATE_onOpen","onMessage","__PRIVATE_startCloseCount","credentials","__PRIVATE_PersistentStream","__PRIVATE_openStream","__PRIVATE_watchChangeProto","__PRIVATE_fromWatchChange","snapshot","__PRIVATE_versionFromListenResponse","__PRIVATE_onWatchChange","__PRIVATE_encodedDatabaseId","addTarget","labels","__PRIVATE_toListenRequestLabels","__PRIVATE_sendRequest","o_","__PRIVATE_handshakeComplete_","__PRIVATE_writeMutations","__PRIVATE_responseProto","__PRIVATE_fromWriteResults","writeResults","__PRIVATE_onMutationResult","__PRIVATE_onHandshakeComplete","writes","__PRIVATE_rpcName","__PRIVATE_invokeRPC","__PRIVATE_invokeStreamingRPC","__PRIVATE_datastore","Set","__PRIVATE_ensureCommitNotCalled","__PRIVATE_datastoreImpl","response","__PRIVATE_fromMaybeDocument","__PRIVATE_recordVersion","write","__PRIVATE_toMutations","__PRIVATE_writtenDocs","__PRIVATE_preconditionForUpdate","__PRIVATE_lastWriteError","__PRIVATE_unwritten","__PRIVATE_readVersions","__PRIVATE__version","__PRIVATE_committed","__PRIVATE_docVersion","__PRIVATE_existingVersion","__PRIVATE_onlineStateHandler","__PRIVATE_watchStreamFailures","__PRIVATE_setAndBroadcast","__PRIVATE_onlineStateTimer","__PRIVATE_logClientOfflineWarningIfNecessary","__PRIVATE_clearOnlineStateTimer","__PRIVATE_newState","__PRIVATE_shouldWarnClientIsOffline","details","__PRIVATE_connectivityMonitor","__PRIVATE_addCallback","__PRIVATE_canUseNetwork","__PRIVATE_restartNetwork","__PRIVATE_onlineStateTracker","__PRIVATE_OnlineStateTracker","__PRIVATE_watchStream","__PRIVATE_PersistentListenStream","e_","__PRIVATE_onWatchStreamOpen","Yc","__PRIVATE_onWatchStreamClose","i_","__PRIVATE_onWatchStreamChange","__PRIVATE_writeStream","__PRIVATE_PersistentWriteStream","__PRIVATE_onWriteStreamOpen","__PRIVATE_onWriteStreamClose","c_","__PRIVATE_onWriteHandshakeComplete","u_","enableNetwork","__PRIVATE_enableNetworkInternal","__PRIVATE_shouldStartWatchStream","__PRIVATE_startWatchStream","__PRIVATE_fillWritePipeline","__PRIVATE_disableNetworkInternal","stop","__PRIVATE_writePipeline","__PRIVATE_cleanUpWatchStreamState","__PRIVATE_listenTargets","__PRIVATE_sendWatchRequest","__PRIVATE_sendUnwatchRequest","__PRIVATE_markIdle","__PRIVATE_syncEngine","__PRIVATE_watchChangeAggregator","__PRIVATE_watch","__PRIVATE_unwatch","__PRIVATE_WatchChangeAggregator","__PRIVATE_handleWatchStreamStart","__PRIVATE_indexedDbFailed","__PRIVATE_handleWatchStreamFailure","__PRIVATE_handleTargetError","__PRIVATE_disableNetworkUntilRecovery","__PRIVATE_handleDocumentChange","__PRIVATE_handleExistenceFilter","__PRIVATE_handleTargetChange","__PRIVATE_raiseWatchSnapshot","__PRIVATE_enqueueRetryable","__PRIVATE_createRemoteEvent","__PRIVATE_requestTargetData","__PRIVATE_applyRemoteEvent","s_58","__PRIVATE_rejectListen","__PRIVATE_canAddToWritePipeline","__PRIVATE_lastBatchIdRetrieved","__PRIVATE_nextMutationBatch","__PRIVATE_addToWritePipeline","__PRIVATE_shouldStartWriteStream","__PRIVATE_startWriteStream","__PRIVATE_handshakeComplete","__PRIVATE_writeHandshake","shift","__PRIVATE_applySuccessfulWrite","__PRIVATE_handleWriteError","__PRIVATE_handleHandshakeError","__PRIVATE_inhibitBackoff","__PRIVATE_rejectFailedWrite","Transaction","createWebStorageClientStateKey","createWebStorageMutationBatchKey","__PRIVATE_mutationKey","createWebStorageQueryTargetMetadataKey","__PRIVATE_mutationBatch","parse","__PRIVATE_validData","__PRIVATE_firestoreError","__PRIVATE_MutationMetadata","__PRIVATE_batchMetadata","__PRIVATE_QueryTargetMetadata","__PRIVATE_clientState","__PRIVATE_activeTargetIdsSet","__PRIVATE_RemoteClientState","onlineState","__PRIVATE_SharedOnlineState","__PRIVATE_localClientId","__PRIVATE_handleWebStorageEvent","__PRIVATE_WebStorageSharedClientState","__PRIVATE_escapedPersistenceKey","storage","__PRIVATE_localClientStorageKey","__PRIVATE_sequenceNumberKey","__PRIVATE_activeClients","__PRIVATE_LocalClientState","__PRIVATE_clientStateKeyRe","__PRIVATE_mutationBatchKeyRe","__PRIVATE_queryTargetKeyRe","__PRIVATE_onlineStateKey","__PRIVATE_storageListener","e_71","__PRIVATE_storageItem","__PRIVATE_fromWebStorageEntry","__PRIVATE_persistClientState","__PRIVATE_onlineStateJSON","__PRIVATE_fromWebStorageOnlineState","__PRIVATE_handleOnlineStateEvent","__PRIVATE_earlyEvents","t_65","__PRIVATE_extractActiveQueryTargets","__PRIVATE_persistMutationState","__PRIVATE_removeMutationState","__PRIVATE_queryState","__PRIVATE_isActiveQueryTarget","__PRIVATE_localClientState","__PRIVATE_addQueryTarget","__PRIVATE_removeQueryTarget","__PRIVATE_persistQueryTargetState","__PRIVATE_addPendingMutation","__PRIVATE_persistOnlineState","storageArea","__PRIVATE_fromWebStorageClientStateKey","__PRIVATE_handleClientStateEvent","__PRIVATE_fromWebStorageClientState","__PRIVATE_mutationMetadata","__PRIVATE_fromWebStorageMutationMetadata","__PRIVATE_handleMutationBatchEvent","__PRIVATE_queryTargetMetadata","__PRIVATE_fromWebStorageQueryTargetMetadata","__PRIVATE_handleQueryTargetEvent","__PRIVATE_seqString","__PRIVATE_parsed","Yl","__PRIVATE_toWebStorageJSON","__PRIVATE_mutationState","__PRIVATE_targetKey","__PRIVATE_targetMetadata","__PRIVATE_applyBatchState","__PRIVATE_applyTargetState","__PRIVATE_updatedClients","__PRIVATE_existingTargets","__PRIVATE_newTargets","__PRIVATE_addedTargets","__PRIVATE_removedTargets","__PRIVATE_applyActiveTargetsChange","__PRIVATE_activeTargets","__PRIVATE_kev","__PRIVATE_unionWith","__PRIVATE_localState","__PRIVATE__syncedDocuments","__PRIVATE_documentSet","__PRIVATE_docComparator","Pd","__PRIVATE_previousChanges","__PRIVATE_changeSet","__PRIVATE_DocumentChangeSet","__PRIVATE_oldDocumentSet","__PRIVATE_newMutatedKeys","__PRIVATE_newDocumentSet","__PRIVATE_needsRefill","__PRIVATE_lastDocInLimit","__PRIVATE_hasLimitToFirst","__PRIVATE_firstDocInLimit","__PRIVATE_hasLimitToLast","__PRIVATE_newMaybeDoc","__PRIVATE_oldDoc","__PRIVATE_oldDocHadPendingMutations","__PRIVATE_newDocHasPendingMutations","__PRIVATE_changeApplied","track","__PRIVATE_shouldWaitForSyncedDocument","md","gd","yd","ns","__PRIVATE_updateLimboDocuments","__PRIVATE_getChanges","__PRIVATE_c1","__PRIVATE_c2","__PRIVATE_applyTargetChange","__PRIVATE_limboChanges","__PRIVATE_newSyncState","__PRIVATE_limboDocuments","__PRIVATE_syncState","Sd","__PRIVATE_oldLimboDocuments","__PRIVATE_shouldBeInLimbo","__PRIVATE_RemovedLimboDocument","__PRIVATE_AddedLimboDocument","__PRIVATE_queryResult","__PRIVATE_computeDocChanges","__PRIVATE_fromInitialDocuments","__PRIVATE_remoteStore","updateFunction","__PRIVATE_runWithBackOff","__PRIVATE_createTransaction","__PRIVATE_tryRunUpdateFunction","commit","__PRIVATE_commitError","__PRIVATE_handleTransactionError","__PRIVATE_userPromiseError","__PRIVATE_retries","__PRIVATE_isRetryableTransactionError","view","__PRIVATE_sharedClientState","__PRIVATE_maxConcurrentLimboResolutions","q","__PRIVATE_ReferenceSet","__PRIVATE_forSyncEngine","tf","__PRIVATE_syncEngineListener","__PRIVATE_assertSubscribed","__PRIVATE_queryView","__PRIVATE_queryViewsByQuery","__PRIVATE_addLocalQueryTarget","__PRIVATE_computeInitialSnapshot","__PRIVATE_allocateTarget","__PRIVATE_initializeViewAndComputeSnapshot","__PRIVATE_isPrimaryClient","listen","__PRIVATE_executeQuery","__PRIVATE_View","__PRIVATE_viewDocChanges","__PRIVATE_synthesizedTargetChange","__PRIVATE_updateTrackedLimbos","__PRIVATE_QueryView","__PRIVATE_queriesByTarget","__PRIVATE_queries","__PRIVATE_removeLocalQueryTarget","__PRIVATE_releaseTarget","__PRIVATE_clearQueryState","__PRIVATE_unlisten","__PRIVATE_removeAndCleanupTarget","__PRIVATE_userCallback","__PRIVATE_localWrite","__PRIVATE_addMutationCallback","__PRIVATE_emitNewSnapsAndNotifyLocalStore","__PRIVATE_TransactionRunner","__PRIVATE_run","__PRIVATE_limboResolution","__PRIVATE_activeLimboResolutionsByTarget","__PRIVATE_receivedDocument","source","__PRIVATE_newViewSnapshots","__PRIVATE_applyOnlineStateChange","__PRIVATE_onOnlineStateChange","__PRIVATE_updateQueryState","__PRIVATE_limboKey","__PRIVATE_activeLimboTargetsByKey","__PRIVATE_pumpEnqueuedLimboResolutions","__PRIVATE_mutationBatchResult","__PRIVATE_processUserCallback","__PRIVATE_triggerPendingWritesCallbacks","__PRIVATE_updateMutationState","__PRIVATE_rejectBatch","__PRIVATE_highestBatchId","__PRIVATE_callbacks","__PRIVATE_pendingWritesCallbacks","__PRIVATE_errorMessage","clear","__PRIVATE_newCallbacks","__PRIVATE_mutationUserCallbacks","__PRIVATE_toKey","__PRIVATE_onWatchError","__PRIVATE_limboDocumentRefs","__PRIVATE_removeReferencesForId","__PRIVATE_removeLimboTarget","__PRIVATE_limboTargetId","__PRIVATE_limboChange","__PRIVATE_trackLimboChange","__PRIVATE_enqueuedLimboResolutions","__PRIVATE_limboTargetIdGenerator","__PRIVATE_LimboResolution","__PRIVATE_newSnaps","__PRIVATE_docChangesInAllViews","__PRIVATE_queriesProcessed","__PRIVATE_fromSnapshot","__PRIVATE_notifyLocalViewChanges","__PRIVATE_fnName","__PRIVATE_handleUserChange","__PRIVATE_rejectOutstandingPendingWritesCallbacks","__PRIVATE_handleCredentialChange","disableNetwork","__PRIVATE_keySet","__PRIVATE_syncedDocuments","__PRIVATE_SyncEngine","__PRIVATE__isPrimaryClient","__PRIVATE_synchronizeWithPersistedState","__PRIVATE_setOnlineState","__PRIVATE_batchState","__PRIVATE_lookupMutationDocuments","__PRIVATE_removeCachedMutationBatchMetadata","__PRIVATE_getAllActiveQueryTargets","__PRIVATE_synchronizeQueryViewsAndRaiseSnapshots","__PRIVATE_activeQueries","__PRIVATE_applyPrimaryState","t_74","__PRIVATE_isLocalQueryTarget","__PRIVATE_resetLimboDocuments","__PRIVATE_removeAllReferences","__PRIVATE_transitionToPrimary","e_92","t_78","__PRIVATE_synchronizeViewAndComputeSnapshot","__PRIVATE_getTarget","__PRIVATE_synthesizeTargetToQuery","__PRIVATE_synthesizedRemoteEvent","__PRIVATE_createSynthesizedRemoteEventForCurrentChange","__PRIVATE_removed","e_95","t_81","subscribe","__PRIVATE_firstListen","__PRIVATE_queryInfo","__PRIVATE_QueryListenersInfo","__PRIVATE_viewSnap","onError","__PRIVATE_listeners","__PRIVATE_onViewSnapshot","__PRIVATE_raiseSnapshotsInSyncEvent","__PRIVATE_lastListen","__PRIVATE_viewSnaps","__PRIVATE_raisedEvent","observer","__PRIVATE_snapshotsInSyncListeners","__PRIVATE_queryObserver","__PRIVATE_snap","includeMetadataChanges","__PRIVATE_raisedInitialEvent","__PRIVATE_shouldRaiseEvent","__PRIVATE_shouldRaiseInitialEvent","__PRIVATE_raiseInitialEvent","__PRIVATE_maybeOnline","__PRIVATE_waitForSyncWhenOnline","__PRIVATE_hasPendingWritesChanged","__PRIVATE_localDocumentsView","__PRIVATE_matchesAllDocuments","__PRIVATE_executeFullCollectionScan","__PRIVATE_previousResults","__PRIVATE_applyQuery","__PRIVATE_updatedResults","__PRIVATE_sortedPreviousResults","__PRIVATE_limboFreeSnapshotVersion","__PRIVATE_docAtLimitEdge","__PRIVATE_batchIndex","__PRIVATE_indexOfExistingBatchId","__PRIVATE_batchesByDocumentKey","__PRIVATE_findMutationBatch","__PRIVATE_rawIndex","__PRIVATE_indexOfBatchId","__PRIVATE_findMutationBatches","prefix","__PRIVATE_startPath","__PRIVATE_rowKeyPath","__PRIVATE_references","__PRIVATE_sizer","__PRIVATE_currentSize","iterator","__PRIVATE_MemoryRemoteDocumentCache","__PRIVATE_forTargetCache","__PRIVATE_highestSequenceNumber","__PRIVATE_removals","__PRIVATE_addReferences","__PRIVATE_removeReferences","__PRIVATE_matchingKeys","__PRIVATE_referencesForId","__PRIVATE_referenceDelegateFactory","__PRIVATE_MemoryTargetCache","__PRIVATE_MemoryIndexManager","__PRIVATE_documentSize","__PRIVATE_mutationQueues","__PRIVATE_MemoryMutationQueue","__PRIVATE_MemoryTransaction","__PRIVATE_onTransactionStarted","__PRIVATE_onTransactionCommitted","__PRIVATE_or","__PRIVATE_MemoryEagerDelegate","aT","__PRIVATE__orphanedDocuments","__PRIVATE_localViewReferences","__PRIVATE_orphanedDocuments","__PRIVATE_isReferenced","__PRIVATE_mutationQueuesContainKey","__PRIVATE_cfg","__PRIVATE_createSharedClientState","__PRIVATE_createPersistence","__PRIVATE_gcScheduler","__PRIVATE_createGarbageCollectionScheduler","__PRIVATE_createLocalStore","__PRIVATE_createRemoteStore","__PRIVATE_createSyncEngine","__PRIVATE_eventManager","__PRIVATE_createEventManager","__PRIVATE_EventManager","__PRIVATE_IndexFreeQueryEngine","__PRIVATE_MemoryPersistence","__PRIVATE_factory","__PRIVATE_RemoteStore","__PRIVATE_newConnectivityMonitor","__PRIVATE_MemorySharedClientState","__PRIVATE_MemoryComponentProvider","initialize","__PRIVATE_setPrimaryStateListener","__PRIVATE_MultiTabLocalStore","__PRIVATE_MultiTabSyncEngine","__PRIVATE_LruScheduler","__PRIVATE_buildStoragePrefix","__PRIVATE_persistenceSettings","synchronizeTabs","__PRIVATE_withCacheSize","cacheSizeBytes","__PRIVATE_durable","clearPersistence","__PRIVATE_AutoId","__PRIVATE_newId","__PRIVATE_componentProvider","__PRIVATE_verifyNotTerminated","__PRIVATE_initializationDone","__PRIVATE_persistenceResult","__PRIVATE_initialized","__PRIVATE_setChangeListener","__PRIVATE_initializeComponents","__PRIVATE_loadConnection","__PRIVATE_DatastoreImpl","Aa","mT","T_","RT","Qd","PT","__PRIVATE_eventMgr","__PRIVATE_setDatabaseDeletedListener","terminate","__PRIVATE_canFallback","console","warn","VT","DOMException","__PRIVATE_isShuttingDown","__PRIVATE_verifyOperationInProgress","__PRIVATE_enqueueAndInitiateShutdown","__PRIVATE_removeChangeListener","__PRIVATE_registerPendingWritesCallback","__PRIVATE_QueryListener","__PRIVATE_clientTerminated","__PRIVATE_readDocument","__PRIVATE_addSnapshotsInSyncListener","__PRIVATE_removeSnapshotsInSyncListener","ST","__PRIVATE_scheduleEvent","muted","eventHandler","__PRIVATE_isPartialObserver","__PRIVATE_methods","object","method","timestampsInSnapshots","__PRIVATE_serverTimestampBehavior","converter","__PRIVATE_convertTimestamp","__PRIVATE_convertServerTimestamp","__PRIVATE_convertReference","__PRIVATE_convertGeoPoint","__PRIVATE_convertArray","__PRIVATE_convertObject","__PRIVATE_convertValue","__PRIVATE_getPreviousValue","__PRIVATE_normalizedValue","toDate","__PRIVATE_resourcePath","CACHE_SIZE_UNLIMITED","__PRIVATE_MINIMUM_CACHE_SIZE_BYTES","experimentalForceLongPolling","__PRIVATE_databaseIdOrApp","__PRIVATE_AsyncQueue","__PRIVATE_ensureClientConfigured","__PRIVATE__firestoreClient","app","__PRIVATE__firebaseApp","Firestore","__PRIVATE_databaseIdFromApp","__PRIVATE__persistenceKey","__PRIVATE__credentials","__PRIVATE_FirebaseCredentialsProvider","external","__PRIVATE_EmptyCredentialsProvider","__PRIVATE__componentProvider","__PRIVATE__settings","__PRIVATE_FirestoreSettings","JT","__PRIVATE__userDataReader","__PRIVATE_UserDataReader","__PRIVATE_settingsLiteral","__PRIVATE_newSettings","getAuthHeaderValueForFirstParty","__PRIVATE_FirstPartyCredentialsProvider","experimentalTabSynchronization","__PRIVATE_configureClient","__PRIVATE__queue","__PRIVATE_enqueueAndForgetEvenAfterShutdown","__PRIVATE_makeDatabaseInfo","_removeServiceInstance","sE","waitForPendingWrites","arg","__PRIVATE_onSnapshotsInSyncInternal","__PRIVATE_asyncObserver","__PRIVATE_AsyncObserver","__PRIVATE_mute","__PRIVATE_DatabaseInfo","__PRIVATE_FirestoreClient","__PRIVATE_pathString","CollectionReference","__PRIVATE_forPath","__PRIVATE_InternalQuery","WriteBatch","SILENT","level","__PRIVATE__firestore","__PRIVATE__transaction","documentRef","__PRIVATE_validateReference","__PRIVATE_lookup","DocumentSnapshot","__PRIVATE__converter","__PRIVATE_validateSetOptions","__PRIVATE_convertedValue","merge","mergeFields","__PRIVATE__dataReader","__PRIVATE_parseMergeData","__PRIVATE_parseSetData","__PRIVATE_fieldOrUpdateData","__PRIVATE_parseUpdateVarargs","__PRIVATE_parseUpdateData","__PRIVATE_verifyNotCommitted","__PRIVATE__mutations","__PRIVATE__committed","__PRIVATE_currArg","__PRIVATE_internalOptions","complete","__PRIVATE_onSnapshotInternal","__PRIVATE_errHandler","__PRIVATE_internalListener","__PRIVATE_validateGetOptions","__PRIVATE_getDocumentFromLocalCache","__PRIVATE_getViaSnapshotListener","Of","__PRIVATE__document","__PRIVATE__fromCache","__PRIVATE__hasPendingWrites","__PRIVATE_validateSnapshotOptions","QueryDocumentSnapshot","fromFirestore","__PRIVATE_UserDataWriter","__PRIVATE__areTimestampsInSnapshotsEnabled","serverTimestamps","SnapshotMetadata","__PRIVATE__query","opStr","__PRIVATE_fieldValue","__PRIVATE_enums","__PRIVATE_validateDisjunctiveFilterElements","__PRIVATE_referenceList","__PRIVATE_parseDocumentIdValue","__PRIVATE_parseQueryValue","__PRIVATE_validateNewFilter","__PRIVATE_addFilter","directionStr","__PRIVATE_validateNewOrderBy","__PRIVATE_addOrderBy","__PRIVATE_withLimitToFirst","__PRIVATE_withLimitToLast","__PRIVATE_docOrField","__PRIVATE_boundFromDocOrFields","__PRIVATE_withStartAt","__PRIVATE_withEndAt","__PRIVATE_boundFromDocument","fE","__PRIVATE_allFields","__PRIVATE_boundFromFields","components","__PRIVATE_rawValue","__PRIVATE_wrapped","__PRIVATE_validateHasExplicitOrderByForLimitToLast","QuerySnapshot","__PRIVATE_firestoreClient","__PRIVATE_getDocumentsFromLocalCache","__PRIVATE_documentIdValue","operator","__PRIVATE_arrayOps","__PRIVATE_disjunctiveOps","__PRIVATE_isArrayOp","__PRIVATE_isDisjunctiveOp","__PRIVATE_existingField","__PRIVATE_validateOrderByAndInequalityMatch","__PRIVATE_conflictingOp","__PRIVATE_findFilterOperator","__PRIVATE_inequality","__PRIVATE__originalQuery","__PRIVATE__snapshot","thisArg","__PRIVATE_convertToDocumentImpl","__PRIVATE__cachedChanges","__PRIVATE__cachedChangesIncludeMetadataChanges","oldIndex","newIndex","__PRIVATE_indexTracker","__PRIVATE_resultChangeType","__PRIVATE__path","toFirestore","__PRIVATE_docRef","__PRIVATE_typeDescription","__PRIVATE_validator","__PRIVATE_validateOptionalArrayElements","__PRIVATE_applyFirestoreDataConverter","__PRIVATE_makeConstructorPrivate","__PRIVATE_cls","__PRIVATE_optionalMessage","__PRIVATE_PublicConstructor","assign","__PRIVATE_PublicFirestore","__PRIVATE_PublicTransaction","__PRIVATE_PublicWriteBatch","__PRIVATE_PublicDocumentReference","__PRIVATE_PublicDocumentSnapshot","__PRIVATE_PublicQueryDocumentSnapshot","__PRIVATE_PublicQuery","__PRIVATE_PublicQuerySnapshot","__PRIVATE_PublicCollectionReference","__PRIVATE_PublicFieldValue","__PRIVATE_ArrayUnionFieldValueImpl","__PRIVATE_ArrayRemoveFieldValueImpl","__PRIVATE_NumericIncrementFieldValueImpl","__PRIVATE_PublicBlob","__PRIVATE_firestoreNamespace","FieldValue","__PRIVATE_onNetworkAvailable","__PRIVATE_onNetworkUnavailable","__PRIVATE_configureNetworkMonitoring","__PRIVATE_networkAvailableListener","__PRIVATE_networkUnavailableListener","__PRIVATE_sendFn","__PRIVATE_closeFn","__PRIVATE_wrappedOnOpen","__PRIVATE_wrappedOnClose","__PRIVATE_wrappedOnMessage","__PRIVATE_RPC_NAME_REST_MAPPING","BatchGetDocuments","Commit","__PRIVATE_X_GOOG_API_CLIENT_VALUE","info","__PRIVATE_baseUrl","__PRIVATE_header","url","__PRIVATE_makeUrl","__PRIVATE_xhr","XhrIo","listenOnce","EventType","COMPLETE","getLastErrorCode","ErrorCode","NO_ERROR","json","getResponseJson","TIMEOUT","HTTP_ERROR","getStatus","getResponseText","__PRIVATE_responseError","__PRIVATE_firestoreErrorCode","__PRIVATE_serverError","toLowerCase","__PRIVATE_jsonObj","__PRIVATE_requestString","Content-Type","__PRIVATE_modifyHeadersForRequest","__PRIVATE_urlParts","__PRIVATE_webchannelTransport","createWebChannelTransport","httpSessionIdParam","initMessageHeaders","messageUrlParams","sendRawJson","supportsCrossDomainXhr","internalChannelParams","forwardChannelRequestTimeoutMs","isMobileCordova","isReactNative","isElectron","isIE","isUWP","isBrowserExtension","httpHeadersOverwriteParam","channel","createWebChannel","__PRIVATE_opened","closed","__PRIVATE_streamBridge","__PRIVATE_StreamBridge","xE","BE","__PRIVATE_unguardedEventListen","param","WebChannel","OPEN","CLOSE","__PRIVATE_callOnClose","MESSAGE","__PRIVATE_msgData","__PRIVATE_msgDataOrError","__PRIVATE_callOnMessage","__PRIVATE_callOnOpen","__PRIVATE_urlRpcName","__PRIVATE_registerFirestore","__PRIVATE_firestoreFactory","registerComponent","Component","container","__PRIVATE_IndexedDbComponentProvider","getProvider","setServiceProps","registerVersion","__PRIVATE_setPlatform","__PRIVATE_WebChannelConnection","__PRIVATE_BrowserConnectivityMonitor","__PRIVATE_NoopConnectivityMonitor","__PRIVATE_JsonProtoSerializer","hi","__PRIVATE_encoded","raw","__PRIVATE_nBytes","crypto","self","msCrypto","getRandomValues"],"mappings":";;;;;;4QAoBaA,IAAcC,EAASD;ICUlCE,WAAqBC;QAAAC,WAAAD;;WAErBD,gBAAAA;QACE,OAAmB,QAAZE,KAAKD;;;;;;IAOdD,gBAAAA;QACE,OAAIE,KAAKC,MACA,SAASD,KAAKD,MAEd;OAIXD,sBAAAA,SAAQI;QACN,OAAOA,EAAUH,QAAQC,KAAKD;;;;mDA1BE,IAAII,EAAK;;;AAI3CA,MAAqC,IAAIA,EAAK,2BAC9CA,MAA8B,IAAIA,EAAK;;;;;;;;;;;;;;;;;;ACHlC,IAAMC,IAAO;;;;IAIlBC,IAAI;;IAGJC,WAAW;;IAGXC,SAAS;;;;;;;IAQTC,kBAAkB;;;;;;;;IASlBC,mBAAmB;;IAGnBC,WAAW;;;;;IAMXC,gBAAgB;;;;;;;;IAShBC,mBAAmB;;;;;IAMnBC,iBAAiB;;;;;IAMjBC,oBAAoB;;;;;;;;;;;;;;;;;;;;;IAsBpBC,qBAAqB;;;;;;;;IASrBC,SAAS;;;;;;;;;;;;;;;;IAiBTC,cAAc;;IAGdC,eAAe;;;;;IAMfC,UAAU;;;;;;;;IASVC,aAAa;;IAGbC,WAAW;;IAaXvB,WAAqBwB,GAAqBC;QAA1CzB;gBACE0B,IAAAA,aAAMD,mBADaD,GAAqBtB,YAAAuB,GAH1CvB,SAAO;;;;QASLA,EAAKyB,WAAW;YAAM,OAAGzB,EAAK0B,oBAAe1B,EAAKsB,eAAUtB,EAAKuB;;;WAVjCI;EAAAA,YCjGlC7B,SAAY8B,GAAsBC;IAAA7B,YAAA6B,GAFlC7B,YAAO,SAGLA,KAAK8B,IAAc;;IAEnB9B,KAAK8B,EAA2BC,gBAAI,YAAUH;;IAqClD9B;;;;;;QAMEE,SAA0D;;WAE1DF,uBAAAA;QACE,OAAOkC,QAAQC,QAAsB;OAGvCnC,gBAAAA,eAEAA,gBAAAA,SAAkBoC;QAKhBlC,KAAKkC,IAAiBA;;QAEtBA,EAAe/B,EAAKU;OAGtBf,gBAAAA;QAKEE,KAAKkC,IAAiB;;;IA4BxBpC,WAAYqC;QAAZrC;;;;mBAnBAE,SAAiE;;QAGzDA,mBAAoBG,EAAKU,iBACjCb;;;;;QAMAA,SAAuB;;QAGvBA,SAA0D,MAElDA,wBAKNA,KAAKoC,IAAgB;YACnBpC,EAAKqC,KACLrC,EAAKsC,cAActC,EAAKuC,KACxBvC,EAAKwC,QACDxC,EAAKkC,KACPlC,EAAKkC,EAAelC,EAAKsC;WAI7BtC,KAAKqC,IAAe,GAEpBrC,KAAKyC,OAAON,EAAaO,aAAa;YAAEC;YAEpC3C,KAAKyC,OACPzC,KAAKyC,KAAKG,qBAAqB5C,KAAmB6C;;QAGlD7C,KAAKoC,EAAc,OACnBD,EAAaW,MAAMC,MACjBN,SAAAA;YACEzC,EAAKyC,OAAOA,GACRzC,EAAKoC;;YAEPpC,EAAKyC,KAAKG,qBAAqB5C,EAAKoC;aAGxC;;WAONtC,uBAAAA;QAAAA,cASQkD,IAAsBhD,KAAKqC,GAC3BY,IAAejD,KAAKiD;;;;gBAG1B,OAFAjD,KAAKiD,mBAEAjD,KAAKyC,OAIHzC,KAAKyC,KAAKS,SAASD,GAAcF,MAAKI,SAAAA;;;;YAI3C,IAAInD,EAAKqC,MAAiBW,GACxB,MAAM,IAAII,EACRhD,EAAKY,SACL;YAGF,OAAImC,KACFE,GACmC,mBAA1BF,EAAUG,cAGZ,IAAIC,EAAWJ,EAAUG,aAAatD,EAAKsC,gBAE3C;cApBJN,QAAQC,QAAQ;OA0B3BnC,gBAAAA;QACEE,KAAKiD;OAGPnD,gBAAAA,SAAkBoC;QAKhBlC,KAAKkC,IAAiBA;;QAGlBlC,KAAKwC,KACPN,EAAelC,KAAKsC;OAIxBxC,gBAAAA;QAUME,KAAKyC,QACPzC,KAAKyC,KAAKe,wBAAwBxD,KAAmB6C,IAEvD7C,KAAKoC,IAAgB,MACrBpC,KAAKkC,IAAiB;;;;;;IAOhBpC,gBAAAA;QACN,IAAM2D,IAAazD,KAAKyC,QAAQzC,KAAKyC,KAAKiB;QAK1C,OAJAL,GACiB,SAAfI,KAA6C,mBAAfA,IAGzB,IAAItD,EAAKsD;;;IAwBlB3D,WAAoB6D,GAAoBC;iBAApBD,YAAoBC,GAHxC5D,YAAO,cACPA,YAAOG,EAAK0D;;WAIZC;aAAAA;YACE,IAAMC,IAAwC;gBAC5CC,mBAAmBhE,KAAK4D;eAEpBK,IAAajE,KAAK2D,EAAKlB,KAAKyB,EAAgC;YAIlE,OAHID,MACFF,EAAuBhC,gBAAIkC,IAEtBF;;;;;;IAUTjE,WAAoB6D,GAAoBC;iBAApBD,YAAoBC;;WAExC9D,uBAAAA;QACE,OAAOkC,QAAQC,QAAQ,IAAIkC,EAAgBnE,KAAK2D,GAAM3D,KAAK4D;OAG7D9D,gBAAAA,SAAkBoC;;QAEhBA,EAAe/B,EAAK0D;OAGtB/D,gBAAAA,eAEAA,gBAAAA;;ICzSAA,WAAqBsE,GAA0BC;QAC7C,IADmBrE,eAAAoE,GAA0BpE,mBAAAqE,GACzCA,IAAc,GAChB,MAAM,IAAIjB,EACRhD,EAAKI,kBACL,yCAAyC6D;QAG7C,IAAIA,KAAe,KACjB,MAAM,IAAIjB,EACRhD,EAAKI,kBACL,yCAAyC6D;QAG7C,IAAID,KA9BY,aA+Bd,MAAM,IAAIhB,EACRhD,EAAKI,kBACL,qCAAqC4D;;gBAIzC,IAAIA,KAAW,cACb,MAAM,IAAIhB,EACRhD,EAAKI,kBACL,qCAAqC4D;;mBArC3CtE;QACE,OAAOwE,EAAUC,WAAWC,KAAKC;oBAGnC3E,SAAgB4E;QACd,OAAOJ,EAAUC,WAAWG,EAAKC;sBAGnC7E,SAAkB8E;QAChB,IAAMR,IAAUS,KAAKC,MAAMF,IAAe;QAE1C,OAAO,IAAIN,EAAUF,GAD2B,OAAjCQ,IAAyB,MAAVR;OAgChCtE,qBAAAA;QACE,OAAO,IAAI0E,KAAKxE,KAAK+E;OAGvBjF,uBAAAA;QACE,OAAsB,MAAfE,KAAKoE,UAAiBpE,KAAKqE,cAAc;OAGlDvE,gBAAAA,SAAWkF;QACT,OAAIhF,KAAKoE,YAAYY,EAAMZ,UAClBa,GAAoBjF,KAAKqE,aAAaW,EAAMX,eAE9CY,GAAoBjF,KAAKoE,SAASY,EAAMZ;OAGjDtE,sBAAAA,SAAQkF;QACN,OACEA,EAAMZ,YAAYpE,KAAKoE,WAAWY,EAAMX,gBAAgBrE,KAAKqE;OAIjEvE,uBAAAA;QACE,OACE,uBACAE,KAAKoE,UACL,mBACApE,KAAKqE,cACL;OAIJvE,sBAAAA;;;;;;;QAOE,IAAMoF,IAAkBlF,KAAKoE,WAnFb;;gBAuFhB,OAFyBe,OAAOD,GAAiBE,SAAS,IAAI,OAEpC,MADGD,OAAOnF,KAAKqE,aAAae,SAAS,GAAG;;;IC3EpEtF,WAA4BuF;QAAArF,iBAAAqF;;iBAR5BvF,SAAqB8B;QACnB,OAAO,IAAI0D,EAAgB1D;eAG7B9B;QACE,OAAO,IAAIwF,EAAgB,IAAIhB,EAAU,GAAG;OAK9CxE,gBAAAA,SAAUkF;QACR,OAAOhF,KAAKqF,UAAUE,EAAWP,EAAMK;OAGzCvF,sBAAAA,SAAQkF;QACN,OAAOhF,KAAKqF,UAAUG,QAAQR,EAAMK;;iFAItCvF,gBAAAA;;QAEE,OAAgC,MAAzBE,KAAKqF,UAAUjB,UAAgBpE,KAAKqF,UAAUhB,cAAc;OAGrEvE,uBAAAA;QACE,OAAO,qBAAqBE,KAAKqF,UAAU5D,aAAa;OAG1D3B,gBAAAA;QACE,OAAOE,KAAKqF;;;ICvBdvF,WAAY2F,GAAoBC,GAAiBC;mBAC3CD,IACFA,IAAS,IACAA,IAASD,EAASE,UAC3BC,iBAGED,IACFA,IAASF,EAASE,SAASD,IAClBC,IAASF,EAASE,SAASD,KACpCE;QAEF5F,KAAKyF,WAAWA,GAChBzF,KAAK0F,SAASA,GACd1F,KAAK6F,IAAMF;;WAqBbA;aAAAA;YACE,OAAO3F,KAAK6F;;;;QAGd/F,sBAAAA,SAAQkF;QACN,OAA4C,MAArCc,EAASC,EAAW/F,MAAMgF;OAGnClF,oBAAAA,SAAMkG;QACJ,IAAMP,IAAWzF,KAAKyF,SAASQ,MAAMjG,KAAK0F,QAAQ1F,KAAKkG;QAQvD,OAPIF,aAAsBF,IACxBE,EAAWG,SAAQC,SAAAA;YACjBX,EAASY,KAAKD;cAGhBX,EAASY,KAAKL,IAEThG,KAAKsG,EAAUb;;+DAIhB3F,oBAAAA;QACN,OAAOE,KAAK0F,SAAS1F,KAAK2F;OAG5B7F,gBAAAA,SAASyG;QAMP,OALAA,eAAOA,IAAqB,IAAIA,GAKzBvG,KAAKsG,EACVtG,KAAKyF,UACLzF,KAAK0F,SAASa,GACdvG,KAAK2F,SAASY;OAIlBzG,gBAAAA;QAEE,OAAOE,KAAKsG,EAAUtG,KAAKyF,UAAUzF,KAAK0F,QAAQ1F,KAAK2F,SAAS;OAGlE7F,gBAAAA;QAEE,OAAOE,KAAKyF,SAASzF,KAAK0F;OAG5B5F,gBAAAA;QACE,OAAOE,KAAK8C,IAAI9C,KAAK2F,SAAS;OAGhC7F,kBAAAA,SAAI0G;QAEF,OAAOxG,KAAKyF,SAASzF,KAAK0F,SAASc;OAGrC1G,gBAAAA;QACE,OAAuB,MAAhBE,KAAK2F;OAGd7F,gBAAAA,SAAWkF;QACT,IAAIA,EAAMW,SAAS3F,KAAK2F,QACtB;QAGF,KAAK,IAAIc,IAAI,GAAGA,IAAIzG,KAAK2F,QAAQc,KAC/B,IAAIzG,KAAK8C,IAAI2D,OAAOzB,EAAMlC,IAAI2D,IAC5B;QAIJ;OAGF3G,gBAAAA,SAAoB4G;QAClB,IAAI1G,KAAK2F,SAAS,MAAMe,EAAef,QACrC;QAGF,KAAK,IAAIc,IAAI,GAAGA,IAAIzG,KAAK2F,QAAQc,KAC/B,IAAIzG,KAAK8C,IAAI2D,OAAOC,EAAe5D,IAAI2D,IACrC;QAIJ;OAGF3G,sBAAAA,SAAQ6G;QACN,KAAK,IAAIF,IAAIzG,KAAK0F,QAAQkB,IAAM5G,KAAKkG,SAASO,IAAIG,GAAKH,KACrDE,EAAG3G,KAAKyF,SAASgB;OAIrB3G,gBAAAA;QACE,OAAOE,KAAKyF,SAASQ,MAAMjG,KAAK0F,QAAQ1F,KAAKkG;aAG/CpG,SACE+G,GACAC;QAGA,KADA,IAAMjB,IAAMhB,KAAKkC,IAAIF,EAAGlB,QAAQmB,EAAGnB,SAC1Bc,IAAI,GAAGA,IAAIZ,GAAKY,KAAK;YAC5B,IAAMO,IAAOH,EAAG/D,IAAI2D,IACdQ,IAAQH,EAAGhE,IAAI2D;YACrB,IAAIO,IAAOC,GACT,QAAQ;YAEV,IAAID,IAAOC,GACT,OAAO;;QAGX,OAAIJ,EAAGlB,SAASmB,EAAGnB,UACT,IAENkB,EAAGlB,SAASmB,EAAGnB,SACV,IAEF;;;;;;WAQuBG,mBACtBhG,gBAAAA,SACR2F,GACAC,GACAC;QAEA,OAAO,IAAIuB,EAAazB,GAAUC,GAAQC;OAG5C7F,gBAAAA;;;;QAKE,OAAOE,KAAKmH,IAAUC,KAAK;OAG7BtH,uBAAAA;QACE,OAAOE,KAAKqH;;;;;UAMdvH,SAAkBwH;;;;QAKhB,IAAIA,EAAKC,QAAQ,SAAS,GACxB,MAAM,IAAInE,EACRhD,EAAKI,kBACL,mBAAiB8G;;;gBAQrB,OAAO,IAAIJ,EAFMI,EAAKE,MAAM,KAAKC,QAAOrB,SAAAA;YAAWA,OAAAA,EAAQT,SAAS;;;EAtCtCG;;;;;;;GA2CzBoB,OAAa,IAAIA,EAAa;;AAGvC,IAAMQ,IAAmB;;;;WAGM5B,mBACnBhG,gBAAAA,SACR2F,GACAC,GACAC;QAEA,OAAO,IAAIgC,EAAUlC,GAAUC,GAAQC;;;;;;UAOjC7F,SAAyBsG;QAC/B,OAAOsB,EAAiBE,KAAKxB;OAG/BtG,gBAAAA;QACE,OAAOE,KAAKmH,IACTU,KAAIC,SAAAA;mBACHA,IAAMA,EAAIC,QAAQ,MAAM,QAAQA,QAAQ,KAAK,QACxCJ,EAAUK,EAAkBF,OAC/BA,IAAM,MAAMA,IAAM;YAEbA;YAERV,KAAK;OAGVtH,uBAAAA;QACE,OAAOE,KAAKqH;;;;;IAMdvH,gBAAAA;QACE,OAAuB,MAAhBE,KAAK2F,UAnQiB,eAmQD3F,KAAK8C,IAAI;;;;;UAMvChD;QACE,OAAO,IAAI6H,EAAU,EA1QQ;;;;;;;;;;;;UAuR/B7H,SAAwBwH;QAmBtB,KAlBA,IAAM7B,IAAqB,IACvBwC,IAAU,IACVxB,IAAI,GAEFyB,IAAoB;YACxB,IAAuB,MAAnBD,EAAQtC,QACV,MAAM,IAAIvC,EACRhD,EAAKI,kBACL,yBAAuB8G;YAI3B7B,EAASY,KAAK4B,IACdA,IAAU;WAGRE,QAEG1B,IAAIa,EAAK3B,UAAQ;YACtB,IAAMyC,IAAId,EAAKb;YACf,IAAU,SAAN2B,GAAY;gBACd,IAAI3B,IAAI,MAAMa,EAAK3B,QACjB,MAAM,IAAIvC,EACRhD,EAAKI,kBACL,yCAAyC8G;gBAG7C,IAAMe,IAAOf,EAAKb,IAAI;gBACtB,IAAe,SAAT4B,KAA0B,QAATA,KAAyB,QAATA,GACrC,MAAM,IAAIjF,EACRhD,EAAKI,kBACL,uCAAuC8G;gBAG3CW,KAAWI,GACX5B,KAAK;mBACU,QAAN2B,KACTD,KAAeA,GACf1B,OACe,QAAN2B,KAAcD,KAIvBF,KAAWG,GACX3B,QAJAyB,KACAzB;;QAQJ,IAFAyB,KAEIC,GACF,MAAM,IAAI/E,EACRhD,EAAKI,kBACL,6BAA6B8G;QAIjC,OAAO,IAAIK,EAAUlC;;EAlHMK;;yEAqHtB6B,OAAa,IAAIA,EAAU;;;;;;;;;;;;;;;;;;;ICjVlC7H,WAAqBwH;QAAAtH,YAAAsH;;iBAQrBxH,SAAgB4B;QACd,OAAO,IAAI4G,EAAYpB,EAAaqB,EAAW7G,GAAM8G,EAAS;;0EAIhE1I,iBAAAA,SAAgB2I;QACd,OACEzI,KAAKsH,KAAK3B,UAAU,KACpB3F,KAAKsH,KAAKxE,IAAI9C,KAAKsH,KAAK3B,SAAS,OAAO8C;OAI5C3I,sBAAAA,SAAQkF;QACN,OACY,SAAVA,KAAqE,MAAnDkC,EAAanB,EAAW/F,KAAKsH,MAAMtC,EAAMsC;OAI/DxH,uBAAAA;QACE,OAAOE,KAAKsH,KAAK7F;aAKnB3B,SAAkB4I,GAAiBC;QACjC,OAAOzB,EAAanB,EAAW2C,EAAGpB,MAAMqB,EAAGrB;cAG7CxH,SAAqBwH;QACnB,OAAOA,EAAK3B,SAAS,KAAM;;;;;;;;WAS7B7F,SAAoB2F;QAClB,OAAO,IAAI6C,EAAY,IAAIpB,EAAazB,EAASQ;;;;;;;;;;;;;;;;;;;aC9CrC2C,EAAcC;IAC5B,IAAIC,IAAQ;IACZ,KAAK,IAAMC,KAAOF,GACZG,OAAOC,UAAUC,eAAeC,KAAKN,GAAKE,MAC5CD;IAGJ,OAAOA;;;SAGO3C,EACd0C,GACAlC;IAEA,KAAK,IAAMoC,KAAOF,GACZG,OAAOC,UAAUC,eAAeC,KAAKN,GAAKE,MAC5CpC,EAAGoC,GAAKF,EAAIE;;;SAKFK,EAAWP;IAKzB,KAAK,IAAME,KAAOF,GAChB,IAAIG,OAAOC,UAAUC,eAAeC,KAAKN,GAAKE,IAC5C;IAGJ;;;;;;;;;;;;;;;;;;;;;;;;;;cDFe,IAAIT,EAAY,IAAIpB,EAAa;;;IErBhDpH,WAAqCuJ;kBAAAA;;gCAErCvJ,SAAwBwJ;QAEtB,OAAO,IAAIC,EADUC,GAAgBC,KAAcC,KAAKJ;0BAI1DxJ,SAAsB6J;QAEpB,OAAO,IAAIJ;;;;iBA2B4BI;YAEzC,KADA,IAAIN,IAAe,IACV5C,IAAI,GAAGA,IAAIkD,EAAMhE,UAAUc,GAClC4C,KAAgBlE,OAAOyE,aAAaD,EAAMlD;YAE5C,OAAO4C;UAjC2CM;OAIlD7J,uBAAAA;QACE,OAAO0J,GAAgBC,KAAcI,KAAK7J,KAAKqJ;OAGjDvJ,2BAAAA;QACE,gBA8BuCuJ;YAEzC,KADA,IAAMS,IAAS,IAAIC,WAAWV,EAAa1D,SAClCc,IAAI,GAAGA,IAAI4C,EAAa1D,QAAQc,KACvCqD,EAAOrD,KAAK4C,EAAaW,WAAWvD;YAEtC,OAAOqD;UAnC6B9J,KAAKqJ;OAGzCvJ,iBAAAA;QACE,OAAkC,IAA3BE,KAAKqJ,GAAa1D;OAG3B7F,gBAAAA,SAAUkF;QACR,OAAOC,GAAoBjF,KAAKqJ,IAAcrE,EAAMqE;OAGtDvJ,sBAAAA,SAAQkF;QACN,OAAOhF,KAAKqJ,OAAiBrE,EAAMqE;;;;SCnCvBY,EAAkBrI;IAChC,OAAOA,QAAAA;;;yDAIOsI,EAAetI;;;IAG7B,QAAkB,MAAXA,KAAgB,IAAIA;;;;;;aAObuI,EAAcvI;IAC5B,OACmB,mBAAVA,KACPwI,OAAOC,UAAUzI,OAChBsI,EAAetI,MAChBA,KAASwI,OAAOE,oBAChB1I,KAASwI,OAAOG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;aCAJC,EAAkB5I;;IAEhC,OAPgC,sDAMlBA,QAAAA,aAAAA,EAAO6I,uCAAUC,WAAU,IAAYC,uCAAGC;;;;;;;;aAkD1CC,EAAkBjJ;IAChC,IAAMkJ,IAAiBC,EACrBnJ,EAAM6I,SAAUC,OAA4BM,qBAAiBC;IAE/D,OAAO,IAAI3G,EAAUwG,EAAe1G,SAAS0G,EAAeI;;;;;;;;;;;;;;;;;;;;OFxExB,IAAI3B,EAAW;;IGK/C4B,IAAwB,IAAIC,OAChC;;0EAIcC,EAAUzJ;IACxB,OAAI,eAAeA,wBAER,kBAAkBA,2BAElB,kBAAkBA,KAAS,iBAAiBA,0BAE5C,oBAAoBA,6BAEpB,iBAAiBA,0BAEjB,gBAAgBA,wBAEhB,oBAAoBA,uBAEpB,mBAAmBA,4BAEnB,gBAAgBA,yBAEhB,cAAcA,IACnB4I,EAAkB5I,2DAnCSgE;;;sFA6CnB0F,EAAYtE,GAAiBC;IAC3C,IAAMsE,IAAWF,EAAUrE;IAE3B,IAAIuE,MADcF,EAAUpE,IAE1B;IAGF,QAAQsE;MACN;QACE;;MACF;QACE,OAAOvE,EAAKwE,iBAAiBvE,EAAMuE;;MACrC;QACE,OAAOX,EAAkB7D,GAAMxB,QAAQqF,EAAkB5D;;MAC3D;QACE,OAwBN,SAAyBD,GAAiBC;YACxC,IACiC,mBAAxBD,EAAKiE,kBACoB,mBAAzBhE,EAAMgE,kBACbjE,EAAKiE,eAAetF,WAAWsB,EAAMgE,eAAetF;;YAGpD,OAAOqB,EAAKiE,mBAAmBhE,EAAMgE;YAGvC,IAAMQ,IAAgBV,EAAmB/D,EAAoBiE,iBACvDS,IAAiBX,EAAmB9D,EAAqBgE;YAC/D,OACEQ,EAAcrH,YAAYsH,EAAetH,WACzCqH,EAAcP,UAAUQ,EAAeR;SAd3C,CAxB6BlE,GAAMC;;MAC/B;QACE,OAAOD,EAAK4D,gBAAgB3D,EAAM2D;;MACpC;QACE,OA+CN,SAAoB5D,GAAiBC;YACnC,OAAO0E,EAAoB3E,EAAgB4E,YAAEpG,QAC3CmG,EAAoB1E,EAAiB2E;SAFzC,CA/CwB5E,GAAMC;;MAC1B;QACE,OAAOD,EAAK6E,mBAAmB5E,EAAM4E;;MACvC;QACE,OAkCN,SAAwB7E,GAAiBC;YACvC,OACE6E,EAAgB9E,EAAK+E,cAAeC,cAClCF,EAAgB7E,EAAM8E,cAAeC,aACvCF,EAAgB9E,EAAK+E,cAAeE,eAClCH,EAAgB7E,EAAM8E,cAAeE;SAL3C,CAlC4BjF,GAAMC;;MAC9B;QACE,gBA+CuBD,GAAiBC;YAC5C,IAAI,kBAAkBD,KAAQ,kBAAkBC,GAC9C,OACE6E,EAAgB9E,EAAKkF,kBAAkBJ,EAAgB7E,EAAMiF;YAE1D,IAAI,iBAAiBlF,KAAQ,iBAAiBC,GAAO;gBAC1D,IAAMkF,IAAKL,EAAgB9E,EAAiBoF,cACtCC,IAAKP,EAAgB7E,EAAkBmF;gBAE7C,OAAID,MAAOE,IACFnC,EAAeiC,OAAQjC,EAAemC,KAEtCC,MAAMH,MAAOG,MAAMD;;YAI9B;UA/DwBrF,GAAMC;;MAC5B;QACE,OAAOsF,GACLvF,EAAKwF,WAAYC,UAAU,IAC3BxF,EAAMuF,WAAYC,UAAU,IAC5BnB;;MAEJ;QACE,OA0DN,SAAsBtE,GAAiBC;YACrC,IAAMyF,IAAU1F,EAAKyD,SAAUC,UAAU,IACnCiC,IAAW1F,EAAMwD,SAAUC,UAAU;YAE3C,IAAI9B,EAAW8D,OAAa9D,EAAW+D,IACrC;YAGF,KAAK,IAAM5D,KAAO2D,GAChB,IAAIA,EAAQxD,eAAeH,kBAEvB4D,EAAS5D,OACRuC,EAAYoB,EAAQ3D,IAAM4D,EAAS5D,MAEpC;YAIN;SAlBF,CA1D0B/B,GAAMC;;MAC5B;QACE,OAhF6BrB;;;;SA8JnBgH,EACdC,GACAC;IAEA,mBACGD,EAASJ,UAAU,IAAIM,MAAKC,SAAAA;QAAK1B,OAAAA,EAAY0B,GAAGF;;;;SAIrCG,EAAajG,GAAiBC;IAC5C,IAAMsE,IAAWF,EAAUrE,IACrBkG,IAAY7B,EAAUpE;IAE5B,IAAIsE,MAAa2B,GACf,OAAOjI,GAAoBsG,GAAU2B;IAGvC,QAAQ3B;MACN;QACE,OAAO;;MACT;QACE,OAAOtG,GAAoB+B,EAAkBwE,cAAEvE,EAAmBuE;;MACpE;QACE,OAyBN,SAAwBxE,GAAiBC;YACvC,IAAMkG,IAAarB,EAAgB9E,EAAKkF,gBAAgBlF,EAAKoF,cACvDgB,IAActB,EAAgB7E,EAAMiF,gBAAgBjF,EAAMmF;YAEhE,OAAIe,IAAaC,KACP,IACCD,IAAaC,IACf,IACED,MAAeC,IACjB;;YAGHd,MAAMa,KACDb,MAAMc,KAAe,KAAK,IAE1B;SAfb,CAzB4BpG,GAAMC;;MAC9B;QACE,OAAOoG,EAAkBrG,EAAoBiE,gBAAEhE,EAAqBgE;;MACtE;QACE,OAAOoC,EACLxC,EAAkB7D,IAClB6D,EAAkB5D;;MAEtB;QACE,OAAOhC,GAAoB+B,EAAiB4D,aAAE3D,EAAkB2D;;MAClE;QACE,OAkFN,SACE5D,GACAC;YAEA,IAAMqG,IAAY3B,EAAoB3E,IAChCuG,IAAa5B,EAAoB1E;YACvC,OAAOqG,EAAUE,EAAUD;SAN7B,CAlF0BvG,EAAgB4E,YAAE3E,EAAiB2E;;MACzD;QACE,OAsDN,SAA2B6B,GAAkBC;YAG3C,KAFA,IAAMC,IAAeF,EAASjG,MAAM,MAC9BoG,IAAgBF,EAAUlG,MAAM,MAC7Bf,IAAI,GAAGA,IAAIkH,EAAahI,UAAUc,IAAImH,EAAcjI,QAAQc,KAAK;gBACxE,IAAMoH,IAAa5I,GAAoB0I,EAAalH,IAAImH,EAAcnH;gBACtE,IAAmB,MAAfoH,GACF,OAAOA;;YAGX,OAAO5I,GAAoB0I,EAAahI,QAAQiI,EAAcjI;SAThE,CAtD+BqB,EAAoB6E,gBAAE5E,EAAqB4E;;MACtE;QACE,OAgEN,SAA0B7E,GAAkBC;YAC1C,IAAM4G,IAAa5I,GACjB6G,EAAgB9E,EAAKgF,WACrBF,EAAgB7E,EAAM+E;YAExB,OAAmB,MAAf6B,IACKA,IAEF5I,GACL6G,EAAgB9E,EAAKiF,YACrBH,EAAgB7E,EAAMgF;SAV1B,CAhE8BjF,EAAmB+E,eAAE9E,EAAoB8E;;MACnE;QACE,OAqFN,SAAuB/E,GAAsBC;YAI3C,KAHA,IAAM6G,IAAY9G,EAAKyF,UAAU,IAC3BsB,IAAa9G,EAAMwF,UAAU,IAE1BhG,IAAI,GAAGA,IAAIqH,EAAUnI,UAAUc,IAAIsH,EAAWpI,UAAUc,GAAG;gBAClE,IAAMuH,IAAUf,EAAaa,EAAUrH,IAAIsH,EAAWtH;gBACtD,IAAIuH,GACF,OAAOA;;YAGX,OAAO/I,GAAoB6I,EAAUnI,QAAQoI,EAAWpI;SAV1D,CArF2BqB,EAAgBwF,YAAEvF,EAAiBuF;;MAC1D;QACE,OAgGN,SAAqBxF,GAAoBC;YACvC,IAAMyF,IAAU1F,EAAK0D,UAAU,IACzBuD,IAAWjF,OAAOkF,KAAKxB,IACvBC,IAAW1F,EAAMyD,UAAU,IAC3ByD,IAAYnF,OAAOkF,KAAKvB;;;;;wBAM9BsB,EAASG,QACTD,EAAUC;YAEV,KAAK,IAAI3H,IAAI,GAAGA,IAAIwH,EAAStI,UAAUc,IAAI0H,EAAUxI,UAAUc,GAAG;gBAChE,IAAM4H,IAAapJ,GAAoBgJ,EAASxH,IAAI0H,EAAU1H;gBAC9D,IAAmB,MAAf4H,GACF,OAAOA;gBAET,IAAML,IAAUf,EAAaP,EAAQuB,EAASxH,KAAKkG,EAASwB,EAAU1H;gBACtE,IAAgB,MAAZuH,GACF,OAAOA;;YAIX,OAAO/I,GAAoBgJ,EAAStI,QAAQwI,EAAUxI;SAxBxD,CAhGyBqB,EAAcyD,UAAExD,EAAewD;;MACpD;QACE,MA1M6B7E;;;;AAkOnC,SAASyH,EAAkBrG,GAAqBC;IAC9C,IACkB,mBAATD,KACU,mBAAVC,KACPD,EAAKrB,WAAWsB,EAAMtB,QAEtB,OAAOV,GAAoB+B,GAAMC;IAGnC,IAAMwE,IAAgBV,EAAmB/D,IACnC0E,IAAiBX,EAAmB9D,IAEpC4G,IAAa5I,GACjBwG,EAAcrH,SACdsH,EAAetH;IAEjB,OAAmB,MAAfyJ,IACKA,IAEF5I,GAAoBwG,EAAcP,OAAOQ,EAAeR;;;SAkFjDoD,EAAY1M;IAC1B,OAGF,SAAS2M,EAAc3M;QACrB,OAAI,eAAeA,IACV,SACE,kBAAkBA,IACpB,KAAKA,EAAM4J,eACT,kBAAkB5J,IACpB,KAAKA,EAAMsK,eACT,iBAAiBtK,IACnB,KAAKA,EAAMwK,cACT,oBAAoBxK,IAuBjC,SAA2ByD;YACzB,IAAMmJ,IAAsBzD,EAAmB1F;YAC/C,OAAO,UAAQmJ,EAAoBpK,gBAAWoK,EAAoBtD;SAFpE,CAtB6BtJ,EAAqBqJ,kBACrC,iBAAiBrJ,IACnBA,EAAMgJ,cACJ,gBAAgBhJ,IAgBpB+J,EAfqB/J,EAAiBgK,YAeN6C,aAd5B,oBAAoB7M,KA0BNiK,IAzBEjK,EAAqBiK;QA0BzCvD,EAAYoG,EAAS7C,GAAgBpK,cAzBjC,mBAAmBG,IAqBvB,UADiB+M,IAnBE/M,EAAoBmK,eAoBvBC,iBAAY2C,EAAS1C,kBAnBjC,gBAAgBrK,IA4C7B,SAAuB4K;YAGrB,KAFA,IAAIoC,IAAS,KACTC,eACgBrC,IAAAA,EAAWC,UAAU,IAArBD,cAAAA;gBAAf,IAAM5K;gBACJiN,IAGHA,SAFAD,KAAU,KAIZA,KAAUL,EAAc3M;;YAE1B,OAAOgN,IAAS;SAXlB,CA3CyBhN,EAAiB4K,cAC7B,cAAc5K,IAwB3B,SAAqB6I;YAOnB;;;YAJA,IAEImE,IAAS,KACTC,eACcC,IAJC9F,OAAOkF,KAAKzD,EAASC,UAAU,IAAI0D,QAIpCU,cAAAA;gBAAb,IAAM/F;gBACJ8F,IAGHA,SAFAD,KAAU,KAIZA,KAAa7F,UAAOwF,EAAc9D,EAASC,OAAQ3B;;YAErD,OAAO6F,IAAS;SAflB,CAvBuBhN,EAAe6I,YAjWH7E;QAgXnC,IAA0B+I,GAIC9C;KA5ClB0C,CAAc3M;;;SA6IPmJ,EACdrG;;;;IAOA,IAzcoDrB,KAocvCqB,IAKO,mBAATA,GAAmB;;;;QAK5B,IAAIwG,IAAQ,GACN6D,IAAW5D,EAAsB6D,KAAKtK;QAE5C,IAjdkDrB,KAgdrC0L,IACTA,EAAS,IAAI;;YAEf,IAAIE,IAAUF,EAAS;YACvBE,KAAWA,IAAU,aAAaC,OAAO,GAAG,IAC5ChE,IAAQd,OAAO6E;;;gBAIjB,IAAME,IAAa,IAAI3K,KAAKE;QAG5B,OAAO;YAAEN,SAFOS,KAAKC,MAAMqK,EAAWxK,YAAY;YAEhCuG,OAAAA;;;IAOlB,OAAO;QAAE9G,SAFO0H,EAAgBpH,EAAKN;QAEnB8G,OADJY,EAAgBpH,EAAKwG;;;;;;;aASvBY,EAAgBlK;;IAE9B,OAAqB,mBAAVA,IACFA,IACmB,mBAAVA,IACTwI,OAAOxI,KAEP;;;+EAKK+J,EAAoByD;IAClC,OAAoB,mBAATA,IACF7F,EAAW8F,iBAAiBD,KAE5B7F,EAAW+F,eAAeF;;;6EAKrBG,EAASC,GAAwBzG;IAC/C,OAAO;QACL8C,gBAAgB,cAAY2D,EAAWC,4BACrCD,EAAWE,2BACC3G,EAAIzB,KAAKD;;;;6DAKXgD,EACdzI;IAEA,SAASA,KAAS,kBAAkBA;;;;0DAgBtB+N,EACd/N;IAEA,SAASA,KAAS,gBAAgBA;;;wDAWpBgO,EACdhO;IAEA,SAASA,KAAS,eAAeA;;;gDAInBiO,EACdjO;IAEA,SAASA,KAAS,iBAAiBA,KAAS0K,MAAMlC,OAAOxI,EAAMwK;;;uDAIjD0D,EACdlO;IAEA,SAASA,KAAS,cAAcA;;;;;;;;;;;;;;;;;;;;IC7hBhC9B;WAGAA,iBAAAA,SACEiQ,GACAjF;QAEA,gBF1BFA,GACAiF;YAEA,IAAMtF,IAAyB;gBAC7BC,QAAQ;oBACNC,UAAY;wBACVC,aApB0B;;oBAsB5BI,sBAAwB;wBACtBC,gBAAgB;4BACd7G,SAAS0G,EAAe1G;4BACxB8G,OAAOJ,EAAezG;;;;;YAU9B,OAJI0L,MACFtF,EAASC,OAA0BsF,qBAAID,IAGlC;gBAAEtF,UAAAA;;aEKiCsF;OAG1CjQ,iBAAAA,SACEiQ,GACAE;QAEA,OAAOA;OAGTnQ,iBAAAA,SAAiBiQ;QACf,OAAO;;WAGTjQ,sBAAAA,SAAQkF;QACN,OAAOA,aAAiBkL;;;;AArBnBA,aAAW,IAAIA;;;;IA2BtBpQ,WAAqBqQ;QAAAnQ,gBAAAmQ;;WAErBrQ,iBAAAA,SACEiQ,GACAjF;QAEA,OAAO9K,KAAKoQ,MAAML;OAGpBjQ,iBAAAA,SACEiQ,GACAE;;;;QAKA,OAAOjQ,KAAKoQ,MAAML;OAGZjQ,oBAAAA,SAAMiQ;QAEZ,KADA,IAAMtD,IAAS4D,EAAwBN,iBAC5BO;YACJ7D,EAAO8D,MAAKC,SAAAA;gBAAWlF,OAAAA,EAAYkF,GAASF;mBAC/C7D,EAAOpG,KAAKiK;kBAFMtQ,IAAAA,KAAKmQ,UAALnQ,cAAAA;;;QAKtB,OAAO;YAAEwM,YAAY;gBAAEC,QAAAA;;;OAGzB3M,iBAAAA,SAAiBiQ;QACf,OAAO;;WAGTjQ,sBAAAA,SAAQkF;QACN,OACEA,aAAiByL,KACjBlE,GAAYvM,KAAKmQ,UAAUnL,EAAMmL,UAAU7E;;;IAO/CxL,WAAqBqQ;QAAAnQ,gBAAAmQ;;WAErBrQ,iBAAAA,SACEiQ,GACAjF;QAEA,OAAO9K,KAAKoQ,MAAML;OAGpBjQ,iBAAAA,SACEiQ,GACAE;;;;QAKA,OAAOjQ,KAAKoQ,MAAML;OAGZjQ,oBAAAA,SAAMiQ;QAEZ,KADA,IAAItD,IAAS4D,EAAwBN,iBAC1BW;YACTjE,IAASA,EAAOhF,QAAO+I,SAAAA;wBAAYlF,EAAYkF,GAASE;;kBADnC1Q,IAAAA,KAAKmQ,UAALnQ,cAAAA;;;QAGvB,OAAO;YAAEwM,YAAY;gBAAEC,QAAAA;;;OAGzB3M,iBAAAA,SAAiBiQ;QACf,OAAO;;WAGTjQ,sBAAAA,SAAQkF;QACN,OACEA,aAAiB2L,KACjBpE,GAAYvM,KAAKmQ,UAAUnL,EAAMmL,UAAU7E;;;IAY/CxL,WACmB8Q,GACRC;QADQ7Q,kBAAA4Q,aACRC;;WAQX/Q,iBAAAA,SACEiQ,GACAjF;;;;QAKA,IAAMgG,IAAY9Q,KAAK+Q,GAAiBhB,IAClCiB,IAAMhR,KAAKiR,SAASH,KAAa9Q,KAAKiR,SAASjR,KAAK6Q;QAC1D,OAAIxG,EAAUyG,MAAczG,EAAUrK,KAAK6Q,MAClC7Q,KAAK4Q,WAAWM,GAAUF,KAE1BhR,KAAK4Q,WAAWO,GAASH;OAIpClR,iBAAAA,SACEiQ,GACAE;QAMA,OAAOA;;;;;;IAOTnQ,iBAAAA,SAAiBiQ;QACf,OD2VK1F,EADgBzI,IC1VLmO,eDoVlBnO;YAEA,SAASA,KAAS,iBAAiBA;UAKCA,KC3VDmO,IAAiB;YAAE7D,cAAc;;YD0V7CtK;OCvVvB9B,sBAAAA,SAAQkF;QACN,OACEA,aAAiBoM,KACjB9F,EAAYtL,KAAK6Q,IAAS7L,EAAM6L;OAI5B/Q,uBAAAA,SAAS8B;QACf,OAAOkK,EAAgBlK,EAAMsK,gBAAgBtK,EAAMwK;;;;wDAIvD,UAASiE,EAAwBzO;IAC/B,OAAO+N,EAAQ/N,MAAUA,EAAM4K,WAAWC,SACtC7K,EAAM4K,WAAWC,OAAOxG,UACxB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;IC7MJnG,WAAqB4K;QAAA1K,cAAA0K;;;QAGnBA,EAAO0D,KAAKzG,EAAU5B;;;;;;;;WAcxBjG,iBAAAA,SAAOuR;QACL,KAA4BrR,WAAAA,IAAAA,KAAK0K,QAAL1K,cAAAA;YAC1B,SAAkBsR,EAAWD,IAC3B;;QAGJ;OAGFvR,sBAAAA,SAAQkF;QACN,OAAOuH,GAAYvM,KAAK0K,QAAQ1F,EAAM0F,SAAQ,SAAC6G,GAAGC;YAAMD,OAAAA,EAAE/L,QAAQgM;;;;IAMpE1R,WACW2R,GACAC;QADA1R,aAAAyR,GACAzR,iBAAA0R;;WAGX5R,sBAAAA,SAAQkF;QACN,OACEhF,KAAKyR,MAAMjM,QAAQR,EAAMyM,UAAUzR,KAAK0R,UAAUlM,QAAQR,EAAM0M;;UAOpE5R;;;;;;;;;;;AAWW6R;;;;;;;;AAQAC;IARA5R,eAAA2R,GAQA3R,wBAAA4R;;IAkBX9R,WACW+R,GACAC;QADA9R,kBAAA6R,GACA7R,cAAA8R;;;kBASXhS;QACE,OAAO,IAAIiS;;sEAIbjS,SAAcgS;QACZ,OAAO,IAAIC,UAAwBD;;8FAIrChS,SAAkB6R;QAChB,OAAO,IAAII,EAAaJ;OAI1BK;gEAAAA;YACE,kBAAOhS,KAAK6R,yBAA4B7R,KAAK8R;;;;;;;;;IAO/ChS,iBAAAA,SAAWmS;QACT,kBAAIjS,KAAK6R,aAELI,aAAoBC,MACpBD,EAASN,QAAQnM,QAAQxF,KAAK6R,yBAEvB7R,KAAK8R,UACP9R,KAAK8R,WAAWG,aAAoBC;OAO/CpS,sBAAAA,SAAQkF;QACN,OACEhF,KAAK8R,WAAW9M,EAAM8M,WACrB9R,KAAK6R,eACA7M,EAAM6M,cAAc7R,KAAK6R,WAAWrM,QAAQR,EAAM6M,eACnD7M,EAAM6M;;;;WAsHL/R,iBAAAA,SAAiBmS;;;;;;;WAejBnS,SACRmS;QAEA,OAAIA,aAAoBC,KACfD,EAASN,UAETrM,EAAgByB;;;IAU3BjH,WACWiJ,GACAnH,GACAuQ;QAHXrS;gBAKE0B,IAAAA,4BAJSuH,GACA/I,UAAA4B,UACAuQ,GAKFnS;;;WATsBoS,mBAW/BtS,iBAAAA,SACEmS,GACAI;QAEArS,KAAKsS,GAAiBL;;;;QAWtB,IAAMN,IAAUU,EAAeV;QAC/B,OAAO,IAAIO,GAASlS,KAAK+I,KAAK4I,GAAS3R,KAAK4B,OAAO;YACjD2Q;;OAIJzS,iBAAAA,SACEmS,GACAO,GACA1H;QAIA,IAFA9K,KAAKsS,GAAiBL,KAEjBjS,KAAKmS,GAAaM,GAAWR,IAChC,OAAOA;QAGT,IAAMN,IAAUS,GAASM,GAAuBT;QAChD,OAAO,IAAIC,GAASlS,KAAK+I,KAAK4I,GAAS3R,KAAK4B,OAAO;YACjD+Q;;OAIJ7S,iBAAAA,SAAiBmS;QACf,OAAO;OAGTnS,sBAAAA,SAAQkF;QACN,OACEA,aAAiB4N,KACjB5S,KAAK+I,IAAIvD,QAAQR,EAAM+D,QACvB/I,KAAK4B,MAAM4D,QAAQR,EAAMpD,UACzB5B,KAAKmS,GAAa3M,QAAQR,EAAMmN;;EA1DLC;IA6E/BtS,WACWiJ,GACA8J,GACAC,GACAX;QAJXrS;gBAME0B,IAAAA,4BALSuH,GACA/I,SAAA6S,UACAC,UACAX,GAKFnS;;;WAVwBoS,mBAYjCtS,iBAAAA,SACEmS,GACAI;QASA,IAPArS,KAAKsS,GAAiBL,KAOjBjS,KAAKmS,GAAaM,GAAWR;;;;;QAKhC,OAAO,IAAIc,GAAgB/S,KAAK+I,KAAKsJ,EAAeV;QAGtD,IAAMqB,IAAUhT,KAAKiT,GAAchB;QACnC,OAAO,IAAIC,GAASlS,KAAK+I,KAAKsJ,EAAeV,SAASqB,GAAS;YAC7DT;;OAIJzS,iBAAAA,SACEmS,GACAO,GACA1H;QAIA,IAFA9K,KAAKsS,GAAiBL,KAEjBjS,KAAKmS,GAAaM,GAAWR,IAChC,OAAOA;QAGT,IAAMN,IAAUS,GAASM,GAAuBT,IAC1Ce,IAAUhT,KAAKiT,GAAchB;QACnC,OAAO,IAAIC,GAASlS,KAAK+I,KAAK4I,GAASqB,GAAS;YAC9CL;;OAIJ7S,iBAAAA,SAAiBmS;QACf,OAAO;OAGTnS,sBAAAA,SAAQkF;QACN,OACEA,aAAiBkO,KACjBlT,KAAK+I,IAAIvD,QAAQR,EAAM+D,QACvB/I,KAAK8S,GAAUtN,QAAQR,EAAM8N,OAC7B9S,KAAKmS,GAAa3M,QAAQR,EAAMmN;;;;;;;IAS5BrS,iBAAAA,SAAcmS;QACpB,IAAIY;QAMJ,OAJEA,IADEZ,aAAoBC,KACfD,EAASY,SAETM,GAAYC,SAEdpT,KAAKqT,GAAYR;OAGlB/S,iBAAAA,SAAY+S;QAAZ/S,cACAwT,IAAU,IAAIC,GAAmBV;QAWvC,OAVA7S,KAAK8S,GAAUpI,OAAOvE,SAAQkL,SAAAA;YAC5B,KAAKA,EAAUjI,KAAW;gBACxB,IAAMoK,IAAWxT,EAAK6S,KAAKpB,MAAMJ;gBAChB,SAAbmC,IACFF,EAAQG,IAAIpC,GAAWmC,KAEvBF,EAAQI,OAAOrC;;aAIdiC,EAAQK;;EA/FgBvB;IAoHjCtS,WACWiJ,GACA6K;QAFX9T;gBAIE0B,IAAAA,4BAHSuH,GACA/I,oBAAA4T,GATF5T;;;;QAKTA,OAAwB+R,GAAaD;;WANAM,mBAerCtS,iBAAAA,SACEmS,GACAI;QASA,IAPArS,KAAKsS,GAAiBL,IAEtB5O,GACqC,QAAnCgP,EAAeT,oBAIZ5R,KAAKmS,GAAaM,GAAWR;;;;;QAKhC,OAAO,IAAIc,GAAgB/S,KAAK+I,KAAKsJ,EAAeV;QAGtD,IAAMkC,IAAM7T,KAAK8T,GAAgB7B,IAC3BL,IAAmB5R,KAAK+T,GAC5B9B,GACAI,EAAgCT,mBAG5BD,IAAUU,EAAeV,SACzBqB,IAAUhT,KAAKgU,GAAgBH,EAAIhB,QAAQjB;QACjD,OAAO,IAAIM,GAASlS,KAAK+I,KAAK4I,GAASqB,GAAS;YAC9CT;;OAIJzS,iBAAAA,SACEmS,GACAO,GACA1H;QAIA,IAFA9K,KAAKsS,GAAiBL,KAEjBjS,KAAKmS,GAAaM,GAAWR,IAChC,OAAOA;QAGT,IAAM4B,IAAM7T,KAAK8T,GAAgB7B,IAC3BL,IAAmB5R,KAAKiU,GAC5BnJ,GACAmH,GACAO,IAEIQ,IAAUhT,KAAKgU,GAAgBH,EAAIhB,QAAQjB;QACjD,OAAO,IAAIM,GAASlS,KAAK+I,KAAK8K,EAAIlC,SAASqB,GAAS;YAClDL;;OAIJ7S,iBAAAA,SAAiBmS;QAEf,KADA,IAAIiC,IAAwC,aACflU,IAAAA,KAAK4T,iBAAL5T,cAAAA,KAAsB;YAA9C,IAAMmU,UACHC,IACJnC,aAAoBC,KAChBD,EAASR,MAAM0C,EAAe1C,iBAE9B4C,IAAeF,EAAezC,UAAUX,GAC5CqD,KAAiB;YAGC,QAAhBC,MAEAH,IADgB,QAAdA,SACeX,IAAqBE,IACpCU,EAAe1C,OACf4C,KAGWH,EAAWT,IAAIU,EAAe1C,OAAO4C;;QAIxD,OAAOH,IAAaA,EAAWP,OAAU;OAG3C7T,sBAAAA,SAAQkF;QACN,OACEA,aAAiBsP,KACjBtU,KAAK+I,IAAIvD,QAAQR,EAAM+D,QACvBwD,GAAYvM,KAAK4T,iBAAiB5O,EAAM4O,kBAAiB,SAACrC,GAAGC;YAC3DD,OAAAA,EAAE/L,QAAQgM;eAEZxR,KAAKmS,GAAa3M,QAAQR,EAAMmN;;;;;;;;IAU5BrS,iBAAAA,SAAgBmS;QAStB,OAAOA;;;;;;;;;;;IAYDnS,iBAAAA,SACN0S,GACAuB;QAEA,IAAMnC,IAAgC;QA/lBjCvO,GAimBHrD,KAAK4T,gBAAgBjO,WAAWoO,EAAuBpO;QAKzD,KAAK,IAAIc,IAAI,GAAGA,IAAIsN,EAAuBpO,QAAQc,KAAK;YACtD,IAAM0N,IAAiBnU,KAAK4T,gBAAgBnN,IACtCiL,IAAYyC,EAAezC,WAC7B3B,IAAkC;YAClCyC,aAAmBN,OACrBnC,IAAgByC,EAAQf,MAAM0C,EAAe1C,SAE/CG,EAAiBvL,KACfqL,EAAU6C,GACRxE,GACAgE,EAAuBtN;;QAI7B,OAAOmL;;;;;;;;;;;;;;IAeD9R,iBAAAA,SACNgL,GACAmH,GACAO;QAGA,KADA,IAAMZ,IAAgC,WACT5R,IAAAA,KAAK4T,iBAAL5T,cAAAA,KAAsB;YAA9C,IAAMmU,UACHzC,IAAYyC,EAAezC,WAE7B3B,IAAkC;YAClCkC,aAAoBC,OACtBnC,IAAgBkC,EAASR,MAAM0C,EAAe1C,SAG1B,SAAlB1B,KAA0ByC,aAAmBN;;;;;YAK/CnC,IAAgByC,EAAQf,MAAM0C,EAAe1C,SAG/CG,EAAiBvL,KACfqL,EAAU8C,GAAiBzE,GAAejF;;QAG9C,OAAO8G;OAGD9R,iBAAAA,SACN+S,GACAjB;QAQA,KADA,IAAM0B,IAAU,IAAIC,GAAmBV,IAC9BpM,IAAI,GAAGA,IAAIzG,KAAK4T,gBAAgBjO,QAAQc,KAAK;YACpD,IACM4K,IADiBrR,KAAK4T,gBAAgBnN,GACXgL;YACjC6B,EAAQG,IAAIpC,GAAWO,EAAiBnL;;QAE1C,OAAO6M,EAAQK;;EAzNoBvB;IA+NrCtS,WAAqBiJ,GAA2BoJ;QAAhDrS;gBACE0B,IAAAA,4BADmBuH,UAA2BoJ,GAIvCnS;;WALyBoS,mBAOlCtS,iBAAAA,SACEmS,GACAI;;;;QAaA,OAXArS,KAAKsS,GAAiBL,IAWf,IAAIwC,GAAWzU,KAAK+I,KAAKsJ,EAAeV,SAAS;YACtDY;;OAIJzS,iBAAAA,SACEmS,GACAO,GACA1H;QAIA,OAFA9K,KAAKsS,GAAiBL,IAEjBjS,KAAKmS,GAAaM,GAAWR,KAU3B,IAAIwC,GAAWzU,KAAK+I,KAAKzD,EAAgByB,SATvCkL;OAYXnS,iBAAAA,SAAiBmS;QACf,OAAO;OAGTnS,sBAAAA,SAAQkF;QACN,OACEA,aAAiB0P,KACjB1U,KAAK+I,IAAIvD,QAAQR,EAAM+D,QACvB/I,KAAKmS,GAAa3M,QAAQR,EAAMmN;;EAvDFC;IAoElCtS,WAAqBiJ,GAA2BoJ;QAAhDrS;gBACE0B,IAAAA,4BADmBuH,UAA2BoJ,GAIvCnS;;WALyBoS,mBAOlCtS,iBAAAA,SACEmS,GACAI;QAEAzM;OAGF9F,iBAAAA,SACEmS,GACAO,GACA1H;QAEAlF;OAGF9F,iBAAAA,SAAiBmS;QACfrM;OAGF9F,sBAAAA,SAAQkF;QACN,OACEA,aAAiB2P,KACjB3U,KAAK+I,IAAIvD,QAAQR,EAAM+D,QACvB/I,KAAKmS,GAAa3M,QAAQR,EAAMmN;;EA9BFC;ICjvBlCtS,WAA4B8U;QAAA5U,aAAA4U;;qBAO5B9U;QACE,OAAO,IAAIqT,EAAY;YAAE1I,UAAU;;;;;;;;;IASrC3K,oBAAAA,SAAMwH;QACJ,IAAIA,EAAK8B,KACP,OAAOpJ,KAAK4U;QAGZ,KADA,IAAIhT,IAAmB5B,KAAK4U,OACnBnO,IAAI,GAAGA,IAAIa,EAAK3B,SAAS,KAAKc,GAAG;YACxC,KAAK7E,EAAM6I,SAAUC,QACnB,OAAO;YAGT,KAAKoF,EADLlO,IAAQA,EAAM6I,SAAUC,OAAOpD,EAAKxE,IAAI2D,MAEtC,OAAO;;QAKX,QADA7E,KAASA,EAAM6I,SAAUC,UAAU,IAAIpD,EAAKuN,SAC5B;OAIpB/U,sBAAAA,SAAQkF;QACN,OAAOsG,EAAYtL,KAAK4U,OAAO5P,EAAM4P;;;;;;IAsBvC9U,WAA6BoU;yBAAAA,IAA0Bf,GAAYC,oBAAtCc;;QAL7BlU,UAAqB,IAAI8U;;;;;;;;kBAczBhV,kBAAAA,SAAIwH,GAAiB1F;QAMnB,OADA5B,KAAK+U,GAAWzN,GAAM1F,IACf5B;;;;;;;;;IAUTF,qBAAAA,SAAOwH;QAML,OADAtH,KAAK+U,GAAWzN,GAAM,OACftH;;;;;;IAODF,iBAAAA,SAAWwH,GAAiB1F;QAGlC,KAFA,IAAIoT,IAAehV,KAAKiV,IAEfxO,IAAI,GAAGA,IAAIa,EAAK3B,SAAS,KAAKc,GAAG;YACxC,IAAMyO,IAAiB5N,EAAKxE,IAAI2D,IAC5B0O,IAAeH,EAAalS,IAAIoS;YAEhCC,aAAwBL;;YAE1BE,IAAeG,IAEfA,8BACA9J,EAAU8J;;YAGVA,IAAe,IAAIL,IACjB9L,OAAOoM,QAAQD,EAAa1K,SAAUC,UAAU,MAElDsK,EAAavB,IAAIyB,GAAgBC,IACjCH,IAAeG;;YAGfA,IAAe,IAAIL,KACnBE,EAAavB,IAAIyB,GAAgBC,IACjCH,IAAeG;;QAInBH,EAAavB,IAAInM,EAAKuN,KAAejT;;8DAIvC9B,iBAAAA;QACE,IAAMuV,IAAerV,KAAKsV,GACxB3N,EAAU4N,GACVvV,KAAKiV;QAEP,OAAoB,QAAhBI,IACK,IAAIlC,GAAYkC,KAEhBrV,KAAKkU;;;;;;;;;;;;;;IAgBRpU,iBAAAA,SACN0V,GACAC;QAFM3V,cAIF4V,QAEEtB,IAAgBpU,KAAKkU,GAAWzC,MAAM+D,IACtCG,IAAe7F,EAAWsE;0BAGvBA,EAAc3J,SAASC,UAC5B;QAkBJ,OAhBA+K,EAAgBtP,SAAQ,SAACvE,GAAOgU;YAC9B,IAAIhU,aAAiBkT,KAAK;gBACxB,IAAMe,IAAS7V,EAAKsV,GAAaE,EAAYM,MAAMF,IAAchU;gBACnD,QAAViU,MACFF,EAAaC,KAAeC,GAC5BH;mBAEiB,SAAV9T,KACT+T,EAAaC,KAAehU,GAC5B8T,UACSC,EAAazM,eAAe0M,cAC9BD,EAAaC,IACpBF;aAIGA,IAAW;YAAEjL,UAAU;gBAAEC,QAAQiL;;YAAmB;;;;;;;;SAO/CI,GAAiBnU;IAC/B,IAAM8I,IAAsB;IAsB5B,OArBAvE,EAAQvE,EAAO8I,UAAU,KAAI,SAAC3B,GAAKnH;QACjC,IAAM4T,IAAc,IAAI7N,EAAU,EAACoB;QACnC,IAAI+G,EAAWlO,IAAQ;YACrB,IACMoU,IADaD,GAAiBnU,EAAe6I,UACnBC;YAChC,IAA4B,MAAxBsL,EAAarQ;;YAEf+E,EAAOrE,KAAKmP;;;YAIZ,KAAyBQ,WAAAA,IAAAA,GAAAA,cAAAA;gBAApB,IAAMC;gBACTvL,EAAOrE,KAAKmP,EAAYM,MAAMG;;;;;QAMlCvL,EAAOrE,KAAKmP;SAGT,IAAIU,EAAUxL;;;;;;;;;;;;;;;;;;;;;;;ICzOlByL,aCMHrW,SAAqBiJ,GAA2B4I;IAA3B3R,WAAA+I,GAA2B/I,eAAA2R;;IAqBhD7R,WACEiJ,GACA4I,GACiByE,GACjBC;QAJFvW;gBAME0B,IAAAA,aAAMuH,GAAK4I,iBAHMyE,GAIjBpW,EAAKsW,OAAsBD,EAAQC,IACnCtW,EAAKuS,0BAA0B8D,EAAQ9D;;;WAZbgE,mBAe5BzW,oBAAAA,SAAMwH;QACJ,OAAOtH,KAAKoW,GAAY3E,MAAMnK;OAGhCxH,mBAAAA;QACE,OAAOE,KAAKoW;OAGdtW,iBAAAA;QACE,OAAOE,KAAKoW,GAAYxB;OAG1B9U,sBAAAA,SAAQkF;QACN,OACEA,aAAiBkN,KACjBlS,KAAK+I,IAAIvD,QAAQR,EAAM+D,QACvB/I,KAAK2R,QAAQnM,QAAQR,EAAM2M,YAC3B3R,KAAKsW,OAAsBtR,EAAMsR,MACjCtW,KAAKuS,0BAA0BvN,EAAMuN,yBACrCvS,KAAKoW,GAAY5Q,QAAQR,EAAMoR;OAInCtW,uBAAAA;QACE,OACE,cAAYE,KAAK+I,aACf/I,KAAK2R,iBACF3R,KAAKoW,GAAY3U,wCACCzB,KAAKsW,sCACDtW,KAAKuS;OAIpCiE;aAAAA;YACE,OAAOxW,KAAKsW,MAAqBtW,KAAKuS;;;;;EAjDZgE;IA+E5BzW,WACEiJ,GACA4I,GACA0E;QAHFvW;gBAKE0B,IAAAA,aAAMuH,GAAK4I,YACNY,2BAA2B8D,MAAWA,EAAQ9D;;;WATvBgE,mBAY9BzW,uBAAAA;QACE,OAAO,gBAAcE,KAAK+I,aAAQ/I,KAAK2R;OAGzC6E;aAAAA;YACE,OAAOxW,KAAKuS;;;;QAGdzS,sBAAAA,SAAQkF;QACN,OACEA,aAAiByP,KACjBzP,EAAMuN,0BAA0BvS,KAAKuS,yBACrCvN,EAAM2M,QAAQnM,QAAQxF,KAAK2R,YAC3B3M,EAAM+D,IAAIvD,QAAQxF,KAAK+I;;EAzBGwN;;;;WAkCKA,mBACnCzW,uBAAAA;QACE,OAAO,qBAAmBE,KAAK+I,aAAQ/I,KAAK2R;OAG9C6E;aAAAA;YACE;;;;QAGF1W,sBAAAA,SAAQkF;QACN,OACEA,aAAiB+N,KACjB/N,EAAM2M,QAAQnM,QAAQxF,KAAK2R,YAC3B3M,EAAM+D,IAAIvD,QAAQxF,KAAK+I;;EAbQwN;;;;;;;;;IC5HnCzW,WACWwH,GACAmP,GACAC,GACAC,GACAzQ,GACA0Q,GACAC;yBALAJ,4BACAC,0BACAC;yBACAzQ,4BACA0Q,4BACAC;QANA7W,YAAAsH,GACAtH,uBAAAyW,GACAzW,eAAA0W,GACA1W,eAAA2W,GACA3W,aAAAkG;QACAlG,eAAA4W,GACA5W,aAAA6W,GAjBX7W,UAA6C;;WAoB7CF,0BAAAA;QACE,IAAiC,SAA7BE,KAAK8W,IAA8B;YACrC,IAAIxI,IAActO,KAAKsH,KAAKD;YACC,SAAzBrH,KAAKyW,oBACPnI,KAAe,SAAStO,KAAKyW,kBAE/BnI,KAAe;YACfA,KAAetO,KAAK2W,QAAQ9O,KAAIkP,SAAAA;gBAAKA,OAAAA,EAAEzI;gBAAelH,KAAK,MAC3DkH,KAAe,QACfA,KAAetO,KAAK0W,QAAQ7O,KAAI/D,SAAAA;gBAAKA,OAAAA,EAAEwK;gBAAelH,KAAK,MAEtD6C,EAAkBjK,KAAKkG,WAC1BoI,KAAe,OACfA,KAAetO,KAAKkG,QAElBlG,KAAK4W,YACPtI,KAAe;YACfA,KAAetO,KAAK4W,QAAQtI,gBAE1BtO,KAAK6W,UACPvI,KAAe,QACfA,KAAetO,KAAK6W,MAAMvI;YAE5BtO,KAAK8W,KAAsBxI;;QAE7B,OAAOtO,KAAK8W;OAGdhX,uBAAAA;QACE,IAAIgI,IAAM9H,KAAKsH,KAAKD;QAmBpB,OAlB6B,SAAzBrH,KAAKyW,oBACP3O,KAAO,sBAAsB9H,KAAKyW;QAEhCzW,KAAK2W,QAAQhR,SAAS,MACxBmC,KAAO,iBAAe9H,KAAK2W,QAAQvP,KAAK;QAErC6C,EAAkBjK,KAAKkG,WAC1B4B,KAAO,cAAc9H,KAAKkG,QAExBlG,KAAK0W,QAAQ/Q,SAAS,MACxBmC,KAAO,iBAAe9H,KAAK0W,QAAQtP,KAAK;QAEtCpH,KAAK4W,YACP9O,KAAO,gBAAgB9H,KAAK4W,QAAQtI,gBAElCtO,KAAK6W,UACP/O,KAAO,cAAc9H,KAAK6W,MAAMvI;QAE3B,YAAUxG;OAGnBhI,sBAAAA,SAAQkF;QACN,IAAIhF,KAAKkG,UAAUlB,EAAMkB,OACvB;QAGF,IAAIlG,KAAK0W,QAAQ/Q,WAAWX,EAAM0R,QAAQ/Q,QACxC;QAGF,KAAK,IAAIc,IAAI,GAAGA,IAAIzG,KAAK0W,QAAQ/Q,QAAQc,KACvC,KAAKzG,KAAK0W,QAAQjQ,GAAGjB,QAAQR,EAAM0R,QAAQjQ,KACzC;QAIJ,IAAIzG,KAAK2W,QAAQhR,WAAWX,EAAM2R,QAAQhR,QACxC;QAGF,KAAK,IAAIc,IAAI,GAAGA,IAAIzG,KAAK2W,QAAQhR,QAAQc,KACvC,KAAKzG,KAAK2W,QAAQlQ,GAAGjB,QAAQR,EAAM2R,QAAQlQ,KACzC;QAIJ,OAAIzG,KAAKyW,oBAAoBzR,EAAMyR,qBAI9BzW,KAAKsH,KAAK9B,QAAQR,EAAMsC,YAKV,SAAjBtH,KAAK4W,UACA5W,KAAK4W,QAAQpR,QAAQR,EAAM4R,WACV,SAAlB5R,EAAM4R,aAKU,SAAf5W,KAAK6W,QACR7W,KAAK6W,MAAMrR,QAAQR,EAAM6R,SACT,SAAhB7R,EAAM6R;OAGZ/W,iBAAAA;QACE,OACEwI,EAAY0O,GAAchX,KAAKsH,SACN,SAAzBtH,KAAKyW,mBACmB,MAAxBzW,KAAK2W,QAAQhR;;;;;;;ICzFjB7F,WACWwH,GACAmP,GACAQ,GACAN,GACAzQ,GACAgR,gBACAN,GACAC;yBANAJ,4BACAQ,0BACAN;yBACAzQ,4BACAgR,2BACAN;yBACAC,WAPA7W,YAAAsH,GACAtH,uBAAAyW,aACAQ;QACAjX,eAAA2W,GACA3W,aAAAkG,aACAgR,GACAlX,eAAA4W,GACA5W,aAAA6W;QAjBX7W,UAA4C;;QAG5CA,UAAwC,MAgBlCA,KAAK4W,WACP5W,KAAKmX,GAAiBnX,KAAK4W,UAEzB5W,KAAK6W,SACP7W,KAAKmX,GAAiBnX,KAAK6W;;kBA3B/B/W,SAAcwH;QACZ,OAAO,IAAI8P,EAAM9P;OA8BnBoP;aAAAA;YACE,IAA6B,SAAzB1W,KAAKqX,IAA0B;gBACjCrX,KAAKqX,KAAkB;gBAEvB,IAAMC,IAAkBtX,KAAKuX,MACvBC,IAAoBxX,KAAKyX;gBAC/B,IAAwB,SAApBH,KAAkD,SAAtBE;;;;gBAIzBF,EAAgBI,OACnB1X,KAAKqX,GAAgBhR,KAAK,IAAIsR,GAAQL,KAExCtX,KAAKqX,GAAgBhR,KACnB,IAAIsR,GAAQhQ,EAAUiQ,mCAEnB;oBAQL,KADA,IAAIC,eACkB7X,IAAAA,KAAKiX,IAALjX,cAAAA;wBAAjB,IAAM0W;wBACT1W,KAAKqX,GAAgBhR,KAAKqQ,IACtBA,EAAQjF,MAAMiG,QAChBG;;oBAGJ,KAAKA,GAAkB;;;wBAGrB,IAAMC,IACJ9X,KAAKiX,GAAgBtR,SAAS,IAC1B3F,KAAKiX,GAAgBjX,KAAKiX,GAAgBtR,SAAS,GAAGoS;wBAE5D/X,KAAKqX,GAAgBhR,KACnB,IAAIsR,GAAQhQ,EAAUiQ,KAAYE;;;;YAK1C,OAAO9X,KAAKqX;;;;QAGdvX,iBAAAA,SAAU2H;QAcR,IAAMuQ,IAAahY,KAAK2W,QAAQsB,OAAO,EAACxQ;QACxC,OAAO,IAAI2P,EACTpX,KAAKsH,MACLtH,KAAKyW,iBACLzW,KAAKiX,GAAgBhR,SACrB+R,GACAhY,KAAKkG,OACLlG,KAAKkX,IACLlX,KAAK4W,SACL5W,KAAK6W;OAIT/W,iBAAAA,SAAW4W;;QAMT,IAAMwB,IAAalY,KAAKiX,GAAgBgB,OAAO,EAACvB;QAChD,OAAO,IAAIU,EACTpX,KAAKsH,MACLtH,KAAKyW,iBACLyB,GACAlY,KAAK2W,QAAQ1Q,SACbjG,KAAKkG,OACLlG,KAAKkX,IACLlX,KAAK4W,SACL5W,KAAK6W;OAIT/W,iBAAAA,SAAiBoG;QACf,OAAO,IAAIkR,EACTpX,KAAKsH,MACLtH,KAAKyW,iBACLzW,KAAKiX,GAAgBhR,SACrBjG,KAAK2W,QAAQ1Q,SACbC,qBAEAlG,KAAK4W,SACL5W,KAAK6W;OAIT/W,iBAAAA,SAAgBoG;QACd,OAAO,IAAIkR,EACTpX,KAAKsH,MACLtH,KAAKyW,iBACLzW,KAAKiX,GAAgBhR,SACrBjG,KAAK2W,QAAQ1Q,SACbC,oBAEAlG,KAAK4W,SACL5W,KAAK6W;OAIT/W,iBAAAA,SAAYqY;QACV,OAAO,IAAIf,EACTpX,KAAKsH,MACLtH,KAAKyW,iBACLzW,KAAKiX,GAAgBhR,SACrBjG,KAAK2W,QAAQ1Q,SACbjG,KAAKkG,OACLlG,KAAKkX,IACLiB,GACAnY,KAAK6W;OAIT/W,iBAAAA,SAAUqY;QACR,OAAO,IAAIf,EACTpX,KAAKsH,MACLtH,KAAKyW,iBACLzW,KAAKiX,GAAgBhR,SACrBjG,KAAK2W,QAAQ1Q,SACbjG,KAAKkG,OACLlG,KAAKkX,IACLlX,KAAK4W,SACLuB;;;;;;;;IAUJrY,iBAAAA,SAAwBwH;QACtB,OAAO,IAAI8P,EACT9P;6BACqB,MACrBtH,KAAKiX,GAAgBhR,SACrBjG,KAAK2W,QAAQ1Q,SACbjG,KAAKkG,OACLlG,KAAKkX,IACLlX,KAAK4W,SACL5W,KAAK6W;;;;;;IAQT/W,iBAAAA;QACE,OAC0B,MAAxBE,KAAK2W,QAAQhR,UACE,SAAf3F,KAAKkG,SACW,QAAhBlG,KAAK4W,WACS,QAAd5W,KAAK6W,UAC4B,MAAhC7W,KAAKiX,GAAgBtR,UACa,MAAhC3F,KAAKiX,GAAgBtR,UACpB3F,KAAKiX,GAAgB,GAAGxF,MAAMiG;;;;;IAOtC5X,0BAAAA;QACE,OAAUE,KAAKoY,KAAW9J,yBAAoBtO,KAAKkX;OAGrDpX,uBAAAA;QACE,OAAO,kBAAgBE,KAAKoY,KAAW3W,8BACrCzB,KAAKkX;OAITpX,sBAAAA,SAAQkF;QACN,OACEhF,KAAKoY,KAAW5S,QAAQR,EAAMoT,SAC9BpY,KAAKkX,OAAclS,EAAMkS;OAI7BpX,iBAAAA,SAAcuY,GAAcC;QAE1B,KADA,IAAIC,eACkBvY,IAAAA,KAAK0W,SAAL1W,cAAAA,KAAc;YAA/B,IAAM0W,UACH8B,IAAO9B,EAAQ1I,QAAQqK,GAAIC;YACjC,IAAa,MAATE,GACF,OAAOA;YAETD,IAAqBA,KAAsB7B,EAAQjF,MAAMiG;;QAO3D,OAAO;OAGT5X,sBAAAA,SAAQ+T;QACN,OACE7T,KAAKyY,GAA8B5E,MACnC7T,KAAK0Y,GAAe7E,MACpB7T,KAAK2Y,GAAe9E,MACpB7T,KAAK4Y,GAAc/E;OAIvB/T,iBAAAA;QACE,QAAQmK,EAAkBjK,KAAKkG,8BAAUlG,KAAKkX;OAGhDpX,iBAAAA;QACE,QAAQmK,EAAkBjK,KAAKkG,6BAAUlG,KAAKkX;OAGhDpX,iBAAAA;QACE,OAAOE,KAAKiX,GAAgBtR,SAAS,IACjC3F,KAAKiX,GAAgB,GAAGxF,QACxB;OAGN3R,iBAAAA;QACE,KAAqBE,WAAAA,IAAAA,KAAK2W,SAAL3W,cAAAA;YAAhB,IAAMyH;YACT,IAAIA,aAAkBoR,MAAepR,EAAOqR,MAC1C,OAAOrR,EAAOgK;;QAGlB,OAAO;;;;IAKT3R,iBAAAA,SAAmBiZ;QACjB,KAAqB/Y,WAAAA,IAAAA,KAAK2W,SAAL3W,cAAAA;YAAhB,IAAMyH;YACT,IAAIA,aAAkBoR,MAChBE,EAAUxR,QAAQE,EAAOuR,OAAO,GAClC,OAAOvR,EAAOuR;;QAIpB,OAAO;OAGTlZ,iBAAAA;QACE,OAAOE,KAAKoY,KAAWa;OAGzBnZ,iBAAAA;QACE,OAAgC,SAAzBE,KAAKyW;;;;;;IAOd3W,iBAAAA;QACE,KAAKE,KAAKkZ,IACR,wBAAIlZ,KAAKkX,IACPlX,KAAKkZ,KAAiB,IAAIC,GACxBnZ,KAAKsH,MACLtH,KAAKyW,iBACLzW,KAAK0W,SACL1W,KAAK2W,SACL3W,KAAKkG,OACLlG,KAAK4W,SACL5W,KAAK6W,aAEF;YAGL;;YADA,IAAMuC,IAAW,WACKpZ,IAAAA,KAAK0W,SAAL1W,cAAAA,KAAc;gBAA/B,IAAM0W,UACHqB,gCACJrB,EAAQqB;gBAGVqB,EAAS/S,KAAK,IAAIsR,GAAQjB,EAAQjF,OAAOsG;;;wBAI3C,IAAMnB,IAAU5W,KAAK6W,QACjB,IAAIwC,GAAMrZ,KAAK6W,MAAMyC,WAAWtZ,KAAK6W,MAAM0C,UAC3C,MACE1C,IAAQ7W,KAAK4W,UACf,IAAIyC,GAAMrZ,KAAK4W,QAAQ0C,WAAWtZ,KAAK4W,QAAQ2C,UAC/C;;wBAGJvZ,KAAKkZ,KAAiB,IAAIC,GACxBnZ,KAAKsH,MACLtH,KAAKyW,iBACL2C,GACApZ,KAAK2W,SACL3W,KAAKkG,OACL0Q,GACAC;;QAIN,OAAO7W,KAAKkZ;OAGNpZ,iBAAAA,SAA8B+T;QACpC,IAAM2F,IAAU3F,EAAI9K,IAAIzB;QACxB,OAA6B,SAAzBtH,KAAKyW,kBAIL5C,EAAI9K,IAAI0Q,GAAgBzZ,KAAKyW,oBAC7BzW,KAAKsH,KAAKgK,EAAWkI,KAEdlR,EAAY0O,GAAchX,KAAKsH,QAEjCtH,KAAKsH,KAAK9B,QAAQgU,KAGlBxZ,KAAKsH,KAAKoS,EAAoBF;;;;;;IAQjC1Z,iBAAAA,SAAe+T;QACrB,KAAsB7T,WAAAA,IAAAA,KAAKiX,IAALjX,cAAAA;YAAjB,IAAM0W;;wBAET,KAAKA,EAAQjF,MAAMiG,OAA6C,SAA7B7D,EAAIpC,MAAMiF,EAAQjF,QACnD;;QAGJ;OAGM3R,iBAAAA,SAAe+T;QACrB,KAAqB7T,WAAAA,IAAAA,KAAK2W,SAAL3W,cAAAA;YACnB,UAAY2Z,QAAQ9F,IAClB;;QAGJ;;;;;IAMM/T,iBAAAA,SAAc+T;QACpB,SAAI7T,KAAK4W,YAAY5W,KAAK4W,QAAQgD,GAAoB5Z,KAAK0W,SAAS7C,MAGhE7T,KAAK6W,SAAS7W,KAAK6W,MAAM+C,GAAoB5Z,KAAK0W,SAAS7C;OAMzD/T,iBAAAA,SAAiBqY;;IA0BzBrY,WACS2R,GACAuH,GACApX;QAHT9B;gBAKE0B,IAAAA,8BAJOiQ,GACAzR,OAAAgZ,GACAhZ,UAAA4B;;;;gDAQT9B,SAAc2R,GAAkBuH,GAAcpX;QAC5C,IAAI6P,EAAMiG,KACR,yBAAIsB,IASK,IAAIa,GAAiBpI,GAAO7P,KAU5B,IAAIkY,GAAerI,GAAOuH,GAAIpX;QAElC,IAAIgO,EAAYhO,IAAQ;YAC7B,yBAAIoX,GACF,MAAM,IAAI5V,EACRhD,EAAKI,kBACL;YAGJ,OAAO,IAAIqY,EAAYpH,GAAOuH,GAAIpX;;QAC7B,IAAIiO,EAAWjO,IAAQ;YAC5B,yBAAIoX,GACF,MAAM,IAAI5V,EACRhD,EAAKI,kBACL;YAGJ,OAAO,IAAIqY,EAAYpH,GAAOuH,GAAIpX;;QAC7B,iDAAIoX,IACF,IAAIe,GAAoBtI,GAAO7P,uBAC7BoX,IAKF,IAAIgB,GAASvI,GAAO7P,uDAClBoX,IAKF,IAAIiB,GAAuBxI,GAAO7P,KAElC,IAAIiX,EAAYpH,GAAOuH,GAAIpX;OAItC9B,sBAAAA,SAAQ+T;QACN,IAAM7O,IAAQ6O,EAAIpC,MAAMzR,KAAKyR;;gBAG7B,OACY,SAAVzM,KACAqG,EAAUrL,KAAK4B,WAAWyJ,EAAUrG,MACpChF,KAAKka,GAAkBjN,EAAajI,GAAOhF,KAAK4B;OAI1C9B,iBAAAA,SAAkB+N;QAC1B,QAAQ7N,KAAKgZ;UACX;YACE,OAAOnL,IAAa;;UACtB;YACE,OAAOA,KAAc;;UACvB;YACE,OAAsB,MAAfA;;UACT;YACE,OAAOA,IAAa;;UACtB;YACE,OAAOA,KAAc;;UACvB;YACE,OA7hBDjI;;OAiiBL9F,iBAAAA;QACE,OACE,oHAKEyH,QAAQvH,KAAKgZ,OAAO;OAI1BlZ,0BAAAA;;;;QAIE,OACEE,KAAKyR,MAAMpK,MACXrH,KAAKgZ,GAAGvX,aACR6M,EAAYtO,KAAK4B;OAIrB9B,sBAAAA,SAAQkF;QACN,OAAIA,aAAiB6T,KAEjB7Y,KAAKgZ,OAAOhU,EAAMgU,MAClBhZ,KAAKyR,MAAMjM,QAAQR,EAAMyM,UACzBnG,EAAYtL,KAAK4B,OAAOoD,EAAMpD;OAOpC9B,uBAAAA;QACE,OAAUE,KAAKyR,MAAMpK,YAAqBrH,KAAKgZ,WAAM1K,EACnDtO,KAAK4B;;;IAST9B,WAAY2R,GAAkBuH,GAAcpX;QAA5C9B;gBACE0B,IAAAA,aAAMiQ,GAAOuH,GAAIpX,YAKZmH,MAAMT,EAAYoG,EAAS9M,EAAMiK;;WATNgN,mBAYlC/Y,sBAAAA,SAAQ+T;QACN,IAAMhG,IAAavF,EAAYvC,EAAW8N,EAAI9K,KAAK/I,KAAK+I;QACxD,OAAO/I,KAAKka,GAAkBrM;;EAdEgL;IAsBlC/Y,WAAY2R,GAAkB7P;QAA9B9B;gBACE0B,IAAAA,aAAMiQ,mBAAoB7P,YAErBsM,QAAQtM,EAAM4K,WAAWC,UAAU,IAAI5E,KAAImF,SAAAA;YAKvC1E,OAAAA,EAAYoG,EAAS1B,EAAEnB;;;WAXEgN,mBAepC/Y,sBAAAA,SAAQ+T;QACN,OAAO7T,KAAKkO,KAAKqC,MAAKxH,SAAAA;YAAOA,OAAAA,EAAIvD,QAAQqO,EAAI9K;;;EAhBX8P;IAsBpC/Y,WAAY2R,GAAkB7P;eAC5BJ,aAAMiQ,2CAAgC7P;;WAFDiX,mBAKvC/Y,sBAAAA,SAAQ+T;QACN,IAAM7O,IAAQ6O,EAAIpC,MAAMzR,KAAKyR;QAC7B,OAAO9B,EAAQ3K,MAAU4H,EAAmB5H,EAAMwH,YAAYxM,KAAK4B;;EAP9BiX;IAavC/Y,WAAY2R,GAAkB7P;eAC5BJ,aAAMiQ,mBAAoB7P;;WAFAiX,mBAM5B/Y,sBAAAA,SAAQ+T;QACN,IAAM7O,IAAQ6O,EAAIpC,MAAMzR,KAAKyR;QAC7B,OAAiB,SAAVzM,KAAkB4H,EAAmB5M,KAAK4B,MAAiB4K,YAAExH;;EAR1C6T;IAc5B/Y,WAAY2R,GAAkB7P;eAC5BJ,aAAMiQ,mDAAoC7P;;WAFFiX,mBAM1C/Y,sBAAAA,SAAQ+T;QAAR/T,cACQkF,IAAQ6O,EAAIpC,MAAMzR,KAAKyR;QAC7B,UAAK9B,EAAQ3K,OAAWA,EAAMwH,WAAWC,WAGlCzH,EAAMwH,WAAWC,OAAO8D,MAAK4J,SAAAA;YAClCvN,OAAAA,EAAmB5M,EAAK4B,MAAiB4K,YAAE2N;;;EAZLtB;IAwC1C/Y,WAAqBwZ,GAAgCC;QAAhCvZ,gBAAAsZ,GAAgCtZ,cAAAuZ;;WAErDzZ,0BAAAA;;QAEE,QAAUE,KAAKuZ,SAAS,MAAM,aAAOvZ,KAAKsZ,SACvCzR,KAAIuS,SAAAA;YAAK9L,OAAAA,EAAY8L;YACrBhT,KAAK;;;;;;IAOVtH,iBAAAA,SAAoB4W,GAAoB7C;QAMtC,KADA,IAAIhG,IAAa,GACRpH,IAAI,GAAGA,IAAIzG,KAAKsZ,SAAS3T,QAAQc,KAAK;YAC7C,IAAM4T,IAAmB3D,EAAQjQ,IAC3B6T,IAAYta,KAAKsZ,SAAS7S;YAqBhC,IAfEoH,IALEwM,EAAiB5I,MAAMiG,MAKZpP,EAAYvC,EACvBuC,EAAYoG,EAAS4L,EAAUzO,iBAC/BgI,EAAI9K,OAQOkE,EAAaqN,GALTzG,EAAIpC,MAAM4I,EAAiB5I;wCAO1C4I,EAAiBtC,QACnBlK,MAA2B,IAEV,MAAfA,GACF;;QAGJ,OAAO7N,KAAKuZ,SAAS1L,KAAc,IAAIA,IAAa;OAGtD/N,sBAAAA,SAAQkF;QACN,IAAc,SAAVA,GACF;QAEF,IACEhF,KAAKuZ,WAAWvU,EAAMuU,UACtBvZ,KAAKsZ,SAAS3T,WAAWX,EAAMsU,SAAS3T,QAExC;QAEF,KAAK,IAAIc,IAAI,GAAGA,IAAIzG,KAAKsZ,SAAS3T,QAAQc,KAGxC,KAAK6E,EAFgBtL,KAAKsZ,SAAS7S,IACbzB,EAAMsU,SAAS7S,KAEnC;QAGJ;;;IAWF3G,WAAqB2R,GAAkBsG;QAAlB/X,aAAAyR,cACfsG,MACFA,4BAEF/X,KAAK+X,MAAMA,GACX/X,KAAKua,KAAe9I,EAAMiG;;WAG5B5X,sBAAAA,SAAQuY,GAAcC;QACpB,IAAMzK,IAAa7N,KAAKua,KACpBjS,EAAYvC,EAAWsS,EAAGtP,KAAKuP,EAAGvP,gBF1rBxC0I,GACA4G,GACAC;YAEA,IAAMkC,IAAKnC,EAAG5G,MAAMA,IACdgJ,IAAKnC,EAAG7G,MAAMA;YACpB,OAAW,SAAP+I,KAAsB,SAAPC,IACVxN,EAAauN,GAAIC,KA5FnB7U;UEgxBuB5F,KAAKyR,OAAO4G,GAAIC;QAC5C,QAAQtY,KAAK+X;UACX;YACE,OAAOlK;;UACT;YACE,QAAQ,IAAIA;;UACd;YACE,OAnxBDjI;;OAuxBL9F,0BAAAA;;QAEE,OAAOE,KAAKyR,MAAMpK,MAAoBrH,KAAK+X,IAAItW;OAGjD3B,uBAAAA;QACE,OAAUE,KAAKyR,MAAMpK,aAAsBrH,KAAK+X;OAGlDjY,sBAAAA,SAAQkF;QACN,OAAOhF,KAAK+X,QAAQ/S,EAAM+S,OAAO/X,KAAKyR,MAAMjM,QAAQR,EAAMyM;;;ICxxB5D3R;;IAEW4a;;;;;IAKAC;;IAEAC;;;;;IAKAC;;IAEAC;;;;UAKAC;;;;;;UAOAC;yBAZAF,IAAmCxV,EAAgByB,yBAKnDgU,IAAgDzV,EAAgByB,yBAOhEiU,IAA0BzR,EAAW0R;QA1BrCjb,cAAA0a,GAKA1a,gBAAA2a,aAEAC,GAKA5a,sBAAA6a,aAEAC;QAKA9a,oCAAA+a,GAOA/a,mBAAAgb;;yFAIXlb,iBAAAA,SAAmB+a;QACjB,OAAO,IAAIK,EACTlb,KAAK0a,QACL1a,KAAK2a,UACL3a,KAAK4a,IACLC,GACA7a,KAAK8a,IACL9a,KAAK+a,8BACL/a,KAAKgb;;;;;;IAQTlb,iBAAAA,SACEkb,GACAF;QAEA,OAAO,IAAII,EACTlb,KAAK0a,QACL1a,KAAK2a,UACL3a,KAAK4a,IACL5a,KAAK6a,gBACLC,GACA9a,KAAK+a,8BACLC;;;;;;IAQJlb,iBAAAA,SACEib;QAEA,OAAO,IAAIG,EACTlb,KAAK0a,QACL1a,KAAK2a,UACL3a,KAAK4a,IACL5a,KAAK6a,gBACL7a,KAAK8a,IACLC,GACA/a,KAAKgb;;;;AClGTlb,SAAmBgJ;IAAA9I,aAAA8I;;;;;;;;;;;;;SLsCLqS,GAAiB7Z;IAC/B,QAAQA;MACN,KAAKlB,EAAKC;QACR,OAnCwFuF;;MAoC1F,KAAKxF,EAAKE;MACV,KAAKF,EAAKG;MACV,KAAKH,EAAKK;MACV,KAAKL,EAAKU;MACV,KAAKV,EAAKe;MACV,KAAKf,EAAKgB;;;cAGV,KAAKhB,EAAKS;QACR;;MACF,KAAKT,EAAKI;MACV,KAAKJ,EAAKM;MACV,KAAKN,EAAKO;MACV,KAAKP,EAAKQ;MACV,KAAKR,EAAKW;;;;cAIV,KAAKX,EAAKY;MACV,KAAKZ,EAAKa;MACV,KAAKb,EAAKc;MACV,KAAKd,EAAKiB;QACR;;MACF;QACE,OA5DwFuE;;;;;;;;;;;;;;;;;;;;;;aAwG9EwV,GAAmB9Z;IACjC,eAAIA;;;IAIF,OADA+Z,GAAS,4BACFjb,EAAKG;IAGd,QAAQe;MACN,KAAK6U,GAAQ9V;QACX,OAAOD,EAAKC;;MACd,KAAK8V,GAAQ7V;QACX,OAAOF,EAAKE;;MACd,KAAK6V,GAAQ5V;QACX,OAAOH,EAAKG;;MACd,KAAK4V,GAAQ1V;QACX,OAAOL,EAAKK;;MACd,KAAK0V,GAAQrV;QACX,OAAOV,EAAKU;;MACd,KAAKqV,GAAQhV;QACX,OAAOf,EAAKe;;MACd,KAAKgV,GAAQ/U;QACX,OAAOhB,EAAKgB;;MACd,KAAK+U,GAAQtV;QACX,OAAOT,EAAKS;;MACd,KAAKsV,GAAQ3V;QACX,OAAOJ,EAAKI;;MACd,KAAK2V,GAAQzV;QACX,OAAON,EAAKM;;MACd,KAAKyV,GAAQxV;QACX,OAAOP,EAAKO;;MACd,KAAKwV,GAAQvV;QACX,OAAOR,EAAKQ;;MACd,KAAKuV,GAAQpV;QACX,OAAOX,EAAKW;;MACd,KAAKoV,GAAQnV;QACX,OAAOZ,EAAKY;;MACd,KAAKmV,GAAQlV;QACX,OAAOb,EAAKa;;MACd,KAAKkV,GAAQjV;QACX,OAAOd,EAAKc;;MACd,KAAKiV,GAAQ9U;QACX,OAAOjB,EAAKiB;;MACd;QACE,OApJwFuE;;;;;;;;;;;UAMzFuQ,OAAAA,6BAEHmF;AACAA,gCACAA;AACAA,oDACAA;AACAA,8CACAA;AACAA,iDACAA;AACAA,wDACAA;AACAA,2CACAA;AACAA,mCACAA,yCACAA;;;;;;;;;;;;;;;;;;;;;IMFAxb,WACSiG,GACPwV;iBADOxV,GAGP/F,KAAKub,OAAOA,KAAcC,GAASC;;;eAIrC3b,iBAAAA,SAAOiJ,GAAQnH;QACb,OAAO,IAAI8Z,EACT1b,KAAK+F,GACL/F,KAAKub,KACFI,GAAO5S,GAAKnH,GAAO5B,KAAK+F,GACxB6V,GAAK,MAAM,MAAMJ,GAASK,IAAO,MAAM;;;IAK9C/b,qBAAAA,SAAOiJ;QACL,OAAO,IAAI2S,EACT1b,KAAK+F,GACL/F,KAAKub,KACFO,OAAO/S,GAAK/I,KAAK+F,GACjB6V,GAAK,MAAM,MAAMJ,GAASK,IAAO,MAAM;;;IAK9C/b,kBAAAA,SAAIiJ;QAEF,KADA,IAAIgT,IAAO/b,KAAKub,OACRQ,EAAK3S,OAAW;YACtB,IAAM4S,IAAMhc,KAAK+F,EAAWgD,GAAKgT,EAAKhT;YACtC,IAAY,MAARiT,GACF,OAAOD,EAAKna;YACHoa,IAAM,IACfD,IAAOA,EAAK/U,OACHgV,IAAM,MACfD,IAAOA,EAAK9U;;QAGhB,OAAO;;;;IAKTnH,sBAAAA,SAAQiJ;QAIN;;QAFA,IAAIkT,IAAc,GACdF,IAAO/b,KAAKub,OACRQ,EAAK3S,OAAW;YACtB,IAAM4S,IAAMhc,KAAK+F,EAAWgD,GAAKgT,EAAKhT;YACtC,IAAY,MAARiT,GACF,OAAOC,IAAcF,EAAK/U,KAAKT;YACtByV,IAAM,IACfD,IAAOA,EAAK/U;;YAGZiV,KAAeF,EAAK/U,KAAKT,OAAO,GAChCwV,IAAOA,EAAK9U;;;gBAIhB,QAAQ;OAGVnH,gBAAAA;QACE,OAAOE,KAAKub,KAAKnS;OAInB7C;;aAAAA;YACE,OAAOvG,KAAKub,KAAKhV;;;;;;IAInBzG,iBAAAA;QACE,OAAOE,KAAKub,KAAKW;;;IAInBpc,iBAAAA;QACE,OAAOE,KAAKub,KAAKY;;;;;;IAOnBrc,iBAAAA,SAAoBsc;QAClB,OAAQpc,KAAKub,KAAwBc,GAAiBD;OAGxDtc,sBAAAA,SAAQ6G;QACN3G,KAAKqc,IAAiB,SAACC,GAAGtP;mBACxBrG,EAAG2V,GAAGtP;;OAKVlN,uBAAAA;QACE,IAAMyc,IAAyB;QAK/B,OAJAvc,KAAKqc,IAAiB,SAACC,GAAGtP;mBACxBuP,EAAalW,KAAQiW,UAAKtP;aAGrB,MAAIuP,EAAanV,KAAK;;;;;;;IAQ/BtH,iBAAAA,SAAoBsc;QAClB,OAAQpc,KAAKub,KAAwBiB,GAAiBJ;;;IAIxDtc,iBAAAA;QACE,OAAO,IAAI2c,GAAwBzc,KAAKub,MAAM,MAAMvb,KAAK+F;OAG3DjG,iBAAAA,SAAgBiJ;QACd,OAAO,IAAI0T,GAAwBzc,KAAKub,MAAMxS,GAAK/I,KAAK+F;OAG1DjG,iBAAAA;QACE,OAAO,IAAI2c,GAAwBzc,KAAKub,MAAM,MAAMvb,KAAK+F;OAG3DjG,iBAAAA,SAAuBiJ;QACrB,OAAO,IAAI0T,GAAwBzc,KAAKub,MAAMxS,GAAK/I,KAAK+F;;;IAS1DjG,WACEic,GACAW,GACA3W,GACA4W;QAEA3c,KAAK2c,KAAYA,GACjB3c,KAAK4c,KAAY;QAGjB,KADA,IAAIZ,IAAM,IACFD,EAAK3S,OAOX,IANA4S,IAAMU,IAAW3W,EAAWgW,EAAKhT,KAAK2T,KAAY;;QAE9CC,MACFX,MAAQ,IAGNA,IAAM;;QAGND,IADE/b,KAAK2c,KACAZ,EAAK/U,OAEL+U,EAAK9U,YAET;YAAA,IAAY,MAAR+U,GAAW;;;gBAGpBhc,KAAK4c,GAAUvW,KAAK0V;gBACpB;;;;wBAIA/b,KAAK4c,GAAUvW,KAAK0V,IAElBA,IADE/b,KAAK2c,KACAZ,EAAK9U,QAEL8U,EAAK/U;;;WAMpBlH,iBAAAA;QAME,IAAIic,IAAO/b,KAAK4c,GAAUC,OACpBjO,IAAS;YAAE7F,KAAKgT,EAAKhT;YAAKnH,OAAOma,EAAKna;;QAE5C,IAAI5B,KAAK2c,IAEP,KADAZ,IAAOA,EAAK/U,OACJ+U,EAAK3S,OACXpJ,KAAK4c,GAAUvW,KAAK0V,IACpBA,IAAOA,EAAK9U,YAId,KADA8U,IAAOA,EAAK9U,QACJ8U,EAAK3S,OACXpJ,KAAK4c,GAAUvW,KAAK0V;QACpBA,IAAOA,EAAK/U;QAIhB,OAAO4H;OAGT9O,iBAAAA;QACE,OAAOE,KAAK4c,GAAUjX,SAAS;OAGjC7F,iBAAAA;QACE,IAA8B,MAA1BE,KAAK4c,GAAUjX,QACjB,OAAO;QAGT,IAAMoW,IAAO/b,KAAK4c,GAAU5c,KAAK4c,GAAUjX,SAAS;QACpD,OAAO;YAAEoD,KAAKgT,EAAKhT;YAAKnH,OAAOma,EAAKna;;;;IAkBtC9B,WACSiJ,GACAnH,GACPkb,GACA9V,GACAC;QAJOjH,WAAA+I,GACA/I,aAAA4B,GAKP5B,KAAK8c,QAAiB,QAATA,IAAgBA,IAAQtB,EAASuB,KAC9C/c,KAAKgH,OAAe,QAARA,IAAeA,IAAOwU,EAASC;QAC3Czb,KAAKiH,QAAiB,QAATA,IAAgBA,IAAQuU,EAASC,OAC9Czb,KAAKuG,OAAOvG,KAAKgH,KAAKT,OAAO,IAAIvG,KAAKiH,MAAMV;;;eAI9CzG,iBAAAA,SACEiJ,GACAnH,GACAkb,GACA9V,GACAC;QAEA,OAAO,IAAIuU,EACF,QAAPzS,IAAcA,IAAM/I,KAAK+I,KAChB,QAATnH,IAAgBA,IAAQ5B,KAAK4B,OACpB,QAATkb,IAAgBA,IAAQ9c,KAAK8c,OACrB,QAAR9V,IAAeA,IAAOhH,KAAKgH,MAClB,QAATC,IAAgBA,IAAQjH,KAAKiH;OAIjCnH,gBAAAA;QACE;;;;;;IAOFA,iBAAAA,SAAoBsc;QAClB,OACGpc,KAAKgH,KAAwBqV,GAAiBD,MAC/CA,EAAOpc,KAAK+I,KAAK/I,KAAK4B,UACrB5B,KAAKiH,MAAyBoV,GAAiBD;;;;;;IAQpDtc,iBAAAA,SAAoBsc;QAClB,OACGpc,KAAKiH,MAAyBuV,GAAiBJ,MAChDA,EAAOpc,KAAK+I,KAAK/I,KAAK4B,UACrB5B,KAAKgH,KAAwBwV,GAAiBJ;;;IAK3Ctc,kBAAAA;QACN,OAAIE,KAAKgH,KAAKoC,MACLpJ,OAECA,KAAKgH,KAAwBD;;;IAKzCjH,iBAAAA;QACE,OAAOE,KAAK+G,MAAMgC;;;IAIpBjJ,iBAAAA;QACE,OAAIE,KAAKiH,MAAMmC,MACNpJ,KAAK+I,MAEL/I,KAAKiH,MAAMkV;;;IAKtBrc,iBAAAA,SAAOiJ,GAAQnH,GAAUmE;QACvB,IAAIiX,IAAoBhd,MAClBgc,IAAMjW,EAAWgD,GAAKiU,EAAEjU;QAc9B,QAZEiU,IADEhB,IAAM,IACJgB,EAAEpB,GAAK,MAAM,MAAM,MAAMoB,EAAEhW,KAAK2U,GAAO5S,GAAKnH,GAAOmE,IAAa,QACnD,MAARiW,IACLgB,EAAEpB,GAAK,MAAMha,GAAO,MAAM,MAAM,QAEhCob,EAAEpB,GACJ,MACA,MACA,MACA,MACAoB,EAAE/V,MAAM0U,GAAO5S,GAAKnH,GAAOmE,KAGtBkX;OAGHnd,iBAAAA;QACN,IAAIE,KAAKgH,KAAKoC,KACZ,OAAOoS,EAASC;QAElB,IAAIuB,IAAoBhd;QAKxB,OAJKgd,EAAEhW,KAAKkW,QAAYF,EAAEhW,KAAKA,KAAKkW,SAClCF,IAAIA,EAAEG,QAERH,IAAIA,EAAEpB,GAAK,MAAM,MAAM,MAAOoB,EAAEhW,KAAwBoW,MAAa,OAC5DH;;;IAIXnd,qBAAAA,SACEiJ,GACAhD;QAEA,IAAIsX,GACAL,IAAoBhd;QACxB,IAAI+F,EAAWgD,GAAKiU,EAAEjU,OAAO,GACtBiU,EAAEhW,KAAKoC,OAAc4T,EAAEhW,KAAKkW,QAAYF,EAAEhW,KAAKA,KAAKkW,SACvDF,IAAIA,EAAEG;QAERH,IAAIA,EAAEpB,GAAK,MAAM,MAAM,MAAMoB,EAAEhW,KAAK8U,OAAO/S,GAAKhD,IAAa,YACxD;YAOL,IANIiX,EAAEhW,KAAKkW,SACTF,IAAIA,EAAEM,OAEHN,EAAE/V,MAAMmC,OAAc4T,EAAE/V,MAAMiW,QAAYF,EAAE/V,MAAMD,KAAKkW,SAC1DF,IAAIA,EAAEO;YAEuB,MAA3BxX,EAAWgD,GAAKiU,EAAEjU,MAAY;gBAChC,IAAIiU,EAAE/V,MAAMmC,KACV,OAAOoS,EAASC;gBAEhB4B,IAAYL,EAAE/V,MAAyBF,OACvCiW,IAAIA,EAAEpB,GACJyB,EAAStU,KACTsU,EAASzb,OACT,MACA,MACCob,EAAE/V,MAAyBmW;;YAIlCJ,IAAIA,EAAEpB,GAAK,MAAM,MAAM,MAAM,MAAMoB,EAAE/V,MAAM6U,OAAO/S,GAAKhD;;QAEzD,OAAOiX,EAAEC;OAGXnd,iBAAAA;QACE,OAAOE,KAAK8c;;;IAINhd,iBAAAA;QACN,IAAIkd,IAAoBhd;QAUxB,OATIgd,EAAE/V,MAAMiW,SAAYF,EAAEhW,KAAKkW,SAC7BF,IAAIA,EAAEQ,OAEJR,EAAEhW,KAAKkW,QAAWF,EAAEhW,KAAKA,KAAKkW,SAChCF,IAAIA,EAAEM;QAEJN,EAAEhW,KAAKkW,QAAWF,EAAE/V,MAAMiW,SAC5BF,IAAIA,EAAES,OAEDT;OAGDld,iBAAAA;QACN,IAAIkd,IAAIhd,KAAKyd;QAYb,OAXIT,EAAE/V,MAAMD,KAAKkW,SASfF,KADAA,KAPAA,IAAIA,EAAEpB,GACJ,MACA,MACA,MACA,MACCoB,EAAE/V,MAAyBqW,OAExBE,MACAC;QAEDT;OAGDld,iBAAAA;QACN,IAAIkd,IAAIhd,KAAKyd;QAKb,OAJIT,EAAEhW,KAAKA,KAAKkW,SAEdF,KADAA,IAAIA,EAAEM,MACAG,OAEDT;OAGDld,iBAAAA;QACN,IAAM4d,IAAK1d,KAAK4b,GAAK,MAAM,MAAMJ,EAASuB,KAAK,MAAM/c,KAAKiH,MAAMD;QAChE,OAAQhH,KAAKiH,MAAyB2U,GACpC,MACA,MACA5b,KAAK8c,OACLY,GACA;OAII5d,iBAAAA;QACN,IAAM6d,IAAK3d,KAAK4b,GAAK,MAAM,MAAMJ,EAASuB,KAAK/c,KAAKgH,KAAKC,OAAO;QAChE,OAAQjH,KAAKgH,KAAwB4U,GAAK,MAAM,MAAM5b,KAAK8c,OAAO,MAAMa;OAGlE7d,iBAAAA;QACN,IAAMkH,IAAOhH,KAAKgH,KAAK4U,GAAK,MAAM,OAAO5b,KAAKgH,KAAK8V,OAAO,MAAM,OAC1D7V,IAAQjH,KAAKiH,MAAM2U,GAAK,MAAM,OAAO5b,KAAKiH,MAAM6V,OAAO,MAAM;QACnE,OAAO9c,KAAK4b,GAAK,MAAM,OAAO5b,KAAK8c,OAAO9V,GAAMC;;;IAIlDnH,iBAAAA;QACE,IAAM8d,IAAa5d,KAAK6d;QACxB,OAAIhZ,KAAKiZ,IAAI,GAAKF,MAAe5d,KAAKuG,OAAO;;;;IASrCzG,iBAAAA;QACR,IAAIE,KAAKkd,QAAWld,KAAKgH,KAAKkW,MAC5B,MAveetX;QAyejB,IAAI5F,KAAKiH,MAAMiW,MACb,MA1eetX;QA4ejB,IAAMgY,IAAc5d,KAAKgH,KAAwB6W;QACjD,IAAID,MAAgB5d,KAAKiH,MAAyB4W,MAChD,MA9eejY;QAgff,OAAOgY,KAAc5d,KAAKkd,OAAU,IAAI;;;;;;;;;WArPJ,MAEjC1B,aACAA;;AAiUTA,GAASC,QAAQ;IAzEjB3b;QAgBEE,YAAO;;WAfP+I;aAAAA;YACE,MAxfiBnD;;;;QA0fnBhE;aAAAA;YACE,MA3fiBgE;;;;QA6fnBkX;aAAAA;YACE,MA9fiBlX;;;;QAggBnBoB;aAAAA;YACE,MAjgBiBpB;;;;QAmgBnBqB;aAAAA;YACE,MApgBiBrB;;;;;;IAygBnB9F,iBAAAA,SACEiJ,GACAnH,GACAkb,GACA9V,GACAC;QAEA,OAAOjH;;;IAITF,iBAAAA,SAAOiJ,GAAQnH,GAAUmE;QACvB,OAAO,IAAIyV,GAAezS,GAAKnH;;;IAIjC9B,qBAAAA,SAAOiJ,GAAQhD;QACb,OAAO/F;OAGTF,gBAAAA;QACE;OAGFA,iBAAAA,SAAiBsc;QACf;OAGFtc,iBAAAA,SAAiBsc;QACf;OAGFtc,iBAAAA;QACE,OAAO;OAGTA,iBAAAA;QACE,OAAO;OAGTA,iBAAAA;QACE;;;IAIFA,iBAAAA;QACE;OAGQA,iBAAAA;QACR,OAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;ICxjBTA,WAAoBiG;iBAAAA,GAClB/F,KAAK6S,OAAO,IAAI6I,GAAsB1b,KAAK+F;;WAG7CjG,kBAAAA,SAAIie;QACF,OAA+B,SAAxB/d,KAAK6S,KAAK/P,IAAIib;OAGvBje,oBAAAA;QACE,OAAOE,KAAK6S,KAAKqJ;OAGnBpc,mBAAAA;QACE,OAAOE,KAAK6S,KAAKsJ;OAGnB5V;aAAAA;YACE,OAAOvG,KAAK6S,KAAKtM;;;;QAGnBzG,sBAAAA,SAAQie;QACN,OAAO/d,KAAK6S,KAAKtL,QAAQwW;;8DAI3Bje,sBAAAA,SAAQke;QACNhe,KAAK6S,KAAKwJ,IAAiB,SAACC,GAAMtP;mBAChCgR,EAAG1B;;;yEAMPxc,iBAAAA,SAAeme,GAAeD;QAE5B,KADA,IAAME,IAAOle,KAAK6S,KAAKsL,GAAgBF,EAAM,KACtCC,EAAKE,QAAW;YACrB,IAAML,IAAOG,EAAKG;YAClB,IAAIre,KAAK+F,EAAWgY,EAAKhV,KAAKkV,EAAM,OAAO,GACzC;YAEFD,EAAGD,EAAKhV;;;;;;IAOZjJ,iBAAAA,SAAake,GAA0BM;QACrC,IAAIJ;QAMJ,KAJEA,eADEI,IACKte,KAAK6S,KAAKsL,GAAgBG,KAE1Bte,KAAK6S,KAAK0L,MAEZL,EAAKE,QAGV,KADeJ,EADFE,EAAKG,KACKtV,MAErB;;oEAMNjJ,iBAAAA,SAAkBie;QAChB,IAAMG,IAAOle,KAAK6S,KAAKsL,GAAgBJ;QACvC,OAAOG,EAAKE,OAAYF,EAAKG,KAAUtV,MAAM;OAG/CjJ,iBAAAA;QACE,OAAO,IAAI0e,GAAqBxe,KAAK6S,KAAK0L;OAG5Cze,iBAAAA,SAAgBiJ;QACd,OAAO,IAAIyV,GAAqBxe,KAAK6S,KAAKsL,GAAgBpV;;yCAI5DjJ,kBAAAA,SAAIie;QACF,OAAO/d,KAAK4b,GAAK5b,KAAK6S,KAAKiJ,OAAOiC,GAAMpC,GAAOoC;;8BAIjDje,qBAAAA,SAAOie;QACL,OAAK/d,KAAKye,IAAIV,KAGP/d,KAAK4b,GAAK5b,KAAK6S,KAAKiJ,OAAOiC,MAFzB/d;OAKXF,gBAAAA;QACE,OAAOE,KAAK6S,KAAKzJ;OAGnBtJ,iBAAAA,SAAUkF;QACR,IAAI4J,IAAuB5O;;gBAW3B,OARI4O,EAAOrI,OAAOvB,EAAMuB,SACtBqI,IAAS5J,GACTA,IAAQhF,OAGVgF,EAAMmB,SAAQ4X,SAAAA;YACZnP,IAASA,EAAO8P,IAAIX;aAEfnP;OAGT9O,sBAAAA,SAAQkF;QACN,MAAMA,aAAiB2Z,IACrB;QAEF,IAAI3e,KAAKuG,SAASvB,EAAMuB,MACtB;QAKF,KAFA,IAAMqY,IAAS5e,KAAK6S,KAAK0L,MACnBM,IAAU7Z,EAAM6N,KAAK0L,MACpBK,EAAOR,QAAW;YACvB,IAAMU,IAAWF,EAAOP,KAAUtV,KAC5BgW,IAAYF,EAAQR,KAAUtV;YACpC,IAA6C,MAAzC/I,KAAK+F,EAAW+Y,GAAUC,IAC5B;;QAGJ;OAGFjf,gBAAAA;QACE,IAAMkf,IAAW;QAIjB,OAHAhf,KAAKmG,SAAQwU,SAAAA;YACXqE,EAAI3Y,KAAKsU;aAEJqE;OAGTlf,uBAAAA;QACE,IAAM8O,IAAc;QAEpB,OADA5O,KAAKmG,SAAQ4X,SAAAA;YAAQnP,OAAAA,EAAOvI,KAAK0X;aAC1B,eAAenP,EAAOnN,aAAa;OAGpC3B,iBAAAA,SAAK+S;QACX,IAAMjE,IAAS,IAAI+P,EAAU3e,KAAK+F;QAElC,OADA6I,EAAOiE,OAAOA,GACPjE;;;IAKT9O,WAAoBoe;kBAAAA;;WAEpBpe,iBAAAA;QACE,OAAOE,KAAKke,GAAKG,KAAUtV;OAG7BjJ,iBAAAA;QACE,OAAOE,KAAKke,GAAKE;;KC1Jfa,KAA2B,IAAIvD,GACnCpT,EAAYvC;;SAEEmZ;IACd,OAAOD;;;SAQOE;IACd,OAAOD;;;AAST,IAAME,KAAqB,IAAI1D,GAC7BpT,EAAYvC;;SAEEsZ;IACd,OAAOD;;;AAIT,IAAME,KAA6B,IAAI5D,GACrCpT,EAAYvC;;SAEEwZ;IACd,OAAOD;;;AAIT,IAAME,KAAyB,IAAIb,GAAUrW,EAAYvC;;SACzC0Z;;IAEd,KADA,IAAIhM,IAAM+L,WACQtR,OAAAA,cAAAA;QAAb,IAAMnF;QACT0K,IAAMA,EAAIiL,IAAI3V;;IAEhB,OAAO0K;;;AAIT,IAAMiM,KAAsB,IAAIf,GAAoB1Z;;SACpC0a;IACd,OAAOD;;;;;;;;;;;;;;;;;;;;;;;;;;ICtCP5f,WAAY0Y;;;QAIRxY,KAAK+F,IADHyS,IACgB,SAACH,GAAcC;YAC/BE,OAAAA,EAAKH,GAAIC,MAAOhQ,EAAYvC,EAAWsS,EAAGtP,KAAKuP,EAAGvP;YAElC,SAACsP,GAAcC;YAC/BhQ,OAAAA,EAAYvC,EAAWsS,EAAGtP,KAAKuP,EAAGvP;WAGtC/I,KAAK4f,KAAWP,MAChBrf,KAAK6f,KAAY,IAAInE,GAA0B1b,KAAK+F;;;;;;kBArBtDjG,SAAgBggB;QACd,OAAO,IAAIC,EAAYD,EAAO/Z;OAuBhCjG,kBAAAA,SAAIiJ;QACF,OAAiC,QAA1B/I,KAAK4f,GAAS9c,IAAIiG;OAG3BjJ,kBAAAA,SAAIiJ;QACF,OAAO/I,KAAK4f,GAAS9c,IAAIiG;OAG3BjJ,oBAAAA;QACE,OAAOE,KAAK6f,GAAU3D;OAGxBpc,mBAAAA;QACE,OAAOE,KAAK6f,GAAU1D;OAGxBrc,gBAAAA;QACE,OAAOE,KAAK6f,GAAUzW;;;;;;IAOxBtJ,sBAAAA,SAAQiJ;QACN,IAAM8K,IAAM7T,KAAK4f,GAAS9c,IAAIiG;QAC9B,OAAO8K,IAAM7T,KAAK6f,GAAUtY,QAAQsM,MAAQ;OAG9CtN;aAAAA;YACE,OAAOvG,KAAK6f,GAAUtZ;;;;;+DAIxBzG,sBAAAA,SAAQke;QACNhe,KAAK6f,GAAUxD,IAAiB,SAACC,GAAGtP;mBAClCgR,EAAG1B;;;2DAMPxc,kBAAAA,SAAI+T;;QAEF,IAAMJ,IAAMzT,KAAK0T,OAAOG,EAAI9K;QAC5B,OAAO0K,EAAImI,GACTnI,EAAImM,GAASjE,GAAO9H,EAAI9K,KAAK8K,IAC7BJ,EAAIoM,GAAUlE,GAAO9H,GAAK;;+CAK9B/T,qBAAAA,SAAOiJ;QACL,IAAM8K,IAAM7T,KAAK8C,IAAIiG;QACrB,OAAK8K,IAIE7T,KAAK4b,GAAK5b,KAAK4f,GAAS9D,OAAO/S,IAAM/I,KAAK6f,GAAU/D,OAAOjI,MAHzD7T;OAMXF,sBAAAA,SAAQkF;QACN,MAAMA,aAAiB+a,IACrB;QAEF,IAAI/f,KAAKuG,SAASvB,EAAMuB,MACtB;QAKF,KAFA,IAAMqY,IAAS5e,KAAK6f,GAAUtB,MACxBM,IAAU7Z,EAAM6a,GAAUtB,MACzBK,EAAOR,QAAW;YACvB,IAAM4B,IAAUpB,EAAOP,KAAUtV,KAC3BkX,IAAWpB,EAAQR,KAAUtV;YACnC,KAAKiX,EAAQxa,QAAQya,IACnB;;QAGJ;OAGFngB,uBAAAA;QACE,IAAMogB,IAAuB;QAI7B,OAHAlgB,KAAKmG,SAAQ0N,SAAAA;YACXqM,EAAW7Z,KAAKwN,EAAIpS;aAEI,MAAtBye,EAAWva,SACN,mBAEA,sBAAsBua,EAAW9Y,KAAK,UAAU;OAInDtH,iBAAAA,SACN8f,GACAC;QAEA,IAAMM,IAAS,IAAIJ;QAInB,OAHAI,EAAOpa,IAAa/F,KAAK+F,GACzBoa,EAAOP,KAAWA,GAClBO,EAAON,KAAYA,GACZM;;;IClHXrgB;QACEE,UAAoB,IAAI0b,GACtBpT,EAAYvC;;WAGdjG,oBAAAA,SAAMsgB;QACJ,IAAMrX,IAAMqX,EAAOvM,IAAI9K,KACjBsX,IAAYrgB,KAAKsgB,GAAUxd,IAAIiG;QAChCsX;;0BAOHD,EAAOG,6BACPF,EAAUE,OAEVvgB,KAAKsgB,KAAYtgB,KAAKsgB,GAAU3E,GAAO5S,GAAKqX,0BAE5CA,EAAOG,4BACPF,EAAUE,OAEVvgB,KAAKsgB,KAAYtgB,KAAKsgB,GAAU3E,GAAO5S,GAAK;YAC1CwX,MAAMF,EAAUE;YAChB1M,KAAKuM,EAAOvM;kCAGduM,EAAOG,6BACPF,EAAUE,OAEVvgB,KAAKsgB,KAAYtgB,KAAKsgB,GAAU3E,GAAO5S,GAAK;YAC1CwX;YACA1M,KAAKuM,EAAOvM;kCAGduM,EAAOG,0BACPF,EAAUE,OAEVvgB,KAAKsgB,KAAYtgB,KAAKsgB,GAAU3E,GAAO5S,GAAK;YAC1CwX;YACA1M,KAAKuM,EAAOvM;iCAGduM,EAAOG,0BACPF,EAAUE,OAEVvgB,KAAKsgB,KAAYtgB,KAAKsgB,GAAUxE,OAAO/S,yBAEvCqX,EAAOG,6BACPF,EAAUE,OAEVvgB,KAAKsgB,KAAYtgB,KAAKsgB,GAAU3E,GAAO5S,GAAK;YAC1CwX;YACA1M,KAAKwM,EAAUxM;+BAGjBuM,EAAOG,4BACPF,EAAUE,OAEVvgB,KAAKsgB,KAAYtgB,KAAKsgB,GAAU3E,GAAO5S,GAAK;YAC1CwX;YACA1M,KAAKuM,EAAOvM;;;;;;;;;QAUdjO,OA/DA5F,KAAKsgB,KAAYtgB,KAAKsgB,GAAU3E,GAAO5S,GAAKqX;OAwEhDtgB,iBAAAA;QACE,IAAM0gB,IAAgC;QAMtC,OALAxgB,KAAKsgB,GAAUjE,IACb,SAACtT,GAAkBqX;YACjBI,EAAQna,KAAK+Z;aAGVI;;;IAKT1gB,WACW2gB,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC;QAPAhhB,aAAAygB,GACAzgB,YAAA0gB,aACAC,GACA3gB,kBAAA4gB,aACAC,GACA7gB,iBAAA8gB;kBACAC,aACAC;;;kBAIXlhB,SACE2gB,GACAQ,GACAJ,GACAC;QAEA,IAAMN,IAAgC;QAKtC,OAJAS,EAAU9a,SAAQ0N,SAAAA;YAChB2M,EAAQna,KAAK;gBAAEka;gBAAwB1M,KAAAA;;aAGlC,IAAIqN,EACTT,GACAQ,GACAlB,GAAYoB,GAASF,IACrBT,GACAK,GACAC;;;OAMJtK;aAAAA;YACE,QAAQxW,KAAK6gB,GAAYzX;;;;QAG3BtJ,sBAAAA,SAAQkF;QACN,MACEhF,KAAK8gB,cAAc9b,EAAM8b,aACzB9gB,KAAK+gB,OAAqB/b,EAAM+b,MAC/B/gB,KAAK6gB,GAAYrb,QAAQR,EAAM6b,OAC/B7gB,KAAKygB,MAAMjb,QAAQR,EAAMyb,UACzBzgB,KAAK0gB,KAAKlb,QAAQR,EAAM0b,SACxB1gB,KAAK2gB,GAAQnb,QAAQR,EAAM2b,MAE5B;QAEF,IAAMH,IAAgCxgB,KAAK4gB,YACrCQ,IAAqCpc,EAAM4b;QACjD,IAAIJ,EAAQ7a,WAAWyb,EAAazb,QAClC;QAEF,KAAK,IAAIc,IAAI,GAAGA,IAAI+Z,EAAQ7a,QAAQc,KAClC,IACE+Z,EAAQ/Z,GAAG8Z,SAASa,EAAa3a,GAAG8Z,SACnCC,EAAQ/Z,GAAGoN,IAAIrO,QAAQ4b,EAAa3a,GAAGoN,MAExC;QAGJ;;;ICxKF/T;;;;IAIWgb;;;;IAIAuG;;;;;IAKAC;;;;;IAKAC;;;;IAIAC;kBAlBA1G,aAIAuG,aAKAC,aAKAC,aAIAC;;;;;;;;;sBAUX1hB,SACE6a,GACA1S;QAEA,IAAMoZ,IAAgB,IAAIvM;QAQ1B,OAPAuM,EAAc5N,IACZkH,GACA8G,GAAaC,GACX/G,GACA1S,KAGG,IAAI0Z,EACTrc,EAAgByB,OAChBsa,GACA1B,MACAT,MACAO;;;IAcJ3f;;;;;;;IAOWkb;;;;;;IAMA/S;;;;;IAKA2Z;;;;;IAKAC;;;;;IAKAC;QArBA9hB,mBAAAgb,aAMA/S,aAKA2Z,aAKAC,aAKAC;;;;;;;kBAQXhiB,SACE6a,GACA1S;QAEA,OAAO,IAAIwZ,EACTlY,EAAW0R,IACXhT,GACAwX,MACAA,MACAA;;UC1FJ3f;;AAESiiB;;AAEAC;;AAEAjZ;;;;;AAKAkZ;cATAF,GAEA/hB,wBAAAgiB,GAEAhiB,WAAA+I,aAKAkZ;QAKTniB,SACS6a,GACAuH;IADAliB,gBAAA2a,aACAuH;QAaTpiB;;AAESqiB;;AAEAC;;;;;;;AAOApH;uDAEAqH;qBAFArH,IAA0BzR,EAAW0R,sBAErCoH,WAXAriB,aAAAmiB,GAEAniB,iBAAAoiB;IAOApiB,mBAAAgb,GAEAhb,aAAAqiB;;IAKXviB;;;;;QAKEE,UAA2B;;;;;;;QAQ3BA,UAGIsiB;;QAGJtiB,UAAmCuJ,EAAW0R,IAC9Cjb;;;;;;QAOAA;;WAUAuiB;;;;;;;;;aAAAA;YACE,OAAOviB,KAAKwiB;;;;QAIdxH;sEAAAA;YACE,OAAOhb,KAAKyiB;;;;QAIdC;mFAAAA;YACE,OAAiC,MAA1B1iB,KAAK2iB;;;;QAIdC;uFAAAA;YACE,OAAO5iB,KAAK6iB;;;;;;;;;IAOd/iB,iBAAAA,SAAkBkb;QACZA,EAAY8H,OAAwB,MACtC9iB,KAAK6iB,SACL7iB,KAAKyiB,KAAezH;;;;;;;;IAUxBlb,iBAAAA;QACE,IAAI8hB,IAAiBnC,MACjBoC,IAAoBpC,MACpBqC,IAAmBrC;QAkBvB,OAhBAzf,KAAK+iB,GAAgB5c,SAAQ,SAAC4C,GAAKia;YACjC,QAAQA;cACN;gBACEpB,IAAiBA,EAAelD,IAAI3V;gBACpC;;cACF;gBACE8Y,IAAoBA,EAAkBnD,IAAI3V;gBAC1C;;cACF;gBACE+Y,IAAmBA,EAAiBpD,IAAI3V;gBACxC;;cACF;gBACEnD;;aAIC,IAAI6b,GACTzhB,KAAKyiB,IACLziB,KAAKwiB,IACLZ,GACAC,GACAC;;;;;IAOJhiB,iBAAAA;QACEE,KAAK6iB,SACL7iB,KAAK+iB,KAAkBT;OAGzBxiB,iBAAAA,SAAkBiJ,GAAkBia;QAClChjB,KAAK6iB,SACL7iB,KAAK+iB,KAAkB/iB,KAAK+iB,GAAgBpH,GAAO5S,GAAKia;OAG1DljB,iBAAAA,SAAqBiJ;QACnB/I,KAAK6iB,SACL7iB,KAAK+iB,KAAkB/iB,KAAK+iB,GAAgBjH,OAAO/S;OAGrDjJ,iBAAAA;QACEE,KAAK2iB,MAAoB;OAG3B7iB,iBAAAA;QACEE,KAAK2iB,MAAoB;OAG3B7iB,iBAAAA;QACEE,KAAK6iB,SACL7iB,KAAKwiB;;;IA4BP1iB,WAAoBmjB;kBAAAA;;QAGpBjjB,UAAuB,IAAI8U;;QAG3B9U,UAAiCkf;;QAGjClf,UAAuCkjB;;;;;;QAOvCljB,UAA8B,IAAI2e,GAAoB1Z;;;;;WAKtDnF,iBAAAA,SAAqBqjB;QACnB,KAAuBA,WAAAA,IAAAA,EAAUpB,IAAVoB,cAAAA;YAAlB,IAAMxI;YACLwI,EAAUlB,cAAkB/P,KAC9BlS,KAAKojB,GAAoBzI,GAAUwI,EAAUlB,MACpCkB,EAAUlB,cAAkBxN,MACrCzU,KAAKqjB,GACH1I,GACAwI,EAAUpa,KACVoa,EAAUlB;;QAKhB,KAAuBkB,WAAAA,IAAAA,EAAUnB,kBAAVmB,cAAAA;YAAlB,IAAMxI;YACT3a,KAAKqjB,GAAyB1I,GAAUwI,EAAUpa,KAAKoa,EAAUlB;;;mFAKrEniB,iBAAAA,SAAmBwjB;QAAnBxjB;QACEE,KAAKujB,GAAcD,IAAc3I,SAAAA;YAC/B,IAAM6I,IAAcxjB,EAAKyjB,GAAkB9I;YAC3C,QAAQ2I,EAAanB;cACnB;gBACMniB,EAAK0jB,GAAe/I,MACtB6I,EAAYG,GAAkBL,EAAatI;gBAE7C;;cACF;;;gBAGEwI,EAAYI,MACPJ,EAAYK;;;;gBAIfL,EAAYM,MAEdN,EAAYG,GAAkBL,EAAatI;gBAC3C;;cACF;;;;;gBAKEwI,EAAYI,MACPJ,EAAYK,MACf7jB,EAAK+jB,aAAapJ;gBAMpB;;cACF;gBACM3a,EAAK0jB,GAAe/I,OACtB6I,EAAYQ,MACZR,EAAYG,GAAkBL,EAAatI;gBAE7C;;cACF;gBACMhb,EAAK0jB,GAAe/I;;;;gBAItB3a,EAAKikB,GAAYtJ,IACjB6I,EAAYG,GAAkBL,EAAatI;gBAE7C;;cACF;gBACEpV;;;;;;;;;IAUR9F,iBAAAA,SACEwjB,GACA3c;QAFF7G;QAIMwjB,EAAalB,UAAUzc,SAAS,IAClC2d,EAAalB,UAAUjc,QAAQQ,KAE/B3G,KAAKkkB,GAAa/d,SAAQ,SAACge,GAAGxJ;YACxB3a,EAAK0jB,GAAe/I,MACtBhU,EAAGgU;;;;;;;;IAWX7a,iBAAAA,SAAsBskB;QACpB,IAAMzJ,IAAWyJ,EAAYzJ,UACvB0J,IAAgBD,EAAYlC,GAAgBpZ,OAE5Cwb,IAAatkB,KAAKukB,GAA0B5J;QAClD,IAAI2J,GAAY;YACd,IAAM5J,IAAS4J,EAAW5J;YAC1B,IAAIA,EAAOzB,MACT,IAAsB,MAAlBoL,GAAqB;;;;;;;gBAOvB,IAAMtb,IAAM,IAAIT,EAAYoS,EAAOpT;gBACnCtH,KAAKqjB,GACH1I,GACA5R,GACA,IAAI0L,GAAW1L,GAAKzD,EAAgByB;mBAtWpC1D,GA0WkB,MAAlBghB,SAKgBrkB,KAAKwkB,GAAiC7J,OACtC0J;;;YAGlBrkB,KAAKikB,GAAYtJ,IACjB3a,KAAKykB,KAAsBzkB,KAAKykB,GAAoB/F,IAAI/D;;;;;;;IAUhE7a,iBAAAA,SAAkBgb;QAAlBhb,cACQuhB,IAAgB,IAAIvM;QAE1B9U,KAAKkkB,GAAa/d,SAAQ,SAACqd,GAAa7I;YACtC,IAAM2J,IAAatkB,EAAKukB,GAA0B5J;YAClD,IAAI2J,GAAY;gBACd,IAAId,EAAYvb,MAAWqc,EAAW5J,OAAOzB,MAAmB;;;;;;;;;oBAU9D,IAAMlQ,IAAM,IAAIT,EAAYgc,EAAW5J,OAAOpT;oBAEH,SAAzCtH,EAAK0kB,GAAuB5hB,IAAIiG,MAC/B/I,EAAK2kB,GAAuBhK,GAAU5R,MAEvC/I,EAAKqjB,GACH1I,GACA5R,GACA,IAAI0L,GAAW1L,GAAK+R;;gBAKtB0I,EAAYoB,OACdvD,EAAc5N,IAAIkH,GAAU6I,EAAYqB,OACxCrB,EAAYM;;;QAKlB,IAAItC,IAAyB/B;;;;;gBAO7Bzf,KAAK8kB,GAA6B3e,SAAQ,SAAC4C,GAAKgc;YAC9C,IAAIC;YAEJD,EAAQE,IAAatK,SAAAA;gBACnB,IAAM2J,IAAatkB,EAAKukB,GAA0B5J;gBAClD,QACE2J,iCACAA,EAAW1J,OAEXoK;iBAOAA,MACFxD,IAAyBA,EAAuB9C,IAAI3V;;QAIxD,IAAMmc,IAAc,IAAIvD,GACtB7G,GACAuG,GACArhB,KAAKykB,IACLzkB,KAAK0kB,IACLlD;QAOF,OAJAxhB,KAAK0kB,KAAyBxF,MAC9Blf,KAAK8kB,KAA+B5B,MACpCljB,KAAKykB,KAAsB,IAAI9F,GAAoB1Z,KAE5CigB;;;;;;;IAQTplB,iBAAAA,SAAoB6a,GAAoBwK;QACtC,IAAKnlB,KAAK0jB,GAAe/I,IAAzB;YAIA,IAAMqI,IAAahjB,KAAK2kB,GAAuBhK,GAAUwK,EAASpc;YAI9C/I,KAAKyjB,GAAkB9I,GAC/ByK,GAAkBD,EAASpc,KAAKia,IAE5ChjB,KAAK0kB,KAAyB1kB,KAAK0kB,GAAuB/I,GACxDwJ,EAASpc,KACToc,IAGFnlB,KAAK8kB,KAA+B9kB,KAAK8kB,GAA6BnJ,GACpEwJ,EAASpc,KACT/I,KAAKqlB,GAA4BF,EAASpc,KAAK2V,IAAI/D;;;;;;;;;;;IAYvD7a,iBAAAA,SACE6a,GACA5R,GACAuc;QAEA,IAAKtlB,KAAK0jB,GAAe/I,IAAzB;YAIA,IAAM6I,IAAcxjB,KAAKyjB,GAAkB9I;YACvC3a,KAAK2kB,GAAuBhK,GAAU5R,KACxCya,EAAY4B,GAAkBrc;;;YAI9Bya,EAAY+B,GAAqBxc,IAGnC/I,KAAK8kB,KAA+B9kB,KAAK8kB,GAA6BnJ,GACpE5S,GACA/I,KAAKqlB,GAA4Btc,GAAK2K,OAAOiH,KAG3C2K,MACFtlB,KAAK0kB,KAAyB1kB,KAAK0kB,GAAuB/I,GACxD5S,GACAuc;;OAKNxlB,2BAAAA,SAAa6a;QACX3a,KAAKkkB,GAAaxQ,OAAOiH;;;;;;;IAQnB7a,iBAAAA,SAAiC6a;QACvC,IACM2I,IADctjB,KAAKyjB,GAAkB9I,GACVkK;QACjC,OACE7kB,KAAKijB,GAAiBuC,GAAuB7K,GAAUpU,OACvD+c,EAAa1B,GAAerb,OAC5B+c,EAAaxB,GAAiBvb;;;;;;IAQlCzG,iBAAAA,SAA2B6a;QAEL3a,KAAKyjB,GAAkB9I,GAC/B8K;OAGN3lB,iBAAAA,SAAkB6a;QACxB,IAAI/L,IAAS5O,KAAKkkB,GAAaphB,IAAI6X;QAKnC,OAJK/L,MACHA,IAAS,IAAI8W,IACb1lB,KAAKkkB,GAAazQ,IAAIkH,GAAU/L,KAE3BA;OAGD9O,iBAAAA,SAA4BiJ;QAClC,IAAI4c,IAAgB3lB,KAAK8kB,GAA6BhiB,IAAIiG;QAU1D,OARK4c,MACHA,IAAgB,IAAIhH,GAAoB1Z,KACxCjF,KAAK8kB,KAA+B9kB,KAAK8kB,GAA6BnJ,GACpE5S,GACA4c,KAIGA;;;;;;;IAQC7lB,iBAAAA,SAAe6a;QACvB,IAAMiL,IAA4D,SAA7C5lB,KAAKukB,GAA0B5J;QAIpD,OAHKiL,KACHC,GAxXU,yBAwXQ,4BAA4BlL,IAEzCiL;;;;;;IAOC9lB,iBAAAA,SAA0B6a;QAClC,IAAM6I,IAAcxjB,KAAKkkB,GAAaphB,IAAI6X;QAC1C,OAAO6I,KAAeA,EAAYK,KAC9B,OACA7jB,KAAKijB,GAAiB6C,GAAuBnL;;;;;;;IAQ3C7a,iBAAAA,SAAY6a;QAAZ7a;QAKNE,KAAKkkB,GAAazQ,IAAIkH,GAAU,IAAI+K,KAKf1lB,KAAKijB,GAAiBuC,GAAuB7K,GACrDxU,SAAQ4C,SAAAA;YACnB/I,EAAKqjB,GAAyB1I,GAAU5R,wBAA0B;;;;;;;IAO9DjJ,iBAAAA,SACN6a,GACA5R;QAGA,OADqB/I,KAAKijB,GAAiBuC,GAAuB7K,GAC9C8D,IAAI1V;;;;;;;;;;;;;;;;;;;;;;;GAI5B,UAASma;IACP,OAAO,IAAIxH,GACTpT,EAAYvC;;;AAIhB,SAASuc;IACP,OAAO,IAAI5G,GAAmCpT,EAAYvC;;;;;;;;;;;;;;;;;;QClmBtDggB,KACgD;IACpDC,KAA4B;IAC5BC,MAA6B;GAIzBC,KAC6C;IACjDC,KAA0B;IAC1BC,MAAmC;IACnCC,KAA6B;IAC7BC,MAAsC;IACtCC,MAAsB;IACtBC,kBAA+B;IAC/BC,IAAmB;IACnBC,sBAAmC;;IA0BnC5mB,WACU0P,GACA6G;kBADA7G,GACAxP,eAAAqW;;WAGVvW,iBAAAA,SAAc6mB;QACZ,IAAMrlB,eACJqlB,EAAOrlB,OACHlB,EAAKG,UACL6a,GAAmBuL,EAAOrlB;QAChC,OAAO,IAAI8B,EAAe9B,GAAMqlB,EAAOplB,WAAW;;;;;;;;;;IAW5CzB,iBAAAA,SAAaqa;QACnB,OAAIna,KAAKqW,QAAQuQ,MAAiB3c,EAAkBkQ,KAC3CA,IAEA;YAAEvY,OAAOuY;;;;;;IAOZra,iBAAAA,SACNqa;QAEA,IAAIvL;QAMJ,OAAO3E,EAJL2E,IADiB,mBAARuL,IACAA,EAAIvY,QAEJuY,KAEwB,OAAOvL;;;;;IAM5C9O,iBAAAA,SAAU8B;QACR,OAAO;YAAEsK,cAAc,KAAKtK;;;;;;;IAO9B9B,iBAAAA,SAAS8B;QACP,IAAI5B,KAAKqW,QAAQuQ,IAAe;YAC9B,IAAIta,MAAM1K,IACR,OAAO;gBAAEwK,aAAa;;YACjB,IAAIxK,MAAUilB,IAAAA,GACnB,OAAO;gBAAEza,aAAa;;YACjB,IAAIxK,cACT,OAAO;gBAAEwK,aAAa;;;QAG1B,OAAO;YAAEA,aAAalC,EAAetI,KAAS,OAAOA;;;;;;;;IAQvD9B,iBAAAA,SAAS8B;QACP,OAAOuI,EAAcvI,KAAS5B,KAAKkR,GAAUtP,KAAS5B,KAAKmR,GAASvP;;;;;IAMtE9B,gBAAAA,SAAYuF;QACV,OAAIrF,KAAKqW,QAAQuQ,KAIG,IAAIpiB,KAAyB,MAApBa,EAAUjB,SAAgB0iB,cAEnB/e,QAAQ,SAAS,IAAIA,QAAQ,KAAK,aAEnD,cAAc1C,EAAUhB,aAAa4B,OAAO,WAItD;YACL7B,SAAS,KAAKiB,EAAUjB;YACxB8G,OAAO7F,EAAUhB;;OAMfvE,gBAAAA,SAAc4E;QACpB,IAAMW,IAAY0F,EAAmBrG;QACrC,OAAO,IAAIJ,EAAUe,EAAUjB,SAASiB,EAAU6F;;;;;;;IAQpDpL,iBAAAA,SAAQinB;QACN,OAAI/mB,KAAKqW,QAAQuQ,KACRG,EAAMtY,aAENsY,EAAMC;;;;;IAOjBlnB,iBAAAA,SAAU8B;QACR,OAAI5B,KAAKqW,QAAQuQ,MACfvjB,cACEzB,KAAwC,mBAAVA,IAGzB2H,EAAW8F,iBAAiBzN,KAAgB,QAEnDyB,cACEzB,KAAuBA,aAAiBmI;QAGnCR,EAAW+F,eAAe1N,KAAgB,IAAImI;OAIzDjK,wBAAAA,SAAU6R;QACR,OAAO3R,KAAKinB,EAAYtV,EAAQsV;OAGlCnnB,0BAAAA,SAAY6R;QAEV,OAnNatO,KAkNAsO,IACNrM,EAAgB4hB,EAAclnB,KAAKknB,EAAcvV;OAG1D7R,iBAAAA,SAAewH,GAAoBkI;QACjC,OAAOxP,KAAKmnB,GAAyB3X,KAAcxP,KAAKwP,IACrDsG,MAAM,aACNA,MAAMxO,GACND;OAGLvH,iBAAAA,SAAiB4B;QACf,IAAM0lB,IAAWlgB,EAAaqB,EAAW7G;QAKzC,OAnOa2B,GAgOXgkB,GAAoBD,KAGfA;OAGTtnB,iBAAAA,SAAOiJ;QACL,OAAO/I,KAAKsnB,GAAeve,EAAIzB;OAGjCxH,gBAAAA,SAAS4B;QACP,IAAM0lB,IAAWpnB,KAAKunB,GAAiB7lB;QAgBvC,OA3Pa2B,GA6OX+jB,EAAStkB,IAAI,OAAO9C,KAAKwP,GAAWC,YA7OzBpM,IAoPT+jB,EAAStkB,IAAI,OAAO9C,KAAKwP,GAAWE,YACpC0X,EAAStkB,IAAI,OAAO9C,KAAKwP,GAAWE;QAMjC,IAAIpH,EAAYtI,KAAKwnB,GAAiCJ;OAG/DtnB,iBAAAA,SAAYwH;QACV,OAAOtH,KAAKsnB,GAAehgB;OAG7BxH,iBAAAA,SAAc4B;QACZ,IAAM+lB,IAAeznB,KAAKunB,GAAiB7lB;;;;;gBAK3C,OAA4B,MAAxB+lB,EAAa9hB,SACRuB,EAAaqO,IAEfvV,KAAKwnB,GAAiCC;OAG/CC;aAAAA;YAOE,OANa,IAAIxgB,EAAa,EAC5B,YACAlH,KAAKwP,GAAWC,WAChB,aACAzP,KAAKwP,GAAWE,YAENrI;;;;QAGNvH,iBAAAA,SAAyB0P;QAC/B,OAAO,IAAItI,EAAa,EACtB,YACAsI,EAAWC,WACX,aACAD,EAAWE;OAIP5P,iBAAAA,SACN2nB;QAMA,OAxSapkB,GAqSXokB,EAAa9hB,SAAS,KAA6B,gBAAxB8hB,EAAa3kB,IAAI,KAGvC2kB,EAAajf,EAAS;;mFAI/B1I,iBAAAA,SAAmBiJ,GAAkB2B;QACnC,OAAO;YACLhJ,MAAM1B,KAAK2nB,GAAO5e;YAClB2B,QAAQA,EAAOkK,MAAMnK,SAASC;;OAIlC5K,iBAAAA,SAAWqlB;QAKT,OAAO;YACLzjB,MAAM1B,KAAK2nB,GAAOxC,EAASpc;YAC3B2B,QAAQya,EAASyC,KAAUnd,SAASC;YACpCmH,YAAY7R,KAAKinB,EAAY9B,EAASxT,QAAQsV;;OAIlDnnB,iBAAAA,SACEqlB,GACA5S;QAEA,IAAMxJ,IAAM/I,KAAK0O,EAASyW,EAAczjB,OAClCiQ,IAAU3R,KAAK6nB,YAAY1C,EAAStT,aACpCgB,IAAO,IAAIM,GAAY;YAAE1I,UAAU;gBAAEC,QAAQya,EAASza;;;QAC5D,OAAO,IAAIwH,GAASnJ,GAAK4I,GAASkB,GAAM;YACtCN,yBAAyBA;;OAIrBzS,iBAAAA,SAAU+T;QAChBxQ,KACIwQ,EAAIiU,QAGMjU,EAAIiU,MAAMpmB,MACVmS,EAAIiU,MAAMjW;QACxB,IAAM9I,IAAM/I,KAAK0O,EAASmF,EAAIiU,MAAMpmB,OAC9BiQ,IAAU3R,KAAK6nB,YAAYhU,EAAIiU,MAAMjW,aACrCgB,IAAO,IAAIM,GAAY;YAAE1I,UAAU;gBAAEC,QAAQmJ,EAAIiU,MAAMpd;;;QAC7D,OAAO,IAAIwH,GAASnJ,GAAK4I,GAASkB,GAAM;OAGlC/S,iBAAAA,SAAY8O;QAClBvL,KACIuL,EAAOmZ,UAGX1kB,KACIuL,EAAOoZ;QAGX,IAAMjf,IAAM/I,KAAK0O,EAASE,EAAOmZ,UAC3BpW,IAAU3R,KAAK6nB,YAAYjZ,EAAOoZ;QACxC,OAAO,IAAIvT,GAAW1L,GAAK4I;OAG7B7R,iBAAAA,SAAkB8O;QAChB,OAAI,WAAWA,IACN5O,KAAKioB,GAAUrZ,KACb,aAAaA,IACf5O,KAAKkoB,GAAYtZ,KA/XdhJ;OAoYd9F,iBAAAA,SAAgBsgB;QACd,IAAIgE;QACJ,IAAI,kBAAkBhE,GAAQ;YACdA,EAAOkD;;;YAGrB,IAAMnB,IAAQniB,KAAKmoB,GACjB/H,EAAOkD,aAAa8E,oBAAoB,cAEpChG,IAAwBhC,EAAOkD,aAAalB,aAAa,IAEzDpH,IAAchb,KAAKqoB,GAAUjI,EAAOkD,aAAatI,cACjDsN,IAAalI,EAAOkD,aAAcjB,OAClCA,IAAQiG,KAActoB,KAAKuoB,GAAcD;YAC/ClE,IAAc,IAAIoE,GAChBrG,GACAC,GACApH,GACAqH,KAAS;eAEN,IAAI,oBAAoBjC,GAAQ;YACvBA,EAAOqI;YACrB,IAAMC,IAAetI,EAAOqI;YACdC,EAAavD,UACbuD,EAAavD,SAASzjB,MAElCgnB,EAAavD,SAAStT;YAGxB,IAAM9I,IAAM/I,KAAK0O,EAASga,EAAavD,SAASzjB,OAC1CiQ,IAAU3R,KAAK6nB,YAAYa,EAAavD,SAAStT,aACjDgB,IAAO,IAAIM,GAAY;gBAC3B1I,UAAU;oBAAEC,QAAQge,EAAavD,SAASza;;gBAEtCmJ,IAAM,IAAI3B,GAASnJ,GAAK4I,GAASkB,GAAM,KACvCkP,IAAmB2G,EAAatG,aAAa,IAC7CJ,IAAmB0G,EAAa1G,oBAAoB;YAC1DoC,IAAc,IAAIuE,GAChB5G,GACAC,GACAnO,EAAI9K,KACJ8K;eAEG,IAAI,oBAAoBuM,GAAQ;YACvBA,EAAOwI;YACrB,IAAMC,IAAYzI,EAAOwI;YACXC,EAAU1D;YACxB,IAAMpc,IAAM/I,KAAK0O,EAASma,EAAU1D,WAC9BxT,IAAUkX,EAAUb,WACtBhoB,KAAK6nB,YAAYgB,EAAUb,YAC3B1iB,EAAgByB,OACd8M,IAAM,IAAIY,GAAW1L,GAAK4I,IAC1BqQ,IAAmB6G,EAAU7G,oBAAoB;YACvDoC,IAAc,IAAIuE,GAAoB,IAAI3G,GAAkBnO,EAAI9K,KAAK8K;eAChE,IAAI,oBAAoBuM,GAAQ;YACvBA,EAAO0I;YACrB,IAAMC,IAAY3I,EAAO0I;YACXC,EAAU5D;YACxB,IAAMpc,IAAM/I,KAAK0O,EAASqa,EAAU5D,WAC9BnD,IAAmB+G,EAAU/G,oBAAoB;YACvDoC,IAAc,IAAIuE,GAAoB,IAAI3G,GAAkBjZ,GAAK;eAC5D;YAAA,MAAI,YAAYqX,IAUrB,OA3cUxa;YAmcIwa,EAAO3Y;YACrB,IAAMA,IAAS2Y,EAAO3Y;YACRA,EAAOkT;YACrB,IAAM7R,IAAQrB,EAAOqB,SAAS,GACxBoZ,IAAkB,IAAI8G,GAAgBlgB,IACtC6R,IAAWlT,EAAOkT;YACxByJ,IAAc,IAAI6E,GAAsBtO,GAAUuH;;QAIpD,OAAOkC;OAGTtkB,iBAAAA,SACEqiB;QAEA,OAAc,gBAAVA,uBAEiB,UAAVA,oBAEU,aAAVA,sBAEU,cAAVA,sBAEU,YAAVA,oBA3dCvc;OAked9F,iBAAAA,SAA0BsgB;;;;QAIxB,MAAM,kBAAkBA,IACtB,OAAO9a,EAAgByB;QAEzB,IAAMuc,IAAelD,EAAoBkD;QACzC,OAAIA,EAAalB,aAAakB,EAAalB,UAAUzc,SAC5CL,EAAgByB,QAEpBuc,EAAa0E,WAGXhoB,KAAK6nB,YAAYvE,EAAa0E,YAF5B1iB,EAAgByB;OAK3BjH,iBAAAA,SAAWopB;QAAXppB,IACM8O;QACJ,IAAIsa,aAAoBtW,IACtBhE,IAAS;YACPua,QAAQnpB,KAAKopB,GAAmBF,EAASngB,KAAKmgB,EAAStnB;gBAEpD,IAAIsnB,aAAoBxU,IAC7B9F,IAAS;YAAE8E,QAAQ1T,KAAK2nB,GAAOuB,EAASngB;gBACnC,IAAImgB,aAAoBhW,IAC7BtE,IAAS;YACPua,QAAQnpB,KAAKopB,GAAmBF,EAASngB,KAAKmgB,EAASrW;YACvDwW,YAAYrpB,KAAKspB,GAAeJ,EAASpW;gBAEtC,IAAIoW,aAAoB5U,IAC7B1F,IAAS;YACP8C,WAAW;gBACTyT,UAAUnlB,KAAK2nB,GAAOuB,EAASngB;gBAC/B6K,iBAAiBsV,EAAStV,gBAAgB/L,KAAI6J,SAAAA;oBAC5C1R,OAAAA,EAAKupB,GAAiB7X;;;gBAIvB;YAAA,MAAIwX,aAAoBvU,KAK7B,OA9gBU/O;YA0gBVgJ,IAAS;gBACP4a,QAAQxpB,KAAK2nB,GAAOuB,EAASngB;;;QAUjC,OAJKmgB,EAAS/W,GAAasX,OACzB7a,EAAO8a,kBAAkB1pB,KAAK2pB,GAAeT,EAAS/W,MAGjDvD;OAGT9O,iBAAAA,SAAa8U;QAAb9U,cACQqS,IAAeyC,EAAM8U,kBACvB1pB,KAAK4pB,GAAiBhV,EAAM8U,mBAC5B3X,GAAa8X;QAEjB,IAAIjV,EAAMuU,QAAQ;YACFvU,EAAMuU,OAAOznB;YAC3B,IAAMqH,IAAM/I,KAAK0O,EAASkG,EAAMuU,OAAOznB,OACjCE,IAAQ,IAAIuR,GAAY;gBAC5B1I,UAAU;oBAAEC,QAAQkK,EAAMuU,OAAOze;;;YAEnC,IAAIkK,EAAMyU,YAAY;gBACpB,IAAMvW,IAAY9S,KAAK8pB,GAAiBlV,EAAMyU;gBAC9C,OAAO,IAAInW,GAAcnK,GAAKnH,GAAOkR,GAAWX;;YAEhD,OAAO,IAAIS,GAAY7J,GAAKnH,GAAOuQ;;QAEhC,IAAIyC,EAAMlB,QAAQ;YACvB,IAAM3K,IAAM/I,KAAK0O,EAASkG,EAAMlB;YAChC,OAAO,IAAIgB,GAAe3L,GAAKoJ;;QAC1B,IAAIyC,EAAMlD,WAAW;YAC1B,IAAM3I,IAAM/I,KAAK0O,EAASkG,EAAMlD,UAAmByT,WAC7CvR,IAAkBgB,EAAMlD,UAAUkC,gBAAiB/L,KAAI6J,SAAAA;gBAC3D1R,OAAAA,EAAK+pB,GAAmBrY;;YAM1B,OAJArO,UACE8O,EAAaL,SAGR,IAAIwC,GAAkBvL,GAAK6K;;QAC7B,IAAIgB,EAAM4U,QAAQ;YACvB,IAAMzgB,IAAM/I,KAAK0O,EAASkG,EAAM4U;YAChC,OAAO,IAAI7U,GAAe5L,GAAKoJ;;QAE/B,OA1jBUvM;OA8jBN9F,iBAAAA,SAAeqS;QAErB,kBAAIA,EAAaN,aACR;YACLA,YAAY7R,KAAKgqB,UAAU7X,EAAaN;uBAEjCM,EAAaL,SACf;YAAEA,QAAQK,EAAaL;YArkBpBlM;OA2kBN9F,iBAAAA,SAAiBqS;QACvB,kBAAIA,EAAaN,aACRE,GAAaF,WAAW7R,KAAK6nB,YAAY1V,EAAaN,0BACpDM,EAAaL,SACfC,GAAaD,OAAOK,EAAaL,UAEjCC,GAAa8X;OAIhB/pB,iBAAAA,SACN8U,GACAqV;;QAGA,IAAItY,IAAUiD,EAAM/C,aAChB7R,KAAK6nB,YAAYjT,EAAM/C,cACvB7R,KAAK6nB,YAAYoC;QAEjBtY,EAAQnM,QAAQF,EAAgByB;;;;;;QAMlC4K,IAAU3R,KAAK6nB,YAAYoC;QAG7B,IAAIrY,IAAuC;QAI3C,OAHIgD,EAAMhD,oBAAoBgD,EAAMhD,iBAAiBjM,SAAS,MAC5DiM,IAAmBgD,EAAMhD;QAEpB,IAAIsY,GAAevY,GAASC;OAGrC9R,iBAAAA,SACEqqB,GACAF;QAFFnqB;QAIE,OAAIqqB,KAAUA,EAAOxkB,SAAS,KA7lBjBtC,cA+lBT4mB,IAGKE,EAAOtiB,KAAI+M,SAAAA;YAAS5U,OAAAA,EAAKoqB,GAAgBxV,GAAOqV;eAEhD;OAIHnqB,iBAAAA,SAAiBqU;QACvB,IAAMzC,IAAYyC,EAAezC;QACjC,IAAIA,aAAqBxB,GACvB,OAAO;YACLmB,WAAW8C,EAAe1C,MAAMpK;YAChCgjB,kBAAkB;;QAEf,IAAI3Y,aAAqBjB,GAC9B,OAAO;YACLY,WAAW8C,EAAe1C,MAAMpK;YAChCijB,uBAAuB;gBACrB7d,QAAQiF,EAAUvB;;;QAGjB,IAAIuB,aAAqBf,GAC9B,OAAO;YACLU,WAAW8C,EAAe1C,MAAMpK;YAChCkjB,oBAAoB;gBAClB9d,QAAQiF,EAAUvB;;;QAGjB,IAAIuB,aAAqBN,GAC9B,OAAO;YACLC,WAAW8C,EAAe1C,MAAMpK;YAChCmjB,WAAW9Y,EAAUb;;QAGvB,MAxpBUjL;OA4pBN9F,iBAAAA,SAAmB8U;QACzB,IAAIlD,IAAuC;QAC3C,IAAI,sBAAsBkD,GACxBvR,GAC6B,mBAA3BuR,EAAMyV,mBAGR3Y,IAAYxB,EAAyBua,eAChC,IAAI,2BAA2B7V,GAAO;YAC3C,IAAMnI,IAASmI,EAAM0V,sBAAuB7d,UAAU;YACtDiF,IAAY,IAAIjB,EAA6BhE;eACxC,IAAI,wBAAwBmI,GAAO;YACxC,IAAMnI,IAASmI,EAAM2V,mBAAoB9d,UAAU;YACnDiF,IAAY,IAAIf,EAA8BlE;eACrC,eAAemI,IACxBlD,IAAY,IAAIN,EACdpR,MACA4U,EAAgB4V,aAGlB5kB;QAEF,IAAMyL,IAAY1J,EAAU+iB,EAAiB9V,EAAgBvD;QAC7D,OAAO,IAAIsZ,GAAetZ,GAAWK;OAGvC5R,iBAAAA,SAAkB4a;QAChB,OAAO;YAAEuG,WAAW,EAACjhB,KAAK4qB,GAAYlQ,EAAOpT;;OAG/CxH,iBAAAA,SAAoB+qB;QArqBLxnB,GAwqBD,MAFEwnB,EAAgB5J,UAAWtb;QAKzC,IAAMjE,IAAOmpB,EAAgB5J,UAAW;QACxC,OAAO7J,GAAM0T,GAAO9qB,KAAK+qB,GAAcrpB,IAAO0W;OAGhDtY,iBAAAA,SAAc4a;;QAEZ,IAAM9L,IAA0B;YAAEoc,iBAAiB;WAC7C1jB,IAAOoT,EAAOpT;QACW,SAA3BoT,EAAOjE,mBAKT7H,EAAOqc,SAASjrB,KAAK4qB,GAAYtjB,IACjCsH,EAAOoc,gBAAiBE,OAAO,EAC7B;YACEziB,cAAciS,EAAOjE;YACrB0U;gBAQJvc,EAAOqc,SAASjrB,KAAK4qB,GAAYtjB,EAAK8jB,MACtCxc,EAAOoc,gBAAiBE,OAAO,EAAC;YAAEziB,cAAcnB,EAAKuN;;QAGvD,IAAMwW,IAAQrrB,KAAKsrB,GAAS5Q,EAAO/D;QAC/B0U,MACFzc,EAAOoc,gBAAiBK,QAAQA;QAGlC,IAAM3U,IAAU1W,KAAKurB,GAAQ7Q,EAAOhE;QAChCA,MACF9H,EAAOoc,gBAAiBtU,UAAUA;QAGpC,IAAMxQ,IAAQlG,KAAKwrB,GAAa9Q,EAAOxU;QAYvC,OAXc,SAAVA,MACF0I,EAAOoc,gBAAiB9kB,QAAQA,IAG9BwU,EAAO9D,YACThI,EAAOoc,gBAAiBpU,UAAU5W,KAAKyrB,GAAS/Q,EAAO9D;QAErD8D,EAAO7D,UACTjI,EAAOoc,gBAAiBnU,QAAQ7W,KAAKyrB,GAAS/Q,EAAO7D,SAGhDjI;OAGT9O,iBAAAA,SAAgB4a;QACd,IAAIpT,IAAOtH,KAAK+qB,GAAcrQ,EAAcuQ,SAEtCxK,IAAQ/F,EAAOsQ,iBACfU,IAAYjL,EAAMyK,OAAOzK,EAAMyK,KAAKvlB,SAAS,GAC/C8Q,IAAiC;QACrC,IAAIiV,IAAY,GAAG;YAvuBNroB,GAyuBK,MAAdqoB;YAGF,IAAMR,IAAOzK,EAAMyK,KAAM;YACrBA,EAAKC,iBACP1U,IAAkByU,EAAKziB,eAEvBnB,IAAOA,EAAKwO,MAAMoV,EAAKziB;;QAI3B,IAAIkjB,IAAqB;QACrBlL,EAAM4K,UACRM,IAAW3rB,KAAK4rB,GAAWnL,EAAM4K;QAGnC,IAAI3U,IAAqB;QACrB+J,EAAM/J,YACRA,IAAU1W,KAAK6rB,GAAUpL,EAAM/J;QAGjC,IAAIxQ,IAAuB;QACvBua,EAAMva,UACRA,IAAQlG,KAAK8rB,GAAerL,EAAMva;QAGpC,IAAI0Q,IAAwB;QACxB6J,EAAM7J,YACRA,IAAU5W,KAAK+rB,GAAWtL,EAAM7J;QAGlC,IAAIC,IAAsB;QAK1B,OAJI4J,EAAM5J,UACRA,IAAQ7W,KAAK+rB,GAAWtL,EAAM5J,SAGzB,IAAIO,GACT9P,GACAmP,GACAC,GACAiV,GACAzlB,qBAEA0Q,GACAC,GACAuB;OAGJtY,iBAAAA,SACEwkB;QAEA,IAAM1iB,IAAQ5B,KAAKgsB,GAAQ1H,EAAW1J;QACtC,OAAa,QAAThZ,IACK,OAEA;YACLqqB,oBAAoBrqB;;OAKlB9B,iBAAAA,SAAQ8a;QACd,QAAQA;UACN;YACE,OAAO;;UACT;YACE,OAAO;;UACT;YACE,OAAO;;UACT;YACE,OAp0BQhV;;OAw0Bd9F,iBAAAA,SAASwkB;QACP,IAAI1V,GACE8L,IAAS4J,EAAW5J;QAc1B,QAXE9L,IADE8L,EAAOzB,OACA;YAAEgI,WAAWjhB,KAAKksB,GAAkBxR;YAEpC;YAAE+F,OAAOzgB,KAAKmsB,GAAczR;WAGhCC,WAAW2J,EAAW3J,UAEzB2J,EAAWtJ,YAAY8H,OAAwB,MACjDlU,EAAOoM,cAAchb,KAAKosB,GAAQ9H,EAAWtJ;QAGxCpM;OAGD9O,iBAAAA,SAAS6W;QAAT7W;QACN,IAAuB,MAAnB6W,EAAQhR,QAAZ;YAGA,IAAMwkB,IAASxT,EAAQ9O,KAAIJ,SAAAA;gBACrBA,OAAAA,aAAkBoR,KACb7Y,EAAKqsB,GAAqB5kB,KAj2BzB7B;;YAs2BZ,OAAsB,MAAlBukB,EAAOxkB,SACFwkB,EAAO,KAET;gBAAEmC,iBAAiB;oBAAEtT,IAAI;oBAAOrC,SAASwT;;;;OAG1CrqB,iBAAAA,SAAW2H;QAAX3H;QACN,OAAK2H,eAEMA,EAAO8kB,cACT,EAACvsB,KAAKwsB,GAAgB/kB,kBACpBA,EAAOglB,cACT,EAACzsB,KAAK0sB,GAAgBjlB,kBACpBA,EAAO6kB,kBACT7kB,EAAO6kB,gBACX3V,QAAS9O,KAAIkP,SAAAA;YAAK/W,OAAAA,EAAK4rB,GAAW7U;YAClC4V,QAAO,SAACC,GAAO3kB;YAAY2kB,OAAAA,EAAM3U,OAAOhQ;cAt3BjCrC,OA82BH;OAcH9F,iBAAAA,SAAQsZ;QAARtZ;QACN,IAAwB,MAApBsZ,EAASzT,QAGb,OAAOyT,EAASvR,KAAIglB,SAAAA;YAAS7sB,OAAAA,EAAK8sB,GAAgBD;;OAG5C/sB,iBAAAA,SAAUsZ;QAAVtZ;QACN,OAAOsZ,EAASvR,KAAIglB,SAAAA;YAAS7sB,OAAAA,EAAK+sB,GAAkBF;;OAG9C/sB,iBAAAA,SAASktB;QACf,OAAO;YACLzT,QAAQyT,EAAOzT;YACf9M,QAAQugB,EAAO1T;;OAIXxZ,iBAAAA,SAAWktB;QACjB,IAAMzT,MAAWyT,EAAOzT,QAClBD,IAAW0T,EAAOvgB,UAAU;QAClC,OAAO,IAAI4M,GAAMC,GAAUC;;;IAI7BzZ,iBAAAA,SAAYiY;QACV,OAAOgO,GAAWhO;;;IAIpBjY,iBAAAA,SAAciY;QACZ,QAAQA;UACN,KAAK;YACH;;UACF,KAAK;YACH;;UACF;YACE;;;;IAKNjY,iBAAAA,SAAekZ;QACb,OAAOkN,GAAUlN;OAGnBlZ,iBAAAA,SAAiBkZ;QACf,QAAQA;UACN,KAAK;YACH;;UACF,KAAK;YACH;;UACF,KAAK;YACH;;UACF,KAAK;YACH;;UACF,KAAK;YACH;;UACF,KAAK;YACH;;UACF,KAAK;YACH;;UACF,KAAK;YACH;;UACF,KAAK;UAEL;YACE,OA/7BQpT;;OAm8Bd9F,iBAAAA,SAAqBwH;QACnB,OAAO;YAAE+J,WAAW/J,EAAKD;;OAG3BvH,iBAAAA,SAAuBmtB;QACrB,OAAOtlB,EAAU+iB,EAAiBuC,EAAyB5b;;;IAI7DvR,iBAAAA,SAAgB4W;QACd,OAAO;YACLjF,OAAOzR,KAAKktB,GAAqBxW,EAAQjF;YACzC0b,WAAWntB,KAAKotB,GAAY1W,EAAQqB;;OAIxCjY,iBAAAA,SAAkB4W;QAChB,OAAO,IAAIiB,GACT3X,KAAKqtB,GAAuB3W,EAAcjF,QAC1CzR,KAAKstB,GAAc5W,EAAQyW;OAI/BrtB,iBAAAA,SAAgB2H;QACd,OAAOoR,GAAY0U,OACjBvtB,KAAKqtB,GAAuB5lB,EAAOglB,YAAmBhb,QACtDzR,KAAKwtB,GAAiB/lB,EAAOglB,YAAgBzT,KAC7CvR,EAAOglB,YAAmB7qB;;;IAK9B9B,iBAAAA,SAAqB2H;QACnB,yBAAIA,EAAOuR,IAAuB;YAChC,IAAInJ,EAAWpI,EAAO7F,QACpB,OAAO;gBACL2qB,aAAa;oBACX9a,OAAOzR,KAAKktB,GAAqBzlB,EAAOgK;oBACxCuH,IAAI;;;YAGH,IAAIpJ,EAAYnI,EAAO7F,QAC5B,OAAO;gBACL2qB,aAAa;oBACX9a,OAAOzR,KAAKktB,GAAqBzlB,EAAOgK;oBACxCuH,IAAI;;;;QAKZ,OAAO;YACLyT,aAAa;gBACXhb,OAAOzR,KAAKktB,GAAqBzlB,EAAOgK;gBACxCuH,IAAIhZ,KAAKytB,GAAehmB,EAAOuR;gBAC/BpX,OAAO6F,EAAO7F;;;OAKpB9B,iBAAAA,SAAgB2H;QACd,QAAQA,EAAO8kB,YAAgBvT;UAC7B,KAAK;YACH,IAAM0U,IAAW1tB,KAAKqtB,GACpB5lB,EAAO8kB,YAAmB9a;YAE5B,OAAOoH,GAAY0U,OAAOG,sBAA0B;gBAClDthB,aAAauhB;;;UAEjB,KAAK;YACH,IAAMC,IAAY5tB,KAAKqtB,GACrB5lB,EAAO8kB,YAAmB9a;YAE5B,OAAOoH,GAAY0U,OAAOK,sBAA2B;gBACnDC,WAAW;;;UAEf,KAAK;UAEL;YACE,OAjhCQjoB;;OAqhCd9F,iBAAAA,SAAegT;QACb,IAAMgb,IAA4B;QAIlC,OAHAhb,EAAUpI,OAAOvE,SAAQsL,SAAAA;YACvBqc,OAAAA,EAAgBznB,KAAKoL,EAAMpK;aAEtB;YACL0mB,YAAYD;;OAIhBhuB,iBAAAA,SAAiB8U;QACf,IAAMoZ,IAAQpZ,EAAMmZ,cAAc;QAClC,OAAO,IAAI7X,EAAU8X,EAAMnmB,KAAIP,SAAAA;YAAQK,OAAAA,EAAU+iB,EAAiBpjB;;;;;;;;;;aAItD+f,GAAoB/f;;IAElC,OACEA,EAAK3B,UAAU,KACC,eAAhB2B,EAAKxE,IAAI,MACO,gBAAhBwE,EAAKxE,IAAI;;;;;;;;;;;;;;;;;;;;;;;;;kBCpgCXhD,SAAmBmuB;QACbzkB,EAAgBykB,YAClBroB,MAEF4D,EAAgBykB,WAAWA;cAG7BnuB;QAIE,OAHK0J,EAAgBykB,YACnBroB,MAEK4D,EAAgBykB;;KCzDrBC,KAAY,IAAIC,SAAO;;;;;;;;;;;;;;;;;;;SAGbC;IACd,OAAOF,GAAUG;;;SAGHC,GAAYC;IAC1BL,GAAUG,WAAWE;;;SAGP1I,GAAS2I;;IACvB,IAAIN,GAAUG,YAAYI,WAASC,OAAO;QACxC,IAAMC,IAAO9lB,EAAIhB,IAAI+mB;QACrBV,GAAUW,YAAVX,uBAAgB,gBAActuB,YAAiB4uB,KAAUG;;;;SAI7CtT,GAASmT;;IACvB,IAAIN,GAAUG,YAAYI,WAASK,OAAO;QACxC,IAAMH,IAAO9lB,EAAIhB,IAAI+mB;QACrBV,GAAUa,YAAVb,uBAAgB,gBAActuB,YAAiB4uB,KAAUG;;;;;;aAOpDC,GAAY/lB;IACnB,IAAmB,mBAARA,GACT,OAAOA;IAEP,IAAMolB,IAAWzkB,GAAgBC;IACjC;QACE,OAAOwkB,EAASe,GAAWnmB;MAC3B,OAAOomB;;QAEP,OAAOpmB;;;;;;;;;;;;;;;;;;;;;;;;;;;aChCGjD,GAAKspB;qBAAAA;;;QAGnB,IAAM3tB,IACJ,gBAAc3B,sCAA6CsvB;;;;QAM7D,MALA7T,GAAS9Z,IAKH,IAAII,MAAMJ;;;;;;;;;SASF8B,GACd8rB,GACA5tB;IAEK4tB,KACHvpB;;;;;;aAyBYwpB,GACdvmB;;AAEAwmB;IAMA,OAAOxmB;;;;;;;;;;;;;;;;;;;;kBC5DP/I;QAaE;;QAXA,IAAMwvB,IACJ,kEAEIC,IAAc1qB,KAAKC,MAAM,MAAMwqB,EAAM3pB,UAAU2pB,EAAM3pB,QAMvD6pB,IAAS;;UAENA,EAAO7pB,SADO,MAGnB,KADA,IAAMohB,IAAQvd,GAAgBC,KAAcgmB,GAAY,KAC/ChpB,IAAI,GAAGA,IAAIsgB,EAAMphB,UAAUc;;;QAG9B+oB,EAAO7pB,SANM,MAMmBohB,EAAMtgB,KAAK8oB,MAC7CC,KAAUF,EAAMI,OAAO3I,EAAMtgB,KAAK6oB,EAAM3pB;QAM9C,OAAO6pB;;;;SAIKvqB,GAAuB+B,GAASC;IAC9C,OAAID,IAAOC,KACD,IAEND,IAAOC,IACF,IAEF;;;0DAQOsF,GACdvF,GACAC,GACAlB;IAEA,OAAIiB,EAAKrB,WAAWsB,EAAMtB,UAGnBqB,EAAK2oB,OAAM,SAAC/tB,GAAO4E;QAAUT,OAAAA,EAAWnE,GAAOqF,EAAMT;;;;;;;aAM9CopB,GAAmBC;;IAEjC,OAAOA,IAAI;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACtDX/vB,SACW0P,GACAsgB,GACAC,GACAC,GACAC;cAJAzgB,GACAxP,sBAAA8vB,GACA9vB,YAAA+vB,GACA/vB,WAAAgwB,GACAhwB,wBAAAiwB;;IAUXnwB,WAAqB2P,GAAmBC;QAAnB1P,iBAAAyP,GACnBzP,KAAK0P,WAAWA,KANU;;WAS5BwgB;aAAAA;YACE,OAV0B,gBAUnBlwB,KAAK0P;;;;QAGd5P,sBAAAA,SAAQkF;QACN,OACEA,aAAiBmrB,KACjBnrB,EAAMyK,cAAczP,KAAKyP,aACzBzK,EAAM0K,aAAa1P,KAAK0P;OAI5B5P,gBAAAA,SAAUkF;QACR,OACEC,GAAoBjF,KAAKyP,WAAWzK,EAAMyK,cAC1CxK,GAAoBjF,KAAK0P,UAAU1K,EAAM0K;;;IC3B7C5P,WAAoBswB;kBAAAA;;;;;;;QAJpBpwB,UAEI;;;WAKJF,kBAAAA,SAAIiJ;QACF,IAAMsnB,IAAKrwB,KAAKowB,GAASrnB,IACnB4Q,IAAU3Z,KAAKswB,GAAMD;QAC3B,eAAI1W,GAGJ,KAAgCA,WAAAA,OAAAA,cAAAA;0BAApB4W,UAAU3uB;YACpB,IAAI2uB,EAAS/qB,QAAQuD,IACnB,OAAOnH;;OAMb9B,kBAAAA,SAAIiJ;QACF,kBAAO/I,KAAK8C,IAAIiG;;8CAIlBjJ,kBAAAA,SAAIiJ,GAAcnH;QAChB,IAAMyuB,IAAKrwB,KAAKowB,GAASrnB,IACnB4Q,IAAU3Z,KAAKswB,GAAMD;QAC3B,eAAI1W,GAAJ;YAIA,KAAK,IAAIlT,IAAI,GAAGA,IAAIkT,EAAQhU,QAAQc,KAClC,IAAIkT,EAAQlT,GAAG,GAAGjB,QAAQuD,IAExB,aADA4Q,EAAQlT,KAAK,EAACsC,GAAKnH;YAIvB+X,EAAQtT,KAAK,EAAC0C,GAAKnH;eATjB5B,KAAKswB,GAAMD,KAAM,EAAC,EAACtnB,GAAKnH;;;;;IAe5B9B,qBAAAA,SAAOiJ;QACL,IAAMsnB,IAAKrwB,KAAKowB,GAASrnB,IACnB4Q,IAAU3Z,KAAKswB,GAAMD;QAC3B,eAAI1W,GACF;QAEF,KAAK,IAAIlT,IAAI,GAAGA,IAAIkT,EAAQhU,QAAQc,KAClC,IAAIkT,EAAQlT,GAAG,GAAGjB,QAAQuD,IAMxB,OALuB,MAAnB4Q,EAAQhU,gBACH3F,KAAKswB,GAAMD,KAElB1W,EAAQ6W,OAAO/pB,GAAG;;QAKxB;OAGF3G,sBAAAA,SAAQ6G;QACNR,EAAQnG,KAAKswB,KAAO,SAACnM,GAAG/O;YACtB,KAAqBA,WAAAA,OAAAA,cAAAA;8BAATkH,UAAGtP;gBACbrG,EAAG2V,GAAGtP;;;OAKZlN,gBAAAA;QACE,OAAOsJ,EAAQpJ,KAAKswB;;;;;;;;;;;;;;ICzDtBxwB,WACS2wB,GACA3lB,GACA4lB,GACAC;QAHA3wB,eAAAywB,aACA3lB,GACA9K,qBAAA0wB,GACA1wB,iBAAA2wB;;;;;;;;;;;WAcT7wB,iBAAAA,SACE8wB,GACA3e,GACA4e;QAkBA,KARA,IAAMC,IAAkBD,EAAYC,IAQ3BrqB,IAAI,GAAGA,IAAIzG,KAAK2wB,UAAUhrB,QAAQc,KAAK;YAC9C,IAAMyiB,IAAWlpB,KAAK2wB,UAAUlqB;YAChC,IAAIyiB,EAASngB,IAAIvD,QAAQorB,IAAS;gBAChC,IAAMve,IAAiBye,EAAgBrqB;gBACvCwL,IAAWiX,EAAS3U,GAAsBtC,GAAUI;;;QAGxD,OAAOJ;;;;;;;;;IAUTnS,iBAAAA,SACE8wB,GACA3e;;;QAYA,KAAuBjS,WAAAA,IAAAA,KAAK0wB,eAAL1wB,cAAAA;YAAlB,IAAMkpB;YACLA,EAASngB,IAAIvD,QAAQorB,OACvB3e,IAAWiX,EAAS1U,GAClBvC,GACAA,GACAjS,KAAK8K;;;QAQX,KAHA,IAAM0H,IAAUP,UAGOjS,IAAAA,KAAK2wB,WAAL3wB,cAAAA;YAAlB,IAAMkpB;YACLA,EAASngB,IAAIvD,QAAQorB,OACvB3e,IAAWiX,EAAS1U,GAClBvC,GACAO,GACAxS,KAAK8K;;QAIX,OAAOmH;;;;;;IAOTnS,iBAAAA,SAAwBixB;QAAxBjxB,cAIMkxB,IAAmBD;;;;gBAUvB,OATA/wB,KAAK2wB,UAAUxqB,SAAQ8qB,SAAAA;YACrB,IAAMC,IAAkBlxB,EAAKwU,GAC3Byc,EAAEloB,KACFgoB,EAAUjuB,IAAImuB,EAAEloB;YAEdmoB,MACFF,IAAmBA,EAAiBrV,GAAOsV,EAAEloB,KAAKmoB;aAG/CF;OAGTlxB,mBAAAA;QACE,OAAOE,KAAK2wB,UAAUhE,QACpB,SAACze,GAAM+iB;YAAM/iB,OAAAA,EAAKwQ,IAAIuS,EAAEloB;YACxB0W;OAIJ3f,sBAAAA,SAAQkF;QACN,OACEhF,KAAKywB,YAAYzrB,EAAMyrB,WACvBlkB,GAAYvM,KAAK2wB,WAAW3rB,EAAM2rB,YAAW,SAACpf,GAAGC;YAAMD,OAAAA,EAAE/L,QAAQgM;eACjEjF,GAAYvM,KAAK0wB,eAAe1rB,EAAM0rB,gBAAe,SAACnf,GAAGC;YACvDD,OAAAA,EAAE/L,QAAQgM;;;;IAQhB1R,WACWqxB,GACAC,GACAN,GACAO;;;;;IAKAC;QARAtxB,aAAAmxB,aACAC,aACAN,GACA9wB,mBAAAqxB,aAKAC;;;;;;;oBAQXxxB,SACEqxB,GACAC,GACAG,GACAF;QAnKiChuB,GAsK/B8tB,EAAMR,UAAUhrB,WAAW4rB,EAAQ5rB;QASrC,KAFA,IAAI6rB,IAAajS,MACXoR,IAAYQ,EAAMR,WACflqB,IAAI,GAAGA,IAAIkqB,EAAUhrB,QAAQc,KACpC+qB,IAAaA,EAAW7V,GAAOgV,EAAUlqB,GAAGsC,KAAKwoB,EAAQ9qB,GAAGkL;QAG9D,OAAO,IAAI8f,EACTN,GACAC,GACAG,GACAF,GACAG;;;IC7KJ1xB,WAAY4xB;QAAZ5xB;;;gBAZAE,UAAqD,MACrDA,UAAkD;;QAG1CA,sBACAA,qBACRA;;;QAIAA,cAGE0xB,GACE9vB,SAAAA;YACE5B,EAAK2xB,SACL3xB,EAAK4O,SAAShN,GACV5B,EAAK4xB;;;YAGP5xB,EAAK4xB;aAGT7C,SAAAA;YACE/uB,EAAK2xB,SACL3xB,EAAK+uB,QAAQA,GACT/uB,EAAK6xB,MACP7xB,EAAK6xB,GAAc9C;;;WAM3BjvB,oBAAAA,SACE6G;QAEA,OAAO3G,KAAKqI,aAAgB1B;OAG9B7G,mBAAAA,SACEgyB,GACAC;QAFFjyB;QAQE,OAJIE,KAAKgyB,MACPpsB,MAEF5F,KAAKgyB,SACDhyB,KAAK2xB,KACF3xB,KAAK+uB,QAGD/uB,KAAKiyB,GAAYF,GAAS/xB,KAAK+uB,SAF/B/uB,KAAKkyB,GAAYJ,GAAQ9xB,KAAY4O,UAKvC,IAAIujB,GAAsB,SAAClwB,GAASmwB;YACzCpyB,EAAK4xB,KAAgBhwB,SAAAA;gBACnB5B,EAAKkyB,GAAYJ,GAAQlwB,GAAOyG,KAAKpG,GAASmwB;eAEhDpyB,EAAK6xB,KAAiB9C,SAAAA;gBACpB/uB,EAAKiyB,GAAYF,GAAShD,GAAO1mB,KAAKpG,GAASmwB;;;OAMvDtyB,iBAAAA;QAAAA;QACE,OAAO,IAAIkC,SAAQ,SAACC,GAASmwB;YAC3BpyB,EAAKqI,KAAKpG,GAASmwB;;OAIftyB,iBAAAA,SACN6G;QAEA;YACE,IAAMiI,IAASjI;YACf,OAAIiI,aAAkBujB,IACbvjB,IAEAujB,EAAmBlwB,QAAQ2M;UAEpC,OAAOqgB;YACP,OAAOkD,EAAmBC,OAAUnD;;OAIhCnvB,iBAAAA,SACNgyB,GACAlwB;QAEA,OAAIkwB,IACK9xB,KAAKqyB,IAAiB;YAAMP,OAAAA,EAAOlwB;cAGnCuwB,EAAmBlwB,QAAYL;OAIlC9B,iBAAAA,SACNiyB,GACAhD;QAEA,OAAIgD,IACK/xB,KAAKqyB,IAAiB;YAAMN,OAAAA,EAAQhD;cAEpCoD,EAAmBC,OAAUrD;mBAMxCjvB,SAAkB8O;QAChB,OAAO,IAAIujB,GAA6B,SAAClwB,GAASmwB;YAChDnwB,EAAQ2M;;kBAIZ9O,SAAiBivB;QACf,OAAO,IAAIoD,GAAsB,SAAClwB,GAASmwB;YACzCA,EAAOrD;;cAIXjvB;;;IAGEwyB;QAEA,OAAO,IAAIH,GAAyB,SAAClwB,GAASmwB;YAC5C,IAAI/N,IAAgB,GAChBkO,IAAgB,GAChBC;YAEJF,EAAInsB,SAAQqK,SAAAA;kBACR6T,GACF7T,EAAQnI,MACN;sBACIkqB,GACEC,KAAQD,MAAkBlO,KAC5BpiB;qBAGJwwB,SAAAA;oBAAOL,OAAAA,EAAOK;;iBAIlBD,QACID,MAAkBlO,KACpBpiB;;;;;;;;;WAWNnC,SACE4yB;QAKA,KAHA,IAAItY,IAAiC+X,EAAmBlwB,0BAG7C0wB;YACTvY,IAAIA,EAAE/R,MAAKuqB,SAAAA;gBACLA,OAAAA,IACKT,EAAmBlwB,QAAiB2wB,KAEpCD;;kBALWD,OAAAA,cAAAA;;;QASxB,OAAOtY;mBAkBTta,SACE+yB,GACA9b;QAFFjX,cAIQgzB,IAA4C;QAIlD,OAHAD,EAAW1sB,SAAQ,SAACqL,GAAGqe;YACrBiD,EAASzsB,KAAK0Q,EAAE5N,KAAKnJ,GAAMwR,GAAGqe;aAEzB7vB,KAAK+yB,GAAQD;;;IC3MxBhzB;;;QAGEE,UAGI,IAAIgzB,IAAUjqB,SAAAA;YAAOA,OAAAA,EAAItH;aAK7BzB;;WAgBAgoB;aAWAA;YAKE,OAAOhoB,KAAKizB;;aAhBdjL,SAAuBpmB;YAQrB5B,KAAKizB,KAAYrxB;;;;;;;;;;;IAiBnB9B,iBAAAA,SAASozB,GAA8BlL;QACrChoB,KAAKmzB,MACLnzB,KAAKgoB,WAAWA,GAChBhoB,KAAKwgB,GAAQ/M,IAAIyf,EAAcnqB,KAAKmqB;;;;;;;;IAStCpzB,iBAAAA,SAAYiJ,GAAkBif;QAC5BhoB,KAAKmzB,MACDnL,MACFhoB,KAAKgoB,WAAWA,IAElBhoB,KAAKwgB,GAAQ/M,IAAI1K,GAAK;;;;;;;;;;;;;IAcxBjJ,iBAAAA,SACEszB,GACAC;QAEArzB,KAAKmzB;QACL,IAAMG,IAAgBtzB,KAAKwgB,GAAQ1d,IAAIuwB;QACvC,kBAAIC,IACKnB,GAAmBlwB,QAA8BqxB,KAEjDtzB,KAAKuzB,GAAaH,GAAaC;;;;;;;;;;;;;IAe1CvzB,yBAAAA,SACEszB,GACAI;QAEA,OAAOxzB,KAAKyzB,GAAgBL,GAAaI;;;;;;IAO3C1zB,oBAAAA,SAAMszB;QAGJ,OAFApzB,KAAKmzB,MACLnzB,KAAK0zB,SACE1zB,KAAK2zB,GAAaP;;sDAIjBtzB,iBAAAA;;KC1IC8zB,KACX;IAWF9zB;QACEE,UAA2D;;WAI3DF,iBAAAA,SAAuB+zB;QACrB7zB,KAAK8zB,GAAqBztB,KAAKwtB;OAGjC/zB,iBAAAA;QACEE,KAAK8zB,GAAqB3tB,SAAQ0tB,SAAAA;YAAYA,OAAAA;;;;ICDhD/zB,WACWi0B,GACAC,GACAC;kBAFAF,aACAC,aACAC;;;;;;;;WASXn0B,iBAAAA,SACEszB,GACArqB;QAFFjJ;QAIE,OAAOE,KAAKg0B,GACTE,GAA0Cd,GAAarqB,GACvDV,MAAK8rB,SAAAA;YAAWn0B,OAAAA,EAAKo0B,GAAoBhB,GAAarqB,GAAKorB;;;0EAIxDr0B,iBAAAA,SACNszB,GACArqB,GACAsrB;QAEA,OAAOr0B,KAAK+zB,GAAoBO,GAASlB,GAAarqB,GAAKV,MAAKwL,SAAAA;YAC9D,KAAoBwgB,WAAAA,OAAAA,cAAAA;gBAClBxgB,SAAYW,GAAiBzL,GAAK8K;;YAEpC,OAAOA;;;;;IAMH/T,iBAAAA,SACNszB,GACA1S,GACAyT;QAEA,IAAI5C,IAAUpS;QAOd,OANAuB,EAAKva,SAAQ,SAAC4C,GAAKwrB;YACjB,KAAoBJ,WAAAA,OAAAA,cAAAA;gBAClBI,SAAkB/f,GAAiBzL,GAAKwrB;;YAE1ChD,IAAUA,EAAQ5V,GAAO5S,GAAKwrB;aAEzBhD;;;;;;;;IASTzxB,iBAAAA,SACEszB,GACAllB;QAFFpO;QAIE,OAAOE,KAAK+zB,GACTS,WAAWpB,GAAallB,GACxB7F,MAAKqY,SAAAA;YAAQ1gB,OAAAA,EAAKy0B,GAAwBrB,GAAa1S;;;;;;;IAO5D5gB,iBAAAA,SACEszB,GACAsB;QAFF50B;QAIE,OAAOE,KAAKg0B,GACTW,GAA2CvB,GAAasB,GACxDrsB,MAAK8rB,SAAAA;YACJ,IAAMzT,IAAO1gB,EAAK40B,GAChBxB,GACAsB,GACAP,IAEE5C,IAAUrS;YASd,OARAwB,EAAKva,SAAQ,SAAC4C,GAAKkJ;;gBAEZA,MACHA,IAAW,IAAIwC,GAAW1L,GAAKzD,EAAgByB,SAEjDwqB,IAAUA,EAAQ5V,GAAO5S,GAAKkJ;iBAGzBsf;;;;;;;;;;;IAYbzxB,iBAAAA,SACEszB,GACA3S,GACAoU;QAEA,OAAIpU,EAAMxH,OACDjZ,KAAK80B,GAAkC1B,GAAa3S,EAAMnZ,QACxDmZ,EAAMsU,OACR/0B,KAAKg1B,GACV5B,GACA3S,GACAoU,KAGK70B,KAAKi1B,GACV7B,GACA3S,GACAoU;OAKE/0B,iBAAAA,SACNszB,GACA5Z;;QAGA,OAAOxZ,KAAKk1B,GAAY9B,GAAa,IAAI9qB,EAAYkR,IAAUnR,MAC7D4J,SAAAA;YACE,IAAIrD,IAASyQ;YAIb,OAHIpN,aAAoBC,OACtBtD,IAASA,EAAO+M,GAAO1J,EAASlJ,KAAKkJ,KAEhCrD;;OAKL9O,iBAAAA,SACNszB,GACA3S,GACAoU;QAHM/0B,cASA2I,IAAegY,EAAMhK,iBACvB8a,IAAUlS;QACd,OAAOrf,KAAKi0B,GACTkB,GAAqB/B,GAAa3qB,GAClCJ,MAAK+sB,SAAAA;YAGGjD,OAAAA,GAAmBhsB,QAAQivB,IAAUnK,SAAAA;gBAC1C,IAAMoK,IAAkB5U,EAAM6U,GAC5BrK,EAAOnV,MAAMrN;gBAEf,OAAOzI,EAAKi1B,GACV7B,GACAiC,GACAR,GACAxsB,MAAKmJ,SAAAA;oBACLA,EAAErL,SAAQ,SAAC4C,GAAK8K;wBACd0d,IAAUA,EAAQ5V,GAAO5S,GAAK8K;;;gBAGjCxL,MAAK;gBAAMkpB,OAAAA;;;OAIZzxB,iBAAAA,SACNszB,GACA3S,GACAoU;QAHM/0B,IAMFyxB,GACAgE;;gBACJ,OAAOv1B,KAAK+zB,GACTyB,GAA0BpC,GAAa3S,GAAOoU,GAC9CxsB,MAAKotB,SAAAA;mBACJlE,IAAUkE,GACHz1B,EAAKg0B,GAAc0B,GACxBtC,GACA3S;YAGHpY,MAAKstB,SAAAA;mBACJJ,IAAkBI,GAOX31B,EAAK41B,GACVxC,GACAmC,GACAhE,GACAlpB,MAAKwtB,SAAAA;gBACLtE,IAAUsE;gBAEV,KAAoBN,WAAAA,OAAAA,cAAAA,KAClB,KADG,IAAMpE,iBACcA,IAAAA,EAAMR,WAANQ,cAAAA,KAAiB;oBAAnC,IAAMjI,UACHngB,IAAMmgB,EAASngB,KACfyJ,IAAU+e,EAAQzuB,IAAIiG,IACtB+sB,IAAa5M,EAAS1U,GAC1BhC,GACAA,GACA2e,EAAMrmB;oBAGNymB,IADEuE,aAAsB5jB,KACdqf,EAAQ5V,GAAO5S,GAAK+sB,KAEpBvE,EAAQzV,OAAO/S;;;YAMlCV,MAAK;;;mBAGJkpB,EAAQprB,SAAQ,SAAC4C,GAAK8K;gBACf4M,EAAM9G,QAAQ9F,OACjB0d,IAAUA,EAAQzV,OAAO/S;iBAItBwoB;;OAILzxB,iBAAAA,SACNszB,GACAuC,GACAI;QAGA,KADA,IAAIC,IAAmCvW,aACnBkW,OAAAA,cAAAA,KAClB,KADG,WACoBxE,SAAMR,WAANQ,cAAAA;YAAlB,IAAMjI;YAEPA,aAAoBhW,MACoB,SAAxC6iB,EAAkBjzB,IAAIomB,EAASngB,SAE/BitB,IAAmCA,EAAiCtX,IAClEwK,EAASngB;;QAMjB,IAAI8sB,IAAkBE;QACtB,OAAO/1B,KAAK+zB,GACTS,WAAWpB,GAAa4C,GACxB3tB,MAAK4tB,SAAAA;mBACJA,EAAgB9vB,SAAQ,SAAC4C,GAAK8K;gBAChB,SAARA,KAAgBA,aAAe3B,OACjC2jB,IAAkBA,EAAgBla,GAAO5S,GAAK8K;iBAG3CgiB;;;;IChSb/1B,WACW6a,GACAmG,GACAoV,GACAC;QAHAn2B,gBAAA2a,GACA3a,iBAAA8gB,aACAoV,aACAC;;kBAGXr2B,SACE6a,GACAyb;QAKA,KAHA,IAAIF,IAAYzW,MACZ0W,IAAc1W,aAEM2W,IAAAA,EAAaxV,YAAbwV,cAAAA;YAAnB,IAAMjT;YACT,QAAQA,EAAU5C;cAChB;gBACE2V,IAAYA,EAAUxX,IAAIyE,EAAUtP,IAAI9K;gBACxC;;cACF;gBACEotB,IAAcA,EAAYzX,IAAIyE,EAAUtP,IAAI9K;;;;QAOlD,OAAO,IAAIstB,EACT1b,GACAyb,EAAatV,WACboV,GACAC;;;ICZJr2B,WACUiQ,GACRumB;QAFFx2B;QACUE,qBAAA+P,GAGJumB,MACFA,EAAqBC,KAAwB1b,SAAAA;YAC3C7a,OAAAA,EAAKw2B,GAAiB3b;WACxB7a,KAAKy2B,KAAyB5b,SAAAA;YAC5Byb,OAAAA,EAAqBI,GAAoB7b;;;WAIvC/a,iBAAAA,SACN62B;QAGA,OADA32B,KAAK+P,gBAAgBlL,KAAK+xB,IAAID,GAAuB32B,KAAK+P,gBACnD/P,KAAK+P;OAGdjQ,mBAAAA;QACE,IAAM+2B,MAAc72B,KAAK+P;QAIzB,OAHI/P,KAAKy2B,MACPz2B,KAAKy2B,GAAuBI,IAEvBA;;;;;wEA9BTC,UAAiD;;;;;;;;;;;;;;;;;;SCTjDh3B;IAAAA;IACEE,KAAK+2B,UAAU,IAAI/0B,SAAQ,SAACC,GAAsBmwB;QAChDpyB,EAAKiC,UAAUA,GACfjC,EAAKoyB,SAASA;;;ICclBtyB;;;;IAImBk3B;;;;IAIAC;;;;;;IAMAC;;;;UAKAC;;;;;UAMAC;yBAXAF,2BAKAC,2BAMAC;kBArBAJ,aAIAC,aAMAC,aAKAC,aAMAC,GA9BnBp3B,UAAgC,GAChCA,UAAsD;;QAEtDA,UAA0BwE,KAAKC,OA6B7BzE,KAAKq3B;;;;;;;;kBAUPv3B,oBAAAA;QACEE,KAAKs3B,KAAgB;;;;;;IAOvBx3B,iBAAAA;QACEE,KAAKs3B,KAAgBt3B,KAAKo3B;;;;;;;IAQ5Bt3B,iBAAAA,SAAckZ;QAAdlZ;;gBAEEE,KAAKu3B;;;QAIL,IAAMC,IAA2B3yB,KAAKC,MACpC9E,KAAKs3B,KAAgBt3B,KAAKy3B,OAItBC,IAAe7yB,KAAK+xB,IAAI,GAAGpyB,KAAKC,QAAQzE,KAAK23B,KAG7CC,IAAmB/yB,KAAK+xB,IAC5B,GACAY,IAA2BE;;gBAGzBE,IAAmB,KACrB/R,GAtGU,sBAwGR,qBAAmB+R,0BACD53B,KAAKs3B,kCACCE,4BACLE;QAIvB13B,KAAK63B,KAAe73B,KAAKg3B,GAAMc,GAC7B93B,KAAKi3B,IACLW,IACA;mBACE53B,EAAK23B,KAAkBnzB,KAAKC,OACrBuU;;;;QAMXhZ,KAAKs3B,MAAiBt3B,KAAKm3B,IACvBn3B,KAAKs3B,KAAgBt3B,KAAKk3B,OAC5Bl3B,KAAKs3B,KAAgBt3B,KAAKk3B,KAExBl3B,KAAKs3B,KAAgBt3B,KAAKo3B,OAC5Bp3B,KAAKs3B,KAAgBt3B,KAAKo3B;OAI9Bt3B,iBAAAA;QAC4B,SAAtBE,KAAK63B,OACP73B,KAAK63B,GAAaE,MAClB/3B,KAAK63B,KAAe;OAIxB/3B,qBAAAA;QAC4B,SAAtBE,KAAK63B,OACP73B,KAAK63B,GAAaN,UAClBv3B,KAAK63B,KAAe;;mFAKhB/3B,iBAAAA;QACN,QAAQ+E,KAAKmzB,WAAW,MAAOh4B,KAAKs3B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;SC7FxBW,GAAmB3wB;IAEjC,KADA,IAAIsH,IAAS,IACJnI,IAAI,GAAGA,IAAIa,EAAK3B,QAAQc,KAC3BmI,EAAOjJ,SAAS,MAClBiJ,IAASspB,GAAgBtpB,KAE3BA,IAASupB,GAAc7wB,EAAKxE,IAAI2D,IAAImI;IAEtC,OAAOspB,GAAgBtpB;;;kFAIhBupB,GAAc/xB,GAAiBgyB;IAGtC,KAFA,IAAIxpB,IAASwpB,GACPzyB,IAASS,EAAQT,QACdc,IAAI,GAAGA,IAAId,GAAQc,KAAK;QAC/B,IAAM2B,IAAIhC,EAAQspB,OAAOjpB;QACzB,QAAQ2B;UACN,KAAK;YACHwG,KAAUypB;YACV;;UACF,KA7Ba;YA8BXzpB,KAAUypB;YACV;;UACF;YACEzpB,KAAUxG;;;IAGhB,OAAOwG;;;+DAIAspB,GAAgBtpB;IACvB,OAAOA,IAzCU;;;;;;;;aAkDH0pB,GAAmBhxB;;;IAGjC,IAAM3B,IAAS2B,EAAK3B;IAEpB,IArFoCtC,GAoFzBsC,KAAU,IACN,MAAXA,GAKF,OAJAtC,GAxDe,QAyDbiE,EAAKooB,OAAO,MAxDW,QAwDUpoB,EAAKooB,OAAO;IAGxCxoB,EAAaqO;;;QAUtB,KALA,IAAMgjB,IAA4B5yB,IAAS,GAErCF,IAAqB,IACvB+yB,IAAiB,IAEZla,IAAQ,GAAGA,IAAQ3Y,KAAU;;;QAGpC,IAAMiB,IAAMU,EAAKC,QAzEF,KAyEsB+W;QAMrC,SALI1X,IAAM,KAAKA,IAAM2xB,MACnB3yB,MAGW0B,EAAKooB,OAAO9oB,IAAM;UAE7B,KA/EuB;YAgFrB,IAAM6xB,IAAenxB,EAAKoxB,UAAUpa,GAAO1X,IACvCR;YAC0B,MAA1BoyB,EAAe7yB;;;YAGjBS,IAAUqyB,KAGVryB,IADAoyB,KAAkBC,GAElBD,IAAiB,KAEnB/yB,EAASY,KAAKD;YACd;;UACF,KA5Fa;YA6FXoyB,KAAkBlxB,EAAKoxB,UAAUpa,GAAO1X,IACxC4xB,KAAkB;YAClB;;UACF,KA/FgB;;YAiGdA,KAAkBlxB,EAAKoxB,UAAUpa,GAAO1X,IAAM;YAC9C;;UACF;YACEhB;;QAGJ0Y,IAAQ1X,IAAM;;IAGhB,OAAO,IAAIM,EAAazB;;;;;;;;;;;;;;;;;;;;;;ICpJ1B3F;QACEE,UAAgC,IAAI24B;;WAEpC74B,iBAAAA,SACEszB,GACAwF;QAGA,OADA54B,KAAK64B,GAAsBna,IAAIka,IACxBzG,GAAmBlwB;OAG5BnC,iBAAAA,SACEszB,GACA3qB;QAEA,OAAO0pB,GAAmBlwB,QACxBjC,KAAK64B,GAAsBrE,WAAW/rB;;;IAU5C3I;QACUE,aAAQ;;;eAKhBF,kBAAAA,SAAI84B;QAEF,IAAMnwB,IAAemwB,EAAe/jB,KAC9BikB,IAAaF,EAAexN,KAC5B2N,IACJ/4B,KAAKwG,MAAMiC,MACX,IAAIkW,GAAwBzX,EAAanB,IACrCizB,KAASD,EAAgBta,IAAIqa;QAEnC,OADA94B,KAAKwG,MAAMiC,KAAgBswB,EAAgBra,IAAIoa,IACxCE;OAGTl5B,kBAAAA,SAAI84B;QACF,IAAMnwB,IAAemwB,EAAe/jB,KAC9BikB,IAAaF,EAAexN,KAC5B2N,IAAkB/4B,KAAKwG,MAAMiC;QACnC,OAAOswB,KAAmBA,EAAgBta,IAAIqa;OAGhDh5B,yBAAAA,SAAW2I;QAIT,QAFEzI,KAAKwG,MAAMiC,MACX,IAAIkW,GAAwBzX,EAAanB,IACxBoB;;;IC/CvBrH;;;;;;;;QAQEE,UAAiC,IAAI24B;;;;;;;;kBASrC74B,iBAAAA,SACEszB,GACAwF;QAFF94B;QAKE,KAAKE,KAAKi5B,GAAuBxa,IAAIma,IAAiB;YACpD,IAAMnwB,IAAemwB,EAAe/jB,KAC9BikB,IAAaF,EAAexN;YAElCgI,EAAY8F,IAAuB;;;gBAGjCl5B,EAAKi5B,GAAuBva,IAAIka;;YAGlC,IAAMO,IAAuC;gBAC3C1wB,cAAAA;gBACAwiB,QAAQgN,GAAmBa;;YAE7B,OAAOM,GAAuBhG,GAAaiG,IAAIF;;QAEjD,OAAOhH,GAAmBlwB;OAG5BnC,iBAAAA,SACEszB,GACA3qB;QAEA,IAAM6wB,IAAc,IACdrb,IAAQsb,YAAYphB,MACxB,EAAC1P,GAAc,MACf,EAACmnB,GAAmBnnB,IAAe;;;QAIrC,OAAO2wB,GAAuBhG,GAC3BoG,GAAQvb,GACR5V,MAAK+M,SAAAA;YACJ,KAAoBA,WAAAA,OAAAA,cAAAA,KAAS;gBAAxB,IAAMqkB;;;;;gCAKT,IAAIA,EAAMhxB,iBAAiBA,GACzB;gBAEF6wB,EAAYjzB,KAAKiyB,GAAmBmB,EAAMxO;;YAE5C,OAAOqO;;;;;;;;;;;;;;SASNF,GACPM;IAEA,OAAOC,GAAqBC,GAG1BF,GAAKG,GAAmBC;;;;;;;;;;;;;;;;;;;;;;;ICxD1Bh6B,WACW8Q,GACQqjB;QADRj0B,kBAAA4Q,aACQqjB;;;;;;;;WASXn0B,iBAAAA,SACNszB,GACArqB,GACA8K;QAGA,OADsBkmB,GAAqB3G,GACtBiG,IAAIW,GAAMjxB,IAAM8K;;;;;;;;IAS/B/T,iBAAAA,SACNszB,GACAC;QAEA,IAAMyG,IAAQC,GAAqB3G,IAC7BrqB,IAAMixB,GAAM3G;QAClB,OAAOyG,EAAMpmB,OAAO3K;;;;;;;;IASdjJ,6BAAAA,SACNszB,GACA6G;QAFMn6B;QAIN,OAAOE,KAAKk6B,YAAY9G,GAAa/qB,MAAK8xB,SAAAA;mBACxCA,EAASC,YAAYH,GACdj6B,EAAKq6B,GAAYjH,GAAa+G;;OAIzCr6B,iBAAAA,SACEszB,GACAC;QAFFvzB;QAIE,OAAOi6B,GAAqB3G,GACzBtwB,IAAIk3B,GAAM3G,IACVhrB,MAAKiyB,SAAAA;YACGt6B,OAAAA,EAAKu6B,GAAoBD;;;;;;;;;IAUtCx6B,iBAAAA,SACEszB,GACAC;QAFFvzB;QAIE,OAAOi6B,GAAqB3G,GACzBtwB,IAAIk3B,GAAM3G,IACVhrB,MAAKiyB,SAAAA;YACJ,IAAMzmB,IAAM7T,EAAKu6B,GAAoBD;YACrC,OAAOzmB,IACH;gBACE2mB,IAAe3mB;gBACftN,MAAMk0B;gBAER;;OAIV36B,yBAAAA,SACEszB,GACAI;QAFF1zB,cAIMyxB,IAAUpS;QACd,OAAOnf,KAAK06B,GACVtH,GACAI,IACA,SAACzqB,GAAKuxB;YACJ,IAAMzmB,IAAM7T,EAAKu6B,GAAoBD;YACrC/I,IAAUA,EAAQ5V,GAAO5S,GAAK8K;YAEhCxL,MAAK;YAAMkpB,OAAAA;;;;;;;;;;;IAWfzxB,iBAAAA,SACEszB,GACAI;QAFF1zB,cAIMyxB,IAAUpS,MACVwb,IAAU,IAAIjf,GAA+BpT,EAAYvC;QAC7D,OAAO/F,KAAK06B,GACVtH,GACAI,IACA,SAACzqB,GAAKuxB;YACJ,IAAMzmB,IAAM7T,EAAKu6B,GAAoBD;YACjCzmB,KACF0d,IAAUA,EAAQ5V,GAAO5S,GAAK8K,IAC9B8mB,IAAUA,EAAQhf,GAAO5S,GAAK0xB,WAE9BlJ,IAAUA,EAAQ5V,GAAO5S,GAAK,OAC9B4xB,IAAUA,EAAQhf,GAAO5S,GAAK;YAGlCV,MAAK;;gBACIuyB,IAAgBrJ;gBAASsJ,IAAAF;;;OAI9B76B,iBAAAA,SACNszB,GACAI,GACA9B;QAEA,IAAI8B,EAAapqB,KACf,OAAO+oB,GAAmBlwB;QAG5B,IAAMgc,IAAQsb,YAAYphB,MACxBqb,EAAa3kB,QAASvH,KAAKH,KAC3BqsB,EAAasH,OAAQxzB,KAAKH,MAEtB4zB,IAAUvH,EAAajV,MACzByc,IAA8BD,EAAQ1c;QAE1C,OAAO0b,GAAqB3G,GACzB6H,GAAQ;YAAEhd,OAAAA;YAAS,SAACid,GAAiBZ,GAAaa;;YAIjD,KAHA,IAAMC,IAAe9yB,EAAY+yB,GAAaH,IAGvCF,KAAW1yB,EAAYvC,KAAqBq1B,KAAgB,KACjE1J,KAAmB,OACnBsJ,IAAUD,EAAQ1c;YAGhB2c,KAAWA,EAASx1B,QAAQ41B;;YAE9B1J,KAAmB4I,IACnBU,IAAUD,EAAQ3c,OAAY2c,EAAQ1c,OAAY;;YAIhD2c,IACFG,EAAQG,GAAKN,EAAS1zB,KAAKH,OAE3Bg0B,EAAQ3I;YAGXnqB,MAAK;;;YAGJ,MAAO2yB,KACLtJ,KAAmB,OACnBsJ,IAAUD,EAAQ3c,OAAY2c,EAAQ1c,OAAY;;OAK1Dve,iBAAAA,SACEszB,GACA3S,GACAoU;QAHF/0B,cASMyxB,IAAUlS,MAERkc,IAA8B9a,EAAMnZ,KAAK3B,SAAS,GAElD61B,IAAmC;QACzC,IAAI3G,EAAcrvB,QAAQF,EAAgByB,QAAQ;;;YAGhD,IAAM2V,IAAW+D,EAAMnZ,KAAKH;YAC5Bq0B,EAAiBvd,QAAQsb,YAAYkC,WAAW/e;eAC3C;;;;YAIL,IAAMgf,IAAgBjb,EAAMnZ,KAAKH,KAC3Bw0B,IAAc37B,KAAK4Q,WAAWgrB,GAAiB/G;YACrD2G,EAAiBvd,QAAQsb,YAAYkC,WACnC,EAACC,GAAeC;6BAGlBH,EAAiBh1B,QAAQq1B,GAAiBC;;QAG5C,OAAO/B,GAAqB3G,GACzB6H,GAAQO,IAAkB,SAACzyB,GAAKuxB,GAAaa;;;;;;YAM5C,IAAIpyB,EAAIpD,WAAW41B,GAAnB;gBAIA,IAAMtpB,IAAWjS,EAAK4Q,WAAWmrB,GAAqBzB;gBACjD7Z,EAAMnZ,KAAKgK,EAAWW,EAASlJ,IAAIzB,QAE7B2K,aAAoBC,MAAYuO,EAAM9G,QAAQ1H,OACvDsf,IAAUA,EAAQ5V,GAAO1J,EAASlJ,KAAKkJ,MAFvCkpB,EAAQ3I;;YAKXnqB,MAAK;YAAMkpB,OAAAA;;;;;;;;IAQhBzxB,iBAAAA,SACEszB,GACAyB;QAFF/0B,cAOMk8B,IAAc9c,MAEd+c,IAAej8B,KAAK4Q,WAAWgrB,GAAiB/G,IAE9CqH,IAAiBnC,GAAqB3G,IACtCnV,IAAQsb,YAAYkC,WAAWQ;QACrC,OAAOC,EACJjB,GACC;YAAEz0B,OAAOq1B,GAAiBM;YAAele,OAAAA;YACzC,SAACkG,GAAGmW;;;YAGF,IAAMzmB,IAAM7T,EAAK4Q,WAAWmrB,GAAqBzB;YACjD0B,IAAcA,EAAYrgB,GAAO9H,EAAI9K,KAAK8K,IAC1CooB,IAAe3B,EAAqBtS;YAGvC3f,MAAK;;gBAEF+zB,IAAAJ;gBACAhU,UAAUhoB,EAAK4Q,WAAWyrB,GAAmBJ;;;;;;;;;IAUrDn8B,iBAAAA,SACEszB;QADFtzB,cAGQo8B,IAAiBnC,GAAqB3G,IAGxCpL,IAAW1iB,EAAgByB;QAE/B,OAAOm1B,EACJjB,GACC;YAAEz0B,OAAOq1B,GAAiBM;YAAeG;YACzC,SAACvzB,GAAKuxB,GAAaa;YACbb,EAAYtS,aACdA,IAAWhoB,EAAK4Q,WAAWyrB,GAAmB/B,EAAYtS,YAE5DmT,EAAQ3I;YAGXnqB,MAAK;YAAM2f,OAAAA;;OAGhBloB,iBAAAA,SAAgBuW;QAGd,OAAO,IAAIkmB,EAA6BC,GACtCx8B,QACEqW,KAAWA,EAAQomB;OAIzB38B,iBAAAA,SAAQ45B;QACN,OAAO15B,KAAKk6B,YAAYR,GAAKrxB,MAAK8xB,SAAAA;YAAYA,OAAAA,EAASC;;OAGjDt6B,0BAAAA,SACN45B;QAEA,OAAOgD,GAAoBhD,GACxB52B,IAAI65B,GAAuB5zB,KAC3BV,MAAK8xB,SAAAA;mBAvUgB92B,KAwUP82B,IACNA;;OAILr6B,iBAAAA,SACN45B,GACAS;QAEA,OAAOuC,GAAoBhD,GAAKL,IAAIsD,GAAuB5zB,KAAKoxB;;;;;;IAO1Dr6B,iBAAAA,SACNw6B;QAEA,IAAIA,GAAa;YACf,IAAMzmB,IAAM7T,KAAK4Q,WAAWmrB,GAAqBzB;YACjD,OACEzmB,aAAeY,MACfZ,EAAIlC,QAAQnM,QAAQF,EAAgByB,SAI7B,OAGF8M;;QAET,OAAO;;;;;;;;;;aAqIF6oB,GACPhD;IAEA,OAAOC,GAAqBC,GAG1BF,GAAKiD,GAAuB7C;;;;;aAMvBC,GACPL;IAEA,OAAOC,GAAqBC,GAC1BF,GACAmC,GAAiB/B;;;AAIrB,SAASE,GAAMpJ;IACb,OAAOA,EAAOtpB,KAAKH;;;;;aAMLszB,GAAe5mB;IAC7B,IAAIjS;IACJ,IAAIiS,EAAIsR,UACNvjB,IAAQiS,EAAIsR,eACP,IAAItR,EAAI+oB,iBACbh7B,IAAQiS,EAAI+oB,sBACP;QAAA,KAAI/oB,EAAIgpB,YAGb,MApiBgEj3B;QAkiBhEhE,IAAQiS,EAAIgpB;;IAId,OAAOC,KAAKC,UAAUn7B,GAAO+D;;;;;;;;;;;;;;;;;;;;;;;;;IAtJ3B7F,WACmBk9B,GACAP;QAFnB38B;gBAIE0B,IAAAA,2BAHiBw7B,UACAP;;QAZnBz8B,OAGI,IAAIgzB,IAAUjqB,SAAAA;YAAOA,OAAAA,EAAItH;;;WAL2B+6B,mBAmB9C18B,iBAAAA,SACRszB;QADQtzB,cAGFgzB,IAA4C,IAE9CmH,IAAY,GAEZgD,IAAoB,IAAIte,IAAwB,SAACpN,GAAGC;YACtDvM,OAAAA,GAAoBsM,EAAElK,KAAmBmK,EAAEnK;;QAsD7C,OAnDArH,KAAKwgB,GAAQra,SAAQ,SAAC4C,GAAKmqB;YACzB,IAAMgK,IAAel9B,EAAKm9B,GAAcr6B,IAAIiG;YAK5C,IAAImqB,GAAe;gBAKjB,IAAMrf,IAAM7T,EAAKg9B,GAAcpsB,WAAWwsB,GACxClK,GACAlzB,EAAKgoB;gBAEPiV,IAAoBA,EAAkBve,IAAI3V,EAAIzB,KAAK8jB;gBAEnD,IAAM7kB,IAAOk0B,GAAe5mB;gBAC5BomB,KAAa1zB,OACbusB,EAASzsB,KAAKrG,EAAKg9B,GAAcK,GAASjK,GAAarqB,GAAK8K;mBAG5D,IADAomB,QACIj6B,EAAKy8B,IAAe;;;;;gBAKtB,IAAMa,IAAat9B,EAAKg9B,GAAcpsB,WAAWwsB,GAC/C,IAAI3oB,GAAW1L,GAAKzD,EAAgByB,QACpC/G,EAAKgoB;gBAEP8K,EAASzsB,KACPrG,EAAKg9B,GAAcK,GAASjK,GAAarqB,GAAKu0B;mBAGhDxK,EAASzsB,KAAKrG,EAAKg9B,GAAcO,GAAYnK,GAAarqB;aAKhEk0B,EAAkB92B,SAAQ8kB,SAAAA;YACxB6H,EAASzsB,KACPrG,EAAKg9B,GAAc/I,GAAauJ,GAC9BpK,GACAnI;aAKN6H,EAASzsB,KAAKrG,KAAKg9B,GAAcS,eAAerK,GAAa6G,KAEtD9H,GAAmBY,GAAQD;OAG1BhzB,iBAAAA,SACRszB,GACAC;QAFQvzB;;gBAKR,OAAOE,KAAKg9B,GACTU,GAActK,GAAaC,GAC3BhrB,MAAKs1B,SAAAA;YACc,OAAA,SAAdA,KACF39B,EAAKm9B,GAAc1pB,IAAI4f,GAAa,IAC7B,SAEPrzB,EAAKm9B,GAAc1pB,IAAI4f,GAAasK,EAAUp3B,OACvCo3B,EAAUzK;;OAKfpzB,iBAAAA,SACRszB,GACAI;QAFQ1zB;;;gBAMR,OAAOE,KAAKg9B,GACTY,GAAgBxK,GAAaI,GAC7BnrB,MAAK;gBAAGuyB;;;;wBAICz0B,SAAQ,SAACktB,GAAa9sB;gBAC5BvG,EAAKm9B,GAAc1pB,IAAI4f,GAAa9sB;iBAE/Bs3B;;;EArH2CrB;;;;;;;;;;;;;;;;;IC5X1D18B,WAAoBg+B;kBAAAA;;WAEpBh+B,mBAAAA;QAEE,OADAE,KAAK89B,MApBM,GAqBJ99B,KAAK89B;cAGdh+B;;;;;QAKE,OAAO,IAAIi+B,EAAkB;cAG/Bj+B;;QAEE,OAAO,IAAIi+B,GAAkB;;;ICH/Bj+B,WACmBk+B,GACTptB;kBADSotB,GACTh+B,kBAAA4Q;;;;;;;;eAUV9Q,iBAAAA,SACEszB;QADFtzB;QAGE,OAAOE,KAAKi+B,GAAiB7K,GAAa/qB,MAAK8xB,SAAAA;YAC7C,IAAM+D,IAAoB,IAAIH,GAAkB5D,EAASgE;YAEzD,OADAhE,EAASgE,kBAAkBD,EAAkB71B,QACtCrI,EAAKo+B,GAAahL,GAAa+G,GAAU9xB,MAC9C;gBAAM8xB,OAAAA,EAASgE;;;OAKrBr+B,iBAAAA,SACEszB;QAEA,OAAOpzB,KAAKi+B,GAAiB7K,GAAa/qB,MAAK8xB,SAAAA;YACtC70B,OAAAA,EAAgB4hB,EACrB,IAAI5iB,EACF61B,EAASkE,0BAA0Bj6B,SACnC+1B,EAASkE,0BAA0Bh6B;;OAM3CvE,iBAAAA,SACEszB;QAEA,OAAOpzB,KAAKi+B,GAAiB7K,GAAa/qB,MACxCi2B,SAAAA;YAAgBA,OAAAA,EAAaC;;OAIjCz+B,iBAAAA,SACEszB,GACAmL,GACAF;QAHFv+B;QAKE,OAAOE,KAAKi+B,GAAiB7K,GAAa/qB,MAAK8xB,SAAAA;mBAC7CA,EAASoE,8BAA8BA,GACnCF,MACFlE,EAASkE,4BAA4BA,EAA0BpX;YAE7DsX,IAA8BpE,EAASoE,gCACzCpE,EAASoE,8BAA8BA,IAElCv+B,EAAKo+B,GAAahL,GAAa+G;;OAI1Cr6B,iBAAAA,SACEszB,GACA9O;QAFFxkB;QAIE,OAAOE,KAAKw+B,GAAepL,GAAa9O,GAAYjc,MAAK;YAChDrI,OAAAA,EAAKi+B,GAAiB7K,GAAa/qB,MAAK8xB,SAAAA;uBAC7CA,EAASsE,eAAe,GACxBz+B,EAAK0+B,GAA6Bpa,GAAY6V,IACvCn6B,EAAKo+B,GAAahL,GAAa+G;;;OAK5Cr6B,iBAAAA,SACEszB,GACA9O;QAEA,OAAOtkB,KAAKw+B,GAAepL,GAAa9O;OAG1CxkB,iBAAAA,SACEszB,GACA9O;QAFFxkB;QAIE,OAAOE,KAAK2+B,GAA8BvL,GAAa9O,EAAW3J,UAC/DtS,MAAK;YAAMu2B,OAAAA,GAAaxL,GAAa1f,OAAO4Q,EAAW3J;YACvDtS,MAAK;YAAMrI,OAAAA,EAAKi+B,GAAiB7K;YACjC/qB,MAAK8xB,SAAAA;mBACJ92B,GACE82B,EAASsE,cAAc,IAGzBtE,EAASsE,eAAe,GACjBz+B,EAAKo+B,GAAahL,GAAa+G;;;;;;;;IAS5Cr6B,iBAAAA,SACE45B,GACAmF,GACAC;QAHFh/B,cAKMgJ,IAAQ,GACNgqB,IAA4C;QAClD,OAAO8L,GAAalF,GACjBuB,IAAQ,SAAClyB,GAAKnH;YACb,IAAM0iB,IAAatkB,EAAK4Q,WAAWmuB,GAAan9B;YAE9C0iB,EAAWzJ,kBAAkBgkB,KACgB,SAA7CC,EAAgBh8B,IAAIwhB,EAAW3J,cAE/B7R,KACAgqB,EAASzsB,KAAKrG,EAAKg/B,GAAiBtF,GAAKpV;YAG5Cjc,MAAK;YAAM8pB,OAAAA,GAAmBY,GAAQD;YACtCzqB,MAAK;YAAMS,OAAAA;;;;;;IAMhBhJ,iBAAAA,SACE45B,GACA3iB;QAFFjX;QAIE,OAAO8+B,GAAalF,GAAKuB,IAAQ,SAAClyB,GAAKnH;YACrC,IAAM0iB,IAAatkB,EAAK4Q,WAAWmuB,GAAan9B;YAChDmV,EAAEuN;;OAIExkB,iBAAAA,SACNszB;QAEA,OAAO6L,GAAkB7L,GACtBtwB,IAAIo8B,GAAen2B,KACnBV,MAAK8xB,SAAAA;mBAtJwB92B,GAuJJ,SAAb82B,IACJA;;OAILr6B,iBAAAA,SACNszB,GACA+G;QAEA,OAAO8E,GAAkB7L,GAAaiG,IAAI6F,GAAen2B,KAAKoxB;OAGxDr6B,iBAAAA,SACNszB,GACA9O;QAEA,OAAOsa,GAAaxL,GAAaiG,IAC/Br5B,KAAK4Q,WAAWuuB,GAAW7a;;;;;;;IASvBxkB,iBAAAA,SACNwkB,GACA6V;QAEA,IAAIiF;QAUJ,OATI9a,EAAW3J,WAAWwf,EAASgE,oBACjChE,EAASgE,kBAAkB7Z,EAAW3J,UACtCykB;QAGE9a,EAAWzJ,iBAAiBsf,EAASoE,gCACvCpE,EAASoE,8BAA8Bja,EAAWzJ;QAClDukB,SAEKA;OAGTt/B,iBAAAA,SACEszB;QAEA,OAAOpzB,KAAKi+B,GAAiB7K,GAAa/qB,MACxC8xB,SAAAA;YAAYA,OAAAA,EAASsE;;OAIzB3+B,iBAAAA,SACEszB,GACA1Y;QAFF5a,cAOQwO,IAAcoM,EAAOpM,eACrB2P,IAAQsb,YAAYphB,MACxB,EAAC7J,GAAalE,OAAOi1B,qBACrB,EAAC/wB,GAAalE,OAAOk1B,sBAEnB1wB,IAA4B;;;;gBAChC,OAAOgwB,GAAaxL,GACjB6H,GACC;YAAEhd,OAAAA;YAAOzX,OAAO+4B,GAASC;YACzB,SAACz2B,GAAKnH,GAAOu5B;YACX,IAAMrT,IAAQ9nB,EAAK4Q,WAAWmuB,GAAan9B;;;wBAGvC8Y,EAAOlV,QAAQsiB,EAAMpN,YACvB9L,IAASkZ,GACTqT,EAAQ3I;YAIbnqB,MAAK;YAAMuG,OAAAA;;OAGhB9O,iBAAAA,SACE45B,GACAxrB,GACAyM;QAHF7a,cAOQgzB,IAA4C,IAC5CgH,IAAQ2F,GAAoB/F;;;gBAMlC,OALAxrB,EAAK/H,SAAQ4C,SAAAA;YACX,IAAMzB,IAAO2wB,GAAmBlvB,EAAIzB;YACpCwrB,EAASzsB,KAAKyzB,EAAMT,IAAI,IAAIqG,GAAiB/kB,GAAUrT,MACvDwrB,EAASzsB,KAAKrG,EAAKg+B,GAAkB2B,GAAajG,GAAK/e,GAAU5R;aAE5DopB,GAAmBY,GAAQD;OAGpChzB,iBAAAA,SACE45B,GACAxrB,GACAyM;QAHF7a,cAOQg6B,IAAQ2F,GAAoB/F;;;gBAClC,OAAOvH,GAAmBhsB,QAAQ+H,IAAOnF,SAAAA;YACvC,IAAMzB,IAAO2wB,GAAmBlvB,EAAIzB;YACpC,OAAO6qB,GAAmBY,GAAQ,EAChC+G,EAAMpmB,OAAO,EAACiH,GAAUrT,MACxBtH,EAAKg+B,GAAkB4B,GAAgBlG,GAAK/e,GAAU5R;;OAK5DjJ,iBAAAA,SACE45B,GACA/e;QAEA,IAAMmf,IAAQ2F,GAAoB/F,IAC5Bzb,IAAQsb,YAAYphB,MACxB,EAACwC,KACD,EAACA,IAAW;;;QAId,OAAOmf,EAAMpmB,OAAOuK;OAGtBne,iBAAAA,SACE45B,GACA/e;QAEA,IAAMsD,IAAQsb,YAAYphB,MACxB,EAACwC,KACD,EAACA,IAAW;;4BAIRmf,IAAQ2F,GAAoB/F,IAC9B9qB,IAAS6Q;QAEb,OAAOqa,EACJmB,GAAQ;YAAEhd,OAAAA;YAAO4hB;YAAkB,SAAC92B,GAAKob,GAAGgX;YAC3C,IAAM7zB,IAAOgxB,GAAmBvvB,EAAI,KAC9B6nB,IAAS,IAAItoB,EAAYhB;YAC/BsH,IAASA,EAAO8P,IAAIkS;YAErBvoB,MAAK;YAAMuG,OAAAA;;OAGhB9O,iBAAAA,SACE45B,GACA3wB;QAEA,IAAMzB,IAAO2wB,GAAmBlvB,EAAIzB,OAC9B2W,IAAQsb,YAAYphB,MACxB,EAAC7Q,KACD,EAACsoB,GAAmBtoB;;4BAIlBwB,IAAQ;QACZ,OAAO22B,MACJxE,GACC;YACEz0B,OAAOk5B,GAAiBI;YACxBD;YACA5hB,OAAAA;YAEF,YAAmBkG,GAAGgX;gBAApBxgB;;;;;YAIiB,MAAbA,MACF7R,KACAqyB,EAAQ3I;YAIbnqB,MAAK;YAAMS,OAAAA,IAAQ;;;;;;;;;;;IAWxBhJ,iBAAAA,SACEszB,GACAzY;QAFF7a;QAIE,OAAO8+B,GAAaxL,GACjBtwB,IAAI6X,GACJtS,MAAKyf,SAAAA;YACAA,OAAAA,IACK9nB,EAAK4Q,WAAWmuB,GAAajX,KAE7B;;;;;;;;;;;;;;;;;;;;;;;;SASR8W,GACPlF;IAEA,OAAOC,GAAqBC,GAC1BF,GACA6F,GAASzF;;;;;aAOJmF,GACPvF;IAEA,OAAOC,GAAqBC,GAC1BF,GACAwF,GAAepF;;;;;aAOH2F,GACd/F;IAEA,OAAOC,GAAqBC,GAC1BF,GACAgG,GAAiB5F;;;;;;;;;;;;;;;;;;;;ICpYnBh6B,WAAoBigC;kBAAAA;;mFAGpBjgC,iBAAAA,SAAqBkgC;QACnB,IAAIA,EAAU7a,UACZ,OAAOnlB,KAAK+/B,GAAiBE,GAC3BD,EAAU7a,YACR6a,EAAUztB;QAET,IAAIytB,EAAUnD,YAAY;YAC/B,IAAM9zB,IAAMT,EAAY+yB,GAAa2E,EAAUnD,WAAWv1B,OACpDqK,IAAU3R,KAAKkgC,GAAgBF,EAAUnD,WAAW7U;YAC1D,OAAO,IAAIvT,GAAW1L,GAAK4I,GAAS;gBAClCY,yBAAyBytB,EAAUztB;;;QAEhC,IAAIytB,EAAUpD,iBAAiB;YACpC,IAAM7zB,IAAMT,EAAY+yB,GAAa2E,EAAUpD,gBAAgBt1B,OACzDqK,IAAU3R,KAAKkgC,GAAgBF,EAAUpD,gBAAgBjrB;YAC/D,OAAO,IAAIoB,GAAgBhK,GAAK4I;;QAEhC,OAvCe/L;;mDA4CnB9F,iBAAAA,SACEmS,GACA+V;QAEA,IAAMmY,IAAangC,KAAK47B,GAAiB5T,IACnC8Q,IAAa7mB,EAASlJ,IAAIzB,KAAK8jB,IAAUjkB;QAC/C,IAAI8K,aAAoBC,IAAU;YAChC,IAAM2B,IAAM7T,KAAK+/B,GAAiBK,GAAWnuB,IACvCM,IAAwBN,EAASM;YACvC,OAAO,IAAIspB;mCACc;8BACL,MAClBhoB,GACAtB,GACA4tB,GACArH;;QAEG,IAAI7mB,aAAoBwC,IAAY;YACzC,IAAMnN,IAAO2K,EAASlJ,IAAIzB,KAAKH,KACzB6gB,IAAWhoB,KAAKqgC,GAAcpuB,EAASN,UACvCY,IAAwBN,EAASM;YACvC,OAAO,IAAIspB;mCACc,MACvB,IAAIyE,GAAah5B,GAAM0gB;4BACP,MAChBzV,GACA4tB,GACArH;;QAEG,IAAI7mB,aAAoBc,IAAiB;YAC9C,IAAMzL,IAAO2K,EAASlJ,IAAIzB,KAAKH,KACzB6gB,IAAWhoB,KAAKqgC,GAAcpuB,EAASN;YAC7C,OAAO,IAAIkqB,GACT,IAAI0E,GAAkBj5B,GAAM0gB;8BACV;4BACF;6CAEhBmY,GACArH;;QAGF,OArFelzB;OAyFnB9F,iBAAAA,SAAiBgb;QACf,IAAMzV,IAAYyV,EAAgBmM;QAClC,OAAO,EAAC5hB,EAAUjB,SAASiB,EAAUhB;OAGvCvE,iBAAAA,SAAmB0gC;QACjB,IAAMn7B,IAAY,IAAIf,EAAUk8B,EAAe,IAAIA,EAAe;QAClE,OAAOl7B,EAAgB4hB,EAAc7hB;OAG/BvF,iBAAAA,SAAcgb;QACpB,IAAMzV,IAAYyV,EAAgBmM;QAClC,OAAO,IAAIwZ,GAAYp7B,EAAUjB,SAASiB,EAAUhB;OAG9CvE,iBAAAA,SAAgB4gC;QACtB,IAAMr7B,IAAY,IAAIf,EACpBo8B,EAAYt8B,SACZs8B,EAAYr8B;QAEd,OAAOiB,EAAgB4hB,EAAc7hB;;kFAIvCvF,iBAAAA,SAAkB6gC,GAAgBxP;QAAlCrxB,cACQ8gC,IAA0BzP,EAAMT,cAAc7oB,KAAIopB,SAAAA;YACtDjxB,OAAAA,EAAK+/B,GAAiBc,GAAW5P;aAE7B6P,IAAsB3P,EAAMR,UAAU9oB,KAAIopB,SAAAA;YAC9CjxB,OAAAA,EAAK+/B,GAAiBc,GAAW5P;;QAEnC,OAAO,IAAI8P,GACTJ,GACAxP,EAAMV,SACNU,EAAMrmB,GAAe/F,YACrB67B,GACAE;;0DAKJhhC,iBAAAA,SAAoBkhC;QAApBlhC,cACQ4wB,KAAiBsQ,EAAQtQ,iBAAiB,IAAI7oB,KAAIopB,SAAAA;YACtDjxB,OAAAA,EAAK+/B,GAAiBkB,GAAahQ;aAE/BN,IAAYqQ,EAAQrQ,UAAU9oB,KAAIopB,SAAAA;YACtCjxB,OAAAA,EAAK+/B,GAAiBkB,GAAahQ;aAE/B5rB,IAAYf,EAAUC,WAAWy8B,EAAQE;QAC/C,OAAO,IAAIC,GACTH,EAAQvQ,SACRprB,GACAqrB,GACAC;;8CAKJ7wB,iBAAAA,SAAashC;QACX,IAMI1mB,GANE/I,IAAU3R,KAAKkgC,GAAgBkB,EAASpZ,WACxCjN,eACJqmB,EAASrmB,+BACL/a,KAAKkgC,GAAgBkB,EAASrmB,gCAC9BzV,EAAgByB;QAQtB,OAJE2T,eADkB0mB,EAAS3gB,MAyDSQ,YAxD3BjhB,KAAK+/B,GAAiBsB,GAAoBD,EAAS3gB,SAEnDzgB,KAAK+/B,GAAiBuB,GAAgBF,EAAS3gB;QAEnD,IAAIvF,GACTR,GACA0mB,EAASzmB,2BAETymB,EAASG,0BACT5vB,GACAoJ,GACAxR,EAAW8F,iBAAiB+xB,EAASpmB;;mEAKzClb,iBAAAA,SAAWwkB;QAQT,IAIIkd,GAJEd,IAAc1gC,KAAKqgC,GAAc/b,EAAWxJ,KAC5C2mB,IAA2BzhC,KAAKqgC,GACpC/b,EAAWvJ;QAIXymB,IADEld,EAAW5J,OAAOzB,OACPjZ,KAAK+/B,GAAiB7T,GAAkB5H,EAAW5J,UAEnD1a,KAAK+/B,GAAiB5T,GAAc7H,EAAW5J;;;QAK9D,IAAMM,IAAcsJ,EAAWtJ,YAAYvM;;gBAG3C,OAAO,IAAI8wB,GACTjb,EAAW3J,UACX2J,EAAW5J,OAAOpM,eAClBoyB,GACA1lB,GACAsJ,EAAWzJ,gBACX4mB,GACAD;;KC/HAE,KACJ;IAaA5hC,WACW6hC,GACAC;QAFX9hC;gBAIE0B,IAAAA,2BAHSmgC,UACAC;;WAH6BC;EAAAA;IAkHxC/hC,WACmBgiC,GACAhS,GACAiS,GACjB9T,GACA+T,GACiBhL,GACjBpmB,GACiB0lB;QAEjB,IATiBt2B,+BAAA8hC,GACA9hC,sBAAA8vB,GACA9vB,gBAAA+hC;kBAGA/K,aAEAV,GAvCnBt2B,UAAgD,MAEhDA,cACQA,qBACAA;;QAIRA,UAAmD,MAC3CA;;QAKRA,UAAkE;;QAGlEA,UAAiE;;QAGjEA,UAAoCoK,OAAOi1B;;QAG3Cr/B,UAAqDmkB,SAAAA;YAAKniB,OAAAA,QAAQC;YAkB3D03B,EAAqBsI,MACxB,MAAM,IAAI7+B,EACRhD,EAAKc,eAtIX;QAwJE,IAbAlB,KAAKg+B,KAAoB,IAAIkE,GAAqBliC,MAAMgiC,IACxDhiC,KAAKmiC,KAASrS,IAAiB6J,EAAqByI,IACpDpiC,KAAK4Q,aAAa,IAAIyxB,GAAgBzxB;QACtC5Q,KAAKmlB,WAAW8I,EAAS9I,UACzBnlB,KAAKsiC,KAAc,IAAIC,GACrBviC,KAAKg+B,IACLh+B,KAAK4Q,aAEP5Q,KAAKi0B,KAAe,IAAIuO;QACxBxiC,KAAK+zB,KAAsB,IAAIwI,GAC7Bv8B,KAAK4Q,YACL5Q,KAAKi0B,MAEHhG,EAASwU,WAAUxU,EAASwU,OAAOC,cAIrC,MAAM,IAAIt/B,EACRhD,EAAKc,eACL;QALFlB,KAAKyiC,SAASxU,EAASwU,QACvBziC,KAAK2iC,KAAa3iC,KAAKyiC,OAAOC;;kBA1FlC5iC,SACE45B,GACAI;QAEA,IAAIJ,aAAekJ,IACjB,OAAOC,GAASjJ,GAAqBF,EAAIiI,IAAqB7H;QAE9D,MA7JwCl0B;;;;;;;IA8P5C9F,oBAAAA;QAAAA;QAIE,OAAO+iC,GAASC,GACd9iC,KAAKmiC,IACLY,IACA,IAAIC,GAAgBhjC,KAAK4Q,aAExB7N,MAAKkgC,SAAAA;mBACJjjC,EAAKkjC,KAAWD,GAGTjjC,EAAKmjC;YAEbpgC,MAAK;YACJ,KAAK/C,EAAKojC,cAAcpjC,EAAK8hC;;;YAG3B,MAAM,IAAI1+B,EACRhD,EAAKW,qBACL2gC;YAQJ,OALA1hC,EAAKqjC,MACLrjC,EAAKsjC,MAELtjC,EAAKujC,MAEEvjC,EAAKwjC,eACV,kCACA,aACA9J,SAAAA;gBAAO15B,OAAAA,EAAKsiC,GAAYmB,GAAyB/J;;YAGpD32B,MAAKw7B,SAAAA;YACJv+B,EAAK0jC,KAAiB,IAAI5M,GACxByH,GACAv+B,EAAKs2B;YAGRvzB,MAAK;YACJ/C,EAAK2jC;YAENC,OAAMC,SAAAA;mBACL7jC,EAAKkjC,MAAYljC,EAAKkjC,GAASY,SACxB9hC,QAAQowB,OAAOyR;;;;;;;;;;IAW5B/jC,iBAAAA,SACEikC;QADFjkC;QAQE,OALAE,KAAK+jC,KAAuBC,SAAMC;;;oBAChC,OAAIjkC,KAAKkkC,sBACAH,EAAqBE;;;WAGzBF,EAAqB/jC,KAAKojC;;;;;;;;IASnCtjC,iBAAAA,SACEqkC;QADFrkC;QAGEE,KAAKkjC,GAASkB,IAAyBJ,SAAMK;;;;;+BAElB,SAArBA,EAAMC,6BACFH;;;;;;;;;;;;;;;;;;IAWZrkC,iBAAAA,SAAkBykC;QAAlBzkC;QACME,KAAKukC,mBAAmBA,MAC1BvkC,KAAKukC,iBAAiBA;;;QAGtBvkC,KAAKg3B,GAAMwN,IAAiBR;;;;;+BACtBhkC,KAAKkkC,qBACDlkC,KAAKmjC;;;;;;;;;;;;;;;;;;IAYXrjC,iBAAAA;QAAAA;QACN,OAAOE,KAAKwjC,eACV,2CACA,cACA9J,SAAAA;YACwB+K,OAAAA,GAAoB/K,GAEvCL,IACC,IAAIqL,GACF1kC,EAAK+hC,UACLv9B,KAAKC,OACLzE,EAAKukC,gBACLvkC,EAAK2kC,eAGRt8B,MAAK;gBACJ,IAAIrI,EAAKojC,WACP,OAAOpjC,EAAK4kC,GAAmBlL,GAAKrxB,MAAKw8B,SAAAA;oBAClCA,MACH7kC,EAAKojC,gBACLpjC,EAAKg3B,GAAMwN,IAAiB;wBAC1BxkC,OAAAA,EAAK+jC;;;gBAMd17B,MAAK;gBAAMrI,OAAAA,EAAK8kC,GAAgBpL;gBAChCrxB,MAAKy8B,SAAAA;gBACA9kC,OAAAA,EAAKojC,cAAc0B,IACd9kC,EAAK+kC,GAA0BrL,GAAKrxB,MAAK;;wBACvCy8B,KACF9kC,EAAKglC,GAA4BtL,GAAKrxB,MAAK;;;;YAOzDu7B,OAAM3U,SAAAA;YACL,KAAKjvB,EAAK8hC,yBAAyB;gBACjC,IAAImD,GAA4BhW;;;gBAI9B,OAHApJ,GA9VI,wBA8Vc,kCAAkCoJ,IAG7CjvB,EAAKojC;gBAEZ,MAAMnU;;YASV,OALApJ,GAvWQ,wBAyWN,0DACAoJ;;YAIHlsB,MAAKqgC,SAAAA;YACApjC,EAAKojC,cAAcA,KACrBpjC,EAAKg3B,GAAMwN,IAAiB;gBAC1BxkC,OAAAA,EAAK+jC,GAAqBX;iBAG9BpjC,EAAKojC,YAAYA;;OAIftjC,iBAAAA,SACN45B;QADM55B;QAIN,OADcolC,GAAmBxL,GACpB52B,IAAIqiC,GAAgBp8B,KAAKV,MAAK+8B,SAAAA;YAClCjT,OAAAA,GAAmBlwB,QAAQjC,EAAKqlC,GAAcD;;OAIjDtlC,iBAAAA,SACN45B;QAGA,OADsB+K,GAAoB/K,GACrBhmB,OAAO1T,KAAK+hC;;;;;;;qBAQ3BjiC;;;;;;4BAEJE,KAAKojC,aACJpjC,KAAKslC,GAAYtlC,KAAKulC,IA1YH,+BA4YpBvlC,KAAKulC,KAA4B/gC,KAAKC;oCAERzE,KAAKwjC,eACjC,uCACA,sBACA9J,SAAAA;wBACE,IAAM8L,IAAgB7L,EAAqBC,GAGzCF,GAAKgL,GAAiB5K;wBAExB,OAAO0L,EAAchM,KAAUnxB,MAAKo9B,SAAAA;4BAClC,IAAMC,IAAS1lC,EAAK2lC,GAClBF,GAzZY,OA4ZRG,IAAWH,EAAgBh+B,QAC/Bo+B,SAAAA;wCAAsC,MAA5BH,EAAOn+B,QAAQs+B;;;wDAI3B,OAAO1T,GAAmBhsB,QACxBy/B,IACCE,SAAAA;gCACCN,OAAAA,EAAc9xB,OAAOoyB,EAAe/D;gCACtC15B,MAAK;gCAAMu9B,OAAAA;;;wBAGjBhC,OAAM;wBAKC,OAAA;;;;;;;;;6BAQOz9B,SAAQ2/B,SAAAA;wBACtB9lC,EAAKyiC,OAAOC,aAAaqD,WACvB/lC,EAAKgmC,GAA6BF,EAAe/D;;;;;;;;;;;;;IAUjDjiC,iBAAAA;QAAAA;QACNE,KAAKimC,KAA0BjmC,KAAKg3B,GAAMc,2DAjbF,MAobtC;YACS93B,OAAAA,EAAKmjC,KACTpgC,MAAK;gBAAM/C,OAAAA,EAAKkmC;gBAChBnjC,MAAK;gBAAM/C,OAAAA,EAAKujC;;;;wDAMjBzjC,iBAAAA,SAAc+lC;QACpB,SAAOA,KAASA,EAAOM,YAAYnmC,KAAK+hC;;;;;;;;;IAUlCjiC,iBAAAA,SACN45B;QADM55B;QAIN,OADcolC,GAAmBxL,GAE9B52B,IAAIqiC,GAAgBp8B,KACpBV,MAAK+9B,SAAAA;;;;;;;;;YAiBJ,IAfqB,SAAnBA,KACApmC,EAAKslC,GACHc,EAAeC,kBA5dS,SA+dzBrmC,EAAKsmC,GAAgBF,EAAeD,UAUd;gBACvB,IAAInmC,EAAKqlC,GAAce,MAAmBpmC,EAAKukC,gBAC7C;gBAGF,KAAKvkC,EAAKqlC,GAAce,IAAiB;oBACvC,KAAKA,EAAgBtE;;;;;;;;;;;;oBAanB,MAAM,IAAI1+B,EACRhD,EAAKW,qBACL2gC;oBAIJ;;;YAIJ,UAAI1hC,EAAKukC,mBAAkBvkC,EAAK2kC,iBAIzBF,GAAoB/K,GACxBF,KACAnxB,MAAKo9B,SAAAA;kCAGuBzlC,EAAK2lC,GAC9BF,GAhhBsB,KAkhBtB14B,MAAKw5B,SAAAA;oBACL,IAAIvmC,EAAK+hC,aAAawE,EAAYxE,UAAU;wBAC1C,IAAMyE,KACHxmC,EAAKukC,kBAAkBgC,EAAYhC,gBAChCkC,KACHzmC,EAAK2kC,gBAAgB4B,EAAY5B,cAC9B+B,IACJ1mC,EAAKukC,mBAAmBgC,EAAYhC;wBACtC,IACEiC,KACCC,KACCC,GAEF;;oBAGJ;;;YAKPr+B,MAAKy8B,SAAAA;mBACA9kC,EAAKojC,cAAc0B,KACrBjf,GAtjBM,wBAwjBJ,aACEif,IAAkB,OAAO;YAIxBA;;wBAIbhlC;;;;;;;;2BAGEE,KAAK2jC,SAEL3jC,KAAK2mC,MACD3mC,KAAKimC,OACPjmC,KAAKimC,GAAwB1O,UAC7Bv3B,KAAKimC,KAA0B,OAEjCjmC,KAAK4mC;oBACL5mC,KAAK6mC,sBACC7mC,KAAKwjC,eAAe,YAAY,cAAa9J,SAAAA;wBAC1C15B,OAAAA,EAAK+kC,GAA0BrL,GAAKrxB,MAAK;4BAC9CrI,OAAAA,EAAK8mC,GAAqBpN;;wBAE3BkK,OAAM3U,SAAAA;wBACPpJ,GAllBU,wBAklBQ,8CAA8CoJ;;;;;;qCAElEjvB,KAAKkjC,GAASY;;;oBAId9jC,KAAK+mC;;;;;;;;;IAOCjnC,iBAAAA,SACNknC,GACAC;QAFMnnC;QAIN,OAAOknC,EAAQv/B,QACbo+B,SAAAA;YACE7lC,OAAAA,EAAKslC,GAAYO,EAAOqB,cAAcD,OACrCjnC,EAAKsmC,GAAgBT,EAAO9D;;;;;;;;;;IAWnCjiC,iBAAAA;QAAAA;QACE,OAAOE,KAAKwjC,eAAe,oBAAoB,aAAY9J,SAAAA;YAClD+K,OAAAA,GAAoB/K,GACxBF,KACAnxB,MAAK2+B,SAAAA;gBACJhnC,OAAAA,EAAK2lC,GAAoBqB,GAhnBT,MAgnBqCn/B,KACnDs/B,SAAAA;oBAAkBA,OAAAA,EAAepF;;;;4BAM3CjiC,SAA8BgwB;;;;;;oBAC5B,OAAK6J,EAAqBsI,QAGpBE,IAASrS,IAAiB6J,EAAqByI,oBAC/CS,GAASnvB,OAAOyuB,yBAHbngC,QAAQC;;;;;;;OAMnBmlC;aAAAA;YACE,OAAOpnC,KAAK2jC;;;;QAGd7jC,iBAAAA,SAAiB+B;QAKf,OAAOwlC,GAAuBC,GAC5BzlC,GACA7B,KAAK4Q,YACL5Q,KAAKi0B,IACLj0B,KAAKg+B;OAITl+B,iBAAAA;QAKE,OAAOE,KAAKsiC;OAGdxiC,iBAAAA;QAKE,OAAOE,KAAK+zB;OAGdj0B,iBAAAA;QAKE,OAAOE,KAAKi0B;OAGdn0B,6BAAAA,SACEsc,GACAmrB,GACAC;QAHF1nC;QAOE+lB,GArrBY,wBAqrBM,yBAAyBzJ;QAE3C,IAEIqrB,GAFEC,IAAwB,eAATH,IAAsB,aAAa;;;QAMxD,OAAOvnC,KAAKkjC,GACTM,eAAekE,GAAcC,KAAYC,SAAAA;mBACxCH,IAAyB,IAAI7E,GAC3BgF,GACA5nC,EAAK0jC,KACD1jC,EAAK0jC,GAAer7B,SACpByuB,GAAe+Q,KAGR,wBAATN,IAMKvnC,EAAK4kC,GAAmB6C,GAC5Bp/B,MAAKy/B,SAAAA;yBACAA,KAGG9nC,EAAK8kC,GAAgB2C;gBAE7Bp/B,MAAKy/B,SAAAA;gBACJ,KAAKA,GAQH,MAPAzsB,GACE,gDAA8Ce,WAEhDpc,EAAKojC;gBACLpjC,EAAKg3B,GAAMwN,IAAiB;oBAC1BxkC,OAAAA,EAAK+jC;qBAED,IAAI3gC,EACRhD,EAAKW,qBACL6yB;gBAGJ,OAAO4T,EAAqBC;gBAE7Bp/B,MAAKuG,SAAAA;gBACG5O,OAAAA,EAAKglC,GACVyC,GACAp/B,MAAK;oBAAMuG,OAAAA;;kBAGV5O,EAAK+nC,GACVN,GACAp/B,MAAK;gBAAMm/B,OAAAA,EAAqBC;;YAGrC1kC,MAAK6L,SAAAA;mBACJ64B,EAAuBO,MAChBp5B;;;;;;;;;IAUL9O,iBAAAA,SACN45B;QADM55B;QAIN,OADcolC,GAAmBxL,GACpB52B,IAAIqiC,GAAgBp8B,KAAKV,MAAK+9B,SAAAA;YASzC,IAPqB,SAAnBA,KACApmC,EAAKslC,GACHc,EAAeC,kBArvBW,SAwvB3BrmC,EAAKsmC,GAAgBF,EAAeD,aAEXnmC,EAAKqlC,GAAce,QAE1CpmC,EAAK8hC,4BACLsE,EAAgBtE,0BAEjB,MAAM,IAAI1+B,EACRhD,EAAKW,qBACL2gC;;;;;;;IAWF5hC,iBAAAA,SACN45B;QAEA,IAAMuO,IAAa,IAAI9C,GACrBnlC,KAAK+hC,UACL/hC,KAAK8hC,yBACLt9B,KAAKC;QAEP,OAAOygC,GAAmBxL,GAAKL,IAAI8L,GAAgBp8B,KAAKk/B;cAG1DnoC;QACE,OAAO+iC,GAASZ;;;;;;WAOlBniC,SAA0BooC;;;;;;QAQxB,IAAIx4B,IAAWw4B,EAAa14B,GAAWC;QAKvC,OAJKy4B,EAAa14B,GAAW24B,OAC3Bz4B,KAAY,MAAMw4B,EAAa14B,GAAWE,WAGrC,eAAew4B,EAAapY,iBAAiB,MAAMpgB,IAAW;;kFAI/D5P,iBAAAA,SACN45B;QADM55B,cAGAg6B,IAAQoL,GAAmBxL;QACjC,OAAOI,EAAMh3B,IAAIqiC,GAAgBp8B,KAAKV,MAAK+8B,SAAAA;YACrCplC,OAAAA,EAAKqlC,GAAcD,MACrBvf,GAn0BQ,wBAm0BU,6BACXiU,EAAMpmB,OAAOyxB,GAAgBp8B,QAE7BopB,GAAmBlwB;;;8DAMxBnC,iBAAAA,SAAYonC,GAAsBkB;QACxC,IAAM3jC,IAAMD,KAAKC;QAGjB,SAAIyiC,IAFkBziC,IAAM2jC,KAIjBlB,IAHWziC,MAIpB4W,GACE,oDAAkD6rB,YALhCziC;;OAahB3E,iBAAAA;QAAAA;QAEc,SAAlBE,KAAKmlB,YACqC,qBAAnCnlB,KAAKmlB,SAASkjB,qBAErBroC,KAAKsoC,KAA4B;YAC/BtoC,EAAKg3B,GAAMwN,IAAiB;uBAC1BxkC,EAAK2kC,eAAkD,cAAnC3kC,EAAKmlB,SAAUojB,iBAC5BvoC,EAAKmjC;;WAIhBnjC,KAAKmlB,SAASkjB,iBACZ,oBACAroC,KAAKsoC,KAGPtoC,KAAK2kC,eAAiD,cAAlC3kC,KAAKmlB,SAASojB;OAI9BzoC,iBAAAA;QACFE,KAAKsoC,OAMPtoC,KAAKmlB,SAASqjB,oBACZ,oBACAxoC,KAAKsoC,KAEPtoC,KAAKsoC,KAA4B;;;;;;;;;;;;IAc7BxoC,iBAAAA;QAAAA;QACsC,qBAAjCE,KAAKyiC,OAAO4F,qBACrBroC,KAAKyoC,KAAsB;;;;YAIzBzoC,EAAK2mC,MAEL3mC,EAAKg3B,GAAMwN,IAAiB;gBAGnBxkC,OAAAA,EAAK0oC;;WAGhB1oC,KAAKyiC,OAAO4F,iBAAiB,UAAUroC,KAAKyoC;OAIxC3oC,iBAAAA;QACFE,KAAKyoC,OAKPzoC,KAAKyiC,OAAO+F,oBAAoB,UAAUxoC,KAAKyoC,KAC/CzoC,KAAKyoC,KAAsB;;;;;;;IASvB3oC,iBAAAA,SAAgBiiC;QACtB;YACE,IAAM4G,IAEJ,SADA3oC,KAAK2iC,GAAWiG,QAAQ5oC,KAAKgmC,GAA6BjE;YAQ5D,OANAlc,GAj7BU,wBAm7BR,aAAWkc,YACT4G,IAAY,OAAO;YAGhBA;UACP,OAAO1Z;;YAGP,OADA5T,GA17BU,wBA07BQ,oCAAoC4T;;;;;;;IASlDnvB,iBAAAA;QACN;YACEE,KAAK2iC,GAAWkG,QACd7oC,KAAKgmC,GAA6BhmC,KAAK+hC,WACvC58B,OAAOX,KAAKC;UAEd,OAAOwqB;;YAEP5T,GAAS,mCAAmC4T;;;0DAKxCnvB,iBAAAA;QACN;YACEE,KAAK2iC,GAAWoD,WACd/lC,KAAKgmC,GAA6BhmC,KAAK+hC;UAEzC,OAAO9S;;;OAKHnvB,iBAAAA,SAA6BiiC;QACnC,OAAO,sBAAiC/hC,KAAK8vB,uBAAkBiS;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAOnE,SAASmD,GACPxL;IAEA,OAAOC,GAAqBC,GAC1BF,GACAyL,GAAgBrL;;;;;aAOX2K,GACP/K;IAEA,OAAOC,GAAqBC,GAC1BF,GACAgL,GAAiB5K;;;qEAp4BI;;;IA44BvBh6B,WAA6BmjC,GAA0B6F;QAA1B9oC,UAAAijC,GAC3BjjC,KAAK+oC,KAAmB,IAAIC,GAAoBhpC,MAAM8oC;;WAGxDhpC,iBAAAA,SACE45B;QAEA,IAAMuP,IAAkBjpC,KAAKkpC,GAAsBxP;QAEnD,OAD2B15B,KAAKijC,GAAGkG,KAAiBC,GAAe1P,GACzCrxB,MAAKo2B,SAAAA;YAC7BwK,OAAAA,EAAgB5gC,MAAKghC,SAAAA;gBAAY5K,OAAAA,IAAc4K;;;OAI3CvpC,iBAAAA,SACN45B;QAEA,IAAI4P,IAAgB;QACpB,OAAOtpC,KAAKupC,GAAsC7P,IAAKvV,SAAAA;YACrDmlB;YACCjhC,MAAK;YAAMihC,OAAAA;;OAGhBxpC,iBAAAA,SACE45B,GACA3iB;QAEA,OAAO/W,KAAKijC,GAAGkG,KAAiB5lB,GAAcmW,GAAK3iB;OAGrDjX,iBAAAA,SACE45B,GACA3iB;QAEA,OAAO/W,KAAKwpC,GAAwB9P,IAAK,SAAC9I,GAAQ/V;YAChD9D,OAAAA,EAAE8D;;OAIN/a,iBAAAA,SACE45B,GACA/e,GACA5R;QAEA,OAAO0gC,GAAiB/P,GAAK3wB;OAG/BjJ,iBAAAA,SACE45B,GACA/e,GACA5R;QAEA,OAAO0gC,GAAiB/P,GAAK3wB;OAG/BjJ,iBAAAA,SACE45B,GACAmF,GACAC;QAEA,OAAO9+B,KAAKijC,GACTkG,KACAO,GAAchQ,GAAKmF,GAAYC;OAGpCh/B,iBAAAA,SACE45B,GACA3wB;QAEA,OAAO0gC,GAAiB/P,GAAK3wB;;;;;;;;IASvBjJ,iBAAAA,SACN45B,GACA9I;;QAEA,gBCniBF8I,GACA9I;YAEA,IAAI9I;YACJ,OAAO6hB,GAAoBjQ,GACxBkQ,IAAcjJ,SAAAA;gBACNkJ,OAAAA,GAAyBnQ,GAAKiH,GAAQ/P,GAAQvoB,MAAKyhC,SAAAA;2BACpDA,MACFhiB,SAEKqK,GAAmBlwB,SAAS6nC;;gBAGtCzhC,MAAK;gBAAMyf,OAAAA;;UDshBoB4R,GAAK9I;OAGvC9wB,iBAAAA,SACE45B,GACAmF;QAFF/+B,cAKQiqC,IADgB/pC,KAAKijC,GAAG+G,KACKC,MAE7BnX,IAA4C,IAC9CoX,IAAgB;QAsBpB,OApBkBlqC,KAAKwpC,GACrB9P,IACA,SAAC9I,GAAQ/V;YACP,IAAIA,KAAkBgkB,GAAY;gBAChC,IAAMzkB,IAAIpa,EAAKmqC,GAASzQ,GAAK9I,GAAQvoB,MAAK8hC,SAAAA;oBACxC,KAAKA;;;oBAIH,OAHAD,KAGOH,EAAazV,GAASoF,GAAK9I,GAAQvoB,MAAK;+BAC7C0hC,EAAaxM,GAAY3M,IAClB6O,GAAoB/F,GAAKhmB,OAoFvC,EAAC,GAAGukB,GApFsDrH,EAoF/BtpB;;;gBAhF1BwrB,EAASzsB,KAAK+T;;YAMjB/R,MAAK;YAAM8pB,OAAAA,GAAmBY,GAAQD;YACtCzqB,MAAK;YAAM0hC,OAAAA,EAAa35B,MAAMspB;YAC9BrxB,MAAK;YAAM6hC,OAAAA;;OAGhBpqC,2BAAAA,SACE45B,GACApV;QAEA,IAAM8a,IAAU9a,EAAW8lB,GAAmB1Q,EAAIkI;QAClD,OAAO5hC,KAAKijC,GAAGkG,KAAiBkB,GAAiB3Q,GAAK0F;OAGxDt/B,iBAAAA,SACE45B,GACA3wB;QAEA,OAAO0gC,GAAiB/P,GAAK3wB;;;;;;;;IASvBjJ,iBAAAA,SACN45B,GACA3iB;QAEA,IAEIuzB,GAFExQ,IAAQ2F,GAAoB/F,IAC9B6Q,IAAqCzT,GAAe+Q;QAExD,OAAO/N,EACJmB,GACC;YACEz0B,OAAOk5B,GAAiBI;YAE1B;gBAAEnlB,UAAqBrT,oBAAMuT;YACV,MAAbF;;;YAGE4vB,MAAiBzT,GAAe+Q,MAClC9wB,EAAE,IAAIzO,EAAYgwB,GAAmBgS,KAAYC;;;;;YAMnDA,OACAD,IAAWhjC;;;YAIXijC,IAAezT,GAAe+Q;YAInCx/B,MAAK;;;;YAIAkiC,MAAiBzT,GAAe+Q,MAClC9wB,EAAE,IAAIzO,EAAYgwB,GAAmBgS,KAAYC;;OAKzDzqC,iBAAAA,SAAa45B;QACX,OAAO15B,KAAKijC,GAAG+G,KAAyBQ,GAAQ9Q;;;;AAmBpD,SAAS+P,GACP/P,GACA3wB;IAEA,OAAO02B,GAAoB/F,GAAKL;;;;;IAXlC,SACEtwB,GACA8R;QAEA,OAAO,IAAI6kB,GAAiB,GAAGzH,GAAmBlvB,EAAIzB,OAAOuT;KAJ/D,CAYgB9R,GAAK2wB,EAAIkI;;;;;;;;;;;;;;;;;;;;ICvtCvB9hC;;;;;IAKU6gC,GACS/vB,GACAqjB,GACA+J;QAHTh+B,cAAA2gC,GACS3gC,kBAAA4Q,aACAqjB,aACA+J;;;;;;;;;;;;;QAVnBh+B,UAAgC;;;;;;;kBAkBhCF,SACE+B,GACA+O,GACAqjB,GACA+J;;;;;QAQA,OAFA36B,GAAwB,OAAbxB,EAAK9B,MAET,IAAIsnC,EADIxlC,EAAK5B,MAAoB4B,EAAK9B,MAAO,IAGlD6Q,GACAqjB,GACA+J;OAIJl+B,iBAAAA,SAAWszB;QACT,IAAIhgB,QACE6K,IAAQsb,YAAYphB,MACxB,EAACnY,KAAK2gC,QAAQv2B,OAAOi1B,qBACrB,EAACr/B,KAAK2gC,QAAQv2B,OAAOk1B;QAEvB,OAAOmL,GAAerX,GACnB6H,GACC;YAAEz0B,OAAOu6B,GAAgB2J;YAAoBzsB,OAAAA;YAC7C,SAAClV,GAAKnH,GAAOu5B;YACX/nB,QACA+nB,EAAQ3I;YAGXnqB,MAAK;YAAM+K,OAAAA;;OAGhBtT,iBAAAA,SACEszB,GACAjC,GACAE;QAEA,OAAOrxB,KAAK2qC,GAAyBvX,GAAa/qB,MAAK8xB,SAAAA;;;mBAGrDA,EAASyQ,kBAAkBvZ,EAAY5iB,YAEhCk7B,GAAoBvW,GAAaiG,IAAIc;;OAIhDr6B,iBAAAA,SACEszB;QAEA,OAAOpzB,KAAK2qC,GAAyBvX,GAAa/qB,MAChD8xB,SAAAA;YAAY5wB,OAAAA,EAAW8F,iBAAiB8qB,EAASyQ;;OAIrD9qC,iBAAAA,SACEszB,GACA/B;QAEA,OAAOrxB,KAAK2qC,GAAyBvX,GAAa/qB,MAAK8xB,SAAAA;;;mBAGrDA,EAASyQ,kBAAkBvZ,EAAY5iB,YAChCk7B,GAAoBvW,GAAaiG,IAAIc;;OAIhDr6B,iBAAAA,SACEszB,GACAtoB,GACA4lB,GACAC;QAJF7wB,cAMQ+qC,IAAgBC,GAAuB1X,IACvC2X,IAAgBN,GAAerX;;;;;;;;;;QAYrC,OAAO2X,EAAcrsB,IAAI,IAAWrW,MAAKooB,SAAAA;YAjIzCptB,GAmIuB,mBAAZotB;YAgBT,KAZA,IAAMU,IAAQ,IAAIgQ,GAChB1Q,GACA3lB,GACA4lB,GACAC,IAEIqQ,IAAUhhC,EAAK4Q,WAAWo6B,GAAkBhrC,EAAK2gC,QAAQxP,IAEzD2B,IAA4C,IAC9CmK,IAAoB,IAAIte,IAAwB,SAACpN,GAAGC;gBACtDvM,OAAAA,GAAoBsM,EAAElK,KAAmBmK,EAAEnK;wBAEtBspB,OAAAA,cAAAA,KAAW;gBAA7B,IAAMzH,UACH+hB,IAAWC,GAAmBniC,IAClC/I,EAAK2gC,QACLzX,EAASngB,IAAIzB,MACbmpB;gBAEFwM,IAAoBA,EAAkBve,IAAIwK,EAASngB,IAAIzB,KAAK8jB,MAC5D0H,EAASzsB,KAAK0kC,EAAc1R,IAAI2H,KAChClO,EAASzsB,KACPwkC,EAAcxR,IAAI4R,GAAUC,GAAmBC;;YAcnD,OAVAlO,EAAkB92B,SAAQ8kB,SAAAA;gBACxB6H,EAASzsB,KACPrG,EAAKi0B,GAAauJ,GAA2BpK,GAAanI;iBAI9DmI,EAAY8F,IAAuB;gBACjCl5B,EAAKorC,GAAsB3a,KAAWU,EAAMjjB;iBAGvCikB,GAAmBY,GAAQD,GAAUzqB,MAAK;gBAAM8oB,OAAAA;;;OAI3DrxB,iBAAAA,SACEszB,GACA3C;QAFF3wB;QAIE,OAAO2qC,GAAerX,GACnBtwB,IAAI2tB,GACJpoB,MAAK24B,SAAAA;YACAA,OAAAA,KACF39B,GACE29B,EAAQL,WAAW3gC,EAAK2gC,SAGnB3gC,EAAK4Q,WAAWy6B,GAAoBrK,MAEtC;;;;;;;;;;IAWblhC,iBAAAA,SACEszB,GACA3C;QAFF3wB;QAIE,OAAIE,KAAKorC,GAAsB3a,KACtB0B,GAAmBlwB,QACxBjC,KAAKorC,GAAsB3a,MAGtBzwB,KAAKsrC,GAAoBlY,GAAa3C,GAASpoB,MAAK8oB,SAAAA;YACzD,IAAIA,GAAO;gBACT,IAAMjjB,IAAOijB,EAAMjjB;gBAEnB,OADAlO,EAAKorC,GAAsB3a,KAAWviB,GAC/BA;;YAEP,OAAO;;OAMfpO,iBAAAA,SACEszB,GACA3C;QAFF3wB,cAIQyrC,IAAc9a,IAAU,GAExBxS,IAAQsb,YAAYkC,WAAW,EAACz7B,KAAK2gC,QAAQ4K,MAC/CC,IAAmC;QACvC,OAAOf,GAAerX,GACnB6H,GACC;YAAEz0B,OAAOu6B,GAAgB2J;YAAoBzsB,OAAAA;YAC7C,SAAClV,GAAKi4B,GAAS7F;YACT6F,EAAQL,WAAW3gC,EAAK2gC,WAC1Bt9B,GACE29B,EAAQvQ,WAAW8a,IAGrBC,IAAaxrC,EAAK4Q,WAAWy6B,GAAoBrK,KAEnD7F,EAAQ3I;YAGXnqB,MAAK;YAAMmjC,OAAAA;;OAGhB1rC,iBAAAA,SACEszB;QAEA,IAAMnV,IAAQsb,YAAYsF,WAAW,EACnC7+B,KAAK2gC,QACLv2B,OAAOk1B,sBAGL7O,KjBvQuB;QiBwQ3B,OAAOga,GAAerX,GACnB6H,GACC;YAAEz0B,OAAOu6B,GAAgB2J;YAAoBzsB,OAAAA;YAAOqe;YACpD,SAACvzB,GAAKi4B,GAAS7F;YACb1K,IAAUuQ,EAAQvQ,SAClB0K,EAAQ3I;YAGXnqB,MAAK;YAAMooB,OAAAA;;OAGhB3wB,iBAAAA,SACEszB;QADFtzB,cAGQme,IAAQsb,YAAYphB,MACxB,EAACnY,KAAK2gC,SjBvRmB,KiBwRzB,EAAC3gC,KAAK2gC,QAAQv2B,OAAOk1B;QAEvB,OAAOmL,GAAerX,GACnBoG,GAAQuH,GAAgB2J,oBAAoBzsB,GAC5C5V,MAAKojC,SAAAA;YACJA,OAAAA,EAAU5jC,KAAIm5B,SAAAA;gBAAWhhC,OAAAA,EAAK4Q,WAAWy6B,GAAoBrK;;;OAInElhC,iBAAAA,SACEszB,GACAC;QAFFvzB,cAMQ4rC,IAAcR,GAAmBS,cACrC3rC,KAAK2gC,QACLtN,EAAY/rB,OAERskC,IAAarS,YAAYkC,WAAWiQ,IAEpCna,IAA2B;;;gBACjC,OAAOuZ,GAAuB1X,GAC3B6H,GAAQ;YAAEhd,OAAO2tB;YAAc,SAACX,GAAU9mB,GAAGgX;YACrC0Q,IAAAA,UAAQC,UAAarb,UAStBnpB,IAAOgxB,GAAmBwT;;;;;;;;wBAChC,IAAID,MAAW7rC,EAAK2gC,UAAWtN,EAAY/rB,KAAK9B,QAAQ8B;;YAKxD,OAAOmjC,GAAerX,GACnBtwB,IAAI2tB,GACJpoB,MAAK6gB,SAAAA;gBACJ,KAAKA,GACH,MA7UGtjB;gBAoVLvC,GACE6lB,EAASyX,WAAW3gC,EAAK2gC,SAG3BpP,EAAQlrB,KAAKrG,EAAK4Q,WAAWy6B,GAAoBniB;;YAnBnDiS,EAAQ3I;YAsBXnqB,MAAK;YAAMkpB,OAAAA;;OAGhBzxB,iBAAAA,SACEszB,GACAI;QAFF1zB,cAIMisC,IAAiB,IAAIptB,GAAmB1Z,KAEtC6tB,IAA4C;QAiClD,OAhCAU,EAAartB,SAAQktB,SAAAA;YACnB,IAAMuY,IAAaV,GAAmBS,cACpC3rC,EAAK2gC,QACLtN,EAAY/rB,OAER2W,IAAQsb,YAAYkC,WAAWmQ,IAE/B7U,IAAU+T,GAAuB1X,GAAa6H,GAClD;gBAAEhd,OAAAA;gBACF,SAACgtB,GAAU9mB,GAAGgX;gBACL0Q,IAAAA,UAAQC,UAAaE,UAStB1kC,IAAOgxB,GAAmBwT;;;;;;;;gCAC5BD,MAAW7rC,EAAK2gC,UAAWtN,EAAY/rB,KAAK9B,QAAQ8B,KAKxDykC,IAAiBA,EAAertB,IAAIstB,KAJlC7Q,EAAQ3I;;YAQdM,EAASzsB,KAAK0wB;aAGT5E,GAAmBY,GAAQD,GAAUzqB,MAAK;YAC/CrI,OAAAA,EAAKisC,GAAsB7Y,GAAa2Y;;OAI5CjsC,iBAAAA,SACEszB,GACA3S;QAFF3gB,cAaQosC,IAAYzrB,EAAMnZ,MAClB6kC,IAA0BD,EAAUvmC,SAAS,GAa7C+lC,IAAcR,GAAmBS,cACrC3rC,KAAK2gC,QACLuL,IAEIN,IAAarS,YAAYkC,WAAWiQ,IAKtCK,IAAiB,IAAIptB,GAAmB1Z;QAC5C,OAAO6lC,GAAuB1X,GAC3B6H,GAAQ;YAAEhd,OAAO2tB;YAAc,SAACX,GAAU9mB,GAAGgX;YACrC0Q,IAAAA,UAAQC,UAAaE,UACtB1kC,IAAOgxB,GAAmBwT;YAC5BD,MAAW7rC,EAAK2gC,UAAWuL,EAAU56B,EAAWhK;;;;;;YAShDA,EAAK3B,WAAWwmC,MAGpBJ,IAAiBA,EAAertB,IAAIstB,MAXlC7Q,EAAQ3I;YAaXnqB,MAAK;YAAMrI,OAAAA,EAAKisC,GAAsB7Y,GAAa2Y;;OAGhDjsC,iBAAAA,SACNszB,GACAgZ;QAFMtsC,cAIAyxB,IAA2B,IAC3BuB,IAA4C;;QAsBlD,OApBAsZ,EAASjmC,SAAQsqB,SAAAA;YACfqC,EAASzsB,KACPokC,GAAerX,GACZtwB,IAAI2tB,GACJpoB,MAAK6gB,SAAAA;gBACJ,IAAiB,SAAbA,GACF,MAjdGtjB;gBAudLvC,GACE6lB,EAASyX,WAAW3gC,EAAK2gC,SAG3BpP,EAAQlrB,KAAKrG,EAAK4Q,WAAWy6B,GAAoBniB;;aAIlDiJ,GAAmBY,GAAQD,GAAUzqB,MAAK;YAAMkpB,OAAAA;;OAGzDzxB,iBAAAA,SACEszB,GACAjC;QAFFrxB;QAIE,OAAOusC,GACJjZ,EAAqCuO,IACtC3hC,KAAK2gC,QACLxP,GACA9oB,MAAKyZ,SAAAA;mBACLsR,EAAY8F,IAAuB;gBACjCl5B,EAAKssC,GAAyBnb,EAAMV;iBAE/B0B,GAAmBhsB,QACxB2b,IACC/Y,SAAAA;gBACQ/I,OAAAA,EAAKg+B,GAAkBuO,GAC5BnZ,GACArqB;;;;;;;;;;;;;IAgBVjJ,iBAAAA,SAAyB2wB;eAChBzwB,KAAKorC,GAAsB3a;OAGpC3wB,iBAAAA,SACE45B;QADF55B;QAGE,OAAOE,KAAKwsC,GAAW9S,GAAKrxB,MAAK+K,SAAAA;YAC/B,KAAKA,GACH,OAAO+e,GAAmBlwB;;;wBAK5B,IAAMwqC,IAAalT,YAAYkC,WAC7ByP,GAAmBwB,cAAc1sC,EAAK2gC,UAElCgM,IAA6C;YACnD,OAAO7B,GAAuBpR,GAC3BuB,GAAQ;gBAAEhd,OAAOwuB;gBAAc,SAAC1jC,GAAKob,GAAGgX;gBAEvC,IADepyB,EAAI,OACJ/I,EAAK2gC,QAGb;oBACL,IAAMr5B,IAAOgxB,GAAmBvvB,EAAI;oBACpC4jC,EAA2BtmC,KAAKiB;uBAJhC6zB,EAAQ3I;gBAOXnqB,MAAK;gBACJhF,GACwC,MAAtCspC,EAA2BhnC;;;OASrC7F,iBAAAA,SACE45B,GACA3wB;QAEA,OAAO8gC,GAAyBnQ,GAAK15B,KAAK2gC,QAAQ53B;;;;IAK5CjJ,iBAAAA,SACNszB;QADMtzB;QAGN,OAAO6pC,GAAoBvW,GACxBtwB,IAAI9C,KAAK2gC,QACTt4B,MAAM8xB,SAAAA;YAEHA,OAAAA,KACA,IAAIyS,GACF5sC,EAAK2gC,SjBnjBc;iCiBqjBE;;;;;;;;aAWxBkJ,GACPnQ,GACAiH,GACA53B;IAEA,IAAMkiC,IAAWC,GAAmBS,cAAchL,GAAQ53B,EAAIzB,OACxDwkC,IAAcb,EAAS,IACvBwB,IAAalT,YAAYkC,WAAWwP,IACtCnB;IACJ,OAAOgB,GAAuBpR,GAC3BuB,GAAQ;QAAEhd,OAAOwuB;QAAY5M;QAAkB,SAAC92B,GAAKnH,GAAOu5B;QACpD0Q,IAAAA,UAAQgB;;QACXhB,MAAWlL,KAAUkM,MAAYf,MACnChC,SAEF3O,EAAQ3I;QAETnqB,MAAK;QAAMyhC,OAAAA;;;;SAyBAuC,GACd3S,GACAiH,GACAxP;IAEA,IAAM4Z,IAAgBrR,EAAII,MACxBiH,GAAgBjH,QAEZgT,IAAWpT,EAAII,MACnBoR,GAAmBpR,QAEfhH,IAA4C,IAE5C7U,IAAQsb,YAAYwT,KAAK5b,EAAMV,UACjCuc,IAAa,GACXC,IAAgBlC,EAAc9P,GAClC;QAAEhd,OAAAA;QACF,SAAClV,GAAKnH,GAAOu5B;eACX6R,KACO7R,EAAQznB;;IAGnBof,EAASzsB,KACP4mC,EAAc5kC,MAAK;QAvnBnBhF,GAynBmB,MAAf2pC;;IAON,KADA,IAAMlrB,IAAkC,WACjBqP,IAAAA,EAAMR,WAANQ,cAAAA,KAAiB;QAAnC,IAAMjI,UACH+hB,IAAWC,GAAmBniC,IAClC43B,GACAzX,EAASngB,IAAIzB,MACb6pB,EAAMV;QAERqC,EAASzsB,KAAKymC,EAASp5B,OAAOu3B,KAC9BnpB,EAAiBzb,KAAK6iB,EAASngB;;IAEjC,OAAOopB,GAAmBY,GAAQD,GAAUzqB,MAAK;QAAMyZ,OAAAA;;;;;;aAMhD2oB,GACP/Q;IAEA,OAAOC,GAAqBC,GAC1BF,GACAqH,GAAgBjH;;;;;aAOXgR,GACPpR;IAEA,OAAOC,GAAqBC,GAG1BF,GAAKwR,GAAmBpR;;;;;aAMnB6P,GACPjQ;IAEA,OAAOC,GAAqBC,GAC1BF,GACAkT,GAAgB9S;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;QClqBPiJ,KAAiB;IAI5BjjC,WAA6B8Q;QAAA5Q,kBAAA4Q;;;;;;;;kBAS7B9Q,8BAAAA,SACEmjC,GACAvJ,GACA7R,GACAmC;QAJFlqB;QA3B8CuD,GAkC1CwkB,IAAcmC,KACZnC,KAAe,KACfmC,KAAa+Y;QAIjB,IAAMpB,IAAsB,IAAIuL,GAAoBxT;QAEhD7R,IAAc,KAAKmC,KAAa,MA6SxC,SAAkCiZ;YAChCA,EAAGkK,kBAAkBhI,GAAgBrL;SADvC,CA5S+BmJ,IA6Z/B,SAA6BA;YAC3BA,EAAGkK,kBAAkBP,GAAgB9S,OAAO;gBAC1C+S,SAASD,GAAgBC;gBAGE5J,EAAGkK,kBAAkBpM,GAAgBjH,OAAO;gBACvE+S,SAAS9L,GAAgB8L;gBACzBO;eAEmBC,YACnBtM,GAAgB2J,oBAChB3J,GAAgBuM,sBAChB;gBAAEC;gBAGJtK,EAAGkK,kBAAkBjC,GAAmBpR;SAf1C,CA5Z0BmJ,IACpBuK,GAAiBvK,IA0gBvB,SAAmCA;YACjCA,EAAGkK,kBAAkBtR,GAAiB/B;SADxC,CAzgBgCmJ;;;QAM5B,IAAI7oB,IAAI+X,GAAmBlwB;QA+D3B,OA9DI4lB,IAAc,KAAKmC,KAAa;;;QAGd,MAAhBnC,MAi4BV,SAAwBob;YACtBA,EAAGwK,kBAAkB/N,GAAiB5F,QACtCmJ,EAAGwK,kBAAkBlO,GAASzF,QAC9BmJ,EAAGwK,kBAAkBvO,GAAepF;SAHtC,CAh4BuBmJ,IACfuK,GAAiBvK,KAEnB7oB,IAAIA,EAAE/R,MAAK;;;;;;YA84BjB,OAAA,SACEqxB;gBAEA,IAAMgU,IAAchU,EAAII,MACtBoF,GAAepF,QAEXK,IAAW,IAAI+E;qCACE;8CACS,GAC9B55B,EAAgByB,MAAMkgB;iCACL;gBAEnB,OAAOymB,EAAYrU,IAAI6F,GAAen2B,KAAKoxB;aAZ7C,CA94BmDwH;cAG3C9Z,IAAc,KAAKmC,KAAa,MACd,MAAhBnC;;;;;;;QAOFzN,IAAIA,EAAE/R,MAAK;YAuZnB,OAAA,SACE46B,GACAvJ;gBAKA,OAHyBA,EAAII,MAC3BiH,GAAgBjH,OAEMN,KAAUnxB,MAAKslC,SAAAA;oBACrC1K,EAAGwK,kBAAkB1M,GAAgBjH,QAEdmJ,EAAGkK,kBAAkBpM,GAAgBjH,OAAO;wBACjE+S,SAAS9L,GAAgB8L;wBACzBO;uBAEaC,YACbtM,GAAgB2J,oBAChB3J,GAAgBuM,sBAChB;wBAAEC;;oBAGJ,IAAMK,IAAmBlU,EAAII,MAC3BiH,GAAgBjH,QAEZ+T,IAAWF,EAAkB9lC,KAAIqhB,SAAAA;wBACrC0kB,OAAAA,EAAiBvU,IAAInQ;;oBAGvB,OAAOiJ,GAAmBY,GAAQ8a;;aA3BtC,CAtZmD5K,GAAItB;cAIjDvnB,IAAIA,EAAE/R,MAAK;aA87BjB,SAAmC46B;gBACjCA,EAAGkK,kBAAkBzI,GAAiB5K,OAAO;oBAC3C+S,SAASnI,GAAiBmI;;aAF9B,CA77BkC5J;cAI1Bpb,IAAc,KAAKmC,KAAa,MAClC5P,IAAIA,EAAE/R,MAAK;YAAMrI,OAAAA,EAAK8tC,4BAA4BnM;cAGhD9Z,IAAc,KAAKmC,KAAa,MAClC5P,IAAIA,EAAE/R,MAAK;mBAwlBjB,SAAmC46B;gBACjCA,EAAGkK,kBAAkBxQ,GAAuB7C;aAD9C,CAvlBkCmJ,IACnBjjC,EAAK+tC,kBAAkBpM;cAI9B9Z,IAAc,KAAKmC,KAAa,MAClC5P,IAAIA,EAAE/R,MAAK;YAAMrI,OAAAA,EAAKguC,sBAAsBrM;cAG1C9Z,IAAc,KAAKmC,KAAa,MAClC5P,IAAIA,EAAE/R,MAAK;YACTrI,OAAAA,EAAKiuC,4BAA4BhL,GAAItB;cAIrC9Z,IAAc,KAAKmC,KAAa,MAClC5P,IAAIA,EAAE/R,MAAK;;;;aAw1BjB,SAAwC46B;gBAClCA,EAAGiL,iBAAiBC,SAAS,4BAC/BlL,EAAGwK,kBAAkB;aAFzB,CAp1BuCxK,IAk3BvC,SAA2CvJ;gBACzC,IAAM0U,IAAsB1U,EAAI2U,YAAYxS,GAAiB/B;gBAC7DsU,EAAoBf,YAClBxR,GAAiBM,eACjBN,GAAiByS,mBACjB;oBAAEf;oBAEJa,EAAoBf,YAClBxR,GAAiBC,yBACjBD,GAAiB0S,6BACjB;oBAAEhB;;aAVN,CAj3B0C7T;cAIlC7R,IAAc,MAAMmC,KAAa,OACnC5P,IAAIA,EAAE/R,MAAK;YAAMrI,OAAAA,EAAKwuC,oBAAoB7M;cAErCvnB;OAGDta,gCAAAA,SACN45B;QAEA,IAAI+U,IAAY;QAChB,OAAO/U,EACJI,MAA6C+B,GAAiB/B,OAC9DmB,IAAQ,SAAC9W,GAAGtQ;YACX46B,KAAahU,GAAe5mB;YAE7BxL,MAAK;YACJ,IAAM8xB,IAAW,IAAIwC,GAAuB8R;YAC5C,OAAO/U,EACJI,MACC6C,GAAuB7C,OAExBT,IAAIsD,GAAuB5zB,KAAKoxB;;OAIjCr6B,0CAAAA,SACN45B;QADM55B,cAGA4uC,IAAchV,EAAII,MACtB8S,GAAgB9S,QAEZ2Q,IAAiB/Q,EAAII,MACzBiH,GAAgBjH;QAGlB,OAAO4U,EAAYlV,KAAUnxB,MAAKsmC,SAAAA;YACzBxc,OAAAA,GAAmBhsB,QAAQwoC,IAAS3X,SAAAA;gBACzC,IAAM/Y,IAAQsb,YAAYphB,MACxB,EAAC6e,EAAM2J,SlB5Jc,KkB6JrB,EAAC3J,EAAM2J,QAAQ3J,EAAM4X;gBAGvB,OAAOnE,EACJjR,GAAQuH,GAAgB2J,oBAAoBzsB,GAC5C5V,MAAKojC,SAAAA;oBACGtZ,OAAAA,GAAmBhsB,QACxBslC,IACCzK,SAAAA;wBACC39B,GACE29B,EAAQL,WAAW3J,EAAM2J;wBAG3B,IAAMxP,IAAQnxB,EAAK4Q,WAAWy6B,GAAoBrK;wBAElD,OAAOqL,GACL3S,GACA1C,EAAM2J,QACNxP,GACA9oB,MAAK;;;;;;;;;;IAYbvI,oCAAAA,SACN45B;QAEA,IAAM+F,IAAsB/F,EAAII,MAG9B4F,GAAiB5F,QACboC,IAAiBxC,EAAII,MACzB+B,GAAiB/B;QAMnB,OAJ0BJ,EAAII,MAC5BoF,GAAepF,OAGQh3B,IAAIo8B,GAAen2B,KAAKV,MAAK8xB,SAAAA;YAKpD,IAYMrH,IAA4C;YAClD,OAAOoJ,EACJjB,IAAQ,SAAClyB,GAAK8K;gBACb,IAAMvM,IAAO,IAAIJ,EAAa6B,IACxB8lC,IA4EhB,SAAqBvnC;oBACnB,OAAO,EAAC,GAAG2wB,GAAmB3wB;iBADhC,CA5E6CA;gBACnCwrB,EAASzsB,KACPo5B,EAAoB38B,IAAI+rC,GAAgBxmC,MAAKymC,SAAAA;oBACtCA,OAAAA,IAGI3c,GAAmBlwB,YAtBX,SACvBqF;wBAEOm4B,OAAAA,EAAoBpG,IACzB,IAAIqG,GACF,GACAzH,GAAmB3wB,IACnB6yB,EAAsCoE;qBAPnB,CAoBSj3B;;gBAO/Be,MAAK;gBAAM8pB,OAAAA,GAAmBY,GAAQD;;;OAIrChzB,0CAAAA,SACNmjC,GACAvJ;;QAGAuJ,EAAGkK,kBAAkBtT,GAAmBC,OAAO;YAC7C+S,SAAShT,GAAmBgT;;QAG9B,IAAMzT,IAAyBM,EAAII,MAGjCD,GAAmBC,QAGfiV,IAAQ,IAAIpW,IACZ0E,IACJzE,SAAAA;YAEA,IAAImW,EAAMrwB,IAAIka,IAAiB;gBAC7B,IAAMnwB,IAAemwB,EAAe/jB,KAC9BikB,IAAaF,EAAexN;gBAClC,OAAOgO,EAAuBC,IAAI;oBAChC5wB,cAAAA;oBACAwiB,QAAQgN,GAAmBa;;;;;;gBAMjC,OAAOY,EACJI,MAA6C+B,GAAiB/B,OAC9DmB,GAAQ;YAAE4E;YAAkB,SAACmP,GAAc7qB;YAC1C,IAAM7c,IAAO,IAAIJ,EAAa8nC;YAC9B,OAAO3R,EAAS/1B,EAAK8jB;YAEtB/iB,MAAK;YAEGqxB,OAAAA,EACJI,MACCoR,GAAmBpR,OAEpBmB,GAAQ;gBAAE4E;gBAAkB,YAAiC1b;;oBAAvB2nB,UAC/BxkC,WAAOgxB,GAAmBwT;gBAChC,OAAOzO,EAAS/1B,EAAK8jB;;;OAKvBtrB,kCAAAA,SACN45B;QADM55B,cAGAmvC,IAAcvV,EAAII,MAA6ByF,GAASzF;QAC9D,OAAOmV,EAAYhU,IAAQ,SAAClyB,GAAKmmC;YAC/B,IAAMC,IAAqBnvC,EAAK4Q,WAAWmuB,GAAamQ,IAClDE,IAAkBpvC,EAAK4Q,WAAWuuB,GAAWgQ;YACnD,OAAOF,EAAY5V,IAAI+V;;;UAa3BtvC,SAAmBsE,GAAwBC;IAAxBrE,eAAAoE,GAAwBpE,mBAAAqE;QAkC3CvE,SACSqmC;;AAEArE,GACAuE;IAHArmC,eAAAmmC,GAEAnmC,+BAAA8hC,GACA9hC,wBAAAqmC;;;;;;;;;;;WAZM;;;;;AAMRlB,SAAM;;SA8BbrlC;;;;AAIS6gC;;;;;;;;;AASAiO;;;;;;;;;;AAUAhE;IAnBA5qC,cAAA2gC,GASA3gC,+BAAA4uC,GAUA5uC,uBAAA4qC;;;uDA5BM;;AAGRgC,aAAU;;;;;;;;;SAoDjB9sC;;;;AAIS6gC;;;;AAIAlQ;;;;;AAKAyQ;;;;;;;;;;;;;AAaAxQ;;;;;;AAMAC;IA5BA3wB,cAAA2gC,GAIA3gC,eAAAywB,GAKAzwB,wBAAAkhC,GAaAlhC,qBAAA0wB;IAMA1wB,iBAAA2wB;;;uDA3CM;;AAGRoQ,aAAU;;AAGVA,wBAAqB;;AAGrBA,0BAAuB,EAAC,UAAU;;;IAmJzCjhC;;;;oCAnCAA,SAAqB6gC;QACnB,OAAO,EAACA;;;;;;sBAOV7gC,SACE6gC,GACAr5B;QAEA,OAAO,EAACq5B,GAAQ1I,GAAmB3wB;;;;;;YAOrCxH,SACE6gC,GACAr5B,GACAmpB;QAEA,OAAO,EAACkQ,GAAQ1I,GAAmB3wB,IAAOmpB;;;;AA9BrCya,WAAQ;;;;;;;AAuCRA,iBAAc,IAAIA;;SAoBzBprC,SAAmBwH,GAAuB0gB;IAAvBhoB,YAAAsH,GAAuBtH,gBAAAgoB;QAQ1CloB,SAAmBwH,GAAuBqK;IAAvB3R,YAAAsH,GAAuBtH,eAAA2R;;;;;;;AA8C1C7R;;;;;;AAMS88B;;;;;AAKAC;;;;;AAKA1X;;;;;;;AAOA5S;;;;;AAMAyV;;;;;AAMA8Q;IA7BA94B,uBAAA48B,GAKA58B,kBAAA68B,GAKA78B,gBAAAmlB,GAOAnlB,6BAAAuS;IAMAvS,gBAAAgoB,GAMAhoB,kBAAA84B;;;;;;GAhEF+C,YAAQ;;;;;;;AAQRA,mBAAgB,iBAEhBA,uBAAoB;;;;;;;;AASpBA,6BAA0B,2BAE1BA,iCAA8B,EAAC,cAAc;;;;;;;;;;AA2DpD/7B,SAAmBs6B;IAAAp6B,gBAAAo6B;;;AARZuC,WAAQ,wBAERA,SAAM;;SAoDb78B;;;;;;;;;AASS6a;;;;AAIArM;;;;;;AAMA0Z;;;;;;;;;;;;;;;;;;AAkBAhN;;;;;;;;;;;;;;;AAeAumB;;;;;;AAMAxmB;;;;;;;;AAQA0F;IAzDAzgB,gBAAA2a,GAIA3a,mBAAAsO,GAMAtO,gBAAAgoB,GAkBAhoB,mBAAAgb;IAeAhb,gCAAAuhC,GAMAvhC,oCAAA+a,GAQA/a,aAAAygB;;;AAjFF8e,WAAQ;;AAGRA,aAAU;;AAGVA,2BAAwB;;;;;;AAOxBA,yBAAsB,EAAC,eAAe;;;;;;;;;;;;SAqG7Cz/B;;;;AAIS6a;;;;AAIArT;;;;;;AAMAuT;IAVA7a,gBAAA2a,GAIA3a,YAAAsH,GAMAtH,sBAAA6a;;;uDAzBM;;AAGR6kB,aAAU,EAAC,YAAY;;AAGvBA,0BAAuB;;AAGvBA,4BAAyB,EAAC,QAAQ;;;;;;;;SA4CzC5/B;;;;;;AAMSq+B;;;;;;AAMAI;;;;;;;;;AASAF;;;;AAIAI;IAnBAz+B,uBAAAm+B,GAMAn+B,mCAAAu+B,GASAv+B,iCAAAq+B;IAIAr+B,mBAAAy+B;;;;;;aA5BI,mBACNS,WAAQ;;;;;;;;SAmDfp/B;;;;AAIS2I;;;;;AAKAwiB;IALAjrB,oBAAAyI,GAKAzI,cAAAirB;;;oDAIFuiB,GAAiBvK;IACKA,EAAGkK,kBAAkBzN,GAAiB5F,OAAO;QACxE+S,SAASnN,GAAiBmN;OAEPQ,YACnB3N,GAAiBI,sBACjBJ,GAAiB2P,wBACjB;QAAE9B;;;IAGgBtK,EAAGkK,kBAAkB5N,GAASzF,OAAO;QACvD+S,SAAStN,GAASsN;OAIRQ,YACV9N,GAASC,uBACTD,GAAS+P,qBACT;QAAE/B;QAEJtK,EAAGkK,kBAAkBjO,GAAepF;;;AAtC7BD,WAAQ;;AAGRA,aAAU,EAAC,gBAAgB;;SAqGlC/5B;;;;AAKSiiC;;AAEAmF;;AAEA3C;;AAEAI;IANA3kC,gBAAA+hC,GAEA/hC,oBAAAknC,GAEAlnC,sBAAAukC,GAEAvkC,oBAAA2kC;;;sDAhBM;;AAGRD,aAAU;;AA2BZ,IAqCMiD,wDArCY,EACvBiF,GAAgB9S,OAChBiH,GAAgBjH,OAChBoR,GAAmBpR,OACnB+B,GAAiB/B,OACjByF,GAASzF,OACTqL,GAAgBrL,OAChBoF,GAAepF,OACf4F,GAAiB5F,WAUqB4K,GAAiB5K,YAIjB6C,GAAuB7C,YAIvBD,GAAmBC;IC31BzDh6B,WAAoBmjC;QAAAjjC,UAAAijC;;;;;QAMC,SALAJ,EAAS0M,GAAcC,cAMxCn0B,GACE;;;;;;;;;;kBAhMNvb,SACE4B,GACAiQ,GACA89B;QAOA,OADA5pB,GA7CY,YA6CM,qBAAqBnkB,IAChC,IAAIywB,IAA6B,SAAClwB,GAASmwB;;;;;;YAMhD,IAAMsd,IAAUjN,OAAOkN,UAAUC,KAAKluC,GAAMiQ;YAE5C+9B,EAAQG,YAAaxL,SAAAA;gBACnB,IAAMpB,IAAMoB,EAAM3pB,OAA4B9L;gBAC9C3M,EAAQ,IAAI4gC,EAASI;eAGvByM,EAAQI,YAAY;gBAClB1d,EACE,IAAIhvB,EACFhD,EAAKW,qBACL;eAMN2uC,EAAQK,UAAW1L,SAAAA;gBACjB,IAAMtV,IAAuBsV,EAAM3pB,OAA4BqU;gBAC5C,mBAAfA,EAAMrtB,OACR0wB,EACE,IAAIhvB,EACFhD,EAAKW,qBACL,2VAQJqxB,EAAOrD;eAIX2gB,EAAQM,kBAAmB3L,SAAAA;gBACzBxe,GAxFQ,YA0FN,eAAenkB,IAAO,oCACtB2iC,EAAM4L;gBAER,IAAMhN,IAAMoB,EAAM3pB,OAA4B9L;gBAC9C6gC,EACGS,gBACCjN,GACAyM,EAAoBtc,aACpBiR,EAAM4L,YACNlN,IAED16B,MAAK;oBACJwd,GAtGI,YAwGF,iCAAiCkd,KAAiB;;;YAIzDoN;;sDAILrwC,SAAc4B;QAEZ,OADAmkB,GAjHY,YAiHM,sBAAsBnkB,IACjC0uC,GAAkB3N,OAAOkN,UAAUU,eAAe3uC,IAAOyuC;;qFAIlErwC;QACE,IAAsB,sBAAX2iC,UAA8C,QAApBA,OAAOkN,WAC1C;QAGF,IAAI9M,EAASyN,MACX;;;;gBAMF,eAAI7N,OAAO8N,WACT;;;;;;;;gBAWF,IAAMC,IAAKhB,WAaLiB,IAAa5N,EAAS0M,GAAciB,IACpCE,IAAmB,IAAID,KAAcA,IAAa,IAGlDE,IAAiB9N,EAAS+N,GAAkBJ,IAC5CK,IAAuB,IAAIF,KAAkBA,IAAiB;;;;;;;;;gBAEpE,SACEH,EAAGjpC,QAAQ,WAAW,KACtBipC,EAAGjpC,QAAQ,cAAc,KACzBipC,EAAGjpC,QAAQ,WAAW,KACtBmpC,KACAG;;;;;;WAYJ/wC;;QACE,OACqB,sBAAZgxC,qBAC+B,yBAAtCA,kBAAQC,4CAAKC;;0EAKjBlxC,SACE45B,GACAI;QAEA,OAAOJ,EAAII,MAA0BA;;;;WAKvCh6B,SAAqB0wC;QACnB,IAAMS,IAAkBT,EAAGU,MAAM,oCAC3Bv/B,IAAUs/B,IACZA,EAAgB,GACbzpC,MAAM,KACNvB,MAAM,GAAG,GACTmB,KAAK,OACR;QACJ,OAAOgD,OAAOuH;;;;WAKhB7R,SAAyB0wC;QACvB,IAAMW,IAAsBX,EAAGU,MAAM,sBAC/Bv/B,IAAUw/B,IACZA,EAAoB,GACjB3pC,MAAM,KACNvB,MAAM,GAAG,GACTmB,KAAK,OACR;QACJ,OAAOgD,OAAOuH;OAmBhB7R,iBAAAA,SACEsxC;QAEApxC,KAAKijC,GAAGoO,kBAAmBhN,SAAAA;YAClB+M,OAAAA,EAAsB/M;;oCAIjCvkC,SACEynC,GACA+J,GACAC;;;;;;oBAEMC,IAAoB,eAATjK,GACbkK,IAAgB;;;;;kCAGhBA,GAEIre,IAAc8Z,GAAoB0C,KACtC5vC,EAAKijC,IACLuO,IAAW,aAAa,aACxBF;;;;;;mEAGMI,IAAsBH,EAAcne,GACvCwQ,OAAM7U,SAAAA;;2CAELqE,EAAYue,MAAM5iB,IAKXoD,GAAmBC,OAAUrD;oCAErCohB,cAIHuB,EAAoB9N,OAAM,iCAKpBxQ,EAAYwe;;;;;;;0CACXF;;;gCAkBP,qBAVMG,IACW,oBAAf9iB,EAAMrtB,QACN+vC,IA7RsB,GA8RxB5rB,GApSQ,YAsSN,oDACAkJ,EAAMxtB,SACNswC;gCAGGA;2CACI7vC,QAAQowB,OAAOrD;;;;;;;;;;;;;;;;;;;;;;;;OAM9BjvB,oBAAAA;QACEE,KAAKijC,GAAGa;;;IAaVhkC,WAAoBgyC;kBAAAA,GAHpB9xC,cACAA,UAAsC;;WAItC+xC;aAAAA;YACE,OAAO/xC,KAAKgyC;;;;QAGdC;aAAAA;YACE,OAAOjyC,KAAKg7B;;;;QAGdhO;aAAAA,SAAWprB;YACT5B,KAAK8xC,KAAWlwC;;;;;;;;IAMlB9B,mBAAAA;QACEE,KAAKgyC;;;;;;IAOPlyC,iBAAAA,SAAKiJ;QACH/I,KAAKg7B,KAAUjyB;;;;;;;IAQjBjJ,qBAAAA;QACE,OAAOswC,GAAkBpwC,KAAK8xC,GAASp+B;;;IAgCzC5T,WAAYuiB;QAAZviB;gBACE0B,IAAAA,aAAMpB,EAAKgB,aAAa,mCAAmCihB,mBAHtD;;;WADsCjf;EAAAA;;;;;;;;;;;sEAS/B6hC,GAA4BhW;;;IAG1C,OAAkB,gCAAXA,EAAEvtB;;;;;;;IAuBT5B,WAA6BszB;QAA7BtzB;QAA6BE,mBAAAozB,GAfrBpzB;;;;QAKRA,UAAsC,IAAIkyC,IAWxClyC,KAAKozB,YAAY+e,aAAa;YAC5BnyC,EAAKoyC,GAAmBnwC;WAE1BjC,KAAKozB,YAAYif,UAAU;YACrBjf,EAAYrE,QACd/uB,EAAKoyC,GAAmBhgB,OACtB,IAAIkgB,GAA0Blf,EAAYrE,UAG5C/uB,EAAKoyC,GAAmBnwC;WAG5BjC,KAAKozB,YAAY2c,UAAW1L,SAAAA;YAC1B,IAAMtV,IAAQwjB,GACXlO,EAAM3pB,OAA4BqU;YAErC/uB,EAAKoyC,GAAmBhgB,OAAO,IAAIkgB,GAA0BvjB;;;oBAzBjEjvB,SACEmjC,GACAsE,GACA2G;QAEA,OAAO,IAAIhB,EAAoBjK,EAAG7P,YAAY8a,GAAkB3G;OAwBlEiL;aAAAA;YACE,OAAOxyC,KAAKoyC,GAAmBrb;;;;QAGjCj3B,oBAAAA,SAAMivB;QACAA,KACF/uB,KAAKoyC,GAAmBhgB,OAAOrD,IAG5B/uB,KAAKyyC,YACR5sB,GAlcU,YAocR,yBACAkJ,IAAQA,EAAMxtB,UAAU;QAE1BvB,KAAKyyC,cACLzyC,KAAKozB,YAAYue;;;;;;;;;;;IAarB7xC,oBAAAA,SACE4yC;QAEA,IAAM5Y,IAAQ95B,KAAKozB,YAAYib,YAAYqE;QAE3C,OAAO,IAAIC,GAAkC7Y;;;IAkB/Ch6B,WAAoBg6B;QAAA95B,aAAA85B;;WAWpBh6B,kBAAAA,SACE8yC,GACAhxC;QAEA,IAAI8tC;QAQJ,kBAPI9tC,KACFikB,GA7fU,YA6fQ,OAAO7lB,KAAK85B,MAAMp4B,MAAMkxC,GAAYhxC,IACtD8tC,IAAU1vC,KAAK85B,MAAMT,IAAIz3B,GAAOgxC,OAEhC/sB,GAhgBU,YAggBQ,OAAO7lB,KAAK85B,MAAMp4B,MAAM,cAAckxC;QACxDlD,IAAU1vC,KAAK85B,MAAMT,IAAIuZ,KAEpBxC,GAAkBV;;;;;;;;;IAU3B5vC,kBAAAA,SAAI8B;QAGF,OAFAikB,GA9gBY,YA8gBM,OAAO7lB,KAAK85B,MAAMp4B,MAAME,GAAOA,IAE1CwuC,GADSpwC,KAAK85B,MAAMpb,IAAI9c;;;;;;;;;IAWjC9B,kBAAAA,SAAIiJ;QAAJjJ;;;gBAIE,OAAOswC,GAHSpwC,KAAK85B,MAAMh3B,IAAIiG,IAGEV,MAAKuG,SAAAA;;8BAEhCA,MACFA,IAAS,OAEXiX,GAniBU,YAmiBQ,OAAO7lB,EAAK85B,MAAMp4B,MAAMqH,GAAK6F,IACxCA;;OAIX9O,qBAAAA,SAAOiJ;QAGL,OAFA8c,GAziBY,YAyiBM,UAAU7lB,KAAK85B,MAAMp4B,MAAMqH,IAEtCqnC,GADSpwC,KAAK85B,MAAMpmB,OAAO3K;;;;;;;;IAUpCjJ,oBAAAA;QAGE,OAFA+lB,GArjBY,YAqjBM,SAAS7lB,KAAK85B,MAAMp4B,OAE/B0uC,GADSpwC,KAAK85B,MAAMhxB;OAO7BhJ,iBAAAA,SACE+yC,GACA50B;QAEA,IAAM+O,IAAShtB,KAAKgtB,OAAOhtB,KAAKqW,QAAQw8B,GAAc50B,KAChDsT,IAAuB;QAC7B,OAAOvxB,KAAK8yC,GAAc9lB,IAAQ,SAACjkB,GAAKnH;YACtC2vB,EAAQlrB,KAAKzE;YACZyG,MAAK;YACCkpB,OAAAA;;OAOXzxB,iBAAAA,SACE+yC,GACA50B;QAEA4H,GAjlBY,YAilBM,cAAc7lB,KAAK85B,MAAMp4B;QAC3C,IAAM2U,IAAUrW,KAAKqW,QAAQw8B,GAAc50B;QAC3C5H,EAAQ08B;QACR,IAAM/lB,IAAShtB,KAAKgtB,OAAO3W;QAC3B,OAAOrW,KAAK8yC,GAAc9lB,IAAQ,SAACjkB,GAAKnH,GAAOu5B;YAOtCA,OAAAA,EAAQznB;;OAuBnB5T,iBAAAA,SACEkzC,GACAthB;QAEA,IAAIrb;QACCqb,IAIHrb,IAAU28B,KAHV38B,IAAU,IACVqb,IAAWshB;QAIb,IAAMhmB,IAAShtB,KAAKgtB,OAAO3W;QAC3B,OAAOrW,KAAK8yC,GAAc9lB,GAAQ0E;;;;;;;;;;IAWpC5xB,iBAAAA,SACE4xB;QAEA,IAAMuhB,IAAgBjzC,KAAKgtB,OAAO;QAClC,OAAO,IAAImF,IAAmB,SAAClwB,GAASmwB;YACtC6gB,EAAclD,UAAW1L,SAAAA;gBACvB,IAAMtV,IAAQwjB,GACXlO,EAAM3pB,OAA4BqU;gBAErCqD,EAAOrD;eAETkkB,EAAcpD,YAAaxL,SAAAA;gBACzB,IAAMrX,IAA8BqX,EAAM3pB,OAAsB9L;gBAC3Doe,IAKL0E,EAAS1E,EAAOkmB,YAAuBlmB,EAAOprB,OAAOyG,MACnD8qC,SAAAA;oBACMA,IACFnmB,EAAOomB,aAEPnxC;sBATJA;;;OAiBAnC,iBAAAA,SACNmzC,GACAtsC;QAEA,IAAM4qB,IAA2C;QACjD,OAAO,IAAIY,IAAmB,SAAClwB,GAASmwB;YACtC6gB,EAAclD,UAAW1L,SAAAA;gBACvBjS,EAAQiS,EAAM3pB,OAAsBqU;eAEtCkkB,EAAcpD,YAAaxL,SAAAA;gBACzB,IAAMrX,IAA8BqX,EAAM3pB,OAAsB9L;gBAChE,IAAKoe,GAAL;oBAIA,IAAMqmB,IAAa,IAAIC,GAAoBtmB,IACrCumB,IAAa5sC,EACjBqmB,EAAOkmB,YACPlmB,EAAOprB,OACPyxC;oBAEF,IAAIE,aAAsBphB,IAAoB;wBAC5C,IAAMqhB,IAAwCD,EAAW3P,OACvDnR,SAAAA;mCACE4gB,EAAW7gB,QACJL,GAAmBC,OAAOK;;wBAGrClB,EAAQlrB,KAAKmtC;;oBAEXH,EAAW1hB,KACb1vB,MACkC,SAAzBoxC,EAAWI,KACpBzmB,EAAOomB,aAEPpmB,EAAOomB,SAASC,EAAWI;uBAvB3BxxC;;YA0BHoG,MAAK;YACC8pB,OAAAA,GAAmBY,GAAQxB;;OAI9BzxB,sBAAAA,SACN+yC,GACA50B;QAEA,IAAIy1B;QAYJ,kBAXIb,MAC0B,mBAAjBA,IACTa,IAAYb,IAMZ50B,IAAQ40B,IAGL;YAAErsC,OAAOktC;YAAWz1B,OAAAA;;OAGrBne,qBAAAA,SAAOuW;QACb,IAAI8W,IAAgC;QAIpC,IAHI9W,EAAQimB,YACVnP,IAAY,SAEV9W,EAAQ7P,OAAO;YACjB,IAAMA,IAAQxG,KAAK85B,MAAMtzB,MAAM6P,EAAQ7P;YACvC,OAAI6P,EAAQ08B,KACHvsC,EAAMmtC,cAAct9B,EAAQ4H,OAAOkP,KAEnC3mB,EAAMotC,WAAWv9B,EAAQ4H,OAAOkP;;QAGzC,OAAOntB,KAAK85B,MAAM8Z,WAAWv9B,EAAQ4H,OAAOkP;;;;;;;;;;;;;;;;;;SASzCijB,GAAeV;IACtB,OAAO,IAAIvd,IAAsB,SAAClwB,GAASmwB;QACzCsd,EAAQG,YAAaxL,SAAAA;YACnB,IAAMz1B,IAAUy1B,EAAM3pB,OAAsB9L;YAC5C3M,EAAQ2M;WAGV8gC,EAAQK,UAAW1L,SAAAA;YACjB,IAAMtV,IAAQwjB,GACXlO,EAAM3pB,OAA4BqU;YAErCqD,EAAOrD;;;;;;IAMT8kB;;AACJ,SAAStB,GAA0BxjB;IACjC,IAAM0hB,IAAa5N,GAAS0M,GAAcC;IAC1C,IAAIiB,KAAc,QAAQA,IAAa,IAAI;QACzC,IAAMqD,IACJ;QACF,IAAI/kB,EAAMxtB,QAAQgG,QAAQusC,MAAc,GAAG;;YAEzC,IAAMC,IAAW,IAAI3wC,EACnB,YACA,+CAA6C0wC;YAY/C,OARKD,OACHA;;;YAGAG,YAAW;gBACT,MAAMD;gBACL,KAEEA;;;IAGX,OAAOhlB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;IC/tBPjvB,WACmBm0C,GACRhd,GACAid,GACQl7B,GACAm7B;kBAJAF,aACRhd,aACAid,GACQl0C,UAAAgZ,aACAm7B,GAPnBn0C,UAA4B,IAAIkyC;QAmFhClyC,YAAOA,KAAKo0C,GAASrd,QAAQh0B,KAAKsxC,KAAKr0C,KAAKo0C,GAASrd;;;;QAvEnD/2B,KAAKo0C,GAASrd,QAAQ6M,OAAMnR,SAAAA;;;;;;;;;;;;;;;;kBAiB9B3yB,SACEm0C,GACAhd,GACAqd,GACAt7B,GACAm7B;QAEA,IACMI,IAAY,IAAIC,EACpBP,GACAhd,GAHiBzyB,KAAKC,QAAQ6vC,GAK9Bt7B,GACAm7B;QAGF,OADAI,EAAUj2B,MAAMg2B,IACTC;;;;;;IAODz0C,oBAAAA,SAAMw0C;QAANx0C;QACNE,KAAKy0C,KAAcT,YAAW;YAAMh0C,OAAAA,EAAK00C;YAAsBJ;;;;;;IAOjEx0C,iBAAAA;QACE,OAAOE,KAAK00C;;;;;;;;;IAUd50C,qBAAAA,SAAO+jC;QACoB,SAArB7jC,KAAKy0C,OACPz0C,KAAK20C,gBACL30C,KAAKo0C,GAAShiB,OACZ,IAAIhvB,EACFhD,EAAKE,WACL,yBAAyBujC,IAAS,OAAOA,IAAS;OAQlD/jC,iBAAAA;QAAAA;QACNE,KAAKi0C,GAAWzP,IAAiB;YACN,OAAA,SAArBxkC,EAAKy0C,MACPz0C,EAAK20C,gBACE30C,EAAKgZ,KAAKjW,MAAK6L,SAAAA;gBACb5O,OAAAA,EAAKo0C,GAASnyC,QAAQ2M;mBAGxB5M,QAAQC;;OAKbnC,2BAAAA;QACmB,SAArBE,KAAKy0C,OACPz0C,KAAKm0C,GAAgBn0C,OACrB20C,aAAa30C,KAAKy0C,KAClBz0C,KAAKy0C,KAAc;;;IAuCvB30C;QAAAA;;gBAhCAE,UAAiCgC,QAAQC;;;QAIzCjC,UAAuCgC,QAAQC;;;QAI/CjC;;;QAIAA,UAA8D;;QAG9DA,UAAwB;;;QAIxBA;;QAGAA,UAAoC;;QAGpCA,UAAkB,IAAI40C,GAAmB50C;;;;QAKzCA,UAA4B;YAAYA,OAAAA,EAAK60C,GAAQC;;QAGnD,IAAMrS,IAASj5B,GAAgBC,KAAcg5B;QACzCA,KAA6C,qBAA5BA,EAAO4F,oBAC1B5F,EAAO4F,iBAAiB,oBAAoBroC,KAAK+0C;;WAMrDC;;;aAAAA;YACE,OAAOh1C,KAAKi1C;;;;;;;;;IAOdn1C,iBAAAA,SAAoCkZ;;QAElChZ,KAAKk1C,QAAQl8B;;;;;;IAOflZ,iBAAAA,SACEkZ;QAEAhZ,KAAKm1C;;QAELn1C,KAAKo1C,GAAgBp8B;;;;;;IAOflZ,iBAAAA,SACNkZ;QAGA,OADAhZ,KAAKm1C,MACEn1C,KAAKo1C,GAAgBp8B;;;;;;;;;qBAU9BlZ,SAAiCkZ;;;;;;2BAC/BhZ,KAAKm1C,MACAn1C,KAAKi1C,4BACRj1C,KAAKi1C,UACCxS,IAASj5B,GAAgBC,KAAcg5B,WAE3CA,EAAO+F,oBAAoB,oBAAoBxoC,KAAK+0C;oCAEhD/0C,KAAKq1C,GAAyBr8B;;;;;;;;;;;;;;;IAQxClZ,sBAAAA,SAA2BkZ;QAEzB,OADAhZ,KAAKm1C,MACDn1C,KAAKi1C,KAEA,IAAIjzC,SAAWC,SAAAA,UAEjBjC,KAAKo1C,GAAgBp8B;;;;;;;;;;IAW9BlZ,iBAAAA,SAAiBkZ;QAAjBlZ;QACEE,KAAKm1C,MAEDn1C,KAAKi1C,OAITj1C,KAAKs1C,KAAgBt1C,KAAKs1C,GAAcvyC,MAAK;YAC3C,IAAMqxC,IAAW,IAAIlC,IACfqD,IAAavR;;;;;;+EAEThrB;;;6CACNo7B,EAASnyC,WACTjC,KAAK60C,GAAQxd;;;4BAEb,KAAI4N,kBAKF,MADAmP,EAASnyC,WACHgtB;;+DAJNpJ,GA3TI,cA2Tc,4CAA4CoJ;4BAC9DjvB,KAAK60C,GAAQW,GAAcD;;;;;;;;YAQjC,OADAv1C,EAAKwkC,GAAiB+Q,IACfnB,EAASrd;;OAIZj3B,iBAAAA,SAAmCkZ;QAAnClZ,cACA21C,IAAUz1C,KAAK01C,GAAK3yC,MAAK;mBAC7B/C,EAAK21C,SACE38B,IACJ4qB,OAAO7U,SAAAA;;;;gBASN,MARA/uB,EAAKkvB,KAAUH,GACf/uB,EAAK21C,SAELt6B,GAAS,8BADO0T,EAAM6mB,SAAS7mB,EAAMxtB,WAAW;gBAM1CwtB;gBAEPhsB,MAAK6L,SAAAA;uBACJ5O,EAAK21C,SACE/mC;;;QAIb,OADA5O,KAAK01C,KAAOD,GACLA;;;;;;;IAQT31C,iBAAAA,SACEm3B,GACAqd,GACAt7B;QAHFlZ;QAKEE,KAAKm1C;;QAQDn1C,KAAK61C,GAAetuC,QAAQ0vB,MAAY,MAC1Cqd,IAAU;QAGZ,IAAMC,IAAYC,GAAiBsB,GACjC91C,MACAi3B,GACAqd,GACAt7B,IACA+8B,SAAAA;YACE/1C,OAAAA,EAAKg2C,GAAuBD;;QAGhC,OADA/1C,KAAKi2C,GAAkB5vC,KAAKkuC,IACrBA;OAGDz0C,iBAAAA;QACFE,KAAKkvB,MACPtpB;;;;;;;;IAaJ9F,iBAAAA;;;;;qBAWAA;;;;;;2CAOIo2C,IAAcl2C,KAAK01C;;;;;;wBAEZQ,MAAgBl2C,KAAK01C;;;;;;;;;;;;;IAOhC51C,iBAAAA,SAAyBm3B;QACvB,KAAiBj3B,WAAAA,IAAAA,KAAKi2C,IAALj2C,cAAAA;YACf,SAAOi3B,OAAYA,GACjB;;QAGJ;;;;;;;;;IAUFn3B,iBAAAA,SAA6Bq2C;QAA7Br2C;;gBAEE,OAAOE,KAAKo2C,KAAQrzC,MAAK;;YAEvB/C,EAAKi2C,GAAkB7nC,MAAK,SAACioC,GAAGC;gBAAMD,OAAAA,EAAEnC,KAAeoC,EAAEpC;;YAEzD,KAAiBl0C,WAAAA,IAAAA,EAAKi2C,IAALj2C,cAAAA;gBAAZ,IAAMgZ;gBAET,IADAA,EAAG+e,0BACCoe,KAA+Bn9B,EAAGie,OAAYkf,GAChD;;YAIJ,OAAOn2C,EAAKo2C;;;;;;IAOhBt2C,iBAAAA,SAAqBm3B;QACnBj3B,KAAK61C,GAAexvC,KAAK4wB;;8DAInBn3B,iBAAAA,SAAuBkZ;;QAE7B,IAAMxS,IAAQxG,KAAKi2C,GAAkB1uC,QAAQyR;QAE7ChZ,KAAKi2C,GAAkBzlB,OAAOhqB,GAAO;;;;;;;;SAQzB+vC,GACdtnB,GACAT;IAGA,IADAnT,GArec,cAqeOmT,WAAQS,IACzBgW,GAA4BhW,IAC9B,OAAO,IAAI7rB,EAAehD,EAAKgB,aAAgBotB,WAAQS;IAEvD,MAAMA;;;;;;;;;;;;;;;;;;aChaDunB;QACNC,UAAWC,UACXC,UAAWC,UAENC,IAAS5xC,GAAoBwxC,GAAWE;IAC9C,OAAe,MAAXE,IAGK5xC,GAAoByxC,GAAQE,KAE5BC;;;;;;;;IAgBT/2C,WAA6Bg3C;kBAAAA,GANrB92C,cAAiC,IAAI2e,GAC3C63B,KAGFx2C,UAAwB;;WAIhBF,iBAAAA;QACN,SAASE,KAAK+2C;OAGhBj3C,iBAAAA,SAAW+a;QACT,IAAM4e,IAAqB,EAAC5e,GAAgB7a,KAAKg3C;QACjD,IAAIh3C,KAAK8J,OAAOvD,OAAOvG,KAAK82C,IAC1B92C,KAAK8J,SAAS9J,KAAK8J,OAAO4U,IAAI+a,SACzB;YACL,IAAMwd,IAAej3C,KAAK8J,OAAOgxB;YAC7B0b,GAAsB/c,GAAOwd,KAAgB,MAC/Cj3C,KAAK8J,SAAS9J,KAAK8J,OAAO4J,OAAOujC,GAAcv4B,IAAI+a;;OAKzDyd;aAAAA;;;;;;;YAOE,OAAOl3C,KAAK8J,OAAOgxB,OAAQ;;;;;KAiBzBqc,KAA6B;IACjCC;IACAC,IAA0B;IAC1BC,IAAgB;IAChBC,IAAkB;;IA8BlBz3C;;;IAGW03C;;IAEAC;;;IAGAC;kBALAF,aAEAC,aAGAC;;kBA5BX53C,SAAqB63C;QACnB,OAAO,IAAIC,EACTD,GACAC,EAAUC,IACVD,EAAUE;;;;AAVdF,SAAuC,GACvCA,QAA2C,SAC3CA,QAA2C,UAC3CA,QAAwD,IACxDA,QAAkE,KAUlEA,QAAqC,IAAIA,GACvCA,GAAUG,IACVH,GAAUC,IACVD,GAAUE;AAGIF,cAAsB,IAAIA,GACxCA,GAAUI,IACV,GACA;;;;;;;IA4BFl4C,WACmBipC,GACAkL;kBADAlL,aACAkL,GALnBj0C,cAOEA,KAAKi4C,KAAS;;WAGhBn4C,oBAAAA,SAAMo4C;QAMFl4C,KAAK+oC,GAAiBD,GAAO0O,OAC7BI,GAAUI,MAEVh4C,KAAKm4C,GAAWD;OAIpBp4C,mBAAAA;QACME,KAAKi4C,OACPj4C,KAAKi4C,GAAO1gB,UACZv3B,KAAKi4C,KAAS;OAIlB7Q;aAAAA;YACE,OAAuB,SAAhBpnC,KAAKi4C;;;;QAGNn4C,iBAAAA,SAAWo4C;QAAXp4C,cAKAs4C,IAAQp4C,KAAKq4C,KA9CK,MAFA;QAiDxBxyB,GACE,uBACA,qCAAmCuyB,WAErCp4C,KAAKi4C,KAASj4C,KAAKi0C,GAAWnc,yDAE5BsgB,IACApU;;;;;;wBACEhkC,KAAKi4C,KAAS,MACdj4C,KAAKq4C;;;2EAEGH,EAAWI,GAAet4C,KAAK+oC;;;;;;+BAEjC9D,oBACFpf,GAlPI,uBAoPF,wDACAoJ;;;;+CAGIspB,GAAyBtpB;;;;;;;;;+CAG7BjvB,KAAKm4C,GAAWD;;;;;;;;;;IAQ5Bp4C,WACmB04C,GACR1P;kBADQ0P,aACR1P;;;WAIXhpC,iBAAAA,SACE45B,GACA+e;QAEA,OAAOz4C,KAAKw4C,GAASE,GAAuBhf,GAAKrxB,MAAKo2B,SAAAA;YAC7C55B,OAAAA,KAAKC,MAAO2zC,IAAa,MAASha;;;iFAK7C3+B,iBAAAA,SACE45B,GACA1c;QAFFld;QAIE,IAAU,MAANkd,GACF,OAAOmV,GAAmBlwB,QAAQ60B,GAAe+Q;QAGnD,IAAM/9B,IAAS,IAAI6uC,GAA4B37B;QAC/C,OAAOhd,KAAKw4C,GACTj1B,GAAcmW,IAAKhf,SAAAA;YAAU5Q,OAAAA,EAAO8uC,GAAWl+B,EAAOG;YACtDxS,MAAK;YACGrI,OAAAA,EAAKw4C,GAASjP,GACnB7P,IACA7e,SAAAA;gBAAkB/Q,OAAAA,EAAO8uC,GAAW/9B;;YAGvCxS,MAAK;YAAMyB,OAAAA,EAAOotC;;;;;;;IAOvBp3C,iBAAAA,SACE45B,GACAmF,GACAC;QAEA,OAAO9+B,KAAKw4C,GAAS9O,GAAchQ,GAAKmF,GAAYC;;;;;;IAOtDh/B,iBAAAA,SACE45B,GACAmF;QAEA,OAAO7+B,KAAKw4C,GAASK,GAAwBnf,GAAKmF;OAGpD/+B,iBAAAA,SACE45B,GACAoF;QAFFh/B;QAIE,OACEE,KAAK8oC,GAAO0O,OAAiCI,GAAUI,MAEvDnyB,GAAS,uBAAuB;QACzBsM,GAAmBlwB,QAAQk1C,OAG7Bn3C,KAAK84C,GAAapf,GAAKrxB,MAAKsvC,SAAAA;YAC7BA,OAAAA,IAAY33C,EAAK8oC,GAAO0O,MAC1B3xB,GACE,uBACA,4CAA0C8xB,kCACb33C,EAAK8oC,GAAO0O;YAEpCL,MAEAn3C,EAAK+4C,GAAqBrf,GAAKoF;;OAK5Ch/B,iBAAAA,SAAa45B;QACX,OAAO15B,KAAKw4C,GAASM,GAAapf;OAG5B55B,iBAAAA,SACN45B,GACAoF;QAFMh/B,IAIFk5C,GACAC,GAAkCC,GAElCC,GACFC,GACAC,GACAC,aACIC,IAAU/0C,KAAKC;QACrB,OAAOzE,KAAKw5C,GAAqB9f,GAAK15B,KAAK8oC,GAAO2O,IAC/CpvC,MAAKoxC,SAAAA;;mBAEAA,IAAkBz5C,EAAK8oC,GAAO4O,MAChC7xB,GACE,uBACA,gEACuB7lB,EAAK8oC,GAAO4O,gBACzB+B;YAEZR,IAA2Bj5C,EAAK8oC,GAC7B4O,MAEHuB,IAA2BQ,GAE7BN,IAAmB30C,KAAKC,OAEjBzE,EAAK05C,GAAkBhgB,GAAKuf;YAEpC5wC,MAAKw2B,SAAAA;mBACJma,IAA2Bna,GAC3Bua,IAAoB50C,KAAKC,OAElBzE,EAAK0pC,GACVhQ,GACAsf,GACAla;YAGHz2B,MAAKsxC,SAAAA;mBACJT,IAAiBS,GACjBN,IAAmB70C,KAAKC,OAEjBzE,EAAK64C,GAAwBnf,GAAKsf;YAE1C3wC,MAAKuxC,SAAAA;YAiBJ,OAhBAN,IAAqB90C,KAAKC,OAEtB2pB,QAAiBK,WAASC,SAW5B7I,GAAS,uBATP,mDACwBszB,IAAmBI,+CACPN,cACjCG,IAAoBD,wBACVD,sBACVG,IAAmBD,wBACTQ,wBACVN,IAAqBD,+BACLC,IAAqBC;YAIrCpnB,GAAmBlwB,QAAoB;gBAC5Cm1C;gBACAC,IAA0B4B;gBAC1B3B,IAAA4B;gBACA3B,IAAAqC;;;;;IChQR95C;;IAEY+5C,GACFC,GACRC;QAFU/5C,mBAAA65C,aACFC;;;;;;;QApBV95C,UAA+B,IAAI0b,GACjCzW;;;QAKFjF,UAA2B,IAAIgzB,IAA4BgnB,SAAAA;YACzDA,OAAAA,EAAE1rC;;;;;;;QAQJtO,UAAuCsF,EAAgByB,OAYrD/G,KAAKg0B,KAAgB6lB,EAAYI,GAAiBF,IAClD/5C,KAAKk6C,KAAkBL,EAAY7P,MACnChqC,KAAKsiC,KAAcuX,EAAY1Q,MAC/BnpC,KAAKm6C,KAAiB,IAAIC,GACxBp6C,KAAKk6C,IACLl6C,KAAKg0B,IACLh0B,KAAK65C,YAAYQ;QAEnBr6C,KAAK85C,GAAYQ,GAAsBt6C,KAAKm6C;;;WAI9Cr6C,oBAAAA;QACE,OAAOkC,QAAQC;;;;;;;;;;qBAWjBnC,SAAuB+B;;;;;;2BACjB04C,IAAmBv6C,KAAKg0B,IACxBwmB,IAAoBx6C,KAAKm6C,oBAERn6C,KAAK65C,YAAYrW,eACpC,sBACA,aACA9J,SAAAA;;;wBAGE,IAAI+gB;wBACJ,OAAOz6C,EAAKg0B,GACT0mB,GAAsBhhB,GACtBrxB,MAAKsyC,SAAAA;mCACJF,IAAaE,GAEbJ,IAAmBv6C,EAAK65C,YAAYI,GAAiBp4C;;;4BAIrD24C,IAAoB,IAAIJ,GACtBp6C,EAAKk6C,IACLK,GACAv6C,EAAK65C,YAAYQ,OAEZE,EAAiBG,GAAsBhhB;4BAE/CrxB,MAAKuyC,SAAAA;4BAOJ,KANA,IAAMC,IAA6B,IAC7BC,IAA2B,IAG7BC,IAAct7B,aAEEg7B;;8BAAAA,cAAAA,KAAY;gCAA3B,IAAMtpB;gCACT0pB,EAAgBx0C,KAAK8qB,EAAMV;gCAC3B,KAAuBU,WAAAA,IAAAA,EAAMR,WAANQ,cAAAA;oCAAlB,IAAMjI;oCACT6xB,IAAcA,EAAYr8B,IAAIwK,EAASngB;;;4BAI3C,KAAoB6xC,WAAAA,OAAAA,cAAAA,KAAY;gCAA3B,IAAMzpB;gCACT2pB,EAAcz0C,KAAK8qB,EAAMV;gCACzB,KAAuBU,WAAAA,IAAAA,EAAMR,WAANQ,cAAAA;oCAAlB,IAAMjI;oCACT6xB,IAAcA,EAAYr8B,IAAIwK,EAASngB;;;;;wDAM3C,OAAOyxC,EACJQ,GAAathB,GAAKqhB,GAClB1yC,MAAK4yC,SAAAA;;oCAEFC,IAAAD;oCACAE,IAAAN;oCACAO,IAAAN;;;;;;;oBAWd,OA/DMlsC,gCA2DN5O,KAAKg0B,KAAgBumB,GACrBv6C,KAAKm6C,KAAiBK,GACtBx6C,KAAK85C,GAAYQ,GAAsBt6C,KAAKm6C;oBAErCvrC;;;;;yEAIT9O,iBAAAA,SAAW6wB;QAAX7wB,IAOMu7C,aANEvwC,IAAiBxG,EAAUG,OAC3ByJ,IAAOyiB,EAAUhE,QACrB,SAACze,GAAM+iB;YAAM/iB,OAAAA,EAAKwQ,IAAIuS,EAAEloB;YACxB0W;QAKF,OAAOzf,KAAK65C,YACTrW,eAAe,2BAA2B,cAAa9J,SAAAA;YAI/C15B,OAAAA,EAAKm6C,GAAea,GAAathB,GAAKxrB,GAAM7F,MAAKqY,SAAAA;gBACtD26B,IAAe36B;gBASf;;;;;;gBAFA,IAAMgQ,IAA4B,WAEXC,OAAAA,cAAAA,KAAW;oBAA7B,IAAMzH,UACHpY,IAAYoY,EAASoyB,GACzBD,EAAav4C,IAAIomB,EAASngB;oBAEX,QAAb+H;;;;oBAIF4f,EAAcrqB,KACZ,IAAI6M,GACFgW,EAASngB,KACT+H,GACAiF,GAAiBjF,EAAU8D,MAAenK,WAC1CsH,GAAaD;;gBAMrB,OAAO9R,EAAKg0B,GAAcunB,GACxB7hB,GACA5uB,GACA4lB,GACAC;;YAIL5tB,MAAKouB,SAAAA;YACJ,IAAM3Q,IAAU2Q,EAAMqqB,GAAwBH;YAC9C,OAAO;gBAAE5qB,SAASU,EAAMV;gBAASgrB,IAAAj7B;;;;;;;;;;;;;;;;;;IAkBvC1gB,iBAAAA,SACE+wB;QADF/wB;QAGE,OAAOE,KAAK65C,YAAYrW,eACtB,qBACA,sBACA9J,SAAAA;YACE,IAAMgiB,IAAW7qB,EAAYM,MAAMjjB,QAC7BytC,IAAiB37C,EAAKk6C,GAAgBjQ,GAAgB;gBAC1D2R;;YAEF,OAAO57C,EAAKg0B,GACT6nB,GAAiBniB,GAAK7I,EAAYM,OAAON,EAAYQ,aACrDhpB,MAAK;gBACJrI,OAAAA,EAAK87C,GAA4BpiB,GAAK7I,GAAa8qB;gBAEpDtzC,MAAK;gBAAMszC,OAAAA,EAAevrC,MAAMspB;gBAChCrxB,MAAK;gBAAMrI,OAAAA,EAAKg0B,GAAc+nB,GAAwBriB;gBACtDrxB,MAAK;gBAAMrI,OAAAA,EAAKm6C,GAAea,GAAathB,GAAKgiB;;;;;;;;;;IAW1D57C,iBAAAA,SAAY2wB;QAAZ3wB;QACE,OAAOE,KAAK65C,YAAYrW,eACtB,gBACA,sBACA9J,SAAAA;YACE,IAAIsiB;YACJ,OAAOh8C,EAAKg0B,GACTsX,GAAoB5R,GAAKjJ,GACzBpoB,MAAM8oB,SAAAA;uBA1WU9tB,GA2WM,SAAV8tB,IACX6qB,IAAe7qB,EAAMjjB,QACdlO,EAAKg0B,GAAcqY,GAAoB3S,GAAKvI;gBAEpD9oB,MAAK;gBACGrI,OAAAA,EAAKg0B,GAAc+nB,GAAwBriB;gBAEnDrxB,MAAK;gBACGrI,OAAAA,EAAKm6C,GAAea,GAAathB,GAAKsiB;;;;;;;;IAUvDl8C,iBAAAA;QAAAA;QACE,OAAOE,KAAK65C,YAAYrW,eACtB,uCACA,aACA9J,SAAAA;YACS15B,OAAAA,EAAKg0B,GAAcioB,GAAgCviB;;;wEAMhE55B,iBAAAA;QAAAA;QACE,OAAOE,KAAK65C,YAAYrW,eACtB,yBACA,aACA9J,SAAAA;YACS15B,OAAAA,EAAKg0B,GAAckoB,GAAmBxiB;;;;;;;;IAUnD55B,iBAAAA,SAAmBuxB;QAAnBvxB;QACE,OAAOE,KAAK65C,YAAYrW,eACtB,yBACA,sBACA9J,SAAAA;YACS15B,OAAAA,EAAKg0B,GAAcmoB,GAAmBziB,GAAKrI;;;;;;;IASxDvxB,iBAAAA;QAAAA;QACE,OAAOE,KAAK65C,YAAYrW,eACtB,oCACA,aACA9J,SAAAA;YAAO15B,OAAAA,EAAKsiC,GAAY8Z,GAA6B1iB;;;;;;;;;;;IAYzD55B,iBAAAA,SAAiBolB;QAAjBplB,cACQu8C,IAAgBn3B,EAAYpK,IAC9BwhC,IAA2Bt8C,KAAKu8C;QAEpC,OAAOv8C,KAAK65C,YACTrW,eAAe,sBAAsB,sBAAqB9J,SAAAA;YACzD,IAAMiiB,IAAiB37C,EAAKk6C,GAAgBjQ,GAAgB;gBAC1D2R;;;wBAIFU,IAA2Bt8C,EAAKu8C;YAEhC,IAAMzpB,IAAW;YACjB5N,EAAY7D,GAAclb,SAAQ,SAACia,GAAQzF;gBACzC,IAAM6hC,IAAgBF,EAAyBx5C,IAAI6X;gBACnD,IAAK6hC,GAAL;;;;oBAOA1pB,EAASzsB,KACPrG,EAAKsiC,GACFma,GAAmB/iB,GAAKtZ,EAAO0B,IAAkBnH,GACjDtS,MAAK;wBACGrI,OAAAA,EAAKsiC,GAAYoa,GACtBhjB,GACAtZ,EAAOwB,IACPjH;;oBAKR,IAAMK,IAAcoF,EAAOpF;;wCAE3B,IAAIA,EAAY8H,OAAwB,GAAG;wBACzC,IAAM65B,IAAgBH,EACnBI,GAAgB5hC,GAAaqhC,GAC7BjS,GAAmB1Q,EAAIkI;wBAC1B0a,IAA2BA,EAAyB3gC,GAClDhB,GACAgiC;;;wBAMAE,EAAWC,GACTN,GACAG,GACAv8B,MAGF0S,EAASzsB,KACPrG,EAAKsiC,GAAY+H,GAAiB3Q,GAAKijB;;;;YAM/C,IAAI3gB,IAAc9c,MACd69B,IAAct9B;;;;;wBAiElB,IAhEAyF,EAAY3D,GAAgBpb,SAAQ,SAAC4C,GAAK8K;gBACxCkpC,IAAcA,EAAYr+B,IAAI3V;;;;YAKhC+pB,EAASzsB,KACPs1C,EAAennB,WAAWkF,GAAKqjB,GAAa10C,MAAKgzC,SAAAA;gBAC/Cn2B,EAAY3D,GAAgBpb,SAAQ,SAAC4C,GAAK8K;oBACxC,IAAMmpC,IAAc3B,EAAav4C,IAAIiG;;;;;wCAOnC8K,aAAeY,MACfZ,EAAIlC,QAAQnM,QAAQF,EAAgByB;;;;oBAKpC40C,EAAepe,GAAYx0B,GAAKszC,IAChCrgB,IAAcA,EAAYrgB,GAAO5S,GAAK8K,MAEvB,QAAfmpC,KACAnpC,EAAIlC,QAAQnE,EAAUwvC,EAAYrrC,WAAW,KACG,MAA/CkC,EAAIlC,QAAQnE,EAAUwvC,EAAYrrC,YACjCqrC,EAAYxmC,oBAMdmlC,EAAete,GAASxpB,GAAKwoC;oBAC7BrgB,IAAcA,EAAYrgB,GAAO5S,GAAK8K,MAEtCgS,GAhgBA,cAkgBE,uCACA9c,GACA,sBACAi0C,EAAYrrC,SACZ,mBACAkC,EAAIlC;oBAIJuT,EAAY1D,GAAuB/C,IAAI1V,MACzC+pB,EAASzsB,KACPrG,EAAK65C,YAAY7b,GAAkBif,GACjCvjB,GACA3wB;;mBAYPszC,EAAc72C,QAAQF,EAAgByB,QAAQ;gBACjD,IAAMm2C,IAAsBl9C,EAAKsiC,GAC9B8Z,GAA6B1iB,GAC7BrxB,MAAKg2B,SAAAA;oBAQGr+B,OAAAA,EAAKsiC,GAAY6a,GACtBzjB,GACAA,EAAIkI,IACJya;;gBAGNvpB,EAASzsB,KAAK62C;;YAGhB,OAAO/qB,GAAmBY,GAAQD,GAC/BzqB,MAAK;gBAAMszC,OAAAA,EAAevrC,MAAMspB;gBAChCrxB,MAAK;gBACGrI,OAAAA,EAAKm6C,GAAe1lB,GACzBiF,GACAsC;;YAIPj5B,MAAKi5B,SAAAA;mBACJh8B,EAAKu8C,KAAqBD,GACnBtgB;;;;;;;;;;;;;;WAeLl8B,SACN08C,GACAG,GACAv8B;;QAQA,OANA/c,GACEs5C,EAAc3hC,YAAY8H,OAAwB,IAKI,MAApD05B,EAAcxhC,YAAY8H,SAU5B65B,EAAc7hC,GAAgBsiC,MAC9BZ,EAAc1hC,GAAgBsiC,OACfp9C,KAAKq9C,MAUpBj9B,EAAOwB,GAAerb,OACtB6Z,EAAOyB,GAAkBtb,OACzB6Z,EAAO0B,GAAiBvb,OACT;;;;;;;;;;qBAMnBzG,SAA6Bw9C;;;;;;uEAEnBt9C,KAAK65C,YAAYrW,eACrB,0BACA,cACA9J,SAAAA;wBACSvH,OAAAA,GAAmBhsB,QACxBm3C,IACCC,SAAAA;4BACQprB,OAAAA,GAAmBhsB,QACxBo3C,EAAWrnB,KACVntB,SAAAA;gCACC/I,OAAAA,EAAK65C,YAAY7b,GAAkB2B,GACjCjG,GACA6jB,EAAW5iC,UACX5R;gCAEJV,MAAK;gCACL8pB,OAAAA,GAAmBhsB,QACjBo3C,EAAWpnB,KACVptB,SAAAA;oCACC/I,OAAAA,EAAK65C,YAAY7b,GAAkB4B,GACjClG,GACA6jB,EAAW5iC,UACX5R;;;;;;;;;;oBAShB,KAAIk8B,kBAOF,MAAMhW;;;;;+CAFNpJ,GAzpBQ,cAypBU,wCAAwCoJ;;;;oBAM9D,YAAyBquB,OAAAA,cAAAA,KAApBE,UACG7iC,IAAW4iC,EAAW5iC,UAEvB4iC,EAAWz8B,cACRwD,IAAatkB,KAAKu8C,GAAmBz5C,IAAI6X;oBAOzCI,IAA+BuJ,EAAWxJ,IAC1C2iC,IAAoBn5B,EAAWo5B,GACnC3iC;;oBAEF/a,KAAKu8C,KAAqBv8C,KAAKu8C,GAAmB5gC,GAChDhB,GACA8iC;;;;;;;;;;;;IAYR39C,iBAAAA,SAAkB69C;QAAlB79C;QACE,OAAOE,KAAK65C,YAAYrW,eACtB,2BACA,aACA9J,SAAAA;8BACMikB,MACFA,KtBtuBqB,IsBwuBhB39C,EAAKg0B,GAAc4pB,GACxBlkB,GACAikB;;;;;;;IAUR79C,iBAAAA,SAAaiJ;QAAbjJ;QACE,OAAOE,KAAK65C,YAAYrW,eAAe,iBAAiB,aAAY9J,SAAAA;YAC3D15B,OAAAA,EAAKm6C,GAAejlB,GAAYwE,GAAK3wB;;;;;;;;;;;IAYhDjJ,iBAAAA,SAAe4a;QAAf5a;QACE,OAAOE,KAAK65C,YACTrW,eAAe,mBAAmB,cAAa9J,SAAAA;YAC9C,IAAIpV;YACJ,OAAOtkB,EAAKsiC,GACTub,GAAcnkB,GAAKhf,GACnBrS,MAAMy1C,SAAAA;gBACDA,OAAAA;;;;gBAIFx5B,IAAaw5B,GACN3rB,GAAmBlwB,QAAQqiB,MAE3BtkB,EAAKsiC,GAAYyb,GAAiBrkB,GAAKrxB,MAAKsS,SAAAA;2BACjD2J,IAAa,IAAIpJ,GACfR,GACAC,oBAEA+e,EAAIkI,KAEC5hC,EAAKsiC,GACT0b,GAActkB,GAAKpV,GACnBjc,MAAK;wBAAMic,OAAAA;;;;YAKvBvhB,MAAKuhB,SAAAA;mBACqD,SAArDtkB,EAAKu8C,GAAmBz5C,IAAIwhB,EAAW3J,cACzC3a,EAAKu8C,KAAqBv8C,EAAKu8C,GAAmB5gC,GAChD2I,EAAW3J,UACX2J,IAEFtkB,EAAKi+C,GAAiBxqC,IAAIiH,GAAQ4J,EAAW3J;YAExC2J;;;;;;;;IASbxkB,iBAAAA,SACEszB,GACA1Y;QAEA,IAAMC,IAAW3a,KAAKi+C,GAAiBn7C,IAAI4X;QAC3C,kBAAIC,IACKwX,GAAmBlwB,QACxBjC,KAAKu8C,GAAmBz5C,IAAI6X,MAGvB3a,KAAKsiC,GAAYub,GAAczqB,GAAa1Y;;;;;;;;;;IAYvD5a,iBAAAA,SACE6a,GACAujC;QAFFp+C,cAIQwkB,IAAatkB,KAAKu8C,GAAmBz5C,IAAI6X,IAMzC4sB,IAAO2W,IAA0B,cAAc;QACrD,OAAOl+C,KAAK65C,YACTrW,eAAe,kBAAkB+D,IAAM7N,SAAAA;YACjCwkB,OAAAA,IAMI/rB,GAAmBlwB,YALnBjC,EAAK65C,YAAY7b,GAAkBja,aACxC2V;YAOL32B,MAAK;YACJ/C,EAAKu8C,KAAqBv8C,EAAKu8C,GAAmBzgC,OAAOnB,IACzD3a,EAAKi+C,GAAiBvqC,OAAO4Q,EAAY5J;;;;;;;;;;;IAY/C5a,iBAAAA,SACE2gB,GACA09B;QAFFr+C,cAIMib,IAA+BzV,EAAgByB,OAC/Cq3C,IAAa3+B;QAEjB,OAAOzf,KAAK65C,YAAYrW,eAAe,iBAAiB,aAAY9J,SAAAA;YAC3D15B,OAAAA,EAAK69C,GAAcnkB,GAAKjZ,EAAMrI,MAClC/P,MAAKic,SAAAA;gBACJ,IAAIA,GAGF,OAFAvJ,IACEuJ,EAAWvJ,8BACN/a,EAAKsiC,GACT+b,GAA2B3kB,GAAKpV,EAAW3J,UAC3CtS,MAAKuG,SAAAA;oBACJwvC,IAAaxvC;;gBAIpBvG,MAAK;gBACJrI,OAAAA,EAAK85C,GAAYtkB,GACfkE,GACAjZ,GACA09B,IACIpjC,IACAzV,EAAgByB,OACpBo3C,IAAqBC,IAAa3+B;gBAGrCpX,MAAK4Y,SAAAA;;oBACKA,WAAAA;oBAAWq9B,IAAAF;;;;OAKpBt+C,iBAAAA,SACN45B,GACA7I,GACA8qB;QAHM77C,cAKAqxB,IAAQN,EAAYM,OACpBotB,IAAUptB,EAAMjjB,QAClBswC,IAAersB,GAAmBlwB;QAiCtC,OAhCAs8C,EAAQp4C,SAAQyqB,SAAAA;YACd4tB,IAAeA,EACZn2C,MAAK;gBACGszC,OAAAA,EAAernB,GAASoF,GAAK9I;gBAErCvoB,MAAM23B,SAAAA;gBACL,IAAInsB,IAAMmsB,GACJye,IAAa5tB,EAAYS,GAAYxuB,IAAI8tB;gBAl5B9BvtB,GAo5BA,SAAfo7C,MAGG5qC,KAAOA,EAAIlC,QAAQnE,OAAyB,QAC/CqG,IAAMsd,EAAM5c,GAAsBqc,GAAQ/c,GAAKgd;;;;gBAc7C8qB,EAAete,GAASxpB,GAAKgd,EAAYO;;aAK5CotB,EAAan2C,MAAK;YACvBrI,OAAAA,EAAKg0B,GAAcqY,GAAoB3S,GAAKvI;;OAIhDrxB,iBAAAA,SAAeipC;QAAfjpC;QACE,OAAOE,KAAK65C,YAAYrW,eACtB,mBACA,sBACA9J,SAAAA;YAAOqP,OAAAA,EAAiB2V,GAAQhlB,GAAK15B,EAAKu8C;;;;;;;;;;;;;QA10BQ;;;;;;;;IAy1BtDz8C,WACY+5C,GACVC,GACAC;QAHFj6C;gBAKE0B,IAAAA,aAAMq4C,GAAaC,GAAaC,0BAJtBF,GAMV75C,EAAKg0B,KAAgB6lB,EAAYI,GAAiBF,IAClD/5C,EAAKk6C,KAAkBL,EAAY7P;QACnChqC,EAAKsiC,KAAcuX,EAAY1Q;;4CAdK0T,mBAkBtC/8C,oBAAAA;QACE,OAAOE,KAAK2+C;;iFAId7+C,iBAAAA,SAAwB2wB;QAAxB3wB;QACE,OAAOE,KAAK65C,YAAYrW,eACtB,6BACA,aACA9J,SAAAA;YACS15B,OAAAA,EAAKg0B,GACT4qB,GAAmBllB,GAAKjJ,GACxBpoB,MAAK6F,SAAAA;gBACAA,OAAAA,IACKlO,EAAKm6C,GAAea,GACzBthB,GACAxrB,KAGKikB,GAAmBlwB,QAAiC;;;OAOvEnC,iBAAAA,SAAkC2wB;QAChCzwB,KAAKg0B,GAAcsY,GAAyB7b;OAG9C3wB,iBAAAA,SAAkBykC;QAChBvkC,KAAK65C,YAAYgF,GAAkBta;OAGrCzkC,iBAAAA;QACE,OAAOE,KAAK65C,YAAYiF;OAG1Bh/C,iBAAAA,SAAU6a;QAAV7a,cACQi/C,IAAmB/+C,KAAKu8C,GAAmBz5C,IAAI6X;QAErD,OAAIokC,IACK/8C,QAAQC,QAAQ88C,EAAiBrkC,UAEjC1a,KAAK65C,YAAYrW,eACtB,mBACA,aACA9J,SAAAA;YACS15B,OAAAA,EAAKsiC,GACTxc,GAAuB4T,GAAK/e,GAC5BtS,MAAKic,SAAAA;gBAAeA,OAAAA,IAAaA,EAAW5J,SAAS;;;;;;;;;;IAYhE5a,iBAAAA;QAAAA;QACE,OAAOE,KAAK65C,YACTrW,eAAe,4BAA4B,aAAY9J,SAAAA;YACtD15B,OAAAA,EAAKk6C,GAAgB8E,GACnBtlB,GACA15B,EAAKi/C;YAGRl8C,MAAK;gBAAGq5B,UAAapU;mBACpBhoB,EAAKi/C,KAA6Bj3B,GAC3BgU;;;;;;;;qBASbl8B;;;;;;2BACEE,IAAAA,sBAAwCA,KAAK65C,YAAYrW,eACvD,8CACA,aACA9J,SAAAA;wBAAO15B,OAAAA,EAAKk6C,GAAgBgF,GAAgBxlB;;;;2BAH9C15B,EAAKi/C;;;;;EApG+BpC;;;;;;;;;;;aAsHlBtE,GACpB9lB;;;YAEA,IACEA,EAAInxB,SAASlB,EAAKW,uBAClB0xB,EAAIlxB,YAAYqyB,IAIhB,MAAMnB;mBAFN5M,GAjiCY,cAiiCM;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ICjkCtB/lB;;QAEEE,UAAoB,IAAI2e,GAAUwgC,GAAaC;;QAG/Cp/C,UAAuB,IAAI2e,GAAUwgC,GAAaE;;;WAGlDv/C,gBAAAA;QACE,OAAOE,KAAKs/C,GAAUl2C;;wEAIxBtJ,iBAAAA,SAAaiJ,GAAkBsnB;QAC7B,IAAMkvB,IAAM,IAAIJ,GAAap2C,GAAKsnB;QAClCrwB,KAAKs/C,KAAYt/C,KAAKs/C,GAAU5gC,IAAI6gC,IACpCv/C,KAAKw/C,KAAex/C,KAAKw/C,GAAa9gC,IAAI6gC;;uEAI5Cz/C,iBAAAA,SAAcoO,GAAsBmiB;QAApCvwB;QACEoO,EAAK/H,SAAQ4C,SAAAA;YAAO/I,OAAAA,EAAK2/B,GAAa52B,GAAKsnB;;;;;;;IAO7CvwB,iBAAAA,SAAgBiJ,GAAkBsnB;QAChCrwB,KAAKy/C,GAAU,IAAIN,GAAap2C,GAAKsnB;OAGvCvwB,iBAAAA,SAAiBoO,GAAsBmiB;QAAvCvwB;QACEoO,EAAK/H,SAAQ4C,SAAAA;YAAO/I,OAAAA,EAAK4/B,GAAgB72B,GAAKsnB;;;;;;;IAOhDvwB,iBAAAA,SAAsBuwB;QAAtBvwB,cACQ4/C,IAAWp3C,EAAYmT,OACvBkkC,IAAW,IAAIR,GAAaO,GAAUrvB,IACtCuvB,IAAS,IAAIT,GAAaO,GAAUrvB,IAAK,IACzCniB,IAAsB;QAK5B,OAJAlO,KAAKw/C,GAAaK,GAAe,EAACF,GAAUC,MAASL,SAAAA;YACnDv/C,EAAKy/C,GAAUF,IACfrxC,EAAK7H,KAAKk5C,EAAIx2C;aAETmF;OAGTpO,iBAAAA;QAAAA;QACEE,KAAKs/C,GAAUn5C,SAAQo5C,SAAAA;YAAOv/C,OAAAA,EAAKy/C,GAAUF;;OAGvCz/C,iBAAAA,SAAUy/C;QAChBv/C,KAAKs/C,KAAYt/C,KAAKs/C,GAAU5rC,OAAO6rC,IACvCv/C,KAAKw/C,KAAex/C,KAAKw/C,GAAa9rC,OAAO6rC;OAG/Cz/C,iBAAAA,SAAgBuwB;QACd,IAAMqvB,IAAWp3C,EAAYmT,OACvBkkC,IAAW,IAAIR,GAAaO,GAAUrvB,IACtCuvB,IAAS,IAAIT,GAAaO,GAAUrvB,IAAK,IAC3CniB,IAAOuR;QAIX,OAHAzf,KAAKw/C,GAAaK,GAAe,EAACF,GAAUC,MAASL,SAAAA;YACnDrxC,IAAOA,EAAKwQ,IAAI6gC,EAAIx2C;aAEfmF;OAGTpO,iBAAAA,SAAYiJ;QACV,IAAMw2C,IAAM,IAAIJ,GAAap2C,GAAK,IAC5B+2C,IAAW9/C,KAAKs/C,GAAUS,GAAkBR;QAClD,OAAoB,SAAbO,KAAqB/2C,EAAIvD,QAAQs6C,EAAS/2C;;;IAKnDjJ,WACSiJ,GACAi3C;QADAhgD,WAAA+I,aACAi3C;;;kBAITlgD,SAAoBkH,GAAoBC;QACtC,OACEqB,EAAYvC,EAAWiB,EAAK+B,KAAK9B,EAAM8B,QACvC9D,GAAoB+B,EAAKg5C,IAAiB/4C,EAAM+4C;;4CAKpDlgD,SAAyBkH,GAAoBC;QAC3C,OACEhC,GAAoB+B,EAAKg5C,IAAiB/4C,EAAM+4C,OAChD13C,EAAYvC,EAAWiB,EAAK+B,KAAK9B,EAAM8B;;;;;;;;;;;;;;;;;;;;;;;;;;;SClG7Bk3C,GAAeC,GAAsBvxB;IACnD,IAAoB,MAAhBA,EAAKhpB,QACP,MAAM,IAAIvC,EACRhD,EAAKI,kBACL,cAAY0/C,4DAEVC,GAAaxxB,EAAKhpB,QAAQ,cAC1B;;;;;;;;;aAYQy6C,GACdF,GACAvxB,GACA0xB;IAEA,IAAI1xB,EAAKhpB,WAAW06C,GAClB,MAAM,IAAIj9C,EACRhD,EAAKI,kBACL,cAAY0/C,qBACVC,GAAaE,GAAc,cAC3B,2BACAF,GAAaxxB,EAAKhpB,QAAQ,cAC1B;;;;;;;;;;aAaQ26C,GACdJ,GACAvxB,GACA4xB;IAEA,IAAI5xB,EAAKhpB,SAAS46C,GAChB,MAAM,IAAIn9C,EACRhD,EAAKI,kBACL,cAAY0/C,8BACVC,GAAaI,GAAiB,cAC9B,2BACAJ,GAAaxxB,EAAKhpB,QAAQ,cAC1B;;;;;;;;;;aAaQ66C,GACdN,GACAvxB,GACA4xB,GACAE;IAEA,IAAI9xB,EAAKhpB,SAAS46C,KAAmB5xB,EAAKhpB,SAAS86C,GACjD,MAAM,IAAIr9C,EACRhD,EAAKI,kBACL,cAAY0/C,6BAAmCK,cAC1CE,yCACHN,GAAaxxB,EAAKhpB,QAAQ,cAC1B;;;;;;;;;;aA6BQ+6C,GACdR,GACA3/B,GACAjH,GACAqnC;IAEAC,GAAaV,GAAc3/B,GAASsgC,GAAQvnC,kBAAsBqnC;;;;;;aAOpDG,GACdZ,GACA3/B,GACAjH,GACAqnC;eAEIA,KACFD,GAAgBR,GAAc3/B,GAAMjH,GAAUqnC;;;;;;aAQlCI,GACdb,GACA3/B,GACAygC,GACAL;IAEAC,GAAaV,GAAc3/B,GAASygC,eAAqBL;;;;;;aAO3CM,GACdf,GACA3/B,GACAygC,GACAL;eAEIA,KACFI,GAAkBb,GAAc3/B,GAAMygC,GAAYL;;;;;;;;;;SAgFtCO,GACdhB,GACAiB,GACAH,GACAI,GACAC;eAEID,cAlCJlB,GACAiB,GACAH,GACAI,GACAC;QAIA,KAFA,IAAMC,IAAgC,WAEpBD,OAAAA,cAAAA,KAAU;YAAvB,IAAMlnC;YACT,IAAIA,MAAQinC,GACV;YAEFE,EAAoBj7C,KAAKk7C,GAAiBpnC;;QAG5C,IAAMqnC,IAAoBD,GAAiBH;QAC3C,MAAM,IAAIh+C,EACRhD,EAAKI,kBACL,mBAAiBghD,+BAA0CtB,wBACrDc,+BAAmCM,EAAoBl6C,KAAK;MAiBhE84C,GACAiB,GACAH,GACAI,GACAC;;;;;;;;;;;;uDAgCN,UAAST,GACPV,GACA3/B,GACA4gC,GACAC;IAWA,MARa,aAAT7gC,IACMkhC,GAAcL,KACJ,uBAAT7gC,IACgB,mBAAV6gC,KAAgC,OAAVA,WAEtBA,MAAU7gC,IAGf;QACV,IAAMmhC,IAAcH,GAAiBH;QACrC,MAAM,IAAIh+C,EACRhD,EAAKI,kBACL,cAAY0/C,yBAA+BiB,wBACxB5gC,uBAAqBmhC;;;;;;;aAS9BD,GAAcL;IAC5B,OACmB,mBAAVA,KACG,SAAVA,MACCp4C,OAAO24C,eAAeP,OAAWp4C,OAAOC,aACN,SAAjCD,OAAO24C,eAAeP;;;oFAKZG,GAAiBH;IAC/B,eAAIA,GACF,OAAO;IACF,IAAc,SAAVA,GACT,OAAO;IACF,IAAqB,mBAAVA,GAIhB,OAHIA,EAAMz7C,SAAS,OACjBy7C,IAAWA,EAAM1oB,UAAU,GAAG;IAEzBoE,KAAKC,UAAUqkB;IACjB,IAAqB,mBAAVA,KAAuC,oBAAVA,GAC7C,OAAO,KAAKA;IACP,IAAqB,mBAAVA,GAAoB;QACpC,IAAIA,aAAiBQ,OACnB,OAAO;QAEP,IAAMC;;iBAe2BT;YACrC,IAAIA,EAAM/xB,aAAa;gBACrB,IACMkC,IADgB,4BACQviB,KAAKoyC,EAAM/xB,YAAY5tB;gBACrD,IAAI8vB,KAAWA,EAAQ5rB,SAAS,GAC9B,OAAO4rB,EAAQ;;YAGnB,OAAO;;QAtBH,OAAIswB,IACK,cAAYA,gBAEZ;;IAGN,OAAqB,qBAAVT,IACT,eA1VXx7C;;;SA6WgBk8C,GACd5B,GACA5mC,GACAqnC;IAEA,eAAIA,GACF,MAAM,IAAIv9C,EACRhD,EAAKI,kBACL,cAAY0/C,6BAAmCW,GAAQvnC;;;;;;aAU7CyoC,GACd7B,GACA7pC,GACA2rC;IAEA77C,EAAQkQ,IAA0B,SAACtN,GAAKob;QACtC,IAAI69B,EAAYz6C,QAAQwB,KAAO,GAC7B,MAAM,IAAI3F,EACRhD,EAAKI,kBACL,qBAAmBuI,8BAA2Bm3C,gCAE5C8B,EAAY56C,KAAK;;;;;;;aAUX66C,GACd/B,GACA3/B,GACAjH,GACAqnC;IAEA,IAAMe,IAAcH,GAAiBZ;IACrC,OAAO,IAAIv9C,EACThD,EAAKI,kBACL,cAAY0/C,yBAA+BW,GAAQvnC,4BAC7BiH,uBAAqBmhC;;;SAI/BQ,GACdhC,GACA5mC,GACA0D;IAEA,IAAIA,KAAK,GACP,MAAM,IAAI5Z,EACRhD,EAAKI,kBACL,cAAY0/C,yBAA+BW,GACzCvnC,yDACiD0D;;;qEAMhD6jC,GAAQsB;IACf,QAAQA;MACN,KAAK;QACH,OAAO;;MACT,KAAK;QACH,OAAO;;MACT,KAAK;QACH,OAAO;;MACT;QACE,OAAOA,IAAM;;;;;;aAOVhC,GAAagC,GAAar6C;IACjC,OAAUq6C,UAAOr6C,KAAiB,MAARq6C,IAAY,KAAK;;;;;;;;;;;;;;;;;;;8EC7cpCC;IACP,IAA0B,sBAAfr4C,YACT,MAAM,IAAI3G,EACRhD,EAAKc,eACL;;;qFAMGmhD;IACP,KAAK74C,GAAgBC,KAAc64C,IACjC,MAAM,IAAIl/C,EACRhD,EAAKc,eACL;;;;;;;;;;IAiBJpB,WAAYyiD;QACVF,MACAriD,KAAKwiD,KAAcD;;gCAGrBziD,SAAwBwJ;QACtB82C,GAA0B,yBAAyBqC,WAAW,IAC9D/B,GAAgB,yBAAyB,UAAU,GAAGp3C;QACtD+4C;QACA;YACE,OAAO,IAAIK,EAAKn5C,EAAW8F,iBAAiB/F;UAC5C,OAAO2lB;YACP,MAAM,IAAI7rB,EACRhD,EAAKI,kBACL,kDAAkDyuB;;0BAKxDnvB,SAAsB6J;QAGpB,IAFAy2C,GAA0B,uBAAuBqC,WAAW,IAC5DL,QACMz4C,aAAiBI,aACrB,MAAMk4C,GAAkB,uBAAuB,cAAc,GAAGt4C;QAElE,OAAO,IAAI+4C,EAAKn5C,EAAW+F,eAAe3F;OAG5C7J,uBAAAA;QAGE,OAFAsgD,GAA0B,iBAAiBqC,WAAW,IACtDJ,MACOriD,KAAKwiD,GAAY/zC;OAG1B3O,2BAAAA;QAGE,OAFAsgD,GAA0B,qBAAqBqC,WAAW,IAC1DL,MACOpiD,KAAKwiD,GAAYx7B;OAG1BlnB,uBAAAA;QACE,OAAO,kBAAkBE,KAAKyO,aAAa;OAG7C3O,sBAAAA,SAAQkF;QACN,OAAOhF,KAAKwiD,GAAYh9C,QAAQR,EAAMw9C;;;;;;;;;ICzDxC1iD;;kBFkFAogD,GACAt+C,GACAF,GACAihD;YAEA,MAAM/gD,aAAiBggD,UAAUhgD,EAAM+D,SElFnC,GFmFF,MAAM,IAAIvC,EACRhD,EAAKI,kBACL,wFAEK2/C,GEvFL,GFuFuC;UE1FvC,GACAyC;QAKF,KAAK,IAAIn8C,IAAI,GAAGA,IAAIm8C,EAAWj9C,UAAUc,GAEvC,IADAi6C,GAAgB,aAAa,UAAUj6C,GAAGm8C,EAAWn8C,KACxB,MAAzBm8C,EAAWn8C,GAAGd,QAChB,MAAM,IAAIvC,EACRhD,EAAKI,kBACL;QAMNR,KAAK6iD,KAAgB,IAAIC,EAAkBF;;0BAa7C9iD;QACE,OAAO6H,EAAUo7C;OAGnBjjD,sBAAAA,SAAQkF;QACN,MAAMA,aAAiB2C,IACrB,MAAMs6C,GAAkB,WAAW,aAAa,GAAGj9C;QAErD,OAAOhF,KAAK6iD,GAAcr9C,QAAQR,EAAM69C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;QAZH,IAAIl7C,GACzCm7C,EAAkBlrC,IAAWvQ;;;;;AAkBjC,IAAM27C,KAAW,IAAI53C,OAAO,uBCtD1BtL,SAA+BmjD;cAAAA;;IAQ/BnjD;eACE0B,aAAM;;WAFgC0hD,mBAKxCpjD,iBAAAA,SAAiBqjD;QACf,yBAAIA,EAAQC,IAIL,yBAAID,EAAQC,KAMXD,EAAQE,GACZ,8EAKIF,EAAQE,GACZ;;;gBAIJ,OAlBEF,EAAQrwC,GAAUzM,KAAK88C,EAAa77C,OAkB/B;OAGTxH,sBAAAA,SAAQkF;QACN,OAAOA,aAAiBs+C;;EA/BcJ;IAoCxCpjD;eACE0B,aAAM;;WAFyC0hD,mBAKjDpjD,iBAAAA,SAAiBqjD;QACf,OAAO,IAAIx4B,GAAew4B,EAAa77C,MAAE4I,EAAyBua;OAGpE3qB,sBAAAA,SAAQkF;QACN,OAAOA,aAAiBu+C;;EAVuBL;IAejDpjD,WAA6B0jD;QAA7B1jD;gBACE0B,IAAAA,aAAM,uCADqBgiD;;WADeN,mBAK5CpjD,iBAAAA,SAAiBqjD;;;;QAIf,IAAMM,IAAe,IAAIC,GACvB;YACEC;YACAC,YAAY5jD,KAAKijD;YACjBY;WAEFV,EAAQ3zC,IACR2zC,EAAQvyC,YACRuyC,EAAQW,4BAEJC,IAAiB/jD,KAAKwjD,GAAU37C,KACpC2I,SAAAA;YAAWwzC,OAAAA,GAAUxzC,GAASizC;aAE1BQ,IAAa,IAAIxzC,EAA6BszC;QACpD,OAAO,IAAIp5B,GAAew4B,EAAQ77C,MAAO28C;OAG3CnkD,sBAAAA,SAAQkF;;QAEN,OAAOhF,SAASgF;;EA5B0Bk+C;IAiC5CpjD,WAAqB0jD;QAArB1jD;gBACE0B,IAAAA,aAAM,wCADagiD;;WADwBN,mBAK7CpjD,iBAAAA,SAAiBqjD;;;;QAIf,IAAMM,IAAe,IAAIC,GACvB;YACEC;YACAC,YAAY5jD,KAAKijD;YACjBY;WAEFV,EAAQ3zC,IACR2zC,EAAQvyC,YACRuyC,EAAQW,4BAEJC,IAAiB/jD,KAAKwjD,GAAU37C,KACpC2I,SAAAA;YAAWwzC,OAAAA,GAAUxzC,GAASizC;aAE1BQ,IAAa,IAAItzC,EAA8BozC;QACrD,OAAO,IAAIp5B,GAAew4B,EAAQ77C,MAAO28C;OAG3CnkD,sBAAAA,SAAQkF;;QAEN,OAAOhF,SAASgF;;EA5B2Bk+C;IAiC7CpjD,WAA6BokD;QAA7BpkD;gBACE0B,IAAAA,aAAM,sCADqB0iD;;WADqBhB,mBAKlDpjD,iBAAAA,SAAiBqjD;QACf,IAAMM,IAAe,IAAIC,GACvB;YACEC;YACAC,YAAY5jD,KAAKijD;WAEnBE,EAAQ3zC,IACR2zC,EAAQvyC,YACRuyC,EAAQW,4BAEJjzC,IAAUmzC,GAAUhkD,KAAKkkD,IAAUT,IACnCU,IAAmB,IAAI/yC,EAC3B+xC,EAAQvyC,YACRC;QAEF,OAAO,IAAI8Z,GAAew4B,EAAa77C,MAAE68C;OAG3CrkD,sBAAAA,SAAQkF;;QAEN,OAAOhF,SAASgF;;EAzBgCk+C;IC7HlDpjD,WAAYkM,GAAkBC;QAI5B,IAHAm0C,GAA0B,YAAYqC,WAAW,IACjD/B,GAAgB,YAAY,UAAU,GAAG10C,IACzC00C,GAAgB,YAAY,UAAU,GAAGz0C;SACpCm4C,SAASp4C,MAAaA,KAAY,MAAMA,IAAW,IACtD,MAAM,IAAI5I,EACRhD,EAAKI,kBACL,4DAA4DwL;QAGhE,KAAKo4C,SAASn4C,MAAcA,KAAa,OAAOA,IAAY,KAC1D,MAAM,IAAI7I,EACRhD,EAAKI,kBACL,+DAA+DyL;QAInEjM,KAAKqkD,KAAOr4C,GACZhM,KAAKskD,KAAQr4C;;WAMfD;;;;aAAAA;YACE,OAAOhM,KAAKqkD;;;;QAMdp4C;;;;aAAAA;YACE,OAAOjM,KAAKskD;;;;QAGdxkD,sBAAAA,SAAQkF;QACN,OAAOhF,KAAKqkD,OAASr/C,EAAMq/C,MAAQrkD,KAAKskD,OAAUt/C,EAAMs/C;;;;;;IAO1DxkD,gBAAAA,SAAWkF;QACT,OACEC,GAAoBjF,KAAKqkD,IAAMr/C,EAAMq/C,OACrCp/C,GAAoBjF,KAAKskD,IAAOt/C,EAAMs/C;;KC9BtCC,KAAuB;IAI3BzkD,WACW+S,GACAC,GACAc;QAFA5T,YAAA6S,aACAC,GACA9S,uBAAA4T;;WAGX9T,iBAAAA,SAAYiJ,GAAkBoJ;QAC5B,IAAMwe,IAAY;QAWlB,OAVuB,SAAnB3wB,KAAK8S,KACP6d,EAAUtqB,KACR,IAAI6M,GAAcnK,GAAK/I,KAAK6S,MAAM7S,KAAK8S,IAAWX,MAGpDwe,EAAUtqB,KAAK,IAAIuM,GAAY7J,GAAK/I,KAAK6S,MAAMV;QAE7CnS,KAAK4T,gBAAgBjO,SAAS,KAChCgrB,EAAUtqB,KAAK,IAAIiO,GAAkBvL,GAAK/I,KAAK4T,mBAE1C+c;;;IAMT7wB,WACW+S,GACAC,GACAc;QAFA5T,YAAA6S,aACAC,GACA9S,uBAAA4T;;WAGX9T,iBAAAA,SAAYiJ,GAAkBoJ;QAC5B,IAAMwe,IAAY,EAChB,IAAIzd,GAAcnK,GAAK/I,KAAK6S,MAAM7S,KAAK8S,IAAWX;QAKpD,OAHInS,KAAK4T,gBAAgBjO,SAAS,KAChCgrB,EAAUtqB,KAAK,IAAIiO,GAAkBvL,GAAK/I,KAAK4T;QAE1C+c;;;;;;;;;;;;;;;;;;;;;;;;;;GAyBX,UAAS6zB,GAAQpB;IACf,QAAQA;MACN;;cACA;;cACA;QACE;;MACF;MACA;QACE;;MACF;QACE,MAjGCx9C;;;;;;;;;;;;;;;;;;;;;;;IA+IL9F,WACW2kD,GACAj1C,GACAoB,GACAkzC,GACTlwC,GACAd;QALS9S,gBAAAykD,aACAj1C,GACAxP,kBAAA4Q,GACA5Q,iCAAA8jD;;;mBAMLlwC,KACF5T,KAAK0kD,MAEP1kD,KAAK4T,kBAAkBA,KAAmB,IAC1C5T,KAAK8S,KAAYA,KAAa;;WAGhCxL;aAAAA;YACE,OAAOtH,KAAKykD,SAASn9C;;;;QAGvBq8C;aAAAA;YACE,OAAO3jD,KAAKykD,SAASrB;;;;;0EAIvBtjD,iBAAAA,SAAY6kD;QACV,OAAO,IAAIjB,kCACJ1jD,KAAKykD,WAAaE,IACvB3kD,KAAKwP,IACLxP,KAAK4Q,YACL5Q,KAAK8jD,2BACL9jD,KAAK4T,iBACL5T,KAAK8S;OAIThT,iBAAAA,SAAqB2R;eACbmzC,kBAAY5kD,KAAKsH,mCAAMwO,MAAMrE,IAC7B0xC,IAAUnjD,KAAK6kD,GAAY;YAAEv9C,MAAMs9C;YAAWf;;QAEpD,OADAV,EAAQ2B,GAAoBrzC,IACrB0xC;OAGTrjD,iBAAAA,SAAyB2R;eACjBmzC,kBAAY5kD,KAAKsH,mCAAMwO,MAAMrE,IAC7B0xC,IAAUnjD,KAAK6kD,GAAY;YAAEv9C,MAAMs9C;YAAWf;;QAEpD,OADAV,EAAQuB,MACDvB;OAGTrjD,iBAAAA,SAAqB0G;;;QAGnB,OAAOxG,KAAK6kD,GAAY;YAAEv9C;YAAiBu8C;;OAG7C/jD,iBAAAA,SAAY+jC;QACV,IAAMkhB,KACH/kD,KAAKsH,QAAQtH,KAAKsH,KAAK8B,MACpB,KACA,sBAAoBpJ,KAAKsH,KAAK7F;QACpC,OAAO,IAAI2B,EACThD,EAAKI,kBACL,cAAYR,KAAKykD,SAASb,+CACxB/f,IACAkhB;;mFAKNjlD,uBAAAA,SAASuR;QACP,kBACErR,KAAK8S,GAAU/F,MAAK0E,SAAAA;YAASJ,OAAAA,EAAUC,EAAWG;0BAClDzR,KAAK4T,gBAAgB7G,MAAK2E,SAAAA;YACxBL,OAAAA,EAAUC,EAAWI,EAAUD;;OAK7B3R,iBAAAA;;;QAGN,IAAKE,KAAKsH,MAGV,KAAK,IAAIb,IAAI,GAAGA,IAAIzG,KAAKsH,KAAK3B,QAAQc,KACpCzG,KAAK8kD,GAAoB9kD,KAAKsH,KAAKxE,IAAI2D;OAInC3G,iBAAAA,SAAoBsG;QAC1B,IAAuB,MAAnBA,EAAQT,QACV,MAAM3F,KAAKqjD,GAAY;QAEzB,IAAImB,GAAQxkD,KAAKojD,OAAemB,GAAqB38C,KAAKxB,IACxD,MAAMpG,KAAKqjD,GAAY;;;IAY3BvjD,WACmB0P,GACAs0C,GACjBlzC;kBAFiBpB,GACAxP,iCAAA8jD,GAGjB9jD,KAAK4Q,aACHA,KAAcpH,GAAgBC,KAAcu7C,GAAcx1C;;;WAI9D1P,iBAAAA,SAAa8jD,GAAoBxC;QAC/B,IAAM+B,IAAUnjD,KAAKilD,iBAAkCrB;QACvDsB,GAAoB,uCAAuC/B,GAAS/B;QACpE,IAAM+D,IAAaC,GAAYhE,GAAO+B;QAEtC,OAAO,IAAIkC,GACT,IAAIlyC,GAAYgyC;yBACC,MACjBhC,EAAQvvC;;sEAKZ9T,iBAAAA,SACE8jD,GACAxC,GACArzB;QAEA,IAAMo1B,IAAUnjD,KAAKilD,sBAAuCrB;QAC5DsB,GAAoB,uCAAuC/B,GAAS/B;QACpE,IAEItuC,GACAc,GAHEuxC,IAAaC,GAAYhE,GAAO+B;QAKtC,IAAKp1B,GAGE;YAGL,KAFA,IAAMu3B,IAAmC,WAETv3B,OAAAA,cAAAA,KAAY;gBAAvC,IAAMw3B,UACLl0C;gBAEJ,IAAIk0C,aAA6BC,IAC/Bn0C,IAAYk0C,EAAkB1C,SACzB;oBAAA,IAAiC,mBAAtB0C,GAMhB,MA/SH3/C;oBA0SGyL,IAAYo0C,GACV7B,GACA2B;;gBAQJ,KAAKpC,EAAQhV,SAAS98B,IACpB,MAAM,IAAIjO,EACRhD,EAAKI,kBACL,YAAU6Q;gBAITq0C,GAAkBJ,GAAqBj0C,MAC1Ci0C,EAAoBj/C,KAAKgL;;YAI7ByB,IAAY,IAAIoD,EAAUovC,IAC1B1xC,IAAkBuvC,EAAQvvC,gBAAgBnM,QAAOiK,SAAAA;gBAC/CoB,OAAAA,EAAU6yC,GAAOj0C,EAAUD;;eAnC7BqB,IAAY,IAAIoD,EAAUitC,EAAQrwC,KAClCc,IAAkBuvC,EAAQvvC;QAqC5B,OAAO,IAAIyxC,GACT,IAAIlyC,GAAYgyC,IAChBryC,GACAc;;oDAKJ9T,iBAAAA,SAAgB8jD,GAAoBxC;QAClC,IAAM+B,IAAUnjD,KAAKilD,oBAAqCrB;QAC1DsB,GAAoB,uCAAuC/B,GAAS/B;QAEpE,IAAMwE,IAA8B,IAC9BT,IAAa,IAAI5xC;QACvBpN,EAAQi7C,IAAwB,SAACr4C,GAAKnH;YACpC,IAAM0F,IAAOm+C,GAAgC7B,GAAY76C,IAEnD88C,IAAe1C,EAAQ2C,GAAyBx+C;YACtD,IAAI1F,aAAiB0hD;;YAEnBsC,EAAev/C,KAAKiB,SACf;gBACL,IAAMy+C,IAAc/B,GAAUpiD,GAAOikD;gBAClB,QAAfE,MACFH,EAAev/C,KAAKiB,IACpB69C,EAAW1xC,IAAInM,GAAMy+C;;;QAK3B,IAAMC,IAAO,IAAI9vC,EAAU0vC;QAC3B,OAAO,IAAIK,GACTd,EAAWxxC,MACXqyC,GACA7C,EAAQvvC;;mEAKZ9T,iBAAAA,SACE8jD,GACAnyC,GACA7P,GACAskD;QAEA,IAAM/C,IAAUnjD,KAAKilD,oBAAqCrB,IACpD11C,IAAO,EAACi4C,GAAsBvC,GAAYnyC,MAC1ChF,IAAS,EAAC7K;QAEhB,IAAIskD,EAAoBvgD,SAAS,KAAM,GACrC,MAAM,IAAIvC,EACRhD,EAAKI,kBACL,cAAYojD;QAKhB,KAAK,IAAIn9C,IAAI,GAAGA,IAAIy/C,EAAoBvgD,QAAQc,KAAK,GACnDyH,EAAK7H,KACH8/C,GACEvC,GACAsC,EAAoBz/C,MAGxBgG,EAAOpG,KAAK6/C,EAAoBz/C,IAAI;;;QAQtC,KALA,IAAMm/C,IAA8B,IAC9BT,IAAa,IAAI5xC,IAId9M,IAAIyH,EAAKvI,SAAS,GAAGc,KAAK,KAAKA,GACtC,KAAKi/C,GAAkBE,GAAgB13C,EAAKzH,KAAK;YAC/C,IAAMa,IAAO4G,EAAKzH,IACZ7E,IAAQ6K,EAAOhG,IACfo/C,IAAe1C,EAAQ2C,GAAyBx+C;YACtD,IAAI1F,aAAiB0hD;;YAEnBsC,EAAev/C,KAAKiB,SACf;gBACL,IAAMy+C,IAAc/B,GAAUpiD,GAAOikD;gBAClB,QAAfE,MACFH,EAAev/C,KAAKiB,IACpB69C,EAAW1xC,IAAInM,GAAMy+C;;;QAM7B,IAAMC,IAAO,IAAI9vC,EAAU0vC;QAC3B,OAAO,IAAIK,GACTd,EAAWxxC,MACXqyC,GACA7C,EAAQvvC;;kDAKJ9T,iBAAAA,SACNsjD,GACAQ;QAEA,OAAO,IAAIF,GACT;YACEC,IAAAP;YACAQ,YAAAA;YACAt8C,MAAMK,EAAU4N;YAChBsuC;WAEF7jD,KAAKwP,IACLxP,KAAK4Q,YACL5Q,KAAK8jD;;;;;;;;;IAWThkD,iBAAAA,SACE8jD,GACAxC,GACAgF;QAYA,wBAZAA,SAMepC,GAAU5C,GAJTphD,KAAKilD,GACnBmB,+CACAxC;;;;;;;;;;;;;;;;;SAqBUI,GACd5C,GACA+B;IAEA,IAAIkD,GAAoBjF,IAEtB,OADA8D,GAAoB,4BAA4B/B,GAAS/B,IAClDgE,GAAYhE,GAAO+B;IACrB,IAAI/B,aAAiB8B;;;;;;;;;;IAO1B,OA2EJ,SACEthD,GACAuhD;;QAGA,KAAKqB,GAAQrB,EAAQC,KACnB,MAAMD,EAAQE,GACTzhD,EAAMqhD;QAGb,IAAqB,SAAjBE,EAAQ77C,MACV,MAAM67C,EAAQE,GACTzhD,EAAMqhD;QAIb,IAAM9uC,IAAiBvS,EAAM2nB,GAAiB45B;QAC1ChvC,KACFgvC,EAAQvvC,gBAAgBvN,KAAK8N;KAlBjC,CA5E4BitC,GAAO+B,IACxB;IAQP;;;IAJIA,EAAQ77C,QACV67C,EAAQrwC,GAAUzM,KAAK88C,EAAQ77C,OAG7B85C,aAAiBQ,OAAO;;;;;;;QAO1B,IACEuB,EAAQsB,SAAS6B,gCACjBnD,EAAQC,IAER,MAAMD,EAAQE,GAAY;QAE5B,OA+BN,SAAoB15C,GAAkBw5C;YAGpC,KAFA,IAAM12C,IAAsB,IACxB85C,IAAa,UACG58C,OAAAA,cAAAA,KAAO;gBAAtB,IACC68C,IAAcxC,SAEhBb,EAAQsD,GAAqBF;gBAEZ,QAAfC;;;gBAGFA,IAAc;oBAAE34B,WAAW;oBAE7BphB,EAAOpG,KAAKmgD,IACZD;;YAEF,OAAO;gBAAE/5C,YAAY;oBAAEC,QAAAA;;;SAhBzB,CA/BwB20C,GAAoB+B;;IAEtC,OA+EN,SACEvhD,GACAuhD;QAEA,IAAc,SAAVvhD,GACF,OAAO;YAAEisB,WAAW;;QACf,IAAqB,mBAAVjsB,GAChB,OAAOuhD,EAAQvyC,WAAW81C,GAAS9kD;QAC9B,IAAqB,oBAAVA,GAChB,OAAO;YAAE4J,cAAc5J;;QAClB,IAAqB,mBAAVA,GAChB,OAAO;YAAEgJ,aAAahJ;;QACjB,IAAIA,aAAiB4C,MAAM;YAChC,IAAMa,IAAYf,EAAUqiD,SAAS/kD;YACrC,OAAO;gBAAEqJ,gBAAgBk4C,EAAQvyC,WAAWqW,EAAY5hB;;;QACnD,IAAIzD,aAAiB0C,GAAW;;;;YAIrC,IAAMe,IAAY,IAAIf,EACpB1C,EAAMwC,SACiC,MAAvCS,KAAKC,MAAMlD,EAAMyC,cAAc;YAEjC,OAAO;gBAAE4G,gBAAgBk4C,EAAQvyC,WAAWqW,EAAY5hB;;;QACnD,IAAIzD,aAAiBglD,IAC1B,OAAO;YACL76C,eAAe;gBACbC,UAAUpK,EAAMoK;gBAChBC,WAAWrK,EAAMqK;;;QAGhB,IAAIrK,aAAiB8gD,IAC1B,OAAO;YAAE92C,YAAYu3C,EAAQvyC,WAAWwb,GAAQxqB;;QAC3C,IAAIA,aAAiBilD,IAAmB;YAC7C,IAAMC,IAAS3D,EAAQ3zC,IACjBu3C,IAAUnlD,EAAMolD,UAAUC;YAChC,KAAKF,EAAQvhD,QAAQshD,IACnB,MAAM3D,EAAQE,GACZ,wCACK0D,EAAQt3C,kBAAas3C,EAAQr3C,4CAChBo3C,EAAOr3C,kBAAaq3C,EAAOp3C;YAGjD,OAAO;gBACL7D,gBAAgBs3C,EAAQvyC,WAAW0W,GACjC1lB,EAAMslD,GAAK5/C,MACX1F,EAAMolD,UAAUC;;;QAGf,eAAIrlD,KAAuBuhD,EAAQW,2BACxC,OAAO;QAEP,MAAMX,EAAQE,GACZ,8BAA4B9B,GAAiB3/C;KArDnD,CA/E8Bw/C,GAAO+B;;;AAKrC,SAASiC,GACPv8C,GACAs6C;IAEA,IAAMz4C,IAA0B;IAiBhC,OAfItB,EAAQP;;;IAGNs6C,EAAQ77C,QAAQ67C,EAAQ77C,KAAK3B,SAAS,KACxCw9C,EAAQrwC,GAAUzM,KAAK88C,EAAQ77C,QAGjCnB,EAAQ0C,IAAK,SAACE,GAAaoR;QACzB,IAAM4rC,IAAc/B,GAAU7pC,GAAKgpC,EAAQgE,GAAqBp+C;QAC7C,QAAfg9C,MACFr7C,EAAO3B,KAAOg9C;SAKb;QAAEt7C,UAAU;YAAEC,QAAAA;;;;;AAsHvB,SAAS27C,GAAoBjF;IAC3B,SACmB,mBAAVA,KACG,SAAVA,KACEA,aAAiBQ,SACjBR,aAAiB58C,QACjB48C,aAAiB98C,KACjB88C,aAAiBwF,MACjBxF,aAAiBsB,MACjBtB,aAAiByF,MACjBzF,aAAiB8B;;;AAIvB,SAASgC,GACP3jD,GACA4hD,GACA/B;IAEA,KAAKiF,GAAoBjF,OAAWK,GAAcL,IAAQ;QACxD,IAAMM,IAAcH,GAAiBH;QACrC,MAAoB,gBAAhBM,IAEIyB,EAAQE,GAAY9hD,IAAU,sBAE9B4hD,EAAQE,GAAY9hD,IAAU,MAAMmgD;;;;;;aAQhCyE,GACdvC,GACAt8C;IAEA,IAAIA,aAAgBk+C,IAClB,OAAOl+C,EAAKu7C;IACP,IAAoB,mBAATv7C,GAChB,OAAOm+C,GAAgC7B,GAAYt8C;IAGnD,MAAM,IAAIlE,EACRhD,EAAKI,kBACL,cAAYojD;;;;;;;;;aAYT6B,GACP7B,GACAt8C;IAEA;QACE,gBH1oBmCA;YAErC,IADcA,EAAK8/C,OAAOpE,OACb,GACX,MAAM,IAAI5/C,EACRhD,EAAKI,kBACL,yBAAuB8G;YAI3B;gBACE,YAAWK,cAAAA,iCAAaL,EAAKE,MAAM;cACnC,OAAOynB;gBACP,MAAM,IAAI7rB,EACRhD,EAAKI,kBACL,yBAAuB8G;;UG4nBKA,GAAMu7C;MACpC,OAAO5zB;QACP,IAAM1tB,KAYYwtB,IAZWE,cAaPttB,QAAQotB,EAAMxtB,UAAUwtB,EAAMttB;QAZpD,MAAM,IAAI2B,EACRhD,EAAKI,kBACL,cAAYojD,sCAA0CriD;;;;;OAS5D,IAAsBwtB;;;AAKtB,SAAS22B,GAAkB74C,GAAuBC;IAChD,OAAOD,EAAS0D,MAAKvD,SAAAA;QAAKA,OAAAA,EAAExH,QAAQsH;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ICtlBpChN,WACUk3B,GACRqwB,GACQC,GACEC,GACFC,GACE3zB;kBALFmD,aAEAswB,aACEC,aACFC,GACExnD,gBAAA6zB,GAnBJ7zB;;;;;;QAMRA,UAAqB,GAErBA,UAAmD,MAC3CA,cAA+C,MAYrDA,KAAK60C,KAAU,IAAID,GAAmB5d,GAAOqwB;;;;;;;;;WAU/CvnD,iBAAAA;QACE,4BACEE,KAAKmiB,0BACLniB,KAAKmiB,6BACLniB,KAAKmiB;;;;;;IAQTriB,iBAAAA;QACE,wBAAOE,KAAKmiB;;;;;;;;;IAUdriB,oBAAAA;0BACME,KAAKmiB,QASTniB,KAAKyC,SARHzC,KAAKynD;;;;;;;;uBAiBT3nD;;;;;2BACME,KAAK0nD,uBACD1nD,KAAK8jC;;;;;;;;;;;;;;;;;;;IAYfhkC,iBAAAA;QAMEE,KAAKmiB,0BACLniB,KAAK60C,GAAQxd;;;;;;;;;;;;IAafv3B,iBAAAA;QAAAA;;;gBAGME,KAAK2nD,QAA+B,SAAnB3nD,KAAK4nD,OACxB5nD,KAAK4nD,KAAY5nD,KAAKg3B,GAAMc,GAC1B93B,KAAKsnD,IAvJW,MAyJhB;YAAMtnD,OAAAA,EAAK6nD;;;qDAMP/nD,iBAAAA,SAAY0uB;QACpBxuB,KAAK8nD,MACL9nD,KAAK+nD,OAAQC,KAAKx5B;;qGAIZ1uB;;;gBACN,OAAIE,KAAK2nD,wBAGA3nD,KAAK8jC;;;;6CAKRhkC,iBAAAA;QACFE,KAAK4nD,OACP5nD,KAAK4nD,GAAUrwB,UACfv3B,KAAK4nD,KAAY;;;;;;;;;;;;;;;wBAiBb9nD,SACNmoD,GACAl5B;;;;;;;2BASA/uB,KAAK8nD,MACL9nD,KAAK60C,GAAQtd;;;oBAIbv3B,KAAKkoD,wBAEDD;;oBAEFjoD,KAAK60C,GAAQxd,UACJtI,KAASA,EAAMztB,SAASlB,EAAKU;;oBAEtCua,GAAS0T,EAAMttB,aACf4Z,GACE;oBAEFrb,KAAK60C,GAAQsT,QACJp5B,KAASA,EAAMztB,SAASlB,EAAKS;;;oBAGtCb,KAAKwnD,GAAoBY;;oBAIP,SAAhBpoD,KAAK+nD,WACP/nD,KAAKqoD,MACLroD,KAAK+nD,OAAOjkB,SACZ9jC,KAAK+nD,SAAS;;;oBAKhB/nD,KAAKmiB,QAAQ8lC,mBAGPjoD,KAAK6zB,SAASy0B,GAAQv5B;;;;;;;;;;;;;;IAOpBjvB,iBAAAA,eAiBFA,mBAAAA;QAAAA;QAMNE,KAAKmiB;QAEL,IAAMomC,IAAsBvoD,KAAKwoD,GAA0BxoD,KAAKkoD,KAG1DA,IAAaloD,KAAKkoD;;gBAExBloD,KAAKwnD,GAAoBtkD,WAAWH,MAClC0lD,SAAAA;;;;;YAKMzoD,EAAKkoD,OAAeA;;;;YAItBloD,EAAK0oD,GAAYD;aAGpB15B,SAAAA;YACCw5B,GAAoB;gBAClB,IAAMI,IAAW,IAAIvlD,EACnBhD,EAAKG,SACL,iCAAiCwuB,EAAMxtB;gBAEzC,OAAOvB,EAAK4oD,GAAkBD;;;OAM9B7oD,iBAAAA,SAAY2oD;QAAZ3oD,cAMAyoD,IAAsBvoD,KAAKwoD,GAA0BxoD,KAAKkoD;QAEhEloD,KAAK+nD,SAAS/nD,KAAK6oD,GAASJ,IAC5BzoD,KAAK+nD,OAAOe,IAAO;YACjBP,GAAoB;uBAKlBvoD,EAAKmiB,uBACEniB,EAAK6zB,SAAUi1B;;aAG1B9oD,KAAK+nD,OAAOO,IAASv5B,SAAAA;YACnBw5B,GAAoB;gBACXvoD,OAAAA,EAAK4oD,GAAkB75B;;aAGlC/uB,KAAK+nD,OAAOgB,WAAWv6B,SAAAA;YACrB+5B,GAAoB;gBACXvoD,OAAAA,EAAK+oD,UAAUv6B;;;OAKpB1uB,iBAAAA;QAAAA;QAKNE,KAAKmiB,0BAELniB,KAAK60C,GAAQW,IAAcxR;;;2BAMzBhkC,KAAKmiB,0BACLniB,KAAKse;;;;;;IAMTxe,iBAAAA,SAAkBivB;;;;;QAahB,OARAlJ,GAzbY,oBAybM,uBAAqBkJ,IAEvC/uB,KAAK+nD,SAAS,MAMP/nD,KAAK8jC,sBAAmC/U;;;;;;;;IASzCjvB,iBAAAA,SACNkpD;QADMlpD;QAGN,OAAQ6G,SAAAA;YACN3G,EAAKg3B,GAAMwN,IAAiB;gBACtBxkC,OAAAA,EAAKkoD,OAAec,IACfriD,OAEPkf,GAldM,oBAodJ;gBAEK7jB,QAAQC;;;;;IA+BvBnC,WACEk3B,GACAuwB,GACA0B,GACQr4C,GACRijB;QALF/zB;gBAOE0B,IAAAA,aACEw1B,0HAGAuwB,GACA0B,GACAp1B,yBATMjjB;;;WATgCs4C,mBAsBhCppD,iBAAAA,SACR2oD;QAEA,OAAOzoD,KAAKunD,GAAW4B,GACrB,UACAV;OAIM3oD,wBAAAA,SAAUspD;;QAElBppD,KAAK60C,GAAQxd;QAEb,IAAMjT,IAAcpkB,KAAK4Q,WAAWy4C,GAAgBD,IAC9CE,IAAWtpD,KAAK4Q,WAAW24C,GAC/BH;QAEF,OAAOppD,KAAK6zB,SAAU21B,GAAcplC,GAAaklC;;;;;;;;IASnDxpD,iBAAAA,SAAMwkB;QACJ,IAAMorB,IAAyB;QAC/BA,EAAQhgC,WAAW1P,KAAK4Q,WAAW64C,IACnC/Z,EAAQga,YAAY1pD,KAAK4Q,WAAWwH,GAASkM;QAE7C,IAAMqlC,IAAS3pD,KAAK4Q,WAAWg5C,GAAsBtlC;QACjDqlC,MACFja,EAAQia,SAASA,IAGnB3pD,KAAK6pD,GAAYna;;;;;;IAOnB5vC,iBAAAA,SAAQ6a;QACN,IAAM+0B,IAAyB;QAC/BA,EAAQhgC,WAAW1P,KAAK4Q,WAAW64C,IACnC/Z,EAAQ3rB,eAAepJ,GACvB3a,KAAK6pD,GAAYna;;EArEuBwZ;IAmH1CppD,WACEk3B,GACAuwB,GACA0B,GACQr4C,GACRijB;QALF/zB;gBAOE0B,IAAAA,aACEw1B,sHAGAuwB,GACA0B,GACAp1B,yBATMjjB;QANV5Q;;;;;;;;;QA2BAA,oBAA8BuJ,EAAW0R;;WAhCAiuC,mBAsCzCY;;;;;aAAAA;YACE,OAAO9pD,KAAK+pD;;;;;;IAIdjqD,oBAAAA;QACEE,KAAK+pD,SACLvoD,YAAM8c;OAGExe,iBAAAA;QACJE,KAAK+pD,MACP/pD,KAAKgqD,GAAe;OAIdlqD,iBAAAA,SACR2oD;QAEA,OAAOzoD,KAAKunD,GAAW4B,GACrB,SACAV;OAIM3oD,wBAAAA,SAAUmqD;QAQlB;;QANA5mD,KACI4mD,EAAc54B,cAGlBrxB,KAAK4qC,kBAAkB5qC,KAAK4Q,WAAWyX,GAAU4hC,EAAc54B,cAE1DrxB,KAAK+pD,IAQH;;;;YAIL/pD,KAAK60C,GAAQxd;YAEb,IAAM9F,IAAUvxB,KAAK4Q,WAAWs5C,GAC9BD,EAAcE,cACdF,EAAchgC,aAEVmH,IAAgBpxB,KAAK4Q,WAAWiX,YACpCoiC,EAAyBhgC;YAE3B,OAAOjqB,KAAK6zB,SAAUu2B,GAAiBh5B,GAAeG;;;gBAdtD,OAtqBoBluB,IAkqBjB4mD,EAAcE,gBAAsD,MAAtCF,EAAcE,aAAaxkD,SAG5D3F,KAAK+pD;QACE/pD,KAAK6zB,SAAUw2B;;;;;;;IAuB1BvqD,iBAAAA;;;QAKE,IAAM4vC,IAAwB;QAC9BA,EAAQhgC,WAAW1P,KAAK4Q,WAAW64C,IACnCzpD,KAAK6pD,GAAYna;;yEAInB5vC,iBAAAA,SAAe6wB;QAAf7wB,cAWQ4vC,IAAwB;YAC5Bre,aAAarxB,KAAK4Q,WAAWwb,GAAQpsB,KAAK4qC;YAC1C0f,QAAQ35B,EAAU9oB,KAAIqhB,SAAAA;gBAAYlpB,OAAAA,EAAK4Q,WAAWiwB,GAAW3X;;;QAG/DlpB,KAAK6pD,GAAYna;;EAhIsBwZ;IC5kBzCppD,WACkBynD,GACA0B,GACAr4C;QAHlB9Q;gBAKE0B,IAAAA,2BAJgB+lD,GACAvnD,gBAAAipD,GACAjpD,eAAA4Q;;;IAMlB9Q,iBAAAA,SAAqByqD,GAAiB7a;QAAtC5vC;QACE,OAAOE,KAAKipD,YACT/lD,WACAH,MAAK0lD,SAAAA;YACGzoD,OAAAA,EAAKunD,GAAWiD,GAAqBD,GAAS7a,GAAS+Y;YAE/D7kB,OAAO7U,SAAAA;YAIN,MAHIA,EAAMztB,SAASlB,EAAKS,mBACtBb,EAAKipD,YAAYb,KAEbr5B;;;kFAKZjvB,iBAAAA,SACEyqD,GACA7a;QAFF5vC;QAIE,OAAOE,KAAKipD,YACT/lD,WACAH,MAAK0lD,SAAAA;YACGzoD,OAAAA,EAAKunD,GAAWkD,GACrBF,GACA7a,GACA+Y;YAGH7kB,OAAO7U,SAAAA;YAIN,MAHIA,EAAMztB,SAASlB,EAAKS,mBACtBb,EAAKipD,YAAYb,KAEbr5B;;;GApDdjvB;;;IAGEE;;ICkBAF,WAAoB4qD;kBAAAA;;QAlBpB1qD,UAAuBuf,MACfvf,iBAAwB,IAChCA;;;;;QAMAA,UAAgD;;;;;;;QAQhDA,UAAwC,IAAI2qD;;4BAI5C7qD,SAAaoO;;;;;;oBAGX,IAFAlO,KAAK4qD,MAED5qD,KAAK2wB,UAAUhrB,SAAS,GAC1B,MAAM,IAAIvC,EACRhD,EAAKI,kBACL;2CDuDDwjC,SACL0mB,GACAx8C;;;;;;2CAEM28C,IAAgBz7B,GAAUs7B,IAC1B5hB,IAAS;wCACbp5B,UAAUm7C,EAAcj6C,WAAW64C;wCACnCxoC,WAAW/S,EAAKrG,KAAIyU,SAAAA;4CAAKuuC,OAAAA,EAAcj6C,WAAW+W,GAAOrL;;uDAEpCuuC,EAAcJ,GAGnC,qBAAqB3hB;;;oCAavB,OAhBMgiB,cAKApqC,IAAO,IAAI5L,KACjBg2C,EAAS3kD,SAAQyO,SAAAA;wCACf,IAAMf,IAAMg3C,EAAcj6C,WAAWm6C,GAAkBn2C;wCACvD8L,EAAKjN,IAAII,EAAI9K,IAAItH,YAAYoS;yCAEzBjF,IAA0B,sBAChCV,EAAK/H,SAAQ4C,SAAAA;wCACX,IAAM8K,IAAM6M,EAAK5d,IAAIiG,EAAItH;wCAvGxB4B,KAwGYwQ,IACbjF,EAAOvI,KAAKwN;yCAEPjF;;;;qBAzBFo1B,CCpD2ChkC,KAAK0qD,IAAWx8C;;;oBAQ9D,0BARMwS,cACDva,SAAQ0N,SAAAA;wBACPA,aAAeY,MAAcZ,aAAe3B,KAC9ClS,EAAKgrD,GAAcn3C,KAEnBjO;yBAGG8a;;;;OAGT5gB,kBAAAA,SAAIiJ,GAAkB8J;QACpB7S,KAAKirD,MAAMp4C,EAAKq4C,GAAYniD,GAAK/I,KAAKmS,GAAapJ,MACnD/I,KAAKmrD,GAAYzsC,IAAI3V;OAGvBjJ,qBAAAA,SAAOiJ,GAAkB8J;QACvB;YACE7S,KAAKirD,MAAMp4C,EAAKq4C,GAAYniD,GAAK/I,KAAKorD,GAAsBriD;UAC5D,OAAOkmB;YACPjvB,KAAKqrD,KAAiBp8B;;QAExBjvB,KAAKmrD,GAAYzsC,IAAI3V;OAGvBjJ,qBAAAA,SAAOiJ;QACL/I,KAAKirD,MAAM,EAAC,IAAIv2C,GAAe3L,GAAK/I,KAAKmS,GAAapJ,QACtD/I,KAAKmrD,GAAYzsC,IAAI3V;4BAGvBjJ;;;;;;oBAGE,IAFAE,KAAK4qD,MAED5qD,KAAKqrD,IACP,MAAMrrD,KAAKqrD;2BAETC,IAAYtrD,KAAKurD;;oBAErBvrD,KAAK2wB,UAAUxqB,SAAQ+iB,SAAAA;wBACrBoiC,IAAYA,EAAUxvC,OAAOoN,EAASngB;;;;oBAIxCuiD,EAAUnlD,SAAQ,SAAC4C,GAAKyiD;wBACtBxrD,EAAK2wB,UAAUtqB,KAAK,IAAIsO,GAAe5L,GAAK/I,EAAKmS,GAAapJ;yCDX7Di7B,SACL0mB,GACA/5B;;;;;;2CAEMk6B,IAAgBz7B,GAAUs7B,IAC1B5hB,IAAS;wCACbp5B,UAAUm7C,EAAcj6C,WAAW64C;wCACnCa,QAAQ35B,EAAU9oB,KAAIopB,SAAAA;4CAAK45B,OAAAA,EAAcj6C,WAAWiwB,GAAW5P;;uDAE1C45B,EAAcL,GAGnC,UAAU1hB;;;oCACZ,OAJMgiB,+BAICD,EAAcj6C,WAAWs5C,GAC9BY,EAASX,cACTW,EAAS7gC;;;;qBAfN+Z,CCamBhkC,KAAK0qD,IAAW1qD,KAAK2wB;;;;qCAC3C3wB,KAAKyrD;;;;OAGC3rD,iBAAAA,SAAc+T;QACpB,IAAI63C;QAEJ,IAAI73C,aAAe3B,IACjBw5C,IAAa73C,EAAIlC,cACZ;YAAA,MAAIkC,aAAeY,KAIxB,MAxGJ7O;;wBAsGI8lD,IAAapmD,EAAgByB;;QAK/B,IAAM4kD,IAAkB3rD,KAAKurD,GAAazoD,IAAI+Q,EAAI9K;QAClD,IAAwB,SAApB4iD;YACF,KAAKD,EAAWlmD,QAAQmmD;;YAEtB,MAAM,IAAIvoD,EACRhD,EAAKY,SACL;eAIJhB,KAAKurD,KAAevrD,KAAKurD,GAAa5vC,GAAO9H,EAAI9K,KAAK2iD;;;;;;IAQlD5rD,iBAAAA,SAAaiJ;QACnB,IAAM4I,IAAU3R,KAAKurD,GAAazoD,IAAIiG;QACtC,QAAK/I,KAAKmrD,GAAY1sC,IAAI1V,MAAQ4I,IACzBI,GAAaF,WAAWF,KAExBI,GAAa8X;;;;;IAOhB/pB,iBAAAA,SAAsBiJ;QAC5B,IAAM4I,IAAU3R,KAAKurD,GAAazoD,IAAIiG;;;gBAGtC,KAAK/I,KAAKmrD,GAAY1sC,IAAI1V,MAAQ4I,GAAS;YACzC,IAAIA,EAAQnM,QAAQF,EAAgByB;;;;;;;;;;YAYlC,MAAM,IAAI3D,EACRhD,EAAKI,kBACL;;wBAIJ,OAAOuR,GAAaF,WAAWF;;;;gBAI/B,OAAOI,GAAaD;OAIhBhS,oBAAAA,SAAM6wB;QACZ3wB,KAAK4qD,MACL5qD,KAAK2wB,YAAY3wB,KAAK2wB,UAAU1Y,OAAO0Y;OAGjC7wB,iBAAAA;;IC9HRA,WACUm0C,GACA2X;kBADA3X,aACA2X;;QAzBF5rD;;;;;;QAORA,UAA8B;;;;;;QAO9BA,UAA0D;;;;;;QAO1DA;;;;;;;;;WAcAF,iBAAAA;QAAAA;QACmC,MAA7BE,KAAK6rD,OACP7rD,KAAK8rD,6BAML9rD,KAAK+rD,KAAmB/rD,KAAKi0C,GAAWnc,qDA1Dd,MA6DxB;mBACE93B,EAAK+rD,KAAmB,MAKxB/rD,EAAKgsD,GACH,8CAGFhsD,EAAK8rD;YAME9pD,QAAQC;;;;;;;;;IAYvBnC,iBAAAA,SAAyBivB;kCACnB/uB,KAAKmiB,QACPniB,KAAK8rD,+BAaL9rD,KAAK6rD;QACD7rD,KAAK6rD,MA/GmB,MAgH1B7rD,KAAKisD,MAELjsD,KAAKgsD,GACH,mDAC+Bj9B,EAAMttB;QAGvCzB,KAAK8rD;;;;;;;;;IAYXhsD,kBAAAA,SAAIosD;QACFlsD,KAAKisD,MACLjsD,KAAK6rD,KAAsB,6BAEvBK;;;QAGFlsD,KAAKmsD,UAGPnsD,KAAK8rD,GAAgBI;OAGfpsD,iBAAAA,SAAgBosD;QAClBA,MAAalsD,KAAKmiB,UACpBniB,KAAKmiB,QAAQ+pC,GACblsD,KAAK4rD,GAAmBM;OAIpBpsD,iBAAAA,SAAmCssD;QACzC,IAAM7qD,IACJ,8CAA4C6qD;QAI1CpsD,KAAKmsD,MACP9wC,GAAS9Z,IACTvB,KAAKmsD,WAELtmC,GAxKU,sBAwKQtkB;OAIdzB,iBAAAA;QACwB,SAA1BE,KAAK+rD,OACP/rD,KAAK+rD,GAAiBx0B,UACtBv3B,KAAK+rD,KAAmB;;;IC/D5BjsD;;;;IAIUo4C;;IAEAwS,GACAzW,GACR2X,GACAS;QATFvsD;kBAIUo4C,aAEAwS,aACAzW;;;;;;;;;;;;;;;;;;QA1CVj0C,UAAyC;;;;;;;;;;QAWzCA,UAAwB,IAAI8U,KAK5B9U,UAA8D;;;;;QAMtDA,0BAEAA;;;;;;QAORA,cAeEA,KAAKqsD,KAAsBA,GAC3BrsD,KAAKqsD,GAAoBC,IAAa3lC,SAAAA;YACpCstB,EAAWzP,IAAiBR;;;;;mCACtBhkC,KAAKusD,QACP1mC,GA5FM,eA8FJ;4CAEI7lB,KAAKwsD;;;;;;;;;;;aAKjBxsD,KAAKysD,KAAqB,IAAIC,GAC5BzY,GACA2X;;QAIF5rD,KAAK2sD,cH8BPjC,GACA1zB,GACAnD;YAEA,IAAMg3B,IAAgBz7B,GAAUs7B;YAChC,OAAO,IAAIkC,GACT51B,GACA6zB,EAActD,IACdsD,EAAc5B,aACd4B,EAAcj6C,YACdijB;UGxC4C7zB,KAAK0qD,IAAWzW,GAAY;YACtE4Y,IAAQ7sD,KAAK8sD,GAAkBzY,KAAKr0C;YACpC+sD,IAAS/sD,KAAKgtD,GAAmB3Y,KAAKr0C;YACtCitD,IAAejtD,KAAKktD,GAAoB7Y,KAAKr0C;YAG/CA,KAAKmtD,cHSPzC,GACA1zB,GACAnD;YAEA,IAAMg3B,IAAgBz7B,GAAUs7B;YAChC,OAAO,IAAI0C,GACTp2B,GACA6zB,EAActD,IACdsD,EAAc5B,aACd4B,EAAcj6C,YACdijB;UGnB4C7zB,KAAK0qD,IAAWzW,GAAY;YACtE4Y,IAAQ7sD,KAAKqtD,GAAkBhZ,KAAKr0C;YACpC+sD,IAAS/sD,KAAKstD,GAAmBjZ,KAAKr0C;YACtCutD,IAAqBvtD,KAAKwtD,GAAyBnZ,KAAKr0C;YACxDytD,IAAkBztD,KAAKoqD,GAAiB/V,KAAKr0C;;;;;;kBAcjDF,oBAAAA;QACE,OAAOE,KAAK0tD;;+CAId5tD,4BAAAA;QAEE,OADAE,KAAKukC,qBACEvkC,KAAK2tD;wBAGN7tD;;;;;;2BACFE,KAAKusD,QACPvsD,IAAAA,KAAKmtD,oBAAoCntD,KAAKk4C,GAAWgE;;;;2BAAzDl8C,EAAiB4qC,4BAEb5qC,KAAK4tD,OACP5tD,KAAK6tD,OAEL7tD,KAAKysD,GAAmBh5C;oCAIpBzT,KAAK8tD;;;;;;;;;;;;;;;;iCAQfhuD;;;;;2BACEE,KAAKukC,qCACCvkC,KAAK+tD;;;;;oBAGX/tD,KAAKysD,GAAmBh5C;;;;wBAGlB3T;;;;;2CACAE,KAAKmtD,GAAYa;;;qDACjBhuD,KAAK2sD,GAAYqB;;;qCAEnBhuD,KAAKiuD,GAActoD,SAAS,MAC9BkgB,GA7KU,eA+KR,gCAA8B7lB,KAAKiuD,GAActoD;oBAEnD3F,KAAKiuD,KAAgB,KAGvBjuD,KAAKkuD;;;;wBAGPpuD;;;;;2BACE+lB,GAxLY,eAwLM,+BAClB7lB,KAAKukC;oCACCvkC,KAAK+tD;;;qCACX/tD,KAAKqsD,GAAoB3jB;;;oBAIzB1oC,KAAKysD,GAAmBh5C;;;;;;;;;IAO1B3T,qBAAAA,SAAOwkB;QACDtkB,KAAKmuD,GAAc1vC,IAAI6F,EAAW3J;;QAKtC3a,KAAKmuD,GAAc16C,IAAI6Q,EAAW3J,UAAU2J,IAExCtkB,KAAK4tD;;QAEP5tD,KAAK6tD,OACI7tD,KAAK2sD,GAAYhF,QAC1B3nD,KAAKouD,GAAiB9pC;;;;;;IAQ1BxkB,iBAAAA,SAAS6a;QAMP3a,KAAKmuD,GAAcz6C,OAAOiH,IACtB3a,KAAK2sD,GAAYhF,QACnB3nD,KAAKquD,GAAmB1zC,IAGM,MAA5B3a,KAAKmuD,GAAc5nD,SACjBvG,KAAK2sD,GAAYhF,OACnB3nD,KAAK2sD,GAAY2B,OACRtuD,KAAKusD;;;;QAIdvsD,KAAKysD,GAAmBh5C;;iEAM9B3T,iBAAAA,SAAuB6a;QACrB,OAAO3a,KAAKmuD,GAAcrrD,IAAI6X,MAAa;;iEAI7C7a,iBAAAA,SAAuB6a;QACrB,OAAO3a,KAAKuuD,GAAW/oC,GAAuB7K;;;;;;IAOxC7a,iBAAAA,SAAiBwkB;QACvBtkB,KAAKwuD,GAAuB/oC,GAA2BnB,EAAW3J,WAClE3a,KAAK2sD,GAAY8B,GAAMnqC;;;;;;;IAQjBxkB,iBAAAA,SAAmB6a;QACzB3a,KAAKwuD,GAAuB/oC,GAA2B9K,IACvD3a,KAAK2sD,GAAY+B,GAAQ/zC;OAGnB7a,iBAAAA;QAMNE,KAAKwuD,KAAwB,IAAIG,GAAsB3uD,OACvDA,KAAK2sD,GAAYruC,SACjBte,KAAKysD,GAAmBmC;;;;;;IAOlB9uD,iBAAAA;QACN,OACEE,KAAKusD,SACJvsD,KAAK2sD,GAAYjF,QAClB1nD,KAAKmuD,GAAc5nD,OAAO;OAI9BzG,iBAAAA;QACE,QAAQE,KAAK6uD,MAAmB7uD,KAAKojC,aAAapjC,KAAKukC;OAGjDzkC,iBAAAA;QACNE,KAAKwuD,KAAwB;wBAGvB1uD;;;;uBACNE,KAAKmuD,GAAchoD,SAAQ,SAACme,GAAY3J;oBACtC3a,EAAKouD,GAAiB9pC;;;;wBAIlBxkB,SAAyBivB;;;uBAU/B/uB,KAAKkuD;;gBAGDluD,KAAK4tD,QACP5tD,KAAKysD,GAAmBqC,OAExB9uD,KAAK6tD;;;;gBAKL7tD,KAAKysD,GAAmBh5C;;;wBAIpB3T,SACNskB,GACAtJ;;;;;;wBAGA9a,KAAKysD,GAAmBh5C,8BAGtB2Q,aAAuBoE,0BACvBpE,EAAYjC,SACZiC,EAAY/B;;oBALdriB;;;;uEAUUA,KAAK+uD,GAAkB3qC;;;;;;yCAE7ByB,GA7VQ,eA+VN,oCACAzB,EAAYhC,UAAUhb,KAAK,MAC3B6nB;oCAEIjvB,KAAKgvD,GAA4B//B;;;;;;;;;wBAKvC7K,aAAuBuE,KACzB3oB,KAAKwuD,GAAuBS,GAAqB7qC,KACxCA,aAAuB6E,KAChCjpB,KAAKwuD,GAAuBU,GAAsB9qC,KAMlDpkB,KAAKwuD,GAAuBW,GAAmB/qC;oBAG5CtJ,EAAgBtV,QAAQF,EAAgByB,QAZzCqd;;;;yEAcwCpkB,KAAKk4C,GAAWkE;;;2BAAlD/d,cACFvjB,EAAgBtN,EAAU6wB,MAA8B,oBAGpDr+B,KAAKovD,GAAmBt0C;;;;;;;;;;;;;2BAGhC+K,GA7XQ,eA6XU,4DACZ7lB,KAAKgvD,GAA4B//B;;;;;;;;;;;;;;;;qBAUrCnvB,SAAkCmvB;;;;;;oBACxC,KAAIgW,GAA4BhW,IAsB9B,MAAMA;;2BAjBNjvB,KAAK6uD,yBAGC7uD,KAAK+tD;;;;qCACX/tD,KAAKysD,GAAmBh5C;;oBAGxBzT,KAAKi0C,GAAWob,IAAiBrrB;;;;;;;;2CAC/Bne,GAtZQ,eAsZU,8CAIZ7lB,KAAKk4C,GAAWkE;;;;;;qDACtBp8C,KAAK6uD,yBACC7uD,KAAK2tD;;;;;;;;;;;;;;;;;IAYT7tD,iBAAAA,SAAmBgb;QAAnBhb,cAKAolB,IAAcllB,KAAKwuD,GAAuBc,GAC9Cx0C;;;;QAuDF,OAlDAoK,EAAY7D,GAAclb,SAAQ,SAACia,GAAQzF;YACzC,IAAIyF,EAAOpF,YAAY8H,OAAwB,GAAG;gBAChD,IAAMwB,IAAatkB,EAAKmuD,GAAcrrD,IAAI6X;;gCAEtC2J,KACFtkB,EAAKmuD,GAAc16C,IACjBkH,GACA2J,EAAWs4B,GAAgBx8B,EAAOpF,aAAaF;;;;;QAQvDoK,EAAY5D,GAAiBnb,SAAQwU,SAAAA;YACnC,IAAM2J,IAAatkB,EAAKmuD,GAAcrrD,IAAI6X;YAC1C,IAAK2J,GAAL;;;gBAOAtkB,EAAKmuD,GAAc16C,IACjBkH,GACA2J,EAAWs4B,GACTrzC,EAAW0R,IACXqJ,EAAWxJ;;;gBAMf9a,EAAKquD,GAAmB1zC;;;;;gBAMxB,IAAM40C,IAAoB,IAAIr0C,GAC5BoJ,EAAW5J,QACXC,qCAEA2J,EAAWzJ;gBAEb7a,EAAKouD,GAAiBmB;;aAIjBvvD,KAAKuuD,GAAWiB,GAAiBtqC;;yDAIlCplB,SACNskB;;;;;;oBAGM2K,IAAQ3K,EAAkB/B,cACT+B,IAAAA,EAAYhC;;;2BAAZgC,gBAAlBqrC,UAECzvD,KAAKmuD,GAAc1vC,IAAI9D,qBACnB3a,KAAKuuD,GAAWmB,GAAa/0C,GAAUoU;;;8BAC7C/uB,KAAKmuD,GAAcz6C,OAAOiH,IAC1B3a,KAAKwuD,GAAuBzqC,aAAapJ;;;;;;2BALtByJ;;;;;;;;;;;;;;;;qBAkBzBtkB;;;;;;2BACME,KAAK2vD,QACDC,IACJ5vD,KAAKiuD,GAActoD,SAAS,IACxB3F,KAAKiuD,GAAcjuD,KAAKiuD,GAActoD,SAAS,GAAG8qB,WlC5hB/B;oCkC8hBLzwB,KAAKk4C,GAAW2X,GAClCD;;;2BAGY,UAJRz+B,uCAK8B,MAA9BnxB,KAAKiuD,GAActoD,UACrB3F,KAAKmtD,GAAYmB;;;;2BAGnBtuD,KAAK8vD,GAAmB3+B,oBAClBnxB,KAAK8tD;;;;;;;;;2BAIX9tD,KAAK+vD,QACP/vD,KAAKgwD;;;;;;;;;IAQDlwD,iBAAAA;QACN,OACEE,KAAKusD,QAAmBvsD,KAAKiuD,GAActoD,SA5hBtB;;;IAiiBzB7F,iBAAAA;QACE,OAAOE,KAAKiuD,GAActoD;;;;;;IAOpB7F,iBAAAA,SAAmBqxB;QAKzBnxB,KAAKiuD,GAAc5nD,KAAK8qB,IAEpBnxB,KAAKmtD,GAAYxF,QAAY3nD,KAAKmtD,GAAY8C,MAChDjwD,KAAKmtD,GAAYnD,GAAe74B,EAAMR;OAIlC7wB,iBAAAA;QACN,OACEE,KAAKusD,SACJvsD,KAAKmtD,GAAYzF,QAClB1nD,KAAKiuD,GAActoD,SAAS;OAIxB7F,iBAAAA;QAKNE,KAAKmtD,GAAY7uC;wBAGXxe;;;uBACNE,KAAKmtD,GAAY+C;;;OAGXpwD,iBAAAA;QAAAA;;gBAEN,OAAOE,KAAKk4C,GACTiE,GAAmBn8C,KAAKmtD,GAAYviB,iBACpC7nC,MAAK;;YAEJ,KAAoB/C,WAAAA,IAAAA,EAAKiuD,IAALjuD,cAAAA;gBAAf,IAAMmxB;gBACTnxB,EAAKmtD,GAAYnD,GAAe74B,EAAMR;;YAGzCiT,MAAM2U;OAGHz4C,iBAAAA,SACNsxB,GACAG;QAFMzxB,cAUAqxB,IAAQnxB,KAAKiuD,GAAckC,SAC3BtrB,IAAUpT,GAAoBvG,KAClCiG,GACAC,GACAG,GACAvxB,KAAKmtD,GAAYviB;QAEnB,OAAO5qC,KAAKuuD,GAAW6B,GAAqBvrB,GAAS9hC,MAAK;YAGjD/C,OAAAA,EAAK8tD;;wBAIRhuD,SAAyBivB;;;;;2BAY3BA,KAAS/uB,KAAKiuD,GAActoD,SAAS,IACnC3F,KAAKmtD,GAAY8C,qBAEbjwD,KAAKqwD;;;;;;;;;;2CAKLrwD,KAAKswD;;;;;;;;;;;oBAKTtwD,KAAK+vD,QACP/vD,KAAKgwD;;;;;;;wBAMHlwD,SAA2BivB;;;;;;gBAIjC,OAAI5T,GAAiB4T,EAAMztB,0BACzBukB,GAtpBU,eAwpBR,0EACA7lB,KAAKmtD,GAAYviB;gBAEnB5qC,KAAKmtD,GAAYviB,kBAAkBrhC,EAAW0R,IAEvCjb,KAAKk4C,GACTiE,GAAmB5yC,EAAW0R,IAC9B2oB,MAAM2U;;;wBAOLz4C,SAAuBivB;;;;;;gBAG7B,OtD7nBK5T,GAD6B7Z,IsD8nBRytB,EAAMztB,StD7nBDA,MAASlB,EAAKY,WsDgoBrCmwB,IAAQnxB,KAAKiuD,GAAckC,2BAKjCnwD,KAAKmtD,GAAYoD;gBAEVvwD,KAAKuuD,GACTiC,GAAkBr/B,EAAMV,SAAS1B,GACjChsB,MAAK;oBAGG/C,OAAAA,EAAK8tD;;;;OAOpBhuD,iBAAAA;QACE,OAAO,IAAI2wD,GAAYzwD,KAAK0qD;wBAGtB5qD;;;;;2BACNE,KAAKukC,qCACCvkC,KAAK+tD;;;qCACX/tD,KAAKysD,GAAmBh5C,8CAClBzT,KAAK0tD;;;;;;;wBAGb5tD;;;;;2BACME,KAAKusD;;;;oBAIP1mC,GA/sBU,eA+sBQ,sEACZ7lB,KAAKwsD;;;;;;;;;;;;;;qBAOf1sD,SAAwBsjC;;;;;;2BACtBpjC,KAAKojC,YAAYA,GAEbA,KAAapjC,KAAKukC,iCACdvkC,KAAK0tD;;;;;;4BACDtqB,IAAAA,2CACJpjC,KAAK+tD;;;kCACX/tD,KAAKysD,GAAmBh5C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;SC5vBdi9C,GACd5gC,GACAiS;IAOA,OAAO,uBAA8BjS,UAAkBiS;;;;;;;;;qEAuBzC4uB,GACd7gC,GACAjuB,GACA4uB;IAEA,IAAImgC,IAAc,yBAAgC9gC,UAAkBW;IAMpE,OAJI5uB,EAAK5B,QACP2wD,KAAe,MAAI/uD,EAAK9B,MAGnB6wD;;;;;kEAmBOC,GACd/gC,GACAnV;IAEA,OAAO,uBAA8BmV,UAAkBnV;;;;;;;;;;;;IC0FvD7a,WACW+B,GACA4uB,GACAtO,GACA4M;QAHA/uB,YAAA6B,GACA7B,eAAAywB,GACAzwB,aAAAmiB,GACAniB,aAAA+uB;;;;;;kBAYXjvB,SACE+B,GACA4uB,GACA7uB;QAEA,IAAMkvD,IAAgBh0B,KAAKi0B,MAAMnvD,IAE7BovD,IACuB,mBAAlBF,MAEJ,MADH,EAAC,WAAW,gBAAgB,aAAYvpD,QAAQupD,EAAc3uC,sBAE7D2uC,EAAc/hC,SACkB,mBAAxB+hC,EAAc/hC,QAErBkiC;QAcJ,OAZID,KAAaF,EAAc/hC,WAC7BiiC,IACyC,mBAAhCF,EAAc/hC,MAAMxtB,WACS,mBAA7BuvD,EAAc/hC,MAAMztB,UAE3B2vD,IAAiB,IAAI7tD,EACnB0tD,EAAc/hC,MAAMztB,MACpBwvD,EAAc/hC,MAAMxtB;QAKtByvD,IACK,IAAIE,EACTrvD,GACA4uB,GACAqgC,EAAc3uC,OACd8uC,MAGF51C,GArLU,qBAuLR,4CAA0CoV,YAAa7uB;QAElD;OAIX9B,iBAAAA;QACE,IAAMqxD,IAAwC;YAC5ChvC,OAAOniB,KAAKmiB;YACZ+kB,cAAc1iC,KAAKC;;QAUrB,OAPIzE,KAAK+uB,UACPoiC,EAAcpiC,QAAQ;YACpBztB,MAAMtB,KAAK+uB,MAAMztB;YACjBC,SAASvB,KAAK+uB,MAAMxtB;YAIjBu7B,KAAKC,UAAUo0B;;;IAUxBrxD,WACW6a,GACAwH,GACA4M;QAFA/uB,gBAAA2a,GACA3a,aAAAmiB,GACAniB,aAAA+uB;;;;;;kBAYXjvB,SACE6a,GACA/Y;QAEA,IAAM4hB,IAAcsZ,KAAKi0B,MAAMnvD,IAE3BovD,IACqB,mBAAhBxtC,MAEJ,MADH,EAAC,eAAe,WAAW,aAAYjc,QAAQic,EAAYrB,sBAE1DqB,EAAYuL,SACkB,mBAAtBvL,EAAYuL,QAEnBkiC;QAcJ,OAZID,KAAaxtC,EAAYuL,WAC3BiiC,IACuC,mBAA9BxtC,EAAYuL,MAAMxtB,WACS,mBAA3BiiB,EAAYuL,MAAMztB,UAEzB2vD,IAAiB,IAAI7tD,EACnBogB,EAAYuL,MAAMztB,MAClBkiB,EAAYuL,MAAMxtB;QAKpByvD,IACK,IAAII,EACTz2C,GACA6I,EAAYrB,OACZ8uC,MAGF51C,GArQU,qBAuQR,0CAAwCV,YAAc/Y;QAEjD;OAIX9B,iBAAAA;QACE,IAAM0jB,IAAsC;YAC1CrB,OAAOniB,KAAKmiB;YACZ+kB,cAAc1iC,KAAKC;;QAUrB,OAPIzE,KAAK+uB,UACPvL,EAAYuL,QAAQ;YAClBztB,MAAMtB,KAAK+uB,MAAMztB;YACjBC,SAASvB,KAAK+uB,MAAMxtB;YAIjBu7B,KAAKC,UAAUvZ;;;IAkBxB1jB,WACWiiC,GACAjD;QADA9+B,gBAAA+hC,GACA/hC,uBAAA8+B;;;;;;kBAOXh/B,SACEiiC,GACAngC;QAUA,KARA,IAAMyvD,IAAcv0B,KAAKi0B,MAAMnvD,IAE3BovD,IACqB,mBAAhBK,KACPA,EAAYvyB,2BAA2B8iB,OAErC0P,IAAqB3xC,MAEhBlZ,IAAI,GAAGuqD,KAAavqD,IAAI4qD,EAAYvyB,gBAAgBn5B,UAAUc,GACrEuqD,IAAY7mD,EAAcknD,EAAYvyB,gBAAgBr4B;QACtD6qD,IAAqBA,EAAmB5yC,IACtC2yC,EAAYvyB,gBAAgBr4B;QAIhC,OAAIuqD,IACK,IAAIO,EAAkBxvB,GAAUuvB,MAEvCj2C,GA3UU,qBA6UR,+CAA6C0mB,YAAcngC;QAEtD;;;IAWX9B,WAAqBiiC,GAA2ByvB;QAA3BxxD,gBAAA+hC,GAA2B/hC,mBAAAwxD;;;;;;kBAMhD1xD,SAA2B8B;QACzB,IAAM4vD,IAAc10B,KAAKi0B,MAAMnvD;QAQ/B,OALyB,mBAAhB4vD,MAEJ,MADH,EAAC,WAAW,UAAU,YAAWjqD,QAAQiqD,EAAYA,gBAErB,mBAAzBA,EAAYzvB,WAGZ,IAAI0vB,EACTD,EAAYzvB,UACZyvB,EAAYA,gBAGdn2C,GA/WU,qBA+WQ,mCAAiCzZ;QAC5C;;;IAgBb9B;QACEE,uBAAkB2f;;WAElB7f,iBAAAA,SAAe6a;QACb3a,KAAK8+B,kBAAkB9+B,KAAK8+B,gBAAgBpgB,IAAI/D;OAGlD7a,iBAAAA,SAAkB6a;QAChB3a,KAAK8+B,kBAAkB9+B,KAAK8+B,gBAAgBprB,OAAOiH;;;;;;IAOrD7a,iBAAAA;QACE,IAAM+S,IAA0B;YAC9BisB,iBAAiB9+B,KAAK8+B,gBAAgB33B;YACtC+/B,cAAc1iC,KAAKC;;QAErB,OAAOq4B,KAAKC,UAAUlqB;;;IAoCxB/S,WACmBk3B,GACA/I,GACA6B,GACA4hC,GACjB3X;QAEA,cANiB/iB,GACAh3B,gBAAAiuB,GACAjuB,sBAAA8vB,aACA4hC,GA9BnB1xD,UAA6C;QAC7CA,UAAkE,MAClEA,UAEW,MAKXA,UAAmCA,KAAK2xD,GAAsBtd,KAAKr0C,OAKnEA,UAAwB,IAAI0b,GAC1BzW;QAEFjF;;;;;QAOAA,UAAsC,KAS/B4xD,EAA4B3vB,GAAYjiC,KAAKiuB,WAChD,MAAM,IAAI7qB,EACRhD,EAAKc,eACL;;;gBAKJ,IAAM2wD,IAAwB/hC,EAAe/nB,QAC3C,uBACA;QAGF/H,KAAK8xD,UAAU9xD,KAAKiuB,SAASwU,OAAQC,cACrC1iC,KAAKsC,cAAcy3C,GACnB/5C,KAAK+xD,KAAwBrB,GAC3B1wD,KAAK8vB,gBACL9vB,KAAK0xD;QAEP1xD,KAAKgyD;;iBDhYPliC;YAEA,OAAO,+BAAiCA;UC+XpC9vB,KAAK8vB,iBAEP9vB,KAAKiyD,KAAgBjyD,KAAKiyD,GAAct2C,GACtC3b,KAAK0xD,IACL,IAAIQ,KAGNlyD,KAAKmyD,KAAmB,IAAI/mD,OAC1B,wBAA+BymD;QAEjC7xD,KAAKoyD,KAAqB,IAAIhnD,OAC5B,0BAAiCymD,2BAEnC7xD,KAAKqyD,KAAmB,IAAIjnD,OAC1B,wBAA+BymD;QAGjC7xD,KAAKsyD;;iBD1asCxiC;YAC7C,OAAO,4BAA8BA;UCyakB9vB,KAAK8vB;;;;;;;QAQ1D9vB,KAAKiuB,SAASwU,OAAQ4F,iBAAiB,WAAWroC,KAAKuyD;;kGAIzDzyD,SAAmBmuB;QACjB,UAAUA,EAASwU,UAA0C,QAAhCxU,EAASwU,OAAOC;2BAG/C5iC;;;;;;2CAagCE,KAAKuuD,GAAYzP;;;oBAE/C,KAFMrZ,qBAEiBA,OAAAA,cAAAA,MAAlB+sB,cACcxyD,KAAK0xD,OAIhBe,IAAczyD,KAAK4oC,QACvB8nB,GAA+B1wD,KAAK8vB,gBAAgBiS,SAG9CsvB,IAAcE,GAAkBmB,GACpC3wB,GACA0wB,QAGAzyD,KAAKiyD,KAAgBjyD,KAAKiyD,GAAct2C,GACtC01C,EAAYtvB,UACZsvB;oBAkBR,KAZArxD,KAAK2yD,OAICC,IAAkB5yD,KAAK8xD,QAAQlpB,QAAQ5oC,KAAKsyD,SAE1Cd,IAAcxxD,KAAK6yD,GAA0BD,OAEjD5yD,KAAK8yD,GAAuBtB;2BAIZxxD,IAAAA,KAAK+yD,IAAL/yD,cAAAA,KAAfgzD,UACHhzD,KAAK2xD,GAAsBttB;2BAG7BrkC,KAAK+yD,KAAc;;;oBAInB/yD,KAAKiuB,SAASwU,OAAQ4F,iBAAiB,WAAU;wBAAMroC,OAAAA,EAAK0oC;yBAE5D1oC,KAAKkkC;;;;OAGPpkC,iBAAAA,SAAoB+a;QAClB7a,KAAK6oC,QAAQ7oC,KAAKgyD,IAAmBl1B,KAAKC,UAAUliB;OAGtD/a,iBAAAA;QACE,OAAOE,KAAKizD,GAA0BjzD,KAAKiyD;OAG7CnyD,iBAAAA,SAAoB6a;QAClB,IAAImN;QAMJ,OALA9nB,KAAKiyD,GAAc9rD,SAAQ,SAAC4C,GAAKnH;YAC3BA,EAAMk9B,gBAAgBrgB,IAAI9D,OAC5BmN;aAGGA;OAGThoB,iBAAAA,SAAmB2wB;QACjBzwB,KAAKkzD,GAAqBziC,GAAS;OAGrC3wB,iBAAAA,SACE2wB,GACAtO,GACA4M;QAEA/uB,KAAKkzD,GAAqBziC,GAAStO,GAAO4M;;;;QAK1C/uB,KAAKmzD,GAAoB1iC;OAG3B3wB,iBAAAA,SAAoB6a;QAClB,IAAIy4C,IAA+B;;;gBAInC,IAAIpzD,KAAKqzD,GAAoB14C,IAAW;YACtC,IAAM83C,IAAczyD,KAAK8xD,QAAQlpB,QAC/BioB,GAAuC7wD,KAAK8vB,gBAAgBnV;YAG9D,IAAI83C,GAAa;gBACf,IAAMt4B,IAAWi3B,GAAoBsB,GACnC/3C,GACA83C;gBAEEt4B,MACFi5B,IAAaj5B,EAAShY;;;QAQ5B,OAHAniB,KAAKszD,GAAiBC,GAAe54C,IACrC3a,KAAK2yD,MAEES;OAGTtzD,iBAAAA,SAAuB6a;QACrB3a,KAAKszD,GAAiBE,GAAkB74C,IACxC3a,KAAK2yD;OAGP7yD,iBAAAA,SAAmB6a;QACjB,OAAO3a,KAAKszD,GAAiBx0B,gBAAgBrgB,IAAI9D;OAGnD7a,iBAAAA,SAAgB6a;QACd3a,KAAK+lC,WACH8qB,GAAuC7wD,KAAK8vB,gBAAgBnV;OAIhE7a,iBAAAA,SACE6a,GACAwH,GACA4M;QAEA/uB,KAAKyzD,GAAwB94C,GAAUwH,GAAO4M;OAGhDjvB,iBAAAA,SACE+B,GACAg5C,GACAC;QAHFh7C;QAKE+6C,EAAgB10C,SAAQsqB,SAAAA;YACtBzwB,EAAKmzD,GAAoB1iC;aAE3BzwB,KAAKsC,cAAcT,GACnBi5C,EAAc30C,SAAQsqB,SAAAA;YACpBzwB,EAAK0zD,GAAmBjjC;;OAI5B3wB,iBAAAA,SAAe0xD;QACbxxD,KAAK2zD,GAAmBnC;OAG1B1xD,iBAAAA;QACME,KAAKkkC,OACPlkC,KAAKiuB,SAASwU,OAAQ+F,oBACpB,WACAxoC,KAAKuyD,KAEPvyD,KAAK+lC,WAAW/lC,KAAK+xD;QACrB/xD,KAAKkkC;OAIDpkC,sBAAAA,SAAQiJ;QACd,IAAMnH,IAAQ5B,KAAK8xD,QAAQlpB,QAAQ7/B;QAEnC,OADA8c,GAtqBY,qBAsqBM,QAAQ9c,GAAKnH,IACxBA;OAGD9B,sBAAAA,SAAQiJ,GAAanH;QAC3BikB,GA3qBY,qBA2qBM,OAAO9c,GAAKnH,IAC9B5B,KAAK8xD,QAAQjpB,QAAQ9/B,GAAKnH;OAGpB9B,yBAAAA,SAAWiJ;QACjB8c,GAhrBY,qBAgrBM,UAAU9c,IAC5B/I,KAAK8xD,QAAQ/rB,WAAWh9B;OAGlBjJ,iBAAAA,SAAsBukC;QAAtBvkC;QACN,IAAIukC,EAAMuvB,gBAAgB5zD,KAAK8xD,SAAS;YAGtC,IAFAjsC,GAtrBU,qBAsrBQ,SAASwe,EAAMt7B,KAAKs7B,EAAM7wB,WAExC6wB,EAAMt7B,QAAQ/I,KAAK+xD,IAKrB,YAJA12C,GACE;YAMJrb,KAAKg3B,GAAMq4B,IAAiBrrB;;;;wBAC1B,IAAKhkC,KAAKkkC;4BAKV,IAAkB,SAAdG,EAAMt7B,KAIV,IAAI/I,KAAKmyD,GAAiBvqD,KAAKy8B,EAAMt7B,MAAM;gCACzC,IAAsB,QAAlBs7B,EAAM7wB,UAaR,OADMuuB,IAAW/hC,KAAK6zD,GAA6BxvB,EAAMt7B,uBAClD/I,KAAK8zD,GAAuB/xB,GAAU;gCAR7C,IAJMsvB,IAAcrxD,KAAK+zD,GACvB1vB,EAAMt7B,KACNs7B,EAAM7wB,WAGN,wBAAOxT,KAAK8zD,GACVzC,EAAYtvB,UACZsvB;mCAOD,IAAIrxD,KAAKoyD,GAAmBxqD,KAAKy8B,EAAMt7B;gCAC5C,IAAuB,SAAnBs7B,EAAM7wB,aACFwgD,IAAmBh0D,KAAKi0D,GAC5B5vB,EAAMt7B,KACNs7B,EAAM7wB,YAGN,wBAAOxT,KAAKk0D,GAAyBF;mCAGpC,IAAIh0D,KAAKqyD,GAAiBzqD,KAAKy8B,EAAMt7B;gCAC1C,IAAuB,SAAnBs7B,EAAM7wB,aACF2gD,IAAsBn0D,KAAKo0D,GAC/B/vB,EAAMt7B,KACNs7B,EAAM7wB,YAGN,wBAAOxT,KAAKq0D,GAAuBF;mCAGlC,IAAI9vB,EAAMt7B,QAAQ/I,KAAKsyD;gCAC5B,IAAuB,SAAnBjuB,EAAM7wB,aACFg+C,IAAcxxD,KAAK6yD,GAA0BxuB,EAAM7wB,YAEvD,wBAAOxT,KAAK8yD,GAAuBtB;mCAG9BntB,EAAMt7B,QAAQ/I,KAAKgyD,OAKtBn3C,IA0NhB,SACEy5C;gCAEA,IAAIz5C,IAAiBic,GAAe+Q;gCACpC,IAAiB,QAAbysB,GACF;oCACE,IAAMC,IAASz3B,KAAKi0B,MAAMuD;oCAl+BrBjxD,GAo+Be,mBAAXkxD,IAGT15C,IAAiB05C;kCACjB,OAAOtlC;oCACP5T,GAj+BU,qBAi+BQ,kDAAkD4T;;gCAGxE,OAAOpU;6BAhBT,CA1N8DwpB,EAAM7wB,eACnCsjB,GAAe+Q,MACpC7nC,KAAKu2B,GAAuB1b;+BA1D9B7a,KAAK+yD,GAAY1sD,KAAKg+B;;;;;;OAiE9BmwB;aAAAA;YACE,OAAOx0D,KAAKiyD,GAAcnvD,IAAI9C,KAAK0xD;;;;QAG7B5xD,iBAAAA;QACNE,KAAK6oC,QACH7oC,KAAK+xD,IACL/xD,KAAKszD,GAAiBmB;OAIlB30D,iBAAAA,SACN2wB,GACAtO,GACA4M;QAEA,IAAM2lC,IAAgB,IAAIxD,GACxBlxD,KAAKsC,aACLmuB,GACAtO,GACA4M,IAEI6hC,IAAcD,GAClB3wD,KAAK8vB,gBACL9vB,KAAKsC,aACLmuB;QAEFzwB,KAAK6oC,QAAQ+nB,GAAa8D,EAAcD;OAGlC30D,iBAAAA,SAAoB2wB;QAC1B,IAAMmgC,IAAcD,GAClB3wD,KAAK8vB,gBACL9vB,KAAKsC,aACLmuB;QAEFzwB,KAAK+lC,WAAW6qB;OAGV9wD,iBAAAA,SAAmB0xD;QACzB,IAAM/3B,IAAiC;YACrCsI,UAAU/hC,KAAK0xD;YACfF,aAAAA;;QAEFxxD,KAAK8xD,QAAQjpB,QAAQ7oC,KAAKsyD,IAAgBx1B,KAAKC,UAAUtD;OAGnD35B,iBAAAA,SACN6a,GACAwH,GACA4M;QAEA,IAAM4lC,IAAY9D,GAChB7wD,KAAK8vB,gBACLnV,IAEIi6C,IAAiB,IAAIxD,GAAoBz2C,GAAUwH,GAAO4M;QAChE/uB,KAAK6oC,QAAQ8rB,GAAWC,EAAeH;;;;;;IAOjC30D,iBAAAA,SAA6BiJ;QACnC,IAAMmoC,IAAQlxC,KAAKmyD,GAAiBnjD,KAAKjG;QACzC,OAAOmoC,IAAQA,EAAM,KAAK;;;;;;IAOpBpxC,iBAAAA,SACNiJ,GACAnH;QAEA,IAAMmgC,IAAW/hC,KAAK6zD,GAA6B9qD;QAEnD,OAAOwoD,GAAkBmB,GAAoB3wB,GAAUngC;;;;;;IAOjD9B,iBAAAA,SACNiJ,GACAnH;QAEA,IAAMsvC,IAAQlxC,KAAKoyD,GAAmBpjD,KAAKjG,IAGrC0nB,IAAUrmB,OAAO8mC,EAAM,KACvBvQ,eAASuQ,EAAM,KAAmBA,EAAM,KAAK;QACnD,OAAOggB,GAAiBwB,GACtB,IAAIvyD,EAAKwgC,IACTlQ,GACA7uB;;;;;;IAQI9B,iBAAAA,SACNiJ,GACAnH;QAEA,IAAMsvC,IAAQlxC,KAAKqyD,GAAiBrjD,KAAKjG,IAGnC4R,IAAWvQ,OAAO8mC,EAAM;QAC9B,OAAOkgB,GAAoBsB,GAAoB/3C,GAAU/Y;;;;;;IAOnD9B,iBAAAA,SAA0B8B;QAChC,OAAO6vD,GAAkBiB,GAAoB9wD;wBAGvC9B,SACNgxD;;;gBAEA,OAAIA,EAAcjvD,KAAK9B,QAAQC,KAAKsC,YAAYvC,uBAQzCC,KAAKuuD,GAAYsG,GACtB/D,EAAcrgC,SACdqgC,EAAc3uC,OACd2uC,EAAc/hC,YAVdlJ,GAp4BU,qBAs4BR,2CAAyCirC,EAAcjvD,KAAK9B;;;;OAY1DD,iBAAAA,SACN80D;QAEA,OAAO50D,KAAKuuD,GAAYuG,GACtBF,EAAej6C,UACfi6C,EAAezyC,OACfyyC,EAAe7lC;OAIXjvB,iBAAAA,SACNiiC,GACAsvB;QAFMvxD,cAIAi1D,IAAiB1D,IACnBrxD,KAAKiyD,GAAct2C,GAAOomB,GAAUsvB,KACpCrxD,KAAKiyD,GAAcn2C,OAAOimB,IAExBizB,IAAkBh1D,KAAKizD,GAA0BjzD,KAAKiyD,KACtDgD,IAAaj1D,KAAKizD,GAA0B8B,IAE5CG,IAA2B,IAC3BC,IAA6B;QAcnC,OAZAF,EAAW9uD,SAAQwU,SAAAA;YACZq6C,EAAgBv2C,IAAI9D,MACvBu6C,EAAa7uD,KAAKsU;aAItBq6C,EAAgB7uD,SAAQwU,SAAAA;YACjBs6C,EAAWx2C,IAAI9D,MAClBw6C,EAAe9uD,KAAKsU;aAIjB3a,KAAKuuD,GAAY6G,GACtBF,GACAC,GACApyD,MAAK;YACL/C,EAAKiyD,KAAgB8C;;OAIjBj1D,iBAAAA,SAAuB0xD;;;;;;QAMzBxxD,KAAKiyD,GAAcnvD,IAAI0uD,EAAYzvB,aACrC/hC,KAAK4rD,GAAoB4F,EAAYA;OAIjC1xD,iBAAAA,SACNknC;QAEA,IAAIquB,IAAgB11C;QAIpB,OAHAqnB,EAAQ7gC,SAAQ,SAACmvD,GAAK1zD;YACpByzD,IAAgBA,EAAcE,GAAU3zD,EAAMk9B;aAEzCu2B;;;IA4BXv1D;QACEE,UAAqB,IAAIkyD,IACzBlyD,UAA+D,IAE/DA,UAA6C,MAC7CA,UAAkE,MAClEA,UAEW;;WAEXF,iBAAAA,SAAmB2wB;;OAInB3wB,iBAAAA,SACE2wB,GACAtO,GACA4M;;OAKFjvB,iBAAAA,SAAoB6a;QAElB,OADA3a,KAAKw1D,GAAWjC,GAAe54C,IACxB3a,KAAKozD,GAAWz4C,MAAa;OAGtC7a,iBAAAA,SACE6a,GACAwH,GACA4M;QAEA/uB,KAAKozD,GAAWz4C,KAAYwH;OAG9BriB,iBAAAA,SAAuB6a;QACrB3a,KAAKw1D,GAAWhC,GAAkB74C;OAGpC7a,iBAAAA,SAAmB6a;QACjB,OAAO3a,KAAKw1D,GAAW12B,gBAAgBrgB,IAAI9D;OAG7C7a,iBAAAA,SAAgB6a;eACP3a,KAAKozD,GAAWz4C;OAGzB7a,iBAAAA;QACE,OAAOE,KAAKw1D,GAAW12B;OAGzBh/B,iBAAAA,SAAoB6a;QAClB,OAAO3a,KAAKw1D,GAAW12B,gBAAgBrgB,IAAI9D;OAG7C7a,oBAAAA;QAEE,OADAE,KAAKw1D,KAAa,IAAItD,IACflwD,QAAQC;OAGjBnC,iBAAAA,SACE+B,GACAg5C,GACAC;;OAKFh7C,iBAAAA,SAAe0xD;;OAIf1xD,iBAAAA,eAEAA,iBAAAA,SAAoB+a;UCrkCpB/a,SAAmBiJ;IAAA/I,WAAA+I;QAGnBjJ,SAAmBiJ;IAAA/I,WAAA+I;;IA4CnBjJ,WACU2gB;;IAEAg1C;QAFAz1D,aAAAygB,aAEAg1C,GAjBVz1D,UAAsC;;;;;;;QAOtCA;;QAGAA,UAAyByf;;QAEzBzf,UAAsByf,MAOpBzf,KAAK01D,KAAc,IAAI31C,GAAYU,EAAMk1C,GAActhB,KAAK5zB;;WAO9Dm1C;;;;;aAAAA;YACE,OAAO51D,KAAKy1D;;;;;;;;;;;;;;;IAad31D,iBAAAA,SACE8gB,GACAi1C;QAFF/1D,cAIQg2D,IAAYD,IACdA,EAAgBC,KAChB,IAAIC,IACFC,IAAiBH,IACnBA,EAAgBH,KAChB11D,KAAK01D,IACLO,IAAiBJ,IACjBA,EAAgBh1C,KAChB7gB,KAAK6gB,IACLq1C,IAAiBF,GACjBG,QAWEC,IACJp2D,KAAKygB,MAAM41C,QAAqBL,EAAezvD,SAASvG,KAAKygB,MAAMva,QAC/D8vD,EAAel7B,SACf,MACAw7B,IACJt2D,KAAKygB,MAAM81C,QAAoBP,EAAezvD,SAASvG,KAAKygB,MAAMva,QAC9D8vD,EAAennD,UACf;;QAwFN,IAtFA+R,EAAWvE,IACT,SAACtT,GAAkBytD;YACjB,IAAMC,IAAST,EAAelzD,IAAIiG,IAC9BkZ,IAASu0C,aAAuBtkD,KAAWskD,IAAc;YACzDv0C,MAQFA,IAASjiB,EAAKygB,MAAM9G,QAAQsI,KAAUA,IAAS;YAGjD,IAAMy0C,MAA4BD,KAC9Bz2D,EAAK6gB,GAAYpC,IAAIg4C,EAAO1tD,MAE1B4tD,MAA4B10C,MAC9BA,EAAO3L;;;YAGNtW,EAAK6gB,GAAYpC,IAAIwD,EAAOlZ,QAAQkZ,EAAO1P,wBAG5CqkD;;YAGAH,KAAUx0C,IACMw0C,EAAO5jD,OAAOrN,QAAQyc,EAAOpP,UAqBpC6jD,MAA8BC,MACvCb,EAAUe,MAAM;gBAAEt2C;gBAA2B1M,KAAKoO;gBAClD20C,UArBK52D,EAAK82D,GAA4BL,GAAQx0C,OAC5C6zC,EAAUe,MAAM;gBACdt2C;gBACA1M,KAAKoO;gBAEP20C,SAGGR,KACCp2D,EAAKygB,MAAMk1C,GAAc1zC,GAAQm0C,KAAkB,KACpDE,KACCt2D,EAAKygB,MAAMk1C,GAAc1zC,GAAQq0C,KAAmB;;;;YAKtDH,YAOIM,KAAUx0C,KACpB6zC,EAAUe,MAAM;gBAAEt2C;gBAAwB1M,KAAKoO;gBAC/C20C,UACSH,MAAWx0C,MACpB6zC,EAAUe,MAAM;gBAAEt2C;gBAA0B1M,KAAK4iD;gBACjDG,SAEIR,KAAkBE;;;;YAIpBH,UAIAS,MACE30C,KACFi0C,IAAiBA,EAAex3C,IAAIuD,IAElCg0C,IADEU,IACeV,EAAev3C,IAAI3V,KAEnBktD,EAAeviD,OAAO3K,OAGzCmtD,IAAiBA,EAAexiD,OAAO3K;YACvCktD,IAAiBA,EAAeviD,OAAO3K;aAO3C/I,KAAKygB,MAAM41C,QAAqBr2D,KAAKygB,MAAM81C,MAC7C,MAAOL,EAAe3vD,OAAOvG,KAAKygB,MAAYva,SAAE;YAC9C,IAAMuwD,IAASz2D,KAAKygB,MAAM41C,OACtBH,EAAep7B,SACfo7B,EAAernD;YACnBqnD,IAAiBA,EAAexiD,OAAO+iD,EAAQ1tD,MAC/CktD,IAAiBA,EAAeviD,OAAO+iD,EAAQ1tD,MAC/C+sD,EAAUe,MAAM;gBAAEt2C;gBAA0B1M;;;QAQhD,OAAO;YACLkjD,IAAab;YACbc,IAAAlB;YACAmB,IAAAd;YACAe,IAAajB;;OAITn2D,iBAAAA,SACN22D,GACAx0C;;;;;;;;QASA,OACEw0C,EAAOngD,MACP2L,EAAO1P,0BACN0P,EAAO3L;;;;;;;;;;;;;IAeZxW,iBAAAA,SACE8gB,GACAu2C,GACA7zC;QAHFxjB,cASQ6gB,IAAU3gB,KAAK01D;QACrB11D,KAAK01D,KAAc90C,EAAW80C,IAC9B11D,KAAK6gB,KAAcD,EAAWC;;QAE9B,IAAML,IAAUI,EAAWk1C,GAAUsB;QACrC52C,EAAQpS,MAAK,SAACipD,GAAIC;YAsLtB,OAAA,SAA2BD,GAAgBC;gBACzC,IAAMzqC,IAASzM,SAAAA;oBACb,QAAQA;sBACN;wBACE,OAAO;;sBACT;sBAEA;;;;wBAIE,OAAO;;sBACT;wBACE,OAAO;;sBACT;wBACE,OAtdYxa;;;gBA0dlB,OAAOinB,EAAMwqC,KAAMxqC,EAAMyqC;aAnB3B,CApL0BD,EAAG92C,MAAM+2C,EAAG/2C,SAC9BvgB,EAAKygB,MAAMk1C,GAAc0B,EAAGxjD,KAAKyjD,EAAGzjD;aAIxC7T,KAAKu3D,GAAkBj0C;QACvB,IAAMk0C,IAAeL,IACjBn3D,KAAKm3D,OACL,IAEEM,IADsC,MAA7Bz3D,KAAK03D,GAAenxD,QAAcvG,KAAKiI,sCAEhD8Y,IAAmB02C,MAAiBz3D,KAAK23D;QAG/C,OAFA33D,KAAK23D,KAAYF,GAEM,MAAnBj3C,EAAQ7a,UAAiBob,IAcpB;YACLuoC,UAXyB,IAAIpoC,GAC7BlhB,KAAKygB,OACLG,EAAW80C,IACX/0C,GACAH,GACAI,EAAWC,sBACX42C,GACA12C;;YAKA62C,IAAAJ;YAdK;YAAEI,IAAAJ;;;;;;;;IAuBb13D,iBAAAA,SAAuB0xD;QACrB,OAAIxxD,KAAKiI,kCAAWupD;;;;;QAKlBxxD,KAAKiI,SACEjI,KAAK2zB,GACV;YACEojC,IAAa/2D,KAAK01D;YAClBsB,IAAW,IAAIjB;YACfmB,IAAal3D,KAAK6gB;YAClBo2C;;2CAMG;YAAEW,IAAc;;;;;;IAOnB93D,iBAAAA,SAAgBiJ;;QAEtB,QAAI/I,KAAKy1D,GAAiBh3C,IAAI1V;;UAIzB/I,KAAK01D,GAAYj3C,IAAI1V,OAOtB/I,KAAK01D,GAAY5yD,IAAIiG,GAAMuN;;;;;;IAWzBxW,iBAAAA,SAAkBwjB;QAAlBxjB;QACFwjB,MACFA,EAAa1B,GAAezb,SAC1B4C,SAAAA;YAAQ/I,OAAAA,EAAKy1D,KAAmBz1D,EAAKy1D,GAAiB/2C,IAAI3V;aAE5Dua,EAAazB,GAAkB1b,SAAQ4C,SAAAA,SAMvCua,EAAaxB,GAAiB3b,SAC5B4C,SAAAA;YAAQ/I,OAAAA,EAAKy1D,KAAmBz1D,EAAKy1D,GAAiB/hD,OAAO3K;aAE/D/I,KAAKiI,KAAUqb,EAAarb;OAIxBnI,iBAAAA;QAAAA;;gBAEN,KAAKE,KAAKiI,IACR,OAAO;;;gBAKT,IAAM4vD,IAAoB73D,KAAK03D;QAC/B13D,KAAK03D,KAAiBj4C,MACtBzf,KAAK01D,GAAYvvD,SAAQ0N,SAAAA;YACnB7T,EAAK83D,GAAgBjkD,EAAI9K,SAC3B/I,EAAK03D,KAAiB13D,EAAK03D,GAAeh5C,IAAI7K,EAAI9K;;;QAKtD,IAAMyX,IAAiC;QAWvC,OAVAq3C,EAAkB1xD,SAAQ4C,SAAAA;YACnB/I,EAAK03D,GAAej5C,IAAI1V,MAC3ByX,EAAQna,KAAK,IAAI0xD,GAAqBhvD;aAG1C/I,KAAK03D,GAAevxD,SAAQ4C,SAAAA;YACrB8uD,EAAkBp5C,IAAI1V,MACzByX,EAAQna,KAAK,IAAI2xD,GAAmBjvD;aAGjCyX;;;;;;;;;;;;;;;;;;;;;;IAuBT1gB,iBAAAA,SAA8Bm4D;QAC5Bj4D,KAAKy1D,KAAmBwC,EAAY7Z,IACpCp+C,KAAK03D,KAAiBj4C;QACtB,IAAMmB,IAAa5gB,KAAKk4D,GAAkBD,EAAYh3C;QACtD,OAAOjhB,KAAK2zB,GAAa/S;;;;;;;;IAS3B9gB,iBAAAA;QACE,OAAOohB,GAAai3C,GAClBn4D,KAAKygB,OACLzgB,KAAK01D,IACL11D,KAAK6gB,sBACL7gB,KAAK23D;;;ICxbT73D,WACmBm0C,GACAmkB,GACAC,GACAjkB;kBAHAH,aACAmkB,GACAp4D,sBAAAq4D,aACAjkB,GAPnBp0C,UAPkB,GAgBhBA,KAAK60C,KAAU,IAAID,GACjB50C,KAAKi0C;;;WAMTn0C,iBAAAA;QACEE,KAAKs4D;OAGCx4D,iBAAAA;QAAAA;QACNE,KAAK60C,GAAQW,IAAcxR;;;;2BACnB5Q,IAAcpzB,KAAKo4D,GAAYG,OAC/B/kB,IAAcxzC,KAAKw4D,GAAqBplC,OAE5CogB,EACGzwC,MAAK6L,SAAAA;wBACJ5O,EAAKi0C,GAAWzP,IAAiB;4BACxBpR,OAAAA,EACJqlC,SACA11D,MAAK;gCACJ/C,EAAKo0C,GAASnyC,QAAQ2M;gCAEvBg1B,OAAM80B,SAAAA;gCACL14D,EAAK24D,GAAuBD;;;wBAInC90B,OAAMg1B,SAAAA;wBACL54D,EAAK24D,GAAuBC;;;;;OAM9B94D,iBAAAA,SAAqBszB;QAC3B;YACE,IAAMogB,IAAcxzC,KAAKq4D,eAAejlC;YACxC,QACEnpB,EAAkBupC,MACjBA,EAAY5P,SACZ4P,EAAYzwC,OAORywC,KALLxzC,KAAKo0C,GAAShiB,OACZzwB,MAAM;YAED;UAGT,OAAOotB;;YAGP,OADA/uB,KAAKo0C,GAAShiB,OAAOrD,IACd;;OAIHjvB,iBAAAA,SAAuBivB;QAAvBjvB;QACFE,KAAK64D,KAAU,KAAK74D,KAAK84D,GAA4B/pC,MACvD/uB,KAAK64D,MAAW,GAChB74D,KAAKi0C,GAAWzP,IAAiB;mBAC/BxkC,EAAKs4D,MACEt2D,QAAQC;eAGjBjC,KAAKo0C,GAAShiB,OAAOrD;OAIjBjvB,iBAAAA,SAA4BivB;QAClC,IAAmB,oBAAfA,EAAMrtB,MAA0B;;;YAGlC,IAAMJ,IAAQytB,EAAyBztB;YACvC,OACW,cAATA,KACS,0BAATA,MACC6Z,GAAiB7Z;;QAGtB;;UCtCFxB;;;;AAIS2gB;;;;;AAKA9F;;;;;;;AAOAo+C;IAZA/4D,aAAAygB,GAKAzgB,gBAAA2a,GAOA3a,YAAA+4D;QAMTj5D,SAAmBiJ;IAAA/I,WAAA+I;;;;;;;IAQnB/I;;IAsEAF,WACYo4C,GACAkgB;;IAEAY,GACF12D,GACA22D;kBALE/gB,aACAkgB,aAEAY,GACFh5D,mBAAAsC,aACA22D,GA3CVj5D,UAA0D;QAE1DA,UAA8B,IAAIgzB,IAA4BkmC,SAAAA;YAC5DA,OAAAA,EAAE5qD;aAEJtO,UAA4B,IAAI8U;;;;;QAKhC9U,UAAkD;;;;;QAKlDA,UAAoC,IAAI0b,GACtCpT,EAAYvC;;;;;QAMd/F,UAA2C,IAAI8U,KAI/C9U,UAA8B,IAAIm5D;;QAElCn5D,UAAgC;;QAIhCA,UAAiC,IAAI8U,KACrC9U,UAAiC+9B,GAAkBq7B,MAE3Cp5D;;WAWRq5D;aAAAA;YACE;;;;;kFAIFv5D,wBAAAA,SAAUw5D;QAURt5D,KAAKs5D,KAAqBA;;;;;;;yBAQ5Bx5D,SAAa2gB;;;;;;2BACXzgB,KAAKu5D,GAAiB,cAKhBC,IAAYx5D,KAAKy5D,GAAkB32D,IAAI2d;;;;;;;oBAQ3C9F,IAAW6+C,EAAU7+C,UACrB3a,KAAKg5D,GAAkBU,GAAoB/+C,IAC3Cyb,IAAeojC,EAAUT,KAAKY;;;2CAEL35D,KAAKk4C,GAAW0hB,GAAen5C,EAAMrI;;;2BAAxDkM,cAEAqC,IAAS3mB,KAAKg5D,GAAkBU,GACpCp1C,EAAW3J,WAEbA,IAAW2J,EAAW3J,0BACD3a,KAAK65D,GACxBp5C,GACA9F,GACW,cAAXgM;;;oBAHFyP,cAKIp2B,KAAK85D,MACP95D,KAAKo4D,GAAY2B,OAAOz1C;;;oBAI5B,wBAAO8R;;;;;;;;;qBAOCt2B,SACR2gB,GACA9F,GACA1S;;;;;;2CAE0BjI,KAAKk4C,GAAW8hB,GACxCv5C;;;;oBA4BF,OA7BMw3C,cAIAc,IAAO,IAAIkB,GAAKx5C,GAAOw3C,EAAY7Z,KACnC8b,IAAiBnB,EAAKb,GAAkBD,EAAYh3C,YACpDk5C,IAA0B14C,GAAaC,GAC3C/G,GACA1S,iCAAWjI,KAAKwxD;oBAEZjU,IAAawb,EAAKplC,GACtBumC;gDAC4Bl6D,KAAK85D,IACjCK,IAEFn6D,KAAKo6D,GAAoBz/C,GAAU4iC,EAAWia,KAOxC3kD,IAAO,IAAIwnD,GAAU55C,GAAO9F,GAAUo+C;sCAC5C/4D,KAAKy5D,GAAkBhmD,IAAIgN,GAAO5N,IAC9B7S,KAAKs6D,GAAgB77C,IAAI9D,KAC3B3a,KAAKs6D,GAAgBx3D,IAAI6X,GAAWtU,KAAKoa,KAEzCzgB,KAAKs6D,GAAgB7mD,IAAIkH,GAAU,EAAC8F;oBAE/B88B,EAAW+L;;;;;0DAIpBxpD,SAAe2gB;;;;;;;;oBASb,OARAzgB,KAAKu5D,GAAiB,eAEhBC,IAAYx5D,KAAKy5D,GAAkB32D,IAAI2d,KAKvC85C,IAAUv6D,KAAKs6D,GAAgBx3D,IAAI02D,EAAU7+C,WACvChV,SAAS,sBACnB3F,KAAKs6D,GAAgB7mD,IACnB+lD,EAAU7+C,UACV4/C,EAAQ9yD,QAAOyxD,SAAAA;gCAAMA,EAAE1zD,QAAQib;+BAEjCzgB,KAAKy5D,GAAkB/lD,OAAO+M,QAK5BzgB,KAAK85D;;;oBAGP95D,KAAKg5D,GAAkBwB,GAAuBhB,EAAU7+C,WAC5B3a,KAAKg5D,GAAkB3F,GACjDmG,EAAU7+C,kDAIJ3a,KAAKk4C,GACRuiB,GAAcjB,EAAU7+C,2CACxB5X,MAAK;wBACJ/C,EAAKg5D,GAAkB0B,GAAgBlB,EAAU7+C,WACjD3a,EAAKo4D,GAAYuC,GAASnB,EAAU7+C,WACpC3a,EAAK46D,GAAuBpB,EAAU7+C;wBAEvCipB,MAAM2U;;;;;;;;;2BAGXv4C,KAAK46D,GAAuBpB,EAAU7+C,2BAChC3a,KAAKk4C,GAAWuiB,GACpBjB,EAAU7+C;;;;;;;;;;;;;;;;;;;;;;wBAgBhB7a,SAAYqxB,GAAmB0pC;;;;;;oBAC7B76D,KAAKu5D,GAAiB;;;uEAGCv5D,KAAKk4C,GAAW4iB,GAAW3pC;;;2BAA1CviB,cACN5O,KAAKg5D,GAAkBtF,GAAmB9kD,EAAO6hB,UACjDzwB,KAAK+6D,GAAoBnsD,EAAO6hB,SAASoqC,oBACnC76D,KAAKg7D,GAAgCpsD,EAAO4R;;;qDAC5CxgB,KAAKo4D,GAAYtK;;;;;;yCAIjB/+B,IAAQwnB,GAA6BtnB,GAAG,4BAC9C4rC,EAAazoC,OAAOrD;;;;;;;;;;;;;;;;;;;;;;;;;IAqBxBjvB,6BAAAA,SACEm0C,GACAokB,GACAjkB;QAEA,IAAI6mB,GACFhnB,GACAj0C,KAAKo4D,IACLC,GACAjkB,GACA8mB;wBAGJp7D,SAAuBolB;;;;;;oBACrBllB,KAAKu5D,GAAiB;;;uEAEEv5D,KAAKk4C,GAAWsX,GAAiBtqC;;;2BAAjD1E;;oBAEN0E,EAAY7D,GAAclb,SAAQ,SAACmd,GAAc3I;wBAC/C,IAAMwgD,IAAkBn7D,EAAKo7D,GAA+Bt4D,IAC1D6X;wBAEEwgD;;;wBA9W8B93D,GAkX9BigB,EAAa1B,GAAerb,OAC1B+c,EAAazB,GAAkBtb,OAC/B+c,EAAaxB,GAAiBvb,QAC9B,IAGA+c,EAAa1B,GAAerb,OAAO,IACrC40D,EAAgBE,UACP/3C,EAAazB,GAAkBtb,OAAO,IA1XjBlD,GA4X5B83D,EAAgBE,MAGT/3C,EAAaxB,GAAiBvb,OAAO,MA/XhBlD,GAiY5B83D,EAAgBE;wBAGlBF,EAAgBE;yCAMhBr7D,KAAKg7D,GAAgCx6C,GAAS0E;;;;;;;2CAE9CqzB;;;;;;;;;;;;;;;IAQVz4C,iBAAAA,SACE0xD,GACA8J;QAEAt7D,KAAKu5D,GAAiB;QACtB,IAAMgC,IAAmB;QACzBv7D,KAAKy5D,GAAkBtzD,SAAQ,SAACsa,GAAO+4C;YACrC,IAAMjc,IAAaic,EAAUT,KAAKyC,GAAuBhK;YAKrDjU,EAAW+L,YACbiS,EAAiBl1D,KAAKk3C,EAAW+L;aAGrCtpD,KAAKs5D,GAAoBmC,GAAoBjK,IAC7CxxD,KAAKs5D,GAAoB9P,GAAc+R,IACvCv7D,KAAKwxD,cAAcA;wBAGrB1xD,SAAmB6a,GAAoB8X;;;;;;2BACrCzyB,KAAKu5D,GAAiB;;oBAGtBv5D,KAAKg5D,GAAkB0C,GAAiB/gD,GAAU,YAAY8X,IAExD0oC,IAAkBn7D,KAAKo7D,GAA+Bt4D,IAAI6X,KAC1DghD,IAAWR,KAAmBA,EAAgBpyD,QAYlDwY,KAHIA,IAAkB,IAAI7F,GACxBpT,EAAYvC,IAEoB4V,GAChCggD,GACA,IAAIlnD,GAAWknD,GAAUr2D,EAAgByB;oBAErCya,IAAyB/B,KAAiBf,IAAIi9C,IAC9Ct3B,IAAQ,IAAI1iB,GAChBrc,EAAgByB;yCACK,IAAI+N;4CACD,IAAI6J,GAAoB1Z,KAChDsc,GACAC,oBAGIxhB,KAAKwvD,GAAiBnrB;;;;;;;;;oBAO5BrkC,KAAK47D,KAA0B57D,KAAK47D,GAAwB9/C,OAC1D6/C,IAEF37D,KAAKo7D,GAA+B1nD,OAAOiH,IAC3C3a,KAAK67D;;;2CAEC77D,KAAKk4C,GACRuiB,GAAc9/C,qCACd5X,MAAK;wBAAM/C,OAAAA,EAAK46D,GAAuBjgD,GAAU8X;wBACjDmR,MAAM2U;;;;;;;;;;wBAIbz4C,SACEg8D;;;;;;oBAEA97D,KAAKu5D,GAAiB,2BAEhB9oC,IAAUqrC,EAAoB3qC,MAAMV;;;;;oBAM1CzwB,KAAK+7D,GAAoBtrC,cAAoB,OAE7CzwB,KAAKg8D,GAA8BvrC;;;uEAGXzwB,KAAKk4C,GAAW2D,GACpCigB;;;2BADIt7C,cAGNxgB,KAAKg5D,GAAkBiD,GAAoBxrC,GAAS,iCAC9CzwB,KAAKg7D,GAAgCx6C;;;;;;2CAErC+3B;;;;;;;;;;wBAIVz4C,SACE2wB,GACA1B;;;;;;oBAEA/uB,KAAKu5D,GAAiB;;;;;oBAMtBv5D,KAAK+7D,GAAoBtrC,GAAS1B,IAElC/uB,KAAKg8D,GAA8BvrC;;;uEAGXzwB,KAAKk4C,GAAWgkB,GAAYzrC;;;2BAA5CjQ,cACNxgB,KAAKg5D,GAAkBiD,GAAoBxrC,GAAS,YAAY1B,oBAC1D/uB,KAAKg7D,GAAgCx6C;;;;;;2CAErC+3B;;;;;;;;;;;;;;;qBAQVz4C,SAAoC4xB;;;;;;oBAC7B1xB,KAAKo4D,GAAY7L,QACpB1mC,GAhfU,cAkfR;;;;uEAM2B7lB,KAAKk4C,GAAW+D;;;oBAC7C,QvCpiByB,OuCmiBnBkgB,sCAGJzqC,EAASzvB,gBAILm6D,IAAYp8D,KAAKq8D,GAAuBv5D,IAAIq5D,MAAmB,IAC3D91D,KAAKqrB;oBACf1xB,KAAKq8D,GAAuB5oD,IAAI0oD,GAAgBC;;;yCAE1CnL,IAAiB1a,GACrBtnB,GACA;oBAEFyC,EAASU,OAAO6+B;;;;;;;;;;;;IAQZnxD,iBAAAA,SAA8B2wB;SACnCzwB,KAAKq8D,GAAuBv5D,IAAI2tB,MAAY,IAAItqB,SAAQurB,SAAAA;YACvDA,EAASzvB;aAGXjC,KAAKq8D,GAAuB3oD,OAAO+c;;oFAI7B3wB,iBAAAA,SAAwCw8D;QAC9Ct8D,KAAKq8D,GAAuBl2D,SAAQi2D,SAAAA;YAClCA,EAAUj2D,SAAQurB,SAAAA;gBAChBA,EAASU,OAAO,IAAIhvB,EAAehD,EAAKE,WAAWg8D;;aAIvDt8D,KAAKq8D,GAAuBE;OAGtBz8D,iBAAAA,SACN2wB,GACAiB;QAEA,IAAI8qC,IAAex8D,KAAKy8D,GAAsBz8D,KAAKsC,YAAYo6D;QAC1DF,MACHA,IAAe,IAAI9gD,GACjBzW,MAGJu3D,IAAeA,EAAa7gD,GAAO8U,GAASiB,IAC5C1xB,KAAKy8D,GAAsBz8D,KAAKsC,YAAYo6D,OAAWF;;;;;;IAO/C18D,iBAAAA,SAAoB2wB,GAAkB1B;QAC9C,IAAIytC,IAAex8D,KAAKy8D,GAAsBz8D,KAAKsC,YAAYo6D;;;gBAI/D,IAAIF,GAAc;YAChB,IAAM9qC,IAAW8qC,EAAa15D,IAAI2tB;YAC9BiB,MAKE3C,IACF2C,EAASU,OAAOrD,KAEhB2C,EAASzvB,WAEXu6D,IAAeA,EAAa1gD,OAAO2U,KAErCzwB,KAAKy8D,GAAsBz8D,KAAKsC,YAAYo6D,OAAWF;;OAIjD18D,iBAAAA,SACR6a,GACAoU;QAFQjvB;yBAERivB,WAEA/uB,KAAKg5D,GAAkBwB,GAAuB7/C;QAQ9C,KAAoB3a,WAAAA,IAAAA,KAAKs6D,GAAgBx3D,IAAI6X,IAAzB3a,cAAAA;YAAf,IAAMygB;YACTzgB,KAAKy5D,GAAkB/lD,OAAO+M,IAC1BsO,KACF/uB,KAAKs5D,GAAoBqD,GAAal8C,GAAOsO;;QAIjD/uB,KAAKs6D,GAAgB5mD,OAAOiH,IAExB3a,KAAK85D,MACW95D,KAAK48D,GAAkBC,GAAsBliD,GACrDxU,SAAQw1D,SAAAA;YACK37D,EAAK48D,GAAkB9yB,GAAY6xB;;YAGtD37D,EAAK88D,GAAkBnB;;OAMvB77D,iBAAAA,SAAkBiJ;;;QAGxB,IAAMg0D,IAAgB/8D,KAAK47D,GAAwB94D,IAAIiG;QACjC,SAAlBg0D,MAKJ/8D,KAAKo4D,GAAYuC,GAASoC,IAC1B/8D,KAAK47D,KAA0B57D,KAAK47D,GAAwB9/C,OAAO/S,IACnE/I,KAAKo7D,GAA+B1nD,OAAOqpD,IAC3C/8D,KAAK67D;OAGG/7D,iBAAAA,SACR6a,GACA68C;QAEA,KAA0BA,WAAAA,OAAAA,cAAAA;YAArB,IAAMwF;YACLA,aAAuBhF,MACzBh4D,KAAK48D,GAAkBj9B,GAAaq9B,EAAYj0D,KAAK4R,IACrD3a,KAAKi9D,GAAiBD,MACbA,aAAuBjF,MAChClyC,GApoBQ,cAooBU,kCAAkCm3C,EAAYj0D;YAChE/I,KAAK48D,GAAkBh9B,GAAgBo9B,EAAYj0D,KAAK4R,IACnC3a,KAAK48D,GAAkB9yB,GAC1CkzB,EAAYj0D;;YAIZ/I,KAAK88D,GAAkBE,EAAYj0D,QAGrCnD;;OAKE9F,iBAAAA,SAAiBk9D;QACvB,IAAMj0D,IAAMi0D,EAAYj0D;QACnB/I,KAAK47D,GAAwB94D,IAAIiG,OACpC8c,GAtpBU,cAspBQ,4BAA4B9c,IAC9C/I,KAAKk9D,GAAyB72D,KAAK0C;QACnC/I,KAAK67D;;;;;;;;;;IAYD/7D,iBAAAA;QACN,MACEE,KAAKk9D,GAAyBv3D,SAAS,KACvC3F,KAAK47D,GAAwBr1D,OAAOvG,KAAKi5D,MACzC;YACA,IAAMlwD,IAAM/I,KAAKk9D,GAAyB/M,SACpC4M,IAAgB/8D,KAAKm9D,GAAuB90D;YAClDrI,KAAKo7D,GAA+B3nD,IAClCspD,GACA,IAAIK,GAAgBr0D,KAEtB/I,KAAK47D,KAA0B57D,KAAK47D,GAAwBjgD,GAC1D5S,GACAg0D,IAEF/8D,KAAKo4D,GAAY2B,OACf,IAAI7+C,GACF9D,GAAM0T,GAAO/hB,EAAIzB,MAAM8Q,MACvB2kD,6BAEAjmC,GAAe+Q;;;;IAOvB/nC,iBAAAA;QACE,OAAOE,KAAK47D;;;IAId97D,iBAAAA;QACE,OAAOE,KAAKk9D;wBAGJp9D,SACR0gB,GACA0E;;;;;;2BAEMm4C,IAA2B,IAC3BC,IAA2C,IAC3CC,IAAyC,IAE/Cv9D,KAAKy5D,GAAkBtzD,SAAQ,SAACge,GAAGq1C;wBACjC+D,EAAiBl3D,KACfrE,QAAQC,UACLc,MAAK;4BACJ,IAAMm3D,IAAiBV,EAAUT,KAAKb,GAAkB13C;4BACxD,OAAK05C,EAAe/D,KAMbn2D,EAAKk4C,GACT8hB,GAAaR,EAAU/4C,qCACvB1d,MAAK;oCAAGke;gCACAu4C,OAAAA,EAAUT,KAAKb,GACpBj3C,GACAi5C;kCAVGA;;;;oDAcVn3D,MAAMm3D,SAAAA;4BACL,IAAM52C,IACJ4B,KAAeA,EAAY7D,GAAcve,IAAI02D,EAAU7+C,WACnD4iC,IAAaic,EAAUT,KAAKplC,GAChCumC;wDAC4Bl6D,EAAK85D,IACjCx2C;4BAMF,IAJAtjB,EAAKo6D,GACHZ,EAAU7+C,UACV4iC,EAAWia,KAETja,EAAW+L,UAAU;gCACnBtpD,EAAK85D,MACP95D,EAAKg5D,GAAkB0C,GACrBlC,EAAU7+C,UACV4iC,EAAW+L,SAASxoC,YAAY,gBAAgB,YAIpDu8C,EAASh3D,KAAKk3C,EAAW+L;gCACzB,IAAM1oC,IAAayV,GAAiBmnC,GAClChE,EAAU7+C,UACV4iC,EAAW+L;gCAEbgU,EAAqBj3D,KAAKua;;;yCAM9B5e,QAAQswB,IAAIirC;;;qCAClBv9D,KAAKs5D,GAAoB9P,GAAc6T,oBACjCr9D,KAAKk4C,GAAWulB,GAAuBH;;;;;;;OAGrCx9D,iBAAAA,SAAiB49D,wBAO3B59D,SAA6B+B;;;;;;2BACN7B,KAAKsC,YAAYkD,QAAQ3D,2CAGvB7B,KAAKk4C,GAAWylB,GAAiB97D;;;2BAAhD+M,cACN5O,KAAKsC,cAAcT;;oBAGnB7B,KAAK49D,GACH;;oBAGF59D,KAAKg5D,GAAkB2E,GACrB97D,GACA+M,EAAOisC,IACPjsC,EAAOksC,qBAEH96C,KAAKg7D,GAAgCpsD,EAAOqsC;;;;;;2CAG9Cj7C,KAAKo4D,GAAYyF;;;;;;;OAGzB/9D,4BAAAA;QACE,OAAOE,KAAKo4D,GAAY1K;OAG1B5tD,6BAAAA;QACE,OAAOE,KAAKo4D,GAAY0F;OAG1Bh+D,iBAAAA,SAAuB6a;QACrB,IAAMwgD,IAAkBn7D,KAAKo7D,GAA+Bt4D,IAAI6X;QAChE,IAAIwgD,KAAmBA,EAAgBE,IACrC,OAAO57C,KAAiBf,IAAIy8C,EAAgBpyD;QAE5C,IAAIg1D,IAASt+C,MACP86C,IAAUv6D,KAAKs6D,GAAgBx3D,IAAI6X;QACzC,KAAK4/C,GACH,OAAOwD;QAET,KAAoBxD,WAAAA,IAAAA,GAAAA,cAAAA,KAAS;YAAxB,IAAM95C,UACH+4C,IAAYx5D,KAAKy5D,GAAkB32D,IAAI2d;YAE7Cs9C,IAASA,EAAOxI,GAAUiE,EAAUT,KAAKiF;;QAE3C,OAAOD;;;IAiBXj+D,WACYo4C,GACVkgB,GACAY,GACA12D,GACA22D;QALFn5D;gBAOE0B,IAAAA,aACE02C,GACAkgB,GACAY,GACA12D,GACA22D,iBAXQ/gB;;;;QAHZl4C;;WALsCi+D,mBAuBtC5E;aAAAA;YACE,cAAOr5D,KAAKk+D;;;;QAGdp+D,4BAAAA;QAEE,OADAE,KAAKk4C,GAAW2G,QACTr9C,YAAMksD;OAGf5tD,6BAAAA;QAEE,OADAE,KAAKk4C,GAAW2G,QACTr9C,YAAMs8D;;;;;;qBAOPh+D,SACN05D;;;;;;2CAE0Bx5D,KAAKk4C,GAAW8hB,GACxCR,EAAU/4C;;;;oBASZ,OAVMw3C,cAIA7hC,IAAeojC,EAAUT,KAAKoF,GAClClG,sBAEEj4D,KAAKk+D,MACPl+D,KAAKo6D,GAAoBZ,EAAU7+C,UAAUyb,EAAaohC;oBAErDphC;;;;OAGTt2B,iBAAAA,SACE0xD,GACA8J;;;QAIIt7D,KAAK85D,8BAAmBwB,MAC1B95D,YAAMg6D,cAAuBhK,GAAa8J,IAC1Ct7D,KAAKg5D,GAAkBoF,GAAe5M;;;;;QAQrCxxD,KAAK85D,oCACNwB,KAEA95D,YAAMg6D,cAAuBhK,GAAa8J;wBAI9Cx7D,SACE2wB,GACA4tC,GACAtvC;;;;;;2BAEA/uB,KAAKu5D,GAAiB,sCACEv5D,KAAKk4C,GAAWomB,GAAwB7tC;;;2BAE9C,UAFZxP,sCAca,cAAfo9C,0CAIIr+D,KAAKo4D,GAAYtK;;;;;;;;;oBACC,mBAAfuQ,KAAgD,eAAfA;;;oBAG1Cr+D,KAAK+7D,GAAoBtrC,GAAS1B,KAAgB,OAClD/uB,KAAKk4C,GAAWqmB,GAAkC9tC,MAElD7qB;;;2CAGI5F,KAAKg7D,GAAgC/5C;;;;;;;;;;;;;oBAlBzC4E,GAv6BU,cAu6BQ,0CAA0C4K;;;;;;;wBAqBhE3wB,SAAwBsjC;;;;;;kCAClBA,YAAsBpjC,KAAKk+D,4BAOvB7I,IAAgBr1D,KAAKg5D,GAAkBwF,sBACjBx+D,KAAKy+D,GAC/BpJ,EAAcluD;;;;2BADVu3D,cAIN1+D,KAAKk+D,yBACCl+D,KAAKo4D,GAAYuG;;;oBACvB,sBAAyBD,IAAAA,GAAAA,cAAAA,KAApBE,UACH5+D,KAAKo4D,GAAY2B,OAAOz1C;;;;kCAEjB8e,YAAuBpjC,KAAKk+D,4BAC/B7I,IAA4B,IAE9Bj7C,IAAIpY,QAAQC;oBAChBjC,KAAKs6D,GAAgBn0D,SAAQ,SAACge,GAAGxJ;wBAC3B3a,EAAKg5D,GAAkB6F,GAAmBlkD,KAC5C06C,EAAchvD,KAAKsU,KAEnBP,IAAIA,EAAErX,MAAK;mCACT/C,EAAK46D,GAAuBjgD,IACrB3a,EAAKk4C,GAAWuiB,GACrB9/C;;6BAKN3a,EAAKo4D,GAAYuC,GAAShgD;yCAEtBP;;;qDAEApa,KAAKy+D,GACTpJ;;;;qCAGFr1D,KAAK8+D,MACL9+D,KAAKk+D,yBACCl+D,KAAKo4D,GAAYuG;;;;;;;;;;OAInB7+D,iBAAAA;QAAAA;QACNE,KAAKo7D,GAA+Bj1D,SAAQ,SAACge,GAAGxJ;YAC9C3a,EAAKo4D,GAAYuC,GAAShgD;aAE5B3a,KAAK48D,GAAkBmC,MACvB/+D,KAAKo7D,KAAiC,IAAItmD,KAC1C9U,KAAK47D,KAA0B,IAAIlgD,GACjCpT,EAAYvC;;;;;;;;;;;qBAaRjG,SACNilB,GACAi6C;;;;;;oBAEMN,IAA8B,IAC9BnD,IAAmC,WAClBx2C;;;2BAAAA,gBAAlBk6C,UACC36C,aACEi2C,IAAUv6D,KAAKs6D,GAAgBx3D,IAAI6X,OAEP,MAAnB4/C,EAAQ50D,yBAKf3F,KAAKk4C,GAAWuiB,GACpB9/C;;;;;;;;qDAGiB3a,KAAKk4C,GAAW0hB,GACjCW,EAAQ,GAAGniD;;;;;;;oBADbkM,qBAIoBi2C,IAAAA;;;2BAAAA,gBAAf2E,UACG1F,IAAYx5D,KAAKy5D,GAAkB32D,IAAI2d,oBAGpBzgB,KAAKm/D,GAC5B3F;;;qBADIjc,cAGS+L,YACbiS,EAAiBl1D,KAAKk3C,EAAW+L;;;2BARjBiR;;;;;;2CAkBCv6D,KAAKk4C,GAAWknB,GAAUzkD;;;2BAAzCD,8BAEa1a,KAAKk4C,GAAW0hB,GAAel/C;;;2BAAlD4J,8BACMtkB,KAAK65D,GACT75D,KAAKq/D,OACL1kD;;;;;;;oBAKJ+jD,EAAcr4D;;;2BA7CO0e;;;oBAiDvB,yBADA/kB,KAAKs5D,GAAoB9P,GAAc+R,IAChCmD;;;;;;;;;;;;;;;IAaD5+D,iBAAAA,SAAwB4a;QAC9B,OAAO,IAAItD,GACTsD,EAAOpT,MACPoT,EAAOjE,iBACPiE,EAAOhE,SACPgE,EAAO/D,SACP+D,EAAOxU,yBAEPwU,EAAO9D,SACP8D,EAAO7D;OAIX/W,iBAAAA;QACE,OAAOE,KAAKk4C,GAAW4G;wBAGzBh/C,SACE6a,GACAwH,GACA4M;;;;;;2BAEI/uB,KAAKk+D;;;oBAGPr4C,GA7lCU,cA6lCQ;;;yBAIhB7lB,KAAKs6D,GAAgB77C,IAAI9D,IAAzB3a;4BACMmiB;2BACD;2BACA;wBAAA;;2BAYA;wBAAA;;;;;2CAXmBniB,KAAKk4C,GAAW8G;;;2BAAhCx+B,cACA8+C,IAAyB39C,GAAY49C,GACzC5kD,GACU,cAAVwH,oBAEIniB,KAAKg7D,GACTx6C,GACA8+C;;;oBAEF;;;2CAGMt/D,KAAKk4C,GAAWuiB,GACpB9/C;;;;oBAIF,iBADA3a,KAAK46D,GAAuBjgD,GAAUoU;;;oBAItCnpB;;;;;;;wBAKR9F,SACEk5B,GACAwmC;;;;;;yBAEKx/D,KAAKk+D,IAALl+D;2BAIkBg5B;;;2BAAAA,gBAAlBymC,UACCz/D,KAAKs6D,GAAgB77C,IAAI9D;;oBAE3BkL,GAzoCQ,cAyoCU,qCAAqClL,2CAIpC3a,KAAKk4C,GAAWknB,GAAUzkD;;;2BAAzCD,8BAKmB1a,KAAKk4C,GAAW0hB,GAAel/C;;;2BAAlD4J,8BACAtkB,KAAK65D,GACT75D,KAAKq/D,GAAwB3kD,IAC7B4J,EAAW3J;;;;8BAGb3a,KAAKo4D,GAAY2B,OAAOz1C;;;2BAlBH0U;;;iCAqBZre;;;;uCAGJ3a,EAAKs6D,GAAgB77C,IAAI9D,qBAKxB3a,EAAKk4C,GACRuiB,GAAc9/C,qCACd5X,MAAK;oCACJ/C,EAAKo4D,GAAYuC,GAAShgD,IAC1B3a,EAAK46D,GAAuBjgD;oCAE7BipB,MAAM2U;;;;;;;;;;;wCAdYinB;;;2BAAAA,gBAAlBE,6BAAM/kD;;;;;;2BAAY6kD;;;;;;;;EApVavB,UCt3BxCn+D;IACEE,kBACAA,UAA6B;;IAyB7BF,WAAoByuD;kBAAAA,GARpBvuD,UAAkB,IAAIgzB,IAAqCkmC,SAAAA;YACzDA,OAAAA,EAAE5qD;aAGItO,6CAERA,UAAwD,IAAI2qD,KAG1D3qD,KAAKuuD,GAAWoR,UAAU3/D;;gCAG5BF,SAAa+zB;;;;;;wBACLpT,IAAQoT,EAASpT,OACnBm/C,SAEAC,IAAY7/D,KAAKu6D,GAAQz3D,IAAI2d,QAE/Bm/C,QACAC,IAAY,IAAIC,MAGdF,GALCC;;;;uDAODA,IAAAA,mBAA2B7/D,KAAKuuD,GAAWwL,OAAOt5C;;;2BAAlDo/C,EAAUE;;;oBAOV,qBALM9O,IAAiB1a,GACrBtnB,GACA,8BAA4B4E,EAASpT;0CAEvCoT,EAASmsC,QAAQ/O;;;2BAKrBjxD,KAAKu6D,GAAQ9mD,IAAIgN,GAAOo/C,IACxBA,EAAUI,GAAU55D,KAAKwtB;;oBAGLA,EAAS2nC,GAAuBx7D,KAAKwxD,cAMrDqO,EAAUE,MACQlsC,EAASqsC,GAAeL,EAAUE,OAEpD//D,KAAKmgE;;;;wBAKXrgE,SAAe+zB;;;;gBAab,OAZMpT,IAAQoT,EAASpT,OACnB2/C,SAEEP,IAAY7/D,KAAKu6D,GAAQz3D,IAAI2d,QAE3Bha,IAAIo5D,EAAUI,GAAU14D,QAAQssB,OAC7B,MACPgsC,EAAUI,GAAUzvC,OAAO/pB,GAAG;gBAC9B25D,IAA4C,MAA/BP,EAAUI,GAAUt6D,SAIjCy6D,sBACFpgE,KAAKu6D,GAAQ7mD,OAAO+M,IACbzgB,KAAKuuD,GAAWoM,GAASl6C;;;OAIpC3gB,iBAAAA,SAAcugE;QAEZ,KADA,IAAIC,eACmBD,OAAAA,cAAAA,KAAW;YAA7B,IAAMN,UACHt/C,IAAQs/C,EAASt/C,OACjBo/C,IAAY7/D,KAAKu6D,GAAQz3D,IAAI2d;YACnC,IAAIo/C,GAAW;gBACb,KAAuBA,WAAAA,IAAAA,EAAUI,IAAVJ,cAAAA;yBACRK,GAAeH,OAC1BO;;gBAGJT,EAAUE,KAAWA;;;QAGrBO,KACFtgE,KAAKmgE;OAITrgE,iBAAAA,SAAa2gB,GAAcsO;QACzB,IAAM8wC,IAAY7/D,KAAKu6D,GAAQz3D,IAAI2d;QACnC,IAAIo/C,GACF,KAAuBA,WAAAA,IAAAA,EAAUI,IAAVJ,cAAAA;iBACZG,QAAQjxC;;;;gBAMrB/uB,KAAKu6D,GAAQ7mD,OAAO+M;OAGtB3gB,iBAAAA,SAAoB0xD;QAClBxxD,KAAKwxD,cAAcA;QACnB,IAAI8O;QACJtgE,KAAKu6D,GAAQp0D,SAAQ,SAACge,GAAG07C;YACvB,KAAuBA,WAAAA,IAAAA,EAAUI,IAAVJ,cAAAA;;qBAERrE,GAAuBhK,OAClC8O;;aAIFA,KACFtgE,KAAKmgE;OAITrgE,iBAAAA,SAA2BygE;QACzBvgE,KAAKwgE,GAAyB9hD,IAAI6hD;;;QAGlCA,EAASl4D;OAGXvI,iBAAAA,SAA8BygE;QAC5BvgE,KAAKwgE,GAAyB9sD,OAAO6sD;;;IAI/BzgE,iBAAAA;QACNE,KAAKwgE,GAAyBr6D,SAAQo6D,SAAAA;YACpCA,EAASl4D;;;;IAmCbvI,WACW2gB,GACDggD,GACRpqD;QAFSrW,aAAAygB,aACDggD;;;;;QAVVzgE,cAIAA,UAAoC,MAE5BA,6CAONA,KAAKqW,UAAUA,KAAW;;;;;;;;WAS5BvW,iBAAAA,SAAe4gE;QAMb,KAAK1gE,KAAKqW,QAAQsqD,wBAAwB;YAGxC;;YADA,IAAM//C,IAAmC,WACjB8/C,IAAAA,EAAK9/C,YAAL8/C,cAAAA;gBAAnB,IAAMv9C;qCACLA,EAAU5C,QACZK,EAAWva,KAAK8c;;YAGpBu9C,IAAO,IAAIx/C,GACTw/C,EAAKjgD,OACLigD,EAAKhgD,MACLggD,EAAK//C,IACLC,GACA8/C,EAAK7/C,IACL6/C,EAAK5/C,WACL4/C,EAAK3/C;;;QAIT,IAAIu/C;QAYJ,OAXKtgE,KAAK4gE,KAKC5gE,KAAK6gE,GAAiBH,OAC/B1gE,KAAKygE,GAAcp4D,KAAKq4D,IACxBJ,UANItgE,KAAK8gE,GAAwBJ,GAAM1gE,KAAKwxD,iBAC1CxxD,KAAK+gE,GAAkBL;QACvBJ,SAOJtgE,KAAK0gE,KAAOA,GACLJ;OAGTxgE,sBAAAA,SAAQivB;QACN/uB,KAAKygE,GAAc1xC,MAAMA;;kDAI3BjvB,iBAAAA,SAAuB0xD;QACrBxxD,KAAKwxD,cAAcA;QACnB,IAAI8O;QASJ,OAPEtgE,KAAK0gE,OACJ1gE,KAAK4gE,MACN5gE,KAAK8gE,GAAwB9gE,KAAK0gE,IAAMlP,OAExCxxD,KAAK+gE,GAAkB/gE,KAAK0gE,KAC5BJ;QAEKA;OAGDxgE,iBAAAA,SACN4gE,GACAlP;;QAQA,KAAKkP,EAAK5/C,WACR;;;gBAKF,IAAMkgD,gCAAcxP;;;gBAGpB,SAAIxxD,KAAKqW,QAAQ4qD,MAAyBD,KASlCN,EAAKhgD,KAAKtX,mCAAaooD;;WAGzB1xD,iBAAAA,SAAiB4gE;;;;;QAKvB,IAAIA,EAAK9/C,WAAWjb,SAAS,GAC3B;QAGF,IAAMu7D,IACJlhE,KAAK0gE,MAAQ1gE,KAAK0gE,GAAKlqD,qBAAqBkqD,EAAKlqD;QACnD,UAAIkqD,EAAK3/C,OAAoBmgD,aACpBlhE,KAAKqW,QAAQsqD;;;;WAShB7gE,iBAAAA,SAAkB4gE;QAKxBA,IAAOx/C,GAAai3C,GAClBuI,EAAKjgD,OACLigD,EAAKhgD,MACLggD,EAAK7/C,IACL6/C,EAAK5/C,YAEP9gB,KAAK4gE,SACL5gE,KAAKygE,GAAcp4D,KAAKq4D;;;;WC3S1B5gE,iBAAAA,SAAsBq6C;QACpBn6C,KAAKmhE,KAAqBhnB;OAG5Br6C,iBAAAA,SACEszB,GACA3S,GACA1F,GACAqjC;QAJFt+C;;;;gBAcE,OAAI2gB,EAAM2gD,QAMNrmD,EAA6BvV,QAAQF,EAAgByB,SALhD/G,KAAKqhE,GAA0BjuC,GAAa3S,KAS9CzgB,KAAKmhE,GAAoBnmB,GAAa5nB,GAAagrB,GAAY/1C,MACpE4Y,SAAAA;YACE,IAAMqgD,IAAkBthE,EAAKuhE,GAAW9gD,GAAOQ;YAE/C,QACGR,EAAM41C,QAAqB51C,EAAM81C,SAClCv2D,EAAKm2D,GACH11C,EAAMvJ,IACNoqD,GACAljB,GACArjC,KAGK/a,EAAKqhE,GAA0BjuC,GAAa3S,MAGjD2N,QAAiBK,WAASC,SAC5B7I,GACE,wBACA,yDACA9K,EAA6BtZ,YAC7Bgf,EAAMhf;YAMHzB,EAAKmhE,GAAoB3rC,GAC9BpC,GACA3S,GACA1F,GACA1S,MAAKm5D,SAAAA;;;;uBAILF,EAAgBn7D,SAAQ0N,SAAAA;oBACtB2tD,IAAiBA,EAAe7lD,GAAO9H,EAAI9K,KAAK8K;qBAE3C2tD;;;;;;4EAOP1hE,iBAAAA,SACN2gB,GACAQ;;;QAIA,IAAIwU,IAAe,IAAI9W,IAAoB,SAACtG,GAAIC;YAC9CmI,OAAAA,EAAMk1C,GAAct9C,GAAIC;;QAO1B,OALA2I,EAAU9a,SAAQ,SAACge,GAAGlS;YAChBA,aAAoBC,MAAYuO,EAAM9G,QAAQ1H,OAChDwjB,IAAeA,EAAa/W,IAAIzM;aAG7BwjB;;;;;;;;;;;;;IAcD31B,iBAAAA,SACNoX,GACAuqD,GACArjB,GACAsjB;;;QAIA,IAAItjB,EAAW73C,SAASk7D,EAAsBl7D,MAC5C;;;;;;;;;gBAWF,IAAMo7D,wBACJzqD,IACIuqD,EAAsB3mC,SACtB2mC,EAAsB5yD;QAC5B,SAAK8yD,MAKHA,EAAenrD,oBACfmrD,EAAehwD,QAAQnE,EAAUk0D,KAA4B;OAIzD5hE,iBAAAA,SACNszB,GACA3S;QAUA,OARI2N,QAAiBK,WAASC,SAC5B7I,GACE,wBACA,gDACApF,EAAMhf;QAIHzB,KAAKmhE,GAAoB3rC,GAC9BpC,GACA3S,GACAnb,EAAgByB;;;ICxJpBjH,WACmBm0B,GACA+J;kBADA/J,aACA+J;;;;;QAhBnBh+B,UAAyC;;QAGzCA,UAA+B;;;;;QAMvBA,uBAA8BuJ,EAAW0R;;QAGjDjb,UAA+B,IAAI2e,GAAUwgC,GAAaC;;WAO1Dt/C,iBAAAA,SAAWszB;QACT,OAAOjB,GAAmBlwB,QAAsC,MAA9BjC,KAAKg0B,GAAcruB;OAGvD7F,iBAAAA,SACEszB,GACAjC,GACAE;QAEA,IAAMZ,IAAUU,EAAMV,SAChBmxC,IAAa5hE,KAAK6hE,GAAuBpxC,GAAS;QAiBxD,OA9C8BptB,GA+Bb,MAAfu+D;;QAKY5hE,KAAKg0B,GAAc4tC,IASjC5hE,KAAK4qC,kBAAkBvZ,GAChBc,GAAmBlwB;OAG5BnC,iBAAAA,SACEszB;QAEA,OAAOjB,GAAmBlwB,QAAQjC,KAAK4qC;OAGzC9qC,iBAAAA,SACEszB,GACA/B;QAGA,OADArxB,KAAK4qC,kBAAkBvZ,GAChBc,GAAmBlwB;OAG5BnC,iBAAAA,SACEszB,GACAtoB,GACA4lB,GACAC;QAIA,IAAMF,IAAUzwB,KAAKurC;QACrBvrC,KAAKurC,MAEDvrC,KAAKg0B,GAAcruB,SAAS,KAChB3F,KAAKg0B,GAAch0B,KAAKg0B,GAAcruB,SAAS;QAO/D,IAAMwrB,IAAQ,IAAIgQ,GAChB1Q,GACA3lB,GACA4lB,GACAC;QAEF3wB,KAAKg0B,GAAc3tB,KAAK8qB;;QAGxB,KAAuBR,WAAAA,OAAAA,cAAAA;YAAlB,IAAMzH;YACTlpB,KAAK8hE,KAAuB9hE,KAAK8hE,GAAqBpjD,IACpD,IAAIygC,GAAaj2B,EAASngB,KAAK0nB,KAGjCzwB,KAAKi0B,GAAauJ,GAChBpK,GACAlK,EAASngB,IAAIzB,KAAK8jB;;QAItB,OAAO+G,GAAmBlwB,QAAQkvB;OAGpCrxB,iBAAAA,SACEszB,GACA3C;QAEA,OAAO0B,GAAmBlwB,QAAQjC,KAAK+hE,GAAkBtxC;OAG3D3wB,iBAAAA,SACEszB,GACA3C;QAEA,IAAM8a,IAAc9a,IAAU,GAIxBuxC,IAAWhiE,KAAKiiE,GAAe12B,IAC/B/kC,IAAQw7D,IAAW,IAAI,IAAIA;;;gBACjC,OAAO7vC,GAAmBlwB,QACxBjC,KAAKg0B,GAAcruB,SAASa,IAAQxG,KAAKg0B,GAAcxtB,KAAS;OAIpE1G,iBAAAA;QACE,OAAOqyB,GAAmBlwB,QACM,MAA9BjC,KAAKg0B,GAAcruB,U1CvIM,I0CuI2B3F,KAAKurC,KAAc;OAI3EzrC,iBAAAA,SACEszB;QAEA,OAAOjB,GAAmBlwB,QAAQjC,KAAKg0B,GAAc/tB;OAGvDnG,iBAAAA,SACEszB,GACAC;QAFFvzB,cAIQwe,IAAQ,IAAI6gC,GAAa9rB,GAAa,IACtCzsB,IAAM,IAAIu4C,GAAa9rB,GAAajpB,OAAOk1B,oBAC3C1wB,IAA0B;QAchC,OAbA5O,KAAK8hE,GAAqBjiB,GAAe,EAACvhC,GAAO1X,MAAM24C,SAAAA;YAKrD,IAAMpuB,IAAQnxB,EAAK+hE,GAAkBxiB,EAAIS;YAKzCpxC,EAAOvI,KAAK8qB;aAGPgB,GAAmBlwB,QAAQ2M;OAGpC9O,iBAAAA,SACEszB,GACAI;QAFF1zB,cAIMisC,IAAiB,IAAIptB,GAAkB1Z;QAe3C,OAbAuuB,EAAartB,SAAQktB,SAAAA;YACnB,IAAM/U,IAAQ,IAAI6gC,GAAa9rB,GAAa,IACtCzsB,IAAM,IAAIu4C,GAAa9rB,GAAajpB,OAAOk1B;YACjDt/B,EAAK8hE,GAAqBjiB,GAAe,EAACvhC,GAAO1X,MAAM24C,SAAAA;gBAMrDxT,IAAiBA,EAAertB,IAAI6gC,EAAIS;;aAIrC7tB,GAAmBlwB,QAAQjC,KAAKkiE,GAAoBn2B;OAG7DjsC,iBAAAA,SACEszB,GACA3S;;;QAQA,IAAM0hD,IAAS1hD,EAAMnZ,MACfi0B,IAA8B4mC,EAAOx8D,SAAS,GAMhDy8D,IAAYD;;;;;gBACX75D,EAAY0O,GAAcorD,OAC7BA,IAAYA,EAAUtsD,MAAM;QAG9B,IAAMwI,IAAQ,IAAI6gC,GAAa,IAAI72C,EAAY85D,IAAY,IAIvDr2B,IAAiB,IAAIptB,GAAkB1Z;;;gBAmB3C,OAjBAjF,KAAK8hE,GAAqB78C,IAAas6B,SAAAA;YACrC,IAAM8iB,IAAa9iB,EAAIx2C,IAAIzB;YAC3B,SAAK66D,EAAO7wD,EAAW+wD;;;;;;YAQjBA,EAAW18D,WAAW41B,MACxBwQ,IAAiBA,EAAertB,IAAI6gC,EAAIS;YAI3C1hC,IAEI6T,GAAmBlwB,QAAQjC,KAAKkiE,GAAoBn2B;OAGrDjsC,iBAAAA,SAAoBssC;QAApBtsC,cAGA8O,IAA0B;;;gBAOhC,OANAw9B,EAASjmC,SAAQsqB,SAAAA;YACf,IAAMU,IAAQnxB,EAAK+hE,GAAkBtxC;YACvB,SAAVU,KACFviB,EAAOvI,KAAK8qB;aAGTviB;OAGT9O,iBAAAA,SACEszB,GACAjC;QAFFrxB;QArPgCuD,GA4Pb,MAFErD,KAAK6hE,GAAuB1wC,EAAMV,SAAS,aAK9DzwB,KAAKg0B,GAAcm8B;QAEnB,IAAImS,IAAatiE,KAAK8hE;QACtB,OAAO3vC,GAAmBhsB,QAAQgrB,EAAMR,YAAYzH,SAAAA;YAClD,IAAMq2B,IAAM,IAAIJ,GAAaj2B,EAASngB,KAAKooB,EAAMV;YAEjD,OADA6xC,IAAaA,EAAW5uD,OAAO6rC,IACxBv/C,EAAKg+B,GAAkBuO,GAC5BnZ,GACAlK,EAASngB;YAEVV,MAAK;YACNrI,EAAK8hE,KAAuBQ;;OAIhCxiE,iBAAAA,SAAyB2wB;;OAIzB3wB,iBAAAA,SACE45B,GACA3wB;QAEA,IAAMw2C,IAAM,IAAIJ,GAAap2C,GAAK,IAC5B+2C,IAAW9/C,KAAK8hE,GAAqB/hB,GAAkBR;QAC7D,OAAOptB,GAAmBlwB,QAAQ8G,EAAIvD,QAAQs6C,KAAYA,EAAS/2C;OAGrEjJ,iBAAAA,SACE45B;QAQA,OANI15B,KAAKg0B,GAAcruB,QAMhBwsB,GAAmBlwB;;;;;;;;;;IAWpBnC,iBAAAA,SAAuB2wB,GAAkBrU;QAM/C,OALcpc,KAAKiiE,GAAexxC;;;;;;;;;;;IAiB5B3wB,iBAAAA,SAAe2wB;QACrB,OAAkC,MAA9BzwB,KAAKg0B,GAAcruB,SAEd,IAQF8qB,IADczwB,KAAKg0B,GAAc,GAAGvD;;;;;;;;;;IAQrC3wB,iBAAAA,SAAkB2wB;QACxB,IAAMjqB,IAAQxG,KAAKiiE,GAAexxC;QAClC,OAAIjqB,IAAQ,KAAKA,KAASxG,KAAKg0B,GAAcruB,SACpC,OAGK3F,KAAKg0B,GAAcxtB;;;;;;;IClUnC1G,WACmBm0B,GACAsuC;kBADAtuC,aACAsuC;;QAXXviE,YAPD,IAAI0b,GACTpT,EAAYvC;;QASN/F,YAAO;;;;;;;;WAiBPF,iBAAAA,SACNszB,GACAvf,GACAmU;QAOA,IAAMjf,IAAM8K,EAAI9K,KACV0wB,IAAQz5B,KAAK0gB,KAAK5d,IAAIiG,IACtBm0B,IAAezD,IAAQA,EAAMlzB,OAAO,GACpCi8D,IAAcxiE,KAAKuiE,GAAM1uD;QAU/B,OARA7T,KAAK0gB,OAAO1gB,KAAK0gB,KAAK/E,GAAO5S,GAAK;YAChCyxB,IAAe3mB;YACftN,MAAMi8D;YACNx6C,UAAAA;YAGFhoB,KAAKuG,QAAQi8D,IAActlC,GAEpBl9B,KAAKi0B,GAAauJ,GACvBpK,GACArqB,EAAIzB,KAAK8jB;;;;;;;;IAULtrB,iBAAAA,SAAYuzB;QAClB,IAAMoG,IAAQz5B,KAAK0gB,KAAK5d,IAAIuwB;QACxBoG,MACFz5B,KAAK0gB,OAAO1gB,KAAK0gB,KAAK5E,OAAOuX,IAC7BrzB,KAAKuG,QAAQkzB,EAAMlzB;OAIvBzG,iBAAAA,SACEszB,GACAC;QAEA,IAAMoG,IAAQz5B,KAAK0gB,KAAK5d,IAAIuwB;QAC5B,OAAOlB,GAAmBlwB,QAAQw3B,IAAQA,EAAMvG,KAAgB;OAGlEpzB,yBAAAA,SACEszB,GACAI;QAFF1zB,cAIMyxB,IAAUpS;QAKd,OAJAqU,EAAartB,SAAQktB,SAAAA;YACnB,IAAMoG,IAAQz5B,EAAK0gB,KAAK5d,IAAIuwB;YAC5B9B,IAAUA,EAAQ5V,GAAO0X,GAAaoG,IAAQA,EAAMvG,KAAgB;aAE/Df,GAAmBlwB,QAAQsvB;OAGpCzxB,iBAAAA,SACEszB,GACA3S,GACAoU;QAYA,KANA,IAAItD,IAAUlS,MAIR8iD,IAAS,IAAI75D,EAAYmY,EAAMnZ,KAAKwO,MAAM,MAC1C2sD,IAAWziE,KAAK0gB,KAAKvC,GAAgBgkD;;;UACpCM,EAASrkD,QAAW;4BACnBrV,WAEJnH,aAAO44B,UAAexS;YAExB,KAAKvH,EAAMnZ,KAAKgK,EAAWvI,EAAIzB,OAC7B;YAEE0gB,EAASxa,EAAUqnB,MAAkB,KAGrC3B,aAAyBhhB,MAAYuO,EAAM9G,QAAQuZ,OACrD3B,IAAUA,EAAQ5V,GAAOuX,EAAcnqB,KAAKmqB;;QAGhD,OAAOf,GAAmBlwB,QAAQsvB;OAGpCzxB,iBAAAA,SACEszB,GACArc;QAEA,OAAOob,GAAmBhsB,QAAQnG,KAAK0gB,OAAO3X,SAAAA;YAAqBgO,OAAAA,EAAEhO;;OAGvEjJ,iBAAAA,SAAgBuW;;;QAKd,OAAO,IAAIqsD,EAA0BlmC,GAA2Bx8B;OAGlEF,iBAAAA,SAAQ45B;QACN,OAAOvH,GAAmBlwB,QAAQjC,KAAKuG;;;;;;;;;;;;;IAOvCzG,WAA6Bk9B;QAA7Bl9B;gBACE0B,IAAAA,2BAD2Bw7B;;WAD2BR,mBAK9C18B,iBAAAA,SACRszB;QADQtzB,cAGFgzB,IAA4C;QAUlD,OATA9yB,KAAKwgB,GAAQra,SAAQ,SAAC4C,GAAK8K;YACrBA,IACFif,EAASzsB,KACPrG,EAAKg9B,GAAcK,GAASjK,GAAavf,GAAK7T,EAAKgoB,aAGrDhoB,EAAKg9B,GAAcO,GAAYx0B;aAG5BopB,GAAmBY,GAAQD;OAG1BhzB,iBAAAA,SACRszB,GACAC;QAEA,OAAOrzB,KAAKg9B,GAAc1I,GAASlB,GAAaC;OAGxCvzB,iBAAAA,SACRszB,GACAI;QAEA,OAAOxzB,KAAKg9B,GAAcxI,WAAWpB,GAAaI;;EAhCIgJ;;;;;;;;;;;;;;;;;;;ICxI1D18B,WAA6B+5C;QAAA75C,mBAAA65C;;;;QAlB7B75C,UAAkB,IAAIgzB,IAA8BgnB,SAAAA;YAAKA,OAAAA,EAAE1rC;;;QAGnDtO,iCAA4BsF,EAAgByB;;QAE5C/G,uBAA4B;;QAEpCA,UAAsD;;;;;QAKtDA,UAAqB,IAAIm5D,IAEjBn5D,mBAAc,GAEtBA,UAA4B+9B,GAAkB4kC;;WAI9C7iE,iBAAAA,SACE45B,GACA3iB;QAGA,OADA/W,KAAK+kB,GAAQ5e,SAAQ,SAACge,GAAGG;YAAevN,OAAAA,EAAEuN;aACnC6N,GAAmBlwB;OAG5BnC,iBAAAA,SACEszB;QAEA,OAAOjB,GAAmBlwB,QAAQjC,KAAKq+B;OAGzCv+B,iBAAAA,SACEszB;QAEA,OAAOjB,GAAmBlwB,QAAQjC,KAAK4iE;OAGzC9iE,iBAAAA,SACEszB;QAGA,OADApzB,KAAKm+B,kBAAkBn+B,KAAKk+B,GAAkB71B,QACvC8pB,GAAmBlwB,QAAQjC,KAAKm+B;OAGzCr+B,iBAAAA,SACEszB,GACAmL,GACAF;QAQA,OANIA,MACFr+B,KAAKq+B,4BAA4BA,IAE/BE,IAA8Bv+B,KAAK4iE,OACrC5iE,KAAK4iE,KAAwBrkC;QAExBpM,GAAmBlwB;OAGpBnC,iBAAAA,SAAewkB;QACrBtkB,KAAK+kB,GAAQtR,IAAI6Q,EAAW5J,QAAQ4J;QACpC,IAAM3J,IAAW2J,EAAW3J;QACxBA,IAAW3a,KAAKm+B,oBAClBn+B,KAAKk+B,KAAoB,IAAIH,GAAkBpjB,IAC/C3a,KAAKm+B,kBAAkBxjB,IAErB2J,EAAWzJ,iBAAiB7a,KAAK4iE,OACnC5iE,KAAK4iE,KAAwBt+C,EAAWzJ;OAI5C/a,iBAAAA,SACEszB,GACA9O;QAQA,OAFAtkB,KAAKw+B,GAAela,IACpBtkB,KAAKy+B,eAAe,GACbtM,GAAmBlwB;OAG5BnC,iBAAAA,SACEszB,GACA9O;QAOA,OADAtkB,KAAKw+B,GAAela,IACb6N,GAAmBlwB;OAG5BnC,iBAAAA,SACEszB,GACA9O;QAUA,OAHAtkB,KAAK+kB,GAAQrR,OAAO4Q,EAAW5J,SAC/B1a,KAAKsiE,GAAWzF,GAAsBv4C,EAAW3J,WACjD3a,KAAKy+B,eAAe;QACbtM,GAAmBlwB;OAG5BnC,iBAAAA,SACEszB,GACAyL,GACAC;QAHFh/B,cAKMgJ,IAAQ,GACN+5D,IAA4C;QAalD,OAZA7iE,KAAK+kB,GAAQ5e,SAAQ,SAAC4C,GAAKub;YAEvBA,EAAWzJ,kBAAkBgkB,KACgB,SAA7CC,EAAgBh8B,IAAIwhB,EAAW3J,cAE/B3a,EAAK+kB,GAAQrR,OAAO3K,IACpB85D,EAASx8D,KACPrG,EAAK2+B,GAA8BvL,GAAa9O,EAAW3J;YAE7D7R;aAGGqpB,GAAmBY,GAAQ8vC,GAAUx6D,MAAK;YAAMS,OAAAA;;OAGzDhJ,iBAAAA,SACEszB;QAEA,OAAOjB,GAAmBlwB,QAAQjC,KAAKy+B;OAGzC3+B,iBAAAA,SACEszB,GACA1Y;QAEA,IAAM4J,IAAatkB,KAAK+kB,GAAQjiB,IAAI4X,MAAW;QAC/C,OAAOyX,GAAmBlwB,QAAQqiB;OAGpCxkB,iBAAAA,SACE45B,GACAxrB,GACAyM;QAGA,OADA3a,KAAKsiE,GAAWQ,GAAc50D,GAAMyM,IAC7BwX,GAAmBlwB;OAG5BnC,iBAAAA,SACE45B,GACAxrB,GACAyM;QAEA3a,KAAKsiE,GAAWS,GAAiB70D,GAAMyM;QACvC,IAAMqjB,IAAoBh+B,KAAK65C,YAAY7b,IACrClL,IAA4C;QAMlD,OALIkL,KACF9vB,EAAK/H,SAAQ4C,SAAAA;YACX+pB,EAASzsB,KAAK23B,EAAkBuO,GAAwB7S,GAAK3wB;aAG1DopB,GAAmBY,GAAQD;OAGpChzB,iBAAAA,SACE45B,GACA/e;QAGA,OADA3a,KAAKsiE,GAAWzF,GAAsBliD,IAC/BwX,GAAmBlwB;OAG5BnC,iBAAAA,SACE45B,GACA/e;QAEA,IAAMqoD,IAAehjE,KAAKsiE,GAAWW,GAAgBtoD;QACrD,OAAOwX,GAAmBlwB,QAAQ+gE;OAGpCljE,iBAAAA,SACE45B,GACA3wB;QAEA,OAAOopB,GAAmBlwB,QAAQjC,KAAKsiE,GAAWx4B,GAAY/gC;;;;;;;;;IC3JhEjJ,WACEojE;QADFpjE;QAfAE,UAAkE,IAGlEA,UAAkC,IAAI82B,GAAe,IAErD92B,cAaEA,KAAK2jC,SACL3jC,KAAKg+B,KAAoBklC,EAAyBljE;QAClDA,KAAKsiC,KAAc,IAAI6gC,GAAkBnjE,OAGzCA,KAAKi0B,KAAe,IAAImvC,IACxBpjE,KAAK+zB,KAAsB,IAAI2uC,GAC7B1iE,KAAKi0B,KAJQpgB,SAAAA;YACb7T,OAAAA,EAAKg+B,GAAkBqlC,GAAaxvD;;;WAQxC/T,oBAAAA;QACE,OAAOkC,QAAQC;OAGjBnC,iBAAAA;;QAGE,OADAE,KAAK2jC,SACE3hC,QAAQC;OAGjBmlC;aAAAA;YACE,OAAOpnC,KAAK2jC;;;;QAGd7jC,iBAAAA;;OAIAA,iBAAAA;QACE,OAAOE,KAAKi0B;OAGdn0B,iBAAAA,SAAiB+B;QACf,IAAIm1B,IAAQh3B,KAAKsjE,GAAezhE,EAAK66D;QAQrC,OAPK1lC,MACHA,IAAQ,IAAIusC,GACVvjE,KAAKi0B,IACLj0B,KAAKg+B,KAEPh+B,KAAKsjE,GAAezhE,EAAK66D,OAAW1lC,IAE/BA;OAGTl3B,iBAAAA;QACE,OAAOE,KAAKsiC;OAGdxiC,iBAAAA;QACE,OAAOE,KAAK+zB;OAGdj0B,6BAAAA,SACEsc,GACAmrB,GACAC;QAHF1nC;QAOE+lB,GA7FY,qBA6FM,yBAAyBzJ;QAC3C,IAAMsd,IAAM,IAAI8pC,GAAkBxjE,KAAK0jC,GAAer7B;QAEtD,OADArI,KAAKg+B,GAAkBylC,MAChBj8B,EAAqB9N,GACzBrxB,MAAKuG,SAAAA;YACG5O,OAAAA,EAAKg+B,GACT0lC,GAAuBhqC,GACvBrxB,MAAK;gBAAMuG,OAAAA;;YAEfuhC,KACAptC,MAAK6L,SAAAA;mBACJ8qB,EAAIsO,MACGp5B;;OAIb9O,iBAAAA,SACEszB,GACArqB;QAEA,OAAOopB,GAAmBwxC,GACxB36D,OAAOyD,OAAOzM,KAAKsjE,IAAgBz7D,KAAImvB,SAAAA;YAAS,OAAA;gBAC9CA,OAAAA,EAAM8S,GAAY1W,GAAarqB;;;;;IAWrCjJ,WAAqB8hC;QAArB9hC;gBACE0B,IAAAA,2BADmBogC;;WADgBC;EAAAA;IAkBrC/hC,WAAqC+5C;QAAA75C,mBAAA65C;;QAJrC75C,UAA4C,IAAIm5D;;QAEhDn5D,UAAsD;;kBAItDF,SAAe+5C;QACb,OAAO,IAAI+pB,EAAoB/pB;OAGjCgqB;aAAAA;YACE,IAAK7jE,KAAK8jE,IAGR,OAAO9jE,KAAK8jE;YAFZ,MAhLqDl+D;;;;QAsLzD9F,iBAAAA,SACE45B,GACA/e,GACA5R;QAIA,OAFA/I,KAAK+jE,GAAoBpkC,GAAa52B,GAAK4R,IAC3C3a,KAAKgkE,GAAkBtwD,OAAO3K,IACvBopB,GAAmBlwB;OAG5BnC,iBAAAA,SACE45B,GACA/e,GACA5R;QAIA,OAFA/I,KAAK+jE,GAAoBnkC,GAAgB72B,GAAK4R,IAC9C3a,KAAKgkE,GAAkBtlD,IAAI3V,IACpBopB,GAAmBlwB;OAG5BnC,iBAAAA,SACE45B,GACA3wB;QAGA,OADA/I,KAAKgkE,GAAkBtlD,IAAI3V,IACpBopB,GAAmBlwB;OAG5BnC,2BAAAA,SACE45B,GACApV;QAFFxkB;QAImBE,KAAK+jE,GAAoBlH,GACxCv4C,EAAW3J,UAEJxU,SAAQ4C,SAAAA;YAAO/I,OAAAA,EAAKgkE,GAAkBtlD,IAAI3V;;QACnD,IAAMgmC,IAAQ/uC,KAAK65C,YAAY1Q;QAC/B,OAAO4F,EACJsP,GAA2B3kB,GAAKpV,EAAW3J,UAC3CtS,MAAK6F,SAAAA;YACJA,EAAK/H,SAAQ4C,SAAAA;gBAAO/I,OAAAA,EAAKgkE,GAAkBtlD,IAAI3V;;YAEhDV,MAAK;YAAM0mC,OAAAA,EAAM/P,GAAiBtF,GAAKpV;;OAG5CxkB,iBAAAA;QACEE,KAAK8jE,KAAqB,IAAInZ;OAGhC7qD,iBAAAA,SACE45B;QADF55B,cAKQiqC,IADQ/pC,KAAK65C,YAAY7P,KACJC;;gBAC3B,OAAO9X,GAAmBhsB,QACxBnG,KAAKgkE,KACJj7D,SAAAA;YACQ/I,OAAAA,EAAKikE,GAAavqC,GAAK3wB,GAAKV,MAAK47D,SAAAA;gBACjCA,KACHl6B,EAAaxM,GAAYx0B;;YAI/BV,MAAK;mBACLrI,EAAK8jE,KAAqB,MACnB/5B,EAAa35B,MAAMspB;;OAI9B55B,iBAAAA,SACE45B,GACA3wB;QAFFjJ;QAIE,OAAOE,KAAKikE,GAAavqC,GAAK3wB,GAAKV,MAAK47D,SAAAA;YAClCA,IACFjkE,EAAKgkE,GAAkBtwD,OAAO3K,KAE9B/I,EAAKgkE,GAAkBtlD,IAAI3V;;OAKjCjJ,iBAAAA,SAAa+T;;QAEX,OAAO;OAGD/T,iBAAAA,SACN45B,GACA3wB;QAFMjJ;QAIN,OAAOqyB,GAAmBwxC,GAAG,EAC3B;YACExxC,OAAAA,GAAmBlwB,QAAQjC,EAAK+jE,GAAoBj6B,GAAY/gC;WAClE;YAAM/I,OAAAA,EAAK65C,YAAY1Q,KAAiBW,GAAYpQ,GAAK3wB;WACzD;YAAM/I,OAAAA,EAAK65C,YAAYqqB,GAAyBxqC,GAAK3wB;;;;;oCCjNzDjJ,SAAiBqkE;;;;;;2BACfnkE,KAAKg5D,KAAoBh5D,KAAKokE,GAAwBD,IACtDnkE,KAAK65C,cAAc75C,KAAKqkE,GAAkBF,oBACpCnkE,KAAK65C,YAAYv7B;;;qCACvBte,KAAKskE,KAActkE,KAAKukE,GAAiCJ,IACzDnkE,KAAKk4C,KAAal4C,KAAKwkE,GAAiBL,IACxCnkE,KAAKo4D,KAAcp4D,KAAKykE,GAAkBN;oBAC1CnkE,KAAKuuD,KAAavuD,KAAK0kE,GAAiBP,IACxCnkE,KAAK2kE,KAAe3kE,KAAK4kE,GAAmBT,IAE5CnkE,KAAKg5D,GAAkBpN,KAAqB4F,SAAAA;wBAC1CxxD,OAAAA,EAAKuuD,GAAWiN,GACdhK;uBAGJxxD,KAAKo4D,GAAY7J,KAAavuD,KAAKuuD,oBAE7BvuD,KAAKk4C,GAAW55B;;;qDAChBte,KAAKg5D,GAAkB16C;;;qDACvBte,KAAKo4D,GAAY95C;;;qDAEjBte,KAAKo4D,GAAYuG,GAAkB3+D,KAAKuuD,GAAWuL;;;;;;;OAG3Dh6D,iBAAAA,SAAmBqkE;QACjB,OAAO,IAAIU,GAAa7kE,KAAKuuD;OAG/BzuD,iBAAAA,SACEqkE;QAEA,OAAO;OAGTrkE,iBAAAA,SAAiBqkE;QACf,OAAO,IAAItnB,GACT78C,KAAK65C,aACL,IAAIirB,IACJX,EAAIpqB;OAIRj6C,iBAAAA,SAAkBqkE;QAKhB,OAAO,IAAIY,GAAkBnB,GAAoBoB;OAGnDllE,iBAAAA,SAAkBqkE;QAAlBrkE;QACE,OAAO,IAAImlE,GACTjlE,KAAKk4C,IACLisB,EAAIzZ,IACJyZ,EAAIlwB,KACJud,SAAAA;YACExxD,OAAAA,EAAKuuD,GAAWiN,GACdhK;YAGJ2S,EAAIl2C,SAASi3C;OAIjBplE,iBAAAA,SAAwBqkE;QACtB,OAAO,IAAIgB;OAGbrlE,iBAAAA,SAAiBqkE;QACf,OAAO,IAAIlG,GACTj+D,KAAKk4C,IACLl4C,KAAKo4D,IACLp4D,KAAKg5D,IACLmL,EAAIpqB,IACJoqB,EAAIlL;OAIRn5D,+BAAAA,SAAiBooC;QACf,MAAM,IAAI9kC,EACRhD,EAAKW,qBA9HT;;;;;;WAuI8CqkE,4CAS9CtlE,SAAiBqkE;;;;;;2CACT3iE,YAAM6jE,sBAAWlB;;;;;qDAIjBnkE,KAAK65C,YAAYyrB,IAAwBthC,SAAMZ;;;;;2DAC5CpjC,KAAKuuD,GAAkCoQ,GAC5Cv7B;;;qDAEEpjC,KAAKskE,OACHlhC,MAAcpjC,KAAKskE,GAAYpgC,KACjClkC,KAAKskE,GAAYhmD,MAAMte,KAAKk4C,MAClB9U,KACVpjC,KAAKskE,GAAYtW;;;;;;;;;;;;;;OAMzBluD,iBAAAA,SAAiBqkE;QACf,OAAO,IAAIoB,GACTvlE,KAAK65C,aACL,IAAIirB,IACJX,EAAIpqB;OAIRj6C,iBAAAA,SAAiBqkE;QACf,IAAM5V,IAAa,IAAIiX,GACrBxlE,KAAKk4C,IACLl4C,KAAKo4D,IACLp4D,KAAKg5D,IACLmL,EAAIpqB,IACJoqB,EAAIlL;QAKN,OAHIj5D,KAAKg5D,cAA6BpH,OACpC5xD,KAAKg5D,GAAkBzK,KAAaA,IAE/BA;OAGTzuD,iBAAAA,SACEqkE;QAEA,IAAMp7B,IAAmB/oC,KAAK65C,YAAY7b,GACvC+K;QACH,OAAO,IAAI08B,GAAa18B,GAAkBo7B,EAAIlwB;OAGhDn0C,iBAAAA,SAAkBqkE;QAMhB,IAAMr0C,IAAiB6J,GAAqB+rC,GAC1CvB,EAAIj8B,KAEAt3B,IAAauzD,EAAIl2C,SAAS+2B,GAAcmf,EAAIj8B,GAAa14B;QAC/D,OAAO,IAAImqB,GACTwqC,EAAIwB,GAAoBC,iBACxB91C,GACAq0C,EAAIpiC,UACJoiC,EAAIl2C,UACJ2pB,GAAUiuB,GAAc1B,EAAIwB,GAAoBG,iBAChD3B,EAAIlwB,IACJrjC,GACA5Q,KAAKg5D;OAITl5D,iBAAAA,SAAwBqkE;QACtB,IACEA,EAAIwB,GAAoBI,MACxB5B,EAAIwB,GAAoBC,iBACxB;YACA,KAAKhU,GAA4B3vB,GAAYkiC,EAAIl2C,WAC/C,MAAM,IAAI7qB,EACRhD,EAAKc,eACL;YAGJ,IAAM4uB,IAAiB6J,GAAqB+rC,GAC1CvB,EAAIj8B;YAEN,OAAO,IAAI0pB,GACTuS,EAAIlwB,IACJkwB,EAAIl2C,UACJ6B,GACAq0C,EAAIpiC,UACJoiC,EAAIpqB;;QAGR,OAAO,IAAIorB;OAGbrlE,+BAAAA,SAAiBooC;QACf,IAAMpY,IAAiB6J,GAAqB+rC,GAC1Cx9B;QAEF,OAAOvO,GAAqBqsC,iBAAiBl2C;;EA7GDs1C;ICxF9CtlE,WACUmuB,GACAia,GACA+gB;;;;;;;;;IASAhV;QAXAj0C,gBAAAiuB,aACAia,GACAloC,mBAAAipD,aASAhV,GAdOj0C,gBAAWimE,GAAOC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;WAqDnCpmE,oBAAAA,SACEqmE,GACAR;QAFF7lE;QAIEE,KAAKomE;;;;;;;QAQL,IAAMC,IAAqB,IAAIn0B,IAQzBo0B,IAAoB,IAAIp0B,IAE1Bq0B;;;;;;;;;QA4BJ,OA3BAvmE,KAAKipD,YAAYud,GAAkB3kE,SAAAA;YACjC,KAAK0kE,GAKH,OAJAA,QAEA1gD,GAxHQ,mBAwHU,uBAAuBhkB,EAAK9B,MAEvCC,EAAKymE,GACVN,GACAR,GACA9jE,GACAykE,GACAvjE,KAAKsjE,EAAmBpkE,SAASokE,EAAmBj0C;YAEtDpyB,EAAKi0C,GAAWob,IAAiB;gBACxBrvD,OAAAA,EAAK69D,GAAuBh8D;;;;QAMzC7B,KAAKi0C,GAAWzP,IAAiB;YACxB6hC,OAAAA,EAAmBtvC;aAMrBuvC,EAAkBvvC;;+EAI3Bj3B,4BAAAA;QAAAA;QAEE,OADAE,KAAKomE,MACEpmE,KAAKi0C,GAAWiB,SAAQ;YACtBl1C,OAAAA,EAAKuuD,GAAWb;;;;;;;;;;;;;;;;;;;;;;;qBAwBnB5tD,SACNqmE,GACAR,GACA9jE,GACAykE;;;;;;uEAO2BtmE,KAAKiuB,SAASy4C,GAAe1mE,KAAKkoC;;;2BAArDqf,cACA32C,IAAa5Q,KAAKiuB,SAAS+2B,GAC/BhlD,KAAKkoC,GAAa14B,KAEdk7C,ahB9IVnD,GACA0B,GACAr4C;wBAEA,OAAO,IAAI+1D,GAAcpf,GAAY0B,GAAar4C;sBgB0If22C,GAAYvnD,KAAKipD,aAAar4C,oBAEvDu1D,EAAkBd,WAAW;wBACjCuB,IAAY5mE,KAAKi0C;wBACjB4yB,IAAc7mE,KAAKkoC;wBACnBja,UAAUjuB,KAAKiuB;wBACf64C,IAAApc;wBACA3oB,UAAU/hC,KAAK+hC;wBACfglC,IAAallE;wBACbmlE,IArMiC;wBAsMjCC,IAAAtB;;;;qCAGF3lE,KAAK65C,cAAcssB,EAAkBtsB,aACrC75C,KAAKg5D,KAAoBmN,EAAkBnN,IAC3Ch5D,KAAKk4C,KAAaiuB,EAAkBjuB;oBACpCl4C,KAAKo4D,KAAc+N,EAAkB/N,IACrCp4D,KAAKuuD,KAAa4X,EAAkB5X,IACpCvuD,KAAKskE,KAAc6B,EAAkB7B,IACrCtkE,KAAKknE,KAAWf,EAAkBxB;;;oBAIlC3kE,KAAK65C,YAAYstB,IAA2BnjC;;;;;2DACpChkC,KAAKonE;;;;;;;yBAGbd,EAAkBrkE;;;;oBAOlB;;;oBAHAqkE,EAAkBl0C,OAAOrD,KAGpB/uB,KAAKqnE,GAAYt4C,IACpB,MAAMA;oBAOR,yBALAu4C,QAAQC,KACN,+EAEEx4C;oBAEG/uB,KAAKymE,GACV,IAAIrB,IACJ;wBAAEoC;uBACF3lE,GACAykE;;;;;;;;;;;;IASExmE,iBAAAA,SAAYivB;QAClB,OAAmB,oBAAfA,EAAMrtB,OAENqtB,EAAMztB,SAASlB,EAAKW,uBACpBguB,EAAMztB,SAASlB,EAAKc,kBAGE,sBAAjBumE,gBACP14C,aAAiB04C;;;;QAtPc,OAmQ7B14C,EAAMztB,QApQgB,OAqQtBytB,EAAMztB;;;QAtQsB,OAyQ5BytB,EAAMztB;;;;;;IAWJxB,iBAAAA;QACN,IAAIE,KAAKi0C,GAAWyzB,IAClB,MAAM,IAAItkE,EACRhD,EAAKW,qBACL;OAKEjB,iBAAAA,SAAuB+B;QAI7B,OAHA7B,KAAKi0C,GAAW0zB,MAEhB9hD,GApSY,mBAoSM,uCAAuChkB,EAAK9B;QACvDC,KAAKuuD,GAAWsP,GAAuBh8D;;kFAIhD/B,6BAAAA;QAAAA;QAEE,OADAE,KAAKomE,MACEpmE,KAAKi0C,GAAWiB,SAAQ;YACtBl1C,OAAAA,EAAKuuD,GAAWuP;;OAI3Bh+D,wBAAAA;QAAAA;QACE,OAAOE,KAAKi0C,GAAW2zB,IAA2B5jC;;;;;;+BAE5ChkC,KAAKskE,MACPtkE,KAAKskE,GAAYtW,wBAGbhuD,KAAKo4D,GAAY1vB;;;yDACjB1oC,KAAKg5D,GAAkBtwB;;;yDACvB1oC,KAAK65C,YAAYnR;;;;;;;;wBAKvB1oC,KAAKipD,YAAY4e;;;;;;;;;;;IASrB/nE,mCAAAA;QAAAA;QACEE,KAAKomE;QAEL,IAAMhyB,IAAW,IAAIlC;QAIrB,OAHAlyC,KAAKi0C,GAAWzP,IAAiB;YACxBxkC,OAAAA,EAAKuuD,GAAWuZ,GAA8B1zB;aAEhDA,EAASrd;OAGlBj3B,qBAAAA,SACE2gB,GACA8/C,GACAlqD;QAHFvW;QAKEE,KAAKomE;QACL,IAAMvyC,IAAW,IAAIk0C,GAActnD,GAAO8/C,GAAUlqD;QAEpD,OADArW,KAAKi0C,GAAWzP,IAAiB;YAAMxkC,OAAAA,EAAKknE,GAASnN,OAAOlmC;aACrDA;OAGT/zB,iBAAAA,SAAS+zB;QAAT/zB;;;gBAGME,KAAKgoE,MAGThoE,KAAKi0C,GAAWzP,IAAiB;YACxBxkC,OAAAA,EAAKknE,GAASvM,GAAS9mC;;wBAIlC/zB,SACE8wB;;;;;;2BAEA5wB,KAAKomE,MACChyB,IAAW,IAAIlC,oBACflyC,KAAKi0C,GAAWiB,SAAQlR;;;;;;uFAEHhkC,KAAKk4C,GAAW+vB,GAAar3C;;;4CAA9C3e,yBACkBC,KACtBkiC,EAASnyC,QAAQgQ,KACRA,aAAoBwC,KAC7B2/B,EAASnyC,QAAQ,QAEjBmyC,EAAShiB,OACP,IAAIhvB,EACFhD,EAAKgB,aACL;;;;yDAQA6vD,IAAiB1a,GACrBtnB,GACA,6BAA2B2B;oCAE7BwjB,EAAShiB,OAAO6+B;;;;;;;;;;oBAIpB,mCAAO7c,EAASrd;;;;wBAGlBj3B,SAAiC2gB;;;;;;2BAC/BzgB,KAAKomE,MACChyB,IAAW,IAAIlC,oBACflyC,KAAKi0C,GAAWiB,SAAQlR;;;;;;uFAEAhkC,KAAKk4C,GAAW8hB,GACxCv5C;;;;2CADIw3C,cAIAc,IAAO,IAAIkB,GAAKx5C,GAAOw3C,EAAY7Z,KACnC8b,IAAiBnB,EAAKb,GAAkBD,EAAYh3C,YACpDs8B,IAAawb,EAAKplC,GACtBumC;qEAGF9lB,EAASnyC,QAAQs7C,EAAoB+L;;;yDAE/B2H,IAAiB1a,GACrBtnB,GACA,8BAA4BxO;oCAE9B2zB,EAAShiB,OAAO6+B;;;;;;;;;;oBAGpB,mCAAO7c,EAASrd;;;;OAGlBj3B,oBAAAA,SAAM6wB;QAAN7wB;QACEE,KAAKomE;QACL,IAAMhyB,IAAW,IAAIlC;QAIrB,OAHAlyC,KAAKi0C,GAAWzP,IAAiB;YAC/BxkC,OAAAA,EAAKuuD,GAAWtD,MAAMt6B,GAAWyjB;aAE5BA,EAASrd;OAGlBj3B,iBAAAA;QACE,OAAOE,KAAKkoC,GAAa14B;OAG3B1P,iBAAAA,SAA2BygE;QAA3BzgE;QACEE,KAAKomE,MACLpmE,KAAKi0C,GAAWzP,IAAiB;mBAC/BxkC,EAAKknE,GAASgB,GAA2B3H,IAClCv+D,QAAQC;;OAInBnC,iBAAAA,SAA8BygE;QAA9BzgE;;;gBAGME,KAAKgoE,MAGThoE,KAAKi0C,GAAWzP,IAAiB;mBAC/BxkC,EAAKknE,GAASiB,GAA8B5H,IACrCv+D,QAAQC;;OAInBmmE;aAAAA;;;;YAIE,OAAOpoE,KAAKi0C,GAAWyzB;;;;QAGzB5nE,0BAAAA,SACEu4D;QADFv4D;QAGEE,KAAKomE;QACL,IAAMhyB,IAAW,IAAIlC;QAKrB,OAJAlyC,KAAKi0C,GAAWzP,IAAiB;mBAC/BxkC,EAAKuuD,GAAW/qB,eAAexjC,EAAKi0C,IAAYokB,GAAgBjkB,IACzDpyC,QAAQC;aAEVmyC,EAASrd;;;ICzelBj3B,WAAoBygE;QAAAvgE,gBAAAugE;;;;;QAFZvgE;;WAIRF,mBAAAA,SAAK8B;QACH5B,KAAKqoE,GAAcroE,KAAKugE,SAASl4D,MAAMzG;OAGzC9B,oBAAAA,SAAMivB;QACJ/uB,KAAKqoE,GAAcroE,KAAKugE,SAASxxC,OAAOA;OAG1CjvB,iBAAAA;QACEE,KAAKsoE;OAGCxoE,iBAAAA,SAAiByoE,GAA+BlkC;QAAhDvkC;QACDE,KAAKsoE,SACRt0B,YAAW;YACJh0C,EAAKsoE,SACRC,EAAalkC;YAEd;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;SCfOmkC,GAAkB3/D;;;;;IAChC,OAOF,SAA8BA,GAAc4/D;QAC1C,IAAmB,mBAAR5/D,KAA4B,SAARA,GAC7B;QAIF,KADA,IAAM6/D,IAAS7/D,UACM4/D,IAbY,EAAC,QAAQ,SAAS,cAa9BA,cAAAA;YAAhB,IAAME;YACT,IAAIA,KAAUD,KAAoC,qBAAnBA,EAAOC,IACpC;;QAGJ;KAXF,CAP8B9/D;;;;ICa5B/I,WACmBknD,GACA4hB,GACAC,GACAC;QAHA9oE,iBAAAgnD,GACAhnD,6BAAA4oE,aACAC,GACA7oE,iBAAA8oE;;WAGnBhpE,iBAAAA,SAAa8B;QACX,QAAQyJ,EAAUzJ;UAChB;YACE,OAAO;;UACT;YACE,OAAOA,EAAM4J;;UACf;YACE,OAAOM,EAAgBlK,EAAMsK,gBAAgBtK,EAAMwK;;UACrD;YACE,OAAOpM,KAAK+oE,GAAiBnnE,EAAqBqJ;;UACpD;YACE,OAAOjL,KAAKgpE,GAAuBpnE;;UACrC;YACE,OAAOA,EAAMgJ;;UACf;YACE,OAAO,IAAI83C,GAAK/2C,EAAoB/J,EAAiBgK;;UACvD;YACE,OAAO5L,KAAKipE,GAAiBrnE,EAAqBiK;;UACpD;YACE,OAAO7L,KAAKkpE,GAAgBtnE,EAAoBmK;;UAClD;YACE,OAAO/L,KAAKmpE,GAAavnE,EAAiB4K;;UAC5C;YACE,OAAOxM,KAAKopE,GAAcxnE,EAAe6I;;UAC3C;YACE,MAzDR7E;;OA6DU9F,iBAAAA,SAAc2K;QAAd3K,cACA8O,IAAiC;QAIvC,OAHAzI,EAAQsE,EAASC,UAAU,KAAI,SAAC3B,GAAKnH;YACnCgN,EAAO7F,KAAO/I,EAAKqpE,GAAaznE;aAE3BgN;OAGD9O,iBAAAA,SAAgB8B;QACtB,OAAO,IAAIglD,GACT96C,EAAgBlK,EAAMoK,WACtBF,EAAgBlK,EAAMqK;OAIlBnM,iBAAAA,SAAa0M;QAAb1M;QACN,QAAQ0M,EAAWC,UAAU,IAAI5E,KAAIjG,SAAAA;YAAS5B,OAAAA,EAAKqpE,GAAaznE;;OAG1D9B,iBAAAA,SAAuB8B;QAC7B,QAAQ5B,KAAK6oE;UACX,KAAK;YACH,IAAM94D,a3ExBEu5D,EAAiB1nE;gBAC/B,IAAMmO,IAAgBnO,EAAM6I,SAAUC,OAA0BsF;gBAEhE,OAAIxF,EAAkBuF,KACbu5D,EAAiBv5D,KAEnBA;c2EkBsCnO;YACvC,OAAqB,QAAjBmO,IACK,OAEF/P,KAAKqpE,GAAat5D;;UAC3B,KAAK;YACH,OAAO/P,KAAK+oE,GAAiBl+D,EAAkBjJ;;UACjD;YACE,OAAO;;OAIL9B,iBAAAA,SAAiB8B;QACvB,IAAM2nE,IAAkBx+D,EAAmBnJ,IACrCyD,IAAY,IAAIf,EACpBilE,EAAgBnlE,SAChBmlE,EAAgBr+D;QAElB,OAAIlL,KAAK4oE,wBACAvjE,IAEAA,EAAUmkE;OAIb1pE,iBAAAA,SAAiB4B;QACvB,IAAM+nE,IAAeviE,EAAaqB,EAAW7G;QAvFrC2B,GAyFNgkB,GAAoBoiD;QAGtB,IAAMj6D,IAAa,IAAI2gB,GAAWs5C,EAAa3mE,IAAI,IAAI2mE,EAAa3mE,IAAI,KAClEiG,IAAM,IAAIT,EAAYmhE,EAAajhE,EAAS;QAclD,OAZKgH,EAAWhK,QAAQxF,KAAKgnD,UAAUC;;QAErC5rC,GACE,cAAYtS,qEAEPyG,EAAWC,kBAAaD,EAAWE,qGAEzB1P,KAAKgnD,UAAUC,GAAYx3C,kBAAazP,KAAKgnD,UAAUC,GAAYv3C;QAK/E,IAAIm3C,GAAkB99C,GAAK/I,KAAKgnD,WAAWhnD,KAAK8oE;;KChD9CY,KAAuB9xB,GAAUI;IA4C5Cl4C,WAAY2kD;;QACV,eAAIA,EAAS10B,MAAoB;YAC/B,eAAI00B,EAASz0B,KACX,MAAM,IAAI5sB,EACRhD,EAAKI,kBACL;YAGJR,KAAK+vB,OA/DU,4BAgEf/vB,KAAKgwB;eAEL+wB,GAAkB,YAAY,oBAAoB,QAAQ0D,EAAS10B,OACnE/vB,KAAK+vB,OAAO00B,EAAS10B,MAErBkxB,GAA0B,YAAY,WAAW,OAAOwD,EAASz0B;QACjEhwB,KAAKgwB,oBAAMy0B,EAASz0B;QA0DtB,IAxDA+xB,GAAoB,YAAY0C,GAAU,EACxC,QACA,OACA,eACA,yBACA,kBACA,gCACA;QAGFxD,GACE,YACA,UACA,eACAwD,EAASwE,cAEXjpD,KAAKipD,cAAcxE,EAASwE;QAE5BhI,GACE,YACA,WACA,yBACAwD,EAASmkB,wBAGX3nB,GACE,YACA,WACA,6BACAwD,EAASX;;;eAKPW,EAASmkB,wBACXvtD,GACE,mGAGOopC,EAASmkB,yBAClBvtD,GACE;QAIJrb,KAAK4oE,sCACHnkB,EAASmkB;QACX5oE,KAAK8jD,0CACHW,EAASX;QAEX7C,GACE,YACA,UACA,kBACAwD,EAASqhB,4BAEPrhB,EAASqhB,gBACX9lE,KAAK8lE,iBAAiBluB,GAAUG,SAC3B;YACL,IACE0M,EAASqhB,mBAAmB4D,MAC5BjlB,EAASqhB,iBAAiBluB,GAAU+xB,IAEpC,MAAM,IAAIvmE,EACRhD,EAAKI,kBACL,qCAAmCo3C,GAAU+xB;YAG/C3pE,KAAK8lE,iBAAiBrhB,EAASqhB;;QAInC7kB,GACE,YACA,WACA,gCACAwD,EAASmlB;QAEX5pE,KAAKiwB,iCACHw0B,EAASmlB;;WAGb9pE,sBAAAA,SAAQkF;QACN,OACEhF,KAAK+vB,SAAS/qB,EAAM+qB,QACpB/vB,KAAKgwB,QAAQhrB,EAAMgrB,OACnBhwB,KAAK4oE,0BAA0B5jE,EAAM4jE,yBACrC5oE,KAAKipD,gBAAgBjkD,EAAMikD,eAC3BjpD,KAAK8lE,mBAAmB9gE,EAAM8gE,kBAC9B9lE,KAAKiwB,qBAAqBjrB,EAAMirB,oBAChCjwB,KAAK8jD,8BAA8B9+C,EAAM8+C;;;;;;IAoC7ChkD,WACE+pE,GACA1nE,GACAgkE;QAHFrmE;QAKE,qBAFAqmE,QAA2Cf,KAvB7CplE,UAAoD;;;QAapDA,UAAkB,IAAI8pE,IAwQtB9pE,gBAAW;YACT0T,QAAQswB;;;;;;;mCAGNhkC,KAAK+pE,sBACC/pE,KAAKgqE,GAAkB5C;;;;;;;;;;WAjQyB,mBAA5CyC,EAAgCxzD,SAAsB;;;YAGhE,IAAM4zD,IAAMJ;YACZ7pE,KAAKkqE,KAAeD,GACpBjqE,KAAKinD,KAAckjB,EAAUC,GAAkBH,IAC/CjqE,KAAKqqE,KAAkBJ,EAAIvoE,MAC3B1B,KAAKsqE,KAAe,IAAIC,EAA4BpoE;eAC/C;YACL,IAAMqoE,IAAWX;YACjB,KAAKW,EAAS/6D,WACZ,MAAM,IAAIrM,EACRhD,EAAKI,kBACL;YAIJR,KAAKinD,KAAc,IAAI92B,GAAWq6C,EAAS/6D,WAAW+6D,EAAS96D;;YAE/D1P,KAAKqqE,KAAkB,aACvBrqE,KAAKsqE,KAAe,IAAIG;;QAG1BzqE,KAAK0qE,KAAqBvE,GAC1BnmE,KAAK2qE,KAAY,IAAIC,GAAkB;;WAGzCC;aAAAA;YAYE,OAPK7qE,KAAK8qE;;YAER9qE,KAAK8qE,KAAkB,IAAIC,GACzB/qE,KAAKinD,IACLjnD,KAAK2qE,GAAU7mB,6BAGZ9jD,KAAK8qE;;;;QAGdhrE,uBAAAA,SAASkrE;QACP5qB,GAA0B,sBAAsBqC,WAAW,IAC3D/B,GAAgB,sBAAsB,UAAU,GAAGsqB;QAEnD,IAAMC,IAAc,IAAIL,GAAkBI;QAC1C,IAAIhrE,KAAKgqE,OAAqBhqE,KAAK2qE,GAAUnlE,QAAQylE,IACnD,MAAM,IAAI7nE,EACRhD,EAAKW,qBACL;QAMJf,KAAK2qE,KAAYM,cACbA,EAAYhiB,gBACdjpD,KAAKsqE,cpFdTrhB;YAEA,KAAKA,GACH,OAAO,IAAIwhB;YAGb,QAAQxhB,EAAY1oC;cAClB,KAAK;gBACH,IAAMslB,IAASojB,EAAYpjB;;gCAW3B,OATAxiC,KAEsB,mBAAXwiC,KACI,SAAXA,MACAA,EAAapjC,SACbojC,EAAapjC,KAAmCyoE;gBAI7C,IAAIC,EACTtlC,GACAojB,EAAYrlD,KAAgB;;cAGhC,KAAK;gBACH,OAAOqlD,EAAYpjB;;cAErB;gBACE,MAAM,IAAIziC,EACRhD,EAAKI,kBACL;;UoFhB0CyqE,EAAYhiB;OAI5DnpD,4BAAAA;QAEE,OADAE,KAAK+pE,MACE/pE,KAAKgqE,GAAkBtc;OAGhC5tD,6BAAAA;QAEE,OADAE,KAAK+pE,MACE/pE,KAAKgqE,GAAkBlM;OAGhCh+D,gCAAAA,SAAkB2kD;;QAChB,IAAIzkD,KAAKgqE,IACP,MAAM,IAAI5mE,EACRhD,EAAKW,qBACL;QAMJ,IAAI6kE;QAcJ,OAZInhB,iBACEA,EAAS2mB,kCACX/vD,GACE;QAGJuqD,gCACEnhB,EAASmhB,uCACTnhB,EAAS2mB;QAINprE,KAAKqrE,GAAgBrrE,KAAK0qE,IAAoB;YACnDlD;YACA1B,gBAAgB9lE,KAAK2qE,GAAU7E;YAC/BF,iBAAAA;;sCAIJ9lE;;;;gBACE,eACEE,KAAKgqE,OACJhqE,KAAKgqE,GAAiBhC,IAEvB,MAAM,IAAI5kE,EACRhD,EAAKW,qBACL;gBAcJ,OAVMqzC,IAAW,IAAIlC,sBACrBlyC,KAAKsrE,GAAOC,IAAkCvnC;;;;;;mEAEpCkE,IAAeloC,KAAKwrE,sBACpBxrE,KAAK0qE,GAAmB1E,iBAAiB99B;;;iDAC/CkM,EAASnyC;;;qDAETmyC,EAAShiB,OAAOnD;;;;;;;qBAGbmlB,EAASrd;;;OAGlBj3B,wBAAAA;QAEE,OADCE,KAAKiqE,IAAqBwB,uBAAuB,cAC3CzrE,KAAKmB,SAASuS;OAGvBg4D;aAAAA;YAEE,OADA1rE,KAAK+pE,MACE/pE,KAAKgqE,GAAkBhC;;;;QAGhCloE,mCAAAA;QAEE,OADAE,KAAK+pE,MACE/pE,KAAKgqE,GAAkB2B;OAKhC7rE,gCAAAA,SAAkB8rE;QAGhB,IAFA5rE,KAAK+pE,MAEDvB,GAAkBoD,IACpB,OAAO5rE,KAAK6rE,GAA0BD;QAEtClrB,GAAgB,+BAA+B,YAAY,GAAGkrB;QAC9D,IAAMrL,IAAkC;YACtCl4D,MAAMujE;;QAER,OAAO5rE,KAAK6rE,GAA0BtL;OAIlCzgE,iBAAAA,SACNygE;QADMzgE,cAMAgsE,IAAgB,IAAIC,GAAoB;YAC5C1jE,MAAM;gBACAk4D,EAASl4D,QACXk4D,EAASl4D;;YAGb0mB,OATkB0D,SAAAA;gBAClB,MArbsB7sB;;;QAgcxB,OADA5F,KAAKgqE,GAAkB9B,GAA2B4D,IAC3C;YACLA,EAAcE,MACdhsE,EAAKgqE,GAAkB7B,GAA8B2D;;OAIzDhsE,iBAAAA;QAQE,OAPKE,KAAKgqE;;;QAGRhqE,KAAKqrE,GAAgB,IAAIjG,IAA2B;YAClDoC;YAGGxnE,KAAKgqE;OAGNlqE,iBAAAA;QACN,OAAO,IAAImsE,GACTjsE,KAAKinD,IACLjnD,KAAKqqE,IACLrqE,KAAK2qE,GAAU56C,MACf/vB,KAAK2qE,GAAU36C,KACfhwB,KAAK2qE,GAAU16C;OAIXnwB,iBAAAA,SACNqmE,GACAR;QASA,IAAMz9B,IAAeloC,KAAKwrE;QAS1B,OAPAxrE,KAAKgqE,KAAmB,IAAIkC,GAC1B1iE,GAAgBC,MAChBy+B,GACAloC,KAAKsqE,IACLtqE,KAAKsrE,KAGAtrE,KAAKgqE,GAAiB1rD,MAAM6nD,GAAmBR;cAGhD7lE,SAAyBmqE;QAC/B,IA6+DcphE,IA7+DAohE,EAAI5zD,SAAS,cA8+DtBrN,OAAOC,UAAUC,eAAeC,KAAKN,GA9+Df,cACzB,MAAM,IAAIzF,EACRhD,EAAKI,kBACL;QA0+DR,IAAkBqI,GAt+DR4G,IAAYw6D,EAAI5zD,QAAQ5G;;;;;;;;;;;;;;;;;;;;;;;;;;;WAC9B,KAAKA,KAAkC,mBAAdA,GACvB,MAAM,IAAIrM,EACRhD,EAAKI,kBACL;QAGJ,OAAO,IAAI2vB,GAAW1gB;OAGxBw6D;aAAAA;YACE,KAAKjqE,KAAKkqE,IACR,MAAM,IAAI9mE,EACRhD,EAAKW,qBACL;YAIJ,OAAOf,KAAKkqE;;;;QAYdpqE,yBAAAA,SAAWqsE;QAIT,OAHA/rB,GAA0B,wBAAwBqC,WAAW,IAC7D/B,GAAgB,wBAAwB,oBAAoB,GAAGyrB;QAC/DnsE,KAAK+pE,MACE,IAAIqC,GAAoBllE,EAAaqB,EAAW4jE,IAAansE;OAGtEF,kBAAAA,SAAIqsE;QAIF,OAHA/rB,GAA0B,iBAAiBqC,WAAW,IACtD/B,GAAgB,iBAAiB,oBAAoB,GAAGyrB;QACxDnsE,KAAK+pE,MACEljB,GAAkBwlB,GAAQnlE,EAAaqB,EAAW4jE,IAAansE;OAGxEF,8BAAAA,SAAgB2I;QAQd,IAPA23C,GAA0B,6BAA6BqC,WAAW,IAClE/B,GACE,6BACA,oBACA,GACAj4C;QAEEA,EAAalB,QAAQ,QAAQ,GAC/B,MAAM,IAAInE,EACRhD,EAAKI,kBACL,4BAA0BiI;QAK9B,OADAzI,KAAK+pE,MACE,IAAI3yD,GACT,IAAIk1D,GAAcplE,EAAaqO,GAAY9M,IAC3CzI;OAIJF,6BAAAA,SACEu4D;QADFv4D;QAKE,OAFAsgD,GAA0B,4BAA4BqC,WAAW,IACjE/B,GAAgB,4BAA4B,YAAY,GAAG2X;QACpDr4D,KAAK+pE,KAAyB32C,aAClCA,SAAAA;YACQilC,OAAAA,EAAe,IAAI5H,GAAYzwD,GAAMozB;;OAKlDtzB,oBAAAA;QAGE,OAFAE,KAAK+pE,MAEE,IAAIwC,GAAWvsE;OAGxBquB;aAAAA;YACE,QAAQD;cACN,KAAKK,WAASC;gBACZ,OAAO;;cACT,KAAKD,WAAS+9C;gBACZ,OAAO;;cACT;;gBAEE,OAAO;;;;;wBAIb1sE,SAAmB2sE;QAGjB,QAFArsB,GAA0B,yBAAyBqC,WAAW,IAC9D/B,GAAgB,yBAAyB,oBAAoB,GAAG+rB;QACxDA;UACN,KAAK;YACHn+C,GAAYG,WAASC;YACrB;;UACF,KAAK;YACHJ,GAAYG,WAASK;YACrB;;UACF,KAAK;YACHR,GAAYG,WAAS+9C;YACrB;;UACF;YACE,MAAM,IAAIppE,EACRhD,EAAKI,kBACL,wBAAwBisE;;;;;IAOhC3sE,iBAAAA;QACE,OAAOE,KAAK2qE,GAAU/B;;;IAQxB9oE,WACU4sE,GACAC;kBADAD,aACAC;;WAGV7sE,kBAAAA,SACE8sE;QADF9sE;QAGEsgD,GAA0B,mBAAmBqC,WAAW;QACxD,IAAMlD,IAAMstB,GACV,mBACAD,GACA5sE,KAAK0sE;QAEP,OAAO1sE,KAAK2sE,GACTG,GAAO,EAACvtB,EAAI2H,MACZnkD,MAAM2d,SAAAA;YACL,KAAKA,KAAwB,MAAhBA,EAAK/a,QAChB,OA5oBkBC;YA8oBpB,IAAMiO,IAAM6M,EAAK;YACjB,IAAI7M,aAAeY,IACjB,OAAO,IAAIs4D,GACT/sE,EAAK0sE,IACLntB,EAAI2H,IACJ;;wCAGA3H,EAAIytB;YAED,IAAIn5D,aAAe3B,IACxB,OAAO,IAAI66D,GACT/sE,EAAK0sE,IACLntB,EAAI2H,IACJrzC;;wCAGA0rC,EAAIytB;YAGN,MAlqBkBpnE;;OAyqB1B9F,kBAAAA,SACE8sE,GACAhrE,GACAyU;QAEAmqC,GAA4B,mBAAmBiC,WAAW,GAAG;QAC7D,IAAMlD,IAAMstB,GACV,mBACAD,GACA5sE,KAAK0sE;QAEPr2D,IAAU42D,GAAmB,mBAAmB52D;gDACzC62D,UAAgBhtB,UAKjBqU,IACJl+C,EAAQ82D,SAAS92D,EAAQ+2D,cACrBptE,KAAK0sE,GAAWW,GAAYC,GAC1BptB,GACAgtB,GACA72D,EAAQ+2D,eAEVptE,KAAK0sE,GAAWW,GAAYE,GAC1BrtB,GACAgtB;QAGR,OADAltE,KAAK2sE,GAAal5D,IAAI8rC,EAAI2H,IAAMqN,IACzBv0D;OAaTF,qBAAAA,SACE8sE,GACAY,GACA5rE;iBAGI29C,GACAgV;QAgCJ,OA7B+B,mBAAtBiZ,KACPA,aAA6BhoB,MAE7BlF,GAA4B,sBAAsBmC,WAAW;QAC7DlD,IAAMstB,GACJ,sBACAD,GACA5sE,KAAK0sE,KAEPnY,IAASv0D,KAAK0sE,GAAWW,GAAYI,GACnC,sBACAD,GACA5rE,GACAskD,OAGF9F,GAA0B,sBAAsBqC,WAAW;QAC3DlD,IAAMstB,GACJ,sBACAD,GACA5sE,KAAK0sE,KAEPnY,IAASv0D,KAAK0sE,GAAWW,GAAYK,GACnC,sBACAF;QAIJxtE,KAAK2sE,GAAaxjD,OAAOo2B,EAAI2H,IAAMqN,IAC5Bv0D;OAGTF,qBAAAA,SAAO8sE;QACLxsB,GAA0B,sBAAsBqC,WAAW;QAC3D,IAAMlD,IAAMstB,GACV,sBACAD,GACA5sE,KAAK0sE;QAGP,OADA1sE,KAAK2sE,GAAaj5D,OAAO6rC,EAAI2H,KACtBlnD;;;IAQTF,WAAoB4sE;kBAAAA,GAHpB1sE,UAAqB,IACrBA;;WAIAF,kBAAAA,SACE8sE,GACAhrE,GACAyU;QAEAmqC,GAA4B,kBAAkBiC,WAAW,GAAG,IAC5DziD,KAAK2tE;QACL,IAAMpuB,IAAMstB,GACV,kBACAD,GACA5sE,KAAK0sE;QAEPr2D,IAAU42D,GAAmB,kBAAkB52D;+CACxC62D,UAAgBhtB,UAKjBqU,IACJl+C,EAAQ82D,SAAS92D,EAAQ+2D,cACrBptE,KAAK0sE,GAAWW,GAAYC,GAC1BptB,GACAgtB,GACA72D,EAAQ+2D,eAEVptE,KAAK0sE,GAAWW,GAAYE,GAC1BrtB,GACAgtB;QAKR,OAHAltE,KAAK4tE,KAAa5tE,KAAK4tE,GAAW31D,OAChCs8C,EAAOrJ,GAAY3L,EAAI2H,IAAMn1C,GAAa8X,QAErC7pB;OAaTF,qBAAAA,SACE8sE,GACAY,GACA5rE;iBAKI29C,GACAgV;QAkCJ,OArCAv0D,KAAK2tE,MAM0B,mBAAtBH,KACPA,aAA6BhoB,MAE7BlF,GAA4B,qBAAqBmC,WAAW;QAC5DlD,IAAMstB,GACJ,qBACAD,GACA5sE,KAAK0sE,KAEPnY,IAASv0D,KAAK0sE,GAAWW,GAAYI,GACnC,qBACAD,GACA5rE,GACAskD,OAGF9F,GAA0B,qBAAqBqC,WAAW;QAC1DlD,IAAMstB,GACJ,qBACAD,GACA5sE,KAAK0sE,KAEPnY,IAASv0D,KAAK0sE,GAAWW,GAAYK,GACnC,qBACAF;QAIJxtE,KAAK4tE,KAAa5tE,KAAK4tE,GAAW31D,OAChCs8C,EAAOrJ,GAAY3L,EAAI2H,IAAMn1C,GAAaD,cAErC9R;OAGTF,qBAAAA,SAAO8sE;QACLxsB,GAA0B,qBAAqBqC,WAAW,IAC1DziD,KAAK2tE;QACL,IAAMpuB,IAAMstB,GACV,qBACAD,GACA5sE,KAAK0sE;QAKP,OAHA1sE,KAAK4tE,KAAa5tE,KAAK4tE,GAAW31D,OAChC,IAAIvD,GAAe6qC,EAAI2H,IAAMn1C,GAAa8X,QAErC7pB;OAGTF,qBAAAA;QAGE,OAFAE,KAAK2tE,MACL3tE,KAAK6tE,SACD7tE,KAAK4tE,GAAWjoE,SAAS,IACpB3F,KAAK0sE,GAAW3C,KAAyB9e,MAAMjrD,KAAK4tE,MAGtD5rE,QAAQC;OAGTnC,iBAAAA;QACN,IAAIE,KAAK6tE,IACP,MAAM,IAAIzqE,EACRhD,EAAKW,qBACL;;;IAcNjB,WACSonD,GACEF,GACAgmB;kBAFF9lB,GACElnD,iBAAAgnD,aACAgmB,GAEThtE,KAAKgqE,KAAmBhqE,KAAKgnD,UAAU+iB;;kBAGzCjqE,SACEwH,GACA0/C,GACA8hB;QAEA,IAAIxhE,EAAK3B,SAAS,KAAM,GACtB,MAAM,IAAIvC,EACRhD,EAAKI,kBACL,+FAEK8G,EAAKD,gBAAyBC,EAAK3B;QAG5C,OAAO,IAAIkhD,EAAkB,IAAIv+C,EAAYhB,IAAO0/C,GAAW8hB;OAGjEz4C;aAAAA;YACE,OAAOrwB,KAAKknD,GAAK5/C,KAAKuN;;;;QAGxBoW;aAAAA;YACE,OAAO,IAAImhD,GACTpsE,KAAKknD,GAAK5/C,KAAK8jB,KACfprB,KAAKgnD,WACLhnD,KAAKgtE;;;;QAIT1lE;aAAAA;YACE,OAAOtH,KAAKknD,GAAK5/C,KAAKD;;;;QAGxBvH,yBAAAA,SACEqsE;QASA,IAPA/rB,GAA0B,gCAAgCqC,WAAW,IACrE/B,GACE,gCACA,oBACA,GACAyrB;SAEGA,GACH,MAAM,IAAI/oE,EACRhD,EAAKI,kBACL;QAGJ,IAAM8G,IAAOJ,EAAaqB,EAAW4jE;QACrC,OAAO,IAAIC,GAAoBpsE,KAAKknD,GAAK5/C,KAAKwO,MAAMxO,IAAOtH,KAAKgnD;OAGlElnD,sBAAAA,SAAQkF;QACN,MAAMA,aAAiB6hD,IACrB,MAAM5E,GAAkB,WAAW,qBAAqB,GAAGj9C;QAE7D,OACEhF,KAAKgnD,cAAchiD,EAAMgiD,aACzBhnD,KAAKknD,GAAK1hD,QAAQR,EAAMkiD,OACxBlnD,KAAKgtE,OAAehoE,EAAMgoE;OAQ9BltE,kBAAAA,SAAI8B,GAAUyU;QACZmqC,GAA4B,yBAAyBiC,WAAW,GAAG,IACnEpsC,IAAU42D,GAAmB,yBAAyB52D;yDAC/C62D,UAAgBhtB,UAKjBqU,IACJl+C,EAAQ82D,SAAS92D,EAAQ+2D,cACrBptE,KAAKgnD,UAAUqmB,GAAYC,GACzBptB,GACAgtB,GACA72D,EAAQ+2D,eAEVptE,KAAKgnD,UAAUqmB,GAAYE,GAAartB,GAAcgtB;QAC5D,OAAOltE,KAAKgqE,GAAiB/e,MAC3BsJ,EAAOrJ,GAAYlrD,KAAKknD,IAAMn1C,GAAa8X;OAU/C/pB,qBAAAA,SACE0tE,GACA5rE;iBAGI2yD;QAqBJ,OAlB+B,mBAAtBiZ,KACPA,aAA6BhoB,MAE7BlF,GAA4B,4BAA4BmC,WAAW;QACnE8R,IAASv0D,KAAKgnD,UAAUqmB,GAAYI,GAClC,4BACAD,GACA5rE,GACAskD,OAGF9F,GAA0B,4BAA4BqC,WAAW;QACjE8R,IAASv0D,KAAKgnD,UAAUqmB,GAAYK,GAClC,4BACAF,KAIGxtE,KAAKgqE,GAAiB/e,MAC3BsJ,EAAOrJ,GAAYlrD,KAAKknD,IAAMn1C,GAAaD;OAI/ChS,qBAAAA;QAEE,OADAsgD,GAA0B,4BAA4BqC,WAAW,IAC1DziD,KAAKgqE,GAAiB/e,MAAM,EACjC,IAAIv2C,GAAe1U,KAAKknD,IAAMn1C,GAAa8X;OAuB/C/pB,yBAAAA;;QACE0gD,GACE,gCACAiC,WACA,GACA;QAEF,IAGI8d,GAHAlqD,IAA2C;YAC7CsqD;WAGEmN,IAAU;QAEa,mBAAlBn/C,EAAKm/C,MACXtF,GAAkB75C,EAAKm/C,QAGxB/rB,GAAoB,gCADpB1rC,IAAUsY,EAAKm/C,IAC8C,EAC3D;QAEF7sB,GACE,gCACA,WACA,0BACA5qC,EAAQsqD;QAEVmN;QAGF,IAAMC,IAAkB;YACtBpN,wBAAwBtqD,EAAQsqD;;QAgClC,OA7BI6H,GAAkB75C,EAAKm/C,MACzBvN,IAAW5xC,EAAKm/C,MAIhBptB,GACE,gCACA,YACAotB,GACAn/C,EAAKm/C;QAEPhtB,GACE,gCACA,YACAgtB,IAAU,GACVn/C,EAAKm/C,IAAU,KAEjBhtB,GACE,gCACA,YACAgtB,IAAU,GACVn/C,EAAKm/C,IAAU;QAEjBvN,IAAW;YACTl4D,MAAMsmB,EAAKm/C;YACX/+C,OAAOJ,EAAKm/C,IAAU;YACtBE,UAAUr/C,EAAKm/C,IAAU;YAGtB9tE,KAAKiuE,GAAmBF,GAAiBxN;OAG1CzgE,iBAAAA,SACNuW,GACAkqD;QAFMzgE,cAIFouE,IAAcz7C,SAAAA;YAChB60C,QAAQv4C,MAAM,iCAAiC0D;;QAE7C8tC,EAASxxC,UACXm/C,IAAa3N,EAASxxC,MAAMslB,KAAKksB;QAGnC,IAAMuL,IAAgB,IAAIC,GAA4B;YACpD1jE,MAAMihD,SAAAA;gBACJ,IAAIiX,EAASl4D,MAAM;oBAKjB,IAAMwL,IAAMy1C,EAAS5oC,KAAK5d,IAAI9C,EAAKknD;oBAEnCqZ,EAASl4D,KACP,IAAI0kE,GACF/sE,EAAKgnD,WACLhnD,EAAKknD,IACLrzC,GACAy1C,EAASxoC,WACTwoC,EAAS9yC,kBACTxW,EAAKgtE;;;YAKbj+C,OAAOm/C;YAEHC,IAAmBnuE,KAAKgqE,GAAiBjQ,OAC7CuS,GAAcxhD,GAAO9qB,KAAKknD,GAAK5/C,OAC/BwkE,GACAz1D;QAGF,OAAO;YACLy1D,EAAcE,MACdhsE,EAAKgqE,GAAiBrP,GAASwT;;OAInCruE,kBAAAA,SAAIuW;QAAJvW;QAGE,OAFA0gD,GAA4B,yBAAyBiC,WAAW,GAAG,IACnE2rB,GAAmB,yBAAyB/3D;QACrC,IAAIrU,SACT,SAACC,GAAkDmwB;YAC7C/b,KAA8B,YAAnBA,EAAQilD,SACrBt7D,EAAKgnD,UACF+iB,KACAsE,GAA0BruE,EAAKknD,IAC/BnkD,MAAK8Q,SAAAA;gBACJ5R,EACE,IAAI8qE,GACF/sE,EAAKgnD,WACLhnD,EAAKknD,IACLrzC;mCAEAA,aAAe3B,MAAW2B,EAAIyC,IAC9BtW,EAAKgtE;gBAGR56C,KAELpyB,EAAKsuE,GAAuBrsE,GAASmwB,GAAQ/b;;OAM7CvW,iBAAAA,SACNmC,GACAmwB,GACA/b;QAEA,IAAMskD,IAAW36D,KAAKiuE,GACpB;YACEtN;YACA4N;WAEF;YACElmE,MAAOq4D,SAAAA;;;gBAGL/F,MAEK+F,EAAK5uD,UAAU4uD,EAAKvmC,SAASrZ;;;;;;;;gBAQhCsR,EACE,IAAIhvB,EACFhD,EAAKgB,aACL,4DAIJs/D,EAAK5uD,UACL4uD,EAAKvmC,SAASrZ,aACdzK,KACmB,aAAnBA,EAAQilD,SAERlpC,EACE,IAAIhvB,EACFhD,EAAKgB,aACL,gLAOJa,EAAQy+D;;YAGZ3xC,OAAOqD;;OAKbtyB,4BAAAA,SACEgpE;QAEA,OAAO,IAAIjiB,EAAqB7mD,KAAKknD,IAAMlnD,KAAKgnD,WAAW8hB;;;IAK7DhpE,WACW0W,GACAsK;QADA9gB,wBAAAwW,GACAxW,iBAAA8gB;;WAGXhhB,sBAAAA,SAAQkF;QACN,OACEhF,KAAKwW,qBAAqBxR,EAAMwR,oBAChCxW,KAAK8gB,cAAc9b,EAAM8b;;;IAa7BhhB,WACU4sE,GACAxlB,GACDsnB,GACCC,GACAC,GACS1B;kBALTN,aACAxlB,aACDsnB,aACCC,aACAC,aACS1B;;WAGnBltE,mBAAAA,SAAKuW;QAGH,IAFAmqC,GAA4B,yBAAyBiC,WAAW,GAAG,IACnEpsC,IAAUs4D,GAAwB,yBAAyBt4D;QACtDrW,KAAKwuE,IAEH;;;YAGL,IAAIxuE,KAAKgtE,IAAY;gBACnB,IAAM1jB,IAAW,IAAIslB,GACnB5uE,KAAK0sE,IACL1sE,KAAKknD,IACLlnD,KAAKwuE,IACLxuE,KAAKyuE,IACLzuE,KAAK0uE;gBAEP,OAAO1uE,KAAKgtE,GAAW6B,cAAcvlB,GAAUjzC;;YAQ/C,OANuB,IAAIy4D,GACzB9uE,KAAK0sE,IACL1sE,KAAK0sE,GAAWqC,MAChB14D,EAAQ24D;qCAGY3F,GAAarpE,KAAKwuE,GAAU5mD;;OAKxD9nB,kBAAAA,SACEuR,GACAgF;QAIA,IAFAmqC,GAA4B,wBAAwBiC,WAAW,GAAG,IAClEpsC,IAAUs4D,GAAwB,wBAAwBt4D;QACtDrW,KAAKwuE,IAAW;YAClB,IAAM5sE,IAAQ5B,KAAKwuE,GAChB37D,OACApB,MAAM00C,GAAsB,wBAAwB90C;YACvD,IAAc,SAAVzP,GAOF,OANuB,IAAIktE,GACzB9uE,KAAK0sE,IACL1sE,KAAK0sE,GAAWqC,MAChB14D,EAAQ24D,kBACRhvE,KAAKgtE,IAEe3D,GAAaznE;;OAMzCyuB;aAAAA;YACE,OAAOrwB,KAAKknD,GAAK5/C,KAAKuN;;;;QAGxB0qC;aAAAA;YACE,OAAO,IAAIsH,GACT7mD,KAAKknD,IACLlnD,KAAK0sE,IACL1sE,KAAKgtE;;;;QAITl7D;aAAAA;YACE,OAA0B,SAAnB9R,KAAKwuE;;;;QAGdr0C;aAAAA;YACE,OAAO,IAAI80C,GAAiBjvE,KAAK0uE,IAAmB1uE,KAAKyuE;;;;QAG3D3uE,sBAAAA,SAAQkF;QACN,MAAMA,aAAiB+nE,IACrB,MAAM9qB,GAAkB,WAAW,oBAAoB,GAAGj9C;QAE5D,OACEhF,KAAK0sE,OAAe1nE,EAAM0nE,MAC1B1sE,KAAKyuE,OAAezpE,EAAMypE,MAC1BzuE,KAAKknD,GAAK1hD,QAAQR,EAAMkiD,QACJ,SAAnBlnD,KAAKwuE,KACkB,SAApBxpE,EAAMwpE,KACNxuE,KAAKwuE,GAAUhpE,QAAQR,EAAMwpE,QACjCxuE,KAAKgtE,OAAehoE,EAAMgoE;;;;;;WAMtBD,mBAERjtE,mBAAAA,SAAKuW;QAMH,OALa7U,YAAMqR,gBAAKwD;;EAHlB02D;IAaRjtE,WACSovE,GACEloB,GACUgmB;kBAFZkC,GACElvE,iBAAAgnD,aACUgmB;;WAGrBltE,oBAAAA,SACE2R,GACA09D,GACAvtE;QAEAw+C,GAA0B,eAAeqC,WAAW,IACpDX,GAAgB,eAAe,GAAGlgD;;QAGlC,IAYIwtE,GAFEp2D,a3BloCRknC,GACAmvB,GACA/1D,GACAqnC;YAEA,KAAK0uB,EAAM9+D,MAAKC,SAAAA;gBAAWA,OAAAA,MAAYmwC;iBACrC,MAAM,IAAIv9C,EACRhD,EAAKI,kBACL,mBAAiB+gD,GAAiBZ,sDACHE,G2BynCgC,wC3BxnClDwuB,EAAMjoE,KAAK;YAG5B,OAAOu5C;U2BqnCyB,GAVH,gPAUsC,GAAGwuB,IAG9D99D,IAAY80C,GAAsB,eAAe10C;QACvD,IAAIJ,EAAUqG,KAAc;YAC1B,8CACEsB,uDACAA,GAEA,MAAM,IAAI5V,EACRhD,EAAKI,kBACL,uCAAqCwY;YAGlC,sBAAIA,GAAoB;gBAC7BhZ,KAAKsvE,GAAkC1tE,GAAOoX;gBAE9C,KADA,IAAMu2D,IAA6B,WACV3tE,OAAAA,cAAAA;oBAApB,IAAM4K;oBACT+iE,EAAclpE,KAAKrG,KAAKwvE,GAAqBhjE;;gBAE/C4iE,IAAa;oBAAE5iE,YAAY;wBAAEC,QAAQ8iE;;;mBAErCH,IAAapvE,KAAKwvE,GAAqB5tE;iCAGrCoX,uDAAsBA,KACxBhZ,KAAKsvE,GAAkC1tE,GAAOoX;QAEhDo2D,IAAapvE,KAAKgnD,UAAUqmB,GAAYoC,GACtC,eACA7tE;;+CAEqBoX;QAGzB,IAAMvR,IAASoR,GAAY0U,OAAOlc,GAAW2H,GAAIo2D;QAEjD,OADApvE,KAAK0vE,GAAkBjoE,IAChB,IAAI2P,EACTpX,KAAKkvE,GAAOS,GAAUloE,IACtBzH,KAAKgnD,WACLhnD,KAAKgtE;OAITltE,sBAAAA,SACE2R,GACAm+D;QASA,IAAIziD;QACJ,IARAqzB,GAA4B,iBAAiBiC,WAAW,GAAG,IAC3D3B,GACE,iBACA,oBACA,GACA8uB;mBAGEA,KAA+C,UAAjBA,GAChCziD,gCACK;YAAA,IAAqB,WAAjByiD,GAGT,MAAM,IAAIxsE,EACRhD,EAAKI,kBACL,qDAAmDovE;YAJrDziD;;QAQF,IAA4B,SAAxBntB,KAAKkvE,GAAOt4D,SACd,MAAM,IAAIxT,EACRhD,EAAKI,kBACL;QAIJ,IAA0B,SAAtBR,KAAKkvE,GAAOr4D,OACd,MAAM,IAAIzT,EACRhD,EAAKI,kBACL;QAIJ,IAAM6Q,IAAY80C,GAAsB,iBAAiB10C,IACnDiF,IAAU,IAAIiB,GAAQtG,GAAW8b;QAEvC,OADAntB,KAAK6vE,GAAmBn5D,IACjB,IAAIU,EACTpX,KAAKkvE,GAAOY,GAAWp5D,IACvB1W,KAAKgnD,WACLhnD,KAAKgtE;OAITltE,oBAAAA,SAAMkd;QAIJ,OAHAojC,GAA0B,eAAeqC,WAAW,IACpD/B,GAAgB,eAAe,UAAU,GAAG1jC,IAC5CklC,GAAuB,eAAe,GAAGllC;QAClC,IAAI5F,EACTpX,KAAKkvE,GAAOa,GAAiB/yD,IAC7Bhd,KAAKgnD,WACLhnD,KAAKgtE;OAITltE,0BAAAA,SAAYkd;QAIV,OAHAojC,GAA0B,qBAAqBqC,WAAW,IAC1D/B,GAAgB,qBAAqB,UAAU,GAAG1jC;QAClDklC,GAAuB,qBAAqB,GAAGllC,IACxC,IAAI5F,EACTpX,KAAKkvE,GAAOc,GAAgBhzD,IAC5Bhd,KAAKgnD,WACLhnD,KAAKgtE;OAITltE,sBAAAA,SACEmwE;;QAGA3vB,GAA4B,iBAAiBmC,WAAW;QACxD,IAAMtqC,IAAQnY,KAAKkwE,GACjB,iBACAD,GACAvlE;;QAGF,OAAO,IAAI0M,EACTpX,KAAKkvE,GAAOiB,GAAYh4D,IACxBnY,KAAKgnD,WACLhnD,KAAKgtE;OAITltE,yBAAAA,SACEmwE;;QAGA3vB,GAA4B,oBAAoBmC,WAAW;QAC3D,IAAMtqC,IAAQnY,KAAKkwE,GACjB,oBACAD,GACAvlE;;QAGF,OAAO,IAAI0M,EACTpX,KAAKkvE,GAAOiB,GAAYh4D,IACxBnY,KAAKgnD,WACLhnD,KAAKgtE;OAITltE,wBAAAA,SACEmwE;;QAGA3vB,GAA4B,mBAAmBmC,WAAW;QAC1D,IAAMtqC,IAAQnY,KAAKkwE,GACjB,mBACAD,GACAvlE;;QAGF,OAAO,IAAI0M,EACTpX,KAAKkvE,GAAOkB,GAAUj4D,IACtBnY,KAAKgnD,WACLhnD,KAAKgtE;OAITltE,oBAAAA,SACEmwE;;QAGA3vB,GAA4B,eAAemC,WAAW;QACtD,IAAMtqC,IAAQnY,KAAKkwE,GACjB,eACAD,GACAvlE;;QAGF,OAAO,IAAI0M,EACTpX,KAAKkvE,GAAOkB,GAAUj4D,IACtBnY,KAAKgnD,WACLhnD,KAAKgtE;OAITltE,sBAAAA,SAAQkF;QACN,MAAMA,aAAiBoS,IACrB,MAAM6qC,GAAkB,WAAW,SAAS,GAAGj9C;QAEjD,OACEhF,KAAKgnD,cAAchiD,EAAMgiD,aAAahnD,KAAKkvE,GAAO1pE,QAAQR,EAAMkqE;OAIpEpvE,4BAAAA,SACEgpE;QAEA,OAAO,IAAI1xD,EAASpX,KAAKkvE,IAAQlvE,KAAKgnD,WAAW8hB;;uEAI3ChpE,iBAAAA,SACN8jD,GACAqsB,GACAvlE,GACA6O;QAGA,IADAuoC,GAAgB8B,GAAY,GAAGqsB,IAC3BA,aAAsBlD,IAAkB;YAC1C,IAAIriE,EAAO/E,SAAS,GAClB,MAAM,IAAIvC,EACRhD,EAAKI,kBACL,oCAAkCojD;YAGtC,IAAM8c,IAAOuP;YACb,KAAKvP,EAAK5uD,QACR,MAAM,IAAI1O,EACRhD,EAAKM,WACL,yDACKkjD;YAGT,OAAO5jD,KAAKqwE,GAAkB3P,EAAe4P,IAAE/2D;;QAE/C,IAAMg3D,IAAY,EAACN,IAAYh4D,OAAOvN;QACtC,OAAO1K,KAAKwwE,GAAgB5sB,GAAY2sB,GAAWh3D;;;;;;;;;;;;;IAe/CzZ,iBAAAA,SAAkB+T,GAAe0F;;;;;;;;QAUvC,KATA,IAAMk3D,IAA0B,WASVzwE,IAAAA,KAAKkvE,GAAOx4D,SAAZ1W,cAAAA;YAAjB,IAAM0W;YACT,IAAIA,EAAQjF,MAAMiG,KAChB+4D,EAAWpqE,KAAKkJ,EAASvP,KAAKgnD,UAAUC,IAAapzC,EAAI9K,YACpD;gBACL,IAAMnH,IAAQiS,EAAIpC,MAAMiF,EAAQjF;gBAChC,IAAIjH,EAAkB5I,IACpB,MAAM,IAAIwB,EACRhD,EAAKI,kBACL,iGAEEkW,EAAQjF,QACR;gBAGC,IAAc,SAAV7P,GAEJ;oBACL,IAAM6P,IAAQiF,EAAQjF,MAAMpK;oBAC5B,MAAM,IAAIjE,EACRhD,EAAKI,kBACL,iGACmCiR;;gBANrCg/D,EAAWpqE,KAAKzE;;;QAYtB,OAAO,IAAIyX,GAAMo3D,GAAYl3D;;;;;IAMvBzZ,iBAAAA,SACN8jD,GACAn3C,GACA8M;;QAGA,IAAM7C,IAAU1W,KAAKkvE,GAAOj4D;QAC5B,IAAIxK,EAAO9G,SAAS+Q,EAAQ/Q,QAC1B,MAAM,IAAIvC,EACRhD,EAAKI,kBACL,oCAAkCojD;QAOtC,KADA,IAAM6sB,IAA0B,IACvBhqE,IAAI,GAAGA,IAAIgG,EAAO9G,QAAQc,KAAK;YACtC,IAAMiqE,IAAWjkE,EAAOhG;YAExB,IADyBiQ,EAAQjQ,GACZgL,MAAMiG,KAAc;gBACvC,IAAwB,mBAAbg5D,GACT,MAAM,IAAIttE,EACRhD,EAAKI,kBACL,yDACKojD,8BAAkC8sB;gBAG3C,KACG1wE,KAAKkvE,GAAOn6C,SACc,MAA3B27C,EAASnpE,QAAQ,MAEjB,MAAM,IAAInE,EACRhD,EAAKI,kBACL,2GACyBojD,8CACnB8sB;gBAGV,IAAMppE,IAAOtH,KAAKkvE,GAAO5nE,KAAKwO,MAAM5O,EAAaqB,EAAWmoE;gBAC5D,KAAKpoE,EAAY0O,GAAc1P,IAC7B,MAAM,IAAIlE,EACRhD,EAAKI,kBACL,iHACiDojD,uDAClBt8C;gBAInC,IAAMyB,IAAM,IAAIT,EAAYhB;gBAC5BmpE,EAAWpqE,KAAKkJ,EAASvP,KAAKgnD,UAAUC,IAAal+C;mBAChD;gBACL,IAAM4nE,IAAU3wE,KAAKgnD,UAAUqmB,GAAYoC,GACzC7rB,GACA8sB;gBAEFD,EAAWpqE,KAAKsqE;;;QAIpB,OAAO,IAAIt3D,GAAMo3D,GAAYl3D;OAsB/BzZ,yBAAAA;;QACE0gD,GAA4B,oBAAoBiC,WAAW,GAAG;QAC9D,IACI8d,GADAlqD,IAA2C,IAE3Cy3D,IAAU;QAyCd,OAvC2B,mBAAlBn/C,EAAKm/C,MACXtF,GAAkB75C,EAAKm/C,QAGxB/rB,GAAoB,oBADpB1rC,IAAUsY,EAAKm/C,IACkC,EAC/C;QAEF7sB,GACE,oBACA,WACA,0BACA5qC,EAAQsqD;QAEVmN,MAGEtF,GAAkB75C,EAAKm/C,MACzBvN,IAAW5xC,EAAKm/C,MAEhBptB,GAAgB,oBAAoB,YAAYotB,GAASn/C,EAAKm/C,KAC9DhtB,GACE,oBACA,YACAgtB,IAAU,GACVn/C,EAAKm/C,IAAU;QAEjBhtB,GACE,oBACA,YACAgtB,IAAU,GACVn/C,EAAKm/C,IAAU,KAEjBvN,IAAW;YACTl4D,MAAMsmB,EAAKm/C;YACX/+C,OAAOJ,EAAKm/C,IAAU;YACtBE,UAAUr/C,EAAKm/C,IAAU;YAG7B9tE,KAAK4wE,GAAyC5wE,KAAKkvE,KAC5ClvE,KAAKiuE,GAAmB53D,GAASkqD;OAGlCzgE,iBAAAA,SACNuW,GACAkqD;QAFMzgE,cAIFouE,IAAcz7C,SAAAA;YAChB60C,QAAQv4C,MAAM,iCAAiC0D;;QAE7C8tC,EAASxxC,UACXm/C,IAAa3N,EAASxxC,MAAMslB,KAAKksB;QAGnC,IAAMuL,IAAgB,IAAIC,GAA4B;YACpD1jE,MAAOuG,SAAAA;gBACD2xD,EAASl4D,QACXk4D,EAASl4D,KACP,IAAIwoE,GACF7wE,EAAKgnD,WACLhnD,EAAKkvE,IACLtgE,GACA5O,EAAKgtE;;YAKbj+C,OAAOm/C;YAGH4C,IAAkB9wE,KAAKgnD,UAAU+iB,MACjCoE,IAAmB2C,EAAgB/W,OACvC/5D,KAAKkvE,IACLpD,GACAz1D;QAEF,OAAO;YACLy1D,EAAcE,MACd8E,EAAgBnW,GAASwT;;OAIrBruE,iBAAAA,SAAyC2gB;QAC/C,IAAIA,EAAM81C,QAAqD,MAAjC91C,EAAMxJ,GAAgBtR,QAClD,MAAM,IAAIvC,EACRhD,EAAKc,eACL;OAKNpB,kBAAAA,SAAIuW;QAAJvW;QAIE,OAHA0gD,GAA4B,aAAaiC,WAAW,GAAG,IACvD2rB,GAAmB,aAAa/3D,IAChCrW,KAAK4wE,GAAyC5wE,KAAKkvE,KAC5C,IAAIltE,SACT,SAACC,GAA+CmwB;YAC1C/b,KAA8B,YAAnBA,EAAQilD,SACrBt7D,EAAKgnD,UACF+iB,KACAgH,GAA2B/wE,EAAKkvE,IAChCnsE,MAAMg9D,SAAAA;gBACL99D,EACE,IAAI4uE,GACF7wE,EAAKgnD,WACLhnD,EAAKkvE,IACLnP,GACA//D,EAAKgtE;gBAGR56C,KAELpyB,EAAKsuE,GAAuBrsE,GAASmwB,GAAQ/b;;OAM7CvW,iBAAAA,SACNmC,GACAmwB,GACA/b;QAEA,IAAMskD,IAAW36D,KAAKiuE,GACpB;YACEtN;YACA4N;WAEF;YACElmE,MAAOuG,SAAAA;;;gBAGL+rD,KAGE/rD,EAAOurB,SAASrZ,aAChBzK,KACmB,aAAnBA,EAAQilD,SAERlpC,EACE,IAAIhvB,EACFhD,EAAKgB,aACL,mLAOJa,EAAQ2M;;YAGZmgB,OAAOqD;;;;;;;;IAULtyB,iBAAAA,SAAqBkxE;QAC3B,IAA+B,mBAApBA,GAA8B;YACvC,IAAwB,OAApBA,GACF,MAAM,IAAI5tE,EACRhD,EAAKI,kBACL;YAIJ,KACGR,KAAKkvE,GAAOn6C,SACqB,MAAlCi8C,EAAgBzpE,QAAQ,MAExB,MAAM,IAAInE,EACRhD,EAAKI,kBACL,qHAEMwwE;YAGV,IAAM1pE,IAAOtH,KAAKkvE,GAAO5nE,KAAKwO,MAC5B5O,EAAaqB,EAAWyoE;YAE1B,KAAK1oE,EAAY0O,GAAc1P,IAC7B,MAAM,IAAIlE,EACRhD,EAAKI,kBACL,8IAEU8G,4DAA0DA,EAAK3B;YAG7E,OAAO4J,EAASvP,KAAKgnD,UAAUC,IAAa,IAAI3+C,EAAYhB;;QACvD,IAAI0pE,aAA2BnqB,IAAmB;YACvD,IAAMtH,IAAMyxB;YACZ,OAAOzhE,EAASvP,KAAKgnD,UAAUC,IAAa1H,EAAI2H;;QAEhD,MAAM,IAAI9jD,EACRhD,EAAKI,kBACL,mIAEK+gD,GAAiByvB;;;;;;IASpBlxE,iBAAAA,SACN8B,GACAqvE;QAEA,KAAKrvB,MAAMjyC,QAAQ/N,MAA2B,MAAjBA,EAAM+D,QACjC,MAAM,IAAIvC,EACRhD,EAAKI,kBACL,uDACMywE,EAASxvE;QAGnB,IAAIG,EAAM+D,SAAS,IACjB,MAAM,IAAIvC,EACRhD,EAAKI,kBACL,qBAAmBywE,EAASxvE;QAIhC,IAAIG,EAAM2F,QAAQ,SAAS,GACzB,MAAM,IAAInE,EACRhD,EAAKI,kBACL,qBAAmBywE,EAASxvE;QAIhC,IAAIG,EAAM6F,QAAO+I,SAAAA;YAAWpG,OAAAA,OAAOkC,MAAMkE;YAAU7K,SAAS,GAC1D,MAAM,IAAIvC,EACRhD,EAAKI,kBACL,qBAAmBywE,EAASxvE;OAM1B3B,iBAAAA,SAAkB2H;QACxB,IAAIA,aAAkBoR,IAAa;YACjC,IAAMq4D,IAAW,2FACXC,IAAiB,mEACjBC,IAAYF,EAAS3pE,QAAQE,EAAOuR,OAAO,GAC3Cq4D,IAAkBF,EAAe5pE,QAAQE,EAAOuR,OAAO;YAE7D,IAAIvR,EAAOqR,MAAgB;gBACzB,IAAMw4D,IAAgBtxE,KAAKkvE,GAAO33D;gBAClC,IAAsB,SAAlB+5D,MAA2BA,EAAc9rE,QAAQiC,EAAOgK,QAC1D,MAAM,IAAIrO,EACRhD,EAAKI,kBACL,0IAE6B8wE,EAAc7vE,yBAChCgG,EAAOgK,MAAMhQ;gBAI5B,IAAM+V,IAAoBxX,KAAKkvE,GAAOz3D;gBACZ,SAAtBD,KACFxX,KAAKuxE,GACH9pE,EAAOgK,OACP+F;mBAGC,IAAI65D,KAAmBD,GAAW;;;gBAGvC,IAAII,IAAiC;gBAOrC,IANIH,MACFG,IAAgBxxE,KAAKkvE,GAAOuC,GAAmBN,KAE3B,SAAlBK,KAA0BJ,MAC5BI,IAAgBxxE,KAAKkvE,GAAOuC,GAAmBP,KAE5B,QAAjBM;;gBAEF,MAAIA,MAAkB/pE,EAAOuR,KACrB,IAAI5V,EACRhD,EAAKI,kBACL,kDACMiH,EAAOuR,GAAGvX,4BAGZ,IAAI2B,EACRhD,EAAKI,kBACL,oCAAkCiH,EAAOuR,GAAGvX,kCACjC+vE,EAAc/vE;;;OAQ7B3B,iBAAAA,SAAmB4W;QACzB,IAA2C,SAAvC1W,KAAKkvE,GAAOz3D,MAAiC;;YAE/C,IAAMH,IAAkBtX,KAAKkvE,GAAO33D;YACZ,SAApBD,KACFtX,KAAKuxE,GAAkCj6D,GAAiBZ,EAAQjF;;OAK9D3R,iBAAAA,SACN4xE,GACAh7D;QAEA,KAAKA,EAAQlR,QAAQksE,IACnB,MAAM,IAAItuE,EACRhD,EAAKI,kBACL,2FACiCkxE,EAAWjwE,8CACbiwE,EAAWjwE,+FAExBiV,EAAQjV;;;IAahC3B,WACmB4sE,GACAiF,GACAC,GACA5E;kBAHAN,aACAiF,aACAC,aACA5E,GATnBhtE,UAAoE,MACpEA,UAA+D;QAU7DA,KAAKm6B,WAAW,IAAI80C,GAClB2C,EAAUp7D,kBACVo7D,EAAU9wD;;WAIdJ;aAAAA;YACE,IAAM9R,IAAoD;YAE1D,OADA5O,KAAKmG,SAAQ0N,SAAAA;gBAAOjF,OAAAA,EAAOvI,KAAKwN;iBACzBjF;;;;QAGTwE;aAAAA;YACE,OAAOpT,KAAK4xE,GAAUlxD,KAAKtX;;;;QAG7B7C;aAAAA;YACE,OAAOvG,KAAK4xE,GAAUlxD,KAAKna;;;;QAG7BzG,sBAAAA,SACE4xB,GACAmgD;QAFF/xE;QAIE0gD,GAA4B,yBAAyBiC,WAAW,GAAG,IACnE/B,GAAgB,yBAAyB,YAAY,GAAGhvB;QACxD1xB,KAAK4xE,GAAUlxD,KAAKva,SAAQ0N,SAAAA;YAC1B6d,EAASvoB,KAAK0oE,GAAS7xE,EAAK8xE,GAAsBj+D;;OAItD4M;aAAAA;YACE,OAAO,IAAIrJ,GAAMpX,KAAK2xE,IAAgB3xE,KAAK0sE,IAAY1sE,KAAKgtE;;;;QAG9DltE,yBAAAA,SACEuW;QAEIA,MACF0rC,GAAoB,4BAA4B1rC,GAAS,EACvD,6BAEF4qC,GACE,4BACA,WACA,0BACA5qC,EAAQsqD;QAIZ,IAAMA,OACJtqD,MAAWA,EAAQsqD;QAGrB,IAAIA,KAA0B3gE,KAAK4xE,GAAU5wD,IAC3C,MAAM,IAAI5d,EACRhD,EAAKI,kBACL;QAkBJ,OAZGR,KAAK+xE,MACN/xE,KAAKgyE,OAAyCrR,MAE9C3gE,KAAK+xE;;;;;;iBAmNT/qB,GACA2Z,GACArX,GACAwf;YAEA,IAAIxf,EAAS3oC,GAAQvX,KAAW;;;gBAG9B,IACI5C,IAAQ;gBACZ,OAAO8iD,EAAS1oC,WAAW/Y,KAAIuY,SAAAA;oBAC7B,IAAMvM,IAAM,IAAI+6D,GACd5nB,GACA5mC,EAAOvM,IAAI9K,KACXqX,EAAOvM,KACPy1C,EAASxoC,WACTwoC,EAASzoC,GAAYpC,IAAI2B,EAAOvM,IAAI9K,MACpC+/D;oBAWF,OADU1oD,EAAOvM,KACV;wBACL0M,MAAM;wBACN1M,KAAAA;wBACAo+D,WAAW;wBACXC,UAAU1rE;;;;;;YAMd,IAAI2rE,IAAe7oB,EAAS3oC;YAC5B,OAAO2oC,EAAS1oC,WACbnZ,QACC2Y,SAAAA;gBAAUugD,OAAAA,0BAA0BvgD,EAAOG;gBAE5C1Y,KAAIuY,SAAAA;gBACH,IAAMvM,IAAM,IAAI+6D,GACd5nB,GACA5mC,EAAOvM,IAAI9K,KACXqX,EAAOvM,KACPy1C,EAASxoC,WACTwoC,EAASzoC,GAAYpC,IAAI2B,EAAOvM,IAAI9K,MACpC+/D,IAEEmJ,KAAY,GACZC,KAAY;gBAUhB,yBATI9xD,EAAOG,SACT0xD,IAAWE,EAAa5qE,QAAQ6Y,EAAOvM,IAAI9K,MAE3CopE,IAAeA,EAAaz+D,OAAO0M,EAAOvM,IAAI9K;oCAE5CqX,EAAOG,SAET2xD,KADAC,IAAeA,EAAazzD,IAAI0B,EAAOvM,MACftM,QAAQ6Y,EAAOvM,IAAI9K,OAEtC;oBAAEwX,MAAM6xD,GAAiBhyD,EAAOG;oBAAO1M,KAAAA;oBAAKo+D,UAAAA;oBAAUC,UAAAA;;;UAjR7DlyE,KAAK0sE,IACL/L,GACA3gE,KAAK4xE,IACL5xE,KAAKgtE,KAEPhtE,KAAKgyE,KAAuCrR,IAGvC3gE,KAAK+xE;;+DAIdjyE,sBAAAA,SAAQkF;QACN,MAAMA,aAAiB6rE,IACrB,MAAM5uB,GAAkB,WAAW,iBAAiB,GAAGj9C;QAGzD,OACEhF,KAAK0sE,OAAe1nE,EAAM0nE,MAC1B1sE,KAAK2xE,GAAensE,QAAQR,EAAM2sE,OAClC3xE,KAAK4xE,GAAUpsE,QAAQR,EAAM4sE,OAC7B5xE,KAAKgtE,OAAehoE,EAAMgoE;OAItBltE,iBAAAA,SAAsB+T;QAC5B,OAAO,IAAI+6D,GACT5uE,KAAK0sE,IACL74D,EAAI9K,KACJ8K,GACA7T,KAAKm6B,SAASrZ,WACd9gB,KAAK4xE,GAAU/wD,GAAYpC,IAAI5K,EAAI9K,MACnC/I,KAAKgtE;;;IAOTltE,WACWuyE,GACTrrB,GACAgmB;QAHFltE;QAME,KADA0B,IAAAA,aAAM8qE,GAAcxhD,GAAOunD,IAAQrrB,GAAWgmB,iBAJrCqF,GAKLA,EAAM1sE,SAAS,KAAM,GACvB,MAAM,IAAIvC,EACRhD,EAAKI,kBACL,kGAEK6xE,EAAMhrE,gBAAyBgrE,EAAM1sE;;;WAbmByR,mBAkBnEiZ;aAAAA;YACE,OAAOrwB,KAAKkvE,GAAO5nE,KAAKuN;;;;QAG1BoW;aAAAA;YACE,IAAM6N,IAAa94B,KAAKkvE,GAAO5nE,KAAK8jB;YACpC,OAAI0N,EAAW1vB,MACN,OAEA,IAAIy9C,GACT,IAAIv+C,EAAYwwB,IAChB94B,KAAKgnD;;;;QAKX1/C;aAAAA;YACE,OAAOtH,KAAKkvE,GAAO5nE,KAAKD;;;;QAG1BvH,kBAAAA,SAAIqsE;QAaF,IAZA3rB,GAA4B,2BAA2BiC,WAAW,GAAG;;;QAG5C,MAArBA,UAAU98C,WACZwmE,IAAalG,GAAOC,OAEtBxlB,GACE,2BACA,oBACA,GACAyrB;QAEiB,OAAfA,GACF,MAAM,IAAI/oE,EACRhD,EAAKI,kBACL;QAGJ,IAAM8G,IAAOJ,EAAaqB;QAC1B,OAAOs+C,GAAkBwlB,GACvBrsE,KAAKkvE,GAAO5nE,KAAKwO,MAAMxO,IACvBtH,KAAKgnD,WACLhnD,KAAKgtE;OAITltE,kBAAAA,SAAI8B;QACFw+C,GAA0B,2BAA2BqC,WAAW,IAIhE/B,GAAgB,2BAA2B,UAAU,GAH9B1gD,KAAKgtE,KACxBhtE,KAAKgtE,GAAWsF,YAAY1wE,KAC5BA;QAEJ,IAAM2wE,IAASvyE,KAAK6T;QACpB,OAAO0+D,EAAO9+D,IAAI7R,GAAOmB,MAAK;YAAMwvE,OAAAA;;OAGtCzyE,4BAAAA,SACEgpE;QAEA,OAAO,IAAIsD,EAAuBpsE,KAAKqyE,IAAOryE,KAAKgnD,WAAW8hB;;EA9EG1xD;;;;;;;;;;;;;;;;;;uBAkFrE;SAAS61D,GACPrpB,GACAvtC;IAEA,eAAIA,GACF,OAAO;QACL82D;;IAeJ,IAXAprB,GAAoB6B,GAAYvtC,GAAS,EAAC,SAAS,kBACnD4qC,GAA0B2C,GAAY,WAAW,SAASvtC,EAAQ82D,iB3B3lElEjtB,GACAc,GACAwxB,GACA7xB,GACA8xB;mBAEI9xB,cAjCJT,GACAc,GACAwxB,GACA7xB,GACA8xB;YAEA,MAAM9xB,aAAoBiB,QACxB,MAAM,IAAIx+C,EACRhD,EAAKI,kBACL,cAAY0/C,yBAA+Bc,6CACHO,GAAiBZ;YAI7D,KAAK,IAAIl6C,IAAI,GAAGA,IAAIk6C,EAASh7C,UAAUc,GACrC,KAAKgsE,EAAU9xB,EAASl6C,KACtB,MAAM,IAAIrD,EACRhD,EAAKI,kBACL,cAAY0/C,yBAA+Bc,yBACvBwxB,kCAA2C/rE,eACrD86C,GAAiBZ,EAASl6C;UAetCy5C,GACAc,GACAwxB,GACA7xB,GACA8xB;K2BglEJC,CACE9uB,GACA,eACA,2BACAvtC,EAAQ+2D,cACR58D,SAAAA;QACqB,OAAA,mBAAZA,KAAwBA,aAAmBg1C;oBAGlDnvC,EAAQ+2D,0BAA6B/2D,EAAQ82D,OAC/C,MAAM,IAAI/pE,EACRhD,EAAKI,kBACL,wCAAsCojD;IAK1C,OAAOvtC;;;AAGT,SAASs4D,GACP/qB,GACAvtC;IAEA,kBAAIA,IACK,MAGT0rC,GAAoB6B,GAAYvtC,GAAS,EAAC,uBAC1C6qC,GACE0C,GACA,GACA,oBACAvtC,EAAQ24D,kBACR,EAAC,YAAY,YAAY;IAEpB34D;;;AAGT,SAAS+3D,GACPxqB,GACAvtC;IAEAyqC,GAAwB8C,GAAY,UAAU,GAAGvtC,IAC7CA,MACF0rC,GAAoB6B,GAAYvtC,GAAS,EAAC,aAC1C6qC,GACE0C,GACA,GACA,UACAvtC,EAAQilD,QACR,EAAC,WAAW,UAAU;;;AAK5B,SAASuR,GACPjpB,GACAgpB,GACA5lB;IAEA,IAAM4lB,aAAuB/lB,IAEtB;QAAA,IAAI+lB,EAAY5lB,cAAcA,GACnC,MAAM,IAAI5jD,EACRhD,EAAKI,kBACL;QAGF,OAAOosE;;IAPP,MAAM3qB,GAAkB2B,GAAY,qBAAqB,GAAGgpB;;;AAqFhE,SAASwF,GAAiB7xD;IACxB,QAAQA;MACN;QACE,OAAO;;MACT;MACA;QACE,OAAO;;MACT;QACE,OAAO;;MACT;QACE,OAp8EsB3a;;;;;;;;;;;;aAi9EnB+sE,GACP7J,GACAlnE,GACAs+C;IAEA,IAAIgtB;IAOJ,OANIpE,KACFoE,IAAiBpE,EAAUwJ,YAAY1wE,IACvCs+C,IAAe,sBAAsBA,KAErCgtB,IAAiBtrE,GAEZ,EAACsrE,GAAgBhtB;;;SCv9EV0yB,GACdC,GACAC;IAEA,SAASC;QACP,IAAIhkD,IAAQ;QAKZ,MAJI+jD,MACF/jD,KAAS,KACTA,KAAS+jD,IAEL,IAAI1vE,EAAehD,EAAKI,kBAAkBuuB;;;;;QAWlD,OANAgkD,EAAkB9pE,YAAY4pE,EAAI5pE;;IAGlCD,OAAOgqE,OAAOD,GAAmBF,IAG1BE;;;;;;;;;;;;;;;;;;;;;ICTIE,KAAkBL,GAC7BzI,IACA,sCAEW+I,KAAoBN,GAC/BniB,IACA,uDAEW0iB,KAAmBP,GAC9BrG,IACA,8CAEW6G,KAA0BR,GACrC/rB,IACA,4CAEWwsB,KAAyBT,GAAuB7F,KAChDuG,KAA8BV,GACzChE,KAEW2E,KAAcX,GAAuBx7D,KACrCo8D,KAAsBZ,GAAuB/B,KAC7C4C,KAA4Bb,GACvCxG,IACA,mDAEWsH,KAAmBd;;sB1ByH9B9yE;QAEE,OADAmgD,GAAe,qBAAqBwC,YAC7B,IAAIa;2BAGbxjD;QAEE,OADAmgD,GAAe,8BAA8BwC,YACtC,IAAIc;sBAGbzjD;;;;gBAIE,OAHAwgD,GAA4B,yBAAyBmC,WAAW,IAGzD,IAAIkxB,GAAyBxjE;uBAGtCrQ;;;;gBAIE,OAHAwgD,GAA4B,0BAA0BmC,WAAW,IAG1D,IAAImxB,GAA0BzjE;qBAGvCrQ,SAAiBkd;QAGf,OAFA0jC,GAAgB,wBAAwB,UAAU,GAAG1jC,IACrDojC,GAA0B,wBAAwBqC,WAAW;QACtD,IAAIoxB,GAA+B72D;OAG5Cld,sBAAAA,SAAQkF;QACN,OAAOhF,SAASgF;;K0BtJlB,sCAEW8uE,KAAalB,GACxBlwB,IACA,kEAGIqxB,KAAqB;IACzB5J,WAAW8I;IACXrsB,UAAAA;IACAtiD,WAAAA;IACAo+C,MAAMoxB;IACNrjB,aAAayiB;IACb3G,YAAY4G;IACZtsB,mBAAmBusB;IACnBrG,kBAAkBsG;IAClBj8D,OAAOm8D;IACP3E,uBAAuB0E;IACvBzC,eAAe2C;IACfpH,qBAAqBqH;eACrB9rE;IACAqsE,YAAYN;IACZplD,aAAa67C,GAAU77C;IACvBo7C,sBAAAA;;;WCzEA5pE,iBAAAA,SAAY4xB;;OAIZ5xB,iBAAAA;;;;ICeAA;QAAAA;QANAE,UAA4C;YAC1CA,OAAAA,EAAKi0E;WACPj0E,UAA8C;YAC5CA,OAAAA,EAAKk0E;WACPl0E,UAAmD,IAGjDA,KAAKm0E;;WAGPr0E,iBAAAA,SAAY4xB;QACV1xB,KAAKo8D,GAAU/1D,KAAKqrB;OAGtB5xB,iBAAAA;QACE2iC,OAAO+F,oBAAoB,UAAUxoC,KAAKo0E,KAC1C3xC,OAAO+F,oBAAoB,WAAWxoC,KAAKq0E;OAGrCv0E,iBAAAA;QACN2iC,OAAO4F,iBAAiB,UAAUroC,KAAKo0E,KACvC3xC,OAAO4F,iBAAiB,WAAWroC,KAAKq0E;OAGlCv0E,iBAAAA;QACN+lB,GA/BY,uBA+BM;QAClB,KAAuB7lB,WAAAA,IAAAA,KAAKo8D,IAALp8D,cAAAA;aACrB0xB;;OAII5xB,iBAAAA;QACN+lB,GAtCY,uBAsCM;QAClB,KAAuB7lB,WAAAA,IAAAA,KAAKo8D,IAALp8D,cAAAA;aACrB0xB;;;;;;WAOJ5xB;QACE,OACoB,sBAAX2iC,qBACPA,OAAO4F,+BACP5F,OAAO+F;;;IC3CX1oC,WAAY6uB;QACV3uB,KAAKs0E,KAAS3lD,EAAK2lD,IACnBt0E,KAAKu0E,KAAU5lD,EAAK4lD;;WAGtBz0E,iBAAAA,SAAO4xB;QAEL1xB,KAAKw0E,KAAgB9iD;OAGvB5xB,iBAAAA,SAAQ4xB;QAEN1xB,KAAKy0E,KAAiB/iD;OAGxB5xB,wBAAAA,SAAU4xB;QAER1xB,KAAK00E,KAAmBhjD;OAG1B5xB,oBAAAA;QACEE,KAAKu0E;OAGPz0E,mBAAAA,SAAK0uB;QACHxuB,KAAKs0E,GAAO9lD;OAGd1uB,iBAAAA;QAKEE,KAAKw0E;OAGP10E,iBAAAA,SAAY2yB;QAKVzyB,KAAKy0E,GAAehiD;OAGtB3yB,iBAAAA,SAAc0uB;QAKZxuB,KAAK00E,GAAiBlmD;;KCvBpBmmD,KAAmD;IACzDC,mBAA6C;IAC7CC,QAAkC;GAK5BC,KAA0B,iBAAiBl1E;IAS/CE,WAAYi1E;QACV/0E,KAAKwP,KAAaulE,EAAKvlE;QACvB,IAAMoF,IAAQmgE,EAAK/kD,MAAM,UAAU;QACnChwB,KAAKg1E,KAAUpgE,IAAQ,QAAQmgE,EAAKhlD,MACpC/vB,KAAKiwB,mBAAmB8kD,EAAK9kD;;;;;kBAOvBnwB,iBAAAA,SACNiE,GACA0kD;QAEA,IAAIA,GACF,KAAK,IAAMwsB,KAAUxsB,EAAM3mD,GACrB2mD,EAAM3mD,EAAYoH,eAAe+rE,OACnClxE,EAAQkxE,KAAUxsB,EAAM3mD,EAAYmzE;QAI1ClxE,EAAQ,uBAAuB+wE;OAGjCh1E,iBAAAA,SACEyqD,GACA7a,GACA+Y;QAHF3oD,cAKQo1E,IAAMl1E,KAAKm1E,GAAQ5qB;QAEzB,OAAO,IAAIvoD,SAAQ,SAACC,GAAyBmwB;YAC3C,IAAMgjD,IAAM,IAAIC;YAChBD,EAAIE,WAAWC,YAAUC,WAAU;gBACjC;oBACE,QAAQJ,EAAIK;sBACV,KAAKC,YAAUC;wBACb,IAAMC,IAAOR,EAAIS;wBACjBhwD,GAhEE,cAgEgB,iBAAiBiX,KAAKC,UAAU64C,KAClD3zE,EAAQ2zE;wBACR;;sBACF,KAAKF,YAAUI;wBACbjwD,GApEE,cAoEgB,UAAU0kC,IAAU,gBACtCn4B,EACE,IAAIhvB,EAAehD,EAAKK,mBAAmB;wBAE7C;;sBACF,KAAKi1E,YAAUK;wBACb,IAAMpvD,IAASyuD,EAAIY;wBAQnB,IAPAnwD,GA3EE,cA6EA,UAAU0kC,IAAU,yBACpB5jC,GACA,kBACAyuD,EAAIa;wBAEFtvD,IAAS,GAAG;4BACd,IAAMuvD,IAAiBd,EAAIS,kBACxB9mD;4BACH,IACImnD,KACAA,EAAcvvD,UACduvD,EAAc30E,SAChB;gCACA,IAAM40E,a7EwK2BxvD;oCACjD,IAAMyvD,IAAczvD,EAAO0vD,cAActuE,QAAQ,KAAK;oCACtD,OAAOiB,OAAOyD,OAAOrM,GAAMmH,QAAQ6uE,MAAwB,IACtDA,IACDh2E,EAAKG;kC6E3KS21E,EAAcvvD;gCAEhByL,EACE,IAAIhvB,EACF+yE,GACAD,EAAc30E;mCAIlB6wB,EACE,IAAIhvB,EACFhD,EAAKG,SACL,kCAAkC60E,EAAIY;;;;wBAO5CnwD,GA9GA,cA8GkB,UAAU0kC,IAAU,aACtCn4B,EACE,IAAIhvB,EAAehD,EAAKgB,aAAa;wBAGzC;;sBACF;wBACEwE;;;oBAYJigB,GAjIM,cAiIY,UAAU0kC,IAAU;;;;;;YAO1C,IAAM+rB,IAAWttE,kBAAK0mC;mBACf4mC,EAAQ5mE;YAEf,IAAM6mE,IAAgBz5C,KAAKC,UAAUu5C;YACrCzwD,GA5IU,cA4IQ,iBAAiBqvD,IAAM,MAAMqB;;;;;;YAM/C,IAAMxyE,IAAqB;gBAAEyyE,gBAAgB;;YAE7Cx2E,EAAKy2E,GAAwB1yE,GAAS0kD,IAEtC2sB,EAAIptB,KAAKktB,GAAK,QAAQqB,GAAexyE,GApIlB;;OAwIvBjE,iBAAAA,SACEyqD,GACA7a,GACA+Y;;;QAIA,OAAOzoD,KAAKwqD,GAAuBD,GAAS7a,GAAS+Y;OAGvD3oD,iBAAAA,SACEyqD,GACA9B;QAEA,IAAMiuB,IAAW,EACf12E,KAAKg1E,IACL,KAxKqB,iCA0KrB,KACAzqB,GACA,cAEIosB,IAAsBC,+BACtBlnC,IAA6B;;;YAGjCmnC,oBAAoB;YACpBC,oBAAoB;YACpBC,kBAAkB;;;gBAGhBrnE,UAAU,cAAY1P,KAAKwP,GAAWC,4BAAuBzP,KAAKwP,GAAWE;;YAE/EsnE;YACAC;YACAC,uBAAuB;;;;;;;gBAOrBC,gCAAgC;;YAElClnD,kBAAkBjwB,KAAKiwB;;QAGzBjwB,KAAKy2E,GAAwB/mC,EAA2BonC,oBAAEruB;;;;;;;;;;;;;;;;QAoBvD2uB,uBACAC,qBACAC,kBACAC,YACAC,aACAC,2BAED/nC,EAAQgoC,4BAA4B;QAGtC,IAAMxC,IAAMwB,EAAStvE,KAAK;QAC1Bye,GAxOY,cAwOM,0BAA0BqvD,IAAM,MAAMxlC;QACxD,IAAMioC,IAAUhB,EAAoBiB,iBAAiB1C,GAAKxlC,IAOtDmoC,QAKAC,QAEEC,IAAe,IAAIC,GAAwB;YAC/CC,IAASzpD,SAAAA;gBACFspD,IASHjyD,GAlQM,cAkQY,6CAA6C2I,MAR1DqpD,MACHhyD,GA3PI,cA2Pc;gBAClB8xD,EAAQ/nC,QACRioC,SAEFhyD,GA/PM,cA+PY,uBAAuB2I,IACzCmpD,EAAQ3vB,KAAKx5B;;YAKjB0pD,IAAS;gBAAMP,OAAAA,EAAQ7zC;;YAOnBq0C,IAAuB,SAC3B53D,GACA5Z;;;YAIAgxE,EAAQ5d,OAAOx5C,IAAO63D,SAAAA;gBACpB;oBACEzxE,EAAGyxE;kBACH,OAAOnpD;oBACP+kB,YAAW;wBACT,MAAM/kB;wBACL;;;;;;;;;;;;;QAuFT,OAlFAkpD,EAAqBE,aAAW9C,UAAU+C,OAAM;YACzCR,KACHjyD,GA/RQ,cA+RU;aAItBsyD,EAAqBE,aAAW9C,UAAUgD,QAAO;YAC1CT,MACHA,QACAjyD,GAtSQ,cAsSU,gCAClBkyD,EAAaS;aAIjBL,EAA4BE,aAAW9C,UAAUzmD,QAAO2D,SAAAA;YACjDqlD,MACHA,QACAjyD,GA9SQ,cA8SU,iCAAiC4M,IACnDslD,EAAaS,GACX,IAAIp1E,EACFhD,EAAKgB,aACL;aAaR+2E,EACEE,aAAW9C,UAAUkD,UACrBjqD,SAAAA;;YACE,KAAKspD,GAAQ;gBACX,IAAMY,IAAUlqD,EAAK3b,KAAK;gBAjUcxP,KAkU3Bq1E;;;;;;gBAMb,IAAMC,IAA2CD,GAC3C3pD,IACJ4pD,EAAe5pD,wBACd4pD,EAAqC,iCAAI5pD;gBAC5C,IAAIA,GAAO;oBACTlJ,GA/UI,cA+Uc,8BAA8BkJ;;oBAEhD,IAAMpI,IAAiBoI,EAAMpI,QACzBrlB,a7EvRqBqlB;;;wBAGnC,IAAMrlB,IAAgB6U,GAAQwQ;wBAC9B,eAAIrlB,GAIJ,OAAO8Z,GAAmB9Z;sB6E+QgBqlB,IAC5BplB,IAAUwtB,EAAMxtB;+BAChBD,MACFA,IAAOlB,EAAKe,UACZI,IACE,2BACAolB,IACA,mBACAoI,EAAMxtB;;oBAGVu2E,QACAC,EAAaS,GAAY,IAAIp1E,EAAe9B,GAAMC,KAClDo2E,EAAQ7zC;uBAERje,GAjWI,cAiWc,wBAAwB6yD,IAC1CX,EAAaa,GAAcF;;aAMnC1kC,YAAW;;;;;YAKT+jC,EAAac;YACZ,IACId;;;IAITj4E,iBAAAA,SAAQyqD;QACN,IAAMuuB,IAAanE,GAAsBpqB;QAKzC,OACEvqD,KAAKg1E,KACL,kBAGAh1E,KAAKwP,GAAWC,YAChB,gBACAzP,KAAKwP,GAAWE,WAChB,gBACAopE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;SCtZUC,GAAkBtuD;;;;;;;;cLwEhC5qB,GACAm5E;QAKCn5E,EAAgCsB,SAAS83E,kBACxC,IAAIC,YACF,cACAC,SAAAA;YAEE,OKhFJ,SAAClP,GAAKxnE;gBAAS,OAAA,IAAI0nE,GAAUF,GAAKxnE,GAAM,IAAI22E;aLgFjCJ,CADKG,EAAUE,YAAY,OAAO32E,gBACZy2E,EAAUE,YAAY;mCAGrDC,kCAAqBvF;MKpFvBtpD,IAGFA,EAAS8uD;;;;;;;;;;;;;;;;;;;;;;;;;;ACVX/vE,GAAgBgwE,GAAY;ICM1B15E;QACEE,KAAKsiD,KAAkC,sBAAT54C;;WAGhCyb;aAAAA;;;YAGE,OAA2B,sBAAbA,WAA2BA,WAAW;;;;QAGtDsd;aAAAA;;;YAGE,OAAyB,sBAAXA,SAAyBA,SAAS;;;;QAGlD3iC,iBAAAA,SAAeooC;QACb,OAAOlmC,QAAQC,QAAQ,IAAIw3E,GAAqBvxC;OAGlDpoC,iBAAAA;QACE,OAAI45E,GAA2Bz3C,OACtB,IAAIy3C,KAEJ,IAAIC;OAIf75E,iBAAAA,SAAc0P;QACZ,OAAO,IAAIoqE,GAAoBpqE,GAAY;YAAEqqE;;OAG/C/5E,iBAAAA,SAAW8B;QACT,OAAOk7B,KAAKC,UAAUn7B;OAGxB9B,mBAAAA,SAAKg6E;QACH,OAAOpwE,KAAKowE;OAGdh6E,mBAAAA,SAAKi6E;QACH,OAAOlwE,KAAKkwE;OAGdj6E,iBAAAA,SAAYk6E;;QAIV,IAAMC;;QAEY,sBAATC,SAAyBA,KAAKD,UAAWC,KAAuBC,WACnEpzD,IAAQ,IAAIhd,WAAWiwE;QAC7B,IAAIC,GACFA,EAAOG,gBAAgBrzD;;QAGvB,KAAK,IAAItgB,IAAI,GAAGA,IAAIuzE,GAAQvzE,KAC1BsgB,EAAMtgB,KAAK5B,KAAKC,MAAsB,MAAhBD,KAAKmzB;QAG/B,OAAOjR;;OFrDXgyD,GAAkBl5E"}