{"version":3,"file":"index.rn.esm2017.js","sources":["../src/core/version.ts","../src/util/log.ts","../src/platform/browser/format_json.ts","../src/util/assert.ts","../src/platform/browser/random_bytes.ts","../src/util/misc.ts","../src/core/database_info.ts","../src/util/obj.ts","../src/util/obj_map.ts","../src/util/error.ts","../src/api/timestamp.ts","../src/core/snapshot_version.ts","../src/model/path.ts","../src/model/document_key.ts","../src/util/types.ts","../src/core/target.ts","../src/core/query.ts","../src/platform/rn/base64.ts","../src/util/byte_string.ts","../src/local/target_data.ts","../src/remote/existence_filter.ts","../src/remote/rpc_error.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/model/server_timestamps.ts","../src/model/values.ts","../src/remote/serializer.ts","../src/model/transform_operation.ts","../src/model/mutation.ts","../src/model/object_value.ts","../src/model/document.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/local_serializer.ts","../src/local/indexeddb_remote_document_cache.ts","../src/core/target_id_generator.ts","../src/local/indexeddb_target_cache.ts","../src/local/indexeddb_persistence.ts","../src/local/indexeddb_mutation_queue.ts","../src/local/indexeddb_schema.ts","../src/local/simple_db.ts","../src/platform/browser/dom.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/platform/browser/serializer.ts","../src/api/user_data_reader.ts","../src/auth/user.ts","../src/api/credentials.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/remote/stream_bridge.ts","../src/platform/browser/webchannel_connection.ts","../src/platform/browser/connectivity_monitor.ts","../src/remote/connectivity_monitor_noop.ts","../src/core/component_provider.ts","../src/platform/browser/connection.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/config.ts","../index.rn.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\nimport { Logger, LogLevel, LogLevelString } from '@firebase/logger';\nimport { SDK_VERSION } from '../core/version';\nimport { formatJSON } from '../platform/format_json';\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: LogLevelString | LogLevel): void {\n  logClient.setLogLevel(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\nexport function logWarn(msg: string, ...obj: unknown[]): void {\n  if (logClient.logLevel <= LogLevel.WARN) {\n    const args = obj.map(argToString);\n    logClient.warn(`Firestore (${SDK_VERSION}): ${msg}`, ...args);\n  }\n}\n\n/**\n * Converts an additional log parameter to a string representation.\n */\nfunction argToString(obj: unknown): string | unknown {\n  if (typeof obj === 'string') {\n    return obj;\n  } else {\n    try {\n      return formatJSON(obj);\n    } catch (e) {\n      // Converting to JSON failed, just log the object directly\n      return obj;\n    }\n  }\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/** Formats an object as a JSON string, suitable for logging. */\nexport function formatJSON(value: unknown): string {\n  return JSON.stringify(value);\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { SDK_VERSION } from '../core/version';\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 | never {\n  debugAssert(\n    obj instanceof constructor,\n    `Expected type '${constructor.name}', but was '${obj.constructor.name}'`\n  );\n  return obj as T;\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { debugAssert } from '../../util/assert';\n\n/**\n * Generates `nBytes` of random bytes.\n *\n * If `nBytes < 0` , an error will be thrown.\n */\nexport function randomBytes(nBytes: number): Uint8Array {\n  debugAssert(nBytes >= 0, `Expecting non-negative nBytes, got: ${nBytes}`);\n\n  // Polyfills for IE and WebWorker by using `self` and `msCrypto` when `crypto` is not available.\n  const crypto =\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    typeof self !== 'undefined' && (self.crypto || (self as any)['msCrypto']);\n  const bytes = new Uint8Array(nBytes);\n  if (crypto) {\n    crypto.getRandomValues(bytes);\n  } else {\n    // Falls back to Math.random\n    for (let i = 0; i < nBytes; i++) {\n      bytes[i] = Math.floor(Math.random() * 256);\n    }\n  }\n  return bytes;\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { debugAssert } from './assert';\nimport { randomBytes } from '../platform/random_bytes';\n\nexport type EventHandler<E> = (value: E) => void;\nexport interface Indexable {\n  [k: string]: unknown;\n}\n\nexport class AutoId {\n  static newId(): string {\n    // Alphanumeric characters\n    const chars =\n      'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789';\n    // The largest byte value that is a multiple of `char.length`.\n    const maxMultiple = Math.floor(256 / chars.length) * chars.length;\n    debugAssert(\n      0 < maxMultiple && maxMultiple < 256,\n      `Expect maxMultiple to be (0, 256), but got ${maxMultiple}`\n    );\n\n    let autoId = '';\n    const targetLength = 20;\n    while (autoId.length < targetLength) {\n      const bytes = randomBytes(40);\n      for (let i = 0; i < bytes.length; ++i) {\n        // Only accept values that are [0, maxMultiple), this ensures they can\n        // be evenly mapped to indices of `chars` via a modulo operation.\n        if (autoId.length < targetLength && bytes[i] < maxMultiple) {\n          autoId += chars.charAt(bytes[i] % chars.length);\n        }\n      }\n    }\n    debugAssert(autoId.length === targetLength, 'Invalid auto ID: ' + autoId);\n\n    return autoId;\n  }\n}\n\nexport function primitiveComparator<T>(left: T, right: T): number {\n  if (left < right) {\n    return -1;\n  }\n  if (left > right) {\n    return 1;\n  }\n  return 0;\n}\n\nexport interface Equatable<T> {\n  isEqual(other: T): boolean;\n}\n\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 { 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 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 { forEach, isEmpty } from './obj';\n\ntype Entry<K, V> = [K, V];\n\n/**\n * A map implementation that uses objects as keys. Objects must have an\n * associated equals function and must be immutable. Entries in the map are\n * stored together with the key being produced from the mapKeyFn. This map\n * automatically handles collisions of keys.\n */\nexport class ObjectMap<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(\n    private mapKeyFn: (key: KeyType) => string,\n    private equalsFn: (l: KeyType, r: KeyType) => boolean\n  ) {}\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 (this.equalsFn(otherKey, 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 (this.equalsFn(matches[i][0], 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 (this.equalsFn(matches[i][0], 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 * 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 { 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 emptyPath(): ResourcePath {\n    return new ResourcePath([]);\n  }\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 emptyPath(): FieldPath {\n    return new FieldPath([]);\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { debugAssert } from '../util/assert';\n\nimport { ResourcePath } from './path';\n\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 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\n// An Object whose keys and values are strings.\nexport interface StringMap {\n  [key: string]: string;\n}\n\n/**\n * Returns whether a variable is either undefined or null.\n */\nexport function isNullOrUndefined(value: unknown): value is null | undefined {\n  return value === null || value === undefined;\n}\n\n/** Returns whether the value represents -0. */\nexport function isNegativeZero(value: number): boolean {\n  // Detect if the value is -0.0. Based on polyfill from\n  // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/is\n  return value === -0 && 1 / value === 1 / -0;\n}\n\n/**\n * Returns whether a value is an integer and in the safe integer range\n * @param value The value to test for being an integer and in the safe range\n */\nexport function isSafeInteger(value: unknown): boolean {\n  return (\n    typeof value === 'number' &&\n    Number.isInteger(value) &&\n    !isNegativeZero(value) &&\n    value <= Number.MAX_SAFE_INTEGER &&\n    value >= Number.MIN_SAFE_INTEGER\n  );\n}\n\n/** The subset of the browser's Window interface used by the SDK. */\nexport interface WindowLike {\n  readonly localStorage: Storage;\n  readonly indexedDB: IDBFactory | null;\n  addEventListener(type: string, listener: EventListener): void;\n  removeEventListener(type: string, listener: EventListener): void;\n}\n\n/** The subset of the browser's Document interface used by the SDK. */\nexport interface DocumentLike {\n  readonly visibilityState: VisibilityState;\n  addEventListener(type: string, listener: EventListener): void;\n  removeEventListener(type: string, listener: EventListener): void;\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 {\n  Bound,\n  boundEquals,\n  canonifyBound,\n  canonifyFilter,\n  filterEquals,\n  stringifyFilter,\n  OrderBy,\n  orderByEquals,\n  stringifyOrderBy,\n  canonifyOrderBy,\n  Filter\n} from './query';\nimport { debugCast } from '../util/assert';\n\n/**\n * A Target represents the WatchTarget representation of a Query, which is used\n * by the LocalStore and the RemoteStore to keep track of and to execute\n * backend queries. While a Query can represent multiple Targets, each Targets\n * maps to a single WatchTarget in RemoteStore and a single TargetData entry\n * in persistence.\n */\nexport interface Target {\n  readonly path: ResourcePath;\n  readonly collectionGroup: string | null;\n  readonly orderBy: OrderBy[];\n  readonly filters: Filter[];\n  readonly limit: number | null;\n  readonly startAt: Bound | null;\n  readonly endAt: Bound | null;\n}\n\n// Visible for testing\nexport class TargetImpl implements Target {\n  memoizedCanonicalId: string | null = null;\n  constructor(\n    readonly path: ResourcePath,\n    readonly collectionGroup: string | null = null,\n    readonly orderBy: OrderBy[] = [],\n    readonly filters: Filter[] = [],\n    readonly limit: number | null = null,\n    readonly startAt: Bound | null = null,\n    readonly endAt: Bound | null = null\n  ) {}\n}\n\n/**\n * Initializes a Target with a path and optional additional query constraints.\n * Path must currently be empty if this is a collection group query.\n *\n * NOTE: you should always construct `Target` from `Query.toTarget` instead of\n * using this factory method, because `Query` provides an implicit `orderBy`\n * property.\n */\nexport function newTarget(\n  path: ResourcePath,\n  collectionGroup: string | null = null,\n  orderBy: OrderBy[] = [],\n  filters: Filter[] = [],\n  limit: number | null = null,\n  startAt: Bound | null = null,\n  endAt: Bound | null = null\n): Target {\n  return new TargetImpl(\n    path,\n    collectionGroup,\n    orderBy,\n    filters,\n    limit,\n    startAt,\n    endAt\n  );\n}\n\nexport function canonifyTarget(target: Target): string {\n  const targetImpl = debugCast(target, TargetImpl);\n\n  if (targetImpl.memoizedCanonicalId === null) {\n    let canonicalId = targetImpl.path.canonicalString();\n    if (targetImpl.collectionGroup !== null) {\n      canonicalId += '|cg:' + targetImpl.collectionGroup;\n    }\n    canonicalId += '|f:';\n    canonicalId += targetImpl.filters.map(f => canonifyFilter(f)).join(',');\n    canonicalId += '|ob:';\n    canonicalId += targetImpl.orderBy.map(o => canonifyOrderBy(o)).join(',');\n\n    if (!isNullOrUndefined(targetImpl.limit)) {\n      canonicalId += '|l:';\n      canonicalId += targetImpl.limit!;\n    }\n    if (targetImpl.startAt) {\n      canonicalId += '|lb:';\n      canonicalId += canonifyBound(targetImpl.startAt);\n    }\n    if (targetImpl.endAt) {\n      canonicalId += '|ub:';\n      canonicalId += canonifyBound(targetImpl.endAt);\n    }\n    targetImpl.memoizedCanonicalId = canonicalId;\n  }\n  return targetImpl.memoizedCanonicalId;\n}\n\nexport function stringifyTarget(target: Target): string {\n  let str = target.path.canonicalString();\n  if (target.collectionGroup !== null) {\n    str += ' collectionGroup=' + target.collectionGroup;\n  }\n  if (target.filters.length > 0) {\n    str += `, filters: [${target.filters\n      .map(f => stringifyFilter(f))\n      .join(', ')}]`;\n  }\n  if (!isNullOrUndefined(target.limit)) {\n    str += ', limit: ' + target.limit;\n  }\n  if (target.orderBy.length > 0) {\n    str += `, orderBy: [${target.orderBy\n      .map(o => stringifyOrderBy(o))\n      .join(', ')}]`;\n  }\n  if (target.startAt) {\n    str += ', startAt: ' + canonifyBound(target.startAt);\n  }\n  if (target.endAt) {\n    str += ', endAt: ' + canonifyBound(target.endAt);\n  }\n  return `Target(${str})`;\n}\n\nexport function targetEquals(left: Target, right: Target): boolean {\n  if (left.limit !== right.limit) {\n    return false;\n  }\n\n  if (left.orderBy.length !== right.orderBy.length) {\n    return false;\n  }\n\n  for (let i = 0; i < left.orderBy.length; i++) {\n    if (!orderByEquals(left.orderBy[i], right.orderBy[i])) {\n      return false;\n    }\n  }\n\n  if (left.filters.length !== right.filters.length) {\n    return false;\n  }\n\n  for (let i = 0; i < left.filters.length; i++) {\n    if (!filterEquals(left.filters[i], right.filters[i])) {\n      return false;\n    }\n  }\n\n  if (left.collectionGroup !== right.collectionGroup) {\n    return false;\n  }\n\n  if (!left.path.isEqual(right.path)) {\n    return false;\n  }\n\n  if (!boundEquals(left.startAt, right.startAt)) {\n    return false;\n  }\n\n  return boundEquals(left.endAt, right.endAt);\n}\n\nexport function isDocumentTarget(target: Target): boolean {\n  return (\n    DocumentKey.isDocumentKey(target.path) &&\n    target.collectionGroup === null &&\n    target.filters.length === 0\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 {\n  canonifyTarget,\n  isDocumentTarget,\n  newTarget,\n  stringifyTarget,\n  Target,\n  targetEquals\n} from './target';\n\nexport const enum LimitType {\n  First = 'F',\n  Last = 'L'\n}\n\n/**\n * 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  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 isDocumentTarget(this.toTarget());\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 = newTarget(\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 = newTarget(\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 assertValidBound(bound: Bound): void {\n    debugAssert(\n      bound.position.length <= this.orderBy.length,\n      'Bound is longer than orderBy'\n    );\n  }\n}\n\nexport function queryEquals(left: Query, right: Query): boolean {\n  return (\n    targetEquals(left.toTarget(), right.toTarget()) &&\n    left.limitType === right.limitType\n  );\n}\n\n// TODO(b/29183165): This is used to get a unique string from a query to, for\n// example, use as a dictionary key, but the implementation is subject to\n// collisions. Make it collision-free.\nexport function canonifyQuery(query: Query): string {\n  return `${canonifyTarget(query.toTarget())}|lt:${query.limitType}`;\n}\n\nexport function stringifyQuery(query: Query): string {\n  return `Query(target=${stringifyTarget(query.toTarget())}; limitType=${\n    query.limitType\n  })`;\n}\n\n/** Returns whether `doc` matches the constraints of `query`. */\nexport function queryMatches(query: Query, doc: Document): boolean {\n  return (\n    queryMatchesPathAndCollectionGroup(query, doc) &&\n    queryMatchesOrderBy(query, doc) &&\n    queryMatchesFilters(query, doc) &&\n    queryMatchesBounds(query, doc)\n  );\n}\n\nfunction queryMatchesPathAndCollectionGroup(\n  query: Query,\n  doc: Document\n): boolean {\n  const docPath = doc.key.path;\n  if (query.collectionGroup !== null) {\n    // NOTE: this.path is currently always empty since we don't expose Collection\n    // Group queries rooted at a document path yet.\n    return (\n      doc.key.hasCollectionId(query.collectionGroup) &&\n      query.path.isPrefixOf(docPath)\n    );\n  } else if (DocumentKey.isDocumentKey(query.path)) {\n    // exact match for document queries\n    return query.path.isEqual(docPath);\n  } else {\n    // shallow ancestor queries by default\n    return query.path.isImmediateParentOf(docPath);\n  }\n}\n\n/**\n * A document must have a value for every ordering clause in order to show up\n * in the results.\n */\nfunction queryMatchesOrderBy(query: Query, doc: Document): boolean {\n  for (const orderBy of query.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\nfunction queryMatchesFilters(query: Query, doc: Document): boolean {\n  for (const filter of query.filters) {\n    if (!filter.matches(doc)) {\n      return false;\n    }\n  }\n  return true;\n}\n\n/** Makes sure a document is within the bounds, if provided. */\nfunction queryMatchesBounds(query: Query, doc: Document): boolean {\n  if (\n    query.startAt &&\n    !sortsBeforeDocument(query.startAt, query.orderBy, doc)\n  ) {\n    return false;\n  }\n  if (query.endAt && sortsBeforeDocument(query.endAt, query.orderBy, doc)) {\n    return false;\n  }\n  return true;\n}\n\n/**\n * Returns a new comparator function that can be used to compare two documents\n * based on the Query's ordering constraint.\n */\nexport function newQueryComparator(\n  query: Query\n): (d1: Document, d2: Document) => number {\n  return (d1: Document, d2: Document): number => {\n    let comparedOnKeyField = false;\n    for (const orderBy of query.orderBy) {\n      const comp = compareDocs(orderBy, d1, d2);\n      if (comp !== 0) {\n        return comp;\n      }\n      comparedOnKeyField = comparedOnKeyField || orderBy.field.isKeyField();\n    }\n    // Assert that we actually compared by key\n    debugAssert(\n      comparedOnKeyField,\n      \"orderBy used that doesn't compare on key field\"\n    );\n    return 0;\n  };\n}\n\nexport abstract class Filter {\n  abstract matches(doc: Document): 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\nexport function canonifyFilter(filter: Filter): string {\n  debugAssert(\n    filter instanceof FieldFilter,\n    'canonifyFilter() only supports FieldFilters'\n  );\n  // TODO(b/29183165): Technically, this won't be unique if two values have\n  // the same description, such as the int 3 and the string \"3\". So we should\n  // add the types in here somehow, too.\n  return (\n    filter.field.canonicalString() +\n    filter.op.toString() +\n    canonicalId(filter.value)\n  );\n}\n\nexport function filterEquals(f1: Filter, f2: Filter): boolean {\n  return (\n    f1 instanceof FieldFilter &&\n    f2 instanceof FieldFilter &&\n    f1.op === f2.op &&\n    f1.field.isEqual(f2.field) &&\n    valueEquals(f1.value, f2.value)\n  );\n}\n\n/** Returns a debug description for `filter`. */\nexport function stringifyFilter(filter: Filter): string {\n  debugAssert(\n    filter instanceof FieldFilter,\n    'stringifyFilter() only supports FieldFilters'\n  );\n  return `${filter.field.canonicalString()} ${filter.op} ${canonicalId(\n    filter.value\n  )}`;\n}\n\n/** Filter that matches on key fields (i.e. '__name__'). */\nexport class KeyFieldFilter extends FieldFilter {\n  private readonly key: DocumentKey;\n\n  constructor(field: FieldPath, op: Operator, value: 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\nexport function canonifyBound(bound: Bound): string {\n  // TODO(b/29183165): Make this collision robust.\n  return `${bound.before ? 'b' : 'a'}:${bound.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 */\nexport function sortsBeforeDocument(\n  bound: Bound,\n  orderBy: OrderBy[],\n  doc: Document\n): boolean {\n  debugAssert(\n    bound.position.length <= orderBy.length,\n    \"Bound has more components than query's orderBy\"\n  );\n  let comparison = 0;\n  for (let i = 0; i < bound.position.length; i++) {\n    const orderByComponent = orderBy[i];\n    const component = bound.position[i];\n    if (orderByComponent.field.isKeyField()) {\n      debugAssert(\n        isReferenceValue(component),\n        'Bound has a non-key value where the key path is being used.'\n      );\n      comparison = DocumentKey.comparator(\n        DocumentKey.fromName(component.referenceValue),\n        doc.key\n      );\n    } else {\n      const docValue = doc.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 bound.before ? comparison <= 0 : comparison < 0;\n}\n\nexport function boundEquals(left: Bound | null, right: Bound | null): boolean {\n  if (left === null) {\n    return right === null;\n  } else if (right === null) {\n    return false;\n  }\n\n  if (\n    left.before !== right.before ||\n    left.position.length !== right.position.length\n  ) {\n    return false;\n  }\n  for (let i = 0; i < left.position.length; i++) {\n    const leftPosition = left.position[i];\n    const rightPosition = right.position[i];\n    if (!valueEquals(leftPosition, rightPosition)) {\n      return false;\n    }\n  }\n  return true;\n}\n\n/**\n * An ordering on a field, in some Direction. Direction defaults to ASCENDING.\n */\nexport class OrderBy {\n  constructor(\n    readonly field: FieldPath,\n    readonly dir: Direction = Direction.ASCENDING\n  ) {}\n}\n\nexport function compareDocs(\n  orderBy: OrderBy,\n  d1: Document,\n  d2: Document\n): number {\n  const comparison = orderBy.field.isKeyField()\n    ? DocumentKey.comparator(d1.key, d2.key)\n    : compareDocumentsByField(orderBy.field, d1, d2);\n  switch (orderBy.dir) {\n    case Direction.ASCENDING:\n      return comparison;\n    case Direction.DESCENDING:\n      return -1 * comparison;\n    default:\n      return fail('Unknown direction: ' + orderBy.dir);\n  }\n}\n\nexport function canonifyOrderBy(orderBy: OrderBy): string {\n  // TODO(b/29183165): Make this collision robust.\n  return orderBy.field.canonicalString() + orderBy.dir;\n}\n\nexport function stringifyOrderBy(orderBy: OrderBy): string {\n  return `${orderBy.field.canonicalString()} (${orderBy.dir})`;\n}\n\nexport function orderByEquals(left: OrderBy, right: OrderBy): boolean {\n  return left.dir === right.dir && left.field.isEqual(right.field);\n}\n","/**\n * @license\n * Copyright 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 { base64 } from '@firebase/util';\n\n// WebSafe uses a different URL-encoding safe alphabet that doesn't match\n// the encoding used on the backend.\nconst WEB_SAFE = false;\n\n/** Converts a Base64 encoded string to a binary string. */\nexport function decodeBase64(encoded: string): string {\n  return String.fromCharCode.apply(\n    null,\n    // We use `decodeStringToByteArray()` instead of `decodeString()` since\n    // `decodeString()` returns Unicode strings, which doesn't match the values\n    // returned by `atob()`'s Latin1 representation.\n    base64.decodeStringToByteArray(encoded, WEB_SAFE)\n  );\n}\n\n/** Converts a binary string to a Base64 encoded string. */\nexport function encodeBase64(raw: string): string {\n  const bytes: number[] = [];\n  for (let i = 0; i < raw.length; i++) {\n    bytes[i] = raw.charCodeAt(i);\n  }\n  return base64.encodeByteArray(bytes, WEB_SAFE);\n}\n\n/** True if and only if the Base64 conversion functions are available. */\nexport function isBase64Available(): boolean {\n  return true;\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { decodeBase64, encodeBase64 } from '../platform/base64';\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 = decodeBase64(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 encodeBase64(this.binaryString);\n  }\n\n  toUint8Array(): Uint8Array {\n    return uint8ArrayFromBinaryString(this.binaryString);\n  }\n\n  approximateByteSize(): number {\n    return this.binaryString.length * 2;\n  }\n\n  compareTo(other: ByteString): number {\n    return primitiveComparator(this.binaryString, other.binaryString);\n  }\n\n  isEqual(other: ByteString): boolean {\n    return this.binaryString === other.binaryString;\n  }\n}\n\n/**\n * Helper function to convert an Uint8array to a binary string.\n */\nexport function binaryStringFromUint8Array(array: Uint8Array): string {\n  let binaryString = '';\n  for (let i = 0; i < array.length; ++i) {\n    binaryString += String.fromCharCode(array[i]);\n  }\n  return binaryString;\n}\n\n/**\n * Helper function to convert a binary string to an Uint8Array.\n */\nexport function uint8ArrayFromBinaryString(binaryString: string): Uint8Array {\n  const buffer = new Uint8Array(binaryString.length);\n  for (let i = 0; i < binaryString.length; i++) {\n    buffer[i] = binaryString.charCodeAt(i);\n  }\n  return buffer;\n}\n","/**\n * @license\n * Copyright 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 { 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 { 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, queryEquals } 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      !queryEquals(this.query, 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';\nimport { isDocumentTarget } from '../core/target';\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 (isDocumentTarget(target)) {\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 && isDocumentTarget(targetData.target)) {\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 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 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 { isDocumentTarget, 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';\nimport {\n  TargetChangeTargetChangeType,\n  WriteResult\n} from '../protos/firestore_proto_api';\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\n/**\n * This class generates JsonObject values for the Datastore API suitable for\n * sending to either GRPC stub methods or via the JSON/HTTP REST API.\n *\n * The serializer supports both Protobuf.js and Proto3 JSON formats. By\n * setting `useProto3Json` to true, the serializer will use the Proto3 JSON\n * format.\n *\n * For a description of the Proto3 JSON format check\n * https://developers.google.com/protocol-buffers/docs/proto3#json\n *\n * TODO(klimt): We can remove the databaseId argument if we keep the full\n * resource name in documents.\n */\nexport class JsonProtoSerializer {\n  constructor(\n    readonly databaseId: DatabaseId,\n    readonly useProto3Json: boolean\n  ) {}\n}\n\nfunction fromRpcStatus(status: api.Status): FirestoreError {\n  const code =\n    status.code === undefined ? Code.UNKNOWN : mapCodeFromRpcCode(status.code);\n  return new FirestoreError(code, status.message || '');\n}\n\n/**\n * Returns a value for a number (or null) that's appropriate to put into\n * a google.protobuf.Int32Value proto.\n * DO NOT USE THIS FOR ANYTHING ELSE.\n * This method cheats. It's typed as returning \"number\" because that's what\n * our generated proto interfaces say Int32Value must be. But GRPC actually\n * expects a { value: <number> } struct.\n */\nfunction toInt32Proto(\n  serializer: JsonProtoSerializer,\n  val: number | null\n): number | { value: number } | null {\n  if (serializer.useProto3Json || isNullOrUndefined(val)) {\n    return val;\n  } else {\n    return { value: val };\n  }\n}\n\n/**\n * Returns a number (or null) from a google.protobuf.Int32Value proto.\n */\nfunction fromInt32Proto(\n  val: number | { value: number } | undefined\n): number | null {\n  let result;\n  if (typeof val === 'object') {\n    result = val.value;\n  } else {\n    result = val;\n  }\n  return isNullOrUndefined(result) ? null : result;\n}\n\n/**\n * Returns an IntegerValue for `value`.\n */\nexport function 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 */\nexport function toDouble(\n  serializer: JsonProtoSerializer,\n  value: number\n): api.Value {\n  if (serializer.useProto3Json) {\n    if (isNaN(value)) {\n      return { doubleValue: 'NaN' };\n    } else if (value === Infinity) {\n      return { doubleValue: 'Infinity' };\n    } else if (value === -Infinity) {\n      return { doubleValue: '-Infinity' };\n    }\n  }\n  return { doubleValue: isNegativeZero(value) ? '-0' : value };\n}\n\n/**\n * Returns a value for a number that's appropriate to put into a proto.\n * The return value is an IntegerValue if it can safely represent the value,\n * otherwise a DoubleValue is returned.\n */\nexport function toNumber(\n  serializer: JsonProtoSerializer,\n  value: number\n): api.Value {\n  return isSafeInteger(value) ? toInteger(value) : toDouble(serializer, value);\n}\n\n/**\n * Returns a value for a Date that's appropriate to put into a proto.\n */\nexport function toTimestamp(\n  serializer: JsonProtoSerializer,\n  timestamp: Timestamp\n): api.Timestamp {\n  if (serializer.useProto3Json) {\n    // Serialize to ISO-8601 date format, but with full nano resolution.\n    // Since JS Date has only millis, let's only use it for the seconds and\n    // then manually add the fractions to the end.\n    const jsDateStr = new Date(timestamp.seconds * 1000).toISOString();\n    // Remove .xxx frac part and Z in the end.\n    const strUntilSeconds = jsDateStr.replace(/\\.\\d*/, '').replace('Z', '');\n    // Pad the fraction out to 9 digits (nanos).\n    const nanoStr = ('000000000' + timestamp.nanoseconds).slice(-9);\n\n    return `${strUntilSeconds}.${nanoStr}Z`;\n  } else {\n    return {\n      seconds: '' + timestamp.seconds,\n      nanos: timestamp.nanoseconds\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    } as any;\n  }\n}\n\nfunction fromTimestamp(date: 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 */\nexport function toBytes(\n  serializer: JsonProtoSerializer,\n  bytes: Blob | ByteString\n): string | Uint8Array {\n  if (serializer.useProto3Json) {\n    return bytes.toBase64();\n  } else {\n    return bytes.toUint8Array();\n  }\n}\n\n/**\n * Returns a ByteString based on the proto string value.\n */\nexport function fromBytes(\n  serializer: JsonProtoSerializer,\n  value: string | Uint8Array | undefined\n): ByteString {\n  if (serializer.useProto3Json) {\n    hardAssert(\n      value === undefined || typeof value === 'string',\n      'value must be undefined or a string when using proto3 Json'\n    );\n    return ByteString.fromBase64String(value ? value : '');\n  } else {\n    hardAssert(\n      value === undefined || value instanceof Uint8Array,\n      'value must be undefined or Uint8Array'\n    );\n    return ByteString.fromUint8Array(value ? value : new Uint8Array());\n  }\n}\n\nexport function toVersion(\n  serializer: JsonProtoSerializer,\n  version: SnapshotVersion\n): api.Timestamp {\n  return toTimestamp(serializer, version.toTimestamp());\n}\n\nexport function fromVersion(version: api.Timestamp): SnapshotVersion {\n  hardAssert(!!version, \"Trying to deserialize version that isn't set\");\n  return SnapshotVersion.fromTimestamp(fromTimestamp(version));\n}\n\nexport function toResourceName(\n  databaseId: DatabaseId,\n  path: ResourcePath\n): string {\n  return fullyQualifiedPrefixPath(databaseId)\n    .child('documents')\n    .child(path)\n    .canonicalString();\n}\n\nfunction fromResourceName(name: string): ResourcePath {\n  const resource = ResourcePath.fromString(name);\n  hardAssert(\n    isValidResourceName(resource),\n    'Tried to deserialize invalid key ' + resource.toString()\n  );\n  return resource;\n}\n\nexport function toName(\n  serializer: JsonProtoSerializer,\n  key: DocumentKey\n): string {\n  return toResourceName(serializer.databaseId, key.path);\n}\n\nexport function fromName(\n  serializer: JsonProtoSerializer,\n  name: string\n): DocumentKey {\n  const resource = fromResourceName(name);\n  hardAssert(\n    resource.get(1) === serializer.databaseId.projectId,\n    'Tried to deserialize key from different project: ' +\n      resource.get(1) +\n      ' vs ' +\n      serializer.databaseId.projectId\n  );\n  hardAssert(\n    (!resource.get(3) && !serializer.databaseId.database) ||\n      resource.get(3) === serializer.databaseId.database,\n    'Tried to deserialize key from different database: ' +\n      resource.get(3) +\n      ' vs ' +\n      serializer.databaseId.database\n  );\n  return new DocumentKey(extractLocalPathFromResourceName(resource));\n}\n\nfunction toQueryPath(\n  serializer: JsonProtoSerializer,\n  path: ResourcePath\n): string {\n  return toResourceName(serializer.databaseId, path);\n}\n\nfunction fromQueryPath(name: string): ResourcePath {\n  const resourceName = fromResourceName(name);\n  // In v1beta1 queries for collections at the root did not have a trailing\n  // \"/documents\". In v1 all resource paths contain \"/documents\". Preserve the\n  // ability to read the v1beta1 form for compatibility with queries persisted\n  // in the local target cache.\n  if (resourceName.length === 4) {\n    return ResourcePath.emptyPath();\n  }\n  return extractLocalPathFromResourceName(resourceName);\n}\n\nexport function getEncodedDatabaseId(serializer: JsonProtoSerializer): string {\n  const path = new ResourcePath([\n    'projects',\n    serializer.databaseId.projectId,\n    'databases',\n    serializer.databaseId.database\n  ]);\n  return path.canonicalString();\n}\n\nfunction fullyQualifiedPrefixPath(databaseId: DatabaseId): ResourcePath {\n  return new ResourcePath([\n    'projects',\n    databaseId.projectId,\n    'databases',\n    databaseId.database\n  ]);\n}\n\nfunction extractLocalPathFromResourceName(\n  resourceName: ResourcePath\n): ResourcePath {\n  hardAssert(\n    resourceName.length > 4 && resourceName.get(4) === 'documents',\n    'tried to deserialize invalid key ' + resourceName.toString()\n  );\n  return resourceName.popFirst(5);\n}\n\n/** Creates an api.Document from key and fields (but no create/update time) */\nexport function toMutationDocument(\n  serializer: JsonProtoSerializer,\n  key: DocumentKey,\n  fields: ObjectValue\n): api.Document {\n  return {\n    name: toName(serializer, key),\n    fields: fields.proto.mapValue.fields\n  };\n}\n\nexport function toDocument(\n  serializer: JsonProtoSerializer,\n  document: Document\n): api.Document {\n  debugAssert(\n    !document.hasLocalMutations,\n    \"Can't serialize documents with mutations.\"\n  );\n  return {\n    name: toName(serializer, document.key),\n    fields: document.toProto().mapValue.fields,\n    updateTime: toTimestamp(serializer, document.version.toTimestamp())\n  };\n}\n\nexport function fromDocument(\n  serializer: JsonProtoSerializer,\n  document: api.Document,\n  hasCommittedMutations?: boolean\n): Document {\n  const key = fromName(serializer, document.name!);\n  const version = 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\nfunction fromFound(\n  serializer: JsonProtoSerializer,\n  doc: api.BatchGetDocumentsResponse\n): 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 = fromName(serializer, doc.found.name);\n  const version = fromVersion(doc.found.updateTime);\n  const data = new ObjectValue({ mapValue: { fields: doc.found.fields } });\n  return new Document(key, version, data, {});\n}\n\nfunction fromMissing(\n  serializer: JsonProtoSerializer,\n  result: api.BatchGetDocumentsResponse\n): 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 = fromName(serializer, result.missing);\n  const version = fromVersion(result.readTime);\n  return new NoDocument(key, version);\n}\n\nexport function fromMaybeDocument(\n  serializer: JsonProtoSerializer,\n  result: api.BatchGetDocumentsResponse\n): MaybeDocument {\n  if ('found' in result) {\n    return fromFound(serializer, result);\n  } else if ('missing' in result) {\n    return fromMissing(serializer, result);\n  }\n  return fail('invalid batch get response: ' + JSON.stringify(result));\n}\n\nexport function fromWatchChange(\n  serializer: JsonProtoSerializer,\n  change: api.ListenResponse\n): WatchChange {\n  let watchChange: WatchChange;\n  if ('targetChange' in change) {\n    assertPresent(change.targetChange, 'targetChange');\n    // proto3 default value is unset in JSON (undefined), so use 'NO_CHANGE'\n    // if unset\n    const state = fromWatchTargetChangeState(\n      change.targetChange.targetChangeType || 'NO_CHANGE'\n    );\n    const targetIds: TargetId[] = change.targetChange.targetIds || [];\n\n    const resumeToken = fromBytes(serializer, change.targetChange.resumeToken);\n    const causeProto = change.targetChange!.cause;\n    const cause = causeProto && fromRpcStatus(causeProto);\n    watchChange = new WatchTargetChange(\n      state,\n      targetIds,\n      resumeToken,\n      cause || null\n    );\n  } else if ('documentChange' in change) {\n    assertPresent(change.documentChange, 'documentChange');\n    const entityChange = change.documentChange;\n    assertPresent(entityChange.document, 'documentChange.name');\n    assertPresent(entityChange.document.name, 'documentChange.document.name');\n    assertPresent(\n      entityChange.document.updateTime,\n      'documentChange.document.updateTime'\n    );\n    const key = fromName(serializer, entityChange.document.name);\n    const version = fromVersion(entityChange.document.updateTime);\n    const 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 = fromName(serializer, docDelete.document);\n    const version = docDelete.readTime\n      ? 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 = fromName(serializer, docRemove.document);\n    const removedTargetIds = docRemove.removedTargetIds || [];\n    watchChange = new DocumentWatchChange([], removedTargetIds, key, null);\n  } else if ('filter' in change) {\n    // TODO(dimond): implement existence filter parsing with strategy.\n    assertPresent(change.filter, 'filter');\n    const filter = change.filter;\n    assertPresent(filter.targetId, 'filter.targetId');\n    const count = filter.count || 0;\n    const existenceFilter = new ExistenceFilter(count);\n    const targetId = filter.targetId;\n    watchChange = new ExistenceFilterChange(targetId, existenceFilter);\n  } else {\n    return fail('Unknown change type ' + JSON.stringify(change));\n  }\n  return watchChange;\n}\n\nfunction fromWatchTargetChangeState(\n  state: 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\nexport function versionFromListenResponse(\n  change: api.ListenResponse\n): SnapshotVersion {\n  // We have only reached a consistent snapshot for the entire stream if there\n  // is a read_time set and it applies to all targets (i.e. the list of\n  // targets is empty). The backend is guaranteed to send such responses.\n  if (!('targetChange' in change)) {\n    return SnapshotVersion.min();\n  }\n  const targetChange = change.targetChange!;\n  if (targetChange.targetIds && targetChange.targetIds.length) {\n    return SnapshotVersion.min();\n  }\n  if (!targetChange.readTime) {\n    return SnapshotVersion.min();\n  }\n  return fromVersion(targetChange.readTime);\n}\n\nexport function toMutation(\n  serializer: JsonProtoSerializer,\n  mutation: Mutation\n): api.Write {\n  let result: api.Write;\n  if (mutation instanceof SetMutation) {\n    result = {\n      update: toMutationDocument(serializer, mutation.key, mutation.value)\n    };\n  } else if (mutation instanceof DeleteMutation) {\n    result = { delete: toName(serializer, mutation.key) };\n  } else if (mutation instanceof PatchMutation) {\n    result = {\n      update: toMutationDocument(serializer, mutation.key, mutation.data),\n      updateMask: toDocumentMask(mutation.fieldMask)\n    };\n  } else if (mutation instanceof TransformMutation) {\n    result = {\n      transform: {\n        document: toName(serializer, mutation.key),\n        fieldTransforms: mutation.fieldTransforms.map(transform =>\n          toFieldTransform(serializer, transform)\n        )\n      }\n    };\n  } else if (mutation instanceof VerifyMutation) {\n    result = {\n      verify: toName(serializer, mutation.key)\n    };\n  } else {\n    return fail('Unknown mutation type ' + mutation.type);\n  }\n\n  if (!mutation.precondition.isNone) {\n    result.currentDocument = toPrecondition(serializer, mutation.precondition);\n  }\n\n  return result;\n}\n\nexport function fromMutation(\n  serializer: JsonProtoSerializer,\n  proto: api.Write\n): Mutation {\n  const precondition = proto.currentDocument\n    ? fromPrecondition(proto.currentDocument)\n    : Precondition.none();\n\n  if (proto.update) {\n    assertPresent(proto.update.name, 'name');\n    const key = fromName(serializer, proto.update.name);\n    const value = new ObjectValue({\n      mapValue: { fields: proto.update.fields }\n    });\n    if (proto.updateMask) {\n      const fieldMask = 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 = fromName(serializer, proto.delete);\n    return new DeleteMutation(key, precondition);\n  } else if (proto.transform) {\n    const key = fromName(serializer, proto.transform.document!);\n    const fieldTransforms = proto.transform.fieldTransforms!.map(transform =>\n      fromFieldTransform(serializer, 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 = fromName(serializer, proto.verify);\n    return new VerifyMutation(key, precondition);\n  } else {\n    return fail('unknown mutation proto: ' + JSON.stringify(proto));\n  }\n}\n\nfunction toPrecondition(\n  serializer: JsonProtoSerializer,\n  precondition: Precondition\n): api.Precondition {\n  debugAssert(!precondition.isNone, \"Can't serialize an empty precondition\");\n  if (precondition.updateTime !== undefined) {\n    return {\n      updateTime: toVersion(serializer, precondition.updateTime)\n    };\n  } else if (precondition.exists !== undefined) {\n    return { exists: precondition.exists };\n  } else {\n    return fail('Unknown precondition');\n  }\n}\n\nfunction fromPrecondition(precondition: api.Precondition): Precondition {\n  if (precondition.updateTime !== undefined) {\n    return Precondition.updateTime(fromVersion(precondition.updateTime));\n  } else if (precondition.exists !== undefined) {\n    return Precondition.exists(precondition.exists);\n  } else {\n    return Precondition.none();\n  }\n}\n\nfunction fromWriteResult(\n  proto: WriteResult,\n  commitTime: api.Timestamp\n): MutationResult {\n  // NOTE: Deletes don't have an updateTime.\n  let version = proto.updateTime\n    ? fromVersion(proto.updateTime)\n    : fromVersion(commitTime);\n\n  if (version.isEqual(SnapshotVersion.min())) {\n    // The Firestore Emulator currently returns an update time of 0 for\n    // deletes of non-existing documents (rather than null). This breaks the\n    // test \"get deleted doc while offline with source=cache\" as NoDocuments\n    // with version 0 are filtered by IndexedDb's RemoteDocumentCache.\n    // TODO(#2149): Remove this when Emulator is fixed\n    version = fromVersion(commitTime);\n  }\n\n  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\nexport function fromWriteResults(\n  protos: 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 => fromWriteResult(proto, commitTime));\n  } else {\n    return [];\n  }\n}\n\nfunction toFieldTransform(\n  serializer: JsonProtoSerializer,\n  fieldTransform: FieldTransform\n): 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\nfunction fromFieldTransform(\n  serializer: JsonProtoSerializer,\n  proto: api.FieldTransform\n): FieldTransform {\n  let transform: TransformOperation | null = null;\n  if ('setToServerValue' in proto) {\n    hardAssert(\n      proto.setToServerValue === 'REQUEST_TIME',\n      'Unknown server value transform proto: ' + JSON.stringify(proto)\n    );\n    transform = new ServerTimestampTransform();\n  } else if ('appendMissingElements' in proto) {\n    const values = proto.appendMissingElements!.values || [];\n    transform = new ArrayUnionTransformOperation(values);\n  } else if ('removeAllFromArray' in proto) {\n    const values = proto.removeAllFromArray!.values || [];\n    transform = new ArrayRemoveTransformOperation(values);\n  } else if ('increment' in proto) {\n    transform = new NumericIncrementTransformOperation(\n      serializer,\n      proto.increment!\n    );\n  } else {\n    fail('Unknown transform proto: ' + JSON.stringify(proto));\n  }\n  const fieldPath = FieldPath.fromServerFormat(proto.fieldPath!);\n  return new FieldTransform(fieldPath, transform!);\n}\n\nexport function toDocumentsTarget(\n  serializer: JsonProtoSerializer,\n  target: Target\n): api.DocumentsTarget {\n  return { documents: [toQueryPath(serializer, target.path)] };\n}\n\nexport function fromDocumentsTarget(\n  documentsTarget: api.DocumentsTarget\n): Target {\n  const count = documentsTarget.documents!.length;\n  hardAssert(\n    count === 1,\n    'DocumentsTarget contained other than 1 document: ' + count\n  );\n  const name = documentsTarget.documents![0];\n  return Query.atPath(fromQueryPath(name)).toTarget();\n}\n\nexport function toQueryTarget(\n  serializer: JsonProtoSerializer,\n  target: Target\n): 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 = toQueryPath(serializer, path);\n    result.structuredQuery!.from = [\n      {\n        collectionId: target.collectionGroup,\n        allDescendants: true\n      }\n    ];\n  } else {\n    debugAssert(\n      path.length % 2 !== 0,\n      'Document queries with filters are not supported.'\n    );\n    result.parent = toQueryPath(serializer, path.popLast());\n    result.structuredQuery!.from = [{ collectionId: path.lastSegment() }];\n  }\n\n  const where = toFilter(target.filters);\n  if (where) {\n    result.structuredQuery!.where = where;\n  }\n\n  const orderBy = toOrder(target.orderBy);\n  if (orderBy) {\n    result.structuredQuery!.orderBy = orderBy;\n  }\n\n  const limit = toInt32Proto(serializer, target.limit);\n  if (limit !== null) {\n    result.structuredQuery!.limit = limit;\n  }\n\n  if (target.startAt) {\n    result.structuredQuery!.startAt = toCursor(target.startAt);\n  }\n  if (target.endAt) {\n    result.structuredQuery!.endAt = toCursor(target.endAt);\n  }\n\n  return result;\n}\n\nexport function fromQueryTarget(target: api.QueryTarget): Target {\n  let path = fromQueryPath(target.parent!);\n\n  const query = target.structuredQuery!;\n  const fromCount = query.from ? query.from.length : 0;\n  let collectionGroup: string | null = null;\n  if (fromCount > 0) {\n    hardAssert(\n      fromCount === 1,\n      'StructuredQuery.from with more than one collection is not supported.'\n    );\n    const from = query.from![0];\n    if (from.allDescendants) {\n      collectionGroup = from.collectionId!;\n    } else {\n      path = path.child(from.collectionId!);\n    }\n  }\n\n  let filterBy: Filter[] = [];\n  if (query.where) {\n    filterBy = fromFilter(query.where);\n  }\n\n  let orderBy: OrderBy[] = [];\n  if (query.orderBy) {\n    orderBy = fromOrder(query.orderBy);\n  }\n\n  let limit: number | null = null;\n  if (query.limit) {\n    limit = fromInt32Proto(query.limit);\n  }\n\n  let startAt: Bound | null = null;\n  if (query.startAt) {\n    startAt = fromCursor(query.startAt);\n  }\n\n  let endAt: Bound | null = null;\n  if (query.endAt) {\n    endAt = 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\nexport function toListenRequestLabels(\n  serializer: JsonProtoSerializer,\n  targetData: TargetData\n): api.ApiClientObjectMap<string> | null {\n  const value = toLabel(serializer, targetData.purpose);\n  if (value == null) {\n    return null;\n  } else {\n    return {\n      'goog-listen-tags': value\n    };\n  }\n}\n\nfunction toLabel(\n  serializer: JsonProtoSerializer,\n  purpose: TargetPurpose\n): string | null {\n  switch (purpose) {\n    case TargetPurpose.Listen:\n      return null;\n    case TargetPurpose.ExistenceFilterMismatch:\n      return 'existence-filter-mismatch';\n    case TargetPurpose.LimboResolution:\n      return 'limbo-document';\n    default:\n      return fail('Unrecognized query purpose: ' + purpose);\n  }\n}\n\nexport function toTarget(\n  serializer: JsonProtoSerializer,\n  targetData: TargetData\n): api.Target {\n  let result: api.Target;\n  const target = targetData.target;\n\n  if (isDocumentTarget(target)) {\n    result = { documents: toDocumentsTarget(serializer, target) };\n  } else {\n    result = { query: toQueryTarget(serializer, target) };\n  }\n\n  result.targetId = targetData.targetId;\n\n  if (targetData.resumeToken.approximateByteSize() > 0) {\n    result.resumeToken = toBytes(serializer, targetData.resumeToken);\n  }\n\n  return result;\n}\n\nfunction 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 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\nfunction fromFilter(filter: api.Filter | undefined): Filter[] {\n  if (!filter) {\n    return [];\n  } else if (filter.unaryFilter !== undefined) {\n    return [fromUnaryFilter(filter)];\n  } else if (filter.fieldFilter !== undefined) {\n    return [fromFieldFilter(filter)];\n  } else if (filter.compositeFilter !== undefined) {\n    return filter.compositeFilter\n      .filters!.map(f => fromFilter(f))\n      .reduce((accum, current) => accum.concat(current));\n  } else {\n    return fail('Unknown filter: ' + JSON.stringify(filter));\n  }\n}\n\nfunction toOrder(orderBys: OrderBy[]): api.Order[] | undefined {\n  if (orderBys.length === 0) {\n    return;\n  }\n  return orderBys.map(order => toPropertyOrder(order));\n}\n\nfunction fromOrder(orderBys: api.Order[]): OrderBy[] {\n  return orderBys.map(order => fromPropertyOrder(order));\n}\n\nfunction toCursor(cursor: Bound): api.Cursor {\n  return {\n    before: cursor.before,\n    values: cursor.position\n  };\n}\n\nfunction 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\nexport function toDirection(dir: Direction): api.OrderDirection {\n  return DIRECTIONS[dir];\n}\n\n// visible for testing\nexport function fromDirection(\n  dir: api.OrderDirection | undefined\n): Direction | undefined {\n  switch (dir) {\n    case 'ASCENDING':\n      return Direction.ASCENDING;\n    case 'DESCENDING':\n      return Direction.DESCENDING;\n    default:\n      return undefined;\n  }\n}\n\n// visible for testing\nexport function toOperatorName(op: Operator): api.FieldFilterOp {\n  return OPERATORS[op];\n}\n\nexport function 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\nexport function toFieldPathReference(path: FieldPath): api.FieldReference {\n  return { fieldPath: path.canonicalString() };\n}\n\nexport function fromFieldPathReference(\n  fieldReference: api.FieldReference\n): FieldPath {\n  return FieldPath.fromServerFormat(fieldReference.fieldPath!);\n}\n\n// visible for testing\nexport function toPropertyOrder(orderBy: OrderBy): api.Order {\n  return {\n    field: toFieldPathReference(orderBy.field),\n    direction: toDirection(orderBy.dir)\n  };\n}\n\nexport function fromPropertyOrder(orderBy: api.Order): OrderBy {\n  return new OrderBy(\n    fromFieldPathReference(orderBy.field!),\n    fromDirection(orderBy.direction)\n  );\n}\n\nexport function fromFieldFilter(filter: api.Filter): Filter {\n  return FieldFilter.create(\n    fromFieldPathReference(filter.fieldFilter!.field!),\n    fromOperatorName(filter.fieldFilter!.op!),\n    filter.fieldFilter!.value!\n  );\n}\n\n// visible for testing\nexport function toUnaryOrFieldFilter(filter: FieldFilter): api.Filter {\n  if (filter.op === Operator.EQUAL) {\n    if (isNanValue(filter.value)) {\n      return {\n        unaryFilter: {\n          field: toFieldPathReference(filter.field),\n          op: 'IS_NAN'\n        }\n      };\n    } else if (isNullValue(filter.value)) {\n      return {\n        unaryFilter: {\n          field: toFieldPathReference(filter.field),\n          op: 'IS_NULL'\n        }\n      };\n    }\n  }\n  return {\n    fieldFilter: {\n      field: toFieldPathReference(filter.field),\n      op: toOperatorName(filter.op),\n      value: filter.value\n    }\n  };\n}\n\nexport function fromUnaryFilter(filter: api.Filter): Filter {\n  switch (filter.unaryFilter!.op!) {\n    case 'IS_NAN':\n      const nanField = fromFieldPathReference(filter.unaryFilter!.field!);\n      return FieldFilter.create(nanField, Operator.EQUAL, {\n        doubleValue: NaN\n      });\n    case 'IS_NULL':\n      const nullField = fromFieldPathReference(filter.unaryFilter!.field!);\n      return FieldFilter.create(nullField, Operator.EQUAL, {\n        nullValue: 'NULL_VALUE'\n      });\n    case 'OPERATOR_UNSPECIFIED':\n      return fail('Unspecified filter');\n    default:\n      return fail('Unknown filter');\n  }\n}\n\nexport function 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\nexport function fromDocumentMask(proto: api.DocumentMask): FieldMask {\n  const paths = proto.fieldPaths || [];\n  return new FieldMask(paths.map(path => FieldPath.fromServerFormat(path)));\n}\n\nexport function isValidResourceName(path: ResourcePath): boolean {\n  // Resource names have at least 4 components (project ID, database ID)\n  return (\n    path.length >= 4 &&\n    path.get(0) === 'projects' &&\n    path.get(2) === 'databases'\n  );\n}\n","/**\n * @license\n * Copyright 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, toDouble, toInteger } from '../remote/serializer';\nimport {\n  isArray,\n  isInteger,\n  isNumber,\n  normalizeNumber,\n  valueEquals\n} from './values';\nimport { serverTimestamp } from './server_timestamps';\nimport { arrayEquals } from '../util/misc';\n\n/** Represents a transform within a TransformMutation. */\nexport class TransformOperation {\n  // Make sure that the structural type of `TransformOperation` is unique.\n  // See https://github.com/microsoft/TypeScript/issues/5451\n  private _ = undefined;\n}\n\n/**\n * Computes the local transform result against the provided `previousValue`,\n * optionally using the provided localWriteTime.\n */\nexport function applyTransformOperationToLocalView(\n  transform: TransformOperation,\n  previousValue: api.Value | null,\n  localWriteTime: Timestamp\n): api.Value {\n  if (transform instanceof ServerTimestampTransform) {\n    return serverTimestamp(localWriteTime, previousValue);\n  } else if (transform instanceof ArrayUnionTransformOperation) {\n    return applyArrayUnionTransformOperation(transform, previousValue);\n  } else if (transform instanceof ArrayRemoveTransformOperation) {\n    return applyArrayRemoveTransformOperation(transform, previousValue);\n  } else {\n    debugAssert(\n      transform instanceof NumericIncrementTransformOperation,\n      'Expected NumericIncrementTransformOperation but was: ' + transform\n    );\n    return applyNumericIncrementTransformOperationToLocalView(\n      transform,\n      previousValue\n    );\n  }\n}\n\n/**\n * Computes a final transform result after the transform has been acknowledged\n * by the server, potentially using the server-provided transformResult.\n */\nexport function applyTransformOperationToRemoteDocument(\n  transform: TransformOperation,\n  previousValue: 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  if (transform instanceof ArrayUnionTransformOperation) {\n    return applyArrayUnionTransformOperation(transform, previousValue);\n  } else if (transform instanceof ArrayRemoveTransformOperation) {\n    return applyArrayRemoveTransformOperation(transform, previousValue);\n  }\n\n  debugAssert(\n    transformResult !== null,\n    \"Didn't receive transformResult for non-array transform\"\n  );\n  return transformResult;\n}\n\n/**\n * If this transform operation is not idempotent, returns the base value to\n * persist for this transform. If a base value is returned, the transform\n * operation is always applied to this base value, even if document has\n * already been updated.\n *\n * Base values provide consistent behavior for non-idempotent transforms and\n * allow us to return the same latency-compensated value even if the backend\n * has already applied the transform operation. The base value is null for\n * idempotent transforms, as they can be re-played even if the backend has\n * already applied them.\n *\n * @return a base value to store along with the mutation, or null for\n * idempotent transforms.\n */\nexport function computeTransformOperationBaseValue(\n  transform: TransformOperation,\n  previousValue: api.Value | null\n): api.Value | null {\n  if (transform instanceof NumericIncrementTransformOperation) {\n    return isNumber(previousValue) ? previousValue! : { integerValue: 0 };\n  }\n  return null;\n}\n\nexport function transformOperationEquals(\n  left: TransformOperation,\n  right: TransformOperation\n): boolean {\n  if (\n    left instanceof ArrayUnionTransformOperation &&\n    right instanceof ArrayUnionTransformOperation\n  ) {\n    return arrayEquals(left.elements, right.elements, valueEquals);\n  } else if (\n    left instanceof ArrayRemoveTransformOperation &&\n    right instanceof ArrayRemoveTransformOperation\n  ) {\n    return arrayEquals(left.elements, right.elements, valueEquals);\n  } else if (\n    left instanceof NumericIncrementTransformOperation &&\n    right instanceof NumericIncrementTransformOperation\n  ) {\n    return valueEquals(left.operand, right.operand);\n  }\n\n  return (\n    left instanceof ServerTimestampTransform &&\n    right instanceof ServerTimestampTransform\n  );\n}\n\n/** Transforms a value into a server-generated timestamp. */\nexport class ServerTimestampTransform extends TransformOperation {}\n\n/** Transforms an array value via a union operation. */\nexport class ArrayUnionTransformOperation extends TransformOperation {\n  constructor(readonly elements: api.Value[]) {\n    super();\n  }\n}\n\nfunction applyArrayUnionTransformOperation(\n  transform: ArrayUnionTransformOperation,\n  previousValue: api.Value | null\n): api.Value {\n  const values = coercedFieldValuesArray(previousValue);\n  for (const toUnion of transform.elements) {\n    if (!values.some(element => valueEquals(element, toUnion))) {\n      values.push(toUnion);\n    }\n  }\n  return { arrayValue: { values } };\n}\n\n/** Transforms an array value via a remove operation. */\nexport class ArrayRemoveTransformOperation extends TransformOperation {\n  constructor(readonly elements: api.Value[]) {\n    super();\n  }\n}\n\nfunction applyArrayRemoveTransformOperation(\n  transform: ArrayRemoveTransformOperation,\n  previousValue: api.Value | null\n): api.Value {\n  let values = coercedFieldValuesArray(previousValue);\n  for (const toRemove of transform.elements) {\n    values = values.filter(element => !valueEquals(element, toRemove));\n  }\n  return { arrayValue: { values } };\n}\n\n/**\n * Implements the backend semantics for locally computed NUMERIC_ADD (increment)\n * transforms. Converts all field values to integers or doubles, but unlike the\n * backend does not cap integer values at 2^63. Instead, JavaScript number\n * arithmetic is used and precision loss can occur for values greater than 2^53.\n */\nexport class NumericIncrementTransformOperation extends TransformOperation {\n  constructor(\n    readonly serializer: JsonProtoSerializer,\n    readonly operand: api.Value\n  ) {\n    super();\n    debugAssert(\n      isNumber(operand),\n      'NumericIncrementTransform transform requires a NumberValue'\n    );\n  }\n}\n\nexport function applyNumericIncrementTransformOperationToLocalView(\n  transform: NumericIncrementTransformOperation,\n  previousValue: api.Value | null\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 = computeTransformOperationBaseValue(\n    transform,\n    previousValue\n  )!;\n  const sum = asNumber(baseValue) + asNumber(transform.operand);\n  if (isInteger(baseValue) && isInteger(transform.operand)) {\n    return toInteger(sum);\n  } else {\n    return toDouble(transform.serializer, sum);\n  }\n}\n\nfunction asNumber(value: api.Value): number {\n  return normalizeNumber(value.integerValue || value.doubleValue);\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, 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 {\n  applyTransformOperationToLocalView,\n  applyTransformOperationToRemoteDocument,\n  computeTransformOperationBaseValue,\n  TransformOperation,\n  transformOperationEquals\n} 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\nexport function fieldTransformEquals(\n  left: FieldTransform,\n  right: FieldTransform\n): boolean {\n  return (\n    left.field.isEqual(right.field) &&\n    transformOperationEquals(left.transform, right.transform)\n  );\n}\n\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  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 * Returns true if the preconditions is valid for the given document\n * (or null if no document is available).\n */\nexport function preconditionIsValidForDocument(\n  precondition: Precondition,\n  maybeDoc: MaybeDocument | null\n): boolean {\n  if (precondition.updateTime !== undefined) {\n    return (\n      maybeDoc instanceof Document &&\n      maybeDoc.version.isEqual(precondition.updateTime)\n    );\n  } else if (precondition.exists !== undefined) {\n    return precondition.exists === maybeDoc instanceof Document;\n  } else {\n    debugAssert(precondition.isNone, 'Precondition should be empty');\n    return true;\n  }\n}\n\n/**\n * A mutation describes a self-contained change to a document. Mutations can\n * create, replace, delete, and update subsets of documents.\n *\n * Mutations not only act on the value of the document but also its version.\n *\n * For local mutations (mutations that haven't been committed yet), we preserve\n * the existing version for Set, 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/**\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 mutation The mutation to apply.\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 */\nexport function applyMutationToRemoteDocument(\n  mutation: Mutation,\n  maybeDoc: MaybeDocument | null,\n  mutationResult: MutationResult\n): MaybeDocument {\n  verifyMutationKeyMatches(mutation, maybeDoc);\n  if (mutation instanceof SetMutation) {\n    return applySetMutationToRemoteDocument(mutation, maybeDoc, mutationResult);\n  } else if (mutation instanceof PatchMutation) {\n    return applyPatchMutationToRemoteDocument(\n      mutation,\n      maybeDoc,\n      mutationResult\n    );\n  } else if (mutation instanceof TransformMutation) {\n    return applyTransformMutationToRemoteDocument(\n      mutation,\n      maybeDoc,\n      mutationResult\n    );\n  } else {\n    debugAssert(\n      mutation instanceof DeleteMutation,\n      'Unexpected mutation type: ' + mutation\n    );\n    return applyDeleteMutationToRemoteDocument(\n      mutation,\n      maybeDoc,\n      mutationResult\n    );\n  }\n}\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 mutation The mutation to apply.\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 */\nexport function applyMutationToLocalView(\n  mutation: Mutation,\n  maybeDoc: MaybeDocument | null,\n  baseDoc: MaybeDocument | null,\n  localWriteTime: Timestamp\n): MaybeDocument | null {\n  verifyMutationKeyMatches(mutation, maybeDoc);\n\n  if (mutation instanceof SetMutation) {\n    return applySetMutationToLocalView(mutation, maybeDoc);\n  } else if (mutation instanceof PatchMutation) {\n    return applyPatchMutationToLocalView(mutation, maybeDoc);\n  } else if (mutation instanceof TransformMutation) {\n    return applyTransformMutationToLocalView(\n      mutation,\n      maybeDoc,\n      localWriteTime,\n      baseDoc\n    );\n  } else {\n    debugAssert(\n      mutation instanceof DeleteMutation,\n      'Unexpected mutation type: ' + mutation\n    );\n    return applyDeleteMutationToLocalView(mutation, maybeDoc);\n  }\n}\n\n/**\n * If this mutation is not idempotent, returns the base value to persist with\n * this mutation. If a base value is returned, the mutation is always applied\n * to this base value, even if document has already been updated.\n *\n * The base value is a sparse object that consists of only the document\n * fields for which this mutation contains a non-idempotent transformation\n * (e.g. a numeric increment). The provided value guarantees consistent\n * behavior for non-idempotent transforms and allow us to return the same\n * latency-compensated value even if the backend has already applied the\n * mutation. The base value is null for idempotent mutations, as they can be\n * re-played even if the backend has already applied them.\n *\n * @return a base value to store along with the mutation, or null for\n * idempotent mutations.\n */\nexport function extractMutationBaseValue(\n  mutation: Mutation,\n  maybeDoc: MaybeDocument | null\n): ObjectValue | null {\n  if (mutation instanceof TransformMutation) {\n    return extractTransformMutationBaseValue(mutation, maybeDoc);\n  }\n  return null;\n}\n\nexport function mutationEquals(left: Mutation, right: Mutation): boolean {\n  if (left.type !== right.type) {\n    return false;\n  }\n\n  if (!left.key.isEqual(right.key)) {\n    return false;\n  }\n\n  if (!left.precondition.isEqual(right.precondition)) {\n    return false;\n  }\n\n  if (left.type === MutationType.Set) {\n    return (left as SetMutation).value.isEqual((right as SetMutation).value);\n  }\n\n  if (left.type === MutationType.Patch) {\n    return (\n      (left as PatchMutation).data.isEqual((right as PatchMutation).data) &&\n      (left as PatchMutation).fieldMask.isEqual(\n        (right as PatchMutation).fieldMask\n      )\n    );\n  }\n\n  if (left.type === MutationType.Transform) {\n    return arrayEquals(\n      (left as TransformMutation).fieldTransforms,\n      (left as TransformMutation).fieldTransforms,\n      (l, r) => fieldTransformEquals(l, r)\n    );\n  }\n\n  return true;\n}\n\nfunction verifyMutationKeyMatches(\n  mutation: Mutation,\n  maybeDoc: MaybeDocument | null\n): void {\n  if (maybeDoc != null) {\n    debugAssert(\n      maybeDoc.key.isEqual(mutation.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 */\nfunction 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 * 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\nfunction applySetMutationToRemoteDocument(\n  mutation: SetMutation,\n  maybeDoc: MaybeDocument | null,\n  mutationResult: MutationResult\n): Document {\n  debugAssert(\n    mutationResult.transformResults == null,\n    'Transform results received by SetMutation.'\n  );\n\n  // Unlike applySetMutationToLocalView, if we're applying a mutation to a\n  // remote document the server has accepted the mutation so the precondition\n  // must have held.\n  return new Document(mutation.key, mutationResult.version, mutation.value, {\n    hasCommittedMutations: true\n  });\n}\n\nfunction applySetMutationToLocalView(\n  mutation: SetMutation,\n  maybeDoc: MaybeDocument | null\n): MaybeDocument | null {\n  if (!preconditionIsValidForDocument(mutation.precondition, maybeDoc)) {\n    return maybeDoc;\n  }\n\n  const version = getPostMutationVersion(maybeDoc);\n  return new Document(mutation.key, version, mutation.value, {\n    hasLocalMutations: true\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\nfunction applyPatchMutationToRemoteDocument(\n  mutation: PatchMutation,\n  maybeDoc: MaybeDocument | null,\n  mutationResult: MutationResult\n): MaybeDocument {\n  debugAssert(\n    mutationResult.transformResults == null,\n    'Transform results received by PatchMutation.'\n  );\n\n  if (!preconditionIsValidForDocument(mutation.precondition, 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(mutation.key, mutationResult.version);\n  }\n\n  const newData = patchDocument(mutation, maybeDoc);\n  return new Document(mutation.key, mutationResult.version, newData, {\n    hasCommittedMutations: true\n  });\n}\n\nfunction applyPatchMutationToLocalView(\n  mutation: PatchMutation,\n  maybeDoc: MaybeDocument | null\n): MaybeDocument | null {\n  if (!preconditionIsValidForDocument(mutation.precondition, maybeDoc)) {\n    return maybeDoc;\n  }\n\n  const version = getPostMutationVersion(maybeDoc);\n  const newData = patchDocument(mutation, maybeDoc);\n  return new Document(mutation.key, version, newData, {\n    hasLocalMutations: true\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 */\nfunction patchDocument(\n  mutation: PatchMutation,\n  maybeDoc: MaybeDocument | null\n): ObjectValue {\n  let data: ObjectValue;\n  if (maybeDoc instanceof Document) {\n    data = maybeDoc.data();\n  } else {\n    data = ObjectValue.empty();\n  }\n  return patchObject(mutation, data);\n}\n\nfunction patchObject(mutation: PatchMutation, data: ObjectValue): ObjectValue {\n  const builder = new ObjectValueBuilder(data);\n  mutation.fieldMask.fields.forEach(fieldPath => {\n    if (!fieldPath.isEmpty()) {\n      const newValue = mutation.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 * 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\nfunction applyTransformMutationToRemoteDocument(\n  mutation: TransformMutation,\n  maybeDoc: MaybeDocument | null,\n  mutationResult: MutationResult\n): Document | UnknownDocument {\n  hardAssert(\n    mutationResult.transformResults != null,\n    'Transform results missing for TransformMutation.'\n  );\n\n  if (!preconditionIsValidForDocument(mutation.precondition, 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(mutation.key, mutationResult.version);\n  }\n\n  const doc = requireDocument(mutation, maybeDoc);\n  const transformResults = serverTransformResults(\n    mutation.fieldTransforms,\n    maybeDoc,\n    mutationResult.transformResults!\n  );\n\n  const version = mutationResult.version;\n  const newData = transformObject(mutation, doc.data(), transformResults);\n  return new Document(mutation.key, version, newData, {\n    hasCommittedMutations: true\n  });\n}\n\nfunction applyTransformMutationToLocalView(\n  mutation: TransformMutation,\n  maybeDoc: MaybeDocument | null,\n  localWriteTime: Timestamp,\n  baseDoc: MaybeDocument | null\n): MaybeDocument | null {\n  if (!preconditionIsValidForDocument(mutation.precondition, maybeDoc)) {\n    return maybeDoc;\n  }\n\n  const doc = requireDocument(mutation, maybeDoc);\n  const transformResults = localTransformResults(\n    mutation.fieldTransforms,\n    localWriteTime,\n    maybeDoc,\n    baseDoc\n  );\n  const newData = transformObject(mutation, doc.data(), transformResults);\n  return new Document(mutation.key, doc.version, newData, {\n    hasLocalMutations: true\n  });\n}\n\nfunction extractTransformMutationBaseValue(\n  mutation: TransformMutation,\n  maybeDoc: MaybeDocument | null | Document\n): ObjectValue | null {\n  let baseObject: ObjectValueBuilder | null = null;\n  for (const fieldTransform of mutation.fieldTransforms) {\n    const existingValue =\n      maybeDoc instanceof Document\n        ? maybeDoc.field(fieldTransform.field)\n        : undefined;\n    const coercedValue = computeTransformOperationBaseValue(\n      fieldTransform.transform,\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/**\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 */\nfunction requireDocument(\n  mutation: Mutation,\n  maybeDoc: MaybeDocument | null\n): Document {\n  debugAssert(\n    maybeDoc instanceof Document,\n    'Unknown MaybeDocument type ' + maybeDoc\n  );\n  debugAssert(\n    maybeDoc.key.isEqual(mutation.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 fieldTransforms The field transforms to apply the result to.\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 */\nfunction serverTransformResults(\n  fieldTransforms: FieldTransform[],\n  baseDoc: MaybeDocument | null,\n  serverTransformResults: Array<api.Value | null>\n): api.Value[] {\n  const transformResults: api.Value[] = [];\n  hardAssert(\n    fieldTransforms.length === serverTransformResults.length,\n    `server transform result count (${serverTransformResults.length}) ` +\n      `should match field transform count (${fieldTransforms.length})`\n  );\n\n  for (let i = 0; i < serverTransformResults.length; i++) {\n    const fieldTransform = fieldTransforms[i];\n    const transform = fieldTransform.transform;\n    let previousValue: api.Value | null = null;\n    if (baseDoc instanceof Document) {\n      previousValue = baseDoc.field(fieldTransform.field);\n    }\n    transformResults.push(\n      applyTransformOperationToRemoteDocument(\n        transform,\n        previousValue,\n        serverTransformResults[i]\n      )\n    );\n  }\n  return transformResults;\n}\n\n/**\n * Creates a list of \"transform results\" (a transform result is a field value\n * representing the result of applying a transform) for use when applying a\n * TransformMutation locally.\n *\n * @param fieldTransforms The field transforms to apply the result to.\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 */\nfunction localTransformResults(\n  fieldTransforms: FieldTransform[],\n  localWriteTime: Timestamp,\n  maybeDoc: MaybeDocument | null,\n  baseDoc: MaybeDocument | null\n): api.Value[] {\n  const transformResults: api.Value[] = [];\n  for (const fieldTransform of 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      applyTransformOperationToLocalView(\n        transform,\n        previousValue,\n        localWriteTime\n      )\n    );\n  }\n  return transformResults;\n}\n\nfunction transformObject(\n  mutation: TransformMutation,\n  data: ObjectValue,\n  transformResults: api.Value[]\n): ObjectValue {\n  debugAssert(\n    transformResults.length === mutation.fieldTransforms.length,\n    'TransformResults length mismatch.'\n  );\n\n  const builder = new ObjectValueBuilder(data);\n  for (let i = 0; i < mutation.fieldTransforms.length; i++) {\n    const fieldTransform = mutation.fieldTransforms[i];\n    builder.set(fieldTransform.field, transformResults[i]);\n  }\n  return builder.build();\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\nfunction applyDeleteMutationToRemoteDocument(\n  mutation: DeleteMutation,\n  maybeDoc: MaybeDocument | null,\n  mutationResult: MutationResult\n): NoDocument {\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(mutation.key, mutationResult.version, {\n    hasCommittedMutations: true\n  });\n}\n\nfunction applyDeleteMutationToLocalView(\n  mutation: DeleteMutation,\n  maybeDoc: MaybeDocument | null\n): MaybeDocument | null {\n  if (!preconditionIsValidForDocument(mutation.precondition, maybeDoc)) {\n    return maybeDoc;\n  }\n\n  if (maybeDoc) {\n    debugAssert(\n      maybeDoc.key.isEqual(mutation.key),\n      'Can only apply mutation to document with same key'\n    );\n  }\n  return new NoDocument(mutation.key, SnapshotVersion.min());\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","/**\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(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.emptyPath(),\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.emptyPath() 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 * 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 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 { debugAssert, hardAssert } from '../util/assert';\nimport { arrayEquals } from '../util/misc';\nimport {\n  documentKeySet,\n  DocumentKeySet,\n  DocumentVersionMap,\n  documentVersionMap,\n  MaybeDocumentMap\n} from './collections';\nimport { MaybeDocument } from './document';\nimport { DocumentKey } from './document_key';\nimport {\n  applyMutationToLocalView,\n  applyMutationToRemoteDocument,\n  Mutation,\n  mutationEquals,\n  MutationResult\n} 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 = applyMutationToRemoteDocument(\n          mutation,\n          maybeDoc,\n          mutationResult\n        );\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 = applyMutationToLocalView(\n          mutation,\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 = applyMutationToLocalView(\n          mutation,\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) =>\n        mutationEquals(l, r)\n      ) &&\n      arrayEquals(this.baseMutations, other.baseMutations, (l, r) =>\n        mutationEquals(l, 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    /**\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  ): 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(batch, commitVersion, results, versionMap);\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(\n    key => key.toString(),\n    (l, r) => l.isEqual(r)\n  );\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, queryMatches } 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 { applyMutationToLocalView, 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 = applyMutationToLocalView(\n                mutation,\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 (!queryMatches(query, 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 = void> {\n  promise: Promise<R>;\n  // Assigned synchronously in constructor by Promise constructor callback.\n  resolve!: Resolver<R>;\n  reject!: Rejecter;\n\n  constructor() {\n    this.promise = new Promise((resolve: Resolver<R>, reject: Rejecter) => {\n      this.resolve = resolve;\n      this.reject = reject;\n    });\n  }\n}\n\n/**\n * Takes an array of values and a function from a value to a Promise. The function is run on each\n * value sequentially, waiting for the previous promise to resolve before starting the next one.\n * The returned promise resolves once the function has been run on all values.\n */\nexport function sequence<T>(\n  values: T[],\n  fn: (value: T) => Promise<void>\n): Promise<void> {\n  let p = Promise.resolve();\n  for (const value of values) {\n    p = p.then(() => fn(value));\n  }\n  return p;\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { 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.emptyPath();\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 { 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 {\n  fromDocument,\n  fromDocumentsTarget,\n  fromMutation,\n  fromQueryTarget,\n  JsonProtoSerializer,\n  toDocument,\n  toDocumentsTarget,\n  toMutation,\n  toQueryTarget\n} from '../remote/serializer';\nimport { debugAssert, fail } from '../util/assert';\nimport { ByteString } from '../util/byte_string';\nimport { canonifyTarget, isDocumentTarget, 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(readonly remoteSerializer: JsonProtoSerializer) {}\n}\n\n/** Decodes a remote document from storage locally to a Document. */\nexport function fromDbRemoteDocument(\n  localSerializer: LocalSerializer,\n  remoteDoc: DbRemoteDocument\n): MaybeDocument {\n  if (remoteDoc.document) {\n    return fromDocument(\n      localSerializer.remoteSerializer,\n      remoteDoc.document,\n      !!remoteDoc.hasCommittedMutations\n    );\n  } else if (remoteDoc.noDocument) {\n    const key = DocumentKey.fromSegments(remoteDoc.noDocument.path);\n    const version = 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 = 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. */\nexport function toDbRemoteDocument(\n  localSerializer: LocalSerializer,\n  maybeDoc: MaybeDocument,\n  readTime: SnapshotVersion\n): DbRemoteDocument {\n  const dbReadTime = toDbTimestampKey(readTime);\n  const parentPath = maybeDoc.key.path.popLast().toArray();\n  if (maybeDoc instanceof Document) {\n    const doc = toDocument(localSerializer.remoteSerializer, 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 = 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 = 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\nexport function toDbTimestampKey(\n  snapshotVersion: SnapshotVersion\n): DbTimestampKey {\n  const timestamp = snapshotVersion.toTimestamp();\n  return [timestamp.seconds, timestamp.nanoseconds];\n}\n\nexport function fromDbTimestampKey(\n  dbTimestampKey: DbTimestampKey\n): SnapshotVersion {\n  const timestamp = new Timestamp(dbTimestampKey[0], dbTimestampKey[1]);\n  return SnapshotVersion.fromTimestamp(timestamp);\n}\n\nfunction toDbTimestamp(snapshotVersion: SnapshotVersion): DbTimestamp {\n  const timestamp = snapshotVersion.toTimestamp();\n  return new DbTimestamp(timestamp.seconds, timestamp.nanoseconds);\n}\n\nfunction fromDbTimestamp(dbTimestamp: DbTimestamp): SnapshotVersion {\n  const timestamp = new Timestamp(dbTimestamp.seconds, dbTimestamp.nanoseconds);\n  return SnapshotVersion.fromTimestamp(timestamp);\n}\n\n/** Encodes a batch of mutations into a DbMutationBatch for local storage. */\nexport function toDbMutationBatch(\n  localSerializer: LocalSerializer,\n  userId: string,\n  batch: MutationBatch\n): DbMutationBatch {\n  const serializedBaseMutations = batch.baseMutations.map(m =>\n    toMutation(localSerializer.remoteSerializer, m)\n  );\n  const serializedMutations = batch.mutations.map(m =>\n    toMutation(localSerializer.remoteSerializer, 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 */\nexport function fromDbMutationBatch(\n  localSerializer: LocalSerializer,\n  dbBatch: DbMutationBatch\n): MutationBatch {\n  const baseMutations = (dbBatch.baseMutations || []).map(m =>\n    fromMutation(localSerializer.remoteSerializer, m)\n  );\n  const mutations = dbBatch.mutations.map(m =>\n    fromMutation(localSerializer.remoteSerializer, 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 */\nexport function fromDbTarget(dbTarget: DbTarget): TargetData {\n  const version = fromDbTimestamp(dbTarget.readTime);\n  const lastLimboFreeSnapshotVersion =\n    dbTarget.lastLimboFreeSnapshotVersion !== undefined\n      ? fromDbTimestamp(dbTarget.lastLimboFreeSnapshotVersion)\n      : SnapshotVersion.min();\n\n  let target: Target;\n  if (isDocumentQuery(dbTarget.query)) {\n    target = fromDocumentsTarget(dbTarget.query);\n  } else {\n    target = 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. */\nexport function toDbTarget(\n  localSerializer: LocalSerializer,\n  targetData: TargetData\n): 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 = toDbTimestamp(targetData.snapshotVersion);\n  const dbLastLimboFreeTimestamp = toDbTimestamp(\n    targetData.lastLimboFreeSnapshotVersion\n  );\n  let queryProto: DbQuery;\n  if (isDocumentTarget(targetData.target)) {\n    queryProto = toDocumentsTarget(\n      localSerializer.remoteSerializer,\n      targetData.target\n    );\n  } else {\n    queryProto = toQueryTarget(\n      localSerializer.remoteSerializer,\n      targetData.target\n    );\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    canonifyTarget(targetData.target),\n    dbTimestamp,\n    resumeToken,\n    targetData.sequenceNumber,\n    dbLastLimboFreeTimestamp,\n    queryProto\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 { Query, queryMatches } 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 {\n  fromDbRemoteDocument,\n  fromDbTimestampKey,\n  LocalSerializer,\n  toDbRemoteDocument,\n  toDbTimestampKey\n} 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 = 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 = fromDbRemoteDocument(this.serializer, dbRemoteDoc);\n        if (!query.path.isPrefixOf(maybeDoc.key.path)) {\n          control.done();\n        } else if (\n          maybeDoc instanceof Document &&\n          queryMatches(query, maybeDoc)\n        ) {\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 = 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 = fromDbRemoteDocument(this.serializer, dbRemoteDoc);\n          changedDocs = changedDocs.insert(doc.key, doc);\n          lastReadTime = dbRemoteDoc.readTime!;\n        }\n      )\n      .next(() => {\n        return {\n          changedDocs,\n          readTime: 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 = 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 = fromDbRemoteDocument(this.serializer, 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<DocumentKey, number> = new ObjectMap(\n      key => key.toString(),\n      (l, r) => l.isEqual(r)\n    );\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 = toDbRemoteDocument(\n            this.documentCache.serializer,\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 = toDbRemoteDocument(\n              this.documentCache.serializer,\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 { fromDbTarget, LocalSerializer, toDbTarget } 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 { canonifyTarget, Target, targetEquals } 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 = 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 = 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      toDbTarget(this.serializer, 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 = canonifyTarget(target);\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 = fromDbTarget(value);\n          // After finding a potential match, check that the target is\n          // actually equal to the requested target.\n          if (targetEquals(target, 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 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 { User } from '../auth/user';\nimport { DatabaseId } from '../core/database_info';\nimport { ListenSequence, SequenceNumberSyncer } from '../core/listen_sequence';\nimport { ListenSequenceNumber, TargetId } from '../core/types';\nimport { DocumentKey } from '../model/document_key';\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';\nimport { DocumentLike, WindowLike } from '../util/types';\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. ' +\n  'If you are using `experimentalForceOwningTab:true`, make sure that only ' +\n  'one tab has persistence enabled at any given time.';\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\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 */\nexport const MAIN_DATABASE = 'main';\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  // 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 | null;\n  readonly referenceDelegate: IndexedDbLruDelegate;\n\n  constructor(\n    /**\n     * Whether to synchronize the in-memory state of multiple tabs and share\n     * access to local persistence.\n     */\n    private readonly allowTabSynchronization: boolean,\n\n    private readonly persistenceKey: string,\n    private readonly clientId: ClientId,\n    lruParams: LruParams,\n    private readonly queue: AsyncQueue,\n    private readonly window: WindowLike | null,\n    private readonly document: DocumentLike | null,\n    serializer: JsonProtoSerializer,\n    private readonly sequenceNumberSyncer: SequenceNumberSyncer,\n\n    /**\n     * If set to true, forcefully obtains database access. Existing tabs will\n     * no longer be able to access IndexedDB.\n     */\n    private readonly forceOwningTab: boolean\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 + MAIN_DATABASE;\n    this.serializer = new LocalSerializer(serializer);\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 (this.window && this.window.localStorage) {\n      this.webStorage = this.window.localStorage;\n    } else {\n      this.webStorage = null;\n      if (forceOwningTab === false) {\n        logError(\n          LOG_TAG,\n          'LocalStorage is unavailable. As a result, persistence may not work ' +\n            'reliably. In particular enablePersistence() could fail immediately ' +\n            'after refreshing the page.'\n        );\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.enqueueRetryable(() =>\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 (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        }\n\n        if (!this.allowTabSynchronization) {\n          throw e;\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.enqueueRetryable(() =>\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      if (this.webStorage) {\n        for (const inactiveClient of inactiveClients) {\n          this.webStorage.removeItem(\n            this.zombiedClientLocalStorageKey(inactiveClient.clientId)\n          );\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    if (this.forceOwningTab) {\n      return PersistencePromise.resolve<boolean>(true);\n    }\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        // - the `forceOwningTab` setting was passed in.\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  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.enqueueRetryable(() =>\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.forceOwningTab &&\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  /** 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(\n          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    if (!this.webStorage) {\n      return;\n    }\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    if (!this.webStorage) {\n      return;\n    }\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/**\n * Generates a string used as a prefix when storing data in IndexedDB and\n * LocalStorage.\n */\nexport function indexedDbStoragePrefix(\n  databaseId: DatabaseId,\n  persistenceKey: string\n): 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 = databaseId.projectId;\n  if (!databaseId.isDefaultDatabase) {\n    database += '.' + databaseId.database;\n  }\n\n  return 'firestore/' + persistenceKey + '/' + database + '/';\n}\n\nexport async function indexedDbClearPersistence(\n  persistenceKey: string\n): Promise<void> {\n  if (!SimpleDb.isAvailable()) {\n    return Promise.resolve();\n  }\n  const dbName = persistenceKey + MAIN_DATABASE;\n  await SimpleDb.delete(dbName);\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 { 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 {\n  fromDbMutationBatch,\n  LocalSerializer,\n  toDbMutationBatch\n} 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  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 = toDbMutationBatch(this.serializer, 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 fromDbMutationBatch(this.serializer, 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 = fromDbMutationBatch(this.serializer, 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 => fromDbMutationBatch(this.serializer, 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(fromDbMutationBatch(this.serializer, 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(fromDbMutationBatch(this.serializer, 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 { debugAssert, hardAssert } from '../util/assert';\n\nimport { SnapshotVersion } from '../core/snapshot_version';\nimport { BATCHID_UNKNOWN } from '../model/mutation_batch';\nimport {\n  decodeResourcePath,\n  EncodedResourcePath,\n  encodeResourcePath\n} from './encoded_resource_path';\nimport { removeMutationBatch } from './indexeddb_mutation_queue';\nimport { dbDocumentSize } from './indexeddb_remote_document_cache';\nimport {\n  fromDbMutationBatch,\n  fromDbTarget,\n  LocalSerializer,\n  toDbTarget\n} 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 = fromDbMutationBatch(this.serializer, 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 = fromDbTarget(originalDbTarget);\n      const updatedDbTarget = toDbTarget(this.serializer, 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     * NOTE: this is deprecated and no longer used by the code.\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 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 = 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 indexedDB === 'undefined') {\n      return false;\n    }\n\n    if (SimpleDb.isMockPersistence()) {\n      return true;\n    }\n\n    // We extensively use indexed array values and compound keys,\n    // which IE and Edge do not support. However, they still have indexedDB\n    // defined on the window, so we need to check for them here and make sure\n    // to return that persistence is not enabled for those browsers.\n    // For tracking support of this feature, see here:\n    // https://developer.microsoft.com/en-us/microsoft-edge/platform/status/indexeddbarraysandmultientrysupport/\n\n    // Check the UA string to find out the browser.\n    const ua = getUA();\n\n    // IE 10\n    // ua = 'Mozilla/5.0 (compatible; MSIE 10.0; Windows NT 6.2; Trident/6.0)';\n\n    // IE 11\n    // ua = 'Mozilla/5.0 (Windows NT 6.3; Trident/7.0; rv:11.0) like Gecko';\n\n    // Edge\n    // ua = 'Mozilla/5.0 (Windows NT 10.0; WOW64) AppleWebKit/537.36 (KHTML,\n    // like Gecko) Chrome/39.0.2171.71 Safari/537.36 Edge/12.0';\n\n    // iOS Safari: Disable for users running iOS version < 10.\n    const iOSVersion = SimpleDb.getIOSVersion(ua);\n    const isUnsupportedIOS = 0 < iOSVersion && iOSVersion < 10;\n\n    // Android browser: Disable for userse running version < 4.5.\n    const androidVersion = SimpleDb.getAndroidVersion(ua);\n    const isUnsupportedAndroid = 0 < androidVersion && androidVersion < 4.5;\n\n    if (\n      ua.indexOf('MSIE ') > 0 ||\n      ua.indexOf('Trident/') > 0 ||\n      ua.indexOf('Edge/') > 0 ||\n      isUnsupportedIOS ||\n      isUnsupportedAndroid\n    ) {\n      return false;\n    } else {\n      return true;\n    }\n  }\n\n  /**\n   * Returns true if the backing IndexedDB store is the Node IndexedDBShim\n   * (see https://github.com/axemclion/IndexedDBShim).\n   */\n  static isMockPersistence(): boolean {\n    return (\n      typeof process !== 'undefined' &&\n      process.env?.USE_MOCK_PERSISTENCE === 'YES'\n    );\n  }\n\n  /** Helper to get a typed SimpleDbStore from a transaction. */\n  static getStore<KeyType extends IDBValidKey, ValueType extends unknown>(\n    txn: SimpleDbTransaction,\n    store: string\n  ): SimpleDbStore<KeyType, ValueType> {\n    return txn.store<KeyType, ValueType>(store);\n  }\n\n  // visible for testing\n  /** Parse User Agent to determine iOS version. Returns -1 if not found. */\n  static getIOSVersion(ua: string): number {\n    const iOSVersionRegex = ua.match(/i(?:phone|pad|pod) os ([\\d_]+)/i);\n    const version = iOSVersionRegex\n      ? iOSVersionRegex[1].split('_').slice(0, 2).join('.')\n      : '-1';\n    return Number(version);\n  }\n\n  // visible for testing\n  /** Parse User Agent to determine Android version. Returns -1 if not found. */\n  static getAndroidVersion(ua: string): number {\n    const androidVersionRegex = ua.match(/Android ([\\d.]+)/i);\n    const version = androidVersionRegex\n      ? androidVersionRegex[1].split('.').slice(0, 2).join('.')\n      : '-1';\n    return Number(version);\n  }\n\n  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 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/** The Platform's 'window' implementation or null if not available. */\nexport function getWindow(): Window | null {\n  // `window` is not always available, e.g. in ReactNative and WebWorkers.\n  // eslint-disable-next-line no-restricted-globals\n  return typeof window !== 'undefined' ? window : null;\n}\n\n/** The Platform's 'document' implementation or null if not available. */\nexport function getDocument(): Document | null {\n  // `document` is not always available, e.g. in ReactNative and WebWorkers.\n  // eslint-disable-next-line no-restricted-globals\n  return typeof document !== 'undefined' ? document : null;\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { debugAssert, fail } from './assert';\nimport { Code, FirestoreError } from './error';\nimport { logDebug, logError } from './log';\nimport { Deferred } from './promise';\nimport { ExponentialBackoff } from '../remote/backoff';\nimport { isIndexedDbTransactionError } from '../local/simple_db';\nimport { getWindow } from '../platform/dom';\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  // A list of retryable operations. Retryable operations are run in order and\n  // retried with backoff.\n  private retryableOps: Array<() => Promise<void>> = [];\n\n  // Is this AsyncQueue being shut down? Once it is set to true, it will not\n  // be changed again.\n  private _isShuttingDown: boolean = false;\n\n  // Operations scheduled to be queued in the future. Operations are\n  // automatically removed after they are run or canceled.\n  private delayedOperations: Array<DelayedOperation<unknown>> = [];\n\n  // visible for testing\n  failure: 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 = getWindow();\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 = getWindow();\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.retryableOps.push(op);\n    this.enqueueAndForget(() => this.retryNextOp());\n  }\n\n  /**\n   * Runs the next operation from the retryable queue. If the operation fails,\n   * reschedules with backoff.\n   */\n  private async retryNextOp(): Promise<void> {\n    if (this.retryableOps.length === 0) {\n      return;\n    }\n\n    try {\n      await this.retryableOps[0]();\n      this.retryableOps.shift();\n      this.backoff.reset();\n    } catch (e) {\n      if (isIndexedDbTransactionError(e)) {\n        logDebug(LOG_TAG, 'Operation failed with retryable error: ' + e);\n      } else {\n        throw e; // Failure will be handled by AsyncQueue\n      }\n    }\n\n    if (this.retryableOps.length > 0) {\n      // If there are additional operations, we re-schedule `retryNextOp()`.\n      // This is necessary to run retryable operations that failed during\n      // their initial attempt since we don't know whether they are already\n      // enqueued. If, for example, `op1`, `op2`, `op3` are enqueued and `op1`\n      // needs to  be re-run, we will run `op1`, `op1`, `op2` using the\n      // already enqueued calls to `retryNextOp()`. `op3()` will then run in the\n      // call scheduled here.\n      // Since `backoffAndRun()` cancels an existing backoff and schedules a\n      // new backoff on every call, there is only ever a single additional\n      // operation in the queue.\n      this.backoff.backoffAndRun(() => this.retryNextOp());\n    }\n  }\n\n  private enqueueInternal<T extends unknown>(op: () => Promise<T>): Promise<T> {\n    const newTail = this.tail.then(() => {\n      this.operationInProgress = true;\n      return op()\n        .catch((error: FirestoreError) => {\n          this.failure = error;\n          this.operationInProgress = false;\n          const message = getMessageOrStack(error);\n          logError('INTERNAL UNHANDLED ERROR: ', message);\n\n          // Re-throw the error so that this.tail becomes a rejected Promise and\n          // all further attempts to chain (via .then) will just short-circuit\n          // and return the rejected Promise.\n          throw error;\n        })\n        .then(result => {\n          this.operationInProgress = false;\n          return result;\n        });\n    });\n    this.tail = newTail;\n    return newTail;\n  }\n\n  /**\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('AsyncQueue is already failed: ' + getMessageOrStack(this.failure));\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/**\n * Chrome includes Error.message in Error.stack. Other browsers do not.\n * This returns expected output of message + stack when available.\n * @param error Error or FirestoreError\n */\nfunction getMessageOrStack(error: Error): string {\n  let message = error.message || '';\n  if (error.stack) {\n    if (error.stack.includes(error.message)) {\n      message = error.stack;\n    } else {\n      message = error.message + '\\n' + error.stack;\n    }\n  }\n  return message;\n}\n","/**\n * @license\n * Copyright 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 { canonifyTarget, Target, targetEquals } 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 {\n  Mutation,\n  PatchMutation,\n  Precondition,\n  extractMutationBaseValue\n} from '../model/mutation';\nimport {\n  BATCHID_UNKNOWN,\n  MutationBatch,\n  MutationBatchResult\n} from '../model/mutation_batch';\nimport { RemoteEvent, TargetChange } from '../remote/remote_event';\nimport { debugAssert, 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 { 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 { 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 interface LocalStore {\n  /** Starts the LocalStore. */\n  start(): Promise<void>;\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  handleUserChange(user: User): Promise<UserChangeResult>;\n\n  /* Accept locally generated Mutations and commit them to storage. */\n  localWrite(mutations: Mutation[]): Promise<LocalWriteResult>;\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(batchResult: MutationBatchResult): Promise<MaybeDocumentMap>;\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\n  /**\n   * Returns the largest (latest) batch id in mutation queue that is pending\n   * server response.\n   *\n   * Returns `BATCHID_UNKNOWN` if the queue is empty.\n   */\n  getHighestUnacknowledgedBatchId(): Promise<BatchId>;\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\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\n  /**\n   * Notify local store of the changed views to locally pin documents.\n   */\n  notifyLocalViewChanges(viewChanges: LocalViewChanges[]): Promise<void>;\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\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\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\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\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\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(query: Query, usePreviousResults: boolean): Promise<QueryResult>;\n\n  collectGarbage(garbageCollector: LruGarbageCollector): Promise<LruResults>;\n}\n\n/**\n * Implements `LocalStore` interface.\n *\n * Note: some field defined in this class might have public access level, but\n * the class is not exported so they are only accessible from this module.\n * This is useful to implement optional features (like bundles) in free\n * functions, such that they are tree-shakeable.\n */\nclass LocalStoreImpl implements 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>(\n    t => canonifyTarget(t),\n    targetEquals\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  start(): Promise<void> {\n    return Promise.resolve();\n  }\n\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  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 = extractMutationBaseValue(\n              mutation,\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  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.applyWriteToRemoteDocuments(\n          txn,\n          batchResult,\n          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  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  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  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  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              LocalStoreImpl.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  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  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  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  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 Multi-Tab is enabled, the existing target data may be newer than\n        // the in-memory data\n        const cachedTargetData = this.targetDataByTarget.get(\n          targetData.targetId\n        );\n        if (\n          cachedTargetData === null ||\n          targetData.snapshotVersion.compareTo(\n            cachedTargetData.snapshotVersion\n          ) > 0\n        ) {\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  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  async 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\n    try {\n      if (!keepPersistedTargetData) {\n        await this.persistence.runTransaction('Release target', mode, txn => {\n          return this.persistence.referenceDelegate.removeTarget(\n            txn,\n            targetData!\n          );\n        });\n      }\n    } catch (e) {\n      if (isIndexedDbTransactionError(e)) {\n        // All `releaseTarget` does is record the final metadata state for the\n        // target, but we've been recording this periodically during target\n        // activity. If we lose this write this could cause a very slight\n        // difference in the order of target deletion during GC, but we\n        // don't define exact LRU semantics so this is acceptable.\n        logDebug(\n          LOG_TAG,\n          `Failed to update sequence numbers for target ${targetId}: ${e}`\n        );\n      } else {\n        throw e;\n      }\n    }\n\n    this.targetDataByTarget = this.targetDataByTarget.remove(targetId);\n    this.targetIdByTarget.delete(targetData!.target);\n  }\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\nexport function newLocalStore(\n  /** Manages our in-memory or durable persistence. */\n  persistence: Persistence,\n  queryEngine: QueryEngine,\n  initialUser: User\n): LocalStore {\n  return new LocalStoreImpl(persistence, queryEngine, initialUser);\n}\n\n/**\n * An interface on top of LocalStore that provides additional functionality\n * for MultiTabSyncEngine.\n */\nexport interface MultiTabLocalStore extends LocalStore {\n  /** Returns the local view of the documents affected by a mutation batch. */\n  lookupMutationDocuments(batchId: BatchId): Promise<MaybeDocumentMap | null>;\n\n  removeCachedMutationBatchMetadata(batchId: BatchId): void;\n\n  setNetworkEnabled(networkEnabled: boolean): void;\n\n  getActiveClients(): Promise<ClientId[]>;\n\n  getTarget(targetId: TargetId): Promise<Target | null>;\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\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  synchronizeLastDocumentChangeReadTime(): Promise<void>;\n}\n\n/**\n * An implementation of LocalStore that provides additional functionality\n * for MultiTabSyncEngine.\n *\n * Note: some field defined in this class might have public access level, but\n * the class is not exported so they are only accessible from this module.\n * This is useful to implement optional features (like bundles) in free\n * functions, such that they are tree-shakeable.\n */\n// PORTING NOTE: Web only.\nclass MultiTabLocalStoreImpl extends LocalStoreImpl\n  implements MultiTabLocalStore {\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  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  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  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\nexport function newMultiTabLocalStore(\n  /** Manages our in-memory or durable persistence. */\n  persistence: IndexedDbPersistence,\n  queryEngine: QueryEngine,\n  initialUser: User\n): MultiTabLocalStore {\n  return new MultiTabLocalStoreImpl(persistence, queryEngine, initialUser);\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';\nimport { ResourcePath } from '../model/path';\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 = new DocumentKey(new ResourcePath([]));\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 = new DocumentKey(new ResourcePath([]));\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';\nimport { DocumentKey } from '../model/document_key';\nimport { ResourcePath } from '../model/path';\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: ArrayLike<unknown>,\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/**\n * Validates that `path` refers to a document (indicated by the fact it contains\n * an even numbers of segments).\n */\nexport function validateDocumentPath(path: ResourcePath): void {\n  if (!DocumentKey.isDocumentKey(path)) {\n    throw new FirestoreError(\n      Code.INVALID_ARGUMENT,\n      `Invalid document path (${path}). Path points to a collection.`\n    );\n  }\n}\n\n/**\n * Validates that `path` refers to a collection (indicated by the fact it\n * contains an odd numbers of segments).\n */\nexport function validateCollectionPath(path: ResourcePath): void {\n  if (DocumentKey.isDocumentKey(path)) {\n    throw new FirestoreError(\n      Code.INVALID_ARGUMENT,\n      `Invalid collection path (${path}). Path points to a document.`\n    );\n  }\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 { isBase64Available } from '../platform/base64';\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 (!isBase64Available()) {\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 field class base class that is shared by the lite, full and legacy SDK,\n * which supports shared code that deals with FieldPaths.\n */\nexport abstract class BaseFieldPath {\n  /** Internal representation of a Firestore field path. */\n  readonly _internalPath: InternalFieldPath;\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/**\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 extends BaseFieldPath implements firestore.FieldPath {\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    super(fieldNames);\n  }\n\n  static documentId(): FieldPath {\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    return new FieldPath(InternalFieldPath.keyField().canonicalString());\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';\nimport { toNumber } from '../remote/serializer';\n\n/**\n * An opaque base class for FieldValue sentinel objects in our public API that\n * is shared between the full, lite and legacy SDK.\n */\nexport abstract class SerializableFieldValue {\n  /** The public API endpoint that returns this class. */\n  abstract readonly _methodName: string;\n\n  /** A pointer to the implementing class. */\n  readonly _delegate: SerializableFieldValue = this;\n\n  abstract _toFieldTransform(context: ParseContext): FieldTransform | null;\n\n  abstract isEqual(other: SerializableFieldValue): boolean;\n}\n\nexport class DeleteFieldValueImpl extends SerializableFieldValue {\n  constructor(readonly _methodName: string) {\n    super();\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        `${this._methodName}() at the top level should have already ` +\n          'been handled.'\n      );\n      throw context.createError(\n        `${this._methodName}() can only appear at the top level ` +\n          'of your update data'\n      );\n    } else {\n      // We shouldn't encounter delete sentinels for queries or non-merge set() calls.\n      throw context.createError(\n        `${this._methodName}() cannot be used with set() unless you pass ` +\n          '{merge:true}'\n      );\n    }\n    return null;\n  }\n\n  isEqual(other: FieldValue): boolean {\n    return other instanceof DeleteFieldValueImpl;\n  }\n}\n\n/**\n * Creates a child context for parsing SerializableFieldValues.\n *\n * This is different than calling `ParseContext.contextWith` because it keeps\n * the fieldTransforms and fieldMask separate.\n *\n * The created context has its `dataSource` set to `UserDataSource.Argument`.\n * Although these values are used with writes, any elements in these FieldValues\n * are not considered writes since they cannot contain any FieldValue sentinels,\n * etc.\n *\n * @param fieldValue The sentinel FieldValue for which to create a child\n *     context.\n * @param context The parent context.\n * @param arrayElement Whether or not the FieldValue has an array.\n */\nfunction createSentinelChildContext(\n  fieldValue: SerializableFieldValue,\n  context: ParseContext,\n  arrayElement: boolean\n): ParseContext {\n  return new ParseContext(\n    {\n      dataSource: UserDataSource.Argument,\n      targetDoc: context.settings.targetDoc,\n      methodName: fieldValue._methodName,\n      arrayElement\n    },\n    context.databaseId,\n    context.serializer,\n    context.ignoreUndefinedProperties\n  );\n}\n\nexport class ServerTimestampFieldValueImpl extends SerializableFieldValue {\n  constructor(readonly _methodName: string) {\n    super();\n  }\n\n  _toFieldTransform(context: ParseContext): FieldTransform {\n    return new FieldTransform(context.path!, new ServerTimestampTransform());\n  }\n\n  isEqual(other: FieldValue): boolean {\n    return other instanceof ServerTimestampFieldValueImpl;\n  }\n}\n\nexport class ArrayUnionFieldValueImpl extends SerializableFieldValue {\n  constructor(\n    readonly _methodName: string,\n    private readonly _elements: unknown[]\n  ) {\n    super();\n  }\n\n  _toFieldTransform(context: ParseContext): FieldTransform {\n    const parseContext = createSentinelChildContext(\n      this,\n      context,\n      /*array=*/ true\n    );\n    const parsedElements = this._elements.map(\n      element => parseData(element, parseContext)!\n    );\n    const arrayUnion = new ArrayUnionTransformOperation(parsedElements);\n    return new FieldTransform(context.path!, arrayUnion);\n  }\n\n  isEqual(other: FieldValue): boolean {\n    // TODO(mrschmidt): Implement isEquals\n    return this === other;\n  }\n}\n\nexport class ArrayRemoveFieldValueImpl extends SerializableFieldValue {\n  constructor(readonly _methodName: string, readonly _elements: unknown[]) {\n    super();\n  }\n\n  _toFieldTransform(context: ParseContext): FieldTransform {\n    const parseContext = createSentinelChildContext(\n      this,\n      context,\n      /*array=*/ true\n    );\n    const parsedElements = this._elements.map(\n      element => parseData(element, parseContext)!\n    );\n    const arrayUnion = new ArrayRemoveTransformOperation(parsedElements);\n    return new FieldTransform(context.path!, arrayUnion);\n  }\n\n  isEqual(other: FieldValue): boolean {\n    // TODO(mrschmidt): Implement isEquals\n    return this === other;\n  }\n}\n\nexport class NumericIncrementFieldValueImpl extends SerializableFieldValue {\n  constructor(readonly _methodName: string, private readonly _operand: number) {\n    super();\n  }\n\n  _toFieldTransform(context: ParseContext): FieldTransform {\n    const numericIncrement = new NumericIncrementTransformOperation(\n      context.serializer,\n      toNumber(context.serializer, this._operand)\n    );\n    return new FieldTransform(context.path!, numericIncrement);\n  }\n\n  isEqual(other: FieldValue): boolean {\n    // TODO(mrschmidt): Implement isEquals\n    return this === other;\n  }\n}\n\n/** The public FieldValue class of the lite API. */\nexport abstract class FieldValue extends SerializableFieldValue\n  implements firestore.FieldValue {\n  protected constructor() {\n    super();\n  }\n\n  static delete(): firestore.FieldValue {\n    validateNoArgs('FieldValue.delete', arguments);\n    return new FieldValueDelegate(\n      new DeleteFieldValueImpl('FieldValue.delete')\n    );\n  }\n\n  static serverTimestamp(): firestore.FieldValue {\n    validateNoArgs('FieldValue.serverTimestamp', arguments);\n    return new FieldValueDelegate(\n      new ServerTimestampFieldValueImpl('FieldValue.serverTimestamp')\n    );\n  }\n\n  static arrayUnion(...elements: unknown[]): firestore.FieldValue {\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'd need the Firestore instance to do this.\n    return new FieldValueDelegate(\n      new ArrayUnionFieldValueImpl('FieldValue.arrayUnion', elements)\n    );\n  }\n\n  static arrayRemove(...elements: unknown[]): firestore.FieldValue {\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'd need the Firestore instance to do this.\n    return new FieldValueDelegate(\n      new ArrayRemoveFieldValueImpl('FieldValue.arrayRemove', elements)\n    );\n  }\n\n  static increment(n: number): firestore.FieldValue {\n    validateArgType('FieldValue.increment', 'number', 1, n);\n    validateExactNumberOfArgs('FieldValue.increment', arguments, 1);\n    return new FieldValueDelegate(\n      new NumericIncrementFieldValueImpl('FieldValue.increment', n)\n    );\n  }\n}\n\n/**\n * A delegate class that allows the FieldValue implementations returned by\n * deleteField(), serverTimestamp(), arrayUnion(), arrayRemove() and\n * increment() to be an instance of the legacy FieldValue class declared above.\n *\n * We don't directly subclass `FieldValue` in the various field value\n * implementations as the base FieldValue class differs between the lite, full\n * and legacy SDK.\n */\nclass FieldValueDelegate extends FieldValue implements firestore.FieldValue {\n  readonly _methodName: string;\n\n  constructor(readonly _delegate: SerializableFieldValue) {\n    super();\n    this._methodName = _delegate._methodName;\n  }\n\n  _toFieldTransform(context: ParseContext): FieldTransform | null {\n    return this._delegate._toFieldTransform(context);\n  }\n\n  isEqual(other: firestore.FieldValue): boolean {\n    if (!(other instanceof FieldValueDelegate)) {\n      return false;\n    }\n    return this._delegate.isEqual(other._delegate);\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 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/** Return the Platform-specific serializer monitor. */\nimport { DatabaseId } from '../../core/database_info';\nimport { JsonProtoSerializer } from '../../remote/serializer';\n\nexport function newSerializer(databaseId: DatabaseId): JsonProtoSerializer {\n  return new JsonProtoSerializer(databaseId, /* useProto3Json= */ true);\n}\n","/**\n * @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 {\n  JsonProtoSerializer,\n  toBytes,\n  toNumber,\n  toResourceName,\n  toTimestamp\n} from '../remote/serializer';\nimport { Blob } from './blob';\nimport { BaseFieldPath, fromDotSeparatedString } from './field_path';\nimport { DeleteFieldValueImpl, SerializableFieldValue } from './field_value';\nimport { GeoPoint } from './geo_point';\nimport { newSerializer } from '../platform/serializer';\n\nconst RESERVED_FIELD_REGEX = /^__.*__$/;\n\n/**\n * An untyped Firestore Data Converter interface that is shared between the\n * lite, full and legacy SDK.\n */\nexport interface UntypedFirestoreDataConverter<T> {\n  toFirestore(modelObject: T): firestore.DocumentData;\n  toFirestore(\n    modelObject: Partial<T>,\n    options: firestore.SetOptions\n  ): firestore.DocumentData;\n  fromFirestore(snapshot: unknown, options?: unknown): T;\n}\n\n/**\n * A reference to a document in a Firebase project.\n *\n * This class serves as a common base class for the public DocumentReferences\n * exposed in the lite, full and legacy SDK.\n */\nexport class DocumentKeyReference<T> {\n  constructor(\n    readonly _databaseId: DatabaseId,\n    readonly _key: DocumentKey,\n    readonly _converter: UntypedFirestoreDataConverter<T> | null\n  ) {}\n}\n\n/** The result of parsing document data (e.g. for a setData call). */\nexport class ParsedSetData {\n  constructor(\n    readonly data: ObjectValue,\n    readonly fieldMask: FieldMask | null,\n    readonly fieldTransforms: FieldTransform[]\n  ) {}\n\n  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  /** The document the user is attempting to modify, if that applies. */\n  readonly targetDoc?: DocumentKey;\n  /**\n   * A path within the object being parsed. This could be an empty path (in\n   * which case the context represents the root of the data being parsed), or a\n   * nonempty path (indicating the context represents a nested location within\n   * the data).\n   */\n  readonly path?: 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   * Whether or not a converter was specified in this context. If true, error\n   * messages will reference the converter when invalid data is provided.\n   */\n  readonly hasConverter?: boolean;\n}\n\n/** A \"context\" object passed around while parsing user data. */\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    return createError(\n      reason,\n      this.settings.methodName,\n      this.settings.hasConverter || false,\n      this.path,\n      this.settings.targetDoc\n    );\n  }\n\n  /** Returns 'true' if 'fieldPath' was traversed when creating this context. */\n  contains(fieldPath: 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 = serializer || newSerializer(databaseId);\n  }\n\n  /** Creates a new top-level parse context. */\n  createContext(\n    dataSource: UserDataSource,\n    methodName: string,\n    targetDoc?: DocumentKey,\n    hasConverter = false\n  ): ParseContext {\n    return new ParseContext(\n      {\n        dataSource,\n        methodName,\n        targetDoc,\n        path: FieldPath.emptyPath(),\n        arrayElement: false,\n        hasConverter\n      },\n      this.databaseId,\n      this.serializer,\n      this.ignoreUndefinedProperties\n    );\n  }\n}\n\n/** Parse document data from a set() call. */\nexport function parseSetData(\n  userDataReader: UserDataReader,\n  methodName: string,\n  targetDoc: DocumentKey,\n  input: unknown,\n  hasConverter: boolean,\n  options: firestore.SetOptions = {}\n): ParsedSetData {\n  const context = userDataReader.createContext(\n    options.merge || options.mergeFields\n      ? UserDataSource.MergeSet\n      : UserDataSource.Set,\n    methodName,\n    targetDoc,\n    hasConverter\n  );\n  validatePlainObject('Data must be an object, but it was:', context, input);\n  const updateData = parseObject(input, context)!;\n\n  let fieldMask: FieldMask | null;\n  let fieldTransforms: FieldTransform[];\n\n  if (options.merge) {\n    fieldMask = new FieldMask(context.fieldMask);\n    fieldTransforms = context.fieldTransforms;\n  } else if (options.mergeFields) {\n    const validatedFieldPaths: FieldPath[] = [];\n\n    for (const stringOrFieldPath of options.mergeFields) {\n      let fieldPath: FieldPath;\n\n      if (stringOrFieldPath instanceof BaseFieldPath) {\n        fieldPath = stringOrFieldPath._internalPath;\n      } else if (typeof stringOrFieldPath === 'string') {\n        fieldPath = fieldPathFromDotSeparatedString(\n          methodName,\n          stringOrFieldPath,\n          targetDoc\n        );\n      } else {\n        throw fail('Expected stringOrFieldPath to be a string or a FieldPath');\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  } else {\n    fieldMask = null;\n    fieldTransforms = context.fieldTransforms;\n  }\n\n  return new ParsedSetData(\n    new ObjectValue(updateData),\n    fieldMask,\n    fieldTransforms\n  );\n}\n\n/** Parse update data from an update() call. */\nexport function parseUpdateData(\n  userDataReader: UserDataReader,\n  methodName: string,\n  targetDoc: DocumentKey,\n  input: unknown\n): ParsedUpdateData {\n  const context = userDataReader.createContext(\n    UserDataSource.Update,\n    methodName,\n    targetDoc\n  );\n  validatePlainObject('Data must be an object, but it was:', context, input);\n\n  const fieldMaskPaths: FieldPath[] = [];\n  const updateData = new ObjectValueBuilder();\n  forEach(input as Dict<unknown>, (key, value) => {\n    const path = fieldPathFromDotSeparatedString(methodName, key, targetDoc);\n\n    const childContext = context.childContextForFieldPath(path);\n    if (\n      value instanceof SerializableFieldValue &&\n      value._delegate instanceof DeleteFieldValueImpl\n    ) {\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. */\nexport function parseUpdateVarargs(\n  userDataReader: UserDataReader,\n  methodName: string,\n  targetDoc: DocumentKey,\n  field: string | BaseFieldPath,\n  value: unknown,\n  moreFieldsAndValues: unknown[]\n): ParsedUpdateData {\n  const context = userDataReader.createContext(\n    UserDataSource.Update,\n    methodName,\n    targetDoc\n  );\n  const keys = [fieldPathFromArgument(methodName, field, targetDoc)];\n  const values = [value];\n\n  if (moreFieldsAndValues.length % 2 !== 0) {\n    throw new FirestoreError(\n      Code.INVALID_ARGUMENT,\n      `Function ${methodName}() needs to be called with an even number ` +\n        'of arguments that alternate between field names and values.'\n    );\n  }\n\n  for (let i = 0; i < moreFieldsAndValues.length; i += 2) {\n    keys.push(\n      fieldPathFromArgument(\n        methodName,\n        moreFieldsAndValues[i] as string | BaseFieldPath\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 (\n        value instanceof SerializableFieldValue &&\n        value._delegate instanceof DeleteFieldValueImpl\n      ) {\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/**\n * Parse a \"query value\" (e.g. value in a where filter or a value in a cursor\n * bound).\n *\n * @param allowArrays Whether the query value is an array that may directly\n * contain additional arrays (e.g. the operand of an `in` query).\n */\nexport function parseQueryValue(\n  userDataReader: UserDataReader,\n  methodName: string,\n  input: unknown,\n  allowArrays = false\n): api.Value {\n  const context = userDataReader.createContext(\n    allowArrays ? UserDataSource.ArrayArgument : UserDataSource.Argument,\n    methodName\n  );\n  const parsed = parseData(input, context);\n  debugAssert(parsed != null, 'Parsed data should not be null.');\n  debugAssert(\n    context.fieldTransforms.length === 0,\n    'Field transforms should have been disallowed.'\n  );\n  return parsed;\n}\n\n/**\n * Parses user data to Protobuf Values.\n *\n * @param input Data to be parsed.\n * @param context A context object representing the current path being parsed,\n * the source of the data being parsed, etc.\n * @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 SerializableFieldValue) {\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: SerializableFieldValue,\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) {\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 toNumber(context.serializer, value);\n  } else if (typeof value === 'boolean') {\n    return { booleanValue: value };\n  } else if (typeof value === 'string') {\n    return { stringValue: value };\n  } else if (value instanceof Date) {\n    const timestamp = Timestamp.fromDate(value);\n    return {\n      timestampValue: toTimestamp(context.serializer, timestamp)\n    };\n  } else if (value instanceof Timestamp) {\n    // Firestore backend truncates precision down to microseconds. To ensure\n    // offline mode works the same with regards to truncation, perform the\n    // truncation immediately without waiting for the backend to do that.\n    const timestamp = new Timestamp(\n      value.seconds,\n      Math.floor(value.nanoseconds / 1000) * 1000\n    );\n    return {\n      timestampValue: toTimestamp(context.serializer, timestamp)\n    };\n  } else if (value instanceof GeoPoint) {\n    return {\n      geoPointValue: {\n        latitude: value.latitude,\n        longitude: value.longitude\n      }\n    };\n  } else if (value instanceof Blob) {\n    return { bytesValue: toBytes(context.serializer, value) };\n  } else if (value instanceof DocumentKeyReference) {\n    const thisDb = context.databaseId;\n    const otherDb = value._databaseId;\n    if (!otherDb.isEqual(thisDb)) {\n      throw context.createError(\n        'Document reference is for database ' +\n          `${otherDb.projectId}/${otherDb.database} but should be ` +\n          `for database ${thisDb.projectId}/${thisDb.database}`\n      );\n    }\n    return {\n      referenceValue: toResourceName(\n        value._databaseId || context.databaseId,\n        value._key.path\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 DocumentKeyReference) &&\n    !(input instanceof SerializableFieldValue)\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 | BaseFieldPath,\n  targetDoc?: DocumentKey\n): FieldPath {\n  if (path instanceof BaseFieldPath) {\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 createError(\n      message,\n      methodName,\n      /* hasConverter= */ false,\n      /* path= */ undefined,\n      targetDoc\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 * @param targetDoc The document against which the field path will be evaluated.\n */\nexport function fieldPathFromDotSeparatedString(\n  methodName: string,\n  path: string,\n  targetDoc?: DocumentKey\n): FieldPath {\n  try {\n    return fromDotSeparatedString(path)._internalPath;\n  } catch (e) {\n    const message = errorMessage(e);\n    throw createError(\n      message,\n      methodName,\n      /* hasConverter= */ false,\n      /* path= */ undefined,\n      targetDoc\n    );\n  }\n}\n\nfunction createError(\n  reason: string,\n  methodName: string,\n  hasConverter: boolean,\n  path?: FieldPath,\n  targetDoc?: DocumentKey\n): Error {\n  const hasPath = path && !path.isEmpty();\n  const hasDocument = targetDoc !== undefined;\n  let message = `Function ${methodName}() called with invalid data`;\n  if (hasConverter) {\n    message += ' (via `toFirestore()`)';\n  }\n  message += '. ';\n\n  let description = '';\n  if (hasPath || hasDocument) {\n    description += ' (found';\n\n    if (hasPath) {\n      description += ` in field ${path}`;\n    }\n    if (hasDocument) {\n      description += ` in document ${targetDoc}`;\n    }\n    description += ')';\n  }\n\n  return new FirestoreError(\n    Code.INVALID_ARGUMENT,\n    message + reason + description\n  );\n}\n\n/**\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\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 { 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';\nimport { logDebug } from '../util/log';\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        logDebug(\n          'FirebaseCredentialsProvider',\n          'getToken aborted due to token change.'\n        );\n        return this.getToken();\n      } else {\n        if (tokenData) {\n          hardAssert(\n            typeof tokenData.accessToken === 'string',\n            'Invalid tokenData returned from getToken():' + tokenData\n          );\n          return new OAuthToken(tokenData.accessToken, this.currentUser);\n        } else {\n          return null;\n        }\n      }\n    });\n  }\n\n  invalidateToken(): void {\n    this.forceRefresh = true;\n  }\n\n  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 { 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 { debugAssert, hardAssert } from '../util/assert';\nimport { AsyncQueue, DelayedOperation, TimerId } from '../util/async_queue';\nimport { Code, FirestoreError } from '../util/error';\nimport { logDebug, logError } from '../util/log';\n\nimport { isNullOrUndefined } from '../util/types';\nimport { ExponentialBackoff } from './backoff';\nimport { Connection, Stream } from './connection';\nimport {\n  fromVersion,\n  fromWatchChange,\n  fromWriteResults,\n  getEncodedDatabaseId,\n  JsonProtoSerializer,\n  toListenRequestLabels,\n  toMutation,\n  toTarget,\n  versionFromListenResponse\n} from './serializer';\nimport { WatchChange } from './watch_change';\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 = fromWatchChange(this.serializer, watchChangeProto);\n    const snapshot = versionFromListenResponse(watchChangeProto);\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 = getEncodedDatabaseId(this.serializer);\n    request.addTarget = toTarget(this.serializer, targetData);\n\n    const labels = toListenRequestLabels(this.serializer, 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 = getEncodedDatabaseId(this.serializer);\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  private lastStreamToken: string | Uint8Array | undefined;\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    this.lastStreamToken = undefined;\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 = 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 = fromWriteResults(\n        responseProto.writeResults,\n        responseProto.commitTime\n      );\n      const commitVersion = fromVersion(responseProto.commitTime!);\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    debugAssert(\n      !this.lastStreamToken,\n      'Stream token should be empty during handshake'\n    );\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 = getEncodedDatabaseId(this.serializer);\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,\n      'Trying to write mutation without a token'\n    );\n\n    const request: WriteRequest = {\n      streamToken: this.lastStreamToken,\n      writes: mutations.map(mutation => toMutation(this.serializer, 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 { Document, MaybeDocument } from '../model/document';\nimport { DocumentKey } from '../model/document_key';\nimport { Mutation } 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 {\n  fromDocument,\n  fromMaybeDocument,\n  getEncodedDatabaseId,\n  JsonProtoSerializer,\n  toMutation,\n  toName,\n  toQueryTarget\n} 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  terminated = false;\n\n  constructor(\n    readonly connection: Connection,\n    readonly credentials: CredentialsProvider,\n    readonly serializer: JsonProtoSerializer\n  ) {\n    super();\n  }\n\n  private verifyNotTerminated(): void {\n    if (this.terminated) {\n      throw new FirestoreError(\n        Code.FAILED_PRECONDITION,\n        'The client has already been terminated.'\n      );\n    }\n  }\n\n  /** Gets an auth token and invokes the provided RPC. */\n  invokeRPC<Req, Resp>(rpcName: string, request: Req): Promise<Resp> {\n    this.verifyNotTerminated();\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    this.verifyNotTerminated();\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<void> {\n  const datastoreImpl = debugCast(datastore, DatastoreImpl);\n  const params = {\n    database: getEncodedDatabaseId(datastoreImpl.serializer),\n    writes: mutations.map(m => toMutation(datastoreImpl.serializer, m))\n  };\n  await datastoreImpl.invokeRPC('Commit', params);\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: getEncodedDatabaseId(datastoreImpl.serializer),\n    documents: keys.map(k => toName(datastoreImpl.serializer, 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 = fromMaybeDocument(datastoreImpl.serializer, 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 } = toQueryTarget(\n    datastoreImpl.serializer,\n    query.toTarget()\n  );\n  const params = {\n    database: getEncodedDatabaseId(datastoreImpl.serializer),\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 =>\n        fromDocument(datastoreImpl.serializer, proto.document!, undefined)\n      )\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\nexport function terminateDatastore(datastore: Datastore): void {\n  const datastoreImpl = debugCast(datastore, DatastoreImpl);\n  datastoreImpl.terminated = true;\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 { 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';\nimport { ResourcePath } from '../model/path';\n\n/**\n * Internal transaction object responsible for accumulating the mutations to\n * perform and the base versions for any documents read.\n */\nexport class Transaction {\n  // The version of each document that was read during this transaction.\n  private readVersions = new Map</* path */ string, SnapshotVersion>();\n  private mutations: Mutation[] = [];\n  private committed = false;\n\n  /**\n   * A deferred usage error that occurred previously in this transaction that\n   * will cause the transaction to fail once it actually commits.\n   */\n  private lastWriteError: FirestoreError | null = null;\n\n  /**\n   * Set of documents that have been written in the transaction.\n   *\n   * When there's more than one write to the same key in a transaction, any\n   * writes after the first are handled differently.\n   */\n  private writtenDocs: Set<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    const unwritten = this.readVersions;\n    // For each mutation, note that the doc was written.\n    this.mutations.forEach(mutation => {\n      unwritten.delete(mutation.key.toString());\n    });\n    // For each document that was read but not written to, we want to perform\n    // a `verify` operation.\n    unwritten.forEach((_, path) => {\n      const key = new DocumentKey(ResourcePath.fromString(path));\n      this.mutations.push(new VerifyMutation(key, this.precondition(key)));\n    });\n    await invokeCommitRpc(this.datastore, this.mutations);\n    this.committed = true;\n  }\n\n  private recordVersion(doc: 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.toString());\n    if (existingVersion) {\n      if (!docVersion.isEqual(existingVersion)) {\n        // This transaction will fail no matter what.\n        throw new FirestoreError(\n          Code.ABORTED,\n          'Document version changed between two reads.'\n        );\n      }\n    } else {\n      this.readVersions.set(doc.key.toString(), docVersion);\n    }\n  }\n\n  /**\n   * Returns the version of this document when it was read in this transaction,\n   * as a precondition, or no precondition if it was not read.\n   */\n  private precondition(key: DocumentKey): Precondition {\n    const version = this.readVersions.get(key.toString());\n    if (!this.writtenDocs.has(key) && 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.toString());\n    // The first time a document is written, we want to take into account the\n    // read time and existence\n    if (!this.writtenDocs.has(key) && 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 { 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 { 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';\nimport { User } from '../auth/user';\n\nconst LOG_TAG = 'RemoteStore';\n\n// TODO(b/35853402): Negotiate this with the stream.\nconst MAX_PENDING_WRITES = 10;\n\n/** Reasons for why the RemoteStore may be offline. */\nconst enum OfflineCause {\n  /** The user has explicitly disabled the network (via `disableNetwork()`). */\n  UserDisabled,\n  /** An IndexedDb failure occurred while persisting a stream update. */\n  IndexedDbFailed,\n  /** The tab is not the primary tab (only relevant with multi-tab). */\n  IsSecondary,\n  /** We are restarting the streams due to an Auth credential change. */\n  CredentialChange,\n  /** The connectivity state of the environment has changed. */\n  ConnectivityChange,\n  /** The RemoteStore has been shut down. */\n  Shutdown\n}\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   * A set of reasons for why the RemoteStore may be offline. If empty, the\n   * RemoteStore may start its network connections.\n   */\n  private offlineCauses = new Set<OfflineCause>();\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((_: NetworkStatus) => {\n      asyncQueue.enqueueAndForget(async () => {\n        // Porting Note: Unlike iOS, `restartNetwork()` is called even when the\n        // network becomes unreachable as we don't have any other way to tear\n        // down our streams.\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.offlineCauses.delete(OfflineCause.UserDisabled);\n    return this.enableNetworkInternal();\n  }\n\n  private async enableNetworkInternal(): Promise<void> {\n    if (this.canUseNetwork()) {\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.offlineCauses.add(OfflineCause.UserDisabled);\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.offlineCauses.add(OfflineCause.Shutdown);\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.offlineCauses.size === 0;\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   * `op` succeeds. Retries are scheduled with backoff using\n   * `enqueueRetryable()`. If `op()` is not provided, IndexedDB access is\n   * validated via a generic operation.\n   *\n   * The returned Promise is resolved once the network is disabled and before\n   * any retry attempt.\n   */\n  private async disableNetworkUntilRecovery(\n    e: FirestoreError,\n    op?: () => Promise<unknown>\n  ): Promise<void> {\n    if (isIndexedDbTransactionError(e)) {\n      debugAssert(\n        !this.offlineCauses.has(OfflineCause.IndexedDbFailed),\n        'Unexpected network event when IndexedDB was marked failed.'\n      );\n      this.offlineCauses.add(OfflineCause.IndexedDbFailed);\n\n      // Disable network and raise offline snapshots\n      await this.disableNetworkInternal();\n      this.onlineStateTracker.set(OnlineState.Offline);\n\n      if (!op) {\n        // Use 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        op = () => this.localStore.getLastRemoteSnapshotVersion();\n      }\n\n      // Probe IndexedDB periodically and re-enable network\n      this.asyncQueue.enqueueRetryable(async () => {\n        logDebug(LOG_TAG, 'Retrying IndexedDB access');\n        await op!();\n        this.offlineCauses.delete(OfflineCause.IndexedDbFailed);\n        await this.enableNetworkInternal();\n      });\n    } else {\n      throw e;\n    }\n  }\n\n  /**\n   * Executes `op`. If `op` fails, takes the network offline until `op`\n   * succeeds. Returns after the first attempt.\n   */\n  private executeWithRecovery(op: () => Promise<void>): Promise<void> {\n    return op().catch(e => this.disableNetworkUntilRecovery(e, op));\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    let lastBatchIdRetrieved =\n      this.writePipeline.length > 0\n        ? this.writePipeline[this.writePipeline.length - 1].batchId\n        : BATCHID_UNKNOWN;\n\n    while (this.canAddToWritePipeline()) {\n      try {\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          break;\n        } else {\n          lastBatchIdRetrieved = batch.batchId;\n          this.addToWritePipeline(batch);\n        }\n      } catch (e) {\n        await this.disableNetworkUntilRecovery(e);\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 async onWriteHandshakeComplete(): Promise<void> {\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\n  private async 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(batch, commitVersion, results);\n\n    await this.executeWithRecovery(() =>\n      this.syncEngine.applySuccessfulWrite(success)\n    );\n\n    // It's possible that with the completion of this mutation another\n    // slot has freed up.\n    await this.fillWritePipeline();\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 after the write handshake completes, a write\n    // operation failed and we fail the pending operation.\n    if (error && this.writeStream.handshakeComplete) {\n      // This error affects the actual write.\n      await this.handleWriteError(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\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      await this.executeWithRecovery(() =>\n        this.syncEngine.rejectFailedWrite(batch.batchId, error)\n      );\n\n      // It's possible that with the completion of this mutation\n      // another slot has freed up.\n      await this.fillWritePipeline();\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.offlineCauses.add(OfflineCause.ConnectivityChange);\n    await this.disableNetworkInternal();\n    this.onlineStateTracker.set(OnlineState.Unknown);\n    this.writeStream.inhibitBackoff();\n    this.watchStream.inhibitBackoff();\n    this.offlineCauses.delete(OfflineCause.ConnectivityChange);\n    await this.enableNetworkInternal();\n  }\n\n  async handleCredentialChange(user: User): Promise<void> {\n    this.asyncQueue.verifyOperationInProgress();\n\n    // Tear down and re-create our network streams. This will ensure we get a\n    // fresh auth token for the new user and re-fill the write pipeline with\n    // new mutations from the LocalStore (since mutations are per-user).\n    logDebug(LOG_TAG, 'RemoteStore received new credentials');\n    this.offlineCauses.add(OfflineCause.CredentialChange);\n\n    await this.disableNetworkInternal();\n    this.onlineStateTracker.set(OnlineState.Unknown);\n    await this.syncEngine.handleCredentialChange(user);\n\n    this.offlineCauses.delete(OfflineCause.CredentialChange);\n    await this.enableNetworkInternal();\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    if (isPrimary) {\n      this.offlineCauses.delete(OfflineCause.IsSecondary);\n      await this.enableNetworkInternal();\n    } else if (!isPrimary) {\n      this.offlineCauses.add(OfflineCause.IsSecondary);\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 { 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, WindowLike } 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 window: WindowLike,\n    private readonly queue: AsyncQueue,\n    private readonly persistenceKey: string,\n    private readonly localClientId: ClientId,\n    initialUser: User\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.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.window.addEventListener('storage', this.storageListener);\n  }\n\n  /** Returns 'true' if WebStorage is available in the current environment. */\n  static isAvailable(window: WindowLike | null): window is WindowLike {\n    return !!(window && window.localStorage);\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.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.window.removeEventListener('storage', this.storageListener);\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: Event): void {\n    // Note: The function is typed to take Event to be interface-compatible with\n    // `Window.addEventListener`.\n    const storageEvent = event as StorageEvent;\n    if (storageEvent.storageArea === this.storage) {\n      logDebug(LOG_TAG, 'EVENT', storageEvent.key, storageEvent.newValue);\n\n      if (storageEvent.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(storageEvent);\n          return;\n        }\n\n        if (storageEvent.key === null) {\n          return;\n        }\n\n        if (this.clientStateKeyRe.test(storageEvent.key)) {\n          if (storageEvent.newValue != null) {\n            const clientState = this.fromWebStorageClientState(\n              storageEvent.key,\n              storageEvent.newValue\n            );\n            if (clientState) {\n              return this.handleClientStateEvent(\n                clientState.clientId,\n                clientState\n              );\n            }\n          } else {\n            const clientId = this.fromWebStorageClientStateKey(\n              storageEvent.key\n            )!;\n            return this.handleClientStateEvent(clientId, null);\n          }\n        } else if (this.mutationBatchKeyRe.test(storageEvent.key)) {\n          if (storageEvent.newValue !== null) {\n            const mutationMetadata = this.fromWebStorageMutationMetadata(\n              storageEvent.key,\n              storageEvent.newValue\n            );\n            if (mutationMetadata) {\n              return this.handleMutationBatchEvent(mutationMetadata);\n            }\n          }\n        } else if (this.queryTargetKeyRe.test(storageEvent.key)) {\n          if (storageEvent.newValue !== null) {\n            const queryTargetMetadata = this.fromWebStorageQueryTargetMetadata(\n              storageEvent.key,\n              storageEvent.newValue\n            );\n            if (queryTargetMetadata) {\n              return this.handleQueryTargetEvent(queryTargetMetadata);\n            }\n          }\n        } else if (storageEvent.key === this.onlineStateKey) {\n          if (storageEvent.newValue !== null) {\n            const onlineState = this.fromWebStorageOnlineState(\n              storageEvent.newValue\n            );\n            if (onlineState) {\n              return this.handleOnlineStateEvent(onlineState);\n            }\n          }\n        } else if (storageEvent.key === this.sequenceNumberKey) {\n          debugAssert(\n            !!this.sequenceNumberHandler,\n            'Missing sequenceNumberHandler'\n          );\n          const sequenceNumber = fromWebStorageSequenceNumber(\n            storageEvent.newValue\n          );\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 { newQueryComparator, Query, queryMatches } 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  /** Query comparator that defines the document order in this view. */\n  private docComparator: (d1: Document, d2: Document) => number;\n\n  constructor(\n    private query: Query,\n    /** Documents included in the remote target */\n    private _syncedDocuments: DocumentKeySet\n  ) {\n    this.docComparator = newQueryComparator(query);\n    this.documentSet = new DocumentSet(this.docComparator);\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 = queryMatches(this.query, 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.docComparator(newDoc, lastDocInLimit) > 0) ||\n                (firstDocInLimit &&\n                  this.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.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 { Datastore } from '../remote/datastore';\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 datastore: Datastore,\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 = new Transaction(this.datastore);\n      const userPromise = this.tryRunUpdateFunction(transaction);\n      if (userPromise) {\n        userPromise\n          .then(result => {\n            this.asyncQueue.enqueueAndForget(() => {\n              return transaction\n                .commit()\n                .then(() => {\n                  this.deferred.resolve(result);\n                })\n                .catch(commitError => {\n                  this.handleTransactionError(commitError);\n                });\n            });\n          })\n          .catch(userPromiseError => {\n            this.handleTransactionError(userPromiseError);\n          });\n      }\n    });\n  }\n\n  private tryRunUpdateFunction(transaction: Transaction): Promise<T> | null {\n    try {\n      const userPromise = this.updateFunction(transaction);\n      if (\n        isNullOrUndefined(userPromise) ||\n        !userPromise.catch ||\n        !userPromise.then\n      ) {\n        this.deferred.reject(\n          Error('Transaction callback must return a Promise')\n        );\n        return null;\n      }\n      return userPromise;\n    } catch (error) {\n      // Do not retry errors thrown by user provided updateFunction.\n      this.deferred.reject(error);\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 {\n  canonifyQuery,\n  LimitType,\n  Query,\n  queryEquals,\n  stringifyQuery\n} 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';\nimport { Datastore } from '../remote/datastore';\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 interface SyncEngine extends RemoteSyncer {\n  isPrimaryClient: boolean;\n\n  /** Subscribes to SyncEngine notifications. Has to be called exactly once. */\n  subscribe(syncEngineListener: SyncEngineListener): void;\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  listen(query: Query): Promise<ViewSnapshot>;\n\n  /** Stops listening to the query. */\n  unlisten(query: Query): Promise<void>;\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  write(batch: Mutation[], userCallback: Deferred<void>): Promise<void>;\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\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\n  /**\n   * Registers a user callback that resolves when all pending mutations at the moment of calling\n   * are acknowledged .\n   */\n  registerPendingWritesCallback(callback: Deferred<void>): Promise<void>;\n\n  // Visible for testing\n  activeLimboDocumentResolutions(): SortedMap<DocumentKey, TargetId>;\n\n  // Visible for testing\n  enqueuedLimboDocumentResolutions(): DocumentKey[];\n\n  handleCredentialChange(user: User): Promise<void>;\n\n  enableNetwork(): Promise<void>;\n\n  disableNetwork(): Promise<void>;\n\n  getRemoteKeysForTarget(targetId: TargetId): DocumentKeySet;\n}\n\n/**\n * An implementation of `SyncEngine` coordinating with other parts of SDK.\n *\n * Note: some field defined in this class might have public access level, but\n * the class is not exported so they are only accessible from this module.\n * This is useful to implement optional features (like bundles) in free\n * functions, such that they are tree-shakeable.\n */\nclass SyncEngineImpl implements SyncEngine {\n  protected syncEngineListener: SyncEngineListener | null = null;\n\n  protected queryViewsByQuery = new ObjectMap<Query, QueryView>(\n    q => canonifyQuery(q),\n    queryEquals\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    protected datastore: Datastore,\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  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  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  async unlisten(query: Query): Promise<void> {\n    this.assertSubscribed('unlisten()');\n\n    const queryView = this.queryViewsByQuery.get(query)!;\n    debugAssert(\n      !!queryView,\n      'Trying to unlisten on query not found:' + stringifyQuery(query)\n    );\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 => !queryEquals(q, 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  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  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.datastore,\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  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    try {\n      const changes = await this.localStore.acknowledgeBatch(\n        mutationBatchResult\n      );\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      this.triggerPendingWritesCallbacks(batchId);\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    try {\n      const changes = await this.localStore.rejectBatch(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 up),\n      // so we raise user callbacks first so that they consistently happen before\n      // listen events.\n      this.processUserCallback(batchId, error);\n      this.triggerPendingWritesCallbacks(batchId);\n\n      this.sharedClientState.updateMutationState(batchId, 'rejected', error);\n      await this.emitNewSnapsAndNotifyLocalStore(changes);\n    } catch (error) {\n      await ignoreIfPrimaryLeaseLoss(error);\n    }\n  }\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      logDebug(LOG_TAG, 'User change. New user:', user.toKey());\n\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\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(\n          !!queryView,\n          `No query view found for ${stringifyQuery(query)}`\n        );\n        keySet = keySet.unionWith(queryView.view.syncedDocuments);\n      }\n      return keySet;\n    }\n  }\n}\n\nexport function newSyncEngine(\n  localStore: LocalStore,\n  remoteStore: RemoteStore,\n  datastore: Datastore,\n  // PORTING NOTE: Manages state synchronization in multi-tab environments.\n  sharedClientState: SharedClientState,\n  currentUser: User,\n  maxConcurrentLimboResolutions: number\n): SyncEngine {\n  return new SyncEngineImpl(\n    localStore,\n    remoteStore,\n    datastore,\n    sharedClientState,\n    currentUser,\n    maxConcurrentLimboResolutions\n  );\n}\n\n/**\n * An extension of SyncEngine that also includes SharedClientStateSyncer for\n * Multi-Tab synchronization.\n */\n// PORTING NOTE: Web only\nexport interface MultiTabSyncEngine\n  extends SharedClientStateSyncer,\n    SyncEngine {\n  applyPrimaryState(isPrimary: boolean): Promise<void>;\n}\n\n/**\n * An implementation of `SyncEngineImpl` providing multi-tab synchronization on\n * top of `SyncEngineImpl`.\n *\n * Note: some field defined in this class might have public access level, but\n * the class is not exported so they are only accessible from this module.\n * This is useful to implement optional features (like bundles) in free\n * functions, such that they are tree-shakeable.\n */\nclass MultiTabSyncEngineImpl extends SyncEngineImpl {\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    datastore: Datastore,\n    sharedClientState: SharedClientState,\n    currentUser: User,\n    maxConcurrentLimboResolutions: number\n  ) {\n    super(\n      localStore,\n      remoteStore,\n      datastore,\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 fetch their current state\n        // from 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        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(\n            !!queryView,\n            `No query view found for ${stringifyQuery(query)}`\n          );\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 view without an active target.'\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\nexport function newMultiTabSyncEngine(\n  localStore: MultiTabLocalStore,\n  remoteStore: RemoteStore,\n  datastore: Datastore,\n  sharedClientState: SharedClientState,\n  currentUser: User,\n  maxConcurrentLimboResolutions: number\n): MultiTabSyncEngine {\n  return new MultiTabSyncEngineImpl(\n    localStore,\n    remoteStore,\n    datastore,\n    sharedClientState,\n    currentUser,\n    maxConcurrentLimboResolutions\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 { canonifyQuery, Query, queryEquals, stringifyQuery } 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>(\n    q => canonifyQuery(q),\n    queryEquals\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 '${stringifyQuery(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 {\n  LimitType,\n  newQueryComparator,\n  Query,\n  queryMatches,\n  stringifyQuery\n} 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            stringifyQuery(query)\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>(newQueryComparator(query));\n    documents.forEach((_, maybeDoc) => {\n      if (maybeDoc instanceof Document && queryMatches(query, 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        stringifyQuery(query)\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 { 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  /** 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  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, queryMatches } 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 (\n        maybeDocument instanceof Document &&\n        queryMatches(query, maybeDocument)\n      ) {\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 { canonifyTarget, Target, targetEquals } 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>(\n    t => canonifyTarget(t),\n    targetEquals\n  );\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(\n    k => encodeResourcePath(k.path),\n    (l, r) => l.isEqual(r)\n  );\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 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, logWarn } 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        logWarn(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 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 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 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 {\n  LocalStore,\n  MultiTabLocalStore,\n  newLocalStore,\n  newMultiTabLocalStore\n} from '../local/local_store';\nimport {\n  MultiTabSyncEngine,\n  newMultiTabSyncEngine,\n  newSyncEngine,\n  SyncEngine\n} from './sync_engine';\nimport { RemoteStore } from '../remote/remote_store';\nimport { EventManager } from './event_manager';\nimport { AsyncQueue } from '../util/async_queue';\nimport { DatabaseId, DatabaseInfo } from './database_info';\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 {\n  indexedDbStoragePrefix,\n  IndexedDbPersistence,\n  indexedDbClearPersistence\n} from '../local/indexeddb_persistence';\nimport {\n  MemoryEagerDelegate,\n  MemoryPersistence\n} from '../local/memory_persistence';\nimport { newConnectivityMonitor } from '../platform/connection';\nimport { newSerializer } from '../platform/serializer';\nimport { getDocument, getWindow } from '../platform/dom';\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  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(\n    databaseId: DatabaseId,\n    persistenceKey: string\n  ): 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 newLocalStore(\n      this.persistence,\n      new IndexFreeQueryEngine(),\n      cfg.initialUser\n    );\n  }\n\n  createPersistence(cfg: ComponentConfiguration): Persistence {\n    if (cfg.persistenceSettings.durable) {\n      throw new FirestoreError(\n        Code.FAILED_PRECONDITION,\n        MEMORY_ONLY_PERSISTENCE_ERROR_MESSAGE\n      );\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      newConnectivityMonitor()\n    );\n  }\n\n  createSharedClientState(cfg: ComponentConfiguration): SharedClientState {\n    return new MemorySharedClientState();\n  }\n\n  createSyncEngine(cfg: ComponentConfiguration): SyncEngine {\n    return newSyncEngine(\n      this.localStore,\n      this.remoteStore,\n      cfg.datastore,\n      this.sharedClientState,\n      cfg.initialUser,\n      cfg.maxConcurrentLimboResolutions\n    );\n  }\n\n  clearPersistence(\n    databaseId: DatabaseId,\n    persistenceKey: string\n  ): 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  createLocalStore(cfg: ComponentConfiguration): LocalStore {\n    return newLocalStore(\n      this.persistence,\n      new IndexFreeQueryEngine(),\n      cfg.initialUser\n    );\n  }\n\n  createSyncEngine(cfg: ComponentConfiguration): SyncEngine {\n    return newSyncEngine(\n      this.localStore,\n      this.remoteStore,\n      cfg.datastore,\n      this.sharedClientState,\n      cfg.initialUser,\n      cfg.maxConcurrentLimboResolutions\n    );\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 = indexedDbStoragePrefix(\n      cfg.databaseInfo.databaseId,\n      cfg.databaseInfo.persistenceKey\n    );\n    const serializer = newSerializer(cfg.databaseInfo.databaseId);\n    return new IndexedDbPersistence(\n      cfg.persistenceSettings.synchronizeTabs,\n      persistenceKey,\n      cfg.clientId,\n      LruParams.withCacheSize(cfg.persistenceSettings.cacheSizeBytes),\n      cfg.asyncQueue,\n      getWindow(),\n      getDocument(),\n      serializer,\n      this.sharedClientState,\n      cfg.persistenceSettings.forceOwningTab\n    );\n  }\n\n  createSharedClientState(cfg: ComponentConfiguration): SharedClientState {\n    return new MemorySharedClientState();\n  }\n\n  clearPersistence(\n    databaseId: DatabaseId,\n    persistenceKey: string\n  ): Promise<void> {\n    return indexedDbClearPersistence(\n      indexedDbStoragePrefix(databaseId, persistenceKey)\n    );\n  }\n}\n\n/**\n * Provides all components needed for Firestore with multi-tab IndexedDB\n * persistence.\n *\n * In the legacy client, this provider is used to provide both multi-tab and\n * non-multi-tab persistence since we cannot tell at build time whether\n * `synchronizeTabs` will be enabled.\n */\nexport class MultiTabIndexedDbComponentProvider extends IndexedDbComponentProvider {\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 newMultiTabLocalStore(\n      this.persistence,\n      new IndexFreeQueryEngine(),\n      cfg.initialUser\n    );\n  }\n\n  createSyncEngine(cfg: ComponentConfiguration): SyncEngine {\n    const syncEngine = newMultiTabSyncEngine(\n      this.localStore,\n      this.remoteStore,\n      cfg.datastore,\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  createSharedClientState(cfg: ComponentConfiguration): SharedClientState {\n    if (\n      cfg.persistenceSettings.durable &&\n      cfg.persistenceSettings.synchronizeTabs\n    ) {\n      const window = getWindow();\n      if (!WebStorageSharedClientState.isAvailable(window)) {\n        throw new FirestoreError(\n          Code.UNIMPLEMENTED,\n          'IndexedDB persistence is only available on platforms that support LocalStorage.'\n        );\n      }\n      const persistenceKey = indexedDbStoragePrefix(\n        cfg.databaseInfo.databaseId,\n        cfg.databaseInfo.persistenceKey\n      );\n      return new WebStorageSharedClientState(\n        window,\n        cfg.asyncQueue,\n        persistenceKey,\n        cfg.clientId,\n        cfg.initialUser\n      );\n    }\n    return new MemorySharedClientState();\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 { WebChannelConnection } from './webchannel_connection';\nimport { DatabaseInfo } from '../../core/database_info';\nimport { Connection } from '../../remote/connection';\nimport { ConnectivityMonitor } from '../../remote/connectivity_monitor';\nimport { BrowserConnectivityMonitor } from './connectivity_monitor';\nimport { NoopConnectivityMonitor } from '../../remote/connectivity_monitor_noop';\n\n/** Initializes the WebChannelConnection for the browser. */\nexport function newConnection(databaseInfo: DatabaseInfo): Promise<Connection> {\n  return Promise.resolve(new WebChannelConnection(databaseInfo));\n}\n\n/** Return the Platform-specific connectivity monitor. */\nexport function newConnectivityMonitor(): ConnectivityMonitor {\n  if (BrowserConnectivityMonitor.isAvailable()) {\n    return new BrowserConnectivityMonitor();\n  } else {\n    return new NoopConnectivityMonitor();\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 { 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';\nimport { newConnection } from '../platform/connection';\nimport { newSerializer } from '../platform/serializer';\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      readonly forceOwningTab: 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 databaseInfo!: DatabaseInfo;\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 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 databaseInfo The connection information for the current instance.\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    databaseInfo: DatabaseInfo,\n    componentProvider: ComponentProvider,\n    persistenceSettings: PersistenceSettings\n  ): Promise<void> {\n    this.verifyNotTerminated();\n\n    this.databaseInfo = databaseInfo;\n\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          this.remoteStore.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 newConnection(this.databaseInfo);\n      const serializer = newSerializer(this.databaseInfo.databaseId);\n      const datastore = newDatastore(connection, this.credentials, serializer);\n\n      await componentProvider.initialize({\n        asyncQueue: this.asyncQueue,\n        databaseInfo: this.databaseInfo,\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  /** 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 { DocumentKeyReference } from './user_data_reader';\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 {\n  constructor(\n    private readonly databaseId: DatabaseId,\n    private readonly timestampsInSnapshots: boolean,\n    private readonly serverTimestampBehavior: ServerTimestampBehavior,\n    private readonly referenceFactory: (\n      key: DocumentKey\n    ) => DocumentKeyReference<firestore.DocumentData>\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(\n    name: string\n  ): DocumentKeyReference<firestore.DocumentData> {\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.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.databaseId.projectId}/${this.databaseId.database}) ` +\n          `instead.`\n      );\n    }\n\n    return this.referenceFactory(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 * 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  newQueryComparator,\n  Operator,\n  OrderBy,\n  Query as InternalQuery,\n  queryEquals\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 { 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 } 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 {\n  DocumentKeyReference,\n  fieldPathFromArgument,\n  parseQueryValue,\n  parseSetData,\n  parseUpdateData,\n  parseUpdateVarargs,\n  UntypedFirestoreDataConverter,\n  UserDataReader\n} 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    let experimentalForceOwningTab = 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      experimentalForceOwningTab = settings.experimentalForceOwningTab\n        ? settings.experimentalForceOwningTab\n        : false;\n\n      if (synchronizeTabs && experimentalForceOwningTab) {\n        throw new FirestoreError(\n          Code.INVALID_ARGUMENT,\n          \"The 'experimentalForceOwningTab' setting cannot be used with 'synchronizeTabs'.\"\n        );\n      }\n    }\n\n    return this.configureClient(this._componentProvider, {\n      durable: true,\n      cacheSizeBytes: this._settings.cacheSizeBytes,\n      synchronizeTabs,\n      forceOwningTab: experimentalForceOwningTab\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 can only be cleared before a Firestore instance is ' +\n          'initialized or after it is terminated.'\n      );\n    }\n\n    const deferred = new Deferred<void>();\n    this._queue.enqueueAndForgetEvenAfterShutdown(async () => {\n      try {\n        await this._componentProvider.clearPersistence(\n          this._databaseId,\n          this._persistenceKey\n        );\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 addSnapshotsInSyncListener(\n        this._firestoreClient!,\n        arg as PartialObserver<void>\n      );\n    } else {\n      validateArgType('Firestore.onSnapshotsInSync', 'function', 1, arg);\n      const observer: PartialObserver<void> = {\n        next: arg as () => void\n      };\n      return addSnapshotsInSyncListener(this._firestoreClient!, observer);\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(this._credentials, this._queue);\n\n    return this._firestoreClient.start(\n      databaseInfo,\n      componentProvider,\n      persistenceSettings\n    );\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(\n      ResourcePath.fromString(pathString),\n      this,\n      /* converter= */ null\n    );\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(\n      ResourcePath.fromString(pathString),\n      this,\n      /* converter= */ null\n    );\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.emptyPath(), collectionId),\n      this,\n      /* converter= */ null\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.ERROR:\n        return 'error';\n      case LogLevel.SILENT:\n        return 'silent';\n      case LogLevel.WARN:\n        return 'warn';\n      case LogLevel.INFO:\n        return 'info';\n      case LogLevel.VERBOSE:\n        return 'verbose';\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    validateStringEnum(\n      'setLogLevel',\n      ['debug', 'error', 'silent', 'warn', 'info', 'verbose'],\n      1,\n      level\n    );\n    setLogLevel(level);\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/** Registers the listener for onSnapshotsInSync() */\nexport function addSnapshotsInSyncListener(\n  firestoreClient: FirestoreClient,\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  firestoreClient.addSnapshotsInSyncListener(asyncObserver);\n  return () => {\n    asyncObserver.mute();\n    firestoreClient.removeSnapshotsInSyncListener(asyncObserver);\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: DocumentReference<T>,\n    data: Partial<T>,\n    options: firestore.SetOptions\n  ): Transaction;\n  set<T>(documentRef: DocumentReference<T>, data: T): Transaction;\n  set<T>(\n    documentRef: firestore.DocumentReference<T>,\n    value: T | Partial<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 = applyFirestoreDataConverter(\n      ref._converter,\n      value,\n      options\n    );\n    const parsed = parseSetData(\n      this._firestore._dataReader,\n      'Transaction.set',\n      ref._key,\n      convertedValue,\n      ref._converter !== null,\n      options\n    );\n    this._transaction.set(ref._key, parsed);\n    return this;\n  }\n\n  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 = parseUpdateVarargs(\n        this._firestore._dataReader,\n        'Transaction.update',\n        ref._key,\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 = parseUpdateData(\n        this._firestore._dataReader,\n        'Transaction.update',\n        ref._key,\n        fieldOrUpdateData\n      );\n    }\n\n    this._transaction.update(ref._key, parsed);\n    return this;\n  }\n\n  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: DocumentReference<T>,\n    data: Partial<T>,\n    options: firestore.SetOptions\n  ): WriteBatch;\n  set<T>(documentRef: DocumentReference<T>, data: T): WriteBatch;\n  set<T>(\n    documentRef: firestore.DocumentReference<T>,\n    value: T | Partial<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 = applyFirestoreDataConverter(\n      ref._converter,\n      value,\n      options\n    );\n    const parsed = parseSetData(\n      this._firestore._dataReader,\n      'WriteBatch.set',\n      ref._key,\n      convertedValue,\n      ref._converter !== null,\n      options\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 = parseUpdateVarargs(\n        this._firestore._dataReader,\n        'WriteBatch.update',\n        ref._key,\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 = parseUpdateData(\n        this._firestore._dataReader,\n        'WriteBatch.update',\n        ref._key,\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  extends DocumentKeyReference<T>\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> | null\n  ) {\n    super(firestore._databaseId, _key, _converter);\n    this._firestoreClient = this.firestore.ensureClientConfigured();\n  }\n\n  static forPath<U>(\n    path: ResourcePath,\n    firestore: Firestore,\n    converter: firestore.FirestoreDataConverter<U> | null\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(\n      this._key.path.child(path),\n      this.firestore,\n      /* converter= */ null\n    );\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(value: Partial<T>, options: firestore.SetOptions): Promise<void>;\n  set(value: T): Promise<void>;\n  set(value: T | Partial<T>, options?: firestore.SetOptions): Promise<void> {\n    validateBetweenNumberOfArgs('DocumentReference.set', arguments, 1, 2);\n    options = validateSetOptions('DocumentReference.set', options);\n    const convertedValue = applyFirestoreDataConverter(\n      this._converter,\n      value,\n      options\n    );\n    const parsed = parseSetData(\n      this.firestore._dataReader,\n      'DocumentReference.set',\n      this._key,\n      convertedValue,\n      this._converter !== null,\n      options\n    );\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 = parseUpdateVarargs(\n        this.firestore._dataReader,\n        'DocumentReference.update',\n        this._key,\n        fieldOrUpdateData,\n        value,\n        moreFieldsAndValues\n      );\n    } else {\n      validateExactNumberOfArgs('DocumentReference.update', arguments, 1);\n      parsed = parseUpdateData(\n        this.firestore._dataReader,\n        'DocumentReference.update',\n        this._key,\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 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      const userObserver = args[currArg] as PartialObserver<\n        firestore.DocumentSnapshot<T>\n      >;\n      args[currArg] = userObserver.next?.bind(userObserver);\n      args[currArg + 1] = userObserver.error?.bind(userObserver);\n      args[currArg + 2] = userObserver.complete?.bind(userObserver);\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    }\n\n    const observer: PartialObserver<ViewSnapshot> = {\n      next: snapshot => {\n        if (args[currArg]) {\n          (args[currArg] as NextFn<firestore.DocumentSnapshot<T>>)(\n            this._convertToDocSnapshot(snapshot)\n          );\n        }\n      },\n      error: args[currArg + 1] as ErrorFn,\n      complete: args[currArg + 2] as CompleteFn\n    };\n\n    return addDocSnapshotListener(\n      this._firestoreClient,\n      this._key,\n      internalOptions,\n      observer\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\n    if (options && options.source === 'cache') {\n      return this.firestore\n        .ensureClientConfigured()\n        .getDocumentFromLocalCache(this._key)\n        .then(\n          doc =>\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    } else {\n      return getDocViaSnapshotListener(\n        this._firestoreClient,\n        this._key,\n        options\n      ).then(snapshot => this._convertToDocSnapshot(snapshot));\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  /**\n   * Converts a ViewSnapshot that contains the current document to a\n   * DocumentSnapshot.\n   */\n  private _convertToDocSnapshot(snapshot: ViewSnapshot): DocumentSnapshot<T> {\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    return new DocumentSnapshot(\n      this.firestore,\n      this._key,\n      doc,\n      snapshot.fromCache,\n      snapshot.hasPendingWrites,\n      this._converter\n    );\n  }\n}\n\n/** Registers an internal snapshot listener for `ref`. */\nexport function addDocSnapshotListener(\n  firestoreClient: FirestoreClient,\n  key: DocumentKey,\n  options: ListenOptions,\n  observer: PartialObserver<ViewSnapshot>\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        observer.next(snapshot);\n      }\n    },\n    error: errHandler\n  });\n  const internalListener = firestoreClient.listen(\n    InternalQuery.atPath(key.path),\n    asyncObserver,\n    options\n  );\n\n  return () => {\n    asyncObserver.mute();\n    firestoreClient.unlisten(internalListener);\n  };\n}\n\n/**\n * Retrieves a latency-compensated document from the backend via a\n * SnapshotListener.\n */\nexport function getDocViaSnapshotListener(\n  firestoreClient: FirestoreClient,\n  key: DocumentKey,\n  options?: firestore.GetOptions\n): Promise<ViewSnapshot> {\n  const result = new Deferred<ViewSnapshot>();\n  const unlisten = addDocSnapshotListener(\n    firestoreClient,\n    key,\n    {\n      includeMetadataChanges: true,\n      waitForSyncWhenOnline: true\n    },\n    {\n      next: (snap: ViewSnapshot) => {\n        // Remove query first before passing event to user to avoid\n        // user actions affecting the now stale query.\n        unlisten();\n\n        const exists = snap.docs.has(key);\n        if (!exists && snap.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          result.reject(\n            new FirestoreError(\n              Code.UNAVAILABLE,\n              'Failed to get document because the client is ' + 'offline.'\n            )\n          );\n        } else if (\n          exists &&\n          snap.fromCache &&\n          options &&\n          options.source === 'server'\n        ) {\n          result.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          result.resolve(snap);\n        }\n      },\n      error: e => result.reject(e)\n    }\n  );\n  return result.promise;\n}\n\nexport class 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> | null\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          /* converter= */ null\n        );\n        return this._converter.fromFirestore(snapshot, options);\n      } else {\n        const userDataWriter = new UserDataWriter(\n          this._firestore._databaseId,\n          this._firestore._areTimestampsInSnapshotsEnabled(),\n          options.serverTimestamps || 'none',\n          key =>\n            new DocumentReference(key, this._firestore, /* converter= */ null)\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(\n          fieldPathFromArgument('DocumentSnapshot.get', fieldPath, this._key)\n        );\n      if (value !== null) {\n        const userDataWriter = new UserDataWriter(\n          this._firestore._databaseId,\n          this._firestore._areTimestampsInSnapshotsEnabled(),\n          options.serverTimestamps || 'none',\n          key => new DocumentReference(key, this._firestore, 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\n/** The query class that is shared between the full, lite and legacy SDK. */\nexport class BaseQuery {\n  constructor(\n    protected _databaseId: DatabaseId,\n    protected _dataReader: UserDataReader,\n    protected _query: InternalQuery\n  ) {}\n\n  protected createFilter(\n    fieldPath: FieldPath,\n    op: Operator,\n    value: unknown\n  ): FieldFilter {\n    let fieldValue: api.Value;\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 = parseQueryValue(\n        this._dataReader,\n        'Query.where',\n        value,\n        op === Operator.IN\n      );\n    }\n    const filter = FieldFilter.create(fieldPath, op, fieldValue);\n    this.validateNewFilter(filter);\n    return filter;\n  }\n\n  protected createOrderBy(fieldPath: FieldPath, direction: Direction): OrderBy {\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 orderBy = new OrderBy(fieldPath, direction);\n    this.validateNewOrderBy(orderBy);\n    return orderBy;\n  }\n\n  /**\n   * Create a Bound from a query and a document.\n   *\n   * Note that the Bound will always include the key of the document\n   * and so only the provided document will compare equal to the returned\n   * position.\n   *\n   * Will throw if the document does not contain all fields of the order by\n   * of the query or if any of the fields in the order by are an uncommitted\n   * server timestamp.\n   */\n  protected boundFromDocument(\n    methodName: string,\n    doc: Document | null,\n    before: boolean\n  ): Bound {\n    if (!doc) {\n      throw new FirestoreError(\n        Code.NOT_FOUND,\n        `Can't use a DocumentSnapshot that doesn't exist for ` +\n          `${methodName}().`\n      );\n    }\n\n    const components: 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._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  protected 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._databaseId, key));\n      } else {\n        const wrapped = parseQueryValue(this._dataReader, methodName, rawValue);\n        components.push(wrapped);\n      }\n    }\n\n    return new Bound(components, before);\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._databaseId, new DocumentKey(path));\n    } else if (documentIdValue instanceof DocumentKeyReference) {\n      return refValue(this._databaseId, documentIdValue._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 function validateHasExplicitOrderByForLimitToLast(\n  query: InternalQuery\n): 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\nexport class Query<T = firestore.DocumentData> extends BaseQuery\n  implements firestore.Query<T> {\n  constructor(\n    public _query: InternalQuery,\n    readonly firestore: Firestore,\n    protected readonly _converter: firestore.FirestoreDataConverter<T> | null\n  ) {\n    super(firestore._databaseId, firestore._dataReader, _query);\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    const fieldPath = fieldPathFromArgument('Query.where', field);\n    const filter = this.createFilter(fieldPath, op, value);\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    const fieldPath = fieldPathFromArgument('Query.orderBy', field);\n    const orderBy = this.createOrderBy(fieldPath, direction);\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 &&\n      queryEquals(this._query, other._query) &&\n      this._converter === other._converter\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      validateExactNumberOfArgs(methodName, [docOrField, ...fields], 1);\n      return this.boundFromDocument(methodName, docOrField._document, before);\n    } else {\n      const allFields = [docOrField].concat(fields);\n      return this.boundFromFields(methodName, allFields, before);\n    }\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 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      const userObserver = args[currArg] as PartialObserver<\n        firestore.QuerySnapshot<T>\n      >;\n      args[currArg] = userObserver.next?.bind(userObserver);\n      args[currArg + 1] = userObserver.error?.bind(userObserver);\n      args[currArg + 2] = userObserver.complete?.bind(userObserver);\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    }\n\n    const observer: PartialObserver<ViewSnapshot> = {\n      next: snapshot => {\n        if (args[currArg]) {\n          (args[currArg] as NextFn<firestore.QuerySnapshot<T>>)(\n            new QuerySnapshot(\n              this.firestore,\n              this._query,\n              snapshot,\n              this._converter\n            )\n          );\n        }\n      },\n      error: args[currArg + 1] as ErrorFn,\n      complete: args[currArg + 2] as CompleteFn\n    };\n\n    validateHasExplicitOrderByForLimitToLast(this._query);\n    const firestoreClient = this.firestore.ensureClientConfigured();\n    return addQuerySnapshotListener(\n      firestoreClient,\n      this._query,\n      options,\n      observer\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    validateHasExplicitOrderByForLimitToLast(this._query);\n\n    const firestoreClient = this.firestore.ensureClientConfigured();\n    return (options && options.source === 'cache'\n      ? firestoreClient.getDocumentsFromLocalCache(this._query)\n      : getDocsViaSnapshotListener(firestoreClient, this._query, options)\n    ).then(\n      snap =>\n        new QuerySnapshot(this.firestore, this._query, snap, this._converter)\n    );\n  }\n}\n\n/**\n * Retrieves a latency-compensated query snapshot from the backend via a\n * SnapshotListener.\n */\nexport function getDocsViaSnapshotListener(\n  firestore: FirestoreClient,\n  query: InternalQuery,\n  options?: firestore.GetOptions\n): Promise<ViewSnapshot> {\n  const result = new Deferred<ViewSnapshot>();\n  const unlisten = addQuerySnapshotListener(\n    firestore,\n    query,\n    {\n      includeMetadataChanges: true,\n      waitForSyncWhenOnline: true\n    },\n    {\n      next: snapshot => {\n        // Remove query first before passing event to user to avoid\n        // user actions affecting the now stale query.\n        unlisten();\n\n        if (snapshot.fromCache && options && options.source === 'server') {\n          result.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          result.resolve(snapshot);\n        }\n      },\n      error: e => result.reject(e)\n    }\n  );\n  return result.promise;\n}\n\n/** Registers an internal snapshot listener for `query`. */\nexport function addQuerySnapshotListener(\n  firestore: FirestoreClient,\n  query: InternalQuery,\n  options: ListenOptions,\n  observer: PartialObserver<ViewSnapshot>\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  const asyncObserver = new AsyncObserver<ViewSnapshot>({\n    next: (result: ViewSnapshot): void => {\n      if (observer.next) {\n        observer.next(result);\n      }\n    },\n    error: errHandler\n  });\n\n  const internalListener = firestore.listen(query, asyncObserver, options);\n  return (): void => {\n    asyncObserver.mute();\n    firestore.unlisten(internalListener);\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> | null\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(\n        thisArg,\n        this.convertToDocumentImpl(\n          doc,\n          this.metadata.fromCache,\n          this._snapshot.mutatedKeys.has(doc.key)\n        )\n      );\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<QueryDocumentSnapshot<T>>(\n        this._snapshot,\n        includeMetadataChanges,\n        this.convertToDocumentImpl.bind(this)\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      queryEquals(this._originalQuery, other._originalQuery) &&\n      this._snapshot.isEqual(other._snapshot) &&\n      this._converter === other._converter\n    );\n  }\n\n  private convertToDocumentImpl(\n    doc: Document,\n    fromCache: boolean,\n    hasPendingWrites: boolean\n  ): QueryDocumentSnapshot<T> {\n    return new QueryDocumentSnapshot(\n      this._firestore,\n      doc.key,\n      doc,\n      fromCache,\n      hasPendingWrites,\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> | null\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        /* converter= */ null\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    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): DocumentKeyReference<T> {\n  if (!(documentRef instanceof DocumentKeyReference)) {\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 *\n * @param snapshot The ViewSnapshot that represents the expected state.\n * @param includeMetadataChanges Whether to include metadata changes.\n * @param converter A factory function that returns a QueryDocumentSnapshot.\n * @return An objecyt that matches the firestore.DocumentChange API.\n */\nexport function changesFromSnapshot<DocSnap>(\n  snapshot: ViewSnapshot,\n  includeMetadataChanges: boolean,\n  converter: (\n    doc: Document,\n    fromCache: boolean,\n    hasPendingWrite: boolean\n  ) => DocSnap\n): Array<{\n  type: firestore.DocumentChangeType;\n  doc: DocSnap;\n  oldIndex: number;\n  newIndex: number;\n}> {\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 = converter(\n        change.doc,\n        snapshot.fromCache,\n        snapshot.mutatedKeys.has(change.doc.key)\n      );\n      debugAssert(\n        change.type === ChangeType.Added,\n        'Invalid event type for first snapshot'\n      );\n      debugAssert(\n        !lastDoc || newQueryComparator(snapshot.query)(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 = converter(\n          change.doc,\n          snapshot.fromCache,\n          snapshot.mutatedKeys.has(change.doc.key)\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 */\nexport function applyFirestoreDataConverter<T>(\n  converter: UntypedFirestoreDataConverter<T> | null,\n  value: T,\n  options?: firestore.SetOptions\n): firestore.DocumentData {\n  let convertedValue;\n  if (converter) {\n    if (options && (options.merge || options.mergeFields)) {\n      // Cast to `any` in order to satisfy the union type constraint on\n      // toFirestore().\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      convertedValue = (converter as any).toFirestore(value, options);\n    } else {\n      convertedValue = converter.toFirestore(value);\n    }\n  } else {\n    convertedValue = value as firestore.DocumentData;\n  }\n  return convertedValue;\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 { 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  CollectionReference,\n  DocumentReference,\n  DocumentSnapshot,\n  Firestore,\n  Query,\n  QueryDocumentSnapshot,\n  QuerySnapshot,\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 { FieldValue } from './api/field_value';\n\nconst firestoreNamespace = {\n  Firestore,\n  GeoPoint,\n  Timestamp,\n  Blob,\n  Transaction,\n  WriteBatch,\n  DocumentReference,\n  DocumentSnapshot,\n  Query,\n  QueryDocumentSnapshot,\n  QuerySnapshot,\n  CollectionReference,\n  FieldPath,\n  FieldValue,\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 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 */\nimport firebase from '@firebase/app';\nimport { FirebaseNamespace } from '@firebase/app-types';\n\nimport { Firestore } from './src/api/database';\nimport { MultiTabIndexedDbComponentProvider } from './src/core/component_provider';\nimport { configureForFirebase } from './src/config';\n\nimport './register-module';\nimport { name, version } from './package.json';\n\n/**\n * Registers the main Firestore ReactNative 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) =>\n      new Firestore(app, auth, new MultiTabIndexedDbComponentProvider())\n  );\n  instance.registerVersion(name, version, 'rn');\n}\n\nregisterFirestore(firebase);\n"],"names":["SDK_VERSION","firebase","__PRIVATE_logClient","Logger","__PRIVATE_getLogLevel","logLevel","__PRIVATE_logDebug","msg","obj","LogLevel","DEBUG","args","map","__PRIVATE_argToString","debug","__PRIVATE_logError","ERROR","error","value","JSON","stringify","e","fail","__PRIVATE_failure","message","Error","__PRIVATE_hardAssert","assertion","__PRIVATE_debugCast","constructor","__PRIVATE_randomBytes","__PRIVATE_nBytes","crypto","self","bytes","Uint8Array","getRandomValues","__PRIVATE_i","Math","floor","random","__PRIVATE_AutoId","[object Object]","__PRIVATE_chars","__PRIVATE_maxMultiple","length","__PRIVATE_autoId","charAt","__PRIVATE_primitiveComparator","left","right","__PRIVATE_arrayEquals","__PRIVATE_comparator","every","index","__PRIVATE_immediateSuccessor","s","__PRIVATE_DatabaseInfo","__PRIVATE_databaseId","persistenceKey","host","ssl","forceLongPolling","this","__PRIVATE_DatabaseId","projectId","database","i","other","__PRIVATE_objectSize","count","key","Object","prototype","hasOwnProperty","call","forEach","fn","__PRIVATE_isEmpty","__PRIVATE_ObjectMap","__PRIVATE_mapKeyFn","__PRIVATE_equalsFn","id","matches","__PRIVATE_inner","undefined","__PRIVATE_otherKey","get","push","splice","__PRIVATE__","entries","k","v","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","FirestoreError","code","super","toString","name","Timestamp","seconds","nanoseconds","fromMillis","Date","now","date","getTime","milliseconds","toMillis","__PRIVATE_adjustedSeconds","String","padStart","__PRIVATE_SnapshotVersion","timestamp","__PRIVATE__compareTo","isEqual","__PRIVATE_BasePath","segments","offset","__PRIVATE_len","__PRIVATE_nameOrPath","slice","limit","__PRIVATE_segment","__PRIVATE_construct","size","__PRIVATE_potentialChild","end","p1","p2","min","ResourcePath","__PRIVATE_toArray","join","__PRIVATE_canonicalString","path","indexOf","split","filter","__PRIVATE_identifierRegExp","FieldPath","test","str","replace","__PRIVATE_isValidIdentifier","__PRIVATE_current","__PRIVATE_addCurrentSegment","__PRIVATE_inBackticks","c","next","__PRIVATE_DocumentKey","__PRIVATE_fromString","__PRIVATE_popFirst","collectionId","k1","k2","__PRIVATE_isNullOrUndefined","__PRIVATE_isNegativeZero","isSafeInteger","Number","isInteger","MAX_SAFE_INTEGER","MIN_SAFE_INTEGER","__PRIVATE_TargetImpl","collectionGroup","orderBy","filters","startAt","endAt","__PRIVATE_newTarget","__PRIVATE_canonifyTarget","target","__PRIVATE_targetImpl","__PRIVATE_memoizedCanonicalId","canonicalId","f","__PRIVATE_canonifyFilter","o","__PRIVATE_canonifyOrderBy","field","dir","__PRIVATE_canonifyBound","__PRIVATE_stringifyTarget","__PRIVATE_stringifyFilter","op","__PRIVATE_stringifyOrderBy","__PRIVATE_targetEquals","__PRIVATE_orderByEquals","__PRIVATE_f1","__PRIVATE_f2","FieldFilter","__PRIVATE_valueEquals","__PRIVATE_boundEquals","__PRIVATE_isDocumentTarget","__PRIVATE_isDocumentKey","__PRIVATE_decodeBase64","__PRIVATE_encoded","fromCharCode","apply","base64","decodeStringToByteArray","__PRIVATE_ByteString","__PRIVATE_binaryString","array","__PRIVATE_binaryStringFromUint8Array","raw","charCodeAt","encodeByteArray","__PRIVATE_encodeBase64","buffer","__PRIVATE_uint8ArrayFromBinaryString","__PRIVATE_TargetData","targetId","__PRIVATE_purpose","sequenceNumber","__PRIVATE_snapshotVersion","lastLimboFreeSnapshotVersion","resumeToken","__PRIVATE_EMPTY_BYTE_STRING","ExistenceFilter","__PRIVATE_RpcCode","__PRIVATE_isPermanentError","__PRIVATE_mapCodeFromRpcCode","RpcCode","__PRIVATE_SortedMap","root","__PRIVATE_LLRBNode","EMPTY","__PRIVATE_insert","copy","__PRIVATE_BLACK","remove","node","cmp","__PRIVATE_prunedNodes","__PRIVATE_minKey","__PRIVATE_maxKey","action","__PRIVATE_inorderTraversal","__PRIVATE_descriptions","__PRIVATE_reverseTraversal","__PRIVATE_SortedMapIterator","__PRIVATE_startKey","__PRIVATE_isReverse","__PRIVATE_nodeStack","pop","result","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_SortedSet","data","__PRIVATE_elem","cb","range","__PRIVATE_iter","__PRIVATE_getIteratorFrom","__PRIVATE_hasNext","__PRIVATE_getNext","start","__PRIVATE_getIterator","__PRIVATE_SortedSetIterator","has","add","__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_EMPTY_DOCUMENT_KEY_SET","__PRIVATE_documentKeySet","keys","set","__PRIVATE_EMPTY_TARGET_ID_SET","__PRIVATE_targetIdSet","__PRIVATE_DocumentSet","__PRIVATE_comp","__PRIVATE_d1","__PRIVATE_d2","__PRIVATE_keyedMap","__PRIVATE_sortedSet","__PRIVATE_oldSet","doc","delete","__PRIVATE_thisDoc","__PRIVATE_otherDoc","__PRIVATE_docStrings","__PRIVATE_newSet","__PRIVATE_DocumentChangeSet","__PRIVATE_change","__PRIVATE_oldChange","__PRIVATE_changeMap","type","__PRIVATE_changes","__PRIVATE_ViewSnapshot","query","docs","__PRIVATE_oldDocs","docChanges","__PRIVATE_mutatedKeys","fromCache","__PRIVATE_syncStateChanged","__PRIVATE_excludesMetadataChanges","documents","__PRIVATE_emptySet","hasPendingWrites","__PRIVATE_queryEquals","__PRIVATE_otherChanges","__PRIVATE_RemoteEvent","__PRIVATE_targetChanges","__PRIVATE_targetMismatches","__PRIVATE_documentUpdates","__PRIVATE_resolvedLimboDocuments","Map","TargetChange","__PRIVATE_createSynthesizedTargetChangeForCurrentChange","__PRIVATE_addedDocuments","__PRIVATE_modifiedDocuments","__PRIVATE_removedDocuments","__PRIVATE_DocumentWatchChange","__PRIVATE_updatedTargetIds","removedTargetIds","__PRIVATE_newDoc","__PRIVATE_ExistenceFilterChange","__PRIVATE_existenceFilter","__PRIVATE_WatchTargetChange","state","targetIds","cause","__PRIVATE_TargetState","__PRIVATE_snapshotChangesMap","Ht","__PRIVATE__current","__PRIVATE__resumeToken","he","__PRIVATE_pendingResponses","ae","__PRIVATE__hasPendingChanges","__PRIVATE_approximateByteSize","__PRIVATE_documentChanges","__PRIVATE_changeType","__PRIVATE_WatchChangeAggregator","__PRIVATE_metadataProvider","__PRIVATE_documentTargetMap","__PRIVATE_docChange","Document","__PRIVATE_addDocumentToTarget","__PRIVATE_NoDocument","__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_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_targetMapping","__PRIVATE_targetActive","__PRIVATE_getTargetDataForTarget","__PRIVATE_isServerTimestamp","mapValue","fields","stringValue","__PRIVATE_getLocalWriteTime","__PRIVATE_localWriteTime","__PRIVATE_normalizeTimestamp","nanos","__PRIVATE_ISO_TIMESTAMP_REG_EXP","RegExp","__PRIVATE_typeOrder","__PRIVATE_leftType","booleanValue","timestampValue","__PRIVATE_leftTimestamp","__PRIVATE_rightTimestamp","__PRIVATE_timestampEquals","__PRIVATE_normalizeByteString","__PRIVATE_blobEquals","referenceValue","__PRIVATE_normalizeNumber","geoPointValue","latitude","longitude","__PRIVATE_geoPointEquals","integerValue","__PRIVATE_n1","__PRIVATE_n2","isNaN","__PRIVATE_numberEquals","arrayValue","values","__PRIVATE_leftMap","__PRIVATE_rightMap","__PRIVATE_objectEquals","__PRIVATE_arrayValueContains","__PRIVATE_haystack","__PRIVATE_needle","find","__PRIVATE_valueCompare","__PRIVATE_rightType","__PRIVATE_leftNumber","doubleValue","__PRIVATE_rightNumber","__PRIVATE_compareNumbers","__PRIVATE_compareTimestamps","__PRIVATE_leftBytes","__PRIVATE_rightBytes","__PRIVATE_compareTo","__PRIVATE_compareBlobs","__PRIVATE_leftPath","__PRIVATE_rightPath","__PRIVATE_leftSegments","__PRIVATE_rightSegments","__PRIVATE_comparison","__PRIVATE_compareReferences","__PRIVATE_compareGeoPoints","__PRIVATE_leftArray","__PRIVATE_rightArray","compare","__PRIVATE_compareArrays","__PRIVATE_leftKeys","__PRIVATE_rightKeys","sort","__PRIVATE_keyCompare","__PRIVATE_compareMaps","__PRIVATE_canonifyValue","__PRIVATE_normalizedTimestamp","__PRIVATE_canonifyTimestamp","toBase64","__PRIVATE_fromName","__PRIVATE_geoPoint","first","__PRIVATE_canonifyArray","__PRIVATE_sortedKeys","__PRIVATE_canonifyMap","__PRIVATE_fraction","exec","__PRIVATE_nanoStr","substr","__PRIVATE_parsedDate","blob","fromBase64String","fromUint8Array","__PRIVATE_refValue","isArray","__PRIVATE_isNullValue","__PRIVATE_isNanValue","__PRIVATE_isMapValue","__PRIVATE_DIRECTIONS","__PRIVATE_dirs","asc","desc","__PRIVATE_OPERATORS","__PRIVATE_ops","<","<=",">",">=","==","array-contains","in","array-contains-any","__PRIVATE_JsonProtoSerializer","__PRIVATE_useProto3Json","__PRIVATE_toInteger","__PRIVATE_toDouble","serializer","Infinity","__PRIVATE_toNumber","__PRIVATE_toTimestamp","toISOString","__PRIVATE_toBytes","toUint8Array","toVersion","version","fromVersion","__PRIVATE_fromTimestamp","__PRIVATE_toResourceName","__PRIVATE_fullyQualifiedPrefixPath","child","__PRIVATE_fromResourceName","__PRIVATE_resource","__PRIVATE_isValidResourceName","__PRIVATE_toName","__PRIVATE_extractLocalPathFromResourceName","__PRIVATE_toQueryPath","__PRIVATE_fromQueryPath","__PRIVATE_resourceName","__PRIVATE_emptyPath","__PRIVATE_getEncodedDatabaseId","__PRIVATE_toMutationDocument","proto","__PRIVATE_fromMaybeDocument","found","updateTime","__PRIVATE_ObjectValue","__PRIVATE_fromFound","missing","readTime","__PRIVATE_fromMissing","__PRIVATE_fromWatchChange","__PRIVATE_fromWatchTargetChangeState","targetChangeType","__PRIVATE_fromBytes","__PRIVATE_causeProto","status","__PRIVATE_fromRpcStatus","documentChange","__PRIVATE_entityChange","documentDelete","__PRIVATE_docDelete","documentRemove","__PRIVATE_docRemove","__PRIVATE_toMutation","__PRIVATE_mutation","__PRIVATE_SetMutation","update","__PRIVATE_DeleteMutation","__PRIVATE_PatchMutation","updateMask","__PRIVATE_toDocumentMask","__PRIVATE_fieldMask","__PRIVATE_TransformMutation","transform","fieldTransforms","__PRIVATE_fieldTransform","__PRIVATE_ServerTimestampTransform","fieldPath","setToServerValue","__PRIVATE_ArrayUnionTransformOperation","appendMissingElements","elements","__PRIVATE_ArrayRemoveTransformOperation","removeAllFromArray","__PRIVATE_NumericIncrementTransformOperation","increment","__PRIVATE_operand","__PRIVATE_toFieldTransform","__PRIVATE_VerifyMutation","verify","__PRIVATE_precondition","__PRIVATE_isNone","currentDocument","exists","__PRIVATE_toPrecondition","__PRIVATE_fromMutation","Precondition","__PRIVATE_none","__PRIVATE_fromPrecondition","paths","fieldPaths","__PRIVATE_FieldMask","__PRIVATE_fromServerFormat","__PRIVATE_fromDocumentMask","FieldTransform","__PRIVATE_fromFieldTransform","__PRIVATE_fromWriteResults","__PRIVATE_protos","commitTime","transformResults","__PRIVATE_MutationResult","__PRIVATE_fromWriteResult","__PRIVATE_toDocumentsTarget","__PRIVATE_toQueryTarget","structuredQuery","parent","from","allDescendants","__PRIVATE_popLast","__PRIVATE_lastSegment","where","unaryFilter","__PRIVATE_toFieldPathReference","fieldFilter","__PRIVATE_toUnaryOrFieldFilter","compositeFilter","__PRIVATE_toFilter","__PRIVATE_orderBys","order","__PRIVATE_toPropertyOrder","direction","__PRIVATE_toOrder","val","__PRIVATE_toInt32Proto","__PRIVATE_toCursor","__PRIVATE_fromQueryTarget","__PRIVATE_fromCount","__PRIVATE_filterBy","__PRIVATE_fromFilter","__PRIVATE_fromUnaryFilter","__PRIVATE_fromFieldFilter","reduce","__PRIVATE_accum","concat","__PRIVATE_fromPropertyOrder","__PRIVATE_OrderBy","__PRIVATE_fromFieldPathReference","__PRIVATE_fromDirection","__PRIVATE_fromInt32Proto","__PRIVATE_fromCursor","Query","__PRIVATE_toTarget","__PRIVATE_toListenRequestLabels","__PRIVATE_toLabel","goog-listen-tags","cursor","before","position","__PRIVATE_Bound","__PRIVATE_fieldReference","create","__PRIVATE_fromOperatorName","__PRIVATE_nanField","NaN","__PRIVATE_nullField","nullValue","__PRIVATE_canonicalFields","__PRIVATE_TransformOperation","__PRIVATE_applyTransformOperationToLocalView","previousValue","__type__","__local_write_time__","serverTimestamp","__PRIVATE_applyArrayUnionTransformOperation","__PRIVATE_applyArrayRemoveTransformOperation","__PRIVATE_baseValue","__PRIVATE_computeTransformOperationBaseValue","__PRIVATE_sum","asNumber","__PRIVATE_applyNumericIncrementTransformOperationToLocalView","__PRIVATE_applyTransformOperationToRemoteDocument","__PRIVATE_transformResult","__PRIVATE_isDouble","__PRIVATE_coercedFieldValuesArray","__PRIVATE_toUnion","some","element","__PRIVATE_toRemove","__PRIVATE_fieldMaskPath","__PRIVATE_isPrefixOf","__PRIVATE_l","r","__PRIVATE_fieldTransformEquals","__PRIVATE_transformOperationEquals","qe","__PRIVATE_preconditionIsValidForDocument","__PRIVATE_maybeDoc","__PRIVATE_Mutation","__PRIVATE_applyMutationToRemoteDocument","__PRIVATE_mutationResult","hasCommittedMutations","__PRIVATE_applySetMutationToRemoteDocument","__PRIVATE_UnknownDocument","__PRIVATE_newData","__PRIVATE_patchDocument","__PRIVATE_applyPatchMutationToRemoteDocument","__PRIVATE_requireDocument","__PRIVATE_baseDoc","__PRIVATE_serverTransformResults","__PRIVATE_transformObject","__PRIVATE_applyTransformMutationToRemoteDocument","__PRIVATE_applyDeleteMutationToRemoteDocument","__PRIVATE_applyMutationToLocalView","__PRIVATE_getPostMutationVersion","Ge","__PRIVATE_applySetMutationToLocalView","__PRIVATE_applyPatchMutationToLocalView","__PRIVATE_localTransformResults","__PRIVATE_applyTransformMutationToLocalView","__PRIVATE_applyDeleteMutationToLocalView","__PRIVATE_extractMutationBaseValue","__PRIVATE_baseObject","__PRIVATE_existingValue","__PRIVATE_coercedValue","__PRIVATE_ObjectValueBuilder","__PRIVATE_build","__PRIVATE_extractTransformMutationBaseValue","__PRIVATE_mutationEquals","empty","__PRIVATE_builder","newValue","__PRIVATE_patchObject","__PRIVATE_setOverlay","__PRIVATE_currentLevel","__PRIVATE_overlayMap","__PRIVATE_currentSegment","currentValue","__PRIVATE_mergedResult","__PRIVATE_applyOverlay","__PRIVATE_currentPath","__PRIVATE_currentOverlays","__PRIVATE_modified","__PRIVATE_resultAtPath","__PRIVATE_pathSegment","__PRIVATE_nested","__PRIVATE_extractFieldMask","__PRIVATE_nestedFields","__PRIVATE_nestedPath","__PRIVATE_MaybeDocument","__PRIVATE_objectValue","options","__PRIVATE_hasLocalMutations","__PRIVATE_explicitOrderBy","__PRIVATE_limitType","__PRIVATE_assertValidBound","__PRIVATE_memoizedOrderBy","__PRIVATE_inequalityField","__PRIVATE_getInequalityFilterField","__PRIVATE_firstOrderByField","__PRIVATE_getFirstOrderByField","__PRIVATE_isKeyField","__PRIVATE_keyField","__PRIVATE_foundKeyOrdering","__PRIVATE_lastDirection","__PRIVATE_newFilters","__PRIVATE_newOrderBy","bound","__PRIVATE_isInequality","__PRIVATE_operators","__PRIVATE_memoizedTarget","__PRIVATE_canonifyQuery","__PRIVATE_stringifyQuery","__PRIVATE_queryMatches","__PRIVATE_docPath","__PRIVATE_hasCollectionId","__PRIVATE_isImmediateParentOf","__PRIVATE_queryMatchesPathAndCollectionGroup","__PRIVATE_queryMatchesOrderBy","__PRIVATE_queryMatchesFilters","__PRIVATE_sortsBeforeDocument","__PRIVATE_queryMatchesBounds","__PRIVATE_newQueryComparator","__PRIVATE_comparedOnKeyField","__PRIVATE_compareDocs","__PRIVATE_KeyFieldInFilter","__PRIVATE_KeyFieldFilter","__PRIVATE_ArrayContainsFilter","__PRIVATE_InFilter","__PRIVATE_ArrayContainsAnyFilter","__PRIVATE_matchesComparison","p","__PRIVATE_orderByComponent","component","v1","v2","__PRIVATE_compareDocumentsByField","__PRIVATE_MutationBatch","batchId","baseMutations","mutations","__PRIVATE_docKey","__PRIVATE_batchResult","__PRIVATE_mutationResults","__PRIVATE_maybeDocs","__PRIVATE_mutatedDocuments","m","__PRIVATE_mutatedDocument","__PRIVATE_applyToLocalView","__PRIVATE_MutationBatchResult","batch","__PRIVATE_commitVersion","__PRIVATE_docVersions","results","__PRIVATE_versionMap","PersistencePromise","callback","__PRIVATE_isDone","__PRIVATE_nextCallback","__PRIVATE_catchCallback","__PRIVATE_nextFn","__PRIVATE_catchFn","__PRIVATE_callbackAttached","__PRIVATE_wrapFailure","__PRIVATE_wrapSuccess","resolve","reject","Promise","__PRIVATE_wrapUserFunction","all","__PRIVATE_resolvedCount","done","err","__PRIVATE_predicates","predicate","__PRIVATE_isTrue","collection","__PRIVATE_promises","__PRIVATE_waitFor","__PRIVATE_RemoteDocumentChangeBuffer","__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","__PRIVATE_PersistenceTransaction","listener","__PRIVATE_onCommittedListeners","__PRIVATE_LocalDocumentsView","__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_isDocumentQuery","__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_LocalViewChanges","__PRIVATE_addedKeys","__PRIVATE_removedKeys","__PRIVATE_viewSnapshot","__PRIVATE_ListenSequence","__PRIVATE_sequenceNumberSyncer","__PRIVATE_sequenceNumberHandler","__PRIVATE_setPreviousValue","__PRIVATE_writeNewSequenceNumber","__PRIVATE_writeSequenceNumber","__PRIVATE_externalPreviousValue","max","__PRIVATE_nextValue","__PRIVATE_Deferred","promise","__PRIVATE_ExponentialBackoff","__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","__PRIVATE_encodeResourcePath","__PRIVATE_encodeSeparator","__PRIVATE_encodeSegment","__PRIVATE_resultBuf","__PRIVATE_escapeChar","__PRIVATE_decodeResourcePath","__PRIVATE_lastReasonableEscapeIndex","__PRIVATE_segmentBuilder","__PRIVATE_currentPiece","substring","__PRIVATE_MemoryIndexManager","__PRIVATE_MemoryCollectionParentIndex","collectionPath","__PRIVATE_collectionParentIndex","parentPath","__PRIVATE_existingParents","__PRIVATE_added","__PRIVATE_IndexedDbIndexManager","__PRIVATE_collectionParentsCache","__PRIVATE_addOnCommittedListener","__PRIVATE_collectionParent","__PRIVATE_collectionParentsStore","put","__PRIVATE_parentPaths","IDBKeyRange","__PRIVATE_loadAll","__PRIVATE_entry","txn","__PRIVATE_IndexedDbPersistence","__PRIVATE_getStore","DbCollectionParent","store","LocalSerializer","__PRIVATE_remoteSerializer","__PRIVATE_fromDbRemoteDocument","__PRIVATE_localSerializer","__PRIVATE_remoteDoc","__PRIVATE_fromDocument","noDocument","__PRIVATE_fromSegments","__PRIVATE_fromDbTimestamp","unknownDocument","__PRIVATE_toDbRemoteDocument","__PRIVATE_dbReadTime","__PRIVATE_toDbTimestampKey","__PRIVATE_toProto","__PRIVATE_toDocument","DbRemoteDocument","__PRIVATE_toDbTimestamp","DbNoDocument","DbUnknownDocument","__PRIVATE_fromDbTimestampKey","__PRIVATE_dbTimestampKey","DbTimestamp","__PRIVATE_dbTimestamp","__PRIVATE_fromDbMutationBatch","__PRIVATE_dbBatch","localWriteTimeMs","__PRIVATE_fromDbTarget","__PRIVATE_dbTarget","__PRIVATE_documentsTarget","__PRIVATE_atPath","__PRIVATE_fromDocumentsTarget","lastListenSequenceNumber","__PRIVATE_toDbTarget","__PRIVATE_dbLastLimboFreeTimestamp","__PRIVATE_queryProto","DbTarget","__PRIVATE_IndexedDbRemoteDocumentCache","__PRIVATE_remoteDocumentsStore","__PRIVATE_dbKey","__PRIVATE_sizeDelta","getMetadata","metadata","byteSize","__PRIVATE_setMetadata","__PRIVATE_dbRemoteDoc","__PRIVATE_maybeDecodeDocument","Ys","__PRIVATE_dbDocumentSize","__PRIVATE_forEachDbEntry","__PRIVATE_sizeMap","Zs","ti","last","__PRIVATE_keyIter","__PRIVATE_nextKey","__PRIVATE_iterate","__PRIVATE_potentialKeyRaw","control","__PRIVATE_potentialKey","__PRIVATE_skip","__PRIVATE_immediateChildrenPathLength","__PRIVATE_iterationOptions","lowerBound","__PRIVATE_collectionKey","__PRIVATE_readTimeKey","collectionReadTimeIndex","__PRIVATE_changedDocs","__PRIVATE_lastReadTime","__PRIVATE_documentsStore","readTimeIndex","ii","reverse","__PRIVATE_trackRemovals","__PRIVATE_documentGlobalStore","DbRemoteDocumentGlobal","__PRIVATE_documentCache","__PRIVATE_collectionParents","__PRIVATE_previousSize","__PRIVATE_documentSizes","__PRIVATE_addEntry","__PRIVATE_deletedDoc","__PRIVATE_removeEntry","__PRIVATE_addToCollectionParentIndex","updateMetadata","__PRIVATE_getSizedEntry","__PRIVATE_getResult","__PRIVATE_getSizedEntries","__PRIVATE_maybeDocuments","__PRIVATE_TargetIdGenerator","__PRIVATE_lastId","__PRIVATE_IndexedDbTargetCache","__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_removeTargetData","__PRIVATE_globalTargetStore","DbTargetGlobal","updated","NEGATIVE_INFINITY","POSITIVE_INFINITY","queryTargetsIndexName","__PRIVATE_documentTargetStore","DbTargetDocument","__PRIVATE_addReference","__PRIVATE_removeReference","xi","documentTargetsIndex","__PRIVATE_PRIMARY_LEASE_EXCLUSIVE_ERROR_MSG","__PRIVATE_IndexedDbTransaction","__PRIVATE_simpleDbTransaction","__PRIVATE_currentSequenceNumber","allowTabSynchronization","clientId","__PRIVATE_lruParams","window","__PRIVATE_forceOwningTab","__PRIVATE_isAvailable","__PRIVATE_IndexedDbLruDelegate","__PRIVATE_dbName","__PRIVATE_targetCache","localStorage","__PRIVATE_webStorage","__PRIVATE_SimpleDb","__PRIVATE_openOrCreate","SCHEMA_VERSION","SchemaConverter","then","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_enqueueRetryable","__PRIVATE_canActAsPrimary","__PRIVATE_releasePrimaryLeaseIfHeld","__PRIVATE_acquireOrExtendPrimaryLease","__PRIVATE_isIndexedDbTransactionError","__PRIVATE_primaryClientStore","DbPrimaryClient","__PRIVATE_primaryClient","__PRIVATE_isLocalClient","__PRIVATE_isWithinAge","__PRIVATE_lastGarbageCollectionTime","__PRIVATE_inactiveClients","__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","or","user","__PRIVATE_IndexedDbMutationQueue","__PRIVATE_forUser","mode","__PRIVATE_transactionOperation","__PRIVATE_simpleDbMode","__PRIVATE_persistenceTransaction","ALL_STORES","__PRIVATE_simpleDbTxn","__PRIVATE_INVALID","__PRIVATE_holdsPrimaryLease","__PRIVATE_verifyAllowTabSynchronization","__PRIVATE_raiseOnCommittedEvent","__PRIVATE_newPrimary","__PRIVATE_maxAgeMs","addEventListener","__PRIVATE_documentVisibilityHandler","visibilityState","removeEventListener","__PRIVATE_windowUnloadHandler","__PRIVATE_shutdown","__PRIVATE_isZombied","getItem","setItem","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","userId","__PRIVATE_mutationQueueContainsKey","__PRIVATE_containsKey","__PRIVATE_mutationQueuesContainKey","__PRIVATE_changeBuffer","__PRIVATE_getRemoteDocumentCache","__PRIVATE_newChangeBuffer","__PRIVATE_documentCount","__PRIVATE_isPinned","__PRIVATE_withSequenceNumber","__PRIVATE_updateTargetData","__PRIVATE_nextPath","__PRIVATE_nextToReport","__PRIVATE_getSize","__PRIVATE_sentinelRow","__PRIVATE_indexedDbStoragePrefix","__PRIVATE_isDefaultDatabase","uid","__PRIVATE_isAuthenticated","__PRIVATE_mutationsStore","DbMutationBatch","userMutationsIndex","__PRIVATE_documentStore","__PRIVATE_documentMutationsStore","__PRIVATE_mutationStore","__PRIVATE_serializedBaseMutations","__PRIVATE_serializedMutations","__PRIVATE_toDbMutationBatch","__PRIVATE_indexKey","DbDocumentMutation","PLACEHOLDER","__PRIVATE_documentKeysByBatchId","__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","__PRIVATE_createPrimaryClientStore","autoIncrement","createIndex","userMutationsKeyPath","unique","__PRIVATE_createMutationQueue","__PRIVATE_createQueryCache","__PRIVATE_createRemoteDocumentCache","deleteObjectStore","__PRIVATE_dropQueryCache","__PRIVATE_globalStore","__PRIVATE_writeEmptyTargetGlobalEntry","__PRIVATE_existingMutations","__PRIVATE_v3MutationsStore","__PRIVATE_writeAll","__PRIVATE_upgradeMutationBatchSchemaAndMigrateData","__PRIVATE_createClientMetadataStore","removeAcknowledgedMutations","__PRIVATE_createDocumentGlobalStore","addDocumentGlobal","ensureSequenceNumbers","createCollectionParentIndex","objectStoreNames","contains","__PRIVATE_dropRemoteDocumentChangesStore","__PRIVATE_remoteDocumentStore","objectStore","readTimeIndexPath","collectionReadTimeIndexPath","__PRIVATE_createRemoteDocumentReadTimeIndex","rewriteCanonicalIds","__PRIVATE_byteCount","__PRIVATE_queuesStore","__PRIVATE_queues","lastAcknowledgedBatchId","__PRIVATE_docSentinelKey","__PRIVATE_sentinelKey","__PRIVATE_maybeSentinel","cache","__PRIVATE_pathSegments","__PRIVATE_targetStore","__PRIVATE_originalDbTarget","__PRIVATE_originalTargetData","__PRIVATE_updatedDbTarget","lastStreamToken","documentTargetsKeyPath","queryTargetsKeyPath","__PRIVATE_getIOSVersion","getUA","__PRIVATE_schemaConverter","request","indexedDB","open","onsuccess","onblocked","onerror","onupgradeneeded","oldVersion","createOrUpgrade","__PRIVATE_toPromise","__PRIVATE_wrapRequest","deleteDatabase","__PRIVATE_isMockPersistence","__PRIVATE_ua","__PRIVATE_iOSVersion","__PRIVATE_isUnsupportedIOS","__PRIVATE_androidVersion","__PRIVATE_getAndroidVersion","__PRIVATE_isUnsupportedAndroid","process","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_IterationController","__PRIVATE_dbCursor","$n","__PRIVATE_shouldStop","wo","__PRIVATE_IndexedDbTransactionError","oncomplete","__PRIVATE_completionDeferred","onabort","__PRIVATE_checkForAndReportiOSError","lo","aborted","__PRIVATE_storeName","__PRIVATE_SimpleDbStore","__PRIVATE_keyOrValue","__PRIVATE_indexOrRange","__PRIVATE_iterateCursor","__PRIVATE_keysOnly","__PRIVATE_optionsOrCallback","__PRIVATE_cursorRequest","primaryKey","__PRIVATE_shouldContinue","continue","controller","__PRIVATE_userResult","__PRIVATE_userPromise","__PRIVATE_skipToKey","__PRIVATE_indexName","openKeyCursor","openCursor","__PRIVATE_reportedIOSError","__PRIVATE_IOS_ERROR","__PRIVATE_newError","setTimeout","__PRIVATE_getWindow","__PRIVATE_DelayedOperation","__PRIVATE_asyncQueue","__PRIVATE_targetTimeMs","__PRIVATE_removalCallback","__PRIVATE_deferred","bind","__PRIVATE_delayMs","__PRIVATE_targetTime","__PRIVATE_delayedOp","__PRIVATE_timerHandle","__PRIVATE_handleDelayElapsed","clearTimeout","__PRIVATE_AsyncQueue","__PRIVATE_backoff","__PRIVATE_skipBackoff","__PRIVATE_visibilityHandler","xo","__PRIVATE__isShuttingDown","enqueue","__PRIVATE_verifyNotFailed","__PRIVATE_enqueueInternal","__PRIVATE_enqueueEvenAfterShutdown","__PRIVATE_retryableOps","__PRIVATE_retryNextOp","shift","__PRIVATE_backoffAndRun","__PRIVATE_newTail","__PRIVATE_tail","__PRIVATE_operationInProgress","stack","includes","__PRIVATE_getMessageOrStack","__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_RollingSequenceNumberBuffer","__PRIVATE_maxElements","__PRIVATE_previousIndex","__PRIVATE_nextIndex","__PRIVATE_highestValue","maxValue","__PRIVATE_GC_DID_NOT_RUN","Zo","th","eh","nh","__PRIVATE_LruParams","__PRIVATE_cacheSizeCollectionThreshold","__PRIVATE_percentileToCollect","__PRIVATE_maximumSequenceNumbersToCollect","__PRIVATE_cacheSize","__PRIVATE_DEFAULT_COLLECTION_PERCENTILE","__PRIVATE_DEFAULT_MAX_SEQUENCE_NUMBERS_TO_COLLECT","__PRIVATE_DEFAULT_CACHE_SIZE_BYTES","__PRIVATE_COLLECTION_DISABLED","__PRIVATE_LruScheduler","__PRIVATE_gcTask","__PRIVATE_localStore","__PRIVATE_scheduleGC","delay","__PRIVATE_hasRun","__PRIVATE_collectGarbage","__PRIVATE_ignoreIfPrimaryLeaseLoss","__PRIVATE_delegate","__PRIVATE_percentile","__PRIVATE_getSequenceNumberCount","__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","__PRIVATE_LocalStoreImpl","persistence","__PRIVATE_queryEngine","__PRIVATE_initialUser","t","__PRIVATE_getMutationQueue","__PRIVATE_remoteDocuments","__PRIVATE_localDocuments","__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","Fh","Nh","$h","__PRIVATE_existingDocs","__PRIVATE_addMutationBatch","__PRIVATE_applyToLocalDocumentSet","Un","__PRIVATE_affected","__PRIVATE_documentBuffer","ai","__PRIVATE_applyWriteToRemoteDocuments","__PRIVATE_performConsistencyCheck","__PRIVATE_affectedKeys","__PRIVATE_getHighestUnacknowledgedBatchId","__PRIVATE_getLastRemoteSnapshotVersion","__PRIVATE_remoteVersion","__PRIVATE_newTargetDataByTargetMap","__PRIVATE_targetDataByTarget","__PRIVATE_oldTargetData","__PRIVATE_removeMatchingKeys","__PRIVATE_addMatchingKeys","__PRIVATE_newTargetData","__PRIVATE_withResumeToken","__PRIVATE_shouldPersistTargetData","__PRIVATE_updatedKeys","__PRIVATE_existingDoc","__PRIVATE_updateLimboDocument","__PRIVATE_updateRemoteVersion","__PRIVATE_setTargetsMetadata","__PRIVATE_toMicroseconds","__PRIVATE_RESUME_TOKEN_MAX_AGE_MICROS","__PRIVATE_viewChanges","__PRIVATE_viewChange","__PRIVATE_updatedTargetData","__PRIVATE_withLastLimboFreeSnapshotVersion","__PRIVATE_afterBatchId","__PRIVATE_getNextMutationBatchAfterBatchId","__PRIVATE_getTargetData","__PRIVATE_cached","__PRIVATE_allocateTargetId","__PRIVATE_addTargetData","__PRIVATE_cachedTargetData","__PRIVATE_targetIdByTarget","__PRIVATE_keepPersistedTargetData","__PRIVATE_usePreviousResults","__PRIVATE_remoteKeys","__PRIVATE_getMatchingKeysForTargetId","zh","__PRIVATE_docKeys","__PRIVATE_promiseChain","__PRIVATE_ackVersion","__PRIVATE_applyToRemoteDocument","__PRIVATE_collect","__PRIVATE_newLocalStore","__PRIVATE_MultiTabLocalStoreImpl","__PRIVATE_synchronizeLastDocumentChangeReadTime","__PRIVATE_lookupMutationKeys","__PRIVATE_setNetworkEnabled","__PRIVATE_getActiveClients","__PRIVATE_getNewDocumentChanges","__PRIVATE_lastDocumentChangeReadTime","__PRIVATE_getLastReadTime","__PRIVATE_ReferenceSet","__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_validateOptionalArrayElements","__PRIVATE_typeDescription","__PRIVATE_validator","Array","__PRIVATE_valueDescription","__PRIVATE_validateArrayElements","__PRIVATE_validateNamedOptionalPropertyEquals","__PRIVATE_inputName","input","__PRIVATE_expected","__PRIVATE_expectedDescription","__PRIVATE_actualDescription","__PRIVATE_validateNamedPropertyEquals","__PRIVATE_validateStringEnum","__PRIVATE_enums","valid","__PRIVATE_isPlainObject","description","getPrototypeOf","__PRIVATE_customObjectName","__PRIVATE_tryGetCustomObjectType","__PRIVATE_validateDefined","__PRIVATE_validateOptionNames","__PRIVATE_optionNames","__PRIVATE_invalidClassError","__PRIVATE_validatePositiveNumber","num","__PRIVATE_assertUint8ArrayAvailable","Blob","__PRIVATE_byteString","__PRIVATE__byteString","arguments","__PRIVATE_BaseFieldPath","fieldNames","__PRIVATE_minNumberOfElements","__PRIVATE_validateNamedArrayAtLeastNumberOfElements","__PRIVATE__internalPath","__PRIVATE_InternalFieldPath","__PRIVATE_RESERVED","__PRIVATE_SerializableFieldValue","__PRIVATE_DeleteFieldValueImpl","__PRIVATE__methodName","context","__PRIVATE_dataSource","__PRIVATE_createError","__PRIVATE_createSentinelChildContext","__PRIVATE_fieldValue","__PRIVATE_arrayElement","__PRIVATE_ParseContext","wa","Ea","settings","__PRIVATE_targetDoc","methodName","Ia","ignoreUndefinedProperties","__PRIVATE_ServerTimestampFieldValueImpl","__PRIVATE_ArrayUnionFieldValueImpl","__PRIVATE__elements","__PRIVATE_parseContext","__PRIVATE_parsedElements","__PRIVATE_parseData","arrayUnion","__PRIVATE_ArrayRemoveFieldValueImpl","__PRIVATE_NumericIncrementFieldValueImpl","__PRIVATE__operand","__PRIVATE_numericIncrement","FieldValue","__PRIVATE_FieldValueDelegate","__PRIVATE__delegate","__PRIVATE__toFieldTransform","GeoPoint","isFinite","__PRIVATE__lat","__PRIVATE__long","__PRIVATE_newSerializer","__PRIVATE_RESERVED_FIELD_REGEX","__PRIVATE_DocumentKeyReference","__PRIVATE__databaseId","__PRIVATE__key","__PRIVATE__converter","__PRIVATE_ParsedSetData","__PRIVATE_ParsedUpdateData","__PRIVATE_isWrite","__PRIVATE_validatePath","configuration","__PRIVATE_childPath","__PRIVATE_contextWith","__PRIVATE_validatePathSegment","__PRIVATE_hasConverter","__PRIVATE_UserDataReader","Na","__PRIVATE_parseSetData","__PRIVATE_userDataReader","__PRIVATE_createContext","merge","mergeFields","__PRIVATE_validatePlainObject","__PRIVATE_updateData","__PRIVATE_parseObject","__PRIVATE_validatedFieldPaths","__PRIVATE_stringOrFieldPath","__PRIVATE_fieldPathFromDotSeparatedString","__PRIVATE_fieldMaskContains","__PRIVATE_covers","__PRIVATE_parseUpdateData","__PRIVATE_fieldMaskPaths","__PRIVATE_childContext","__PRIVATE_childContextForFieldPath","__PRIVATE_parsedValue","mask","__PRIVATE_parseUpdateVarargs","moreFieldsAndValues","__PRIVATE_fieldPathFromArgument","__PRIVATE_parseQueryValue","__PRIVATE_allowArrays","__PRIVATE_looksLikeJsonObject","__PRIVATE_parseSentinelFieldValue","__PRIVATE_entryIndex","__PRIVATE_parsedEntry","__PRIVATE_childContextForArray","__PRIVATE_parseArray","fromDate","bytesValue","__PRIVATE_thisDb","__PRIVATE_otherDb","__PRIVATE_parseScalarValue","__PRIVATE_childContextForField","search","__PRIVATE_fromDotSeparatedString","__PRIVATE_hasPath","__PRIVATE_hasDocument","User","__PRIVATE_otherUser","__PRIVATE_OAuthToken","__PRIVATE_authHeaders","__PRIVATE_EmptyCredentialsProvider","__PRIVATE_changeListener","__PRIVATE_FirebaseCredentialsProvider","__PRIVATE_authProvider","__PRIVATE_tokenListener","__PRIVATE_tokenCounter","currentUser","__PRIVATE_getUser","__PRIVATE_receivedInitialUser","auth","getImmediate","optional","addAuthTokenListener","__PRIVATE_initialTokenCounter","forceRefresh","getToken","__PRIVATE_tokenData","accessToken","removeAuthTokenListener","__PRIVATE_currentUid","getUid","__PRIVATE_FirstPartyToken","__PRIVATE_gapi","__PRIVATE_sessionIndex","__PRIVATE_FIRST_PARTY","Oa","headers","X-Goog-AuthUser","__PRIVATE_authHeader","__PRIVATE_getAuthHeaderValueForFirstParty","__PRIVATE_FirstPartyCredentialsProvider","__PRIVATE_PersistentStream","__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","__PRIVATE_PersistentListenStream","credentials","__PRIVATE_openStream","__PRIVATE_watchChangeProto","snapshot","__PRIVATE_versionFromListenResponse","__PRIVATE_onWatchChange","addTarget","labels","__PRIVATE_sendRequest","__PRIVATE_PersistentWriteStream","Ru","__PRIVATE_handshakeComplete_","__PRIVATE_writeMutations","__PRIVATE_responseProto","streamToken","writeResults","__PRIVATE_onMutationResult","__PRIVATE_onHandshakeComplete","writes","__PRIVATE_DatastoreImpl","__PRIVATE_terminated","__PRIVATE_rpcName","__PRIVATE_verifyNotTerminated","__PRIVATE_invokeRPC","__PRIVATE_invokeStreamingRPC","Transaction","__PRIVATE_datastore","Set","__PRIVATE_ensureCommitNotCalled","__PRIVATE_datastoreImpl","response","__PRIVATE_invokeBatchGetDocumentsRpc","__PRIVATE_recordVersion","write","__PRIVATE_toMutations","__PRIVATE_writtenDocs","__PRIVATE_preconditionForUpdate","__PRIVATE_lastWriteError","__PRIVATE_unwritten","__PRIVATE_readVersions","__PRIVATE_invokeCommitRpc","__PRIVATE_committed","__PRIVATE_docVersion","__PRIVATE_existingVersion","__PRIVATE_OnlineStateTracker","__PRIVATE_onlineStateHandler","__PRIVATE_watchStreamFailures","__PRIVATE_setAndBroadcast","__PRIVATE_onlineStateTimer","__PRIVATE_logClientOfflineWarningIfNecessary","__PRIVATE_clearOnlineStateTimer","__PRIVATE_newState","__PRIVATE_shouldWarnClientIsOffline","details","__PRIVATE_RemoteStore","__PRIVATE_connectivityMonitor","__PRIVATE_addCallback","__PRIVATE_canUseNetwork","__PRIVATE_restartNetwork","__PRIVATE_onlineStateTracker","__PRIVATE_watchStream","__PRIVATE_newPersistentWatchStream","wu","__PRIVATE_onWatchStreamOpen","cu","__PRIVATE_onWatchStreamClose","Eu","__PRIVATE_onWatchStreamChange","__PRIVATE_writeStream","__PRIVATE_newPersistentWriteStream","__PRIVATE_onWriteStreamOpen","__PRIVATE_onWriteStreamClose","gu","__PRIVATE_onWriteHandshakeComplete","Vu","enableNetwork","__PRIVATE_offlineCauses","__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_handleWatchStreamStart","__PRIVATE_handleWatchStreamFailure","__PRIVATE_handleTargetError","__PRIVATE_disableNetworkUntilRecovery","__PRIVATE_handleDocumentChange","__PRIVATE_handleExistenceFilter","__PRIVATE_handleTargetChange","__PRIVATE_raiseWatchSnapshot","__PRIVATE_createRemoteEvent","__PRIVATE_requestTargetData","__PRIVATE_applyRemoteEvent","__PRIVATE_rejectListen","__PRIVATE_lastBatchIdRetrieved","__PRIVATE_canAddToWritePipeline","__PRIVATE_nextMutationBatch","__PRIVATE_addToWritePipeline","__PRIVATE_shouldStartWriteStream","__PRIVATE_startWriteStream","__PRIVATE_handshakeComplete","__PRIVATE_writeHandshake","__PRIVATE_executeWithRecovery","__PRIVATE_applySuccessfulWrite","__PRIVATE_handleWriteError","__PRIVATE_inhibitBackoff","__PRIVATE_rejectFailedWrite","__PRIVATE_verifyOperationInProgress","__PRIVATE_handleCredentialChange","createWebStorageClientStateKey","createWebStorageMutationBatchKey","__PRIVATE_mutationKey","createWebStorageQueryTargetMetadataKey","__PRIVATE_MutationMetadata","__PRIVATE_mutationBatch","parse","__PRIVATE_validData","__PRIVATE_firestoreError","__PRIVATE_batchMetadata","__PRIVATE_QueryTargetMetadata","__PRIVATE_RemoteClientState","__PRIVATE_clientState","__PRIVATE_activeTargetIdsSet","__PRIVATE_SharedOnlineState","onlineState","__PRIVATE_LocalClientState","__PRIVATE_WebStorageSharedClientState","__PRIVATE_localClientId","__PRIVATE_handleWebStorageEvent","__PRIVATE_escapedPersistenceKey","storage","__PRIVATE_localClientStorageKey","__PRIVATE_sequenceNumberKey","createWebStorageSequenceNumberKey","__PRIVATE_activeClients","__PRIVATE_clientStateKeyRe","__PRIVATE_mutationBatchKeyRe","__PRIVATE_queryTargetKeyRe","__PRIVATE_onlineStateKey","createWebStorageOnlineStateKey","__PRIVATE_storageListener","__PRIVATE_storageItem","__PRIVATE_fromWebStorageEntry","__PRIVATE_persistClientState","__PRIVATE_onlineStateJSON","__PRIVATE_fromWebStorageOnlineState","__PRIVATE_handleOnlineStateEvent","__PRIVATE_earlyEvents","__PRIVATE_extractActiveQueryTargets","__PRIVATE_persistMutationState","__PRIVATE_removeMutationState","__PRIVATE_queryState","__PRIVATE_isActiveQueryTarget","__PRIVATE_localClientState","__PRIVATE_addQueryTarget","__PRIVATE_removeQueryTarget","__PRIVATE_persistQueryTargetState","__PRIVATE_addPendingMutation","__PRIVATE_persistOnlineState","__PRIVATE_storageEvent","storageArea","__PRIVATE_fromWebStorageClientStateKey","__PRIVATE_handleClientStateEvent","__PRIVATE_fromWebStorageClientState","__PRIVATE_mutationMetadata","__PRIVATE_fromWebStorageMutationMetadata","__PRIVATE_handleMutationBatchEvent","__PRIVATE_queryTargetMetadata","__PRIVATE_fromWebStorageQueryTargetMetadata","__PRIVATE_handleQueryTargetEvent","__PRIVATE_seqString","__PRIVATE_parsed","__PRIVATE_fromWebStorageSequenceNumber","cl","__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_MemorySharedClientState","__PRIVATE_localState","__PRIVATE_AddedLimboDocument","__PRIVATE_RemovedLimboDocument","__PRIVATE_View","__PRIVATE__syncedDocuments","__PRIVATE_docComparator","__PRIVATE_documentSet","kl","__PRIVATE_previousChanges","__PRIVATE_changeSet","__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","$l","Ml","Ll","Lt","__PRIVATE_updateLimboDocuments","__PRIVATE_getChanges","__PRIVATE_c1","__PRIVATE_c2","__PRIVATE_compareChangeType","__PRIVATE_applyTargetChange","__PRIVATE_limboChanges","__PRIVATE_newSyncState","__PRIVATE_limboDocuments","__PRIVATE_syncState","Ul","__PRIVATE_oldLimboDocuments","__PRIVATE_shouldBeInLimbo","__PRIVATE_queryResult","__PRIVATE_computeDocChanges","__PRIVATE_fromInitialDocuments","__PRIVATE_TransactionRunner","updateFunction","__PRIVATE_runWithBackOff","__PRIVATE_tryRunUpdateFunction","commit","__PRIVATE_commitError","__PRIVATE_handleTransactionError","__PRIVATE_userPromiseError","__PRIVATE_retries","__PRIVATE_isRetryableTransactionError","__PRIVATE_QueryView","view","__PRIVATE_LimboResolution","__PRIVATE_SyncEngineImpl","__PRIVATE_remoteStore","__PRIVATE_sharedClientState","__PRIVATE_maxConcurrentLimboResolutions","q","__PRIVATE_forSyncEngine","__","__PRIVATE_syncEngineListener","__PRIVATE_assertSubscribed","__PRIVATE_queryView","__PRIVATE_queryViewsByQuery","__PRIVATE_addLocalQueryTarget","__PRIVATE_computeInitialSnapshot","__PRIVATE_allocateTarget","__PRIVATE_initializeViewAndComputeSnapshot","__PRIVATE_isPrimaryClient","listen","__PRIVATE_executeQuery","__PRIVATE_viewDocChanges","__PRIVATE_synthesizedTargetChange","__PRIVATE_updateTrackedLimbos","__PRIVATE_queriesByTarget","__PRIVATE_queries","__PRIVATE_removeLocalQueryTarget","__PRIVATE_releaseTarget","__PRIVATE_clearQueryState","__PRIVATE_unlisten","__PRIVATE_removeAndCleanupTarget","__PRIVATE_userCallback","__PRIVATE_localWrite","__PRIVATE_addMutationCallback","__PRIVATE_emitNewSnapsAndNotifyLocalStore","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_acknowledgeBatch","__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_newSnaps","__PRIVATE_docChangesInAllViews","__PRIVATE_queriesProcessed","__PRIVATE_fromSnapshot","__PRIVATE_notifyLocalViewChanges","__PRIVATE_fnName","__PRIVATE_handleUserChange","__PRIVATE_rejectOutstandingPendingWritesCallbacks","disableNetwork","__PRIVATE_keySet","__PRIVATE_syncedDocuments","__PRIVATE_newSyncEngine","__PRIVATE_MultiTabSyncEngineImpl","__PRIVATE__isPrimaryClient","__PRIVATE_synchronizeWithPersistedState","__PRIVATE_setOnlineState","__PRIVATE_batchState","__PRIVATE_lookupMutationDocuments","__PRIVATE_removeCachedMutationBatchMetadata","__PRIVATE_getAllActiveQueryTargets","__PRIVATE_activeQueries","__PRIVATE_synchronizeQueryViewsAndRaiseSnapshots","__PRIVATE_applyPrimaryState","__PRIVATE_isLocalQueryTarget","__PRIVATE_resetLimboDocuments","__PRIVATE_removeAllReferences","__PRIVATE_transitionToPrimary","__PRIVATE_synchronizeViewAndComputeSnapshot","__PRIVATE_getTarget","__PRIVATE_synthesizeTargetToQuery","__PRIVATE_synthesizedRemoteEvent","__PRIVATE_createSynthesizedRemoteEventForCurrentChange","__PRIVATE_removed","__PRIVATE_QueryListenersInfo","__PRIVATE_EventManager","subscribe","__PRIVATE_firstListen","__PRIVATE_queryInfo","__PRIVATE_viewSnap","onError","listeners","__PRIVATE_onViewSnapshot","__PRIVATE_raiseSnapshotsInSyncEvent","__PRIVATE_lastListen","__PRIVATE_viewSnaps","__PRIVATE_raisedEvent","observer","__PRIVATE_snapshotsInSyncListeners","__PRIVATE_QueryListener","__PRIVATE_queryObserver","__PRIVATE_snap","includeMetadataChanges","__PRIVATE_raisedInitialEvent","__PRIVATE_shouldRaiseEvent","__PRIVATE_shouldRaiseInitialEvent","__PRIVATE_raiseInitialEvent","__PRIVATE_maybeOnline","__PRIVATE_waitForSyncWhenOnline","__PRIVATE_hasPendingWritesChanged","__PRIVATE_IndexFreeQueryEngine","__PRIVATE_localDocumentsView","__PRIVATE_matchesAllDocuments","__PRIVATE_executeFullCollectionScan","__PRIVATE_previousResults","__PRIVATE_applyQuery","__PRIVATE_updatedResults","__PRIVATE_sortedPreviousResults","__PRIVATE_limboFreeSnapshotVersion","__PRIVATE_docAtLimitEdge","__PRIVATE_MemoryMutationQueue","__PRIVATE_batchesByDocumentKey","__PRIVATE_findMutationBatch","__PRIVATE_rawIndex","__PRIVATE_indexOfBatchId","__PRIVATE_findMutationBatches","prefix","__PRIVATE_startPath","__PRIVATE_rowKeyPath","__PRIVATE_indexOfExistingBatchId","__PRIVATE_references","__PRIVATE_MemoryRemoteDocumentCache","__PRIVATE_sizer","__PRIVATE_currentSize","iterator","__PRIVATE_MemoryTargetCache","__PRIVATE_forTargetCache","__PRIVATE_highestSequenceNumber","__PRIVATE_removals","__PRIVATE_addReferences","__PRIVATE_removeReferences","__PRIVATE_matchingKeys","__PRIVATE_referencesForId","__PRIVATE_MemoryPersistence","__PRIVATE_referenceDelegateFactory","__PRIVATE_documentSize","__PRIVATE_mutationQueues","__PRIVATE_MemoryTransaction","__PRIVATE_onTransactionStarted","__PRIVATE_onTransactionCommitted","__PRIVATE_or","__PRIVATE_MemoryEagerDelegate","Af","__PRIVATE__orphanedDocuments","__PRIVATE_localViewReferences","__PRIVATE_orphanedDocuments","__PRIVATE_isReferenced","__PRIVATE_StreamBridge","__PRIVATE_sendFn","__PRIVATE_closeFn","__PRIVATE_wrappedOnOpen","__PRIVATE_wrappedOnClose","__PRIVATE_wrappedOnMessage","__PRIVATE_RPC_NAME_REST_MAPPING","BatchGetDocuments","Commit","__PRIVATE_X_GOOG_API_CLIENT_VALUE","__PRIVATE_WebChannelConnection","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_mapCodeFromHttpResponseErrorStatus","__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","Pf","Vf","__PRIVATE_unguardedEventListen","param","WebChannel","OPEN","CLOSE","__PRIVATE_callOnClose","WARN","warn","__PRIVATE_logWarn","MESSAGE","__PRIVATE_msgData","__PRIVATE_msgDataOrError","__PRIVATE_mapCodeFromRpcStatus","__PRIVATE_callOnMessage","__PRIVATE_callOnOpen","__PRIVATE_urlRpcName","__PRIVATE_BrowserConnectivityMonitor","__PRIVATE_onNetworkAvailable","__PRIVATE_onNetworkUnavailable","__PRIVATE_configureNetworkMonitoring","__PRIVATE_networkAvailableListener","__PRIVATE_networkUnavailableListener","__PRIVATE_NoopConnectivityMonitor","__PRIVATE_MEMORY_ONLY_PERSISTENCE_ERROR_MESSAGE","__PRIVATE_MemoryComponentProvider","__PRIVATE_cfg","__PRIVATE_createSharedClientState","__PRIVATE_createPersistence","__PRIVATE_gcScheduler","__PRIVATE_createGarbageCollectionScheduler","__PRIVATE_createLocalStore","__PRIVATE_createRemoteStore","__PRIVATE_createSyncEngine","__PRIVATE_eventManager","__PRIVATE_createEventManager","__PRIVATE_persistenceSettings","__PRIVATE_durable","__PRIVATE_factory","__PRIVATE_IndexedDbComponentProvider","__PRIVATE_databaseInfo","synchronizeTabs","__PRIVATE_withCacheSize","cacheSizeBytes","__PRIVATE_indexedDbClearPersistence","__PRIVATE_MultiTabIndexedDbComponentProvider","initialize","__PRIVATE_setPrimaryStateListener","__PRIVATE_FirestoreClient","__PRIVATE_newId","__PRIVATE_componentProvider","__PRIVATE_initializationDone","__PRIVATE_persistenceResult","__PRIVATE_initialized","__PRIVATE_setChangeListener","__PRIVATE_initializeComponents","__PRIVATE_newDatastore","mo","Jf","Du","zf","e_","Yf","__PRIVATE_eventMgr","__PRIVATE_setDatabaseDeletedListener","terminate","__PRIVATE_canFallback","console","Hf","DOMException","__PRIVATE_isShuttingDown","__PRIVATE_enqueueAndInitiateShutdown","__PRIVATE_removeChangeListener","__PRIVATE_registerPendingWritesCallback","__PRIVATE_clientTerminated","__PRIVATE_readDocument","__PRIVATE_addSnapshotsInSyncListener","__PRIVATE_removeSnapshotsInSyncListener","ed","__PRIVATE_AsyncObserver","__PRIVATE_scheduleEvent","muted","eventHandler","__PRIVATE_isPartialObserver","__PRIVATE_methods","object","method","__PRIVATE_implementsAnyMethods","__PRIVATE_UserDataWriter","timestampsInSnapshots","__PRIVATE_serverTimestampBehavior","__PRIVATE_referenceFactory","__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_FirestoreSettings","__PRIVATE_MINIMUM_CACHE_SIZE_BYTES","experimentalForceLongPolling","Firestore","__PRIVATE_databaseIdOrApp","__PRIVATE_ensureClientConfigured","__PRIVATE__firestoreClient","app","__PRIVATE__firebaseApp","__PRIVATE_databaseIdFromApp","__PRIVATE__persistenceKey","__PRIVATE__credentials","external","__PRIVATE__componentProvider","__PRIVATE__settings","pd","__PRIVATE__userDataReader","__PRIVATE_settingsLiteral","__PRIVATE_newSettings","__PRIVATE_makeCredentialsProvider","experimentalForceOwningTab","experimentalTabSynchronization","__PRIVATE_configureClient","qi","__PRIVATE__queue","__PRIVATE_enqueueAndForgetEvenAfterShutdown","clearPersistence","_removeServiceInstance","Dd","waitForPendingWrites","arg","__PRIVATE_makeDatabaseInfo","__PRIVATE_pathString","CollectionReference","DocumentReference","__PRIVATE_forPath","__PRIVATE_InternalQuery","WriteBatch","SILENT","INFO","VERBOSE","level","__PRIVATE_newLevel","setLogLevel","__PRIVATE_firestoreClient","__PRIVATE_asyncObserver","__PRIVATE_mute","__PRIVATE__firestore","__PRIVATE__transaction","documentRef","__PRIVATE_validateReference","__PRIVATE_lookup","DocumentSnapshot","__PRIVATE_validateSetOptions","__PRIVATE_convertedValue","__PRIVATE_applyFirestoreDataConverter","__PRIVATE__dataReader","__PRIVATE_fieldOrUpdateData","__PRIVATE_ExternalFieldPath","__PRIVATE_verifyNotCommitted","__PRIVATE__mutations","__PRIVATE__committed","firestore","converter","__PRIVATE_currArg","__PRIVATE_internalOptions","__PRIVATE_userObserver","complete","__PRIVATE__convertToDocSnapshot","__PRIVATE_addDocSnapshotListener","__PRIVATE_validateGetOptions","__PRIVATE_getDocumentFromLocalCache","H_","__PRIVATE_getDocViaSnapshotListener","__PRIVATE_errHandler","__PRIVATE_internalListener","SnapshotMetadata","__PRIVATE__document","__PRIVATE__fromCache","__PRIVATE__hasPendingWrites","__PRIVATE_validateSnapshotOptions","QueryDocumentSnapshot","fromFirestore","__PRIVATE__areTimestampsInSnapshotsEnabled","serverTimestamps","__PRIVATE_validateHasExplicitOrderByForLimitToLast","__PRIVATE__query","__PRIVATE_validateDisjunctiveFilterElements","__PRIVATE_referenceList","__PRIVATE_parseDocumentIdValue","__PRIVATE_validateNewFilter","__PRIVATE_validateNewOrderBy","components","__PRIVATE_rawValue","__PRIVATE_wrapped","__PRIVATE_documentIdValue","operator","__PRIVATE_arrayOps","__PRIVATE_disjunctiveOps","__PRIVATE_isArrayOp","__PRIVATE_isDisjunctiveOp","__PRIVATE_existingField","__PRIVATE_validateOrderByAndInequalityMatch","__PRIVATE_conflictingOp","__PRIVATE_findFilterOperator","__PRIVATE_inequality","opStr","__PRIVATE_createFilter","__PRIVATE_addFilter","directionStr","__PRIVATE_createOrderBy","__PRIVATE_addOrderBy","__PRIVATE_withLimitToFirst","__PRIVATE_withLimitToLast","__PRIVATE_docOrField","__PRIVATE_boundFromDocOrFields","__PRIVATE_withStartAt","__PRIVATE_withEndAt","__PRIVATE_boundFromDocument","__PRIVATE_allFields","__PRIVATE_boundFromFields","QuerySnapshot","__PRIVATE_addQuerySnapshotListener","__PRIVATE_getDocumentsFromLocalCache","__PRIVATE_getDocsViaSnapshotListener","__PRIVATE__originalQuery","__PRIVATE__snapshot","thisArg","__PRIVATE_convertToDocumentImpl","__PRIVATE__cachedChanges","__PRIVATE__cachedChangesIncludeMetadataChanges","__PRIVATE_lastDoc","oldIndex","newIndex","__PRIVATE_indexTracker","__PRIVATE_resultChangeType","__PRIVATE_changesFromSnapshot","__PRIVATE__path","toFirestore","__PRIVATE_docRef","__PRIVATE_firestoreNamespace","__PRIVATE_registerFirestore","instance","__PRIVATE_firestoreFactory","registerComponent","Component","container","getProvider","setServiceProps","__PRIVATE_configureForFirebase","registerVersion"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;sDAoBO,OAAMA,IAAcC,EAASD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACGpC,MAAME,IAAY,IAAIC,EAAO;;;SAGbC;IACd,OAAOF,EAAUG;;;SAOHC,EAASC,MAAgBC;IACvC,IAAIN,EAAUG,YAAYI,EAASC,OAAO;QACxC,MAAMC,IAAOH,EAAII,IAAIC;QACrBX,EAAUY,MAAM,cAAcd,OAAiBO,QAAUI;;;;SAI7CI,EAASR,MAAgBC;IACvC,IAAIN,EAAUG,YAAYI,EAASO,OAAO;QACxC,MAAML,IAAOH,EAAII,IAAIC;QACrBX,EAAUe,MAAM,cAAcjB,OAAiBO,QAAUI;;;;;;;AAc7D,SAASE,EAAYL;IACnB,IAAmB,mBAARA,GACT,OAAOA;IAEP;QACE,OC7CqBU,ID6CHV,GC5CfW,KAAKC,UAAUF;MD6ClB,OAAOG;;QAEP,OAAOb;;QChDcU;;;;;;;;;;;;;;;;;;;;;;;;;;aCUXI,EAAKC,IAAkB;;;IAGrC,MAAMC,IACJ,cAAcxB,mCAA6CuB;;;;IAM7D,MALAR,EAASS,IAKH,IAAIC,MAAMD;;;;;;;;aASFE,EACdC,GACAH;IAEKG,KACHL;;;;;;aAyBYM,EACdpB;;AAEAqB;IAMA,OAAOrB;;;;;;;;;;;;;;;;;;;;;;;aC9DOsB,EAAYC;;IAI1B,MAAMC;;IAEY,sBAATC,SAAyBA,KAAKD,UAAWC,KAAuB,WACnEC,IAAQ,IAAIC,WAAWJ;IAC7B,IAAIC,GACFA,EAAOI,gBAAgBF;;IAGvB,KAAK,IAAIG,IAAI,GAAGA,IAAIN,GAAQM,KAC1BH,EAAMG,KAAKC,KAAKC,MAAsB,MAAhBD,KAAKE;IAG/B,OAAON;;;;;;;;;;;;;;;;;;UCfIO;IACXC;;QAEE,MAAMC,IACJ,kEAEIC,IAAcN,KAAKC,MAAM,MAAMI,EAAME,UAAUF,EAAME;;gBAM3D,IAAIC,IAAS;QAEb,MAAOA,EAAOD,SADO,MACgB;YACnC,MAAMX,IAAQJ,EAAY;YAC1B,KAAK,IAAIO,IAAI,GAAGA,IAAIH,EAAMW,UAAUR;;;YAG9BS,EAAOD,SANM,MAMmBX,EAAMG,KAAKO,MAC7CE,KAAUH,EAAMI,OAAOb,EAAMG,KAAKM,EAAME;;QAM9C,OAAOC;;;;SAIKE,EAAuBC,GAASC;IAC9C,OAAID,IAAOC,KACD,IAEND,IAAOC,IACF,IAEF;;;0DAQOC,EACdF,GACAC,GACAE;IAEA,OAAIH,EAAKJ,WAAWK,EAAML,UAGnBI,EAAKI,MAAM,CAACnC,GAAOoC,MAAUF,EAAWlC,GAAOgC,EAAMI;;;;;;aAM9CC,EAAmBC;;IAEjC,OAAOA,IAAI;;;;;;;;;;;;;;;;;;UCnEAC;;;;;;;;;;;;;IAaXf,YACWgB,GACAC,GACAC,GACAC,GACAC;iBAJAJ,GACAK,sBAAAJ,GACAI,YAAAH,GACAG,WAAAF,GACAE,wBAAAD;;;;;;MAQAE;IAEXtB,YAAqBuB,GAAmBC;QAAnBH,iBAAAE,GACnBF,KAAKG,WAAWA,KANU;;IAS5BC;QACE,OAV0B,gBAUnBJ,KAAKG;;IAGdxB,QAAQ0B;QACN,OACEA,aAAiBJ,KACjBI,EAAMH,cAAcF,KAAKE,aACzBG,EAAMF,aAAaH,KAAKG;;IAI5BxB,EAAU0B;QACR,OACEpB,EAAoBe,KAAKE,WAAWG,EAAMH,cAC1CjB,EAAoBe,KAAKG,UAAUE,EAAMF;;;;;;;;;;;;;;;;;;;aC3C/BG,EAAc7D;IAC5B,IAAI8D,IAAQ;IACZ,KAAK,MAAMC,KAAO/D,GACZgE,OAAOC,UAAUC,eAAeC,KAAKnE,GAAK+D,MAC5CD;IAGJ,OAAOA;;;SAGOM,EACdpE,GACAqE;IAEA,KAAK,MAAMN,KAAO/D,GACZgE,OAAOC,UAAUC,eAAeC,KAAKnE,GAAK+D,MAC5CM,EAAGN,GAAK/D,EAAI+D;;;SAKFO,EAAWtE;IAKzB,KAAK,MAAM+D,KAAO/D,GAChB,IAAIgE,OAAOC,UAAUC,eAAeC,KAAKnE,GAAK+D,IAC5C,QAAO;IAGX,QAAO;;;;;;;;;;;;;;;;;;;;;;;;UC3BIQ;IAWXrC,YACUsC,GACAC;iBADAD,YACAC;;;;;;;QANVlB,SAEI;;2EAQJrB,IAAI6B;QACF,MAAMW,IAAKnB,KAAKiB,EAAST,IACnBY,IAAUpB,KAAKqB,EAAMF;QAC3B,SAAgBG,MAAZF,GAGJ,KAAK,OAAOG,GAAUpE,MAAUiE,GAC9B,IAAIpB,KAAKkB,EAASK,GAAUf,IAC1B,OAAOrD;;IAMbwB,IAAI6B;QACF,YAAyBc,MAAlBtB,KAAKwB,IAAIhB;;iDAIlB7B,IAAI6B,GAAcrD;QAChB,MAAMgE,IAAKnB,KAAKiB,EAAST,IACnBY,IAAUpB,KAAKqB,EAAMF;QAC3B,SAAgBG,MAAZF,GAAJ;YAIA,KAAK,IAAI9C,IAAI,GAAGA,IAAI8C,EAAQtC,QAAQR,KAClC,IAAI0B,KAAKkB,EAASE,EAAQ9C,GAAG,IAAIkC,IAE/B,aADAY,EAAQ9C,KAAK,EAACkC,GAAKrD;YAIvBiE,EAAQK,KAAK,EAACjB,GAAKrD;eATjB6C,KAAKqB,EAAMF,KAAM,EAAC,EAACX,GAAKrD;;;;WAe5BwB,OAAO6B;QACL,MAAMW,IAAKnB,KAAKiB,EAAST,IACnBY,IAAUpB,KAAKqB,EAAMF;QAC3B,SAAgBG,MAAZF,GACF,QAAO;QAET,KAAK,IAAI9C,IAAI,GAAGA,IAAI8C,EAAQtC,QAAQR,KAClC,IAAI0B,KAAKkB,EAASE,EAAQ9C,GAAG,IAAIkC,IAM/B,OALuB,MAAnBY,EAAQtC,gBACHkB,KAAKqB,EAAMF,KAElBC,EAAQM,OAAOpD,GAAG;SAEb;QAGX,QAAO;;IAGTK,QAAQmC;QACND,EAAQb,KAAKqB,GAAO,CAACM,GAAGC;YACtB,KAAK,OAAOC,GAAGC,MAAMF,GACnBd,EAAGe,GAAGC;;;IAKZnD;QACE,OAAOoC,EAAQf,KAAKqB;;;;;;;;;;;;;;;;;;;GCrFjB,OAAMU,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;;;;;;;;UASAC,UAAuBvF;IAIlCiB,YAAqBuE,GAAqBzF;QACxC0F,MAAM1F,IADauC,YAAAkD,GAAqBlD,eAAAvC,GAH1CuC,YAAO;;;;QASLA,KAAKoD,WAAW,MAAM,GAAGpD,KAAKqD,eAAerD,KAAKkD,UAAUlD,KAAKvC;;;;;;;;;;;;;;;;;;;;;MCnJxD6F;IAeX3E,YAAqB4E,GAA0BC;QAC7C,IADmBxD,eAAAuD,GAA0BvD,mBAAAwD,GACzCA,IAAc,GAChB,MAAM,IAAIP,EACRlB,EAAKI,kBACL,yCAAyCqB;QAG7C,IAAIA,KAAe,KACjB,MAAM,IAAIP,EACRlB,EAAKI,kBACL,yCAAyCqB;QAG7C,IAAID,KA9BY,aA+Bd,MAAM,IAAIN,EACRlB,EAAKI,kBACL,qCAAqCoB;;gBAIzC,IAAIA,KAAW,cACb,MAAM,IAAIN,EACRlB,EAAKI,kBACL,qCAAqCoB;;IArC3C5E;QACE,OAAO2E,EAAUG,WAAWC,KAAKC;;IAGnChF,gBAAgBiF;QACd,OAAON,EAAUG,WAAWG,EAAKC;;IAGnClF,kBAAkBmF;QAChB,MAAMP,IAAUhF,KAAKC,MAAMsF,IAAe;QAE1C,OAAO,IAAIR,EAAUC,GAD2B,OAAjCO,IAAyB,MAAVP;;IAgChC5E;QACE,OAAO,IAAI+E,KAAK1D,KAAK+D;;IAGvBpF;QACE,OAAsB,MAAfqB,KAAKuD,UAAiBvD,KAAKwD,cAAc;;IAGlD7E,EAAW0B;QACT,OAAIL,KAAKuD,YAAYlD,EAAMkD,UAClBtE,EAAoBe,KAAKwD,aAAanD,EAAMmD,eAE9CvE,EAAoBe,KAAKuD,SAASlD,EAAMkD;;IAGjD5E,QAAQ0B;QACN,OACEA,EAAMkD,YAAYvD,KAAKuD,WAAWlD,EAAMmD,gBAAgBxD,KAAKwD;;IAIjE7E;QACE,OACE,uBACAqB,KAAKuD,UACL,mBACAvD,KAAKwD,cACL;;IAIJ7E;;;;;;;QAOE,MAAMqF,IAAkBhE,KAAKuD,WAnFb;;gBAuFhB,OAFyBU,OAAOD,GAAiBE,SAAS,IAAI,OAEpC,MADGD,OAAOjE,KAAKwD,aAAaU,SAAS,GAAG;;;;;;;;;;;;;;;;;;;;;;;UCpFzDC;IASXxF,YAA4ByF;QAAApE,iBAAAoE;;IAR5BzF,SAAqBxB;QACnB,OAAO,IAAIgH,EAAgBhH;;IAG7BwB;QACE,OAAO,IAAIwF,EAAgB,IAAIb,EAAU,GAAG;;IAK9C3E,EAAU0B;QACR,OAAOL,KAAKoE,UAAUC,EAAWhE,EAAM+D;;IAGzCzF,QAAQ0B;QACN,OAAOL,KAAKoE,UAAUE,QAAQjE,EAAM+D;;oFAItCzF;;QAEE,OAAgC,MAAzBqB,KAAKoE,UAAUb,UAAgBvD,KAAKoE,UAAUZ,cAAc;;IAGrE7E;QACE,OAAO,qBAAqBqB,KAAKoE,UAAUhB,aAAa;;IAG1DzE;QACE,OAAOqB,KAAKoE;;;;;;;;;;;;;;;;;;;;;;;AC5BhB,MAAeG;IAKb5F,YAAY6F,GAAoBC,GAAiB3F;aAChCwC,MAAXmD,IACFA,IAAS,IACAA,IAASD,EAAS1F,UAC3BvB,UAGa+D,MAAXxC,IACFA,IAAS0F,EAAS1F,SAAS2F,IAClB3F,IAAS0F,EAAS1F,SAAS2F,KACpClH;QAEFyC,KAAKwE,WAAWA,GAChBxE,KAAKyE,SAASA,GACdzE,KAAK0E,IAAM5F;;IAqBbA;QACE,OAAOkB,KAAK0E;;IAGd/F,QAAQ0B;QACN,OAA4C,MAArCkE,EAASlF,EAAWW,MAAMK;;IAGnC1B,MAAMgG;QACJ,MAAMH,IAAWxE,KAAKwE,SAASI,MAAM5E,KAAKyE,QAAQzE,KAAK6E;QAQvD,OAPIF,aAAsBJ,IACxBI,EAAW9D,QAAQiE;YACjBN,EAAS/C,KAAKqD;aAGhBN,EAAS/C,KAAKkD,IAET3E,KAAK+E,EAAUP;;kEAIhB7F;QACN,OAAOqB,KAAKyE,SAASzE,KAAKlB;;IAG5BH,EAASqG;QAMP,OALAA,SAAgB1D,MAAT0D,IAAqB,IAAIA,GAKzBhF,KAAK+E,EACV/E,KAAKwE,UACLxE,KAAKyE,SAASO,GACdhF,KAAKlB,SAASkG;;IAIlBrG;QAEE,OAAOqB,KAAK+E,EAAU/E,KAAKwE,UAAUxE,KAAKyE,QAAQzE,KAAKlB,SAAS;;IAGlEH;QAEE,OAAOqB,KAAKwE,SAASxE,KAAKyE;;IAG5B9F;QACE,OAAOqB,KAAKwB,IAAIxB,KAAKlB,SAAS;;IAGhCH,IAAIY;QAEF,OAAOS,KAAKwE,SAASxE,KAAKyE,SAASlF;;IAGrCZ;QACE,OAAuB,MAAhBqB,KAAKlB;;IAGdH,EAAW0B;QACT,IAAIA,EAAMvB,SAASkB,KAAKlB,QACtB,QAAO;QAGT,KAAK,IAAIR,IAAI,GAAGA,IAAI0B,KAAKlB,QAAQR,KAC/B,IAAI0B,KAAKwB,IAAIlD,OAAO+B,EAAMmB,IAAIlD,IAC5B,QAAO;QAIX,QAAO;;IAGTK,EAAoBsG;QAClB,IAAIjF,KAAKlB,SAAS,MAAMmG,EAAenG,QACrC,QAAO;QAGT,KAAK,IAAIR,IAAI,GAAGA,IAAI0B,KAAKlB,QAAQR,KAC/B,IAAI0B,KAAKwB,IAAIlD,OAAO2G,EAAezD,IAAIlD,IACrC,QAAO;QAIX,QAAO;;IAGTK,QAAQmC;QACN,KAAK,IAAIxC,IAAI0B,KAAKyE,QAAQS,IAAMlF,KAAK6E,SAASvG,IAAI4G,GAAK5G,KACrDwC,EAAGd,KAAKwE,SAASlG;;IAIrBK;QACE,OAAOqB,KAAKwE,SAASI,MAAM5E,KAAKyE,QAAQzE,KAAK6E;;IAG/ClG,SACEwG,GACAC;QAEA,MAAMV,IAAMnG,KAAK8G,IAAIF,EAAGrG,QAAQsG,EAAGtG;QACnC,KAAK,IAAIR,IAAI,GAAGA,IAAIoG,GAAKpG,KAAK;YAC5B,MAAMY,IAAOiG,EAAG3D,IAAIlD,IACda,IAAQiG,EAAG5D,IAAIlD;YACrB,IAAIY,IAAOC,GACT,QAAQ;YAEV,IAAID,IAAOC,GACT,OAAO;;QAGX,OAAIgG,EAAGrG,SAASsG,EAAGtG,UACT,IAENqG,EAAGrG,SAASsG,EAAGtG,SACV,IAEF;;;;;;;UAQEwG,UAAqBf;IACtB5F,EACR6F,GACAC,GACA3F;QAEA,OAAO,IAAIwG,EAAad,GAAUC,GAAQ3F;;IAG5CH;;;;QAKE,OAAOqB,KAAKuF,IAAUC,KAAK;;IAG7B7G;QACE,OAAOqB,KAAKyF;;;;WAMd9G,SAAkB+G;;;;QAKhB,IAAIA,EAAKC,QAAQ,SAAS,GACxB,MAAM,IAAI1C,EACRlB,EAAKI,kBACL,iBAAiBuD;;;gBAMrB,MAAMlB,IAAWkB,EAAKE,MAAM,KAAKC,OAAOf,KAAWA,EAAQhG,SAAS;QAEpE,OAAO,IAAIwG,EAAad;;IAG1B7F;QACE,OAAO,IAAI2G,EAAa;;;;AAI5B,MAAMQ,IAAmB;;gFAGZC,UAAkBxB;IACnB5F,EACR6F,GACAC,GACA3F;QAEA,OAAO,IAAIiH,EAAUvB,GAAUC,GAAQ3F;;;;;WAOjCH,SAAyBmG;QAC/B,OAAOgB,EAAiBE,KAAKlB;;IAG/BnG;QACE,OAAOqB,KAAKuF,IACT1I,IAAIoJ,MACHA,IAAMA,EAAIC,QAAQ,MAAM,QAAQA,QAAQ,KAAK,QACxCH,EAAUI,EAAkBF,OAC/BA,IAAM,MAAMA,IAAM;QAEbA,IAERT,KAAK;;IAGV7G;QACE,OAAOqB,KAAKyF;;;;WAMd9G;QACE,OAAuB,MAAhBqB,KAAKlB,UArQiB,eAqQDkB,KAAKwB,IAAI;;;;WAMvC7C;QACE,OAAO,IAAIoH,EAAU,EA5QQ;;;;;;;;;;;WAyR/BpH,SAAwB+G;QACtB,MAAMlB,IAAqB;QAC3B,IAAI4B,IAAU,IACV9H,IAAI;QAER,MAAM+H,IAAoB;YACxB,IAAuB,MAAnBD,EAAQtH,QACV,MAAM,IAAImE,EACRlB,EAAKI,kBACL,uBAAuBuD,wCACrB;YAGNlB,EAAS/C,KAAK2E,IACdA,IAAU;;QAGZ,IAAIE,KAAc;QAElB,MAAOhI,IAAIoH,EAAK5G,UAAQ;YACtB,MAAMyH,IAAIb,EAAKpH;YACf,IAAU,SAANiI,GAAY;gBACd,IAAIjI,IAAI,MAAMoH,EAAK5G,QACjB,MAAM,IAAImE,EACRlB,EAAKI,kBACL,yCAAyCuD;gBAG7C,MAAMc,IAAOd,EAAKpH,IAAI;gBACtB,IAAe,SAATkI,KAA0B,QAATA,KAAyB,QAATA,GACrC,MAAM,IAAIvD,EACRlB,EAAKI,kBACL,uCAAuCuD;gBAG3CU,KAAWI,GACXlI,KAAK;mBACU,QAANiI,KACTD,KAAeA,GACfhI,OACe,QAANiI,KAAcD,KAIvBF,KAAWG,GACXjI,QAJA+H,KACA/H;;QAQJ,IAFA+H,KAEIC,GACF,MAAM,IAAIrD,EACRlB,EAAKI,kBACL,6BAA6BuD;QAIjC,OAAO,IAAIK,EAAUvB;;IAGvB7F;QACE,OAAO,IAAIoH,EAAU;;;;;;;;;;;;;;;;;;;UCrVZU;IACX9H,YAAqB+G;QAAA1F,YAAA0F;;IAQrB/G,SAAgB0E;QACd,OAAO,IAAIoD,EAAYnB,EAAaoB,EAAWrD,GAAMsD,EAAS;;6EAIhEhI,EAAgBiI;QACd,OACE5G,KAAK0F,KAAK5G,UAAU,KACpBkB,KAAK0F,KAAKlE,IAAIxB,KAAK0F,KAAK5G,SAAS,OAAO8H;;IAI5CjI,QAAQ0B;QACN,OACY,SAAVA,KAAqE,MAAnDiF,EAAajG,EAAWW,KAAK0F,MAAMrF,EAAMqF;;IAI/D/G;QACE,OAAOqB,KAAK0F,KAAKtC;;IAGnBzE,SAAkBkI,GAAiBC;QACjC,OAAOxB,EAAajG,EAAWwH,EAAGnB,MAAMoB,EAAGpB;;IAG7C/G,SAAqB+G;QACnB,OAAOA,EAAK5G,SAAS,KAAM;;;;;;;WAS7BH,SAAoB6F;QAClB,OAAO,IAAIiC,EAAY,IAAInB,EAAad,EAASI;;;;;;;;;;;;;;;;;;;;;;aC1CrCmC,EAAkB5J;IAChC,OAAOA,QAAAA;;;yDAIO6J,EAAe7J;;;IAG7B,QAAkB,MAAXA,KAAgB,IAAIA,MAAU,IAAA;;;;;;aAOvB8J,EAAc9J;IAC5B,OACmB,mBAAVA,KACP+J,OAAOC,UAAUhK,OAChB6J,EAAe7J,MAChBA,KAAS+J,OAAOE,oBAChBjK,KAAS+J,OAAOG;;;;;;;;;;;;;;;;;;;;MCOPC;IAEX3I,YACW+G,GACA6B,IAAiC,MACjCC,IAAqB,IACrBC,IAAoB,IACpB5C,IAAuB,MACvB6C,IAAwB,MACxBC,IAAsB;QANtB3H,YAAA0F,GACA1F,uBAAAuH,GACAvH,eAAAwH,GACAxH,eAAAyH,GACAzH,aAAA6E;QACA7E,eAAA0H,GACA1H,aAAA2H,GARX3H,SAAqC;;;;;;;;;;;aAoBvB4H,EACdlC,GACA6B,IAAiC,MACjCC,IAAqB,IACrBC,IAAoB,IACpB5C,IAAuB,MACvB6C,IAAwB,MACxBC,IAAsB;IAEtB,OAAO,IAAIL,EACT5B,GACA6B,GACAC,GACAC,GACA5C,GACA6C,GACAC;;;SAIYE,EAAeC;IAC7B,MAAMC,IAAalK,EAAUiK;IAE7B,IAAuC,SAAnCC,EAAWC,GAA8B;QAC3C,IAAIC,IAAcF,EAAWrC,KAAKD;QACC,SAA/BsC,EAAWR,oBACbU,KAAe,SAASF,EAAWR,kBAErCU,KAAe,OACfA,KAAeF,EAAWN,QAAQ5K,IAAIqL,KAAKC,GAAeD,IAAI1C,KAAK;QACnEyC,KAAe,QACfA,KAAeF,EAAWP,QAAQ3K,IAAIuL;YAAKC,QC4uBfb,ID5uB+BY,GC8uB9CE,MAAM7C,MAAoB+B,EAAQe;gBAFnBf;WD5uBmChC,KAAK,MAE/DuB,EAAkBgB,EAAWlD,WAChCoD,KAAe,OACfA,KAAeF,EAAiB,QAE9BA,EAAWL,YACbO,KAAe;QACfA,KAAeO,GAAcT,EAAWL,WAEtCK,EAAWJ,UACbM,KAAe,QACfA,KAAeO,GAAcT,EAAWJ,SAE1CI,EAAWC,IAAsBC;;IAEnC,OAAOF,EAAWC;;;SAGJS,EAAgBX;IAC9B,IAAI7B,IAAM6B,EAAOpC,KAAKD;IAuBtB,OAtB+B,SAA3BqC,EAAOP,oBACTtB,KAAO,sBAAsB6B,EAAOP;IAElCO,EAAOL,QAAQ3I,SAAS,MAC1BmH,KAAO,eAAe6B,EAAOL,QAC1B5K,IAAIqL;QAAKQ,OC0fP,IALuB7C,IDrfAqC,GC0fbI,MAAM7C,OAAqBI,EAAO8C,MAAMV,GACvDpC,EAAO1I;;YANqB0I;0EDpfzBL,KAAK;IAELuB,EAAkBe,EAAOjD,WAC5BoB,KAAO,cAAc6B,EAAOjD,QAE1BiD,EAAON,QAAQ1I,SAAS,MAC1BmH,KAAO,eAAe6B,EAAON,QAC1B3K,IAAIuL;QAAKQ,OCgtBP,IADwBpB,ID/sBAY,GCgtBbE,MAAM7C,QAAsB+B,EAAQe;YADvBf;OD9sB1BhC,KAAK,WAENsC,EAAOJ,YACTzB,KAAO,gBAAgBuC,GAAcV,EAAOJ,WAE1CI,EAAOH,UACT1B,KAAO,cAAcuC,GAAcV,EAAOH;IAErC,UAAU1B;;;SAGH4C,EAAa3J,GAAcC;IACzC,IAAID,EAAK2F,UAAU1F,EAAM0F,OACvB,QAAO;IAGT,IAAI3F,EAAKsI,QAAQ1I,WAAWK,EAAMqI,QAAQ1I,QACxC,QAAO;IAGT,KAAK,IAAIR,IAAI,GAAGA,IAAIY,EAAKsI,QAAQ1I,QAAQR,KACvC,KAAKwK,GAAc5J,EAAKsI,QAAQlJ,IAAIa,EAAMqI,QAAQlJ,KAChD,QAAO;IAIX,IAAIY,EAAKuI,QAAQ3I,WAAWK,EAAMsI,QAAQ3I,QACxC,QAAO;IAGT,KAAK,IAAIR,IAAI,GAAGA,IAAIY,EAAKuI,QAAQ3I,QAAQR,KACvC,ICkcyByK,IDlcP7J,EAAKuI,QAAQnJ,ICkcM0K,IDlcF7J,EAAMsI,QAAQnJ;MCocjDyK,aAAcE,MACdD,aAAcC,MACdF,EAAGJ,OAAOK,EAAGL,MACbI,EAAGT,MAAMhE,QAAQ0E,EAAGV,UACpBY,GAAYH,EAAG5L,OAAO6L,EAAG7L,SDvcvB,QAAO;QCicgB4L,GAAYC;ID7bvC,OAAI9J,EAAKqI,oBAAoBpI,EAAMoI,sBAI9BrI,EAAKwG,KAAKpB,QAAQnF,EAAMuG,YAIxByD,GAAYjK,EAAKwI,SAASvI,EAAMuI,YAI9ByB,GAAYjK,EAAKyI,OAAOxI,EAAMwI;;;SAGvByB,GAAiBtB;IAC/B,OACErB,EAAY4C,EAAcvB,EAAOpC,SACN,SAA3BoC,EAAOP,mBACmB,MAA1BO,EAAOL,QAAQ3I;;;;;;;;;;;;;;;;;;;;;;SE3KHwK,GAAaC;IAC3B,OAAOtF,OAAOuF,aAAaC,MACzB;;;;IAIAC,EAAOC,wBAAwBJ,IATlB;;;;;;;;;;;;;;;;;;;;;;;;;;;;MCOJK;IAGXjL,YAAqCkL;iBAAAA;;IAErClL,wBAAwB+K;QACtB,MAAMG,IAAeP,GAAaI;QAClC,OAAO,IAAIE,GAAWC;;IAGxBlL,sBAAsBmL;QACpB,MAAMD;;;;iBA4BiCC;YACzC,IAAID,IAAe;YACnB,KAAK,IAAIvL,IAAI,GAAGA,IAAIwL,EAAMhL,UAAUR,GAClCuL,KAAgB5F,OAAOuF,aAAaM,EAAMxL;YAE5C,OAAOuL;;;;GAjCgBE,EAA2BD;QAChD,OAAO,IAAIF,GAAWC;;IAGxBlL;QACE,gBDTyBqL;YAC3B,MAAM7L,IAAkB;YACxB,KAAK,IAAIG,IAAI,GAAGA,IAAI0L,EAAIlL,QAAQR,KAC9BH,EAAMG,KAAK0L,EAAIC,WAAW3L;YAE5B,OAAOoL,EAAOQ,gBAAgB/L,IAnBf;SCuBNgM,CAAanK,KAAK6J;;IAG3BlL;QACE,gBA8BuCkL;YACzC,MAAMO,IAAS,IAAIhM,WAAWyL,EAAa/K;YAC3C,KAAK,IAAIR,IAAI,GAAGA,IAAIuL,EAAa/K,QAAQR,KACvC8L,EAAO9L,KAAKuL,EAAaI,WAAW3L;YAEtC,OAAO8L;;;;;;;;;;;;;;;;;;;;GAnCEC,EAA2BrK,KAAK6J;;IAGzClL;QACE,OAAkC,IAA3BqB,KAAK6J,EAAa/K;;IAG3BH,EAAU0B;QACR,OAAOpB,EAAoBe,KAAK6J,GAAcxJ,EAAMwJ;;IAGtDlL,QAAQ0B;QACN,OAAOL,KAAK6J,MAAiBxJ,EAAMwJ;;;;AA/BrCD,OAAoC,IAAIA,GAAW;;MCUxCU;IACX3L;;IAEWmJ;;;;;IAKAyC;;IAEAC;;;;;IAKAC;;IAEAC,IAAmCvG,EAAgBkB;;;;UAKnDsF,IAAgDxG,EAAgBkB;;;;;;UAOhEuF,IAA0BhB,GAAWiB;QA1BrC7K,cAAA8H,GAKA9H,gBAAAuK,YAEAC,GAKAxK,sBAAAyK,YAEAC;QAKA1K,oCAAA2K,GAOA3K,mBAAA4K;;kFAIXjM,EAAmB8L;QACjB,OAAO,IAAIH,GACTtK,KAAK8H,QACL9H,KAAKuK,UACLvK,KAAKwK,GACLC,GACAzK,KAAK0K,GACL1K,KAAK2K,8BACL3K,KAAK4K;;;;;WAQTjM,GACEiM,GACAF;QAEA,OAAO,IAAIJ,GACTtK,KAAK8H,QACL9H,KAAKuK,UACLvK,KAAKwK,GACLxK,KAAKyK,gBACLC,GACA1K,KAAK2K,8BACLC;;;;;WAQJjM,GACEgM;QAEA,OAAO,IAAIL,GACTtK,KAAK8H,QACL9H,KAAKuK,UACLvK,KAAKwK,GACLxK,KAAKyK,gBACLzK,KAAK0K,GACLC,GACA3K,KAAK4K;;;;;;;;;;;;;;;;;;;UCpGEE;;IAEXnM,YAAmB4B;QAAAP,aAAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GCYrB,KAAKwK;;;;;;;;SA0BWC,GAAiB9H;IAC/B,QAAQA;MACN,KAAKnB,EAAKC;QACR,OAnCwFzE;;MAoC1F,KAAKwE,EAAKE;MACV,KAAKF,EAAKG;MACV,KAAKH,EAAKK;MACV,KAAKL,EAAKU;MACV,KAAKV,EAAKe;MACV,KAAKf,EAAKgB;;;cAGV,KAAKhB,EAAKS;QACR,QAAO;;MACT,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,QAAO;;MACT;QACE,OA5DwFzF;;;;;;;;;;;;;;;;;;;;;;;SAwG9E0N,GAAmB/H;IACjC,SAAa5B,MAAT4B;;;IAIF,OADAlG,EAAS,4BACF+E,EAAKG;IAGd,QAAQgB;MACN,KAAK6H,GAAQ/I;QACX,OAAOD,EAAKC;;MACd,KAAK+I,GAAQ9I;QACX,OAAOF,EAAKE;;MACd,KAAK8I,GAAQ7I;QACX,OAAOH,EAAKG;;MACd,KAAK6I,GAAQ3I;QACX,OAAOL,EAAKK;;MACd,KAAK2I,GAAQtI;QACX,OAAOV,EAAKU;;MACd,KAAKsI,GAAQjI;QACX,OAAOf,EAAKe;;MACd,KAAKiI,GAAQhI;QACX,OAAOhB,EAAKgB;;MACd,KAAKgI,GAAQvI;QACX,OAAOT,EAAKS;;MACd,KAAKuI,GAAQ5I;QACX,OAAOJ,EAAKI;;MACd,KAAK4I,GAAQ1I;QACX,OAAON,EAAKM;;MACd,KAAK0I,GAAQzI;QACX,OAAOP,EAAKO;;MACd,KAAKyI,GAAQxI;QACX,OAAOR,EAAKQ;;MACd,KAAKwI,GAAQrI;QACX,OAAOX,EAAKW;;MACd,KAAKqI,GAAQpI;QACX,OAAOZ,EAAKY;;MACd,KAAKoI,GAAQnI;QACX,OAAOb,EAAKa;;MACd,KAAKmI,GAAQlI;QACX,OAAOd,EAAKc;;MACd,KAAKkI,GAAQ/H;QACX,OAAOjB,EAAKiB;;MACd;QACE,OApJwFzF;;;;;;;;;;;UAMzFwN,OAAAA,6BAEHG;AACAA,gCACAA;AACAA,oDACAA;AACAA,8CACAA;AACAA,iDACAA;AACAA,wDACAA;AACAA,2CACAA;AACAA,mCACAA,yCACAA;;;;;;;;;;;;;;;;;;;;MCNWC;IAIXxM,YACSU,GACP+L;iBADO/L,GAGPW,KAAKoL,OAAOA,KAAcC,GAASC;;;IAIrC3M,GAAO6B,GAAQrD;QACb,OAAO,IAAIgO,GACTnL,KAAKX,GACLW,KAAKoL,KACFG,GAAO/K,GAAKrD,GAAO6C,KAAKX,GACxBmM,KAAK,MAAM,MAAMH,GAASI,IAAO,MAAM;;;IAK9C9M,OAAO6B;QACL,OAAO,IAAI2K,GACTnL,KAAKX,GACLW,KAAKoL,KACFM,OAAOlL,GAAKR,KAAKX,GACjBmM,KAAK,MAAM,MAAMH,GAASI,IAAO,MAAM;;;IAK9C9M,IAAI6B;QACF,IAAImL,IAAO3L,KAAKoL;QAChB,OAAQO,EAAK5K,OAAW;YACtB,MAAM6K,IAAM5L,KAAKX,EAAWmB,GAAKmL,EAAKnL;YACtC,IAAY,MAARoL,GACF,OAAOD,EAAKxO;YACHyO,IAAM,IACfD,IAAOA,EAAKzM,OACH0M,IAAM,MACfD,IAAOA,EAAKxM;;QAGhB,OAAO;;;;IAKTR,QAAQ6B;;QAEN,IAAIqL,IAAc,GACdF,IAAO3L,KAAKoL;QAChB,OAAQO,EAAK5K,OAAW;YACtB,MAAM6K,IAAM5L,KAAKX,EAAWmB,GAAKmL,EAAKnL;YACtC,IAAY,MAARoL,GACF,OAAOC,IAAcF,EAAKzM,KAAK8F;YACtB4G,IAAM,IACfD,IAAOA,EAAKzM;;YAGZ2M,KAAeF,EAAKzM,KAAK8F,OAAO,GAChC2G,IAAOA,EAAKxM;;;gBAIhB,QAAQ;;IAGVR;QACE,OAAOqB,KAAKoL,KAAKrK;;;IAInBiE;QACE,OAAOhF,KAAKoL,KAAKpG;;;IAInBrG;QACE,OAAOqB,KAAKoL,KAAKU;;;IAInBnN;QACE,OAAOqB,KAAKoL,KAAKW;;;;;;IAOnBpN,GAAoBqN;QAClB,OAAQhM,KAAKoL,KAAwBa,GAAiBD;;IAGxDrN,QAAQmC;QACNd,KAAKiM,GAAiB,CAACpK,GAAGC,OACxBhB,EAAGe,GAAGC,KACC;;IAIXnD;QACE,MAAMuN,IAAyB;QAK/B,OAJAlM,KAAKiM,GAAiB,CAACpK,GAAGC,OACxBoK,EAAazK,KAAK,GAAGI,KAAKC,OACnB,KAEF,IAAIoK,EAAa1G,KAAK;;;;;;;IAQ/B7G,GAAoBqN;QAClB,OAAQhM,KAAKoL,KAAwBe,GAAiBH;;;IAIxDrN;QACE,OAAO,IAAIyN,GAAwBpM,KAAKoL,MAAM,MAAMpL,KAAKX,IAAY;;IAGvEV,GAAgB6B;QACd,OAAO,IAAI4L,GAAwBpM,KAAKoL,MAAM5K,GAAKR,KAAKX,IAAY;;IAGtEV;QACE,OAAO,IAAIyN,GAAwBpM,KAAKoL,MAAM,MAAMpL,KAAKX,IAAY;;IAGvEV,GAAuB6B;QACrB,OAAO,IAAI4L,GAAwBpM,KAAKoL,MAAM5K,GAAKR,KAAKX,IAAY;;;;;;MAK3D+M;IAIXzN,YACEgN,GACAU,GACAhN,GACAiN;QAEAtM,KAAKsM,KAAYA,GACjBtM,KAAKuM,KAAY;QAEjB,IAAIX,IAAM;QACV,OAAQD,EAAK5K,OAOX,IANA6K,IAAMS,IAAWhN,EAAWsM,EAAKnL,KAAK6L,KAAY;;QAE9CC,MACFV,MAAQ,IAGNA,IAAM;;QAGND,IADE3L,KAAKsM,KACAX,EAAKzM,OAELyM,EAAKxM,YAET;YAAA,IAAY,MAARyM,GAAW;;;gBAGpB5L,KAAKuM,GAAU9K,KAAKkK;gBACpB;;;;YAIA3L,KAAKuM,GAAU9K,KAAKkK,IAElBA,IADE3L,KAAKsM,KACAX,EAAKxM,QAELwM,EAAKzM;;;IAMpBP;QAME,IAAIgN,IAAO3L,KAAKuM,GAAUC;QAC1B,MAAMC,IAAS;YAAEjM,KAAKmL,EAAKnL;YAAKrD,OAAOwO,EAAKxO;;QAE5C,IAAI6C,KAAKsM,IAEP,KADAX,IAAOA,EAAKzM,OACJyM,EAAK5K,OACXf,KAAKuM,GAAU9K,KAAKkK,IACpBA,IAAOA,EAAKxM,YAId,KADAwM,IAAOA,EAAKxM,QACJwM,EAAK5K,OACXf,KAAKuM,GAAU9K,KAAKkK;QACpBA,IAAOA,EAAKzM;QAIhB,OAAOuN;;IAGT9N;QACE,OAAOqB,KAAKuM,GAAUzN,SAAS;;IAGjCH;QACE,IAA8B,MAA1BqB,KAAKuM,GAAUzN,QACjB,OAAO;QAGT,MAAM6M,IAAO3L,KAAKuM,GAAUvM,KAAKuM,GAAUzN,SAAS;QACpD,OAAO;YAAE0B,KAAKmL,EAAKnL;YAAKrD,OAAOwO,EAAKxO;;;;;;;MAK3BkO;IAaX1M,YACS6B,GACArD,GACPuP,GACAxN,GACAC;QAJOa,WAAAQ,GACAR,aAAA7C,GAKP6C,KAAK0M,QAAiB,QAATA,IAAgBA,IAAQrB,GAASsB,KAC9C3M,KAAKd,OAAe,QAARA,IAAeA,IAAOmM,GAASC;QAC3CtL,KAAKb,QAAiB,QAATA,IAAgBA,IAAQkM,GAASC,OAC9CtL,KAAKgF,OAAOhF,KAAKd,KAAK8F,OAAO,IAAIhF,KAAKb,MAAM6F;;;IAI9CrG,KACE6B,GACArD,GACAuP,GACAxN,GACAC;QAEA,OAAO,IAAIkM,GACF,QAAP7K,IAAcA,IAAMR,KAAKQ,KAChB,QAATrD,IAAgBA,IAAQ6C,KAAK7C,OACpB,QAATuP,IAAgBA,IAAQ1M,KAAK0M,OACrB,QAARxN,IAAeA,IAAOc,KAAKd,MAClB,QAATC,IAAgBA,IAAQa,KAAKb;;IAIjCR;QACE,QAAO;;;;;;IAOTA,GAAoBqN;QAClB,OACGhM,KAAKd,KAAwB+M,GAAiBD,MAC/CA,EAAOhM,KAAKQ,KAAKR,KAAK7C,UACrB6C,KAAKb,MAAyB8M,GAAiBD;;;;;;IAQpDrN,GAAoBqN;QAClB,OACGhM,KAAKb,MAAyBgN,GAAiBH,MAChDA,EAAOhM,KAAKQ,KAAKR,KAAK7C,UACrB6C,KAAKd,KAAwBiN,GAAiBH;;;IAK3CrN;QACN,OAAIqB,KAAKd,KAAK6B,MACLf,OAECA,KAAKd,KAAwBmG;;;IAKzC1G;QACE,OAAOqB,KAAKqF,MAAM7E;;;IAIpB7B;QACE,OAAIqB,KAAKb,MAAM4B,MACNf,KAAKQ,MAELR,KAAKb,MAAM4M;;;IAKtBpN,GAAO6B,GAAQrD,GAAUkC;QACvB,IAAIuN,IAAoB5M;QACxB,MAAM4L,IAAMvM,EAAWmB,GAAKoM,EAAEpM;QAc9B,OAZEoM,IADEhB,IAAM,IACJgB,EAAEpB,KAAK,MAAM,MAAM,MAAMoB,EAAE1N,KAAKqM,GAAO/K,GAAKrD,GAAOkC,IAAa,QACnD,MAARuM,IACLgB,EAAEpB,KAAK,MAAMrO,GAAO,MAAM,MAAM,QAEhCyP,EAAEpB,KACJ,MACA,MACA,MACA,MACAoB,EAAEzN,MAAMoM,GAAO/K,GAAKrD,GAAOkC;QAGxBuN,EAAEC;;IAGHlO;QACN,IAAIqB,KAAKd,KAAK6B,KACZ,OAAOsK,GAASC;QAElB,IAAIsB,IAAoB5M;QAKxB,OAJK4M,EAAE1N,KAAK4N,QAAYF,EAAE1N,KAAKA,KAAK4N,SAClCF,IAAIA,EAAEG,OAERH,IAAIA,EAAEpB,KAAK,MAAM,MAAM,MAAOoB,EAAE1N,KAAwB8N,MAAa;QAC9DJ,EAAEC;;;IAIXlO,OACE6B,GACAnB;QAEA,IAAI4N,GACAL,IAAoB5M;QACxB,IAAIX,EAAWmB,GAAKoM,EAAEpM,OAAO,GACtBoM,EAAE1N,KAAK6B,OAAc6L,EAAE1N,KAAK4N,QAAYF,EAAE1N,KAAKA,KAAK4N,SACvDF,IAAIA,EAAEG;QAERH,IAAIA,EAAEpB,KAAK,MAAM,MAAM,MAAMoB,EAAE1N,KAAKwM,OAAOlL,GAAKnB,IAAa,YACxD;YAOL,IANIuN,EAAE1N,KAAK4N,SACTF,IAAIA,EAAEM,OAEHN,EAAEzN,MAAM4B,OAAc6L,EAAEzN,MAAM2N,QAAYF,EAAEzN,MAAMD,KAAK4N,SAC1DF,IAAIA,EAAEO;YAEuB,MAA3B9N,EAAWmB,GAAKoM,EAAEpM,MAAY;gBAChC,IAAIoM,EAAEzN,MAAM4B,KACV,OAAOsK,GAASC;gBAEhB2B,IAAYL,EAAEzN,MAAyBkG,OACvCuH,IAAIA,EAAEpB,KACJyB,EAASzM,KACTyM,EAAS9P,OACT,MACA,MACCyP,EAAEzN,MAAyB6N;;YAIlCJ,IAAIA,EAAEpB,KAAK,MAAM,MAAM,MAAM,MAAMoB,EAAEzN,MAAMuM,OAAOlL,GAAKnB;;QAEzD,OAAOuN,EAAEC;;IAGXlO;QACE,OAAOqB,KAAK0M;;;IAIN/N;QACN,IAAIiO,IAAoB5M;QAUxB,OATI4M,EAAEzN,MAAM2N,SAAYF,EAAE1N,KAAK4N,SAC7BF,IAAIA,EAAEQ,OAEJR,EAAE1N,KAAK4N,QAAWF,EAAE1N,KAAKA,KAAK4N,SAChCF,IAAIA,EAAEM;QAEJN,EAAE1N,KAAK4N,QAAWF,EAAEzN,MAAM2N,SAC5BF,IAAIA,EAAES,OAEDT;;IAGDjO;QACN,IAAIiO,IAAI5M,KAAKqN;QAYb,OAXIT,EAAEzN,MAAMD,KAAK4N,SACfF,IAAIA,EAAEpB,KACJ,MACA,MACA,MACA,MACCoB,EAAEzN,MAAyB+N,OAE9BN,IAAIA,EAAEQ;QACNR,IAAIA,EAAES,OAEDT;;IAGDjO;QACN,IAAIiO,IAAI5M,KAAKqN;QAKb,OAJIT,EAAE1N,KAAKA,KAAK4N,SACdF,IAAIA,EAAEM,MACNN,IAAIA,EAAES,OAEDT;;IAGDjO;QACN,MAAM2O,IAAKtN,KAAKwL,KAAK,MAAM,MAAMH,GAASsB,KAAK,MAAM3M,KAAKb,MAAMD;QAChE,OAAQc,KAAKb,MAAyBqM,KACpC,MACA,MACAxL,KAAK0M,OACLY,GACA;;IAII3O;QACN,MAAM4O,IAAKvN,KAAKwL,KAAK,MAAM,MAAMH,GAASsB,KAAK3M,KAAKd,KAAKC,OAAO;QAChE,OAAQa,KAAKd,KAAwBsM,KAAK,MAAM,MAAMxL,KAAK0M,OAAO,MAAMa;;IAGlE5O;QACN,MAAMO,IAAOc,KAAKd,KAAKsM,KAAK,MAAM,OAAOxL,KAAKd,KAAKwN,OAAO,MAAM,OAC1DvN,IAAQa,KAAKb,MAAMqM,KAAK,MAAM,OAAOxL,KAAKb,MAAMuN,OAAO,MAAM;QACnE,OAAO1M,KAAKwL,KAAK,MAAM,OAAOxL,KAAK0M,OAAOxN,GAAMC;;;IAIlDR;QACE,MAAM6O,IAAaxN,KAAKyN;QACxB,OAAIlP,KAAKmP,IAAI,GAAKF,MAAexN,KAAKgF,OAAO;;;;IASrCrG;QACR,IAAIqB,KAAK8M,QAAW9M,KAAKd,KAAK4N,MAC5B,MAveevP;QAyejB,IAAIyC,KAAKb,MAAM2N,MACb,MA1eevP;QA4ejB,MAAMiQ,IAAcxN,KAAKd,KAAwBuO;QACjD,IAAID,MAAgBxN,KAAKb,MAAyBsO,MAChD,MA9eelQ;QAgff,OAAOiQ,KAAcxN,KAAK8M,OAAU,IAAI;;;;;;8DArPrCzB;WAAiC,MAEjCA,UAAM,GACNA,SAAQ;;;AAiUjBA,GAASC,QAAQ;;;IAzEjB3M;QAgBEqB,YAAO;;IAfPQ;QACE,MAxfiBjD;;IA0fnBJ;QACE,MA3fiBI;;IA6fnBmP;QACE,MA9fiBnP;;IAggBnB2B;QACE,MAjgBiB3B;;IAmgBnB4B;QACE,MApgBiB5B;;;IAygBnBoB,KACE6B,GACArD,GACAuP,GACAxN,GACAC;QAEA,OAAOa;;;IAITrB,GAAO6B,GAAQrD,GAAUkC;QACvB,OAAO,IAAIgM,GAAe7K,GAAKrD;;;IAIjCwB,OAAO6B,GAAQnB;QACb,OAAOW;;IAGTrB;QACE,QAAO;;IAGTA,GAAiBqN;QACf,QAAO;;IAGTrN,GAAiBqN;QACf,QAAO;;IAGTrN;QACE,OAAO;;IAGTA;QACE,OAAO;;IAGTA;QACE,QAAO;;;IAITA;QACE,QAAO;;IAGCA;QACR,OAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;MC3jBEgP;IAGXhP,YAAoBU;iBAAAA,GAClBW,KAAK4N,OAAO,IAAIzC,GAAsBnL,KAAKX;;IAG7CV,IAAIkP;QACF,OAA+B,SAAxB7N,KAAK4N,KAAKpM,IAAIqM;;IAGvBlP;QACE,OAAOqB,KAAK4N,KAAK9B;;IAGnBnN;QACE,OAAOqB,KAAK4N,KAAK7B;;IAGnB/G;QACE,OAAOhF,KAAK4N,KAAK5I;;IAGnBrG,QAAQkP;QACN,OAAO7N,KAAK4N,KAAKjI,QAAQkI;;iEAI3BlP,QAAQmP;QACN9N,KAAK4N,KAAK3B,GAAiB,CAACpK,GAAMC,OAChCgM,EAAGjM,KACI;;4EAKXlD,GAAeoP,GAAeD;QAC5B,MAAME,IAAOhO,KAAK4N,KAAKK,GAAgBF,EAAM;QAC7C,MAAOC,EAAKE,QAAW;YACrB,MAAML,IAAOG,EAAKG;YAClB,IAAInO,KAAKX,EAAWwO,EAAKrN,KAAKuN,EAAM,OAAO,GACzC;YAEFD,EAAGD,EAAKrN;;;;;WAOZ7B,GAAamP,GAA0BM;QACrC,IAAIJ;QAMJ,KAJEA,SADY1M,MAAV8M,IACKpO,KAAK4N,KAAKK,GAAgBG,KAE1BpO,KAAK4N,KAAKS,MAEZL,EAAKE,QAAW;YAGrB,KADeJ,EADFE,EAAKG,KACK3N,MAErB;;;uEAMN7B,GAAkBkP;QAChB,MAAMG,IAAOhO,KAAK4N,KAAKK,GAAgBJ;QACvC,OAAOG,EAAKE,OAAYF,EAAKG,KAAU3N,MAAM;;IAG/C7B;QACE,OAAO,IAAI2P,GAAqBtO,KAAK4N,KAAKS;;IAG5C1P,GAAgB6B;QACd,OAAO,IAAI8N,GAAqBtO,KAAK4N,KAAKK,GAAgBzN;;4CAI5D7B,IAAIkP;QACF,OAAO7N,KAAKwL,KAAKxL,KAAK4N,KAAKlC,OAAOmC,GAAMtC,GAAOsC,IAAM;;iCAIvDlP,OAAOkP;QACL,OAAK7N,KAAKuO,IAAIV,KAGP7N,KAAKwL,KAAKxL,KAAK4N,KAAKlC,OAAOmC,MAFzB7N;;IAKXrB;QACE,OAAOqB,KAAK4N,KAAK7M;;IAGnBpC,GAAU0B;QACR,IAAIoM,IAAuBzM;;gBAW3B,OARIyM,EAAOzH,OAAO3E,EAAM2E,SACtByH,IAASpM,GACTA,IAAQL,OAGVK,EAAMQ,QAAQgN;YACZpB,IAASA,EAAO+B,IAAIX;YAEfpB;;IAGT9N,QAAQ0B;QACN,MAAMA,aAAiBsN,KACrB,QAAO;QAET,IAAI3N,KAAKgF,SAAS3E,EAAM2E,MACtB,QAAO;QAGT,MAAMyJ,IAASzO,KAAK4N,KAAKS,MACnBK,IAAUrO,EAAMuN,KAAKS;QAC3B,MAAOI,EAAOP,QAAW;YACvB,MAAMS,IAAWF,EAAON,KAAU3N,KAC5BoO,IAAYF,EAAQP,KAAU3N;YACpC,IAA6C,MAAzCR,KAAKX,EAAWsP,GAAUC,IAC5B,QAAO;;QAGX,QAAO;;IAGTjQ;QACE,MAAMkQ,IAAW;QAIjB,OAHA7O,KAAKa,QAAQ0J;YACXsE,EAAIpN,KAAK8I;YAEJsE;;IAGTlQ;QACE,MAAM8N,IAAc;QAEpB,OADAzM,KAAKa,QAAQgN,KAAQpB,EAAOhL,KAAKoM,KAC1B,eAAepB,EAAOrJ,aAAa;;IAGpCzE,KAAKiP;QACX,MAAMnB,IAAS,IAAIkB,GAAU3N,KAAKX;QAElC,OADAoN,EAAOmB,OAAOA,GACPnB;;;;MAIE6B;IACX3P,YAAoBqP;kBAAAA;;IAEpBrP;QACE,OAAOqB,KAAKgO,GAAKG,KAAU3N;;IAG7B7B;QACE,OAAOqB,KAAKgO,GAAKE;;;;;;;;;;;;;;;;;;;GC1JrB,OAAMY,KAA2B,IAAI3D,GACnC1E,EAAYpH;;SAEE0P;IACd,OAAOD;;;SAQOE;IACd,OAAOD;;;AAST,MAAME,KAAqB,IAAI9D,GAC7B1E,EAAYpH;;SAEE6P;IACd,OAAOD;;;AAIT,MAAME,KAA6B,IAAIhE,GACrC1E,EAAYpH;;AAOd,MAAM+P,KAAyB,IAAIzB,GAAUlH,EAAYpH;;SACzCgQ,MAAkBC;IAChC,IAAIC,IAAMH;IACV,KAAK,MAAM5O,KAAO8O,GAChBC,IAAMA,EAAIf,IAAIhO;IAEhB,OAAO+O;;;AAIT,MAAMC,KAAsB,IAAI7B,GAAoB1O;;SACpCwQ;IACd,OAAOD;;;;;;;;;;;;;;;;;;;;;;;;UCpDIE;;IAcX/Q,YAAYgR;;;QAIR3P,KAAKX,IADHsQ,IACgB,CAACC,GAAcC,MAC/BF,EAAKC,GAAIC,MAAOpJ,EAAYpH,EAAWuQ,EAAGpP,KAAKqP,EAAGrP,OAElC,CAACoP,GAAcC,MAC/BpJ,EAAYpH,EAAWuQ,EAAGpP,KAAKqP,EAAGrP;QAGtCR,KAAK8P,KAAWZ,MAChBlP,KAAK+P,KAAY,IAAI5E,GAA0BnL,KAAKX;;;;;WArBtDV,UAAgBqR;QACd,OAAO,IAAIN,GAAYM,EAAO3Q;;IAuBhCV,IAAI6B;QACF,OAAiC,QAA1BR,KAAK8P,GAAStO,IAAIhB;;IAG3B7B,IAAI6B;QACF,OAAOR,KAAK8P,GAAStO,IAAIhB;;IAG3B7B;QACE,OAAOqB,KAAK+P,GAAUjE;;IAGxBnN;QACE,OAAOqB,KAAK+P,GAAUhE;;IAGxBpN;QACE,OAAOqB,KAAK+P,GAAUhP;;;;;WAOxBpC,QAAQ6B;QACN,MAAMyP,IAAMjQ,KAAK8P,GAAStO,IAAIhB;QAC9B,OAAOyP,IAAMjQ,KAAK+P,GAAUpK,QAAQsK,MAAQ;;IAG9CjL;QACE,OAAOhF,KAAK+P,GAAU/K;;kEAIxBrG,QAAQmP;QACN9N,KAAK+P,GAAU9D,GAAiB,CAACpK,GAAGC,OAClCgM,EAAGjM,KACI;;8DAKXlD,IAAIsR;;QAEF,MAAMV,IAAMvP,KAAKkQ,OAAOD,EAAIzP;QAC5B,OAAO+O,EAAI/D,KACT+D,EAAIO,GAASvE,GAAO0E,EAAIzP,KAAKyP,IAC7BV,EAAIQ,GAAUxE,GAAO0E,GAAK;;kDAK9BtR,OAAO6B;QACL,MAAMyP,IAAMjQ,KAAKwB,IAAIhB;QACrB,OAAKyP,IAIEjQ,KAAKwL,KAAKxL,KAAK8P,GAASpE,OAAOlL,IAAMR,KAAK+P,GAAUrE,OAAOuE,MAHzDjQ;;IAMXrB,QAAQ0B;QACN,MAAMA,aAAiBqP,KACrB,QAAO;QAET,IAAI1P,KAAKgF,SAAS3E,EAAM2E,MACtB,QAAO;QAGT,MAAMyJ,IAASzO,KAAK+P,GAAU1B,MACxBK,IAAUrO,EAAM0P,GAAU1B;QAChC,MAAOI,EAAOP,QAAW;YACvB,MAAMiC,IAAU1B,EAAON,KAAU3N,KAC3B4P,IAAW1B,EAAQP,KAAU3N;YACnC,KAAK2P,EAAQ7L,QAAQ8L,IACnB,QAAO;;QAGX,QAAO;;IAGTzR;QACE,MAAM0R,IAAuB;QAI7B,OAHArQ,KAAKa,QAAQoP;YACXI,EAAW5O,KAAKwO,EAAI7M;YAEI,MAAtBiN,EAAWvR,SACN,mBAEA,sBAAsBuR,EAAW7K,KAAK,UAAU;;IAInD7G,KACNmR,GACAC;QAEA,MAAMO,IAAS,IAAIZ;QAInB,OAHAY,EAAOjR,IAAaW,KAAKX,GACzBiR,EAAOR,KAAWA,GAClBQ,EAAOP,KAAYA,GACZO;;;;;;;;;;;;;;;;;;;;;;;UClHEC;IAAb5R;QACEqB,UAAoB,IAAImL,GACtB1E,EAAYpH;;IAGdV,MAAM6R;QACJ,MAAMhQ,IAAMgQ,EAAOP,IAAIzP,KACjBiQ,IAAYzQ,KAAK0Q,GAAUlP,IAAIhB;QAChCiQ;;0BAOHD,EAAOG,6BACPF,EAAUE,OAEV3Q,KAAK0Q,KAAY1Q,KAAK0Q,GAAUnF,GAAO/K,GAAKgQ,0BAE5CA,EAAOG,4BACPF,EAAUE,OAEV3Q,KAAK0Q,KAAY1Q,KAAK0Q,GAAUnF,GAAO/K,GAAK;YAC1CmQ,MAAMF,EAAUE;YAChBV,KAAKO,EAAOP;kCAGdO,EAAOG,6BACPF,EAAUE,OAEV3Q,KAAK0Q,KAAY1Q,KAAK0Q,GAAUnF,GAAO/K,GAAK;YAC1CmQ;YACAV,KAAKO,EAAOP;kCAGdO,EAAOG,0BACPF,EAAUE,OAEV3Q,KAAK0Q,KAAY1Q,KAAK0Q,GAAUnF,GAAO/K,GAAK;YAC1CmQ;YACAV,KAAKO,EAAOP;iCAGdO,EAAOG,0BACPF,EAAUE,OAEV3Q,KAAK0Q,KAAY1Q,KAAK0Q,GAAUhF,OAAOlL,yBAEvCgQ,EAAOG,6BACPF,EAAUE,OAEV3Q,KAAK0Q,KAAY1Q,KAAK0Q,GAAUnF,GAAO/K,GAAK;YAC1CmQ;YACAV,KAAKQ,EAAUR;+BAGjBO,EAAOG,4BACPF,EAAUE,OAEV3Q,KAAK0Q,KAAY1Q,KAAK0Q,GAAUnF,GAAO/K,GAAK;YAC1CmQ;YACAV,KAAKO,EAAOP;;;;;;;;;QAUd1S,MA/DAyC,KAAK0Q,KAAY1Q,KAAK0Q,GAAUnF,GAAO/K,GAAKgQ;;IAwEhD7R;QACE,MAAMiS,IAAgC;QAMtC,OALA5Q,KAAK0Q,GAAUzE,GACb,CAACzL,GAAkBgQ;YACjBI,EAAQnP,KAAK+O;YAGVI;;;;MAIEC;IACXlS,YACWmS,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC;QAPArR,aAAA8Q,GACA9Q,YAAA+Q,aACAC,GACAhR,kBAAAiR,aACAC,GACAlR,iBAAAmR;kBACAC,aACAC;;sFAIX1S,UACEmS,GACAQ,GACAJ,GACAC;QAEA,MAAMP,IAAgC;QAKtC,OAJAU,EAAUzQ,QAAQoP;YAChBW,EAAQnP,KAAK;gBAAEkP;gBAAwBV,KAAAA;;YAGlC,IAAIY,GACTC,GACAQ,GACA5B,GAAY6B,GAASD,IACrBV,GACAM,GACAC;iCACwB;wCACO;;IAInCK;QACE,QAAQxR,KAAKkR,GAAYnQ;;IAG3BpC,QAAQ0B;QACN,MACEL,KAAKmR,cAAc9Q,EAAM8Q,aACzBnR,KAAKoR,OAAqB/Q,EAAM+Q,MAC/BpR,KAAKkR,GAAY5M,QAAQjE,EAAM6Q,OAC/BO,GAAYzR,KAAK8Q,OAAOzQ,EAAMyQ,UAC9B9Q,KAAK+Q,KAAKzM,QAAQjE,EAAM0Q,SACxB/Q,KAAKgR,GAAQ1M,QAAQjE,EAAM2Q,MAE5B,QAAO;QAET,MAAMJ,IAAgC5Q,KAAKiR,YACrCS,IAAqCrR,EAAM4Q;QACjD,IAAIL,EAAQ9R,WAAW4S,EAAa5S,QAClC,QAAO;QAET,KAAK,IAAIR,IAAI,GAAGA,IAAIsS,EAAQ9R,QAAQR,KAClC,IACEsS,EAAQtS,GAAGqS,SAASe,EAAapT,GAAGqS,SACnCC,EAAQtS,GAAG2R,IAAI3L,QAAQoN,EAAapT,GAAG2R,MAExC,QAAO;QAGX,QAAO;;;;;;;;;;;;;;;;;;;;;;;;UCzKE0B;IACXhT;;;;IAIW+L;;;;IAIAkH;;;;;IAKAC;;;;;IAKAC;;;;IAIAC;iBAlBArH,aAIAkH,aAKAC,aAKAC,aAIAC;;;;;;;;;IAUXpT,UACE4L,GACAnE;QAEA,MAAMwL,IAAgB,IAAII;QAQ1B,OAPAJ,EAAcrC,IACZhF,GACA0H,GAAaC,GACX3H,GACAnE,KAGG,IAAIuL,GACTxN,EAAgBkB,OAChBuM,GACAnC,MACAV,MACAM;;;;;;;;;;;UAaO4C;IACXtT;;;;;;;IAOWiM;;;;;;IAMAxE;;;;;IAKA+L;;;;;IAKAC;;;;;IAKAC;QArBArS,mBAAA4K,aAMAxE,aAKA+L,aAKAC,aAKAC;;;;;;WAQX1T,UACE4L,GACAnE;QAEA,OAAO,IAAI6L,GACTrI,GAAWiB,GACXzE,GACAiJ,MACAA,MACAA;;;;;;;;;;;;;;;;;;;;;;;;;UC1FOiD;IACX3T;;IAES4T;;IAEAC;;IAEAhS;;;;;IAKAiS;kBATAF,GAEAvS,wBAAAwS,GAEAxS,WAAAQ,aAKAiS;;;;MAIEC;IACX/T,YACS4L,GACAoI;QADA3S,gBAAAuK,aACAoI;;;;MAYEC;IACXjU;;IAESkU;;IAEAC;;;;;;;IAOAlI,IAA0BhB,GAAWiB;2DAErCkI,IAA+B;QAX/B/S,aAAA6S,GAEA7S,iBAAA8S,GAOA9S,mBAAA4K,GAEA5K,aAAA+S;;;;mDAKX,OAAMC;IAANrU;;;;;QAKEqB,UAA2B;;;;;;;QAQ3BA,UAGIiT;;QAGJjT,UAAmC4J,GAAWiB,GAC9C7K,WAAmB;;;;;;QAOnBA,WAA6B;;;;;;;;;WAU7BkT;QACE,OAAOlT,KAAKmT;;gEAIdvI;QACE,OAAO5K,KAAKoT;;6EAIdC;QACE,OAAiC,MAA1BrT,KAAKsT;;iFAIdC;QACE,OAAOvT,KAAKwT;;;;;WAOd7U,GAAkBiM;QACZA,EAAY6I,MAAwB,MACtCzT,KAAKwT,MAAqB,GAC1BxT,KAAKoT,KAAexI;;;;;;;WAUxBjM;QACE,IAAIwT,IAAiB9C,MACjB+C,IAAoB/C,MACpBgD,IAAmBhD;QAkBvB,OAhBArP,KAAK0T,GAAgB7S,QAAQ,CAACL,GAAKmT;YACjC,QAAQA;cACN;gBACExB,IAAiBA,EAAe3D,IAAIhO;gBACpC;;cACF;gBACE4R,IAAoBA,EAAkB5D,IAAIhO;gBAC1C;;cACF;gBACE6R,IAAmBA,EAAiB7D,IAAIhO;gBACxC;;cACF;gBACEjD;;YAIC,IAAI0U,GACTjS,KAAKoT,IACLpT,KAAKmT,IACLhB,GACAC,GACAC;;;;WAOJ1T;QACEqB,KAAKwT,MAAqB,GAC1BxT,KAAK0T,KAAkBT;;IAGzBtU,GAAkB6B,GAAkBmT;QAClC3T,KAAKwT,MAAqB,GAC1BxT,KAAK0T,KAAkB1T,KAAK0T,GAAgBnI,GAAO/K,GAAKmT;;IAG1DhV,GAAqB6B;QACnBR,KAAKwT,MAAqB,GAC1BxT,KAAK0T,KAAkB1T,KAAK0T,GAAgBhI,OAAOlL;;IAGrD7B;QACEqB,KAAKsT,MAAoB;;IAG3B3U;QACEqB,KAAKsT,MAAoB;;IAG3B3U;QACEqB,KAAKwT,MAAqB,GAC1BxT,KAAKmT,MAAW;;;;;;;MA2BPS;IACXjV,YAAoBkV;kBAAAA;;QAGpB7T,UAAuB,IAAIgS;;QAG3BhS,UAAiC+O;;QAGjC/O,UAAuC8T;;;;;;QAOvC9T,UAA8B,IAAI2N,GAAoB1O;;;;WAKtDN,GAAqBoV;QACnB,KAAK,MAAMxJ,KAAYwJ,EAAUxB,IAC3BwB,EAAUtB,cAAkBuB,KAC9BhU,KAAKiU,GAAoB1J,GAAUwJ,EAAUtB,MACpCsB,EAAUtB,cAAkByB,MACrClU,KAAKmU,GACH5J,GACAwJ,EAAUvT,KACVuT,EAAUtB;QAKhB,KAAK,MAAMlI,KAAYwJ,EAAUvB,kBAC/BxS,KAAKmU,GAAyB5J,GAAUwJ,EAAUvT,KAAKuT,EAAUtB;;sFAKrE9T,GAAmByV;QACjBpU,KAAKqU,GAAcD,GAAc7J;YAC/B,MAAM+J,IAActU,KAAKuU,GAAkBhK;YAC3C,QAAQ6J,EAAavB;cACnB;gBACM7S,KAAKwU,GAAejK,MACtB+J,EAAYG,GAAkBL,EAAaxJ;gBAE7C;;cACF;;;gBAGE0J,EAAYI,MACPJ,EAAYK;;;;gBAIfL,EAAYM,MAEdN,EAAYG,GAAkBL,EAAaxJ;gBAC3C;;cACF;;;;;gBAKE0J,EAAYI,MACPJ,EAAYK,MACf3U,KAAK6U,aAAatK;gBAMpB;;cACF;gBACMvK,KAAKwU,GAAejK,OACtB+J,EAAYQ,MACZR,EAAYG,GAAkBL,EAAaxJ;gBAE7C;;cACF;gBACM5K,KAAKwU,GAAejK;;;;gBAItBvK,KAAK+U,GAAYxK,IACjB+J,EAAYG,GAAkBL,EAAaxJ;gBAE7C;;cACF;gBACErN;;;;;;;;WAURoB,GACEyV,GACAtT;QAEIsT,EAAatB,UAAUhU,SAAS,IAClCsV,EAAatB,UAAUjS,QAAQC,KAE/Bd,KAAKgV,GAAanU,QAAQ,CAACc,GAAG4I;YACxBvK,KAAKwU,GAAejK,MACtBzJ,EAAGyJ;;;;;;;WAWX5L,GAAsBsW;QACpB,MAAM1K,IAAW0K,EAAY1K,UACvB2K,IAAgBD,EAAYtC,GAAgBpS,OAE5C4U,IAAanV,KAAKoV,GAA0B7K;QAClD,IAAI4K,GAAY;YACd,MAAMrN,IAASqN,EAAWrN;YAC1B,IAAIsB,GAAiBtB,IACnB,IAAsB,MAAlBoN,GAAqB;;;;;;;gBAOvB,MAAM1U,IAAM,IAAIiG,EAAYqB,EAAOpC;gBACnC1F,KAAKmU,GACH5J,GACA/J,GACA,IAAI0T,GAAW1T,GAAK2D,EAAgBkB;mBAxWpC1H,EA4WkB,MAAlBuX,SAIC;gBACelV,KAAKqV,GAAiC9K,OACtC2K;;;gBAGlBlV,KAAK+U,GAAYxK,IACjBvK,KAAKsV,KAAsBtV,KAAKsV,GAAoB9G,IAAIjE;;;;;;;WAUhE5L,GAAkB+L;QAChB,MAAMkH,IAAgB,IAAII;QAE1BhS,KAAKgV,GAAanU,QAAQ,CAACyT,GAAa/J;YACtC,MAAM4K,IAAanV,KAAKoV,GAA0B7K;YAClD,IAAI4K,GAAY;gBACd,IAAIb,EAAYlO,MAAWgD,GAAiB+L,EAAWrN,SAAS;;;;;;;;;oBAU9D,MAAMtH,IAAM,IAAIiG,EAAY0O,EAAWrN,OAAOpC;oBAEH,SAAzC1F,KAAKuV,GAAuB/T,IAAIhB,MAC/BR,KAAKwV,GAAuBjL,GAAU/J,MAEvCR,KAAKmU,GACH5J,GACA/J,GACA,IAAI0T,GAAW1T,GAAKkK;;gBAKtB4J,EAAYmB,OACd7D,EAAcrC,IAAIhF,GAAU+J,EAAYoB,OACxCpB,EAAYM;;;QAKlB,IAAI7C,IAAyB1C;;;;;;gBAO7BrP,KAAK2V,GAA6B9U,QAAQ,CAACL,GAAKoV;YAC9C,IAAIC,KAAoB;YAExBD,EAAQE,GAAavL;gBACnB,MAAM4K,IAAanV,KAAKoV,GAA0B7K;gBAClD,QACE4K,iCACAA,EAAW3K,MAEXqL,KAAoB,IACb;gBAMPA,MACF9D,IAAyBA,EAAuBvD,IAAIhO;;QAIxD,MAAMuV,IAAc,IAAIpE,GACtBjH,GACAkH,GACA5R,KAAKsV,IACLtV,KAAKuV,IACLxD;QAOF,OAJA/R,KAAKuV,KAAyBxG,MAC9B/O,KAAK2V,KAA+B7B,MACpC9T,KAAKsV,KAAsB,IAAI3H,GAAoB1O,IAE5C8W;;;;;;;IAQTpX,GAAoB4L,GAAoByL;QACtC,KAAKhW,KAAKwU,GAAejK,IACvB;QAGF,MAAMoJ,IAAa3T,KAAKwV,GAAuBjL,GAAUyL,EAASxV;QAI9CR,KAAKuU,GAAkBhK,GAC/B0L,GAAkBD,EAASxV,KAAKmT,IAE5C3T,KAAKuV,KAAyBvV,KAAKuV,GAAuBhK,GACxDyK,EAASxV,KACTwV,IAGFhW,KAAK2V,KAA+B3V,KAAK2V,GAA6BpK,GACpEyK,EAASxV,KACTR,KAAKkW,GAA4BF,EAASxV,KAAKgO,IAAIjE;;;;;;;;;;IAYvD5L,GACE4L,GACA/J,GACA2V;QAEA,KAAKnW,KAAKwU,GAAejK,IACvB;QAGF,MAAM+J,IAActU,KAAKuU,GAAkBhK;QACvCvK,KAAKwV,GAAuBjL,GAAU/J,KACxC8T,EAAY2B,GAAkBzV;;;QAI9B8T,EAAY8B,GAAqB5V,IAGnCR,KAAK2V,KAA+B3V,KAAK2V,GAA6BpK,GACpE/K,GACAR,KAAKkW,GAA4B1V,GAAK0P,OAAO3F,KAG3C4L,MACFnW,KAAKuV,KAAyBvV,KAAKuV,GAAuBhK,GACxD/K,GACA2V;;IAKNxX,aAAa4L;QACXvK,KAAKgV,GAAa9E,OAAO3F;;;;;;WAQnB5L,GAAiC4L;QACvC,MACM6J,IADcpU,KAAKuU,GAAkBhK,GACVmL;QACjC,OACE1V,KAAK6T,GAAiBwC,GAAuB9L,GAAUvF,OACvDoP,EAAajC,GAAenN,OAC5BoP,EAAa/B,GAAiBrN;;;;;WAQlCrG,GAA2B4L;QAELvK,KAAKuU,GAAkBhK,GAC/B+L;;IAGN3X,GAAkB4L;QACxB,IAAIkC,IAASzM,KAAKgV,GAAaxT,IAAI+I;QAKnC,OAJKkC,MACHA,IAAS,IAAIuG,IACbhT,KAAKgV,GAAazF,IAAIhF,GAAUkC,KAE3BA;;IAGD9N,GAA4B6B;QAClC,IAAI+V,IAAgBvW,KAAK2V,GAA6BnU,IAAIhB;QAU1D,OARK+V,MACHA,IAAgB,IAAI5I,GAAoB1O,IACxCe,KAAK2V,KAA+B3V,KAAK2V,GAA6BpK,GACpE/K,GACA+V,KAIGA;;;;;;WAQC5X,GAAe4L;QACvB,MAAMiM,IAA4D,SAA7CxW,KAAKoV,GAA0B7K;QAIpD,OAHKiM,KACHja,EAxXU,yBAwXQ,4BAA4BgO,IAEzCiM;;;;;WAOC7X,GAA0B4L;QAClC,MAAM+J,IAActU,KAAKgV,GAAaxT,IAAI+I;QAC1C,OAAO+J,KAAeA,EAAYK,KAC9B,OACA3U,KAAK6T,GAAiB4C,GAAuBlM;;;;;;WAQ3C5L,GAAY4L;QAKlBvK,KAAKgV,GAAazF,IAAIhF,GAAU,IAAIyI,KAKfhT,KAAK6T,GAAiBwC,GAAuB9L,GACrD1J,QAAQL;YACnBR,KAAKmU,GAAyB5J,GAAU/J,wBAA0B;;;;;;WAO9D7B,GACN4L,GACA/J;QAGA,OADqBR,KAAK6T,GAAiBwC,GAAuB9L,GAC9CgE,IAAI/N;;;;AAI5B,SAASsT;IACP,OAAO,IAAI3I,GACT1E,EAAYpH;;;AAIhB,SAAS4T;IACP,OAAO,IAAI9H,GAAmC1E,EAAYpH;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;aCloB5CqX,GAAkBvZ;;IAEhC,OAPgC,sDAMlBA,QAAAA,aAAAA,EAAOwZ,uCAAUC,WAAU,IAAY,uCAAGC;;;;;;;;;SAkD1CC,GAAkB3Z;IAChC,MAAM4Z,IAAiBC,GACrB7Z,EAAMwZ,SAAUC,OAA4B,qBAAiB;IAE/D,OAAO,IAAItT,EAAUyT,EAAexT,SAASwT,EAAeE;;;;;;;;;;;;;;;;;;;oECnE9D;MAAMC,KAAwB,IAAIC,OAChC;;0EAIcC,GAAUja;IACxB,OAAI,eAAeA,wBAER,kBAAkBA,2BAElB,kBAAkBA,KAAS,iBAAiBA,0BAE5C,oBAAoBA,6BAEpB,iBAAiBA,0BAEjB,gBAAgBA,wBAEhB,oBAAoBA,uBAEpB,mBAAmBA,4BAEnB,gBAAgBA,yBAEhB,cAAcA,IACnBuZ,GAAkBvZ,2DAnCSI;;;sFA6CnB2L,GAAYhK,GAAiBC;IAC3C,MAAMkY,IAAWD,GAAUlY;IAE3B,IAAImY,MADcD,GAAUjY,IAE1B,QAAO;IAGT,QAAQkY;MACN;QACE,QAAO;;MACT;QACE,OAAOnY,EAAKoY,iBAAiBnY,EAAMmY;;MACrC;QACE,OAAOR,GAAkB5X,GAAMoF,QAAQwS,GAAkB3X;;MAC3D;QACE,OAwBN,SAAyBD,GAAiBC;YACxC,IACiC,mBAAxBD,EAAKqY,kBACoB,mBAAzBpY,EAAMoY,kBACbrY,EAAKqY,eAAezY,WAAWK,EAAMoY,eAAezY;;YAGpD,OAAOI,EAAKqY,mBAAmBpY,EAAMoY;YAGvC,MAAMC,IAAgBR,GAAmB9X,EAAoB,iBACvDuY,IAAiBT,GAAmB7X,EAAqB;YAC/D,OACEqY,EAAcjU,YAAYkU,EAAelU,WACzCiU,EAAcP,UAAUQ,EAAeR;SAtC9BS,CAAgBxY,GAAMC;;MAC/B;QACE,OAAOD,EAAK2X,gBAAgB1X,EAAM0X;;MACpC;QACE,OA+CN,SAAoB3X,GAAiBC;YACnC,OAAOwY,GAAoBzY,EAAgB,YAAEoF,QAC3CqT,GAAoBxY,EAAiB;SAjD5ByY,CAAW1Y,GAAMC;;MAC1B;QACE,OAAOD,EAAK2Y,mBAAmB1Y,EAAM0Y;;MACvC;QACE,OAkCN,SAAwB3Y,GAAiBC;YACvC,OACE2Y,GAAgB5Y,EAAK6Y,cAAeC,cAClCF,GAAgB3Y,EAAM4Y,cAAeC,aACvCF,GAAgB5Y,EAAK6Y,cAAeE,eAClCH,GAAgB3Y,EAAM4Y,cAAeE;SAvC9BC,CAAehZ,GAAMC;;MAC9B;QACE,gBA+CuBD,GAAiBC;YAC5C,IAAI,kBAAkBD,KAAQ,kBAAkBC,GAC9C,OACE2Y,GAAgB5Y,EAAKiZ,kBAAkBL,GAAgB3Y,EAAMgZ;YAE1D,IAAI,iBAAiBjZ,KAAQ,iBAAiBC,GAAO;gBAC1D,MAAMiZ,IAAKN,GAAgB5Y,EAAiB,cACtCmZ,IAAKP,GAAgB3Y,EAAkB;gBAE7C,OAAIiZ,MAAOC,IACFrR,EAAeoR,OAAQpR,EAAeqR,KAEtCC,MAAMF,MAAOE,MAAMD;;YAI9B,QAAO;SA/DIE,CAAarZ,GAAMC;;MAC5B;QACE,OAAOC,EACLF,EAAKsZ,WAAYC,UAAU,IAC3BtZ,EAAMqZ,WAAYC,UAAU,IAC5BvP;;MAEJ;QACE,OA0DN,SAAsBhK,GAAiBC;YACrC,MAAMuZ,IAAUxZ,EAAKyX,SAAUC,UAAU,IACnC+B,IAAWxZ,EAAMwX,SAAUC,UAAU;YAE3C,IAAItW,EAAWoY,OAAapY,EAAWqY,IACrC,QAAO;YAGT,KAAK,MAAMnY,KAAOkY,GAChB,IAAIA,EAAQ/X,eAAeH,YAELc,MAAlBqX,EAASnY,OACR0I,GAAYwP,EAAQlY,IAAMmY,EAASnY,MAEpC,QAAO;YAIb,QAAO;;6EA5EIoY,EAAa1Z,GAAMC;;MAC5B;QACE,OAhF6B5B;;;;SA8JnBsb,GACdC,GACAC;IAEA,YACgEzX,OAA7DwX,EAASL,UAAU,IAAIO,KAAKlX,KAAKoH,GAAYpH,GAAGiX;;;SAIrCE,GAAa/Z,GAAiBC;IAC5C,MAAMkY,IAAWD,GAAUlY,IACrBga,IAAY9B,GAAUjY;IAE5B,IAAIkY,MAAa6B,GACf,OAAOja,EAAoBoY,GAAU6B;IAGvC,QAAQ7B;MACN;QACE,OAAO;;MACT;QACE,OAAOpY,EAAoBC,EAAkB,cAAEC,EAAmB;;MACpE;QACE,OAyBN,SAAwBD,GAAiBC;YACvC,MAAMga,IAAarB,GAAgB5Y,EAAKiZ,gBAAgBjZ,EAAKka,cACvDC,IAAcvB,GAAgB3Y,EAAMgZ,gBAAgBhZ,EAAMia;YAEhE,OAAID,IAAaE,KACP,IACCF,IAAaE,IACf,IACEF,MAAeE,IACjB;;YAGHf,MAAMa,KACDb,MAAMe,KAAe,KAAK,IAE1B;SAxCAC,CAAepa,GAAMC;;MAC9B;QACE,OAAOoa,GAAkBra,EAAoB,gBAAEC,EAAqB;;MACtE;QACE,OAAOoa,GACLzC,GAAkB5X,IAClB4X,GAAkB3X;;MAEtB;QACE,OAAOF,EAAoBC,EAAiB,aAAEC,EAAkB;;MAClE;QACE,OAkFN,SACED,GACAC;YAEA,MAAMqa,IAAY7B,GAAoBzY,IAChCua,IAAa9B,GAAoBxY;YACvC,OAAOqa,EAAUE,EAAUD;SAxFhBE,CAAaza,EAAgB,YAAEC,EAAiB;;MACzD;QACE,OAsDN,SAA2Bya,GAAkBC;YAC3C,MAAMC,IAAeF,EAAShU,MAAM,MAC9BmU,IAAgBF,EAAUjU,MAAM;YACtC,KAAK,IAAItH,IAAI,GAAGA,IAAIwb,EAAahb,UAAUR,IAAIyb,EAAcjb,QAAQR,KAAK;gBACxE,MAAM0b,IAAa/a,EAAoB6a,EAAaxb,IAAIyb,EAAczb;gBACtE,IAAmB,MAAf0b,GACF,OAAOA;;YAGX,OAAO/a,EAAoB6a,EAAahb,QAAQib,EAAcjb;SA/DnDmb,CAAkB/a,EAAoB,gBAAEC,EAAqB;;MACtE;QACE,OAgEN,SAA0BD,GAAkBC;YAC1C,MAAM6a,IAAa/a,EACjB6Y,GAAgB5Y,EAAK8Y,WACrBF,GAAgB3Y,EAAM6Y;YAExB,IAAmB,MAAfgC,GACF,OAAOA;YAET,OAAO/a,EACL6Y,GAAgB5Y,EAAK+Y,YACrBH,GAAgB3Y,EAAM8Y;SA1EbiC,CAAiBhb,EAAmB,eAAEC,EAAoB;;MACnE;QACE,OAqFN,SAAuBD,GAAsBC;YAC3C,MAAMgb,IAAYjb,EAAKuZ,UAAU,IAC3B2B,IAAajb,EAAMsZ,UAAU;YAEnC,KAAK,IAAIna,IAAI,GAAGA,IAAI6b,EAAUrb,UAAUR,IAAI8b,EAAWtb,UAAUR,GAAG;gBAClE,MAAM+b,IAAUpB,GAAakB,EAAU7b,IAAI8b,EAAW9b;gBACtD,IAAI+b,GACF,OAAOA;;YAGX,OAAOpb,EAAoBkb,EAAUrb,QAAQsb,EAAWtb;SA/F7Cwb,CAAcpb,EAAgB,YAAEC,EAAiB;;MAC1D;QACE,OAgGN,SAAqBD,GAAoBC;YACvC,MAAMuZ,IAAUxZ,EAAK0X,UAAU,IACzB2D,IAAW9Z,OAAO6O,KAAKoJ,IACvBC,IAAWxZ,EAAMyX,UAAU,IAC3B4D,IAAY/Z,OAAO6O,KAAKqJ;;;;;YAM9B4B,EAASE,QACTD,EAAUC;YAEV,KAAK,IAAInc,IAAI,GAAGA,IAAIic,EAASzb,UAAUR,IAAIkc,EAAU1b,UAAUR,GAAG;gBAChE,MAAMoc,IAAazb,EAAoBsb,EAASjc,IAAIkc,EAAUlc;gBAC9D,IAAmB,MAAfoc,GACF,OAAOA;gBAET,MAAML,IAAUpB,GAAaP,EAAQ6B,EAASjc,KAAKqa,EAAS6B,EAAUlc;gBACtE,IAAgB,MAAZ+b,GACF,OAAOA;;YAIX,OAAOpb,EAAoBsb,EAASzb,QAAQ0b,EAAU1b;;;;;GAxH3C6b,EAAYzb,EAAc,UAAEC,EAAe;;MACpD;QACE,MA1M6B5B;;;;AAkOnC,SAASgc,GAAkBra,GAAqBC;IAC9C,IACkB,mBAATD,KACU,mBAAVC,KACPD,EAAKJ,WAAWK,EAAML,QAEtB,OAAOG,EAAoBC,GAAMC;IAGnC,MAAMqY,IAAgBR,GAAmB9X,IACnCuY,IAAiBT,GAAmB7X,IAEpC6a,IAAa/a,EACjBuY,EAAcjU,SACdkU,EAAelU;IAEjB,OAAmB,MAAfyW,IACKA,IAEF/a,EAAoBuY,EAAcP,OAAOQ,EAAeR;;;SAkFjDhP,GAAY9K;IAC1B,OAAOyd,GAAczd;;;AAGvB,SAASyd,GAAczd;IACrB,OAAI,eAAeA,IACV,SACE,kBAAkBA,IACpB,KAAKA,EAAMma,eACT,kBAAkBna,IACpB,KAAKA,EAAMgb,eACT,iBAAiBhb,IACnB,KAAKA,EAAMic,cACT,oBAAoBjc,IAuBjC,SAA2BiH;QACzB,MAAMyW,IAAsB7D,GAAmB5S;QAC/C,OAAO,QAAQyW,EAAoBtX,WAAWsX,EAAoB5D;KAxBzD6D,CAAkB3d,EAAqB,kBACrC,iBAAiBA,IACnBA,EAAM0Z,cACJ,gBAAgB1Z,IAgBpBwa,GAfqBxa,EAAiB,YAeN4d,aAd5B,oBAAoB5d,KA0BN0a,IAzBE1a,EAAqB;IA0BzCsJ,EAAYuU,EAASnD,GAAgBzU,cAzBjC,mBAAmBjG,IAqBvB,QADiB8d,IAnBE9d,EAAoB,eAoBvB6a,YAAYiD,EAAShD,eAnBjC,gBAAgB9a,IA4C7B,SAAuBqb;QACrB,IAAI/L,IAAS,KACTyO,KAAQ;QACZ,KAAK,MAAM/d,KAASqb,EAAWC,UAAU,IAClCyC,IAGHA,KAAQ,IAFRzO,KAAU,KAIZA,KAAUmO,GAAczd;QAE1B,OAAOsP,IAAS;;;;;GAtDP0O,EAAche,EAAiB,cAC7B,cAAcA,IAwB3B,SAAqBwZ;;;QAGnB,MAAMyE,IAAa3a,OAAO6O,KAAKqH,EAASC,UAAU,IAAI6D;QAEtD,IAAIhO,IAAS,KACTyO,KAAQ;QACZ,KAAK,MAAM1a,KAAO4a,GACXF,IAGHA,KAAQ,IAFRzO,KAAU,KAIZA,KAAU,GAAGjM,KAAOoa,GAAcjE,EAASC,OAAQpW;QAErD,OAAOiM,IAAS;KAtCP4O,CAAYle,EAAe,YAjWHI;IAgXnC,IAA0B0d,GAICpD;;;SAiGXb,GACdpT;;;;IAOA,IAzcoDjG,IAocvCiG,IAKO,mBAATA,GAAmB;;;;QAK5B,IAAIqT,IAAQ;QACZ,MAAMqE,IAAWpE,GAAsBqE,KAAK3X;QAE5C,IAjdkDjG,IAgdrC2d,IACTA,EAAS,IAAI;;YAEf,IAAIE,IAAUF,EAAS;YACvBE,KAAWA,IAAU,aAAaC,OAAO,GAAG,IAC5CxE,IAAQ/P,OAAOsU;;;gBAIjB,MAAME,IAAa,IAAIhY,KAAKE;QAG5B,OAAO;YAAEL,SAFOhF,KAAKC,MAAMkd,EAAW7X,YAAY;YAEhCoT,OAAAA;;;IAOlB,OAAO;QAAE1T,SAFOuU,GAAgBlU,EAAKL;QAEnB0T,OADJa,GAAgBlU,EAAKqT;;;;;;;aASvBa,GAAgB3a;;IAE9B,OAAqB,mBAAVA,IACFA,IACmB,mBAAVA,IACT+J,OAAO/J,KAEP;;;+EAKKwa,GAAoBgE;IAClC,OAAoB,mBAATA,IACF/R,GAAWgS,iBAAiBD,KAE5B/R,GAAWiS,eAAeF;;;6EAKrBG,GAASnc,GAAwBa;IAC/C,OAAO;QACLqX,gBAAgB,YAAYlY,EAAWO,uBACrCP,EAAWQ,sBACCK,EAAIkF,KAAKD;;;;6DAKX0B,GACdhK;IAEA,SAASA,KAAS,kBAAkBA;;;;;SAgBtB4e,GACd5e;IAEA,SAASA,KAAS,gBAAgBA;;;wDAWpB6e,GACd7e;IAEA,SAASA,KAAS,eAAeA;;;gDAInB8e,GACd9e;IAEA,SAASA,KAAS,iBAAiBA,KAASmb,MAAMpR,OAAO/J,EAAMic;;;uDAIjD8C,GACd/e;IAEA,SAASA,KAAS,cAAcA;;;;;;;;;;;;;;;;;;GCthBlC,OAAMgf,KAAa;IACjB,MAAMC,IAA8C;QACpDC,KAA4B;QAC5BC,MAA6B;;IAC7B,OAAOF;EAJU,IAObG,KAAY;IAChB,MAAMC,IAA2C;QACjDC,KAA0B;QAC1BC,MAAmC;QACnCC,KAA6B;QAC7BC,MAAsC;QACtCC,MAAsB;QACtBC,kBAA+B;QAC/BC,IAAmB;QACnBC,sBAAmC;;IACnC,OAAOR;EAVS;;;;;;;;;;;;;;;;MA+BLS;IACXte,YACWgB,GACAud;iBADAvd,aACAud;;;;;;;SA+CGC,GAAUhgB;IACxB,OAAO;QAAEgb,cAAc,KAAKhb;;;;;;;aAOdigB,GACdC,GACAlgB;IAEA,IAAIkgB,EAAWH,IAAe;QAC5B,IAAI5E,MAAMnb,IACR,OAAO;YAAEic,aAAa;;QACjB,IAAIjc,MAAUmgB,IAAAA,GACnB,OAAO;YAAElE,aAAa;;QACjB,IAAIjc,OAAWmgB,IAAAA,GACpB,OAAO;YAAElE,aAAa;;;IAG1B,OAAO;QAAEA,aAAapS,EAAe7J,KAAS,OAAOA;;;;;;;;aAQvCogB,GACdF,GACAlgB;IAEA,OAAO8J,EAAc9J,KAASggB,GAAUhgB,KAASigB,GAASC,GAAYlgB;;;;;aAMxDqgB,GACdH,GACAjZ;IAEA,IAAIiZ,EAAWH,IAAe;QAU5B,OAAO,GANW,IAAIxZ,KAAyB,MAApBU,EAAUb,SAAgBka,cAEnBvX,QAAQ,SAAS,IAAIA,QAAQ,KAAK,QAEnD,cAAc9B,EAAUZ,aAAaoB,OAAO;;IAI7D,OAAO;QACLrB,SAAS,KAAKa,EAAUb;QACxB0T,OAAO7S,EAAUZ;;;;;;;;;SAgBPka,GACdL,GACAlf;IAEA,OAAIkf,EAAWH,KACN/e,EAAM4c,aAEN5c,EAAMwf;;;;;aA0BDC,GACdP,GACAQ;IAEA,OAAOL,GAAYH,GAAYQ,EAAQL;;;SAGzBM,GAAYD;IAE1B,OAxOFlgB,IAuOekgB,IACN1Z,EAAgB4Z,EApDzB,SAAuBna;QACrB,MAAMQ,IAAY4S,GAAmBpT;QACrC,OAAO,IAAIN,EAAUc,EAAUb,SAASa,EAAU6S;KAkDb8G,CAAcF;;;SAGrCG,GACdre,GACA+F;IAEA,OA0EF,SAAkC/F;QAChC,OAAO,IAAI2F,EAAa,EACtB,YACA3F,EAAWO,WACX,aACAP,EAAWQ;KA/EN8d,CAAyBte,GAC7Bue,MAAM,aACNA,MAAMxY,GACND;;;AAGL,SAAS0Y,GAAiB9a;IACxB,MAAM+a,IAAW9Y,EAAaoB,EAAWrD;IAKzC,OA3PF1F,EAwPI0gB,GAAoBD,KAGfA;;;SAGOE,GACdjB,GACA7c;IAEA,OAAOwd,GAAeX,EAAW1d,GAAYa,EAAIkF;;;SAGnCsV,GACdqC,GACAha;IAEA,MAAM+a,IAAWD,GAAiB9a;IAgBlC,OAzRF1F,EA2QIygB,EAAS5c,IAAI,OAAO6b,EAAW1d,EAAWO,YA3Q9CvC,GAkRMygB,EAAS5c,IAAI,OAAO6b,EAAW1d,EAAWQ,YAC1Cie,EAAS5c,IAAI,OAAO6b,EAAW1d,EAAWQ;IAMvC,IAAIsG,EAAY8X,GAAiCH;;;AAG1D,SAASI,GACPnB,GACA3X;IAEA,OAAOsY,GAAeX,EAAW1d,GAAY+F;;;AAG/C,SAAS+Y,GAAcpb;IACrB,MAAMqb,IAAeP,GAAiB9a;;;;;QAKtC,OAA4B,MAAxBqb,EAAa5f,SACRwG,EAAaqZ,MAEfJ,GAAiCG;;;SAG1BE,GAAqBvB;IAOnC,OANa,IAAI/X,EAAa,EAC5B,YACA+X,EAAW1d,EAAWO,WACtB,aACAmd,EAAW1d,EAAWQ,YAEZsF;;;AAYd,SAAS8Y,GACPG;IAMA,OAzUF/gB,EAsUI+gB,EAAa5f,SAAS,KAA6B,gBAAxB4f,EAAald,IAAI,KAGvCkd,EAAa/X,EAAS;;;wFAIfkY,GACdxB,GACA7c,GACAoW;IAEA,OAAO;QACLvT,MAAMib,GAAOjB,GAAY7c;QACzBoW,QAAQA,EAAOkI,MAAMnI,SAASC;;;;SAiElBmI,GACd1B,GACA5Q;IAEA,OAAI,WAAWA,IArCjB,SACE4Q,GACApN;QAEAtS,IACIsS,EAAI+O,QAGM/O,EAAI+O,MAAM3b,MACV4M,EAAI+O,MAAMC;QACxB,MAAMze,IAAMwa,GAASqC,GAAYpN,EAAI+O,MAAM3b,OACrCwa,IAAUC,GAAY7N,EAAI+O,MAAMC,aAChCrR,IAAO,IAAIsR,GAAY;YAAEvI,UAAU;gBAAEC,QAAQ3G,EAAI+O,MAAMpI;;;QAC7D,OAAO,IAAI5C,GAASxT,GAAKqd,GAASjQ,GAAM;KAyB/BuR,CAAU9B,GAAY5Q,KACpB,aAAaA,IAvB1B,SACE4Q,GACA5Q;QAEA9O,IACI8O,EAAO2S,UAGXzhB,IACI8O,EAAO4S;QAGX,MAAM7e,IAAMwa,GAASqC,GAAY5Q,EAAO2S,UAClCvB,IAAUC,GAAYrR,EAAO4S;QACnC,OAAO,IAAInL,GAAW1T,GAAKqd;KAUlByB,CAAYjC,GAAY5Q,KAjbnBlP;;;SAsbAgiB,GACdlC,GACA7M;IAEA,IAAIyE;IACJ,IAAI,kBAAkBzE,GAAQ;QACdA,EAAO4D;;;QAGrB,MAAMvB,IAsEV,SACEA;YAEA,OAAc,gBAAVA,uBAEiB,UAAVA,oBAEU,aAAVA,sBAEU,cAAVA,sBAEU,YAAVA,oBAhhBGtV;SA+bEiiB,CACZhP,EAAO4D,aAAaqL,oBAAoB,cAEpC3M,IAAwBtC,EAAO4D,aAAatB,aAAa,IAEzDlI,aAlORyS,GACAlgB;YAEA,OAAIkgB,EAAWH,MACbvf,OACY2D,MAAVnE,KAAwC,mBAAVA,IAGzByM,GAAWgS,iBAAiBze,KAAgB,QAEnDQ,OACY2D,MAAVnE,KAAuBA,aAAiBiB;YAGnCwL,GAAWiS,eAAe1e,KAAgB,IAAIiB;SAoNjCshB,CAAUrC,GAAY7M,EAAO4D,aAAaxJ,cACxD+U,IAAanP,EAAO4D,aAAcrB,OAClCA,IAAQ4M,KAvWlB,SAAuBC;YACrB,MAAM1c,SACY5B,MAAhBse,EAAO1c,OAAqBnB,EAAKG,UAAU+I,GAAmB2U,EAAO1c;YACvE,OAAO,IAAID,EAAeC,GAAM0c,EAAOniB,WAAW;;;;;;;;;GAoWpBoiB,EAAcF;QAC1C1K,IAAc,IAAIrC,GAChBC,GACAC,GACAlI,GACAmI,KAAS;WAEN,IAAI,oBAAoBvC,GAAQ;QACvBA,EAAOsP;QACrB,MAAMC,IAAevP,EAAOsP;QACdC,EAAa/J,UACb+J,EAAa/J,SAAS3S,MAElC0c,EAAa/J,SAASiJ;QAGxB,MAAMze,IAAMwa,GAASqC,GAAY0C,EAAa/J,SAAS3S,OACjDwa,IAAUC,GAAYiC,EAAa/J,SAASiJ,aAC5CrR,IAAO,IAAIsR,GAAY;YAC3BvI,UAAU;gBAAEC,QAAQmJ,EAAa/J,SAASY;;YAEtC3G,IAAM,IAAI+D,GAASxT,GAAKqd,GAASjQ,GAAM,KACvC2E,IAAmBwN,EAAajN,aAAa,IAC7CN,IAAmBuN,EAAavN,oBAAoB;QAC1DyC,IAAc,IAAI3C,GAChBC,GACAC,GACAvC,EAAIzP,KACJyP;WAEG,IAAI,oBAAoBO,GAAQ;QACvBA,EAAOwP;QACrB,MAAMC,IAAYzP,EAAOwP;QACXC,EAAUjK;QACxB,MAAMxV,IAAMwa,GAASqC,GAAY4C,EAAUjK,WACrC6H,IAAUoC,EAAUZ,WACtBvB,GAAYmC,EAAUZ,YACtBlb,EAAgBkB,OACd4K,IAAM,IAAIiE,GAAW1T,GAAKqd,IAC1BrL,IAAmByN,EAAUzN,oBAAoB;QACvDyC,IAAc,IAAI3C,GAAoB,IAAIE,GAAkBvC,EAAIzP,KAAKyP;WAChE,IAAI,oBAAoBO,GAAQ;QACvBA,EAAO0P;QACrB,MAAMC,IAAY3P,EAAO0P;QACXC,EAAUnK;QACxB,MAAMxV,IAAMwa,GAASqC,GAAY8C,EAAUnK,WACrCxD,IAAmB2N,EAAU3N,oBAAoB;QACvDyC,IAAc,IAAI3C,GAAoB,IAAIE,GAAkBhS,GAAK;WAC5D;QAAA,MAAI,YAAYgQ,IAUrB,OAhgBYjT;QAsfiB;YAEfiT,EAAO3K;YACrB,MAAMA,IAAS2K,EAAO3K;YACRA,EAAO0E;YACrB,MAAMhK,IAAQsF,EAAOtF,SAAS,GACxBoS,IAAkB,IAAI7H,GAAgBvK,IACtCgK,IAAW1E,EAAO0E;YACxB0K,IAAc,IAAIvC,GAAsBnI,GAAUoI;;;IAIpD,OAAOsC;;;SAwCOmL,GACd/C,GACAgD;IAEA,IAAI5T;IACJ,IAAI4T,aAAoBC,IACtB7T,IAAS;QACP8T,QAAQ1B,GAAmBxB,GAAYgD,EAAS7f,KAAK6f,EAASljB;YAE3D,IAAIkjB,aAAoBG,IAC7B/T,IAAS;QAAEyD,QAAQoO,GAAOjB,GAAYgD,EAAS7f;YAC1C,IAAI6f,aAAoBI,IAC7BhU,IAAS;QACP8T,QAAQ1B,GAAmBxB,GAAYgD,EAAS7f,KAAK6f,EAASzS;QAC9D8S,YAAYC,GAAeN,EAASO;YAEjC,IAAIP,aAAoBQ,IAC7BpU,IAAS;QACPqU,WAAW;YACT9K,UAAUsI,GAAOjB,GAAYgD,EAAS7f;YACtCugB,iBAAiBV,EAASU,gBAAgBlkB,IAAIikB,KA+HtD,SACEzD,GACA2D;gBAEA,MAAMF,IAAYE,EAAeF;gBACjC,IAAIA,aAAqBG,IACvB,OAAO;oBACLC,WAAWF,EAAe1Y,MAAM7C;oBAChC0b,kBAAkB;;gBAEf,IAAIL,aAAqBM,IAC9B,OAAO;oBACLF,WAAWF,EAAe1Y,MAAM7C;oBAChC4b,uBAAuB;wBACrB5I,QAAQqI,EAAUQ;;;gBAGjB,IAAIR,aAAqBS,IAC9B,OAAO;oBACLL,WAAWF,EAAe1Y,MAAM7C;oBAChC+b,oBAAoB;wBAClB/I,QAAQqI,EAAUQ;;;gBAGjB,IAAIR,aAAqBW,IAC9B,OAAO;oBACLP,WAAWF,EAAe1Y,MAAM7C;oBAChCic,WAAWZ,EAAUa;;gBAGvB,MA3tBYpkB;aA+jBNqkB,CAAiBvE,GAAYyD;;YAI9B;QAAA,MAAIT,aAAoBwB,KAK7B,OAxkBYtkB;QAokBZkP,IAAS;YACPqV,QAAQxD,GAAOjB,GAAYgD,EAAS7f;;;IAUxC,OAJK6f,EAAS0B,GAAaC,OACzBvV,EAAOwV,kBA+CX,SACE5E,GACA0E;QAGA,YAAgCzgB,MAA5BygB,EAAa9C,aACR;YACLA,YAAYrB,GAAUP,GAAY0E,EAAa9C;iBAEhB3d,MAAxBygB,EAAaG,SACf;YAAEA,QAAQH,EAAaG;YAroBlB3kB;KA4kBa4kB,CAAe9E,GAAYgD,EAAS0B,MAGxDtV;;;SAGO2V,GACd/E,GACAyB;IAEA,MAAMiD,IAAejD,EAAMmD,kBAqD7B,SAA0BF;QACxB,YAAgCzgB,MAA5BygB,EAAa9C,aACRoD,GAAapD,WAAWnB,GAAYiE,EAAa9C,oBACvB3d,MAAxBygB,EAAaG,SACfG,GAAaH,OAAOH,EAAaG,UAEjCG,GAAaC;KA1DlBC,CAAiBzD,EAAMmD,mBACvBI,GAAaC;IAEjB,IAAIxD,EAAMyB,QAAQ;QACFzB,EAAMyB,OAAOld;QAC3B,MAAM7C,IAAMwa,GAASqC,GAAYyB,EAAMyB,OAAOld,OACxClG,IAAQ,IAAI+hB,GAAY;YAC5BvI,UAAU;gBAAEC,QAAQkI,EAAMyB,OAAO3J;;;QAEnC,IAAIkI,EAAM4B,YAAY;YACpB,MAAME,aAmhBqB9B;gBAC/B,MAAM0D,IAAQ1D,EAAM2D,cAAc;gBAClC,OAAO,IAAIC,GAAUF,EAAM3lB,IAAI6I,KAAQK,EAAU4c,EAAiBjd;aArhB5Ckd,CAAiB9D,EAAM4B;YACzC,OAAO,IAAID,GAAcjgB,GAAKrD,GAAOyjB,GAAWmB;;QAEhD,OAAO,IAAIzB,GAAY9f,GAAKrD,GAAO4kB;;IAEhC,IAAIjD,EAAM5O,QAAQ;QACvB,MAAM1P,IAAMwa,GAASqC,GAAYyB,EAAM5O;QACvC,OAAO,IAAIsQ,GAAehgB,GAAKuhB;;IAC1B,IAAIjD,EAAMgC,WAAW;QAC1B,MAAMtgB,IAAMwa,GAASqC,GAAYyB,EAAMgC,UAAmB,WACpDC,IAAkBjC,EAAMgC,UAAUC,gBAAiBlkB,IAAIikB,KAoHjE,SACEzD,GACAyB;YAEA,IAAIgC,IAAuC;YAC3C,IAAI,sBAAsBhC,GACxBnhB,EAC6B,mBAA3BmhB,EAAMqC,mBAGRL,IAAY,IAAIG,SACX,IAAI,2BAA2BnC,GAAO;gBAC3C,MAAMrG,IAASqG,EAAMuC,sBAAuB5I,UAAU;gBACtDqI,IAAY,IAAIM,GAA6B3I;mBACxC,IAAI,wBAAwBqG,GAAO;gBACxC,MAAMrG,IAASqG,EAAM0C,mBAAoB/I,UAAU;gBACnDqI,IAAY,IAAIS,GAA8B9I;mBACrC,eAAeqG,IACxBgC,IAAY,IAAIW,GACdpE,GACAyB,EAAgB,aAGlBvhB;YAEF,MAAM2jB,IAAYnb,EAAU4c,EAAiB7D,EAAgB;YAC7D,OAAO,IAAI+D,GAAe3B,GAAWJ;SA7IjCgC,CAAmBzF,GAAYyD;QAMjC,OAJAnjB,GAC0B,MAAxBokB,EAAaG,SAGR,IAAIrB,GAAkBrgB,GAAKugB;;IAC7B,IAAIjC,EAAMgD,QAAQ;QACvB,MAAMthB,IAAMwa,GAASqC,GAAYyB,EAAMgD;QACvC,OAAO,IAAID,GAAerhB,GAAKuhB;;IAE/B,OAvnBYxkB;;;SA8qBAwlB,GACdC,GACAC;IAEA,OAAID,KAAUA,EAAOlkB,SAAS,KA7pBhCnB,OA+pBqB2D,MAAf2hB,IAGKD,EAAOnmB,IAAIiiB,KAlCtB,SACEA,GACAmE;;QAGA,IAAIpF,IAAUiB,EAAMG,aAChBnB,GAAYgB,EAAMG,cAClBnB,GAAYmF;QAEZpF,EAAQvZ,QAAQH,EAAgBkB;;;;;;QAMlCwY,IAAUC,GAAYmF;QAGxB,IAAIC,IAAuC;QAI3C,OAHIpE,EAAMoE,oBAAoBpE,EAAMoE,iBAAiBpkB,SAAS,MAC5DokB,IAAmBpE,EAAMoE;QAEpB,IAAIC,GAAetF,GAASqF;KAYNE,CAAgBtE,GAAOmE,OAE3C;;;SAmEKI,GACdhG,GACAvV;IAEA,OAAO;QAAEwJ,WAAW,EAACkN,GAAYnB,GAAYvV,EAAOpC;;;;SAetC4d,GACdjG,GACAvV;;IAGA,MAAM2E,IAA0B;QAAE8W,iBAAiB;OAC7C7d,IAAOoC,EAAOpC;IACW,SAA3BoC,EAAOP,mBAKTkF,EAAO+W,SAAShF,GAAYnB,GAAY3X,IACxC+G,EAAO8W,gBAAiBE,OAAO,EAC7B;QACE7c,cAAckB,EAAOP;QACrBmc,iBAAgB;YAQpBjX,EAAO+W,SAAShF,GAAYnB,GAAY3X,EAAKie,MAC7ClX,EAAO8W,gBAAiBE,OAAO,EAAC;QAAE7c,cAAclB,EAAKke;;IAGvD,MAAMC,IAqIR,SAAkBpc;QAChB,IAAuB,MAAnBA,EAAQ3I,QACV;QAEF,MAAMkkB,IAASvb,EAAQ5K,IAAIgJ,KACrBA,aAAkBoD;;iBAuIWpD;YACnC,yBAAIA,EAAO8C,IAAuB;gBAChC,IAAIsT,GAAWpW,EAAO1I,QACpB,OAAO;oBACL2mB,aAAa;wBACXxb,OAAOyb,GAAqBle,EAAOyC;wBACnCK,IAAI;;;gBAGH,IAAIqT,GAAYnW,EAAO1I,QAC5B,OAAO;oBACL2mB,aAAa;wBACXxb,OAAOyb,GAAqBle,EAAOyC;wBACnCK,IAAI;;;;YAKZ,OAAO;gBACLqb,aAAa;oBACX1b,OAAOyb,GAAqBle,EAAOyC;oBACnCK,KApFyBA,IAoFN9C,EAAO8C,IAnFvB4T,GAAU5T;oBAoFbxL,OAAO0I,EAAO1I;;;;gBArFWwL;SAvElBsb,CAAqBpe,KAt7BlBtI;QA27Bd,IAAsB,MAAlBylB,EAAOlkB,QACT,OAAOkkB,EAAO;QAEhB,OAAO;YAAEkB,iBAAiB;gBAAEvb,IAAI;gBAAOlB,SAASub;;;KAnJlCmB,CAASrc,EAAOL;IAC1Boc,MACFpX,EAAO8W,gBAAiBM,QAAQA;IAGlC,MAAMrc,IAiKR,SAAiB4c;QACf,IAAwB,MAApBA,EAAStlB,QACX;QAEF,OAAOslB,EAASvnB,IAAIwnB;YAASC,OAiFtB;gBACLhc,OAAOyb,IAFqBvc,IAhFe6c,GAkFP/b;gBACpCic,YA9DwBhc,IA8DDf,EAAQe,KA7D1B4T,GAAW5T;;;gBA0DYf,GA3DJe;;KA1LVic,CAAQ1c,EAAON;IAC3BA,MACFiF,EAAO8W,gBAAiB/b,UAAUA;IAGpC,MAAM3C,IAxsBR,SACEwY,GACAoH;QAEA,OAAIpH,EAAWH,MAAiBnW,EAAkB0d,KACzCA,IAEA;YAAEtnB,OAAOsnB;;;;;GAisBJC,EAAarH,GAAYvV,EAAOjD;IAY9C,OAXc,SAAVA,MACF4H,EAAO8W,gBAAiB1e,QAAQA,IAG9BiD,EAAOJ,YACT+E,EAAO8W,gBAAiB7b,UAAUid,GAAS7c,EAAOJ;IAEhDI,EAAOH,UACT8E,EAAO8W,gBAAiB5b,QAAQgd,GAAS7c,EAAOH,SAG3C8E;;;SAGOmY,GAAgB9c;IAC9B,IAAIpC,IAAO+Y,GAAc3W,EAAc;IAEvC,MAAMgJ,IAAQhJ,EAAOyb,iBACfsB,IAAY/T,EAAM2S,OAAO3S,EAAM2S,KAAK3kB,SAAS;IACnD,IAAIyI,IAAiC;IACrC,IAAIsd,IAAY,GAAG;QArzBrBlnB,EAuzBoB,MAAdknB;QAGF,MAAMpB,IAAO3S,EAAM2S,KAAM;QACrBA,EAAKC,iBACPnc,IAAkBkc,EAAK7c,eAEvBlB,IAAOA,EAAKwY,MAAMuF,EAAK7c;;IAI3B,IAAIke,IAAqB;IACrBhU,EAAM+S,UACRiB,IAwGJ,SAASC,EAAWlf;QAClB,OAAKA,SAE6BvE,MAAvBuE,EAAOie,cACT,EAACkB,GAAgBnf,YACQvE,MAAvBuE,EAAOme,cACT,EAACiB,GAAgBpf,YACYvE,MAA3BuE,EAAOqe,kBACTre,EAAOqe,gBACXzc,QAAS5K,IAAIqL,KAAK6c,EAAW7c,IAC7Bgd,OAAO,CAACC,GAAO/e,MAAY+e,EAAMC,OAAOhf,MA38B/B7I,MAm8BL;KA1GIwnB,CAAWjU,EAAM+S;IAG9B,IAAIrc,IAAqB;IACrBsJ,EAAMtJ,YACRA,IAAoBsJ,EAAMtJ,QA2HZ3K,IAAIwnB;QAASgB,OAoFtB,IAAIC,GACTC,IAF8B/d,IAnFe6c,GAqFR;;iBA9DvC9b;YAEA,QAAQA;cACN,KAAK;gBACH;;cACF,KAAK;gBACH;;cACF;gBACE;;SAuDFid,CAAche,EAAQ+c;YAHQ/c;;IA3MhC,IAAI3C,IAAuB;IACvBiM,EAAMjM,UACRA,IAxuBJ,SACE4f;QAEA,IAAIhY;QAMJ,OAJEA,IADiB,mBAARgY,IACAA,EAAItnB,QAEJsnB,GAEJ1d,EAAkB0F,KAAU,OAAOA;KA+tBhCgZ,CAAe3U,EAAMjM;IAG/B,IAAI6C,IAAwB;IACxBoJ,EAAMpJ,YACRA,IAAUge,GAAW5U,EAAMpJ;IAG7B,IAAIC,IAAsB;IAK1B,OAJImJ,EAAMnJ,UACRA,IAAQ+d,GAAW5U,EAAMnJ,SAGpB,IAAIge,GACTjgB,GACA6B,GACAC,GACAsd,GACAjgB,qBAEA6C,GACAC,GACAie;;;SAGYC,GACdxI,GACAlI;IAEA,MAAMhY,IAUR,SACEkgB,GACA7S;QAEA,QAAQA;UACN;YACE,OAAO;;UACT;YACE,OAAO;;UACT;YACE,OAAO;;UACT;YACE,OAt5BUjN;;KAg4BAuoB,CAAQzI,GAAYlI,EAAW3K;IAC7C,OAAa,QAATrN,IACK,OAEA;QACL4oB,oBAAoB5oB;;;;AAuF1B,SAASwnB,GAASqB;IAChB,OAAO;QACLC,QAAQD,EAAOC;QACfxN,QAAQuN,EAAOE;;;;AAInB,SAASR,GAAWM;IAClB,MAAMC,MAAWD,EAAOC,QAClBC,IAAWF,EAAOvN,UAAU;IAClC,OAAO,IAAI0N,GAAMD,GAAUD;;;;SAoDblC,GAAqBre;IACnC,OAAO;QAAEwb,WAAWxb,EAAKD;;;;SAGX8f,GACda;IAEA,OAAOrgB,EAAU4c,EAAiByD,EAAyB;;;SAkB7CnB,GAAgBpf;IAC9B,OAAOoD,GAAYod,OACjBd,GAAuB1f,EAAOme,YAAmB,iBApDpBrb;QAC/B,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,OAthCUpL;;KAsjCZ+oB,CAAiBzgB,EAAOme,YAAgB,KACxCne,EAAOme,YAAmB;;;SAgCdgB,GAAgBnf;IAC9B,QAAQA,EAAOie,YAAgB;MAC7B,KAAK;QACH,MAAMyC,IAAWhB,GAAuB1f,EAAOie,YAAmB;QAClE,OAAO7a,GAAYod,OAAOE,sBAA0B;YAClDnN,aAAaoN;;;MAEjB,KAAK;QACH,MAAMC,IAAYlB,GAAuB1f,EAAOie,YAAmB;QACnE,OAAO7a,GAAYod,OAAOI,sBAA2B;YACnDC,WAAW;;;MAEf,KAAK;MAEL;QACE,OAtmCUnpB;;;;SA0mCAojB,GAAeC;IAC7B,MAAM+F,IAA4B;IAIlC,OAHA/F,EAAUhK,OAAO/V,QAAQyH,KACvBqe,EAAgBllB,KAAK6G,EAAM7C,OAEtB;QACLgd,YAAYkE;;;;SASAtI,GAAoB3Y;;IAElC,OACEA,EAAK5G,UAAU,KACC,eAAhB4G,EAAKlE,IAAI,MACO,gBAAhBkE,EAAKlE,IAAI;;;;;;;;;;;;;;;;;;;gEC5nCAolB;IAAbjoB;;;QAGEqB,eAAYsB;;;;;;;aAOEulB,GACd/F,GACAgG,GACA/P;IAEA,OAAI+J,aAAqBG,cHOzBlK,GACA+P;QAEA,MAAMnQ,IAAyB;YAC7BC,QAAQ;gBACNmQ,UAAY;oBACVlQ,aApB0B;;gBAsB5BmQ,sBAAwB;oBACtBzP,gBAAgB;wBACdhU,SAASwT,EAAexT;wBACxB0T,OAAOF,EAAevT;;;;;QAU9B,OAJIsjB,MACFnQ,EAASC,OAA0B,qBAAIkQ,IAGlC;YAAEnQ,UAAAA;;;;;;;;GG3BAsQ,EAAgBlQ,GAAgB+P,KAC9BhG,aAAqBM,KACvB8F,GAAkCpG,GAAWgG,KAC3ChG,aAAqBS,KACvB4F,GAAmCrG,GAAWgG,cAuJvDhG,GACAgG;;;;QAKA,MAAMM,IAAYC,GAChBvG,GACAgG,IAEIQ,IAAMC,GAASH,KAAaG,GAASzG,EAAUa;QACrD,OAAIxa,GAAUigB,MAAcjgB,GAAU2Z,EAAUa,MACvCxE,GAAUmK,KAEVlK,GAAS0D,EAAUzD,YAAYiK;KA/J/BE,CACL1G,GACAgG;;;;;;aASUW,GACd3G,GACAgG,GACAY;;;;IAKA,OAAI5G,aAAqBM,KAChB8F,GAAkCpG,GAAWgG,KAC3ChG,aAAqBS,KACvB4F,GAAmCrG,GAAWgG,KAOhDY;;;;;;;;;;;;;;;;;aAkBOL,GACdvG,GACAgG;IAEA,OAAIhG,aAAqBW,KFsdlBta,GADgBhK,IEpdL2pB,eF8clB3pB;QAEA,SAASA,KAAS,iBAAiBA;;8EAKRwqB,EAASxqB,KErdD2pB,IAAiB;QAAE3O,cAAc;QAE7D;QFkdgBhb;;;;MEnbZ8jB,WAAiC2F;;8DAGjCxF,WAAqCwF;IAChDjoB,YAAqB2iB;QACnBne,SADmBnD,gBAAAshB;;;;AAKvB,SAAS4F,GACPpG,GACAgG;IAEA,MAAMrO,IAASmP,GAAwBd;IACvC,KAAK,MAAMe,KAAW/G,EAAUQ,UACzB7I,EAAOqP,KAAKC,KAAW7e,GAAY6e,GAASF,OAC/CpP,EAAOhX,KAAKomB;IAGhB,OAAO;QAAErP,YAAY;YAAEC,QAAAA;;;;;+DAIZ8I,WAAsCqF;IACjDjoB,YAAqB2iB;QACnBne,SADmBnD,gBAAAshB;;;;AAKvB,SAAS6F,GACPrG,GACAgG;IAEA,IAAIrO,IAASmP,GAAwBd;IACrC,KAAK,MAAMkB,KAAYlH,EAAUQ,UAC/B7I,IAASA,EAAO5S,OAAOkiB,MAAY7e,GAAY6e,GAASC;IAE1D,OAAO;QAAExP,YAAY;YAAEC,QAAAA;;;;;;;;;;UASZgJ,WAA2CmF;IACtDjoB,YACW0e,GACAsE;QAETxe,SAHSnD,kBAAAqd,aACAsE;;;;AA6Bb,SAAS4F,GAASpqB;IAChB,OAAO2a,GAAgB3a,EAAMgb,gBAAgBhb,EAAMic;;;AAGrD,SAASwO,GAAwBzqB;IAC/B,OAAO4e,GAAQ5e,MAAUA,EAAMqb,WAAWC,SACtCtb,EAAMqb,WAAWC,OAAO7T,UACxB;;;;;;;;;;;;;;;;;;;;;;;;;;;;UClLO8d;IACX/jB,YAAqBiY;QAAA5W,cAAA4W;;;QAGnBA,EAAO6D,KAAK1U,EAAU1G;;;;;;;WAcxBV,GAAOuiB;QACL,KAAK,MAAM+G,KAAiBjoB,KAAK4W,QAC/B,IAAIqR,EAAcC,EAAWhH,IAC3B,QAAO;QAGX,QAAO;;IAGTviB,QAAQ0B;QACN,OAAOjB,EAAYY,KAAK4W,QAAQvW,EAAMuW,QAAQ,CAACuR,GAAGC,MAAMD,EAAE7jB,QAAQ8jB;;;;yEAKzDvF;IACXlkB,YACW2J,GACAwY;QADA9gB,aAAAsI,GACAtI,iBAAA8gB;;;;SAIGuH,GACdnpB,GACAC;IAEA,OACED,EAAKoJ,MAAMhE,QAAQnF,EAAMmJ,mBDqB3BpJ,GACAC;QAEA,OACED,aAAgBkiB,MAChBjiB,aAAiBiiB,MAIjBliB,aAAgBqiB,MAChBpiB,aAAiBoiB,KAHVniB,EAAYF,EAAKoiB,UAAUniB,EAAMmiB,UAAUpY,MAOlDhK,aAAgBuiB,MAChBtiB,aAAiBsiB,KAEVvY,GAAYhK,EAAKyiB,IAASxiB,EAAMwiB,MAIvCziB,aAAgB+hB,MAChB9hB,aAAiB8hB;KC1CjBqH,CAAyBppB,EAAK4hB,WAAW3hB,EAAM2hB;;;4EAKtCqC;IACXxkB;;;;;;;;;;;IAWWkf;;;;;;;;IAQAqF;QARAljB,eAAA6d,GAQA7d,wBAAAkjB;;;;;;;;UAiBAb;IACX1jB,YACWsgB,GACAiD;QADAliB,kBAAAif,GACAjf,cAAAkiB;;gDASXvjB;QACE,OAAO,IAAI0jB;;8DAIb1jB,cAAcujB;QACZ,OAAO,IAAIG,QAAa/gB,GAAW4gB;;kFAIrCvjB,kBAAkBkf;QAChB,OAAO,IAAIwE,GAAaxE;;0DAI1B0K;QACE,YAA2BjnB,MAApBtB,KAAKif,mBAA4C3d,MAAhBtB,KAAKkiB;;IAG/CvjB,QAAQ0B;QACN,OACEL,KAAKkiB,WAAW7hB,EAAM6hB,WACrBliB,KAAKif,eACA5e,EAAM4e,cAAcjf,KAAKif,WAAW3a,QAAQjE,EAAM4e,eACnD5e,EAAM4e;;;;;;;aASDuJ,GACdzG,GACA0G;IAEA,YAAgCnnB,MAA5BygB,EAAa9C,aAEbwJ,aAAoBzU,MACpByU,EAAS5K,QAAQvZ,QAAQyd,EAAa9C,mBAEP3d,MAAxBygB,EAAaG,UACfH,EAAaG,WAAWuG,aAAoBzU;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;UAwDjC0U;;;;;;;;;;;;;;;aAoBNC,GACdtI,GACAoI,GACAG;IAGA,OAAIvI,aAAoBC,KAkL1B,SACED,GACAoI,GACAG;;;;QAUA,OAAO,IAAI5U,GAASqM,EAAS7f,KAAKooB,EAAe/K,SAASwC,EAASljB,OAAO;YACxE0rB,wBAAuB;;KA/LhBC,CAAiCzI,GAAUoI,GAAUG,KACnDvI,aAAoBI,KA0OjC,SACEJ,GACAoI,GACAG;QAOA,KAAKJ,GAA+BnI,EAAS0B,IAAc0G;;;;;QAKzD,OAAO,IAAIM,GAAgB1I,EAAS7f,KAAKooB,EAAe/K;QAG1D,MAAMmL,IAAUC,GAAc5I,GAAUoI;QACxC,OAAO,IAAIzU,GAASqM,EAAS7f,KAAKooB,EAAe/K,SAASmL,GAAS;YACjEH,wBAAuB;;KA7PhBK,CACL7I,GACAoI,GACAG,KAEOvI,aAAoBQ,KAqUjC,SACER,GACAoI,GACAG;QAOA,IALAjrB,EACqC,QAAnCirB,EAAe1F,oBAIZsF,GAA+BnI,EAAS0B,IAAc0G;;;;;QAKzD,OAAO,IAAIM,GAAgB1I,EAAS7f,KAAKooB,EAAe/K;QAG1D,MAAM5N,IAAMkZ,GAAgB9I,GAAUoI,IAChCvF;;;;;;;;;;;QAgGR,SACEnC,GACAqI,GACAC;YAEA,MAAMnG,IAAgC;YACtCvlB,EACEojB,EAAgBjiB,WAAWuqB,EAAuBvqB;YAKpD,KAAK,IAAIR,IAAI,GAAGA,IAAI+qB,EAAuBvqB,QAAQR,KAAK;gBACtD,MAAM0iB,IAAiBD,EAAgBziB,IACjCwiB,IAAYE,EAAeF;gBACjC,IAAIgG,IAAkC;gBAClCsC,aAAmBpV,OACrB8S,IAAgBsC,EAAQ9gB,MAAM0Y,EAAe1Y,SAE/C4a,EAAiBzhB,KACfgmB,GACE3G,GACAgG,GACAuC,EAAuB/qB;;YAI7B,OAAO4kB;;;;;;;;;;;;;;GA3HkBmG,EACvBhJ,EAASU,iBACT0H,GACAG,EAAgC,mBAG5B/K,IAAU+K,EAAe/K,SACzBmL,IAAUM,GAAgBjJ,GAAUpQ,EAAIrC,QAAQsV;QACtD,OAAO,IAAIlP,GAASqM,EAAS7f,KAAKqd,GAASmL,GAAS;YAClDH,wBAAuB;;KAhWhBU,CACLlJ,GACAoI,GACAG,KA4hBN,SACEvI,GACAoI,GACAG;;;;QAWA,OAAO,IAAI1U,GAAWmM,EAAS7f,KAAKooB,EAAe/K,SAAS;YAC1DgL,wBAAuB;;KApiBhBW,CACLnJ,GACAoI,GACAG;;;;;;;;;;;;;;;;;;aAqBUa,GACdpJ,GACAoI,GACAW,GACArS;IAIA,OAAIsJ,aAAoBC,KAiJ1B,SACED,GACAoI;QAEA,KAAKD,GAA+BnI,EAAS0B,IAAc0G,IACzD,OAAOA;QAGT,MAAM5K,IAAU6L,GAAuBjB;QACvC,OAAO,IAAIzU,GAASqM,EAAS7f,KAAKqd,GAASwC,EAASljB,OAAO;YACzDwsB,KAAmB;;;;;;;;;;;;;;;GA1JZC,EAA4BvJ,GAAUoI,KACpCpI,aAAoBI,KA+MjC,SACEJ,GACAoI;QAEA,KAAKD,GAA+BnI,EAAS0B,IAAc0G,IACzD,OAAOA;QAGT,MAAM5K,IAAU6L,GAAuBjB,IACjCO,IAAUC,GAAc5I,GAAUoI;QACxC,OAAO,IAAIzU,GAASqM,EAAS7f,KAAKqd,GAASmL,GAAS;YAClDW,KAAmB;;;;;;;GAzNZE,EAA8BxJ,GAAUoI,KACtCpI,aAAoBQ,KAsTjC,SACER,GACAoI,GACA1R,GACAqS;QAEA,KAAKZ,GAA+BnI,EAAS0B,IAAc0G,IACzD,OAAOA;QAGT,MAAMxY,IAAMkZ,GAAgB9I,GAAUoI,IAChCvF,IAmHR,SACEnC,GACAhK,GACA0R,GACAW;YAEA,MAAMlG,IAAgC;YACtC,KAAK,MAAMlC,KAAkBD,GAAiB;gBAC5C,MAAMD,IAAYE,EAAeF;gBAEjC,IAAIgG,IAAkC;gBAClC2B,aAAoBzU,OACtB8S,IAAgB2B,EAASngB,MAAM0Y,EAAe1Y,SAG1B,SAAlBwe,KAA0BsC,aAAmBpV;;;;;gBAK/C8S,IAAgBsC,EAAQ9gB,MAAM0Y,EAAe1Y,SAG/C4a,EAAiBzhB,KACfolB,GACE/F,GACAgG,GACA/P;;YAIN,OAAOmM;SAlJkB4G,CACvBzJ,EAASU,iBACThK,GACA0R,GACAW,IAEIJ,IAAUM,GAAgBjJ,GAAUpQ,EAAIrC,QAAQsV;QACtD,OAAO,IAAIlP,GAASqM,EAAS7f,KAAKyP,EAAI4N,SAASmL,GAAS;YACtDW,KAAmB;;KAxUZI,CACL1J,GACAoI,GACA1R,GACAqS,KA+fN,SACE/I,GACAoI;QAEA,KAAKD,GAA+BnI,EAAS0B,IAAc0G,IACzD,OAAOA;QAST,OAAO,IAAIvU,GAAWmM,EAAS7f,KAAK2D,EAAgBkB;;;;;;;;GAtgB3C2kB,EAA+B3J,GAAUoI;;;;;;;;;;;;;;;;;;aAoBpCwB,GACd5J,GACAoI;IAEA,OAAIpI,aAAoBQ,KAyS1B,SACER,GACAoI;QAEA,IAAIyB,IAAwC;QAC5C,KAAK,MAAMlJ,KAAkBX,EAASU,iBAAiB;YACrD,MAAMoJ,IACJ1B,aAAoBzU,KAChByU,EAASngB,MAAM0Y,EAAe1Y,cAC9BhH,GACA8oB,IAAe/C,GACnBrG,EAAeF,WACfqJ,KAAiB;YAGC,QAAhBC,MAEAF,IADgB,QAAdA,KACW,IAAIG,IAAqB9a,IACpCyR,EAAe1Y,OACf8hB,KAGWF,EAAW3a,IAAIyR,EAAe1Y,OAAO8hB;;QAIxD,OAAOF,IAAaA,EAAWI,OAAU;;;;;;;GAlUhCC,EAAkClK,GAAUoI,KAE9C;;;SAGO+B,GAAetrB,GAAgBC;IAC7C,OAAID,EAAKyR,SAASxR,EAAMwR,WAInBzR,EAAKsB,IAAI8D,QAAQnF,EAAMqB,WAIvBtB,EAAK6iB,GAAazd,QAAQnF,EAAM4iB,wBAIjC7iB,EAAKyR,OACCzR,EAAqB/B,MAAMmH,QAASnF,EAAsBhC,2BAGhE+B,EAAKyR,OAEJzR,EAAuB0O,KAAKtJ,QAASnF,EAAwByO,SAC7D1O,EAAuB0hB,GAAUtc,QAC/BnF,EAAwByhB,4BAK3B1hB,EAAKyR,QACAvR,EACJF,EAA2B6hB,iBAC3B7hB,EAA2B6hB,iBAC5B,CAACoH,GAAGC,MAAMC,GAAqBF,GAAGC;;;;;;;;GAyBxC,UAASsB,GACPjB;IAEA,OAAIA,aAAoBzU,KACfyU,EAAS5K,UAET1Z,EAAgBkB;;;;;;UAQdib,WAAoBoI;IAC/B/pB,YACW6B,GACArD,GACA4kB;QAET5e,SAJSnD,WAAAQ,GACAR,aAAA7C,aACA4kB,GAKF/hB;;;;MAgDEygB,WAAsBiI;IACjC/pB,YACW6B,GACAoN,GACAgT,GACAmB;QAET5e,SALSnD,WAAAQ,GACAR,YAAA4N,aACAgT,aACAmB,GAKF/hB;;;;AA+CX,SAASipB,GACP5I,GACAoI;IAEA,IAAI7a;IAMJ,OAJEA,IADE6a,aAAoBzU,KACfyU,EAAS7a,SAETsR,GAAYuL,SAKvB,SAAqBpK,GAAyBzS;QAC5C,MAAM8c,IAAU,IAAIL,GAAmBzc;QAWvC,OAVAyS,EAASO,GAAUhK,OAAO/V,QAAQqgB;YAChC,KAAKA,EAAUngB,KAAW;gBACxB,MAAM4pB,IAAWtK,EAASzS,KAAKtF,MAAM4Y;gBACpB,SAAbyJ,IACFD,EAAQnb,IAAI2R,GAAWyJ,KAEvBD,EAAQxa,OAAOgR;;YAIdwJ,EAAQJ;;;;;;;;;;GAfRM,EAAYvK,GAAUzS;;;MA2BlBiT,WAA0B6H;IAQrC/pB,YACW6B,GACAugB;QAET5d,SAHSnD,WAAAQ,GACAR,uBAAA+gB,GATF/gB;;;;QAKTA,UAAwBqiB,GAAaH,QAAO;;;;AAoG9C,SAASiH,GACP9I,GACAoI;IAUA,OAAOA;;;AA0FT,SAASa,GACPjJ,GACAzS,GACAsV;IAOA,MAAMwH,IAAU,IAAIL,GAAmBzc;IACvC,KAAK,IAAItP,IAAI,GAAGA,IAAI+hB,EAASU,gBAAgBjiB,QAAQR,KAAK;QACxD,MAAM0iB,IAAiBX,EAASU,gBAAgBziB;QAChDosB,EAAQnb,IAAIyR,EAAe1Y,OAAO4a,EAAiB5kB;;IAErD,OAAOosB,EAAQJ;;;oEAIJ9J,WAAuBkI;IAClC/pB,YAAqB6B,GAA2BuhB;QAC9C5e,SADmBnD,WAAAQ,aAA2BuhB,GAIvC/hB;;;;MA8CE6hB,WAAuB6G;IAClC/pB,YAAqB6B,GAA2BuhB;QAC9C5e,SADmBnD,WAAAQ,aAA2BuhB,GAIvC/hB;;;;;;;;;;;;;;;;;;;;;;;UC1zBEkf;IACXvgB,YAAqBmgB;QAAA9e,aAAA8e;;IAOrBngB;QACE,OAAO,IAAIugB,GAAY;YAAEvI,UAAU;;;;;;;;WASrChY,MAAM+G;QACJ,IAAIA,EAAK3E,KACP,OAAOf,KAAK8e;QACP;YACL,IAAI3hB,IAAmB6C,KAAK8e;YAC5B,KAAK,IAAIxgB,IAAI,GAAGA,IAAIoH,EAAK5G,SAAS,KAAKR,GAAG;gBACxC,KAAKnB,EAAMwZ,SAAUC,QACnB,OAAO;gBAGT,IADAzZ,IAAQA,EAAMwZ,SAAUC,OAAOlR,EAAKlE,IAAIlD,MACnC4d,GAAW/e,IACd,OAAO;;YAKX,OADAA,KAASA,EAAMwZ,SAAUC,UAAU,IAAIlR,EAAKke,MACrCzmB,KAAS;;;IAIpBwB,QAAQ0B;QACN,OAAO6I,GAAYlJ,KAAK8e,OAAOze,EAAMye;;;;;;;UAe5BuL;;;;IAOX1rB,YAA6BurB,IAA0BhL,GAAYuL;kBAAtCP;;QAL7BlqB,UAAqB,IAAIgS;;;;;;;;WAczBrT,IAAI+G,GAAiBvI;QAMnB,OADA6C,KAAK6qB,GAAWnlB,GAAMvI,IACf6C;;;;;;;;WAUTrB,OAAO+G;QAML,OADA1F,KAAK6qB,GAAWnlB,GAAM,OACf1F;;;;;WAODrB,GAAW+G,GAAiBvI;QAClC,IAAI2tB,IAAe9qB,KAAK+qB;QAExB,KAAK,IAAIzsB,IAAI,GAAGA,IAAIoH,EAAK5G,SAAS,KAAKR,GAAG;YACxC,MAAM0sB,IAAiBtlB,EAAKlE,IAAIlD;YAChC,IAAI2sB,IAAeH,EAAatpB,IAAIwpB;YAEhCC,aAAwBjZ;;YAE1B8Y,IAAeG,IAEfA,8BACA7T,GAAU6T;;YAGVA,IAAe,IAAIjZ,IACjBvR,OAAOmB,QAAQqpB,EAAatU,SAAUC,UAAU,MAElDkU,EAAavb,IAAIyb,GAAgBC,IACjCH,IAAeG;;YAGfA,IAAe,IAAIjZ,KACnB8Y,EAAavb,IAAIyb,GAAgBC,IACjCH,IAAeG;;QAInBH,EAAavb,IAAI7J,EAAKke,KAAezmB;;iEAIvCwB;QACE,MAAMusB,IAAelrB,KAAKmrB,GACxBplB,EAAU4Y,KACV3e,KAAK+qB;QAEP,OAAoB,QAAhBG,IACK,IAAIhM,GAAYgM,KAEhBlrB,KAAKkqB;;;;;;;;;;;;;WAgBRvrB,GACNysB,GACAC;QAEA,IAAIC,KAAW;QAEf,MAAMnB,IAAgBnqB,KAAKkqB,GAAW5hB,MAAM8iB,IACtCG,IAAerP,GAAWiO;0BAGvBA,EAAcxT,SAASC,UAC5B;QAkBJ,OAhBAyU,EAAgBxqB,QAAQ,CAAC1D,GAAOquB;YAC9B,IAAIruB,aAAiB6U,KAAK;gBACxB,MAAMyZ,IAASzrB,KAAKmrB,GAAaC,EAAYlN,MAAMsN,IAAcruB;gBACnD,QAAVsuB,MACFF,EAAaC,KAAeC,GAC5BH,KAAW;mBAEM,SAAVnuB,KACTouB,EAAaC,KAAeruB,GAC5BmuB,KAAW,KACFC,EAAa5qB,eAAe6qB,cAC9BD,EAAaC,IACpBF,KAAW;YAIRA,IAAW;YAAE3U,UAAU;gBAAEC,QAAQ2U;;YAAmB;;;;;;aAO/CG,GAAiBvuB;IAC/B,MAAMyZ,IAAsB;IAsB5B,OArBA/V,EAAQ1D,EAAOyZ,UAAU,IAAI,CAACpW,GAAKrD;QACjC,MAAMiuB,IAAc,IAAIrlB,EAAU,EAACvF;QACnC,IAAI0b,GAAW/e,IAAQ;YACrB,MACMwuB,IADaD,GAAiBvuB,EAAe,UACnByZ;YAChC,IAA4B,MAAxB+U,EAAa7sB;;YAEf8X,EAAOnV,KAAK2pB;;;YAIZ,KAAK,MAAMQ,KAAcD,GACvB/U,EAAOnV,KAAK2pB,EAAYlN,MAAM0N;;;;QAMlChV,EAAOnV,KAAK2pB;QAGT,IAAI1I,GAAU9L;;;;;;;;;;;;;;;;;;;;;;UCpODiV;IACpBltB,YAAqB6B,GAA2Bqd;QAA3B7d,WAAAQ,GAA2BR,eAAA6d;;;;;;;UAiBrC7J,WAAiB6X;IAI5BltB,YACE6B,GACAqd,GACiBiO,GACjBC;QAEA5oB,MAAM3C,GAAKqd,cAHMiO,GAIjB9rB,KAAKgsB,OAAsBD,EAAQC,IACnChsB,KAAK6oB,0BAA0BkD,EAAQlD;;IAGzClqB,MAAM+G;QACJ,OAAO1F,KAAK8rB,GAAYxjB,MAAM5C;;IAGhC/G;QACE,OAAOqB,KAAK8rB;;IAGdntB;QACE,OAAOqB,KAAK8rB,GAAYhN;;IAG1BngB,QAAQ0B;QACN,OACEA,aAAiB2T,MACjBhU,KAAKQ,IAAI8D,QAAQjE,EAAMG,QACvBR,KAAK6d,QAAQvZ,QAAQjE,EAAMwd,YAC3B7d,KAAKgsB,OAAsB3rB,EAAM2rB,MACjChsB,KAAK6oB,0BAA0BxoB,EAAMwoB,yBACrC7oB,KAAK8rB,GAAYxnB,QAAQjE,EAAMyrB;;IAInCntB;QACE,OACE,YAAYqB,KAAKQ,QACfR,KAAK6d,YACF7d,KAAK8rB,GAAY1oB,iBACtB,uBAAuBpD,KAAKgsB,WAC5B,2BAA2BhsB,KAAK6oB;;IAIpCrX;QACE,OAAOxR,KAAKgsB,MAAqBhsB,KAAK6oB;;;;;;;;;;;;;MA2B7B3U,WAAmB2X;IAG9BltB,YACE6B,GACAqd,GACAkO;QAEA5oB,MAAM3C,GAAKqd,IACX7d,KAAK6oB,2BAA2BkD,MAAWA,EAAQlD;;IAGrDlqB;QACE,OAAO,cAAcqB,KAAKQ,QAAQR,KAAK6d;;IAGzCrM;QACE,OAAOxR,KAAK6oB;;IAGdlqB,QAAQ0B;QACN,OACEA,aAAiB6T,MACjB7T,EAAMwoB,0BAA0B7oB,KAAK6oB,yBACrCxoB,EAAMwd,QAAQvZ,QAAQtE,KAAK6d,YAC3Bxd,EAAMG,IAAI8D,QAAQtE,KAAKQ;;;;;;;UAShBuoB,WAAwB8C;IACnCltB;QACE,OAAO,mBAAmBqB,KAAKQ,QAAQR,KAAK6d;;IAG9CrM;QACE,QAAO;;IAGT7S,QAAQ0B;QACN,OACEA,aAAiB0oB,MACjB1oB,EAAMwd,QAAQvZ,QAAQtE,KAAK6d,YAC3Bxd,EAAMG,IAAI8D,QAAQtE,KAAKQ;;;;;;;;;;;;;;;;;;;;;;;;UnB1HhBmlB;;;;;IAcXhnB,YACW+G,GACA6B,IAAiC,MACjC0kB,IAA6B,IAC7BxkB,IAAoB,IACpB5C,IAAuB,MACvBqnB,sBACAxkB,IAAwB,MACxBC,IAAsB;QAPtB3H,YAAA0F,GACA1F,uBAAAuH,aACA0kB,GACAjsB,eAAAyH,GACAzH,aAAA6E;kBACAqnB,GACAlsB,eAAA0H,GACA1H,aAAA2H,GAjBX3H,UAA4C;;QAG5CA,UAAwC,MAgBlCA,KAAK0H,WACP1H,KAAKmsB,GAAiBnsB,KAAK0H,UAEzB1H,KAAK2H,SACP3H,KAAKmsB,GAAiBnsB,KAAK2H;;IA3B/BhJ,UAAc+G;QACZ,OAAO,IAAIigB,GAAMjgB;;IA8BnB8B;QACE,IAA6B,SAAzBxH,KAAKosB,IAA0B;YACjCpsB,KAAKosB,KAAkB;YAEvB,MAAMC,IAAkBrsB,KAAKssB,MACvBC,IAAoBvsB,KAAKwsB;YAC/B,IAAwB,SAApBH,KAAkD,SAAtBE;;;;YAIzBF,EAAgBI,OACnBzsB,KAAKosB,GAAgB3qB,KAAK,IAAI6jB,GAAQ+G,KAExCrsB,KAAKosB,GAAgB3qB,KACnB,IAAI6jB,GAAQvf,EAAU2mB,mCAEnB;gBAOL,IAAIC,KAAmB;gBACvB,KAAK,MAAMnlB,KAAWxH,KAAKisB,IACzBjsB,KAAKosB,GAAgB3qB,KAAK+F,IACtBA,EAAQc,MAAMmkB,QAChBE,KAAmB;gBAGvB,KAAKA,GAAkB;;;oBAGrB,MAAMC,IACJ5sB,KAAKisB,GAAgBntB,SAAS,IAC1BkB,KAAKisB,GAAgBjsB,KAAKisB,GAAgBntB,SAAS,GAAGyJ;oBAE5DvI,KAAKosB,GAAgB3qB,KACnB,IAAI6jB,GAAQvf,EAAU2mB,KAAYE;;;;QAK1C,OAAO5sB,KAAKosB;;IAGdztB,GAAUkH;QAcR,MAAMgnB,IAAa7sB,KAAKyH,QAAQ2d,OAAO,EAACvf;QACxC,OAAO,IAAI8f,GACT3lB,KAAK0F,MACL1F,KAAKuH,iBACLvH,KAAKisB,GAAgBrnB,SACrBioB,GACA7sB,KAAK6E,OACL7E,KAAKksB,IACLlsB,KAAK0H,SACL1H,KAAK2H;;IAIThJ,GAAW6I;;QAMT,MAAMslB,IAAa9sB,KAAKisB,GAAgB7G,OAAO,EAAC5d;QAChD,OAAO,IAAIme,GACT3lB,KAAK0F,MACL1F,KAAKuH,iBACLulB,GACA9sB,KAAKyH,QAAQ7C,SACb5E,KAAK6E,OACL7E,KAAKksB,IACLlsB,KAAK0H,SACL1H,KAAK2H;;IAIThJ,GAAiBkG;QACf,OAAO,IAAI8gB,GACT3lB,KAAK0F,MACL1F,KAAKuH,iBACLvH,KAAKisB,GAAgBrnB,SACrB5E,KAAKyH,QAAQ7C,SACbC,qBAEA7E,KAAK0H,SACL1H,KAAK2H;;IAIThJ,GAAgBkG;QACd,OAAO,IAAI8gB,GACT3lB,KAAK0F,MACL1F,KAAKuH,iBACLvH,KAAKisB,GAAgBrnB,SACrB5E,KAAKyH,QAAQ7C,SACbC,oBAEA7E,KAAK0H,SACL1H,KAAK2H;;IAIThJ,GAAYouB;QACV,OAAO,IAAIpH,GACT3lB,KAAK0F,MACL1F,KAAKuH,iBACLvH,KAAKisB,GAAgBrnB,SACrB5E,KAAKyH,QAAQ7C,SACb5E,KAAK6E,OACL7E,KAAKksB,IACLa,GACA/sB,KAAK2H;;IAIThJ,GAAUouB;QACR,OAAO,IAAIpH,GACT3lB,KAAK0F,MACL1F,KAAKuH,iBACLvH,KAAKisB,GAAgBrnB,SACrB5E,KAAKyH,QAAQ7C,SACb5E,KAAK6E,OACL7E,KAAKksB,IACLlsB,KAAK0H,SACLqlB;;;;;;;WAUJpuB,GAAwB+G;QACtB,OAAO,IAAIigB,GACTjgB;6BACqB,MACrB1F,KAAKisB,GAAgBrnB,SACrB5E,KAAKyH,QAAQ7C,SACb5E,KAAK6E,OACL7E,KAAKksB,IACLlsB,KAAK0H,SACL1H,KAAK2H;;;;;WAQThJ;QACE,OAC0B,MAAxBqB,KAAKyH,QAAQ3I,UACE,SAAfkB,KAAK6E,SACW,QAAhB7E,KAAK0H,WACS,QAAd1H,KAAK2H,UAC4B,MAAhC3H,KAAKisB,GAAgBntB,UACa,MAAhCkB,KAAKisB,GAAgBntB,UACpBkB,KAAKisB,GAAgB,GAAG3jB,MAAMmkB;;IAItC9tB;QACE,QAAQoI,EAAkB/G,KAAK6E,8BAAU7E,KAAKksB;;IAGhDvtB;QACE,QAAQoI,EAAkB/G,KAAK6E,6BAAU7E,KAAKksB;;IAGhDvtB;QACE,OAAOqB,KAAKisB,GAAgBntB,SAAS,IACjCkB,KAAKisB,GAAgB,GAAG3jB,QACxB;;IAGN3J;QACE,KAAK,MAAMkH,KAAU7F,KAAKyH,SACxB,IAAI5B,aAAkBoD,MAAepD,EAAOmnB,MAC1C,OAAOnnB,EAAOyC;QAGlB,OAAO;;;;IAKT3J,GAAmBsuB;QACjB,KAAK,MAAMpnB,KAAU7F,KAAKyH,SACxB,IAAI5B,aAAkBoD,MAChBgkB,EAAUtnB,QAAQE,EAAO8C,OAAO,GAClC,OAAO9C,EAAO8C;QAIpB,OAAO;;IAGThK;QACE,OAAOyK,GAAiBpJ,KAAK4lB;;IAG/BjnB;QACE,OAAgC,SAAzBqB,KAAKuH;;;;;WAOd5I;QACE,KAAKqB,KAAKktB,IACR,wBAAIltB,KAAKksB,IACPlsB,KAAKktB,KAAiBtlB,EACpB5H,KAAK0F,MACL1F,KAAKuH,iBACLvH,KAAKwH,SACLxH,KAAKyH,SACLzH,KAAK6E,OACL7E,KAAK0H,SACL1H,KAAK2H,aAEF;;YAEL,MAAMyc,IAAW;YACjB,KAAK,MAAM5c,KAAWxH,KAAKwH,SAAS;gBAClC,MAAMe,gCACJf,EAAQe;gBAGV6b,EAAS3iB,KAAK,IAAI6jB,GAAQ9d,EAAQc,OAAOC;;;wBAI3C,MAAMb,IAAU1H,KAAK2H,QACjB,IAAIwe,GAAMnmB,KAAK2H,MAAMue,WAAWlmB,KAAK2H,MAAMse,UAC3C,MACEte,IAAQ3H,KAAK0H,UACf,IAAIye,GAAMnmB,KAAK0H,QAAQwe,WAAWlmB,KAAK0H,QAAQue,UAC/C;;YAGJjmB,KAAKktB,KAAiBtlB,EACpB5H,KAAK0F,MACL1F,KAAKuH,iBACL6c,GACApkB,KAAKyH,SACLzH,KAAK6E,OACL6C,GACAC;;QAIN,OAAO3H,KAAKktB;;IAGNvuB,GAAiBouB;;;SAQXtb,GAAYvS,GAAaC;IACvC,OACE0J,EAAa3J,EAAK0mB,MAAYzmB,EAAMymB,SACpC1mB,EAAKgtB,OAAc/sB,EAAM+sB;;;;;;SAObiB,GAAcrc;IAC5B,OAAO,GAAGjJ,EAAeiJ,EAAM8U,YAAkB9U,EAAMob;;;SAGzCkB,GAAetc;IAC7B,OAAO,gBAAgBrI,EAAgBqI,EAAM8U,oBAC3C9U,EAAMob;;;0EAKMmB,GAAavc,GAAcb;IACzC,OAQF,SACEa,GACAb;QAEA,MAAMqd,IAAUrd,EAAIzP,IAAIkF;QACxB,OAA8B,SAA1BoL,EAAMvJ,kBAIN0I,EAAIzP,IAAI+sB,EAAgBzc,EAAMvJ,oBAC9BuJ,EAAMpL,KAAKwiB,EAAWoF,KAEf7mB,EAAY4C,EAAcyH,EAAMpL,QAElCoL,EAAMpL,KAAKpB,QAAQgpB,KAGnBxc,EAAMpL,KAAK8nB,EAAoBF;;;;;GAxBtCG,EAAmC3c,GAAOb,MAgC9C,SAA6Ba,GAAcb;QACzC,KAAK,MAAMzI,KAAWsJ,EAAMmb;;QAE1B,KAAKzkB,EAAQc,MAAMmkB,OAA6C,SAA7Bxc,EAAI3H,MAAMd,EAAQc,QACnD,QAAO;QAGX,QAAO;KAtCLolB,CAAoB5c,GAAOb,MAyC/B,SAA6Ba,GAAcb;QACzC,KAAK,MAAMpK,KAAUiL,EAAMrJ,SACzB,KAAK5B,EAAOzE,QAAQ6O,IAClB,QAAO;QAGX,QAAO;;mEA9CL0d,EAAoB7c,GAAOb,MAkD/B,SAA4Ba,GAAcb;QACxC,IACEa,EAAMpJ,YACLkmB,GAAoB9c,EAAMpJ,SAASoJ,EAAMtJ,SAASyI,IAEnD,QAAO;QAET,IAAIa,EAAMnJ,SAASimB,GAAoB9c,EAAMnJ,OAAOmJ,EAAMtJ,SAASyI,IACjE,QAAO;QAET,QAAO;;;;;GA3DL4d,EAAmB/c,GAAOb;;;SAkEd6d,GACdhd;IAEA,OAAO,CAAClB,GAAcC;QACpB,IAAIke,KAAqB;QACzB,KAAK,MAAMvmB,KAAWsJ,EAAMtJ,SAAS;YACnC,MAAMmI,IAAOqe,GAAYxmB,GAASoI,GAAIC;YACtC,IAAa,MAATF,GACF,OAAOA;YAEToe,IAAqBA,KAAsBvmB,EAAQc,MAAMmkB;;QAO3D,OAAO;;;;MAmBExjB;IACXtK,YACS2J,GACAK,GACAxL;QAEPgG,SAJOnD,aAAAsI,GACAtI,UAAA2I,GACA3I,aAAA7C;;;;WAQTwB,cAAc2J,GAAkBK,GAAcxL;QAC5C,IAAImL,EAAMmkB,KACR,yBAAI9jB,IASK,IAAIslB,GAAiB3lB,GAAOnL,KAU5B,IAAI+wB,GAAe5lB,GAAOK,GAAIxL;QAElC,IAAI6e,GAAY7e,IAAQ;YAC7B,yBAAIwL,GACF,MAAM,IAAI1F,EACRlB,EAAKI,kBACL;YAGJ,OAAO,IAAI8G,GAAYX,GAAOK,GAAIxL;;QAC7B,IAAI8e,GAAW9e,IAAQ;YAC5B,yBAAIwL,GACF,MAAM,IAAI1F,EACRlB,EAAKI,kBACL;YAGJ,OAAO,IAAI8G,GAAYX,GAAOK,GAAIxL;;QAC7B,iDAAIwL,IACF,IAAIwlB,GAAoB7lB,GAAOnL,uBAC7BwL,IAKF,IAAIylB,GAAS9lB,GAAOnL,uDAClBwL,IAKF,IAAI0lB,GAAuB/lB,GAAOnL,KAElC,IAAI8L,GAAYX,GAAOK,GAAIxL;;IAItCwB,QAAQsR;QACN,MAAM5P,IAAQ4P,EAAI3H,MAAMtI,KAAKsI;;gBAG7B,OACY,SAAVjI,KACA+W,GAAUpX,KAAK7C,WAAWia,GAAU/W,MACpCL,KAAKsuB,GAAkBrV,GAAa5Y,GAAOL,KAAK7C;;IAI1CwB,GAAkBqb;QAC1B,QAAQha,KAAK2I;UACX;YACE,OAAOqR,IAAa;;UACtB;YACE,OAAOA,KAAc;;UACvB;YACE,OAAsB,MAAfA;;UACT;YACE,OAAOA,IAAa;;UACtB;YACE,OAAOA,KAAc;;UACvB;YACE,OA/iBDzc;;;IAmjBLoB;QACE,OACE,oHAKEgH,QAAQ3F,KAAK2I,OAAO;;;;SAKZR,GAAetC;;;;IAQ7B,OACEA,EAAOyC,MAAM7C,MACbI,EAAO8C,GAAGvF,aACV6E,GAAYpC,EAAO1I;;;MA0BV+wB,WAAuBjlB;IAGlCtK,YAAY2J,GAAkBK,GAAcxL;QAC1CgG,MAAMmF,GAAOK,GAAIxL,IAKjB6C,KAAKQ,MAAMiG,EAAYuU,EAAS7d,EAAM0a;;IAGxClZ,QAAQsR;QACN,MAAM+J,IAAavT,EAAYpH,EAAW4Q,EAAIzP,KAAKR,KAAKQ;QACxD,OAAOR,KAAKsuB,GAAkBtU;;;;gEAKrBiU,WAAyBhlB;IAGpCtK,YAAY2J,GAAkBnL;QAC5BgG,MAAMmF,mBAAoBnL,IAE1B6C,KAAKsP,QAAQnS,EAAMqb,WAAWC,UAAU,IAAI5b,IAAIiF,KAKvC2E,EAAYuU,EAASlZ,EAAE+V;;IAIlClZ,QAAQsR;QACN,OAAOjQ,KAAKsP,KAAKwY,KAAKtnB,KAAOA,EAAI8D,QAAQ2L,EAAIzP;;;;mEAKpC2tB,WAA4BllB;IACvCtK,YAAY2J,GAAkBnL;QAC5BgG,MAAMmF,2CAAgCnL;;IAGxCwB,QAAQsR;QACN,MAAM5P,IAAQ4P,EAAI3H,MAAMtI,KAAKsI;QAC7B,OAAOyT,GAAQ1b,MAAUwY,GAAmBxY,EAAMmY,YAAYxY,KAAK7C;;;;uDAK1DixB,WAAiBnlB;IAC5BtK,YAAY2J,GAAkBnL;QAC5BgG,MAAMmF,mBAAoBnL;;IAI5BwB,QAAQsR;QACN,MAAM5P,IAAQ4P,EAAI3H,MAAMtI,KAAKsI;QAC7B,OAAiB,SAAVjI,KAAkBwY,GAAmB7Y,KAAK7C,MAAiB,YAAEkD;;;;uEAK3DguB,WAA+BplB;IAC1CtK,YAAY2J,GAAkBnL;QAC5BgG,MAAMmF,mDAAoCnL;;IAI5CwB,QAAQsR;QACN,MAAM5P,IAAQ4P,EAAI3H,MAAMtI,KAAKsI;QAC7B,UAAKyT,GAAQ1b,OAAWA,EAAMmY,WAAWC,WAGlCpY,EAAMmY,WAAWC,OAAOqP,KAAKrD,KAClC5L,GAAmB7Y,KAAK7C,MAAiB,YAAEsnB;;;;;;;;;;;;;;;;;UA2BpC0B;IACXxnB,YAAqBunB,GAAgCD;QAAhCjmB,gBAAAkmB,GAAgClmB,cAAAimB;;;;SAGvCzd,GAAcukB;;IAE5B,OAAO,GAAGA,EAAM9G,SAAS,MAAM,OAAO8G,EAAM7G,SACzCrpB,IAAI0xB,KAAKtmB,GAAYsmB,IACrB/oB,KAAK;;;;;;aAOMooB,GACdb,GACAvlB,GACAyI;IAMA,IAAI+J,IAAa;IACjB,KAAK,IAAI1b,IAAI,GAAGA,IAAIyuB,EAAM7G,SAASpnB,QAAQR,KAAK;QAC9C,MAAMkwB,IAAmBhnB,EAAQlJ,IAC3BmwB,IAAY1B,EAAM7G,SAAS5nB;QACjC,IAAIkwB,EAAiBlmB,MAAMmkB,KAKzBzS,IAAavT,EAAYpH,EACvBoH,EAAYuU,EAASyT,EAAU5W,iBAC/B5H,EAAIzP,WAED;YAMLwZ,IAAaf,GAAawV,GALTxe,EAAI3H,MAAMkmB,EAAiBlmB;;QAU9C,gCAHIkmB,EAAiBjmB,QACnByR,MAA2B,IAEV,MAAfA,GACF;;IAGJ,OAAO+S,EAAM9G,SAASjM,KAAc,IAAIA,IAAa;;;SAGvC7Q,GAAYjK,GAAoBC;IAC9C,IAAa,SAATD,GACF,OAAiB,SAAVC;IACF,IAAc,SAAVA,GACT,QAAO;IAGT,IACED,EAAK+mB,WAAW9mB,EAAM8mB,UACtB/mB,EAAKgnB,SAASpnB,WAAWK,EAAM+mB,SAASpnB,QAExC,QAAO;IAET,KAAK,IAAIR,IAAI,GAAGA,IAAIY,EAAKgnB,SAASpnB,QAAQR,KAAK;QAG7C,KAAK4K,GAFgBhK,EAAKgnB,SAAS5nB,IACba,EAAM+mB,SAAS5nB,KAEnC,QAAO;;IAGX,QAAO;;;;;UAMIgnB;IACX3mB,YACW2J,GACAC;QADAvI,aAAAsI,GACAtI,WAAAuI;;;;SAIGylB,GACdxmB,GACAoI,GACAC;IAEA,MAAMmK,IAAaxS,EAAQc,MAAMmkB,MAC7BhmB,EAAYpH,EAAWuQ,EAAGpP,KAAKqP,EAAGrP,gBmBztBtC8H,GACAsH,GACAC;QAEA,MAAM6e,IAAK9e,EAAGtH,MAAMA,IACdqmB,IAAK9e,EAAGvH,MAAMA;QACpB,OAAW,SAAPomB,KAAsB,SAAPC,IACV1V,GAAayV,GAAIC,KA5FnBpxB;KnB+yBHqxB,CAAwBpnB,EAAQc,OAAOsH,GAAIC;IAC/C,QAAQrI,EAAQe;MACd;QACE,OAAOyR;;MACT;QACE,QAAQ,IAAIA;;MACd;QACE,OAlzBCzc;;;;SA+zBSuL,GAAc5J,GAAeC;IAC3C,OAAOD,EAAKqJ,QAAQpJ,EAAMoJ,OAAOrJ,EAAKoJ,MAAMhE,QAAQnF,EAAMmJ;;;;;;;;;;;;;;;;;;;;;;MoBnzB/CumB;;;;;;;;;;;;IAYXlwB,YACSmwB,GACA/X,GACAgY,GACAC;QAHAhvB,eAAA8uB,aACA/X,GACA/W,qBAAA+uB,GACA/uB,iBAAAgvB;;;;;;;;;;WAcTrwB,GACEswB,GACAxG,GACAyG;QAUA,MAAMC,IAAkBD,EAAYC;QAQpC,KAAK,IAAI7wB,IAAI,GAAGA,IAAI0B,KAAKgvB,UAAUlwB,QAAQR,KAAK;YAC9C,MAAM+hB,IAAWrgB,KAAKgvB,UAAU1wB;YAChC,IAAI+hB,EAAS7f,IAAI8D,QAAQ2qB,IAAS;gBAEhCxG,IAAWE,GACTtI,GACAoI,GAHqB0G,EAAgB7wB;;;QAQ3C,OAAOmqB;;;;;;;;WAUT9pB,GACEswB,GACAxG;;;QAYA,KAAK,MAAMpI,KAAYrgB,KAAK+uB,eACtB1O,EAAS7f,IAAI8D,QAAQ2qB,OACvBxG,IAAWgB,GACTpJ,GACAoI,GACAA,GACAzoB,KAAK+W;QAKX,MAAMqS,IAAUX;;gBAGhB,KAAK,MAAMpI,KAAYrgB,KAAKgvB,WACtB3O,EAAS7f,IAAI8D,QAAQ2qB,OACvBxG,IAAWgB,GACTpJ,GACAoI,GACAW,GACAppB,KAAK+W;QAIX,OAAO0R;;;;;WAOT9pB,GAAwBywB;;;;QAItB,IAAIC,IAAmBD;QAUvB,OATApvB,KAAKgvB,UAAUnuB,QAAQyuB;YACrB,MAAMC,IAAkBvvB,KAAKwvB,GAC3BF,EAAE9uB,KACF4uB,EAAU5tB,IAAI8tB,EAAE9uB;YAEd+uB,MACFF,IAAmBA,EAAiB9jB,GAAO+jB,EAAE9uB,KAAK+uB;YAG/CF;;IAGT1wB;QACE,OAAOqB,KAAKgvB,UAAU9J,OACpB,CAAC5V,GAAMggB,MAAMhgB,EAAKd,IAAI8gB,EAAE9uB,MACxB6O;;IAIJ1Q,QAAQ0B;QACN,OACEL,KAAK8uB,YAAYzuB,EAAMyuB,WACvB1vB,EAAYY,KAAKgvB,WAAW3uB,EAAM2uB,WAAW,CAAC7G,GAAGC,MAC/CoC,GAAerC,GAAGC,OAEpBhpB,EAAYY,KAAK+uB,eAAe1uB,EAAM0uB,eAAe,CAAC5G,GAAGC,MACvDoC,GAAerC,GAAGC;;;;qEAObqH;IACX9wB,YACW+wB,GACAC,GACAR;;;;;IAKAS;QAPA5vB,aAAA0vB,aACAC,aACAR,aAKAS;;;;;;WAQXjxB,YACE+wB,GACAC,GACAE;QAzKClyB,EA4KC+xB,EAAMV,UAAUlwB,WAAW+wB,EAAQ/wB;QAOrC,IAAIgxB,IZlKC3gB;QYmKL,MAAM6f,IAAYU,EAAMV;QACxB,KAAK,IAAI1wB,IAAI,GAAGA,IAAI0wB,EAAUlwB,QAAQR,KACpCwxB,IAAaA,EAAWvkB,GAAOyjB,EAAU1wB,GAAGkC,KAAKqvB,EAAQvxB,GAAGuf;QAG9D,OAAO,IAAI4R,GAAoBC,GAAOC,GAAeE,GAASC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;UClMrDC;IAeXpxB,YAAYqxB;;;QAZZhwB,UAAqD,MACrDA,UAAkD;;QAG1CA,mBAAwBsB,GACxBtB,kBAA2BsB,GACnCtB,WAAiB;;;QAIjBA,WAA2B,GAGzBgwB,EACE7yB;YACE6C,KAAKiwB,MAAS,GACdjwB,KAAKyM,SAAStP,GACV6C,KAAKkwB;;;YAGPlwB,KAAKkwB;WAGThzB;YACE8C,KAAKiwB,MAAS,GACdjwB,KAAK9C,QAAQA,GACT8C,KAAKmwB,MACPnwB,KAAKmwB,GAAcjzB;;;IAM3ByB,MACEmC;QAEA,OAAOd,KAAKwG,UAAKlF,GAAWR;;IAG9BnC,KACEyxB,GACAC;QAMA,OAJIrwB,KAAKswB,MACP/yB,KAEFyC,KAAKswB,MAAmB,GACpBtwB,KAAKiwB,KACFjwB,KAAK9C,QAGD8C,KAAKuwB,GAAYF,GAASrwB,KAAK9C,SAF/B8C,KAAKwwB,GAAYJ,GAAQpwB,KAAY,UAKvC,IAAI+vB,GAAsB,CAACU,GAASC;YACzC1wB,KAAKkwB,KAAgB/yB;gBACnB6C,KAAKwwB,GAAYJ,GAAQjzB,GAAOqJ,KAAKiqB,GAASC;eAEhD1wB,KAAKmwB,KAAiBjzB;gBACpB8C,KAAKuwB,GAAYF,GAASnzB,GAAOsJ,KAAKiqB,GAASC;;;;IAMvD/xB;QACE,OAAO,IAAIgyB,QAAQ,CAACF,GAASC;YAC3B1wB,KAAKwG,KAAKiqB,GAASC;;;IAIf/xB,GACNmC;QAEA;YACE,MAAM2L,IAAS3L;YACf,OAAI2L,aAAkBsjB,KACbtjB,IAEAsjB,GAAmBU,QAAQhkB;UAEpC,OAAOnP;YACP,OAAOyyB,GAAmBW,OAAUpzB;;;IAIhCqB,GACNyxB,GACAjzB;QAEA,OAAIizB,IACKpwB,KAAK4wB,GAAiB,MAAMR,EAAOjzB,MAGnC4yB,GAAmBU,QAAYtzB;;IAIlCwB,GACN0xB,GACAnzB;QAEA,OAAImzB,IACKrwB,KAAK4wB,GAAiB,MAAMP,EAAQnzB,MAEpC6yB,GAAmBW,OAAUxzB;;IAMxCyB,eAAkB8N;QAChB,OAAO,IAAIsjB,GAA6B,CAACU,GAASC;YAChDD,EAAQhkB;;;IAIZ9N,cAAiBzB;QACf,OAAO,IAAI6yB,GAAsB,CAACU,GAASC;YACzCA,EAAOxzB;;;IAIXyB;;;IAGEkyB;QAEA,OAAO,IAAId,GAAyB,CAACU,GAASC;YAC5C,IAAIxb,IAAgB,GAChB4b,IAAgB,GAChBC,KAAO;YAEXF,EAAIhwB,QAAQknB;kBACR7S,GACF6S,EAAQvhB,KACN;sBACIsqB,GACEC,KAAQD,MAAkB5b,KAC5Bub;mBAGJO,KAAON,EAAOM;gBAIlBD,KAAO,GACHD,MAAkB5b,KACpBub;;;;;;;;WAWN9xB,UACEsyB;QAEA,IAAI1C,IAAiCwB,GAAmBU,SACtD;QAEF,KAAK,MAAMS,KAAaD,GACtB1C,IAAIA,EAAE/nB,KAAK2qB,KACLA,IACKpB,GAAmBU,QAAiBU,KAEpCD;QAIb,OAAO3C;;IAkBT5vB,eACEyyB,GACAlpB;QAEA,MAAMmpB,IAA4C;QAIlD,OAHAD,EAAWvwB,QAAQ,CAACunB,GAAG3oB;YACrB4xB,EAAS5vB,KAAKyG,EAAEtH,KAAKZ,MAAMooB,GAAG3oB;YAEzBO,KAAKsxB,GAAQD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;UC3MFE;IAAtB5yB;;;QAGEqB,UAGI,IAAIgB,EACNR,KAAOA,EAAI4C,YACX,CAAC+kB,GAAGC,MAAMD,EAAE7jB,QAAQ8jB,KAMtBpoB,WAAyB;;IAgBzBqf,aAAuBliB;QAQrB6C,KAAKwxB,KAAYr0B;;IAGnBkiB;QAKE,OAAOrf,KAAKwxB;;;;;;;WASd7yB,GAAS8yB,GAA8BpS;QACrCrf,KAAK0xB,MACL1xB,KAAKqf,WAAWA,GAChBrf,KAAK4Q,GAAQrB,IAAIkiB,EAAcjxB,KAAKixB;;;;;;;WAStC9yB,GAAY6B,GAAkB6e;QAC5Brf,KAAK0xB,MACDrS,MACFrf,KAAKqf,WAAWA,IAElBrf,KAAK4Q,GAAQrB,IAAI/O,GAAK;;;;;;;;;;;;WAcxB7B,GACEgzB,GACAC;QAEA5xB,KAAK0xB;QACL,MAAMG,IAAgB7xB,KAAK4Q,GAAQpP,IAAIowB;QACvC,YAAsBtwB,MAAlBuwB,IACK9B,GAAmBU,QAA8BoB,KAEjD7xB,KAAK8xB,GAAaH,GAAaC;;;;;;;;;;;;WAe1CjzB,WACEgzB,GACAI;QAEA,OAAO/xB,KAAKgyB,GAAgBL,GAAaI;;;;;WAO3CpzB,MAAMgzB;QAGJ,OAFA3xB,KAAK0xB,MACL1xB,KAAKiyB,MAAiB,GACfjyB,KAAKkyB,GAAaP;;yDAIjBhzB;;;;;;;;;;;;;;;;;;GC7IL,OAAMwzB,KACX;;;;;;;;;UAWoBC;IAAtBzzB;QACEqB,UAA2D;;IAI3DrB,GAAuB0zB;QACrBryB,KAAKsyB,GAAqB7wB,KAAK4wB;;IAGjC1zB;QACEqB,KAAKsyB,GAAqBzxB,QAAQwxB,KAAYA;;;;;;;;;;;;;;;;;;;;;;;;;UCFrCE;IACX5zB,YACW6zB,GACAC,GACAC;kBAFAF,aACAC,aACAC;;;;;;;WASX/zB,GACEgzB,GACAnxB;QAEA,OAAOR,KAAKyyB,GACTE,GAA0ChB,GAAanxB,GACvDgG,KAAKosB,KAAW5yB,KAAK6yB,GAAoBlB,GAAanxB,GAAKoyB;;6EAIxDj0B,GACNgzB,GACAnxB,GACAsyB;QAEA,OAAO9yB,KAAKwyB,GAAoBO,GAASpB,GAAanxB,GAAKgG,KAAKyJ;YAC9D,KAAK,MAAMyf,KAASoD,GAClB7iB,IAAMyf,EAAMF,GAAiBhvB,GAAKyP;YAEpC,OAAOA;;;;;IAMHtR,GACNgzB,GACA5gB,GACA6hB;QAEA,IAAI/C,IAAU7gB;QAOd,OANA+B,EAAKlQ,QAAQ,CAACL,GAAKwyB;YACjB,KAAK,MAAMtD,KAASkD,GAClBI,IAAYtD,EAAMF,GAAiBhvB,GAAKwyB;YAE1CnD,IAAUA,EAAQtkB,GAAO/K,GAAKwyB;YAEzBnD;;;;;;;WASTlxB,GACEgzB,GACAriB;QAEA,OAAOtP,KAAKwyB,GACTS,WAAWtB,GAAariB,GACxB9I,KAAKuK,KAAQ/Q,KAAKkzB,GAAwBvB,GAAa5gB;;;;;WAO5DpS,GACEgzB,GACAwB;QAEA,OAAOnzB,KAAKyyB,GACTW,GAA2CzB,GAAawB,GACxD3sB,KAAKosB;YACJ,MAAM7hB,IAAO/Q,KAAKqzB,GAChB1B,GACAwB,GACAP;YAEF,IAAI/C,IAAU9gB;YASd,OARAgC,EAAKlQ,QAAQ,CAACL,GAAKioB;;gBAEZA,MACHA,IAAW,IAAIvU,GAAW1T,GAAK2D,EAAgBkB,SAEjDwqB,IAAUA,EAAQtkB,GAAO/K,GAAKioB;gBAGzBoH;;;;;;;;;;WAYblxB,GACEgzB,GACA7gB,GACAwiB;QAEA,OAAIxiB,EAAMyiB,OACDvzB,KAAKwzB,GAAkC7B,GAAa7gB,EAAMpL,QACxDoL,EAAM2iB,OACRzzB,KAAK0zB,GACV/B,GACA7gB,GACAwiB,KAGKtzB,KAAK2zB,GACVhC,GACA7gB,GACAwiB;;IAKE30B,GACNgzB,GACArE;;QAGA,OAAOttB,KAAK4zB,GAAYjC,GAAa,IAAIlrB,EAAY6mB,IAAU9mB,KAC7DiiB;YACE,IAAIhc,IAASyC;YAIb,OAHIuZ,aAAoBzU,OACtBvH,IAASA,EAAOlB,GAAOkd,EAASjoB,KAAKioB,KAEhChc;;;IAKL9N,GACNgzB,GACA7gB,GACAwiB;QAMA,MAAM1sB,IAAekK,EAAMvJ;QAC3B,IAAIsoB,IAAU3gB;QACd,OAAOlP,KAAK0yB,GACTmB,GAAqBlC,GAAa/qB,GAClCJ,KAAKstB,KAGG/D,GAAmBlvB,QAAQizB,GAAUtQ;YAC1C,MAAMuQ,IAAkBjjB,EAAMkjB,GAC5BxQ,EAAOtF,MAAMtX;YAEf,OAAO5G,KAAK2zB,GACVhC,GACAoC,GACAT,GACA9sB,KAAK4hB;gBACLA,EAAEvnB,QAAQ,CAACL,GAAKyP;oBACd4f,IAAUA,EAAQtkB,GAAO/K,GAAKyP;;;WAGjCzJ,KAAK,MAAMqpB;;IAIZlxB,GACNgzB,GACA7gB,GACAwiB;;QAGA,IAAIzD,GACAoE;QACJ,OAAOj0B,KAAKwyB,GACT0B,GAA0BvC,GAAa7gB,GAAOwiB,GAC9C9sB,KAAK2tB,MACJtE,IAAUsE,GACHn0B,KAAKyyB,GAAc2B,GACxBzC,GACA7gB,KAGHtK,KAAK6tB,MACJJ,IAAkBI;QAOXr0B,KAAKs0B,GACV3C,GACAsC,GACApE,GACArpB,KAAK+tB;YACL1E,IAAU0E;YAEV,KAAK,MAAM7E,KAASuE,GAClB,KAAK,MAAM5T,KAAYqP,EAAMV,WAAW;gBACtC,MAAMxuB,IAAM6f,EAAS7f,KACf4oB,IAAUyG,EAAQruB,IAAIhB,IACtBg0B,IAAa/K,GACjBpJ,GACA+I,GACAA,GACAsG,EAAM3Y;gBAGN8Y,IADE2E,aAAsBxgB,KACd6b,EAAQtkB,GAAO/K,GAAKg0B,KAEpB3E,EAAQnkB,OAAOlL;;aAMlCgG,KAAK;;;QAGJqpB,EAAQhvB,QAAQ,CAACL,GAAKyP;YACfod,GAAavc,GAAOb,OACvB4f,IAAUA,EAAQnkB,OAAOlL;YAItBqvB;;IAILlxB,GACNgzB,GACA0C,GACAI;QAEA,IAAIC,IAAmCrlB;QACvC,KAAK,MAAMqgB,KAAS2E,GAClB,KAAK,MAAMhU,KAAYqP,EAAMV,WAEzB3O,aAAoBI,MACoB,SAAxCgU,EAAkBjzB,IAAI6e,EAAS7f,SAE/Bk0B,IAAmCA,EAAiClmB,IAClE6R,EAAS7f;QAMjB,IAAI+zB,IAAkBE;QACtB,OAAOz0B,KAAKwyB,GACTS,WAAWtB,GAAa+C,GACxBluB,KAAKmuB,MACJA,EAAgB9zB,QAAQ,CAACL,GAAKyP;YAChB,SAARA,KAAgBA,aAAe+D,OACjCugB,IAAkBA,EAAgBhpB,GAAO/K,GAAKyP;YAG3CskB;;;;;;;;;;;;;;;;;;;;;;;;UClSFK;IACXj2B,YACW4L,GACA4G,GACA0jB,GACAC;QAHA90B,gBAAAuK,GACAvK,iBAAAmR,aACA0jB,aACAC;;IAGXn2B,UACE4L,GACAwqB;QAEA,IAAIF,IAAYxlB,MACZylB,IAAczlB;QAElB,KAAK,MAAM0E,KAAaghB,EAAa9jB,YACnC,QAAQ8C,EAAUpD;UAChB;YACEkkB,IAAYA,EAAUrmB,IAAIuF,EAAU9D,IAAIzP;YACxC;;UACF;YACEs0B,IAAcA,EAAYtmB,IAAIuF,EAAU9D,IAAIzP;;;QAOlD,OAAO,IAAIo0B,GACTrqB,GACAwqB,EAAa5jB,WACb0jB,GACAC;;;;;;;;;;;;;;;;;;;;;;;;;UCnBOE;IAOXr2B,YACUmoB,GACRmO;QADQj1B,qBAAA8mB,GAGJmO,MACFA,EAAqBC,KAAwBzqB,KAC3CzK,KAAKm1B,GAAiB1qB,IACxBzK,KAAKo1B,KAAyB3qB,KAC5BwqB,EAAqBI,GAAoB5qB;;IAIvC9L,GACN22B;QAGA,OADAt1B,KAAK8mB,gBAAgBvoB,KAAKg3B,IAAID,GAAuBt1B,KAAK8mB,gBACnD9mB,KAAK8mB;;IAGdnoB;QACE,MAAM62B,MAAcx1B,KAAK8mB;QAIzB,OAHI9mB,KAAKo1B,MACPp1B,KAAKo1B,GAAuBI,IAEvBA;;;;AA9BTR,SAAiD;;;;;;;;;;;;;;;;;;MCftCS;IAMX92B;QACEqB,KAAK01B,UAAU,IAAI/E,QAAQ,CAACF,GAAsBC;YAChD1wB,KAAKywB,UAAUA,GACfzwB,KAAK0wB,SAASA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;MCQPiF;IAMXh3B;;;;IAImBi3B;;;;IAIAC;;;;;;IAMAC,IApCoB;;;;UAyCpBC,IAvCU;;;;;UA6CVC,IA1CgB;kBAqBhBJ,aAIAC,aAMAC,aAKAC,aAMAC,GA9BnBh2B,UAAgC,GAChCA,UAAsD;;QAEtDA,UAA0B0D,KAAKC,OA6B7B3D,KAAKi2B;;;;;;;;WAUPt3B;QACEqB,KAAKk2B,KAAgB;;;;;WAOvBv3B;QACEqB,KAAKk2B,KAAgBl2B,KAAKg2B;;;;;;WAQ5Br3B,GAAcgK;;QAEZ3I,KAAKm2B;;;QAIL,MAAMC,IAA2B73B,KAAKC,MACpCwB,KAAKk2B,KAAgBl2B,KAAKq2B,OAItBC,IAAe/3B,KAAKg3B,IAAI,GAAG7xB,KAAKC,QAAQ3D,KAAKu2B,KAG7CC,IAAmBj4B,KAAKg3B,IAC5B,GACAa,IAA2BE;;gBAGzBE,IAAmB,KACrBj6B,EAtGU,sBAwGR,mBAAmBi6B,UACjB,gBAAgBx2B,KAAKk2B,YACrB,sBAAsBE,WACtB,iBAAiBE;QAIvBt2B,KAAKy2B,KAAez2B,KAAK41B,GAAMc,GAC7B12B,KAAK61B,IACLW,GACA,OACEx2B,KAAKu2B,KAAkB7yB,KAAKC,OACrBgF;;;QAMX3I,KAAKk2B,MAAiBl2B,KAAK+1B,IACvB/1B,KAAKk2B,KAAgBl2B,KAAK81B,OAC5B91B,KAAKk2B,KAAgBl2B,KAAK81B,KAExB91B,KAAKk2B,KAAgBl2B,KAAKg2B,OAC5Bh2B,KAAKk2B,KAAgBl2B,KAAKg2B;;IAI9Br3B;QAC4B,SAAtBqB,KAAKy2B,OACPz2B,KAAKy2B,GAAaE,MAClB32B,KAAKy2B,KAAe;;IAIxB93B;QAC4B,SAAtBqB,KAAKy2B,OACPz2B,KAAKy2B,GAAaN,UAClBn2B,KAAKy2B,KAAe;;sFAKhB93B;QACN,QAAQJ,KAAKE,WAAW,MAAOuB,KAAKk2B;;;;;;;;;;;;;;;;;;;;;;;SC7FxBU,GAAmBlxB;IACjC,IAAI+G,IAAS;IACb,KAAK,IAAInO,IAAI,GAAGA,IAAIoH,EAAK5G,QAAQR,KAC3BmO,EAAO3N,SAAS,MAClB2N,IAASoqB,GAAgBpqB,KAE3BA,IAASqqB,GAAcpxB,EAAKlE,IAAIlD,IAAImO;IAEtC,OAAOoqB,GAAgBpqB;;;wEAIzB,UAASqqB,GAAchyB,GAAiBiyB;IACtC,IAAItqB,IAASsqB;IACb,MAAMj4B,IAASgG,EAAQhG;IACvB,KAAK,IAAIR,IAAI,GAAGA,IAAIQ,GAAQR,KAAK;QAC/B,MAAMiI,IAAIzB,EAAQ9F,OAAOV;QACzB,QAAQiI;UACN,KAAK;YACHkG,KAAUuqB;YACV;;UACF,KA7Ba;YA8BXvqB,KAAUuqB;YACV;;UACF;YACEvqB,KAAUlG;;;IAGhB,OAAOkG;;;qDAIT,UAASoqB,GAAgBpqB;IACvB,OAAOA,IAzCU;;;;;;;;aAkDHwqB,GAAmBvxB;;;IAGjC,MAAM5G,IAAS4G,EAAK5G;IAEpB,IArFoCnB,EAoFzBmB,KAAU,IACN,MAAXA,GAKF,OAJAnB,EAxDe,QAyDb+H,EAAK1G,OAAO,MAxDW,QAwDU0G,EAAK1G,OAAO,KAGxCsG,EAAaqZ;;;QAKtB,MAAMuY,IAA4Bp4B,IAAS,GAErC0F,IAAqB;IAC3B,IAAI2yB,IAAiB;IAErB,KAAK,IAAI/oB,IAAQ,GAAGA,IAAQtP,KAAU;;;QAGpC,MAAMoG,IAAMQ,EAAKC,QAzEF,KAyEsByI;QAMrC,SALIlJ,IAAM,KAAKA,IAAMgyB,MACnB35B,KAGWmI,EAAK1G,OAAOkG,IAAM;UAE7B,KA/EuB;YAgFrB,MAAMkyB,IAAe1xB,EAAK2xB,UAAUjpB,GAAOlJ;YAC3C,IAAIJ;YAC0B,MAA1BqyB,EAAer4B;;;YAGjBgG,IAAUsyB,KAEVD,KAAkBC,GAClBtyB,IAAUqyB,GACVA,IAAiB,KAEnB3yB,EAAS/C,KAAKqD;YACd;;UACF,KA5Fa;YA6FXqyB,KAAkBzxB,EAAK2xB,UAAUjpB,GAAOlJ,IACxCiyB,KAAkB;YAClB;;UACF,KA/FgB;;YAiGdA,KAAkBzxB,EAAK2xB,UAAUjpB,GAAOlJ,IAAM;YAC9C;;UACF;YACE3H;;QAGJ6Q,IAAQlJ,IAAM;;IAGhB,OAAO,IAAII,EAAad;;;;;;;;;;;;;;;;;;;;;UCpJb8yB;IAAb34B;QACEqB,UAAgC,IAAIu3B;;IAEpC54B,GACEgzB,GACA6F;QAGA,OADAx3B,KAAKy3B,GAAsBjpB,IAAIgpB,IACxBzH,GAAmBU;;IAG5B9xB,GACEgzB,GACA/qB;QAEA,OAAOmpB,GAAmBU,QACxBzwB,KAAKy3B,GAAsBxE,WAAWrsB;;;;;;;;UAU/B2wB;IAAb54B;QACUqB,aAAQ;;;IAKhBrB,IAAI64B;QAEF,MAAM5wB,IAAe4wB,EAAe5T,KAC9B8T,IAAaF,EAAe7T,KAC5BgU,IACJ33B,KAAKT,MAAMqH,MACX,IAAI+G,GAAwBrI,EAAajG,IACrCu4B,KAASD,EAAgBppB,IAAImpB;QAEnC,OADA13B,KAAKT,MAAMqH,KAAgB+wB,EAAgBnpB,IAAIkpB,IACxCE;;IAGTj5B,IAAI64B;QACF,MAAM5wB,IAAe4wB,EAAe5T,KAC9B8T,IAAaF,EAAe7T,KAC5BgU,IAAkB33B,KAAKT,MAAMqH;QACnC,OAAO+wB,KAAmBA,EAAgBppB,IAAImpB;;IAGhD/4B,WAAWiI;QAIT,QAFE5G,KAAKT,MAAMqH,MACX,IAAI+G,GAAwBrI,EAAajG,IACxBkG;;;;;;;;;;;;;;;;;;;;;;UC/CVsyB;IAAbl5B;;;;;;;;QAQEqB,UAAiC,IAAIu3B;;;;;;;;WASrC54B,GACEgzB,GACA6F;QAGA,KAAKx3B,KAAK83B,GAAuBvpB,IAAIipB,IAAiB;YACpD,MAAM5wB,IAAe4wB,EAAe5T,KAC9B8T,IAAaF,EAAe7T;YAElCgO,EAAYoG,GAAuB;;;gBAGjC/3B,KAAK83B,GAAuBtpB,IAAIgpB;;YAGlC,MAAMQ,IAAuC;gBAC3CpxB,cAAAA;gBACA4c,QAAQoT,GAAmBc;;YAE7B,OAAOO,GAAuBtG,GAAauG,IAAIF;;QAEjD,OAAOjI,GAAmBU;;IAG5B9xB,GACEgzB,GACA/qB;QAEA,MAAMuxB,IAAc,IACdpqB,IAAQqqB,YAAYrL,MACxB,EAACnmB,GAAc,MACf,EAACpH,EAAmBoH,IAAe;wBACpB;wBACA;QAEjB,OAAOqxB,GAAuBtG,GAC3B0G,GAAQtqB,GACRvH,KAAK5E;YACJ,KAAK,MAAM02B,KAAS12B,GAAS;;;;;gBAK3B,IAAI02B,EAAM1xB,iBAAiBA,GACzB;gBAEFuxB,EAAY12B,KAAKw1B,GAAmBqB,EAAM9U;;YAE5C,OAAO2U;;;;;;;;GASf,UAASF,GACPM;IAEA,OAAOC,GAAqBC,GAG1BF,GAAKG,GAAmBC;;;;;;;;;;;;;;;;;;;6DC5DfC;IACXj6B,YAAqBk6B;kBAAAA;;;;8EAIPC,GACdC,GACAC;IAEA,IAAIA,EAAUhjB,UACZ,gBjB2VFqH,GACArH,GACA6S;QAEA,MAAMroB,IAAMwa,GAASqC,GAAYrH,EAAc,OACzC6H,IAAUC,GAAY9H,EAASiJ,aAC/BrR,IAAO,IAAIsR,GAAY;YAAEvI,UAAU;gBAAEC,QAAQZ,EAASY;;;QAC5D,OAAO,IAAI5C,GAASxT,GAAKqd,GAASjQ,GAAM;YACtCib,yBAAyBA;;KiBnWlBoQ,CACLF,EAAgBF,IAChBG,EAAUhjB,YACRgjB,EAAUnQ;IAET,IAAImQ,EAAUE,YAAY;QAC/B,MAAM14B,IAAMiG,EAAY0yB,EAAaH,EAAUE,WAAWxzB,OACpDmY,IAAUub,GAAgBJ,EAAUE,WAAW7Z;QACrD,OAAO,IAAInL,GAAW1T,GAAKqd,GAAS;YAClCgL,yBAAyBmQ,EAAUnQ;;;IAEhC,IAAImQ,EAAUK,iBAAiB;QACpC,MAAM74B,IAAMiG,EAAY0yB,EAAaH,EAAUK,gBAAgB3zB,OACzDmY,IAAUub,GAAgBJ,EAAUK,gBAAgBxb;QAC1D,OAAO,IAAIkL,GAAgBvoB,GAAKqd;;IAEhC,OAtDiBtgB;;;wDA2DL+7B,GACdP,GACAtQ,GACApJ;IAEA,MAAMka,IAAaC,GAAiBna,IAC9BqY,IAAajP,EAASjoB,IAAIkF,KAAKie,IAAUpe;IAC/C,IAAIkjB,aAAoBzU,IAAU;QAChC,MAAM/D,ajB+SRoN,GACArH;YAMA,OAAO;gBACL3S,MAAMib,GAAOjB,GAAYrH,EAASxV;gBAClCoW,QAAQZ,EAASyjB,KAAU9iB,SAASC;gBACpCqI,YAAYzB,GAAYH,GAAYrH,EAAS6H,QAAQL;;SiBzTzCkc,CAAWX,EAAgBF,IAAkBpQ,IACnDI,IAAwBJ,EAASI;QACvC,OAAO,IAAI8Q;+BACc;0BACL,MAClB1pB,GACA4Y,GACA0Q,GACA7B;;IAEG,IAAIjP,aAAoBvU,IAAY;QACzC,MAAMxO,IAAO+iB,EAASjoB,IAAIkF,KAAKH,KACzB8Z,IAAWua,GAAcnR,EAAS5K,UAClCgL,IAAwBJ,EAASI;QACvC,OAAO,IAAI8Q;+BACc,MACvB,IAAIE,GAAan0B,GAAM2Z;wBACP,MAChBwJ,GACA0Q,GACA7B;;IAEG,IAAIjP,aAAoBM,IAAiB;QAC9C,MAAMrjB,IAAO+iB,EAASjoB,IAAIkF,KAAKH,KACzB8Z,IAAWua,GAAcnR,EAAS5K;QACxC,OAAO,IAAI8b,GACT,IAAIG,GAAkBp0B,GAAM2Z;0BACV;wBACF;sCACa,GAC7Bka,GACA7B;;IAGF,OArGiBn6B;;;SAyGLi8B,GACd9uB;IAEA,MAAMtG,IAAYsG,EAAgB8S;IAClC,OAAO,EAACpZ,EAAUb,SAASa,EAAUZ;;;SAGvBu2B,GACdC;IAEA,MAAM51B,IAAY,IAAId,EAAU02B,EAAe,IAAIA,EAAe;IAClE,OAAO71B,EAAgB4Z,EAAc3Z;;;AAGvC,SAASw1B,GAAclvB;IACrB,MAAMtG,IAAYsG,EAAgB8S;IAClC,OAAO,IAAIyc,GAAY71B,EAAUb,SAASa,EAAUZ;;;AAGtD,SAAS41B,GAAgBc;IACvB,MAAM91B,IAAY,IAAId,EAAU42B,EAAY32B,SAAS22B,EAAY12B;IACjE,OAAOW,EAAgB4Z,EAAc3Z;;;;;SAyBvB+1B,GACdpB,GACAqB;IAEA,MAAMrL,KAAiBqL,EAAQrL,iBAAiB,IAAIlyB,IAAIyyB,KACtDlN,GAAa2W,EAAgBF,IAAkBvJ,KAE3CN,IAAYoL,EAAQpL,UAAUnyB,IAAIyyB,KACtClN,GAAa2W,EAAgBF,IAAkBvJ,KAE3ClrB,IAAYd,EAAUG,WAAW22B,EAAQC;IAC/C,OAAO,IAAIxL,GACTuL,EAAQtL,SACR1qB,GACA2qB,GACAC;;;mDAKYsL,GAAaC;IAC3B,MAAM1c,IAAUub,GAAgBmB,EAASlb,WACnC1U,SACsCrJ,MAA1Ci5B,EAAS5vB,+BACLyuB,GAAgBmB,EAAS5vB,gCACzBxG,EAAgBkB;IAEtB,IAAIyC;IAMJ,OAJEA,SAgEoDxG,MAjElCi5B,EAASzpB,MAiEWQ,qBjBohBxCkpB;QA/uBF78B,EAmvBc,MAFE68B,EAAgBlpB,UAAWxS;QAKzC,MAAMuE,IAAOm3B,EAAgBlpB,UAAW;QACxC,OAAOqU,GAAM8U,GAAOhc,GAAcpb,IAAOuiB;KiB5lB9B8U,CAAoBH,EAASzpB,SAE7B8T,GAAgB2V,EAASzpB,QAE7B,IAAIxG,GACTxC,GACAyyB,EAAShwB,2BAETgwB,EAASI,0BACT9c,GACAlT,GACAf,GAAWgS,iBAAiB2e,EAAS3vB;;;wEAKzBgwB,GACd7B,GACA5jB;IASA,MAAM+kB,IAAcN,GAAczkB,EAAWzK,IACvCmwB,IAA2BjB,GAC/BzkB,EAAWxK;IAEb,IAAImwB;IAEFA,IADE1xB,GAAiB+L,EAAWrN,UACjBub,GACX0V,EAAgBF,IAChB1jB,EAAWrN,UAGAwb,GACXyV,EAAgBF,IAChB1jB,EAAWrN;;;QAMf,MAAM8C,IAAcuK,EAAWvK,YAAYmQ;;QAG3C,OAAO,IAAIggB,GACT5lB,EAAW5K,UACX1C,EAAesN,EAAWrN,SAC1BoyB,GACAtvB,GACAuK,EAAW1K,gBACXowB,GACAC;;;;;;;;;;;;;;;;;;;;;;MC3MSE;;;;;IAKXr8B,YACW0e,GACQqV;QADR1yB,kBAAAqd,aACQqV;;;;;;;WASX/zB,GACNgzB,GACAnxB,GACAyP;QAGA,OADsBgrB,GAAqBtJ,GACtBuG,IAAIgD,GAAM16B,IAAMyP;;;;;;;WAS/BtR,GACNgzB,GACAC;QAEA,MAAM+G,IAAQsC,GAAqBtJ,IAC7BnxB,IAAM06B,GAAMtJ;QAClB,OAAO+G,EAAMzoB,OAAO1P;;;;;;;WASd7B,eACNgzB,GACAwJ;QAEA,OAAOn7B,KAAKo7B,YAAYzJ,GAAanrB,KAAK60B,MACxCA,EAASC,YAAYH,GACdn7B,KAAKu7B,GAAY5J,GAAa0J;;IAIzC18B,GACEgzB,GACAC;QAEA,OAAOqJ,GAAqBtJ,GACzBnwB,IAAI05B,GAAMtJ,IACVprB,KAAKg1B,KACGx7B,KAAKy7B,GAAoBD;;;;;;;WAUtC78B,GACEgzB,GACAC;QAEA,OAAOqJ,GAAqBtJ,GACzBnwB,IAAI05B,GAAMtJ,IACVprB,KAAKg1B;YACJ,MAAMvrB,IAAMjQ,KAAKy7B,GAAoBD;YACrC,OAAOvrB,IACH;gBACEyrB,IAAezrB;gBACfjL,MAAM22B;gBAER;;;IAIVh9B,WACEgzB,GACAI;QAEA,IAAIlC,IAAU7gB;QACd,OAAOhP,KAAK47B,GACVjK,GACAI,GACA,CAACvxB,GAAKg7B;YACJ,MAAMvrB,IAAMjQ,KAAKy7B,GAAoBD;YACrC3L,IAAUA,EAAQtkB,GAAO/K,GAAKyP;WAEhCzJ,KAAK,MAAMqpB;;;;;;;;;WAWflxB,GACEgzB,GACAI;QAEA,IAAIlC,IAAU7gB,MACV6sB,IAAU,IAAI1wB,GAA+B1E,EAAYpH;QAC7D,OAAOW,KAAK47B,GACVjK,GACAI,GACA,CAACvxB,GAAKg7B;YACJ,MAAMvrB,IAAMjQ,KAAKy7B,GAAoBD;YACjCvrB,KACF4f,IAAUA,EAAQtkB,GAAO/K,GAAKyP,IAC9B4rB,IAAUA,EAAQtwB,GAAO/K,GAAKm7B,WAE9B9L,IAAUA,EAAQtkB,GAAO/K,GAAK,OAC9Bq7B,IAAUA,EAAQtwB,GAAO/K,GAAK;WAGlCgG,KAAK,OACE;YAAEs1B,IAAgBjM;YAASkM,IAAAF;;;IAI9Bl9B,GACNgzB,GACAI,GACA/B;QAEA,IAAI+B,EAAahxB,KACf,OAAOgvB,GAAmBU;QAG5B,MAAM1iB,IAAQqqB,YAAYrL,MACxBgF,EAAa7W,QAASxV,KAAKH,KAC3BwsB,EAAaiK,OAAQt2B,KAAKH,MAEtB02B,IAAUlK,EAAa1jB;QAC7B,IAAI6tB,IAA8BD,EAAQ9tB;QAE1C,OAAO8sB,GAAqBtJ,GACzBwK,GAAQ;YAAEpuB,OAAAA;WAAS,CAACquB,GAAiBZ,GAAaa;YACjD,MAAMC,IAAe71B,EAAY0yB,EAAaiD;;wBAG9C,MAAOF,KAAWz1B,EAAYpH,KAAqBi9B,KAAgB,KACjEtM,KAAmB,OACnBkM,IAAUD,EAAQ9tB;YAGhB+tB,KAAWA,EAAS53B,QAAQg4B;;YAE9BtM,KAAmBwL,IACnBU,IAAUD,EAAQ/tB,OAAY+tB,EAAQ9tB,OAAY;;YAIhD+tB,IACFG,EAAQE,GAAKL,EAASx2B,KAAKH,OAE3B82B,EAAQtL;WAGXvqB,KAAK;;;YAGJ,MAAO01B,KACLlM,KAAmB,OACnBkM,IAAUD,EAAQ/tB,OAAY+tB,EAAQ9tB,OAAY;;;IAK1DxP,GACEgzB,GACA7gB,GACAwiB;QAMA,IAAIzD,IAAU3gB;QAEd,MAAMstB,IAA8B1rB,EAAMpL,KAAK5G,SAAS,GAElD29B,IAAmC;QACzC,IAAInJ,EAAchvB,QAAQH,EAAgBkB,QAAQ;;;YAGhD,MAAMgH,IAAWyE,EAAMpL,KAAKH;YAC5Bk3B,EAAiB1uB,QAAQqqB,YAAYsE,WAAWrwB;eAC3C;;;;YAIL,MAAMswB,IAAgB7rB,EAAMpL,KAAKH,KAC3Bq3B,IAAcpD,GAAiBlG;YACrCmJ,EAAiB1uB,QAAQqqB,YAAYsE,WACnC,EAACC,GAAeC;yBACJ,IAEdH,EAAiBl9B,QAAQo6B,GAAiBkD;;QAG5C,OAAO5B,GAAqBtJ,GACzBwK,GAAQM,GAAkB,CAACj8B,GAAKg7B,GAAaa;;;;;;YAM5C,IAAI77B,EAAI1B,WAAW09B,GACjB;YAGF,MAAM/T,IAAWqQ,GAAqB94B,KAAKqd,YAAYme;YAClD1qB,EAAMpL,KAAKwiB,EAAWO,EAASjoB,IAAIkF,QAGtC+iB,aAAoBzU,MACpBqZ,GAAavc,GAAO2X,OAEpBoH,IAAUA,EAAQtkB,GAAOkd,EAASjoB,KAAKioB,MALvC4T,EAAQtL;WAQXvqB,KAAK,MAAMqpB;;;;;;;IAQhBlxB,GACEgzB,GACA2B;QAKA,IAAIwJ,IAAc/tB,MAEdguB,IAAevD,GAAiBlG;QAEpC,MAAM0J,IAAiB/B,GAAqBtJ,IACtC5jB,IAAQqqB,YAAYsE,WAAWK,IAAc;QACnD,OAAOC,EACJb,GACC;YAAE58B,OAAOo6B,GAAiBsD;YAAelvB,OAAAA;WACzC,CAACpM,GAAG65B;;;YAGF,MAAMvrB,IAAM6oB,GAAqB94B,KAAKqd,YAAYme;YAClDsB,IAAcA,EAAYvxB,GAAO0E,EAAIzP,KAAKyP,IAC1C8sB,IAAevB,EAAqB;WAGvCh1B,KAAK,OACG;YACL02B,IAAAJ;YACAzd,UAAU0a,GAAmBgD;;;;;;;;IAUrCp+B,GACEgzB;QAEA,MAAMqL,IAAiB/B,GAAqBtJ;;gBAG5C,IAAItS,IAAWlb,EAAgBkB;QAE/B,OAAO23B,EACJb,GACC;YAAE58B,OAAOo6B,GAAiBsD;YAAeE,UAAS;WAClD,CAAC38B,GAAKg7B,GAAaa;YACbb,EAAYnc,aACdA,IAAW0a,GAAmByB,EAAYnc,YAE5Cgd,EAAQtL;WAGXvqB,KAAK,MAAM6Y;;IAGhB1gB,GAAgBotB;QAGd,OAAO,IAAIiP,GAA6BzJ,GACtCvxB,QACE+rB,KAAWA,EAAQqR;;IAIzBz+B,GAAQ45B;QACN,OAAOv4B,KAAKo7B,YAAY7C,GAAK/xB,KAAK60B,KAAYA,EAASC;;IAGjD38B,YACN45B;QAEA,OAAO8E,GAAoB9E,GACxB/2B,IAAI87B,GAAuB98B,KAC3BgG,KAAK60B,MA9UC19B,IA+UQ09B,IACNA;;IAIL18B,GACN45B,GACA8C;QAEA,OAAOgC,GAAoB9E,GAAKL,IAAIoF,GAAuB98B,KAAK66B;;;;;WAO1D18B,GACN68B;QAEA,IAAIA,GAAa;YACf,MAAMvrB,IAAM6oB,GAAqB94B,KAAKqd,YAAYme;YAClD,OACEvrB,aAAeiE,MACfjE,EAAI4N,QAAQvZ,QAAQH,EAAgBkB,SAI7B,OAGF4K;;QAET,OAAO;;;;;;;;;;GAuIX,UAASotB,GACP9E;IAEA,OAAOC,GAAqBC,GAG1BF,GAAK+E,GAAuB3E;;;;;GAMhC,UAASsC,GACP1C;IAEA,OAAOC,GAAqBC,GAC1BF,GACAoB,GAAiBhB;;;AAIrB,SAASuC,GAAMjM;IACb,OAAOA,EAAOvpB,KAAKH;;;;;aAMLo2B,GAAe1rB;IAC7B,IAAI9S;IACJ,IAAI8S,EAAI+F,UACN7Y,IAAQ8S,EAAI+F,eACP,IAAI/F,EAAIopB,iBACbl8B,IAAQ8S,EAAIopB,sBACP;QAAA,KAAIppB,EAAIipB,YAGb,MA/iBkD37B;QA6iBlDJ,IAAQ8S,EAAIipB;;IAId,OAAO97B,KAAKC,UAAUF,GAAO2B;;;;;;;;;;;;;;;;;;;mDApK7Bk8B,SAA4C,cAAczJ;;;;;;IAYxD5yB,YACmB4+B,GACAH;QAEjBj6B,mBAHiBo6B,aACAH;;QAZnBp9B,UAA0D,IAAIgB,EAC5DR,KAAOA,EAAI4C,YACX,CAAC+kB,GAAGC,MAAMD,EAAE7jB,QAAQ8jB;;IAeZzpB,GACRgzB;QAEA,MAAMN,IAA4C;QAElD,IAAI8J,IAAY,GAEZqC,IAAoB,IAAI7vB,GAAwB,CAACwa,GAAGC,MACtDnpB,EAAoBkpB,EAAE1iB,KAAmB2iB,EAAE3iB;QAwD7C,OArDAzF,KAAK4Q,GAAQ/P,QAAQ,CAACL,GAAKixB;YACzB,MAAMgM,IAAez9B,KAAK09B,GAAcl8B,IAAIhB;YAK5C,IAAIixB,GAAe;gBAKjB,MAAMxhB,IAAMqpB,GACVt5B,KAAKu9B,GAAclgB,YACnBoU,GACAzxB,KAAKqf;gBAEPme,IAAoBA,EAAkBhvB,IAAIhO,EAAIkF,KAAKie;gBAEnD,MAAM3e,IAAO22B,GAAe1rB;gBAC5BkrB,KAAan2B,OACbqsB,EAAS5vB,KAAKzB,KAAKu9B,GAAcI,GAAShM,GAAanxB,GAAKyP;mBAG5D,IADAkrB,QACIn7B,KAAKo9B,IAAe;;;;;gBAKtB,MAAMQ,IAAatE,GACjBt5B,KAAKu9B,GAAclgB,YACnB,IAAInJ,GAAW1T,GAAK2D,EAAgBkB,QACpCrF,KAAKqf;gBAEPgS,EAAS5vB,KACPzB,KAAKu9B,GAAcI,GAAShM,GAAanxB,GAAKo9B;mBAGhDvM,EAAS5vB,KAAKzB,KAAKu9B,GAAcM,GAAYlM,GAAanxB;YAKhEg9B,EAAkB38B,QAAQ2iB;YACxB6N,EAAS5vB,KACPzB,KAAKu9B,GAAc7K,GAAaoL,GAC9BnM,GACAnO;YAKN6N,EAAS5vB,KAAKzB,KAAKu9B,GAAcQ,eAAepM,GAAawJ,KAEtDpL,GAAmBuB,GAAQD;;IAG1B1yB,GACRgzB,GACAC;;QAGA,OAAO5xB,KAAKu9B,GACTS,GAAcrM,GAAaC,GAC3BprB,KAAKy3B,KACc,SAAdA,KACFj+B,KAAK09B,GAAcnuB,IAAIqiB,GAAa,IAC7B,SAEP5xB,KAAK09B,GAAcnuB,IAAIqiB,GAAaqM,EAAUj5B;QACvCi5B,EAAUxM;;IAKf9yB,GACRgzB,GACAI;;;QAIA,OAAO/xB,KAAKu9B,GACTW,GAAgBvM,GAAaI,GAC7BvrB,KAAK,EAAGs1B,IAAAqC,GAAgBpC,IAAAF;;;;QAIvBA,EAAQh7B,QAAQ,CAAC+wB,GAAa5sB;YAC5BhF,KAAK09B,GAAcnuB,IAAIqiB,GAAa5sB;YAE/Bm5B;;;;;;;;;;;;;;;;;;MC7fJC;IACXz/B,YAAoB0/B;kBAAAA;;IAEpB1/B;QAEE,OADAqB,KAAKq+B,MApBM,GAqBJr+B,KAAKq+B;;IAGd1/B;;;;;QAKE,OAAO,IAAIy/B,GAAkB;;IAG/Bz/B;;QAEE,OAAO,IAAIy/B,IAAkB;;;;;;;;;;;;;;;;;;;UCJpBE;IACX3/B,YACmB4/B,GACTlhB;kBADSkhB,GACTv+B,kBAAAqd;;;;;;;;IAUV1e,GACEgzB;QAEA,OAAO3xB,KAAKw+B,GAAiB7M,GAAanrB,KAAK60B;YAC7C,MAAMoD,IAAoB,IAAIL,GAAkB/C,EAASqD;YAEzD,OADArD,EAASqD,kBAAkBD,EAAkBj4B,QACtCxG,KAAK2+B,GAAahN,GAAa0J,GAAU70B,KAC9C,MAAM60B,EAASqD;;;IAKrB//B,GACEgzB;QAEA,OAAO3xB,KAAKw+B,GAAiB7M,GAAanrB,KAAK60B,KACtCl3B,EAAgB4Z,EACrB,IAAIza,EACF+3B,EAASuD,0BAA0Br7B,SACnC83B,EAASuD,0BAA0Bp7B;;IAM3C7E,GACEgzB;QAEA,OAAO3xB,KAAKw+B,GAAiB7M,GAAanrB,KACxCq4B,KAAgBA,EAAaC;;IAIjCngC,GACEgzB,GACAmN,GACAF;QAEA,OAAO5+B,KAAKw+B,GAAiB7M,GAAanrB,KAAK60B,MAC7CA,EAASyD,8BAA8BA,GACnCF,MACFvD,EAASuD,4BAA4BA,EAA0BphB;QAE7DshB,IAA8BzD,EAASyD,gCACzCzD,EAASyD,8BAA8BA,IAElC9+B,KAAK2+B,GAAahN,GAAa0J;;IAI1C18B,GACEgzB,GACAxc;QAEA,OAAOnV,KAAK++B,GAAepN,GAAaxc,GAAY3O,KAAK,MAChDxG,KAAKw+B,GAAiB7M,GAAanrB,KAAK60B,MAC7CA,EAAS2D,eAAe,GACxBh/B,KAAKi/B,GAA6B9pB,GAAYkmB;QACvCr7B,KAAK2+B,GAAahN,GAAa0J;;IAK5C18B,GACEgzB,GACAxc;QAEA,OAAOnV,KAAK++B,GAAepN,GAAaxc;;IAG1CxW,GACEgzB,GACAxc;QAEA,OAAOnV,KAAKk/B,GAA8BvN,GAAaxc,EAAW5K,UAC/D/D,KAAK,MAAM24B,GAAaxN,GAAazhB,OAAOiF,EAAW5K,WACvD/D,KAAK,MAAMxG,KAAKw+B,GAAiB7M,IACjCnrB,KAAK60B,MACJ19B,EACE09B,EAAS2D,cAAc;QAGzB3D,EAAS2D,eAAe,GACjBh/B,KAAK2+B,GAAahN,GAAa0J;;;;;;WAS5C18B,GACE45B,GACA6G,GACAC;QAEA,IAAI9+B,IAAQ;QACZ,MAAM8wB,IAA4C;QAClD,OAAO8N,GAAa5G,GACjB4D,GAAQ,CAAC37B,GAAKrD;YACb,MAAMgY,IAAamlB,GAAan9B;YAE9BgY,EAAW1K,kBAAkB20B,KACgB,SAA7CC,EAAgB79B,IAAI2T,EAAW5K,cAE/BhK,KACA8wB,EAAS5vB,KAAKzB,KAAKs/B,GAAiB/G,GAAKpjB;WAG5C3O,KAAK,MAAMupB,GAAmBuB,GAAQD,IACtC7qB,KAAK,MAAMjG;;;;WAMhB5B,GACE45B,GACArwB;QAEA,OAAOi3B,GAAa5G,GAAK4D,GAAQ,CAAC37B,GAAKrD;YACrC,MAAMgY,IAAamlB,GAAan9B;YAChC+K,EAAEiN;;;IAIExW,GACNgzB;QAEA,OAAO4N,GAAkB5N,GACtBnwB,IAAIg+B,GAAeh/B,KACnBgG,KAAK60B,MAtJF19B,EAuJsB,SAAb09B,IACJA;;IAIL18B,GACNgzB,GACA0J;QAEA,OAAOkE,GAAkB5N,GAAauG,IAAIsH,GAAeh/B,KAAK66B;;IAGxD18B,GACNgzB,GACAxc;QAEA,OAAOgqB,GAAaxN,GAAauG,IAC/B0C,GAAW56B,KAAKqd,YAAYlI;;;;;;WASxBxW,GACNwW,GACAkmB;QAEA,IAAIoE,KAAU;QAUd,OATItqB,EAAW5K,WAAW8wB,EAASqD,oBACjCrD,EAASqD,kBAAkBvpB,EAAW5K,UACtCk1B,KAAU;QAGRtqB,EAAW1K,iBAAiB4wB,EAASyD,gCACvCzD,EAASyD,8BAA8B3pB,EAAW1K;QAClDg1B,KAAU,IAELA;;IAGT9gC,GACEgzB;QAEA,OAAO3xB,KAAKw+B,GAAiB7M,GAAanrB,KACxC60B,KAAYA,EAAS2D;;IAIzBrgC,GACEgzB,GACA7pB;;;;QAKA,MAAMG,IAAcJ,EAAeC,IAC7BiG,IAAQqqB,YAAYrL,MACxB,EAAC9kB,GAAaf,OAAOw4B,qBACrB,EAACz3B,GAAaf,OAAOy4B;QAEvB,IAAIlzB,IAA4B;QAChC,OAAO0yB,GAAaxN,GACjBwK,GACC;YAAEpuB,OAAAA;YAAOxO,OAAOw7B,GAAS6E;WACzB,CAACp/B,GAAKrD,GAAOk/B;YACX,MAAMrd,IAAQsb,GAAan9B;;;wBAGvB0L,EAAaf,GAAQkX,EAAMlX,YAC7B2E,IAASuS,GACTqd,EAAQtL;WAIbvqB,KAAK,MAAMiG;;IAGhB9N,GACE45B,GACAjpB,GACA/E;;;QAIA,MAAM8mB,IAA4C,IAC5CsH,IAAQkH,GAAoBtH;QAMlC,OALAjpB,EAAKzO,QAAQL;YACX,MAAMkF,IAAOkxB,GAAmBp2B,EAAIkF;YACpC2rB,EAAS5vB,KAAKk3B,EAAMT,IAAI,IAAI4H,GAAiBv1B,GAAU7E,MACvD2rB,EAAS5vB,KAAKzB,KAAKu+B,GAAkBwB,GAAaxH,GAAKhuB,GAAU/J;YAE5DuvB,GAAmBuB,GAAQD;;IAGpC1yB,GACE45B,GACAjpB,GACA/E;;;QAIA,MAAMouB,IAAQkH,GAAoBtH;QAClC,OAAOxI,GAAmBlvB,QAAQyO,GAAO9O;YACvC,MAAMkF,IAAOkxB,GAAmBp2B,EAAIkF;YACpC,OAAOqqB,GAAmBuB,GAAQ,EAChCqH,EAAMzoB,OAAO,EAAC3F,GAAU7E,MACxB1F,KAAKu+B,GAAkByB,GAAgBzH,GAAKhuB,GAAU/J;;;IAK5D7B,GACE45B,GACAhuB;QAEA,MAAMouB,IAAQkH,GAAoBtH,IAC5BxqB,IAAQqqB,YAAYrL,MACxB,EAACxiB,KACD,EAACA,IAAW;wBACG;wBACA;QAEjB,OAAOouB,EAAMzoB,OAAOnC;;IAGtBpP,GACE45B,GACAhuB;QAEA,MAAMwD,IAAQqqB,YAAYrL,MACxB,EAACxiB,KACD,EAACA,IAAW;wBACG;wBACA,IAEXouB,IAAQkH,GAAoBtH;QAClC,IAAI9rB,IAAS4C;QAEb,OAAOspB,EACJwD,GAAQ;YAAEpuB,OAAAA;YAAOkyB,KAAU;WAAQ,CAACz/B,GAAKmB,GAAG06B;YAC3C,MAAM32B,IAAOuxB,GAAmBz2B,EAAI,KAC9ByuB,IAAS,IAAIxoB,EAAYf;YAC/B+G,IAASA,EAAO+B,IAAIygB;WAErBzoB,KAAK,MAAMiG;;IAGhB9N,GACE45B,GACA/3B;QAEA,MAAMkF,IAAOkxB,GAAmBp2B,EAAIkF,OAC9BqI,IAAQqqB,YAAYrL,MACxB,EAACrnB,KACD,EAAClG,EAAmBkG;wBACL;wBACA;QAEjB,IAAInF,IAAQ;QACZ,OAAOs/B,MACJ1D,GACC;YACE58B,OAAOugC,GAAiBI;YACxBD,KAAU;YACVlyB,OAAAA;WAEF,EAAExD,GAAU7E,IAAO/D,GAAG06B;;;;YAIH,MAAb9xB,MACFhK,KACA87B,EAAQtL;WAIbvqB,KAAK,MAAMjG,IAAQ;;;;;;;;;;IAWxB5B,GACEgzB,GACApnB;QAEA,OAAO40B,GAAaxN,GACjBnwB,IAAI+I,GACJ/D,KAAKwY,KACAA,IACKsb,GAAatb,KAEb;;;;;;GASjB,UAASmgB,GACP5G;IAEA,OAAOC,GAAqBC,GAC1BF,GACAwC,GAASpC;;;;;GAOb,UAAS4G,GACPhH;IAEA,OAAOC,GAAqBC,GAC1BF,GACAiH,GAAe7G;;;;;aAOHkH,GACdtH;IAEA,OAAOC,GAAqBC,GAC1BF,GACAuH,GAAiBnH;;;;;;;;;;;;;;;;;;GCpWrB,OAyBMwH,KACJ;;;;;UAoBWC,WAA6BhO;IACxCzzB,YACW0hC,GACAC;QAETn9B,mBAHSk9B,aACAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;UAoDA9H;IAkDX75B;;;;;IAKmB4hC,GAEA3gC,GACA4gC,GACjBC,GACiB7K,GACA8K,GACA1qB,GACjBqH,GACiB4X;;;;;IAMA0L;QAEjB,IAjBiB3gC,+BAAAugC,GAEAvgC,sBAAAJ,GACAI,gBAAAwgC;kBAEA5K,GACA51B,cAAA0gC,GACA1gC,gBAAAgW,aAEAif,aAMA0L,GAnDnB3gC,UAAgD;QAEhDA,WAAmB,GACXA,kBAAY,GACZA,uBAAiB;;QAIzBA,UAAmD,MAC3CA,qBAAe;;QAKvBA,UAAkE;;QAGlEA,UAAiE;;QAGjEA,UAAoCkH,OAAOw4B;;QAG3C1/B,UAAqD2B,KAAKgvB,QAAQF,YA8B3D+H,GAAqBoI,MACxB,MAAM,IAAI39B,EACRlB,EAAKc,eA/IX;QAoJE7C,KAAKu+B,KAAoB,IAAIsC,GAAqB7gC,MAAMygC,IACxDzgC,KAAK8gC,KAASlhC,IAzIW,QA0IzBI,KAAKqd,aAAa,IAAIub,GAAgBvb,IACtCrd,KAAK+gC,KAAc,IAAIzC,GACrBt+B,KAAKu+B,IACLv+B,KAAKqd;QAEPrd,KAAK0yB,KAAe,IAAImF,IACxB73B,KAAKwyB,KAAsB,IAAIwI,GAC7Bh7B,KAAKqd,YACLrd,KAAK0yB,KAEH1yB,KAAK0gC,UAAU1gC,KAAK0gC,OAAOM,eAC7BhhC,KAAKihC,KAAajhC,KAAK0gC,OAAOM,gBAE9BhhC,KAAKihC,KAAa;SACK,MAAnBN,KACF3jC,EArMQ,wBAuMN;;IAjGR2B,UACE45B,GACAI;QAEA,IAAIJ,aAAe6H,IACjB,OAAOc,GAASzI,GAAqBF,EAAI8H,IAAqB1H;QAE9D,MArK0Cp7B;;;;;;WA4Q9CoB;QAIE,OAAOuiC,GAASC,GACdnhC,KAAK8gC,IACLM,IACA,IAAIC,GAAgBrhC,KAAKqd,aAExBikB,KAAKC,MACJvhC,KAAKwhC,KAAWD,GAGTvhC,KAAKyhC,OAEbH,KAAK;YACJ,KAAKthC,KAAK0hC,cAAc1hC,KAAKugC;;;YAG3B,MAAM,IAAIt9B,EACRlB,EAAKW,qBACLy9B;YAQJ,OALAngC,KAAK2hC,MACL3hC,KAAK4hC,MAEL5hC,KAAK6hC,MAEE7hC,KAAK8hC,eACV,kCACA,YACAvJ,KAAOv4B,KAAK+gC,GAAYgB,GAAyBxJ;WAGpD+I,KAAKxC;YACJ9+B,KAAKgiC,KAAiB,IAAIhN,GACxB8J,GACA9+B,KAAKi1B;WAGRqM,KAAK;YACJthC,KAAKiiC,MAAW;WAEjBC,MAAMC,MACLniC,KAAKwhC,MAAYxhC,KAAKwhC,GAASY,SACxBzR,QAAQD,OAAOyR;;;;;;;;WAW5BxjC,GACE0jC;QAOA,OALAriC,KAAKqiC,KAAuBC,MAAMC;YAChC,IAAIviC,KAAKwiC,IACP,OAAOH,EAAqBE;WAGzBF,EAAqBriC,KAAK0hC;;;;;;;WASnC/iC,GACE8jC;QAEAziC,KAAKwhC,GAASkB,GAAyBJ,MAAMK;;YAElB,SAArBA,EAAMC,oBACFH;;;;;;;;WAWZ9jC,GAAkBkkC;QACZ7iC,KAAK6iC,mBAAmBA,MAC1B7iC,KAAK6iC,iBAAiBA;;;QAGtB7iC,KAAK41B,GAAMkN,GAAiBR;YACtBtiC,KAAKwiC,YACDxiC,KAAKyhC;;;;;;;;WAYX9iC;QACN,OAAOqB,KAAK8hC,eACV,2CACA,aACAvJ,KACwBwK,GAAoBxK,GAEvCL,IACC,IAAI8K,GACFhjC,KAAKwgC,UACL98B,KAAKC,OACL3D,KAAK6iC,gBACL7iC,KAAKijC,eAGRz8B,KAAK;YACJ,IAAIxG,KAAK0hC,WACP,OAAO1hC,KAAKkjC,GAAmB3K,GAAK/xB,KAAK28B;gBAClCA,MACHnjC,KAAK0hC,aAAY,GACjB1hC,KAAK41B,GAAMwN,GAAiB,MAC1BpjC,KAAKqiC,IAAqB;;WAMnC77B,KAAK,MAAMxG,KAAKqjC,GAAgB9K,IAChC/xB,KAAK68B,KACArjC,KAAK0hC,cAAc2B,IACdrjC,KAAKsjC,GAA0B/K,GAAK/xB,KAAK,OAAM,OAC7C68B,KACFrjC,KAAKujC,GAA4BhL,GAAK/xB,KAAK,OAAM,KAO/D07B,MAAM5kC;YACL,IAAIkmC,GAA4BlmC;;;YAI9B,OAHAf,EA3WM,wBA2WY,kCAAkCe,IAG7C0C,KAAK0hC;YAGd,KAAK1hC,KAAKugC,yBACR,MAAMjjC;YAQR,OALAf,EArXQ,wBAuXN,0DACAe;8BAEsB;WAEzBgkC,KAAKI;YACA1hC,KAAK0hC,cAAcA,KACrB1hC,KAAK41B,GAAMwN,GAAiB,MAC1BpjC,KAAKqiC,GAAqBX,KAG9B1hC,KAAK0hC,YAAYA;;;IAIf/iC,GACN45B;QAGA,OADckL,GAAmBlL,GACpB/2B,IAAIkiC,GAAgBljC,KAAKgG,KAAKm9B,KAClC5T,GAAmBU,QAAQzwB,KAAK4jC,GAAcD;;IAIjDhlC,GACN45B;QAGA,OADsBwK,GAAoBxK,GACrBroB,OAAOlQ,KAAKwgC;;;;;;WAQ3B7hC;QACN,IACEqB,KAAK0hC,cACJ1hC,KAAK6jC,GAAY7jC,KAAK8jC,IAxZH,OAyZpB;YACA9jC,KAAK8jC,KAA4BpgC,KAAKC;YAEtC,MAAMogC,UAAwB/jC,KAAK8hC,eACjC,uCACA,qBACAvJ;gBACE,MAAMyL,IAAgBxL,GAAqBC,GAGzCF,GAAKyK,GAAiBrK;gBAExB,OAAOqL,EAAc3L,KAAU7xB,KAAKy9B;oBAClC,MAAMC,IAASlkC,KAAKmkC,GAClBF,GAvaY,OA0aRG,IAAWH,EAAgBp+B,OAC/Bw+B,MAAsC,MAA5BH,EAAOv+B,QAAQ0+B;;oBAI3B,OAAOtU,GAAmBlvB,QACxBujC,GACCE,KACCN,EAAc9zB,OAAOo0B,EAAe9D,WACtCh6B,KAAK,MAAM49B;;eAGjBlC,MAAM,MAKC;;;;;;wBAQT,IAAIliC,KAAKihC,IACP,KAAK,MAAMqD,KAAkBP,GAC3B/jC,KAAKihC,GAAWsD,WACdvkC,KAAKwkC,GAA6BF,EAAe9D;;;;;;WAWnD7hC;QACNqB,KAAKykC,KAA0BzkC,KAAK41B,GAAMc,2DAjcF,KAoctC,MACS12B,KAAKyhC,KACTH,KAAK,MAAMthC,KAAK0kC,MAChBpD,KAAK,MAAMthC,KAAK6hC;;2DAMjBljC,GAAc0lC;QACpB,SAAOA,KAASA,EAAOM,YAAY3kC,KAAKwgC;;;;;;;;WAUlC7hC,GACN45B;QAEA,IAAIv4B,KAAK2gC,IACP,OAAO5Q,GAAmBU,SAAiB;QAG7C,OADcgT,GAAmBlL,GAE9B/2B,IAAIkiC,GAAgBljC,KACpBgG,KAAKo+B;;;;;;;;;;YAkBJ,IAhBqB,SAAnBA,KACA5kC,KAAK6jC,GACHe,EAAeC,kBA/eS,SAkfzB7kC,KAAK8kC,GAAgBF,EAAeD,UAWd;gBACvB,IAAI3kC,KAAK4jC,GAAcgB,MAAmB5kC,KAAK6iC,gBAC7C,QAAO;gBAGT,KAAK7iC,KAAK4jC,GAAcgB,IAAiB;oBACvC,KAAKA,EAAgBrE;;;;;;;;;;;;oBAanB,MAAM,IAAIt9B,EACRlB,EAAKW,qBACLy9B;oBAIJ,QAAO;;;YAIX,UAAIngC,KAAK6iC,mBAAkB7iC,KAAKijC,iBAIzBF,GAAoBxK,GACxBF,KACA7xB,KAAKy9B,UAwB0B3iC,MArBHtB,KAAKmkC,GAC9BF,GApiBsB,KAsiBtBjrB,KAAK+rB;gBACL,IAAI/kC,KAAKwgC,aAAauE,EAAYvE,UAAU;oBAC1C,MAAMwE,KACHhlC,KAAK6iC,kBAAkBkC,EAAYlC,gBAChCoC,KACHjlC,KAAKijC,gBAAgB8B,EAAY9B,cAC9BiC,IACJllC,KAAK6iC,mBAAmBkC,EAAYlC;oBACtC,IACEmC,KACCC,KACCC,GAEF,QAAO;;gBAGX,QAAO;;WAKd1+B,KAAK68B,MACArjC,KAAK0hC,cAAc2B,KACrB9mC,EA1kBM,wBA4kBJ,UACE8mC,IAAkB,OAAO;QAIxBA;;IAIb1kC;;;QAGEqB,KAAKiiC,MAAW,GAEhBjiC,KAAKmlC,MACDnlC,KAAKykC,OACPzkC,KAAKykC,GAAwBtO,UAC7Bn2B,KAAKykC,KAA0B,OAEjCzkC,KAAKolC;QACLplC,KAAKqlC,YACCrlC,KAAK8hC,eAAe,YAAY,aAAavJ,KAC1Cv4B,KAAKsjC,GAA0B/K,GAAK/xB,KAAK,MAC9CxG,KAAKslC,GAAqB/M,KAE3B2J,MAAM5kC;YACPf,EAtmBU,wBAsmBQ,8CAA8Ce;YAElE0C,KAAKwhC,GAASY;;;QAIdpiC,KAAKulC;;;;;WAOC5mC,GACN6mC,GACAC;QAEA,OAAOD,EAAQ3/B,OACbw+B,KACErkC,KAAK6jC,GAAYQ,EAAOqB,cAAcD,OACrCzlC,KAAK8kC,GAAgBT,EAAO7D;;;;;;;;WAWnC7hC;QACE,OAAOqB,KAAK8hC,eAAe,oBAAoB,YAAYvJ,KAClDwK,GAAoBxK,GACxBF,KACA7xB,KAAKg/B,KACJxlC,KAAKmkC,GAAoBqB,GApoBT,MAooBqC3oC,IACnD8oC,KAAkBA,EAAenF;;IAM3CoF;QACE,OAAO5lC,KAAKiiC;;IAGdtjC,GAAiBknC;QAKf,OAAOC,GAAuBC,GAC5BF,GACA7lC,KAAKqd,YACLrd,KAAK0yB,IACL1yB,KAAKu+B;;IAIT5/B;QAKE,OAAOqB,KAAK+gC;;IAGdpiC;QAKE,OAAOqB,KAAKwyB;;IAGd7zB;QAKE,OAAOqB,KAAK0yB;;IAGd/zB,eACEqN,GACAg6B,GACAC;QAIA1pC,EAjsBY,wBAisBM,yBAAyByP;QAE3C,MAAMk6B,IAAwB,eAATF,IAAsB,aAAa;QAExD,IAAIG;;;gBAIJ,OAAOnmC,KAAKwhC,GACTM,eAAeoE,GAAcE,IAAYC,MACxCF,IAAyB,IAAI/F,GAC3BiG,GACArmC,KAAKgiC,KACDhiC,KAAKgiC,GAAex7B,SACpBwuB,GAAesR;QAGR,wBAATN,IAMKhmC,KAAKkjC,GAAmBiD,GAC5B3/B,KAAK+/B,OACAA,KAGGvmC,KAAKqjC,GAAgB8C,IAE7B3/B,KAAK+/B;YACJ,KAAKA,GAQH,MAPAvpC,EACE,8CAA8CgP,QAEhDhM,KAAK0hC,aAAY;YACjB1hC,KAAK41B,GAAMwN,GAAiB,MAC1BpjC,KAAKqiC,IAAqB,KAEtB,IAAIp/B,EACRlB,EAAKW,qBACLyvB;YAGJ,OAAO8T,EAAqBE;WAE7B3/B,KAAKiG,KACGzM,KAAKujC,GACV4C,GACA3/B,KAAK,MAAMiG,MAGVzM,KAAKwmC,GACVL,GACA3/B,KAAK,MAAMy/B,EAAqBE,MAGrC7E,KAAK70B,MACJ05B,EAAuBM;QAChBh6B;;;;;;;;IAUL9N,GACN45B;QAGA,OADckL,GAAmBlL,GACpB/2B,IAAIkiC,GAAgBljC,KAAKgG,KAAKo+B;YASzC,IAPqB,SAAnBA,KACA5kC,KAAK6jC,GACHe,EAAeC,kBAjwBW,SAowB3B7kC,KAAK8kC,GAAgBF,EAAeD,aAEX3kC,KAAK4jC,GAAcgB,QAE1C5kC,KAAK2gC,MACJ3gC,KAAKugC,2BACJqE,EAAgBrE,0BAEnB,MAAM,IAAIt9B,EACRlB,EAAKW,qBACLy9B;;;;;;WAWFxhC,GACN45B;QAEA,MAAMmO,IAAa,IAAIhD,GACrB1jC,KAAKwgC,UACLxgC,KAAKugC,yBACL78B,KAAKC;QAEP,OAAO8/B,GAAmBlL,GAAKL,IAAIwL,GAAgBljC,KAAKkmC;;IAG1D/nC;QACE,OAAOuiC,GAASN;;qFAIVjiC,GACN45B;QAEA,MAAMI,IAAQ8K,GAAmBlL;QACjC,OAAOI,EAAMn3B,IAAIkiC,GAAgBljC,KAAKgG,KAAKm9B,KACrC3jC,KAAK4jC,GAAcD,MACrBpnC,EA5zBQ,wBA4zBU;QACXo8B,EAAMzoB,OAAOwzB,GAAgBljC,QAE7BuvB,GAAmBU;;iEAMxB9xB,GAAY+mC,GAAsBiB;QACxC,MAAMhjC,IAAMD,KAAKC;QAGjB,SAAI+hC,IAFkB/hC,IAAMgjC,SAIjBjB,IAHW/hC,OAIpB3G,EACE,kDAAkD0oC,OALhC/hC;SAOb;;IAMHhF;QAEc,SAAlBqB,KAAKgW,YACqC,qBAAnChW,KAAKgW,SAAS4wB,qBAErB5mC,KAAK6mC,KAA4B;YAC/B7mC,KAAK41B,GAAMkN,GAAiB,OAC1B9iC,KAAKijC,eAAkD,cAAnCjjC,KAAKgW,SAAU8wB;YAC5B9mC,KAAKyhC;WAIhBzhC,KAAKgW,SAAS4wB,iBACZ,oBACA5mC,KAAK6mC,KAGP7mC,KAAKijC,eAAiD,cAAlCjjC,KAAKgW,SAAS8wB;;IAI9BnoC;QACFqB,KAAK6mC,OAMP7mC,KAAKgW,SAAS+wB,oBACZ,oBACA/mC,KAAK6mC,KAEP7mC,KAAK6mC,KAA4B;;;;;;;;;;;WAc7BloC;;QACuC,oCAAlCqB,KAAK0gC,qCAAQkG,sBACtB5mC,KAAKgnC,KAAsB;;;;YAIzBhnC,KAAKmlC,MAELnlC,KAAK41B,GAAMkN,GAAiB,MAGnB9iC,KAAKinC;WAGhBjnC,KAAK0gC,OAAOkG,iBAAiB,UAAU5mC,KAAKgnC;;IAIxCroC;QACFqB,KAAKgnC,OAKPhnC,KAAK0gC,OAAQqG,oBAAoB,UAAU/mC,KAAKgnC,KAChDhnC,KAAKgnC,KAAsB;;;;;;WASvBroC,GAAgB6hC;;QACtB;YACE,MAAM0G,IAGE,wBAFNlnC,KAAKihC,iCAAYkG,QACfnnC,KAAKwkC,GAA6BhE;YAQtC,OANAjkC,EA36BU,wBA66BR,WAAWikC,MACT0G,IAAY,OAAO;YAGhBA;UACP,OAAO5pC;;YAGP,OADAN,EAp7BU,wBAo7BQ,oCAAoCM,KAC/C;;;;;;WAQHqB;QACN,IAAKqB,KAAKihC,IAGV;YACEjhC,KAAKihC,GAAWmG,QACdpnC,KAAKwkC,GAA6BxkC,KAAKwgC,WACvCv8B,OAAOP,KAAKC;UAEd,OAAOrG;;YAEPN,EAAS,mCAAmCM;;;6DAKxCqB;QACN,IAAKqB,KAAKihC,IAGV;YACEjhC,KAAKihC,GAAWsD,WACdvkC,KAAKwkC,GAA6BxkC,KAAKwgC;UAEzC,OAAOljC;;;;IAKHqB,GAA6B6hC;QACnC,OAAO,oBAAiCxgC,KAAKJ,kBAAkB4gC;;;;;;GAOnE,UAASiD,GACPlL;IAEA,OAAOC,GAAqBC,GAC1BF,GACAmL,GAAgB/K;;;;;GAOpB,UAASoK,GACPxK;IAEA,OAAOC,GAAqBC,GAC1BF,GACAyK,GAAiBrK;;;mEAKRkI;IAGXliC,YAA6B4iC,GAA0B8F;QAA1BrnC,UAAAuhC,GAC3BvhC,KAAKsnC,KAAmB,IAAIC,GAAoBvnC,MAAMqnC;;IAGxD1oC,GACE45B;QAEA,MAAMiP,IAAkBxnC,KAAKynC,GAAsBlP;QAEnD,OAD2Bv4B,KAAKuhC,GAAGmG,KAAiBC,GAAepP,GACzC/xB,KAAKw4B,KAC7BwI,EAAgBhhC,KAAKohC,KAAY5I,IAAc4I;;IAI3CjpC,GACN45B;QAEA,IAAIsP,IAAgB;QACpB,OAAO7nC,KAAK8nC,GAAsCvP,GAAK52B;YACrDkmC;WACCrhC,KAAK,MAAMqhC;;IAGhBlpC,GACE45B,GACArwB;QAEA,OAAOlI,KAAKuhC,GAAGmG,KAAiBrzB,GAAckkB,GAAKrwB;;IAGrDvJ,GACE45B,GACArwB;QAEA,OAAOlI,KAAK+nC,GAAwBxP,GAAK,CAACtJ,GAAQxkB,MAChDvC,EAAEuC;;IAIN9L,GACE45B,GACAhuB,GACA/J;QAEA,OAAOwnC,GAAiBzP,GAAK/3B;;IAG/B7B,GACE45B,GACAhuB,GACA/J;QAEA,OAAOwnC,GAAiBzP,GAAK/3B;;IAG/B7B,GACE45B,GACA6G,GACAC;QAEA,OAAOr/B,KAAKuhC,GACTmG,KACAO,GAAc1P,GAAK6G,GAAYC;;IAGpC1gC,GACE45B,GACA/3B;QAEA,OAAOwnC,GAAiBzP,GAAK/3B;;;;;;;WASvB7B,GACN45B,GACAtJ;;QAEA,gBClkBFsJ,GACAtJ;YAEA,IAAIjQ,KAAQ;YACZ,OAAOkpB,GAAoB3P,GACxB4P,GAAcC,KACNC,GAAyB9P,GAAK6P,GAAQnZ,GAAQzoB,KAAK8hC,MACpDA,MACFtpB,KAAQ,IAEH+Q,GAAmBU,SAAS6X,MAGtC9hC,KAAK,MAAMwY;;;;;GDqjBLupB,EAAyBhQ,GAAKtJ;;IAGvCtwB,GACE45B,GACA6G;QAEA,MACMoJ,IADgBxoC,KAAKuhC,GAAGkH,KACKC,MAE7BrX,IAA4C;QAClD,IAAIsX,IAAgB;QAsBpB,OApBkB3oC,KAAK+nC,GACrBxP,GACA,CAACtJ,GAAQxkB;YACP,IAAIA,KAAkB20B,GAAY;gBAChC,MAAM7Q,IAAIvuB,KAAK4oC,GAASrQ,GAAKtJ,GAAQzoB,KAAKoiC;oBACxC,KAAKA;;;oBAIH,OAHAD,KAGOH,EAAazV,GAASwF,GAAKtJ,GAAQzoB,KAAK,OAC7CgiC,EAAa3K,GAAY5O,IAClB4Q,GAAoBtH,GAAKroB,OAoFvC,EAAC,GAAG0mB,GApFsD3H,EAoF/BvpB;;gBAhF1B2rB,EAAS5vB,KAAK8sB;;WAMjB/nB,KAAK,MAAMupB,GAAmBuB,GAAQD,IACtC7qB,KAAK,MAAMgiC,EAAa/+B,MAAM8uB,IAC9B/xB,KAAK,MAAMmiC;;IAGhBhqC,aACE45B,GACApjB;QAEA,MAAMsqB,IAAUtqB,EAAW0zB,EAAmBtQ,EAAI+H;QAClD,OAAOtgC,KAAKuhC,GAAGmG,KAAiBoB,GAAiBvQ,GAAKkH;;IAGxD9gC,GACE45B,GACA/3B;QAEA,OAAOwnC,GAAiBzP,GAAK/3B;;;;;;;WASvB7B,GACN45B,GACArwB;QAEA,MAAMywB,IAAQkH,GAAoBtH;QAClC,IACIwQ,GADAC,IAAqChU,GAAesR;QAExD,OAAO3N,EACJwD,GACC;YACE58B,OAAOugC,GAAiBI;WAE1B,EAAE31B,GAAU0kB,KAAWvpB,MAAAA,GAAM+E,gBAAAA;YACV,MAAbF;;;YAGEy+B,MAAiBhU,GAAesR,MAClCp+B,EAAE,IAAIzB,EAAYwwB,GAAmB8R,KAAYC;;;;;YAMnDA,OACAD,IAAWrjC;;;YAIXsjC,IAAehU,GAAesR;WAInC9/B,KAAK;;;;YAIAwiC,MAAiBhU,GAAesR,MAClCp+B,EAAE,IAAIzB,EAAYwwB,GAAmB8R,KAAYC;;;IAKzDrqC,GAAa45B;QACX,OAAOv4B,KAAKuhC,GAAGkH,KAAyBQ,GAAQ1Q;;;;AAmBpD,SAASyP,GACPzP,GACA/3B;IAEA,OAAOq/B,GAAoBtH,GAAKL;;;;;IAXlC,SACE13B,GACAiK;QAEA,OAAO,IAAIq1B,GAAiB,GAAGlJ,GAAmBp2B,EAAIkF,OAAO+E;KAQ3Dy+B,CAAY1oC,GAAK+3B,EAAI+H;;;;;;aAQT6I,GACdxpC,GACAC;;;;;;IASA,IAAIO,IAAWR,EAAWO;IAK1B,OAJKP,EAAWypC,MACdjpC,KAAY,MAAMR,EAAWQ,WAGxB,eAAeP,IAAiB,MAAMO,IAAW;;;;;;;;;;;;;;;;;;;;MC3vC7C2lC;IAeXnnC;;;;;IAKUypC,GACS/qB,GACAqV,GACA6L;QAHTv+B,cAAAooC,GACSpoC,kBAAAqd,aACAqV,aACA6L;;;;;;;;;;;;;QAVnBv+B,UAAgC;;;;;;WAkBhCrB,UACEknC,GACAxoB,GACAqV,GACA6L;;;;;QAMA5gC,EAAwB,OAAbkoC,EAAKwD;QAChB,MAAMjB,IAASvC,EAAKyD,OAAoBzD,EAAKwD,MAAO;QACpD,OAAO,IAAIvD,GACTsC,GACA/qB,GACAqV,GACA6L;;IAIJ5/B,GAAWgzB;QACT,IAAIlH,KAAQ;QACZ,MAAM1c,IAAQqqB,YAAYrL,MACxB,EAAC/sB,KAAKooC,QAAQlhC,OAAOw4B,qBACrB,EAAC1/B,KAAKooC,QAAQlhC,OAAOy4B;QAEvB,OAAO4J,GAAe5X,GACnBwK,GACC;YAAE58B,OAAOiqC,GAAgBC;YAAoB17B,OAAAA;WAC7C,CAACvN,GAAKrD,GAAOk/B;YACX5R,KAAQ,GACR4R,EAAQtL;WAGXvqB,KAAK,MAAMikB;;IAGhB9rB,GACEgzB,GACA5a,GACAgY,GACAC;QAEA,MAAM0a,IAAgBC,GAAuBhY,IACvCiY,IAAgBL,GAAe5X;;;;;;;;;;QAYrC,OAAOiY,EAAcp7B,IAAI,IAAWhI,KAAKsoB;YAjG7BnxB,EAmGW,mBAAZmxB;YAIT,MAAMY,IAAQ,IAAIb,GAChBC,GACA/X,GACAgY,GACAC,IAEIoL,aLIVrB,GACAqP,GACA1Y;gBAEA,MAAMma,IAA0Bna,EAAMX,cAAclyB,IAAIyyB,KACtDlP,GAAW2Y,EAAgBF,IAAkBvJ,KAEzCwa,IAAsBpa,EAAMV,UAAUnyB,IAAIyyB,KAC9ClP,GAAW2Y,EAAgBF,IAAkBvJ;gBAE/C,OAAO,IAAIka,GACTpB,GACA1Y,EAAMZ,SACNY,EAAM3Y,GAAehT,YACrB8lC,GACAC;aKnBkBC,CAAkB/pC,KAAKqd,YAAYrd,KAAKooC,QAAQ1Y,IAE1D2B,IAA4C;YAClD,IAAImM,IAAoB,IAAI7vB,GAAwB,CAACwa,GAAGC,MACtDnpB,EAAoBkpB,EAAE1iB,KAAmB2iB,EAAE3iB;YAE7C,KAAK,MAAM4a,KAAY2O,GAAW;gBAChC,MAAMgb,IAAWC,GAAmBzpC,IAClCR,KAAKooC,QACL/nB,EAAS7f,IAAIkF,MACbopB;gBAEF0O,IAAoBA,EAAkBhvB,IAAI6R,EAAS7f,IAAIkF,KAAKie,MAC5D0N,EAAS5vB,KAAKmoC,EAAc1R,IAAIkC,KAChC/I,EAAS5vB,KACPioC,EAAcxR,IAAI8R,GAAUC,GAAmBC;;YAcnD,OAVA1M,EAAkB38B,QAAQ2iB;gBACxB6N,EAAS5vB,KACPzB,KAAK0yB,GAAaoL,GAA2BnM,GAAanO;gBAI9DmO,EAAYoG,GAAuB;gBACjC/3B,KAAKmqC,GAAsBrb,KAAWY,EAAMpgB;gBAGvCygB,GAAmBuB,GAAQD,GAAU7qB,KAAK,MAAMkpB;;;IAI3D/wB,GACEgzB,GACA7C;QAEA,OAAOya,GAAe5X,GACnBnwB,IAAIstB,GACJtoB,KAAK4zB,KACAA,KACFz8B,EACEy8B,EAAQgO,WAAWpoC,KAAKooC,SAGnBjO,GAAoBn6B,KAAKqd,YAAY+c,MAEvC;;;;;;;;;IAWbz7B,GACEgzB,GACA7C;QAEA,OAAI9uB,KAAKmqC,GAAsBrb,KACtBiB,GAAmBU,QACxBzwB,KAAKmqC,GAAsBrb,MAGtB9uB,KAAKoqC,GAAoBzY,GAAa7C,GAAStoB,KAAKkpB;YACzD,IAAIA,GAAO;gBACT,MAAMpgB,IAAOogB,EAAMpgB;gBAEnB,OADAtP,KAAKmqC,GAAsBrb,KAAWxf,GAC/BA;;YAEP,OAAO;;;IAMf3Q,GACEgzB,GACA7C;QAEA,MAAMub,IAAcvb,IAAU,GAExB/gB,IAAQqqB,YAAYsE,WAAW,EAAC18B,KAAKooC,QAAQiC;QACnD,IAAIC,IAAmC;QACvC,OAAOf,GAAe5X,GACnBwK,GACC;YAAE58B,OAAOiqC,GAAgBC;YAAoB17B,OAAAA;WAC7C,CAACvN,GAAK45B,GAASiC;YACTjC,EAAQgO,WAAWpoC,KAAKooC,WAC1BzqC,EACEy8B,EAAQtL,WAAWub,IAGrBC,IAAanQ,GAAoBn6B,KAAKqd,YAAY+c,KAEpDiC,EAAQtL;WAGXvqB,KAAK,MAAM8jC;;IAGhB3rC,GACEgzB;QAEA,MAAM5jB,IAAQqqB,YAAYgH,WAAW,EACnCp/B,KAAKooC,QACLlhC,OAAOy4B;QAGT,IAAI7Q,KjBnOuB;QiBoO3B,OAAOya,GAAe5X,GACnBwK,GACC;YAAE58B,OAAOiqC,GAAgBC;YAAoB17B,OAAAA;YAAOovB,UAAS;WAC7D,CAAC38B,GAAK45B,GAASiC;YACbvN,IAAUsL,EAAQtL,SAClBuN,EAAQtL;WAGXvqB,KAAK,MAAMsoB;;IAGhBnwB,GACEgzB;QAEA,MAAM5jB,IAAQqqB,YAAYrL,MACxB,EAAC/sB,KAAKooC,SjBnPmB,KiBoPzB,EAACpoC,KAAKooC,QAAQlhC,OAAOy4B;QAEvB,OAAO4J,GAAe5X,GACnB0G,GAAQmR,GAAgBC,oBAAoB17B,GAC5CvH,KAAK+jC,KACJA,EAAU1tC,IAAIu9B,KAAWD,GAAoBn6B,KAAKqd,YAAY+c;;IAIpEz7B,GACEgzB,GACAC;;;QAIA,MAAM4Y,IAAcP,GAAmBQ,cACrCzqC,KAAKooC,QACLxW,EAAYlsB,OAERglC,IAAatS,YAAYsE,WAAW8N,IAEpC3a,IAA2B;QACjC,OAAO8Z,GAAuBhY,GAC3BwK,GAAQ;YAAEpuB,OAAO28B;WAAc,CAACV,GAAUroC,GAAG06B;YAC5C,OAAOsO,GAAQC,GAAa9b,KAAWkb,GASjCtkC,IAAOuxB,GAAmB2T;;;;;;;;wBAChC,IAAID,MAAW3qC,KAAKooC,UAAWxW,EAAYlsB,KAAKpB,QAAQoB;;YAKxD,OAAO6jC,GAAe5X,GACnBnwB,IAAIstB,GACJtoB,KAAK6Z;gBACJ,KAAKA,GACH,MA9SG9iB;gBAqTLI,EACE0iB,EAAS+nB,WAAWpoC,KAAKooC,SAG3BvY,EAAQpuB,KAAK04B,GAAoBn6B,KAAKqd,YAAYgD;;YAnBpDgc,EAAQtL;WAsBXvqB,KAAK,MAAMqpB;;IAGhBlxB,GACEgzB,GACAI;QAEA,IAAI8Y,IAAiB,IAAIl9B,GAAmB1O;QAE5C,MAAMoyB,IAA4C;QAiClD,OAhCAU,EAAalxB,QAAQ+wB;YACnB,MAAM8Y,IAAaT,GAAmBQ,cACpCzqC,KAAKooC,QACLxW,EAAYlsB,OAERqI,IAAQqqB,YAAYsE,WAAWgO,IAE/BhV,IAAUiU,GAAuBhY,GAAawK,GAClD;gBAAEpuB,OAAAA;eACF,CAACi8B,GAAUroC,GAAG06B;gBACZ,OAAOsO,GAAQC,GAAaE,KAAWd,GASjCtkC,IAAOuxB,GAAmB2T;;;;;;;;gCAC5BD,MAAW3qC,KAAKooC,UAAWxW,EAAYlsB,KAAKpB,QAAQoB,KAKxDmlC,IAAiBA,EAAer8B,IAAIs8B,KAJlCzO,EAAQtL;;YAQdM,EAAS5vB,KAAKi0B;YAGT3F,GAAmBuB,GAAQD,GAAU7qB,KAAK,MAC/CxG,KAAK+qC,GAAsBpZ,GAAakZ;;IAI5ClsC,GACEgzB,GACA7gB;QAWA,MAAMk6B,IAAYl6B,EAAMpL,MAClBulC,IAA0BD,EAAUlsC,SAAS,GAa7C0rC,IAAcP,GAAmBQ,cACrCzqC,KAAKooC,QACL4C,IAEIN,IAAatS,YAAYsE,WAAW8N;;;;QAK1C,IAAIK,IAAiB,IAAIl9B,GAAmB1O;QAC5C,OAAO0qC,GAAuBhY,GAC3BwK,GAAQ;YAAEpuB,OAAO28B;WAAc,CAACV,GAAUroC,GAAG06B;YAC5C,OAAOsO,GAAQC,GAAaE,KAAWd,GACjCtkC,IAAOuxB,GAAmB2T;YAC5BD,MAAW3qC,KAAKooC,UAAW4C,EAAU9iB,EAAWxiB;;;;;;YAShDA,EAAK5G,WAAWmsC,MAGpBJ,IAAiBA,EAAer8B,IAAIs8B,MAXlCzO,EAAQtL;WAaXvqB,KAAK,MAAMxG,KAAK+qC,GAAsBpZ,GAAakZ;;IAGhDlsC,GACNgzB,GACAuZ;QAEA,MAAMrb,IAA2B,IAC3BwB,IAA4C;;QAsBlD,OApBA6Z,EAASrqC,QAAQiuB;YACfuC,EAAS5vB,KACP8nC,GAAe5X,GACZnwB,IAAIstB,GACJtoB,KAAK6Z;gBACJ,IAAiB,SAAbA,GACF,MAlbG9iB;gBAwbLI,EACE0iB,EAAS+nB,WAAWpoC,KAAKooC,SAG3BvY,EAAQpuB,KAAK04B,GAAoBn6B,KAAKqd,YAAYgD;;YAInD0P,GAAmBuB,GAAQD,GAAU7qB,KAAK,MAAMqpB;;IAGzDlxB,GACEgzB,GACAjC;QAEA,OAAOyb,GACJxZ,EAAqC0O,IACtCrgC,KAAKooC,QACL1Y,GACAlpB,KAAK6L,MACLsf,EAAYoG,GAAuB;YACjC/3B,KAAKorC,GAAyB1b,EAAMZ;YAE/BiB,GAAmBlvB,QACxBwR,GACC7R,KACQR,KAAKu+B,GAAkB8M,GAC5B1Z,GACAnxB;;;;;;;;;;;IAgBV7B,GAAyBmwB;eAChB9uB,KAAKmqC,GAAsBrb;;IAGpCnwB,GACE45B;QAEA,OAAOv4B,KAAKsrC,GAAW/S,GAAK/xB,KAAKikB;YAC/B,KAAKA,GACH,OAAOsF,GAAmBU;;;wBAK5B,MAAM8a,IAAanT,YAAYsE,WAC7BuN,GAAmBuB,cAAcxrC,KAAKooC,UAElCqD,IAA6C;YACnD,OAAO9B,GAAuBpR,GAC3B4D,GAAQ;gBAAEpuB,OAAOw9B;eAAc,CAAC/qC,GAAKmB,GAAG06B;gBAEvC,IADe77B,EAAI,OACJR,KAAKooC,QAGb;oBACL,MAAM1iC,IAAOuxB,GAAmBz2B,EAAI;oBACpCirC,EAA2BhqC,KAAKiE;uBAJhC22B,EAAQtL;eAOXvqB,KAAK;gBACJ7I,EACwC,MAAtC8tC,EAA2B3sC;;;;IASrCH,GACE45B,GACA/3B;QAEA,OAAO6nC,GAAyB9P,GAAKv4B,KAAKooC,QAAQ5nC;;;;IAK5C7B,GACNgzB;QAEA,OAAOuW,GAAoBvW,GACxBnwB,IAAIxB,KAAKooC,QACT5hC,KAAM60B,KAEHA,KACA,IAAIqQ,GACF1rC,KAAKooC,SjB/gBc;6BiBihBE;;;;;;;GAWjC,UAASC,GACP9P,GACA6P,GACA5nC;IAEA,MAAMwpC,IAAWC,GAAmBQ,cAAcrC,GAAQ5nC,EAAIkF,OACxDklC,IAAcZ,EAAS,IACvBuB,IAAanT,YAAYsE,WAAWsN;IAC1C,IAAI1B,KAAc;IAClB,OAAOqB,GAAuBpR,GAC3B4D,GAAQ;QAAEpuB,OAAOw9B;QAAYtL,KAAU;OAAQ,CAACz/B,GAAKrD,GAAOk/B;QAC3D,OAAOsO,GAAQgB,eAAqBhqC,KAAKnB;QACrCmqC,MAAWvC,KAAUuD,MAAYf,MACnCtC,KAAc,IAEhBjM,EAAQtL;OAETvqB,KAAK,MAAM8hC;;;SAyBA6C,GACd5S,GACA6P,GACA1Y;IAEA,MAAMka,IAAgBrR,EAAII,MACxB6Q,GAAgB7Q,QAEZiT,IAAWrT,EAAII,MACnBsR,GAAmBtR,QAEftH,IAA4C,IAE5CtjB,IAAQqqB,YAAYyT,KAAKnc,EAAMZ;IACrC,IAAIgd,IAAa;IACjB,MAAMC,IAAgBnC,EAAczN,GAClC;QAAEpuB,OAAAA;OACF,CAACvN,GAAKrD,GAAOk/B,OACXyP,KACOzP,EAAQnsB;IAGnBmhB,EAAS5vB,KACPsqC,EAAcvlC,KAAK;QAvlBP7I,EAylBO,MAAfmuC;;IAMN,MAAMz5B,IAAkC;IACxC,KAAK,MAAMgO,KAAYqP,EAAMV,WAAW;QACtC,MAAMgb,IAAWC,GAAmBzpC,IAClC4nC,GACA/nB,EAAS7f,IAAIkF,MACbgqB,EAAMZ;QAERuC,EAAS5vB,KAAKmqC,EAAS17B,OAAO85B,KAC9B33B,EAAiB5Q,KAAK4e,EAAS7f;;IAEjC,OAAOuvB,GAAmBuB,GAAQD,GAAU7qB,KAAK,MAAM6L;;;;;GAMzD,UAASk3B,GACPhR;IAEA,OAAOC,GAAqBC,GAC1BF,GACAiR,GAAgB7Q;;;;;GAOpB,UAASgR,GACPpR;IAEA,OAAOC,GAAqBC,GAG1BF,GAAK0R,GAAmBtR;;;;;GAM5B,UAASuP,GACP3P;IAEA,OAAOC,GAAqBC,GAC1BF,GACAmT,GAAgB/S;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GC9nBb,OAAMyI,KAAiB;;6DAGjBC;IACX1iC,YAA6B0e;QAAArd,kBAAAqd;;;;;;;;WAS7B1e,gBACE4iC,GACAhJ,GACAza,GACAF;QAhCYjgB,EAmCVmgB,IAAcF,KACZE,KAAe,KACfF,KAAawjB;QAIjB,MAAMf,IAAsB,IAAI2L,GAAoBzT;QAEhDza,IAAc,KAAKF,KAAa,MA6SxC,SAAkC2jB;YAChCA,EAAG0K,kBAAkBvI,GAAgB/K;;;;;;;GA7SjCuT,EAAyB3K,IA+Z/B,SAA6BA;YAC3BA,EAAG0K,kBAAkBP,GAAgB/S,OAAO;gBAC1CgT,SAASD,GAAgBC;gBAGEpK,EAAG0K,kBAAkBzC,GAAgB7Q,OAAO;gBACvEgT,SAASnC,GAAgBmC;gBACzBQ,gBAAe;eAEIC,YACnB5C,GAAgBC,oBAChBD,GAAgB6C,sBAChB;gBAAEC,SAAQ;gBAGZ/K,EAAG0K,kBAAkBhC,GAAmBtR;;;;;GA7apC4T,EAAoBhL,IACpBiL,GAAiBjL,IA4gBvB,SAAmCA;YACjCA,EAAG0K,kBAAkBtS,GAAiBhB;;;;;GA5gBlC8T,EAA0BlL;;;gBAM5B,IAAIhT,IAAIwB,GAAmBU;QA+D3B,OA9DI3S,IAAc,KAAKF,KAAa;;;QAGd,MAAhBE,OAm4BV,SAAwByjB;YACtBA,EAAGmL,kBAAkB5M,GAAiBnH,QACtC4I,EAAGmL,kBAAkB3R,GAASpC,QAC9B4I,EAAGmL,kBAAkBlN,GAAe7G;SAr4B9BgU,CAAepL,IACfiL,GAAiBjL,KAEnBhT,IAAIA,EAAE/nB,KAAK;;;;;;QAg5BjB,SACE+xB;YAEA,MAAMqU,IAAcrU,EAAII,MACtB6G,GAAe7G,QAEX0C,IAAW,IAAImE;iCACE;0CACS,GAC9Br7B,EAAgBkB,MAAMmY;6BACL;YAEnB,OAAOovB,EAAY1U,IAAIsH,GAAeh/B,KAAK66B;;;;;GA55BtBwR,EAA4BxM,MAG3CviB,IAAc,KAAKF,KAAa,MACd,MAAhBE;;;;;;;QAOFyQ,IAAIA,EAAE/nB,KAAK,MAyZnB,SACE+6B,GACAhJ;YAKA,OAHyBA,EAAII,MAC3B6Q,GAAgB7Q,OAEMN,KAAU7xB,KAAKsmC;gBACrCvL,EAAGmL,kBAAkBlD,GAAgB7Q,QAEd4I,EAAG0K,kBAAkBzC,GAAgB7Q,OAAO;oBACjEgT,SAASnC,GAAgBmC;oBACzBQ,gBAAe;mBAEFC,YACb5C,GAAgBC,oBAChBD,GAAgB6C,sBAChB;oBAAEC,SAAQ;;gBAGZ,MAAMS,IAAmBxU,EAAII,MAC3B6Q,GAAgB7Q,QAEZqU,IAAWF,EAAkBjwC,IAAIwjB,KACrC0sB,EAAiB7U,IAAI7X;gBAGvB,OAAO0P,GAAmBuB,GAAQ0b;;;;;;;;;GAnb5BC,EAAyC1L,GAAIlB,MAIjD9R,IAAIA,EAAE/nB,KAAK;aAg8BjB,SAAmC+6B;gBACjCA,EAAG0K,kBAAkBjJ,GAAiBrK,OAAO;oBAC3CgT,SAAS3I,GAAiB2I;;;kCAj8BtBuB;aAA0B3L;aAI1BzjB,IAAc,KAAKF,KAAa,MAClC2Q,IAAIA,EAAE/nB,KAAK,MAAMxG,KAAKmtC,4BAA4B9M;QAGhDviB,IAAc,KAAKF,KAAa,MAClC2Q,IAAIA,EAAE/nB,KAAK,OA0lBjB,SAAmC+6B;YACjCA,EAAG0K,kBAAkB3O,GAAuB3E;;;;;;;;;;GA1lBtCyU,EAA0B7L,IACnBvhC,KAAKqtC,kBAAkBhN,OAI9BviB,IAAc,KAAKF,KAAa,MAClC2Q,IAAIA,EAAE/nB,KAAK,MAAMxG,KAAKstC,sBAAsBjN;QAG1CviB,IAAc,KAAKF,KAAa,MAClC2Q,IAAIA,EAAE/nB,KAAK,MACTxG,KAAKutC,4BAA4BhM,GAAIlB,MAIrCviB,IAAc,KAAKF,KAAa,MAClC2Q,IAAIA,EAAE/nB,KAAK;;;;aA01BjB,SAAwC+6B;gBAClCA,EAAGiM,iBAAiBC,SAAS,4BAC/BlM,EAAGmL,kBAAkB;aAx1BjBgB,CAA+BnM,IAo3BvC,SAA2ChJ;gBACzC,MAAMoV,IAAsBpV,EAAIqV,YAAYjU,GAAiBhB;gBAC7DgV,EAAoBvB,YAClBzS,GAAiBsD,eACjBtD,GAAiBkU,mBACjB;oBAAEvB,SAAQ;oBAEZqB,EAAoBvB,YAClBzS,GAAiBkD,yBACjBlD,GAAiBmU,6BACjB;oBAAExB,SAAQ;;;;;;;;GA73BNyB,EAAkCxV;aAIlCza,IAAc,MAAMF,KAAa,OACnC2Q,IAAIA,EAAE/nB,KAAK,MAAMxG,KAAKguC,oBAAoB3N,MAErC9R;;IAGD5vB,kBACN45B;QAEA,IAAI0V,IAAY;QAChB,OAAO1V,EACJI,MAA6CgB,GAAiBhB,OAC9DwD,GAAQ,CAACx6B,GAAGsO;YACXg+B,KAAatS,GAAe1rB;WAE7BzJ,KAAK;YACJ,MAAM60B,IAAW,IAAIiC,GAAuB2Q;YAC5C,OAAO1V,EACJI,MACC2E,GAAuB3E,OAExBT,IAAIoF,GAAuB98B,KAAK66B;;;IAIjC18B,4BACN45B;QAEA,MAAM2V,IAAc3V,EAAII,MACtB+S,GAAgB/S,QAEZ4Q,IAAiBhR,EAAII,MACzB6Q,GAAgB7Q;QAGlB,OAAOuV,EAAY7V,KAAU7xB,KAAK2nC,KACzBpe,GAAmBlvB,QAAQstC,GAASvY;YACzC,MAAM7nB,IAAQqqB,YAAYrL,MACxB,EAAC6I,EAAMwS,SlB5Jc,KkB6JrB,EAACxS,EAAMwS,QAAQxS,EAAMwY;YAGvB,OAAO7E,EACJlR,GAAQmR,GAAgBC,oBAAoB17B,GAC5CvH,KAAK+jC,KACGxa,GAAmBlvB,QACxB0pC,GACCnQ;gBACCz8B,EACEy8B,EAAQgO,WAAWxS,EAAMwS;gBAG3B,MAAM1Y,IAAQyK,GAAoBn6B,KAAKqd,YAAY+c;gBAEnD,OAAO+Q,GACL5S,GACA3C,EAAMwS,QACN1Y,GACAlpB,KAAK;;;;;;;WAYb7H,sBACN45B;QAEA,MAAMsH,IAAsBtH,EAAII,MAG9BmH,GAAiBnH,QACbqE,IAAiBzE,EAAII,MACzBgB,GAAiBhB;QAMnB,OAJ0BJ,EAAII,MAC5B6G,GAAe7G,OAGQn3B,IAAIg+B,GAAeh/B,KAAKgG,KAAK60B;YAKpD,MAYMhK,IAA4C;YAClD,OAAO2L,EACJb,GAAQ,CAAC37B,GAAKyP;gBACb,MAAMvK,IAAO,IAAIJ,EAAa9E,IACxB6tC,IA4EhB,SAAqB3oC;oBACnB,OAAO,EAAC,GAAGkxB,GAAmBlxB;;;;GA7EC4oC,EAAY5oC;gBACnC2rB,EAAS5vB,KACPo+B,EAAoBr+B,IAAI6sC,GAAgB7nC,KAAK+nC,KACtCA,IAGIxe,GAAmBU,YAtBX,CACvB/qB,KAEOm6B,EAAoB3H,IACzB,IAAI4H,GACF,GACAlJ,GAAmBlxB,IACnB21B,EAAsC,8BAa3B2M,CAAiBtiC;eAO/Bc,KAAK,MAAMupB,GAAmBuB,GAAQD;;;IAIrC1yB,4BACN4iC,GACAhJ;;QAGAgJ,EAAG0K,kBAAkBvT,GAAmBC,OAAO;YAC7CgT,SAASjT,GAAmBiT;;QAG9B,MAAM1T,IAAyBM,EAAII,MAGjCD,GAAmBC,QAGf6V,IAAQ,IAAIjX,IACZoG,IACJnG;YAEA,IAAIgX,EAAMhgC,IAAIgpB,IAAiB;gBAC7B,MAAM5wB,IAAe4wB,EAAe5T,KAC9B8T,IAAaF,EAAe7T;gBAClC,OAAOsU,EAAuBC,IAAI;oBAChCtxB,cAAAA;oBACA4c,QAAQoT,GAAmBc;;;;;;QAMjC,OAAOa,EACJI,MAA6CgB,GAAiBhB,OAC9DwD,GAAQ;YAAE8D,KAAU;WAAQ,CAACwO,GAAc9sC;YAC1C,MAAM+D,IAAO,IAAIJ,EAAampC;YAC9B,OAAO9Q,EAASj4B,EAAKie;WAEtBnd,KAAK,MAEG+xB,EACJI,MACCsR,GAAmBtR,OAEpBwD,GAAQ;YAAE8D,KAAU;WAAQ,EAAE0K,GAAQC,GAAa9b,IAAUntB;YAC5D,MAAM+D,IAAOuxB,GAAmB2T;YAChC,OAAOjN,EAASj4B,EAAKie;;;IAKvBhlB,oBACN45B;QAEA,MAAMmW,IAAcnW,EAAII,MAA6BoC,GAASpC;QAC9D,OAAO+V,EAAYvS,GAAQ,CAAC37B,GAAKmuC;YAC/B,MAAMC,IAAqBtU,GAAaqU,IAClCE,IAAkBjU,GAAW56B,KAAKqd,YAAYuxB;YACpD,OAAOF,EAAYxW,IAAI2W;;;;;MAYhB5U;IACXt7B,YAAmB4E,GAAwBC;QAAxBxD,eAAAuD,GAAwBvD,mBAAAwD;;;;;;;;;;;;UAkBhCkgC;IAgBX/kC,YACSgmC;;IAEApE,GACAsE;QAHA7kC,eAAA2kC,GAEA3kC,+BAAAugC,GACAvgC,wBAAA6kC;;;;;;;;;;GAZFnB,YAAQ;;;;;AAMRA,SAAM;;MAuBFgI;IAOX/sC;;;;IAISypC;;;;;;;;;IASAgG;;;;;;;;;;;;IAYAU;QArBA9uC,cAAAooC,GASApoC,+BAAAouC,GAYApuC,uBAAA8uC;;;;2CA9BFpD,YAAQ;;AAGRA,aAAU;;;;;;;;;MAyCNlC;IAaX7qC;;;;IAISypC;;;;IAIAtZ;;;;;IAKAuL;;;;;;;;;;;;;IAaAtL;;;;;;IAMAC;QA5BAhvB,cAAAooC,GAIApoC,eAAA8uB,GAKA9uB,wBAAAq6B,GAaAr6B,qBAAA+uB;QAMA/uB,iBAAAgvB;;;;2CA3CFwa,YAAQ;;AAGRA,aAAU;;AAGVA,wBAAqB;;AAGrBA,0BAAuB,EAAC,UAAU;;MAyG9BS;IA0CXtrC;;;;WAnCAA,qBAAqBypC;QACnB,OAAO,EAACA;;;;;WAOVzpC,qBACEypC,GACA1iC;QAEA,OAAO,EAAC0iC,GAAQxR,GAAmBlxB;;;;;WAOrC/G,WACEypC,GACA1iC,GACAopB;QAEA,OAAO,EAACsZ,GAAQxR,GAAmBlxB,IAAOopB;;;;AA9BrCmb,WAAQ;;;;;;;AAuCRA,iBAAc,IAAIA;;MAmBdpQ;IACXl7B,YAAmB+G,GAAuB2Z;QAAvBrf,YAAA0F,GAAuB1F,gBAAAqf;;;;;;;UAO/Bya;IACXn7B,YAAmB+G,GAAuBmY;QAAvB7d,YAAA0F,GAAuB1F,eAAA6d;;;;;;;;;;;;;;;;UAgB/B8b;;;;;;IA8BXh7B;;;;;;IAMS06B;;;;;IAKAH;;;;;IAKAljB;;;;;;;IAOA6S;;;;;IAMAxJ;;;;;IAMAqY;QA7BA13B,uBAAAq5B,GAKAr5B,kBAAAk5B,GAKAl5B,gBAAAgW,GAOAhW,6BAAA6oB;QAMA7oB,gBAAAqf,GAMArf,kBAAA03B;;;;AAhEFiC,WAAQ;;;;;;;AAQRA,mBAAgB,iBAEhBA,uBAAoB;;;;;;;;AASpBA,6BAA0B,2BAE1BA,iCAA8B,EAAC,cAAc;;;;;MAkDzC2D;;;;;IASX3+B,YAAmB28B;QAAAt7B,gBAAAs7B;;;;AARZgC,WAAQ,wBAERA,SAAM;;MAoCFvC;IAgBXp8B;;;;;;;;;IASS4L;;;;IAIAtC;;;;;;IAMAoX;;;;;;;;;;;;;;;;;;IAkBAzU;;;;;;;;;;;;;;;IAeA+vB;;;;;;IAMAhwB;;;;;;;;IAQAmG;QAzDA9Q,gBAAAuK,GAIAvK,mBAAAiI,GAMAjI,gBAAAqf,GAkBArf,mBAAA4K;QAeA5K,gCAAA26B,GAMA36B,oCAAA2K,GAQA3K,aAAA8Q;;;;AAjFFiqB,WAAQ;;AAGRA,aAAU;;AAGVA,2BAAwB;;;;;;AAOxBA,yBAAsB,EAAC,eAAe;;;;;;;;;;;;MAwFlC+E;IAaXnhC;;;;IAIS4L;;;;IAIA7E;;;;;;IAMA+E;QAVAzK,gBAAAuK,GAIAvK,YAAA0F,GAMA1F,sBAAAyK;;;;2CAzBFq1B,YAAQ;;AAGRA,aAAU,EAAC,YAAY;;AAGvBA,0BAAuB;;AAGvBA,4BAAyB,EAAC,QAAQ;;;;;;;;MAoC9BN;IAQX7gC;;;;;;IAMS+/B;;;;;;IAMAI;;;;;;;;;IASAF;;;;IAIAI;QAnBAh/B,uBAAA0+B,GAMA1+B,mCAAA8+B,GASA9+B,iCAAA4+B;QAIA5+B,mBAAAg/B;;;;;;;GA5BFQ,UAAM,mBACNA,WAAQ;;;;;;;;MA4CJ9G;IAOX/5B;;;;IAISiI;;;;;IAKA4c;QALAxjB,oBAAA4G,GAKA5G,cAAAwjB;;;;0CAIX,UAASgpB,GAAiBjL;IACKA,EAAG0K,kBAAkBnM,GAAiBnH,OAAO;QACxEgT,SAAS7L,GAAiB6L;OAEPS,YACnBtM,GAAiBI,sBACjBJ,GAAiBiP,wBACjB;QAAEzC,SAAQ;;;IAGQ/K,EAAG0K,kBAAkBlR,GAASpC,OAAO;QACvDgT,SAAS5Q,GAAS4Q;OAIRS,YACVrR,GAAS6E,uBACT7E,GAASiU,qBACT;QAAE1C,SAAQ;QAEZ/K,EAAG0K,kBAAkBzM,GAAe7G;;;AAtC7BD,WAAQ;;AAGRA,aAAU,EAAC,gBAAgB;;MA8FvBsK;IAOXrkC;;;;IAKS6hC;;IAEAkF;;IAEA7C;;IAEAI;QANAjjC,gBAAAwgC,GAEAxgC,oBAAA0lC,GAEA1lC,sBAAA6iC,GAEA7iC,oBAAAijC;;;;0CAhBFD,YAAQ;;AAGRA,aAAU;;AA2BZ,MAqCMoD,KAXY,KAJA,KAJA,KAlBA,EACvBsF,GAAgB/S,OAChB6Q,GAAgB7Q,OAChBsR,GAAmBtR,OACnBgB,GAAiBhB,OACjBoC,GAASpC,OACT+K,GAAgB/K,OAChB6G,GAAe7G,OACfmH,GAAiBnH,SAUqBqK,GAAiBrK,SAIjB2E,GAAuB3E,SAIvBD,GAAmBC;;;;;;;;;;;MCniC9CuI;IAoLXviC,YAAoB4iC;QAAAvhC,UAAAuhC;;;;;QAMC,SALAL,GAAS+N,GAAcC,QAMxClyC,EACE;;;;;;;;;WAnLN2B,UACE0E,GACAwa,GACAsxB;QAOA,OADA5yC,EA7CY,YA6CM,qBAAqB8G,IAChC,IAAI0sB,GAA6B,CAACU,GAASC;;;;;;YAMhD,MAAM0e,IAAUC,UAAUC,KAAKjsC,GAAMwa;YAErCuxB,EAAQG,YAAa5M;gBACnB,MAAMpB,IAAMoB,EAAM76B,OAA4B2E;gBAC9CgkB,EAAQ,IAAIyQ,GAASK;eAGvB6N,EAAQI,YAAY;gBAClB9e,EACE,IAAIztB,EACFlB,EAAKW,qBACL;eAMN0sC,EAAQK,UAAW9M;gBACjB,MAAMzlC,IAAuBylC,EAAM76B,OAA4B5K;gBAC5C,mBAAfA,EAAMmG,OACRqtB,EACE,IAAIztB,EACFlB,EAAKW,qBACL,2VAQJguB,EAAOxzB;eAIXkyC,EAAQM,kBAAmB/M;gBACzBpmC,EAxFQ,YA0FN,eAAe8G,IAAO,oCACtBs/B,EAAMgN;gBAER,MAAMpO,IAAMoB,EAAM76B,OAA4B2E;gBAC9C0iC,EACGS,gBACCrO,GACA6N,EAAoB,aACpBzM,EAAMgN,YACNvO,IAED56B,KAAK;oBACJjK,EAtGI,YAwGF,iCAAiC6kC,KAAiB;;;WAIzDyO;;8CAILlxC,cAAc0E;QAEZ,OADA9G,EAjHY,YAiHM,sBAAsB8G,IACjCysC,GAAkBpP,OAAO2O,UAAUU,eAAe1sC,IAAOwsC;;iFAIlElxC;QACE,IAAyB,sBAAd0wC,WACT,QAAO;QAGT,IAAInO,GAAS8O,MACX,QAAO;;;;;;;;gBAWT,MAAMC,IAAKf,KAaLgB,IAAahP,GAAS+N,GAAcgB,IACpCE,IAAmB,IAAID,KAAcA,IAAa,IAGlDE,IAAiBlP,GAASmP,GAAkBJ,IAC5CK,IAAuB,IAAIF,KAAkBA,IAAiB;;;;;;;;;gBAEpE,SACEH,EAAGtqC,QAAQ,WAAW,KACtBsqC,EAAGtqC,QAAQ,cAAc,KACzBsqC,EAAGtqC,QAAQ,WAAW,KACtBwqC,KACAG;;;;;WAYJ3xC;;QACE,OACqB,sBAAZ4xC,WAC+B,yBAAtCA,QAAQC,kCAAKC;;sEAKjB9xC,UACE45B,GACAI;QAEA,OAAOJ,EAAII,MAA0BA;;;;IAKvCh6B,UAAqBsxC;QACnB,MAAMS,IAAkBT,EAAGU,MAAM,oCAC3B9yB,IAAU6yB,IACZA,EAAgB,GAAG9qC,MAAM,KAAKhB,MAAM,GAAG,GAAGY,KAAK,OAC/C;QACJ,OAAO0B,OAAO2W;;;;IAKhBlf,UAAyBsxC;QACvB,MAAMW,IAAsBX,EAAGU,MAAM,sBAC/B9yB,IAAU+yB,IACZA,EAAoB,GAAGhrC,MAAM,KAAKhB,MAAM,GAAG,GAAGY,KAAK,OACnD;QACJ,OAAO0B,OAAO2W;;IAmBhBlf,GACEkyC;QAEA7wC,KAAKuhC,GAAGuP,kBAAmBnO,KAClBkO,EAAsBlO;;IAIjChkC,qBACEqnC,GACA+K,GACAC;QAEA,MAAMC,IAAoB,eAATjL;QACjB,IAAIkL,IAAgB;QAEpB,SAAa;cACTA;YAEF,MAAMvf,IAAcqa,GAAoBsD,KACtCtvC,KAAKuhC,IACL0P,IAAW,aAAa,aACxBF;YAEF;gBACE,MAAMI,IAAsBH,EAAcrf,GACvCuQ,MAAMhlC;;gBAELy0B,EAAYyf,MAAMl0C,IAKX6yB,GAAmBW,OAAUxzB,KAErC2yC;;;gCAUH,OANAsB,EAAoBjP,MAAM;;;;sBAKpBvQ,EAAY0f,IACXF;cACP,OAAOj0C;;;;;;gBAOP,MAAMo0C,IACW,oBAAfp0C,EAAMmG,QACN6tC,IAhRsB;gBAwRxB,IAPA30C,EAvRQ,YAyRN,oDACAW,EAAMO,SACN6zC;iBAGGA,GACH,OAAO3gB,QAAQD,OAAOxzB;;;;IAM9ByB;QACEqB,KAAKuhC,GAAGa;;;;;;;;UASCmP;IAIX5yC,YAAoB6yC;kBAAAA,GAHpBxxC,WAAqB,GACrBA,UAAsC;;IAItCyxC;QACE,OAAOzxC,KAAK0xC;;IAGdC;QACE,OAAO3xC,KAAKk8B;;IAGdlW,WAAW7oB;QACT6C,KAAKwxC,KAAWr0C;;;;WAMlBwB;QACEqB,KAAK0xC,MAAa;;;;;WAOpB/yC,GAAK6B;QACHR,KAAKk8B,KAAU17B;;;;;;WAQjB7B;QACE,OAAOmxC,GAAkB9vC,KAAKwxC,GAASthC;;;;oFA6B9B0hC,WAAkC3uC;IAG7CtE,YAAYoU;QACV5P,MAAMpB,EAAKgB,aAAa,mCAAmCgQ,IAH7D/S,YAAO;;;;sEAQOwjC,GAA4BlmC;;;IAG1C,OAAkB,gCAAXA,EAAE+F;;;;;;UAOE2oC;IAgBXrtC,YAA6BgzB;QAAA3xB,mBAAA2xB,GAfrB3xB,gBAAU;;;;QAKlBA,UAAsC,IAAIy1B,IAWxCz1B,KAAK2xB,YAAYkgB,aAAa;YAC5B7xC,KAAK8xC,GAAmBrhB;WAE1BzwB,KAAK2xB,YAAYogB,UAAU;YACrBpgB,EAAYz0B,QACd8C,KAAK8xC,GAAmBphB,OACtB,IAAIkhB,GAA0BjgB,EAAYz0B,UAG5C8C,KAAK8xC,GAAmBrhB;WAG5BzwB,KAAK2xB,YAAY8d,UAAW9M;YAC1B,MAAMzlC,IAAQ80C,GACXrP,EAAM76B,OAA4B;YAErC9H,KAAK8xC,GAAmBphB,OAAO,IAAIkhB,GAA0B10C;;;IAzBjEyB,YACE4iC,GACAyE,GACAwH;QAEA,OAAO,IAAIxB,GAAoBzK,EAAG5P,YAAY6b,GAAkBxH;;IAwBlEiM;QACE,OAAOjyC,KAAK8xC,GAAmBpc;;IAGjC/2B,MAAMzB;QACAA,KACF8C,KAAK8xC,GAAmBphB,OAAOxzB,IAG5B8C,KAAKkyC,YACR31C,EArbU,YAubR,yBACAW,IAAQA,EAAMO,UAAU;QAE1BuC,KAAKkyC,WAAU,GACflyC,KAAK2xB,YAAYyf;;;;;;;;;;WAarBzyC,MACEwzC;QAEA,MAAMxZ,IAAQ34B,KAAK2xB,YAAYic,YAAYuE;QAE3C,OAAO,IAAIC,GAAkCzZ;;;;;;;;;;;;;UAcpCyZ;IAIXzzC,YAAoBg6B;QAAA34B,aAAA24B;;IAWpBh6B,IACE0zC,GACAl1C;QAEA,IAAIiyC;QAQJ,YAPc9tC,MAAVnE,KACFZ,EAhfU,YAgfQ,OAAOyD,KAAK24B,MAAMt1B,MAAMgvC,GAAYl1C,IACtDiyC,IAAUpvC,KAAK24B,MAAMT,IAAI/6B,GAAOk1C,OAEhC91C,EAnfU,YAmfQ,OAAOyD,KAAK24B,MAAMt1B,MAAM,cAAcgvC;QACxDjD,IAAUpvC,KAAK24B,MAAMT,IAAIma,KAEpBvC,GAAkBV;;;;;;;;WAU3BzwC,IAAIxB;QAGF,OAFAZ,EAjgBY,YAigBM,OAAOyD,KAAK24B,MAAMt1B,MAAMlG,GAAOA,IAE1C2yC,GADS9vC,KAAK24B,MAAMnqB,IAAIrR;;;;;;;;WAWjCwB,IAAI6B;;;QAIF,OAAOsvC,GAHS9vC,KAAK24B,MAAMn3B,IAAIhB,IAGEgG,KAAKiG;;aAErBnL,MAAXmL,MACFA,IAAS,OAEXlQ,EAthBU,YAshBQ,OAAOyD,KAAK24B,MAAMt1B,MAAM7C,GAAKiM,IACxCA;;IAIX9N,OAAO6B;QAGL,OAFAjE,EA5hBY,YA4hBM,UAAUyD,KAAK24B,MAAMt1B,MAAM7C,IAEtCsvC,GADS9vC,KAAK24B,MAAMzoB,OAAO1P;;;;;;;WAUpC7B;QAGE,OAFApC,EAxiBY,YAwiBM,SAASyD,KAAK24B,MAAMt1B,OAE/BysC,GADS9vC,KAAK24B,MAAMp4B;;IAO7B5B,GACE2zC,GACAvkC;QAEA,MAAMiY,IAAShmB,KAAKgmB,OAAOhmB,KAAK+rB,QAAQumB,GAAcvkC,KAChD8hB,IAAuB;QAC7B,OAAO7vB,KAAKuyC,GAAcvsB,GAAQ,CAACxlB,GAAKrD;YACtC0yB,EAAQpuB,KAAKtE;WACZqJ,KAAK,MACCqpB;;IAOXlxB,GACE2zC,GACAvkC;QAEAxR,EApkBY,YAokBM,cAAcyD,KAAK24B,MAAMt1B;QAC3C,MAAM0oB,IAAU/rB,KAAK+rB,QAAQumB,GAAcvkC;QAC3Cge,EAAQymB,MAAW;QACnB,MAAMxsB,IAAShmB,KAAKgmB,OAAO+F;QAC3B,OAAO/rB,KAAKuyC,GAAcvsB,GAAQ,CAACxlB,GAAKrD,GAAOk/B,MAOtCA,EAAQnsB;;IAuBnBvR,GACE8zC,GACAziB;QAEA,IAAIjE;QACCiE,IAIHjE,IAAU0mB,KAHV1mB,IAAU,IACViE,IAAWyiB;QAIb,MAAMzsB,IAAShmB,KAAKgmB,OAAO+F;QAC3B,OAAO/rB,KAAKuyC,GAAcvsB,GAAQgK;;;;;;;;;WAWpCrxB,GACEqxB;QAEA,MAAM0iB,IAAgB1yC,KAAKgmB,OAAO;QAClC,OAAO,IAAI+J,GAAmB,CAACU,GAASC;YACtCgiB,EAAcjD,UAAW9M;gBACvB,MAAMzlC,IAAQ80C,GACXrP,EAAM76B,OAA4B;gBAErC4oB,EAAOxzB;eAETw1C,EAAcnD,YAAa5M;gBACzB,MAAM3c,IAA8B2c,EAAM76B,OAAsB2E;gBAC3DuZ,IAKLgK,EAAShK,EAAO2sB,YAAuB3sB,EAAO7oB,OAAOqJ,KACnDosC;oBACMA,IACF5sB,EAAO6sB,aAEPpiB;qBATJA;;;;IAiBA9xB,GACN+zC,GACA5xC;QAEA,MAAM+uB,IAA2C;QACjD,OAAO,IAAIE,GAAmB,CAACU,GAASC;YACtCgiB,EAAcjD,UAAW9M;gBACvBjS,EAAQiS,EAAM76B,OAAsB5K;eAEtCw1C,EAAcnD,YAAa5M;gBACzB,MAAM3c,IAA8B2c,EAAM76B,OAAsB2E;gBAChE,KAAKuZ,GAEH,YADAyK;gBAGF,MAAMqiB,IAAa,IAAIvB,GAAoBvrB,IACrC+sB,IAAajyC,EACjBklB,EAAO2sB,YACP3sB,EAAO7oB,OACP21C;gBAEF,IAAIC,aAAsBhjB,IAAoB;oBAC5C,MAAMijB,IAAwCD,EAAW7Q,MACvDlR,MACE8hB,EAAW/hB,QACJhB,GAAmBW,OAAOM;oBAGrCnB,EAAQpuB,KAAKuxC;;gBAEXF,EAAW7iB,KACbQ,MACkC,SAAzBqiB,EAAWG,KACpBjtB,EAAO6sB,aAEP7sB,EAAO6sB,SAASC,EAAWG;;WAG9BzsC,KAAK,MACCupB,GAAmBuB,GAAQzB;;IAI9BlxB,QACN2zC,GACAvkC;QAEA,IAAImlC,SAAgC5xC;QAYpC,YAXqBA,MAAjBgxC,MAC0B,mBAAjBA,IACTY,IAAYZ,IAMZvkC,IAAQukC,IAGL;YAAE/yC,OAAO2zC;YAAWnlC,OAAAA;;;IAGrBpP,OAAOotB;QACb,IAAIxH,IAAgC;QAIpC,IAHIwH,EAAQoR,YACV5Y,IAAY,SAEVwH,EAAQxsB,OAAO;YACjB,MAAMA,IAAQS,KAAK24B,MAAMp5B,MAAMwsB,EAAQxsB;YACvC,OAAIwsB,EAAQymB,KACHjzC,EAAM4zC,cAAcpnB,EAAQhe,OAAOwW,KAEnChlB,EAAM6zC,WAAWrnB,EAAQhe,OAAOwW;;QAGzC,OAAOvkB,KAAK24B,MAAMya,WAAWrnB,EAAQhe,OAAOwW;;;;;;;GASlD,UAASurB,GAAeV;IACtB,OAAO,IAAIrf,GAAsB,CAACU,GAASC;QACzC0e,EAAQG,YAAa5M;YACnB,MAAMl2B,IAAUk2B,EAAM76B,OAAsB2E;YAC5CgkB,EAAQhkB;WAGV2iC,EAAQK,UAAW9M;YACjB,MAAMzlC,IAAQ80C,GACXrP,EAAM76B,OAA4B;YAErC4oB,EAAOxzB;;;;;0CAMb;IAAIm2C,MAAmB;;AACvB,SAASrB,GAA0B90C;IACjC,MAAMgzC,IAAahP,GAAS+N,GAAcC;IAC1C,IAAIgB,KAAc,QAAQA,IAAa,IAAI;QACzC,MAAMoD,IACJ;QACF,IAAIp2C,EAAMO,QAAQkI,QAAQ2tC,MAAc,GAAG;;YAEzC,MAAMC,IAAW,IAAItwC,EACnB,YACA,6CAA6CqwC,wBAC3C;YAWJ,OARKD,OACHA,MAAmB;;;YAGnBG,WAAW;gBACT,MAAMD;eACL,KAEEA;;;IAGX,OAAOr2C;;;;;;;;;;;;;;;;;;;iFCpyBOu2C;;;IAGd,OAAyB,sBAAX/S,SAAyBA,SAAS;;;;;;;;;;;;;;;MCwErCgT;IAOX/0C,YACmBg1C,GACR9d,GACA+d,GACQjrC,GACAkrC;kBAJAF,aACR9d,aACA+d,GACQ5zC,UAAA2I,aACAkrC,GAPnB7zC,UAA4B,IAAIy1B;QAmFhCz1B,YAAOA,KAAK8zC,GAASpe,QAAQ4L,KAAKyS,KAAK/zC,KAAK8zC,GAASpe;;;;QAvEnD11B,KAAK8zC,GAASpe,QAAQwM,MAAMlR;;;;;;;;;;;;;;;WAiB9BryB,UACEg1C,GACA9d,GACAme,GACArrC,GACAkrC;QAEA,MAAMI,IAAavwC,KAAKC,QAAQqwC,GAC1BE,IAAY,IAAIR,GACpBC,GACA9d,GACAoe,GACAtrC,GACAkrC;QAGF,OADAK,EAAU9lC,MAAM4lC,IACTE;;;;;WAODv1C,MAAMq1C;QACZh0C,KAAKm0C,KAAcX,WAAW,MAAMxzC,KAAKo0C,MAAsBJ;;;;;WAOjEr1C;QACE,OAAOqB,KAAKo0C;;;;;;;;WAUdz1C,OAAOwjC;QACoB,SAArBniC,KAAKm0C,OACPn0C,KAAKq0C,gBACLr0C,KAAK8zC,GAASpjB,OACZ,IAAIztB,EACFlB,EAAKE,WACL,yBAAyBkgC,IAAS,OAAOA,IAAS;;IAQlDxjC;QACNqB,KAAK2zC,GAAW7Q,GAAiB,MACN,SAArB9iC,KAAKm0C,MACPn0C,KAAKq0C,gBACEr0C,KAAK2I,KAAK24B,KAAK70B,KACbzM,KAAK8zC,GAASrjB,QAAQhkB,OAGxBkkB,QAAQF;;IAKb9xB;QACmB,SAArBqB,KAAKm0C,OACPn0C,KAAK6zC,GAAgB7zC,OACrBq0C,aAAar0C,KAAKm0C,KAClBn0C,KAAKm0C,KAAc;;;;MAKZG;IAkCX31C;;QAhCAqB,UAAiC2wB,QAAQF;;;QAIzCzwB,UAAmD;;;QAInDA,WAAmC;;;QAInCA,UAA8D;;QAG9DA,UAAwB;;;QAIxBA,WAA8B;;QAG9BA,UAAoC;;QAGpCA,UAAkB,IAAI21B,GAAmB31B;;;;QAKzCA,UAA4B,MAAYA,KAAKu0C,GAAQC;QAGnD,MAAM9T,IAAS+S;QACX/S,KAA6C,qBAA5BA,EAAOkG,oBAC1BlG,EAAOkG,iBAAiB,oBAAoB5mC,KAAKy0C;;;;IAMrDC;QACE,OAAO10C,KAAK20C;;;;;WAOdh2C,GAAoCgK;;QAElC3I,KAAK40C,QAAQjsC;;;;;WAOfhK,GACEgK;QAEA3I,KAAK60C;;QAEL70C,KAAK80C,GAAgBnsC;;;;;WAOfhK,GACNgK;QAGA,OADA3I,KAAK60C,MACE70C,KAAK80C,GAAgBnsC;;;;;;;;WAU9BhK,SAAiCgK;QAE/B,IADA3I,KAAK60C,OACA70C,KAAK20C,IAAiB;YACzB30C,KAAK20C,MAAkB;YACvB,MAAMjU,IAAS+S;YACX/S,KACFA,EAAOqG,oBAAoB,oBAAoB/mC,KAAKy0C,WAEhDz0C,KAAK+0C,GAAyBpsC;;;;;;WAQxChK,QAA2BgK;QAEzB,OADA3I,KAAK60C,MACD70C,KAAK20C,KAEA,IAAIhkB,QAAWF,WAEjBzwB,KAAK80C,GAAgBnsC;;;;;;;;;WAW9BhK,GAAiBgK;QACf3I,KAAKg1C,GAAavzC,KAAKkH,IACvB3I,KAAK8iC,GAAiB,MAAM9iC,KAAKi1C;;;;;WAO3Bt2C;QACN,IAAiC,MAA7BqB,KAAKg1C,GAAal2C,QAAtB;YAIA;sBACQkB,KAAKg1C,GAAa,MACxBh1C,KAAKg1C,GAAaE,SAClBl1C,KAAKu0C,GAAQte;cACb,OAAO34B;gBACP,KAAIkmC,GAA4BlmC,IAG9B,MAAMA;;gCAFNf,EA/TQ,cA+TU,4CAA4Ce;;YAM9D0C,KAAKg1C,GAAal2C,SAAS;;;;;;;;;;;YAW7BkB,KAAKu0C,GAAQY,GAAc,MAAMn1C,KAAKi1C;;;IAIlCt2C,GAAmCgK;QACzC,MAAMysC,IAAUp1C,KAAKq1C,GAAK/T,KAAK,OAC7BthC,KAAKs1C,MAAsB,GACpB3sC,IACJu5B,MAAOhlC;;;;YASN,MARA8C,KAAKxC,KAAUN,GACf8C,KAAKs1C,MAAsB,GAE3Bt4C,EAAS;;;;;;YA+JnB,SAA2BE;gBACzB,IAAIO,IAAUP,EAAMO,WAAW;gBAC3BP,EAAMq4C,UAEN93C,IADEP,EAAMq4C,MAAMC,SAASt4C,EAAMO,WACnBP,EAAMq4C,QAENr4C,EAAMO,UAAU,OAAOP,EAAMq4C;gBAG3C,OAAO93C;;;;;;;;;;;;;;;;;GAzKiBg4C,EAAkBv4C,KAM5BA;WAEPokC,KAAK70B,MACJzM,KAAKs1C,MAAsB,GACpB7oC;QAIb,OADAzM,KAAKq1C,KAAOD,GACLA;;;;;;WAQTz2C,GACEk3B,GACAme,GACArrC;QAEA3I,KAAK60C;;QAQD70C,KAAK01C,GAAe/vC,QAAQkwB,MAAY,MAC1Cme,IAAU;QAGZ,MAAME,IAAYR,GAAiBiC,GACjC31C,MACA61B,GACAme,GACArrC,GACAitC,KACE51C,KAAK61C,GAAuBD;QAGhC,OADA51C,KAAK81C,GAAkBr0C,KAAKyyC,IACrBA;;IAGDv1C;QACFqB,KAAKxC,MACPD;;;;;;;WAUJoB;;;;WAWAA;;;;;QAKE,IAAIo3C;QACJ;YACEA,IAAc/1C,KAAKq1C,UACbU;iBACCA,MAAgB/1C,KAAKq1C;;;;;WAOhC12C,GAAyBk3B;QACvB,KAAK,MAAMltB,KAAM3I,KAAK81C,IACpB,IAAIntC,EAAGktB,OAAYA,GACjB,QAAO;QAGX,QAAO;;;;;;;;WAUTl3B,GAA6Bq3C;;QAE3B,OAAOh2C,KAAKi2C,KAAQ3U,KAAK;;YAEvBthC,KAAK81C,GAAkBr7B,KAAK,CAACy7B,GAAGC,MAAMD,EAAEtC,KAAeuC,EAAEvC;YAEzD,KAAK,MAAMjrC,KAAM3I,KAAK81C,IAEpB,IADAntC,EAAGguB,0BACCqf,KAA+BrtC,EAAGktB,OAAYmgB,GAChD;YAIJ,OAAOh2C,KAAKi2C;;;;;WAOhBt3C,GAAqBk3B;QACnB71B,KAAK01C,GAAej0C,KAAKo0B;;iEAInBl3B,GAAuBgK;;QAE7B,MAAMpJ,IAAQS,KAAK81C,GAAkBnwC,QAAQgD;QAE7C3I,KAAK81C,GAAkBp0C,OAAOnC,GAAO;;;;;;;aAQzB62C,GACd94C,GACAd;IAGA,IADAQ,EA9ec,cA8eI,GAAGR,MAAQc,MACzBkmC,GAA4BlmC,IAC9B,OAAO,IAAI2F,EAAelB,EAAKgB,aAAa,GAAGvG,MAAQc;IAEvD,MAAMA;;;ACzaV,SAAS+4C,IACNC,GAAWC,KACXC,GAAWC;IAEZ,MAAMC,IAASz3C,EAAoBq3C,GAAWE;IAC9C,OAAe,MAAXE,IAGKz3C,EAAoBs3C,GAAQE,KAE5BC;;;;;;;GASX,OAAMC;IAOJh4C,YAA6Bi4C;kBAAAA,GANrB52C,cAAiC,IAAI2N,GAC3C0oC,KAGFr2C,UAAwB;;IAIhBrB;QACN,SAASqB,KAAK62C;;IAGhBl4C,GAAW8L;QACT,MAAM6tB,IAAqB,EAAC7tB,GAAgBzK,KAAK82C;QACjD,IAAI92C,KAAKoK,OAAOpF,OAAOhF,KAAK42C,IAC1B52C,KAAKoK,SAASpK,KAAKoK,OAAOoE,IAAI8pB,SACzB;YACL,MAAMye,IAAe/2C,KAAKoK,OAAO4xB;YAC7Bqa,GAAsB/d,GAAOye,KAAgB,MAC/C/2C,KAAKoK,SAASpK,KAAKoK,OAAO8F,OAAO6mC,GAAcvoC,IAAI8pB;;;IAKzD0e;;;;;;;QAOE,OAAOh3C,KAAKoK,OAAO4xB,OAAQ;;;;AAiB/B,MAAMib,KAA6B;IACjCC,KAAQ;IACRC,IAA0B;IAC1BC,IAAgB;IAChBC,IAAkB;;;MAGPC;IA2BX34C;;;IAGW44C;;IAEAC;;;IAGAC;kBALAF,aAEAC,aAGAC;;IA5BX94C,UAAqB+4C;QACnB,OAAO,IAAIJ,GACTI,GACAJ,GAAUK,IACVL,GAAUM;;;;AAVdN,SAAuC,GACvCA,QAA2C,SAC3CA,QAA2C,UAC3CA,QAAwD,IACxDA,QAAkE,KAUlEA,QAAqC,IAAIA,GACvCA,GAAUO,IACVP,GAAUK,IACVL,GAAUM;AAGZN,QAAsC,IAAIA,GACxCA,GAAUQ,IACV,GACA;;;;;;MAwBSC;IAIXp5C,YACmB2oC,GACAqM;kBADArM,aACAqM,GALnB3zC,WAA0B,GAOxBA,KAAKg4C,KAAS;;IAGhBr5C,MAAMs5C;QAMFj4C,KAAKsnC,GAAiBD,OAAOkQ,OAC7BD,GAAUQ,MAEV93C,KAAKk4C,GAAWD;;IAIpBt5C;QACMqB,KAAKg4C,OACPh4C,KAAKg4C,GAAO7hB,UACZn2B,KAAKg4C,KAAS;;IAIlBpS;QACE,OAAuB,SAAhB5lC,KAAKg4C;;IAGNr5C,GAAWs5C;QAKjB,MAAME,IAAQn4C,KAAKo4C,KA9CK,MAFA;QAiDxB77C,EACE,uBACA,mCAAmC47C,QAErCn4C,KAAKg4C,KAASh4C,KAAK2zC,GAAWjd,yDAE5ByhB,GACA7V;YACEtiC,KAAKg4C,KAAS,MACdh4C,KAAKo4C,MAAS;YACd;sBACQH,EAAWI,GAAer4C,KAAKsnC;cACrC,OAAOhqC;gBACHkmC,GAA4BlmC,KAC9Bf,EAlPI,uBAoPF,wDACAe,WAGIg7C,GAAyBh7C;;kBAG7B0C,KAAKk4C,GAAWD;;;;;8DAOjB1Q;IACX5oC,YACmB45C,GACRlR;kBADQkR,GACRv4C,cAAAqnC;;iGAIX1oC,GACE45B,GACAigB;QAEA,OAAOx4C,KAAKu4C,GAASE,GAAuBlgB,GAAK/xB,KAAKw4B,KAC7CzgC,KAAKC,MAAOg6C,IAAa,MAASxZ;;oFAK7CrgC,GACE45B,GACA3rB;QAEA,IAAU,MAANA,GACF,OAAOmjB,GAAmBU,QAAQuE,GAAesR;QAGnD,MAAMl8B,IAAS,IAAIusC,GAA4B/pC;QAC/C,OAAO5M,KAAKu4C,GACTlkC,GAAckkB,GAAKzwB,KAAUsC,EAAOsuC,GAAW5wC,EAAO2C,iBACtDjE,KAAK,MACGxG,KAAKu4C,GAASzQ,GACnBvP,GACA9tB,KAAkBL,EAAOsuC,GAAWjuC,KAGvCjE,KAAK,MAAM4D,EAAO4sC;;;;;WAOvBr4C,GACE45B,GACA6G,GACAC;QAEA,OAAOr/B,KAAKu4C,GAAStQ,GAAc1P,GAAK6G,GAAYC;;;;;WAOtD1gC,GACE45B,GACA6G;QAEA,OAAOp/B,KAAKu4C,GAASI,GAAwBpgB,GAAK6G;;IAGpDzgC,GACE45B,GACA8G;QAEA,OACEr/B,KAAKqnC,OAAOkQ,OAAiCD,GAAUQ,MAEvDv7C,EAAS,uBAAuB;QACzBwzB,GAAmBU,QAAQwmB,OAG7Bj3C,KAAK44C,GAAargB,GAAK/xB,KAAKkxC,KAC7BA,IAAY13C,KAAKqnC,OAAOkQ,MAC1Bh7C,EACE,uBACA,0CAA0Cm7C,OACxC,2BAA2B13C,KAAKqnC,OAAOkQ;QAEpCN,MAEAj3C,KAAK64C,GAAqBtgB,GAAK8G;;IAK5C1gC,GAAa45B;QACX,OAAOv4B,KAAKu4C,GAASK,GAAargB;;IAG5B55B,GACN45B,GACA8G;QAEA,IAAIyZ,GACAC,GAAkCC,GAElCC,GACFC,GACAC,GACAC;QACF,MAAMC,IAAU31C,KAAKC;QACrB,OAAO3D,KAAKs5C,GAAqB/gB,GAAKv4B,KAAKqnC,OAAOmQ,IAC/ChxC,KAAK+yC;;QAEAA,IAAkBv5C,KAAKqnC,OAAOoQ,MAChCl7C,EACE,uBACA,8CACE,qBAAqByD,KAAKqnC,OAAOoQ,QACjC,QAAQ8B;QAEZR,IAA2B/4C,KAAKqnC,OAC7BoQ,MAEHsB,IAA2BQ,GAE7BN,IAAmBv1C,KAAKC,OAEjB3D,KAAKw5C,GAAkBjhB,GAAKwgB,KAEpCvyC,KAAK44B,MACJ0Z,IAA2B1Z,GAC3B8Z,IAAoBx1C,KAAKC;QAElB3D,KAAKioC,GACV1P,GACAugB,GACAzZ,KAGH74B,KAAKizC,MACJT,IAAiBS,GACjBN,IAAmBz1C,KAAKC,OAEjB3D,KAAK24C,GAAwBpgB,GAAKugB,KAE1CtyC,KAAKkzC;YAGJ,IAFAN,IAAqB11C,KAAKC,OAEtBtH,OAAiBK,EAASC,OAAO;gBAWnCJ,EAAS,uBATP,6BACA,wBAAwB08C,IAAmBI,UAC3C,oCAAoCN,UACpC,GAAGG,IAAoBD,UACvB,aAAaD,kBACb,GAAGG,IAAmBD,UACtB,aAAaQ,oBACb,GAAGN,IAAqBD,UACxB,mBAAmBC,IAAqBC;;YAI5C,OAAOtpB,GAAmBU,QAAoB;gBAC5CymB,KAAQ;gBACRC,IAA0B4B;gBAC1B3B,IAAA4B;gBACA3B,IAAAqC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACrKV,MAAMC;IAoDJh7C;;IAEYi7C,GACFC,GACRC;QAFU95C,mBAAA45C,aACFC;;;;;;;QArBV75C,UAA+B,IAAImL,GACjClM;;;QAKFe,UAA2B,IAAIgB,EAC7B+4C,KAAKlyC,EAAekyC,IACpBlxC;;;;;;QAQF7I,UAAuCmE,EAAgBkB,OAYrDrF,KAAKyyB,KAAgBmnB,EAAYI,GAAiBF,IAClD95C,KAAKi6C,KAAkBL,EAAYnR,MACnCzoC,KAAK+gC,KAAc6Y,EAAYlS,MAC/B1nC,KAAKk6C,KAAiB,IAAI3nB,GACxBvyB,KAAKi6C,IACLj6C,KAAKyyB,IACLzyB,KAAK45C,YAAYO;QAEnBn6C,KAAK65C,GAAYO,GAAsBp6C,KAAKk6C;;IAG9Cv7C;QACE,OAAOgyB,QAAQF;;IAGjB9xB,SAAuBknC;QACrB,IAAIwU,IAAmBr6C,KAAKyyB,IACxB6nB,IAAoBt6C,KAAKk6C;QAE7B,MAAMztC,UAAezM,KAAK45C,YAAY9X,eACpC,sBACA,YACAvJ;;;YAGE,IAAIgiB;YACJ,OAAOv6C,KAAKyyB,GACT+nB,GAAsBjiB,GACtB/xB,KAAKi0C,MACJF,IAAaE,GAEbJ,IAAmBr6C,KAAK45C,YAAYI,GAAiBnU;;;YAIrDyU,IAAoB,IAAI/nB,GACtBvyB,KAAKi6C,IACLI,GACAr6C,KAAK45C,YAAYO,OAEZE,EAAiBG,GAAsBjiB,KAE/C/xB,KAAKk0C;gBACJ,MAAMC,IAA6B,IAC7BC,IAA2B;;gBAGjC,IAAIC,IAAcxrC;gBAElB,KAAK,MAAMqgB,KAAS6qB,GAAY;oBAC9BI,EAAgBl5C,KAAKiuB,EAAMZ;oBAC3B,KAAK,MAAMzO,KAAYqP,EAAMV,WAC3B6rB,IAAcA,EAAYrsC,IAAI6R,EAAS7f;;gBAI3C,KAAK,MAAMkvB,KAASgrB,GAAY;oBAC9BE,EAAcn5C,KAAKiuB,EAAMZ;oBACzB,KAAK,MAAMzO,KAAYqP,EAAMV,WAC3B6rB,IAAcA,EAAYrsC,IAAI6R,EAAS7f;;;;gCAM3C,OAAO85C,EACJQ,GAAaviB,GAAKsiB,GAClBr0C,KAAKu0C,MACG;oBACLC,IAAAD;oBACAE,IAAAN;oBACAO,IAAAN;;;;QAWd,OAJA56C,KAAKyyB,KAAgB4nB,GACrBr6C,KAAKk6C,KAAiBI,GACtBt6C,KAAK65C,GAAYO,GAAsBp6C,KAAKk6C,KAErCztC;;IAGT9N,GAAWqwB;QACT,MAAMjY,IAAiBzT,EAAUK,OAC3B2L,IAAO0f,EAAU9J,OACrB,CAAC5V,GAAMggB,MAAMhgB,EAAKd,IAAI8gB,EAAE9uB,MACxB6O;QAGF,IAAI8rC;QAEJ,OAAOn7C,KAAK45C,YACT9X,eAAe,2BAA2B,aAAavJ,KAI/Cv4B,KAAKk6C,GAAeY,GAAaviB,GAAKjpB,GAAM9I,KAAKuK;YACtDoqC,IAAepqC;;;;;;YAOf,MAAMge,IAA4B;YAElC,KAAK,MAAM1O,KAAY2O,GAAW;gBAChC,MAAM5H,IAAY6C,GAChB5J,GACA86B,EAAa35C,IAAI6e,EAAS7f;gBAEX,QAAb4mB;;;;gBAIF2H,EAActtB,KACZ,IAAIgf,GACFJ,EAAS7f,KACT4mB,GACAsE,GAAiBtE,EAAUtI,MAAe,WAC1CuD,GAAaH,QAAO;;YAM5B,OAAOliB,KAAKyyB,GAAc2oB,GACxB7iB,GACAxhB,GACAgY,GACAC;YAILsS,KAAK5R;YACJ,MAAM9e,IAAU8e,EAAM2rB,GAAwBF;YAC9C,OAAO;gBAAErsB,SAASY,EAAMZ;gBAASwsB,IAAA1qC;;;;IAIvCjS,GACEuwB;QAEA,OAAOlvB,KAAK45C,YAAY9X,eACtB,qBACA,qBACAvJ;YACE,MAAMgjB,IAAWrsB,EAAYQ,MAAMpgB,QAC7BksC,IAAiBx7C,KAAKi6C,GAAgBvR,GAAgB;gBAC1D+S,KAAe;;YAEjB,OAAOz7C,KAAK07C,GACVnjB,GACArJ,GACAssB,GAECh1C,KAAK,MAAMg1C,EAAe/xC,MAAM8uB,IAChC/xB,KAAK,MAAMxG,KAAKyyB,GAAckpB,GAAwBpjB,IACtD/xB,KAAK,MAAMxG,KAAKk6C,GAAeY,GAAaviB,GAAKgjB;;;IAK1D58C,GAAYmwB;QACV,OAAO9uB,KAAK45C,YAAY9X,eACtB,gBACA,qBACAvJ;YACE,IAAIqjB;YACJ,OAAO57C,KAAKyyB,GACT2X,GAAoB7R,GAAKzJ,GACzBtoB,KAAMkpB,MAxdR/xB,EAydwB,SAAV+xB,IACXksB,IAAelsB,EAAMpgB,QACdtP,KAAKyyB,GAAc0Y,GAAoB5S,GAAK7I,KAEpDlpB,KAAK,MACGxG,KAAKyyB,GAAckpB,GAAwBpjB,IAEnD/xB,KAAK,MACGxG,KAAKk6C,GAAeY,GAAaviB,GAAKqjB;;;IAMvDj9C;QACE,OAAOqB,KAAK45C,YAAY9X,eACtB,uCACA,YACAvJ,KACSv4B,KAAKyyB,GAAcopB,GAAgCtjB;;IAKhE55B;QACE,OAAOqB,KAAK45C,YAAY9X,eACtB,oCACA,YACAvJ,KAAOv4B,KAAK+gC,GAAY+a,GAA6BvjB;;IAIzD55B,GAAiBoX;QACf,MAAMgmC,IAAgBhmC,EAAYrL;QAClC,IAAIsxC,IAA2Bh8C,KAAKi8C;QAEpC,OAAOj8C,KAAK45C,YACT9X,eAAe,sBAAsB,qBAAqBvJ;YACzD,MAAMijB,IAAiBx7C,KAAKi6C,GAAgBvR,GAAgB;gBAC1D+S,KAAe;;;wBAIjBO,IAA2Bh8C,KAAKi8C;YAEhC,MAAM5qB,IAAW;YACjBtb,EAAYnE,GAAc/Q,QAAQ,CAAC2P,GAAQjG;gBACzC,MAAM2xC,IAAgBF,EAAyBx6C,IAAI+I;gBACnD,KAAK2xC,GACH;;;;gCAMF7qB,EAAS5vB,KACPzB,KAAK+gC,GACFob,GAAmB5jB,GAAK/nB,EAAO6B,IAAkB9H,GACjD/D,KAAK,MACGxG,KAAK+gC,GAAYqb,GACtB7jB,GACA/nB,EAAO2B,IACP5H;gBAKR,MAAMK,IAAc4F,EAAO5F;;gCAE3B,IAAIA,EAAY6I,MAAwB,GAAG;oBACzC,MAAM4oC,IAAgBH,EACnBI,GAAgB1xC,GAAamxC,GAC7BlT,EAAmBtQ,EAAI+H;oBAC1B0b,IAA2BA,EAAyBzwC,GAClDhB,GACA8xC;;;oBAMA1C,GAAe4C,GACbL,GACAG,GACA7rC,MAGF6gB,EAAS5vB,KACPzB,KAAK+gC,GAAY+H,GAAiBvQ,GAAK8jB;;;YAM/C,IAAIvf,IAAc/tB,MACdytC,IAAcntC;;;;;YAiElB,IAhEA0G,EAAYjE,GAAgBjR,QAAQ,CAACL,GAAKyP;gBACxCusC,IAAcA,EAAYhuC,IAAIhO;;;;YAKhC6wB,EAAS5vB,KACP+5C,EAAevoB,WAAWsF,GAAKikB,GAAah2C,KAAK20C;gBAC/CplC,EAAYjE,GAAgBjR,QAAQ,CAACL,GAAKyP;oBACxC,MAAMwsC,IAActB,EAAa35C,IAAIhB;;;;;wCAOnCyP,aAAeiE,MACfjE,EAAI4N,QAAQvZ,QAAQH,EAAgBkB;;;;oBAKpCm2C,EAAe3d,GAAYr9B,GAAKu7C,IAChCjf,IAAcA,EAAYvxB,GAAO/K,GAAKyP,MAEvB,QAAfwsC,KACAxsC,EAAI4N,QAAQnE,EAAU+iC,EAAY5+B,WAAW,KACG,MAA/C5N,EAAI4N,QAAQnE,EAAU+iC,EAAY5+B,YACjC4+B,EAAYjrC,oBAMdgqC,EAAe7d,GAAS1tB,GAAK8rC;oBAC7Bjf,IAAcA,EAAYvxB,GAAO/K,GAAKyP,MAEtC1T,EApkBA,cAskBE,uCACAiE,GACA,sBACAi8C,EAAY5+B,SACZ,mBACA5N,EAAI4N;oBAIJ9H,EAAYhE,GAAuBxD,IAAI/N,MACzC6wB,EAAS5vB,KACPzB,KAAK45C,YAAYrb,GAAkBme,GACjCnkB,GACA/3B;;kBAYPu7C,EAAcz3C,QAAQH,EAAgBkB,QAAQ;gBACjD,MAAMs3C,IAAsB38C,KAAK+gC,GAC9B+a,GAA6BvjB,GAC7B/xB,KAAKo4B,KAQG5+B,KAAK+gC,GAAY6b,GACtBrkB,GACAA,EAAI+H,IACJyb;gBAGN1qB,EAAS5vB,KAAKk7C;;YAGhB,OAAO5sB,GAAmBuB,GAAQD,GAC/B7qB,KAAK,MAAMg1C,EAAe/xC,MAAM8uB,IAChC/xB,KAAK,MACGxG,KAAKk6C,GAAehnB,GACzBqF,GACAuE;WAIPwE,KAAKxE,MACJ98B,KAAKi8C,KAAqBD,GACnBlf;;;;;;;;;;;;WAeLn+B,UACNu9C,GACAG,GACA7rC;;QAQA,IANA7S,EACE0+C,EAAczxC,YAAY6I,MAAwB,IAKI,MAApDyoC,EAActxC,YAAY6I,KAC5B,QAAO;;;;;;gBAWT,OAFE4oC,EAAc3xC,EAAgBmyC,MAC9BX,EAAcxxC,EAAgBmyC,OACf78C,KAAK88C,MAUpBtsC,EAAO2B,GAAenN,OACtBwL,EAAO4B,GAAkBpN,OACzBwL,EAAO6B,GAAiBrN,OACT;;;;;;;IAGnBrG,SAA6Bo+C;QAC3B;kBACQ/8C,KAAK45C,YAAY9X,eACrB,0BACA,aACAvJ,KACSxI,GAAmBlvB,QACxBk8C,GACCC,KACQjtB,GAAmBlvB,QACxBm8C,EAAWnoB,IACVr0B,KACCR,KAAK45C,YAAYrb,GAAkBwB,GACjCxH,GACAykB,EAAWzyC,UACX/J,IAEJgG,KAAK,MACLupB,GAAmBlvB,QACjBm8C,EAAWloB,IACVt0B,KACCR,KAAK45C,YAAYrb,GAAkByB,GACjCzH,GACAykB,EAAWzyC,UACX/J;UAQhB,OAAOlD;YACP,KAAIkmC,GAA4BlmC,IAO9B,MAAMA;;;;;YAFNf,EA1tBQ,cA0tBU,wCAAwCe;;QAM9D,KAAK,MAAM0/C,KAAcD,GAAa;YACpC,MAAMxyC,IAAWyyC,EAAWzyC;YAE5B,KAAKyyC,EAAW7rC,WAAW;gBACzB,MAAMgE,IAAanV,KAAKi8C,GAAmBz6C,IAAI+I,IAOzCI,IAA+BwK,EAAWzK,GAC1CuyC,IAAoB9nC,EAAW+nC,GACnCvyC;;gCAEF3K,KAAKi8C,KAAqBj8C,KAAKi8C,GAAmB1wC,GAChDhB,GACA0yC;;;;IAMRt+C,GAAkBw+C;QAChB,OAAOn9C,KAAK45C,YAAY9X,eACtB,2BACA,YACAvJ,WACuBj3B,MAAjB67C,MACFA,KvBhyBqB;QuBkyBhBn9C,KAAKyyB,GAAc2qB,GACxB7kB,GACA4kB;;IAMRx+C,GAAa6B;QACX,OAAOR,KAAK45C,YAAY9X,eAAe,iBAAiB,YAAYvJ,KAC3Dv4B,KAAKk6C,GAAetmB,GAAY2E,GAAK/3B;;IAIhD7B,GAAemJ;QACb,OAAO9H,KAAK45C,YACT9X,eAAe,mBAAmB,aAAavJ;YAC9C,IAAIpjB;YACJ,OAAOnV,KAAK+gC,GACTsc,GAAc9kB,GAAKzwB,GACnBtB,KAAM82C,KACDA;;;;YAIFnoC,IAAamoC,GACNvtB,GAAmBU,QAAQtb,MAE3BnV,KAAK+gC,GAAYwc,GAAiBhlB,GAAK/xB,KAAK+D,MACjD4K,IAAa,IAAI7K,GACfxC,GACAyC,oBAEAguB,EAAI+H;YAECtgC,KAAK+gC,GACTyc,GAAcjlB,GAAKpjB,GACnB3O,KAAK,MAAM2O;WAKvBmsB,KAAKnsB;;;YAGJ,MAAMsoC,IAAmBz9C,KAAKi8C,GAAmBz6C,IAC/C2T,EAAW5K;YAcb,QAXuB,SAArBkzC,KACAtoC,EAAWzK,EAAgBgP,EACzB+jC,EAAiB/yC,KACf,OAEJ1K,KAAKi8C,KAAqBj8C,KAAKi8C,GAAmB1wC,GAChD4J,EAAW5K,UACX4K,IAEFnV,KAAK09C,GAAiBnuC,IAAIzH,GAAQqN,EAAW5K;YAExC4K;;;IAIbxW,GACEgzB,GACA7pB;QAEA,MAAMyC,IAAWvK,KAAK09C,GAAiBl8C,IAAIsG;QAC3C,YAAiBxG,MAAbiJ,IACKwlB,GAAmBU,QACxBzwB,KAAKi8C,GAAmBz6C,IAAI+I,MAGvBvK,KAAK+gC,GAAYsc,GAAc1rB,GAAa7pB;;IAIvDnJ,SACE4L,GACAozC;QAEA,MAAMxoC,IAAanV,KAAKi8C,GAAmBz6C,IAAI+I,IAMzCy7B,IAAO2X,IAA0B,cAAc;QAErD;YACOA,WACG39C,KAAK45C,YAAY9X,eAAe,kBAAkBkE,GAAMzN,KACrDv4B,KAAK45C,YAAYrb,GAAkB1pB,aACxC0jB;UAKN,OAAOj7B;YACP,KAAIkmC,GAA4BlmC,IAW9B,MAAMA;;;;;;YALNf,EAz2BQ,cA22BN,gDAAgDgO,MAAajN;;QAOnE0C,KAAKi8C,KAAqBj8C,KAAKi8C,GAAmBvwC,OAAOnB,IACzDvK,KAAK09C,GAAiBxtC,OAAOiF,EAAYrN;;IAG3CnJ,GACEmS,GACA8sC;QAEA,IAAIjzC,IAA+BxG,EAAgBkB,OAC/Cw4C,IAAaxuC;QAEjB,OAAOrP,KAAK45C,YAAY9X,eAAe,iBAAiB,YAAYvJ,KAC3Dv4B,KAAKq9C,GAAc9kB,GAAKznB,EAAM8U,MAClCpf,KAAK2O;YACJ,IAAIA,GAGF,OAFAxK,IACEwK,EAAWxK,8BACN3K,KAAK+gC,GACT+c,GAA2BvlB,GAAKpjB,EAAW5K,UAC3C/D,KAAKiG;gBACJoxC,IAAapxC;;WAIpBjG,KAAK,MACJxG,KAAK65C,GAAY3lB,GACfqE,GACAznB,GACA8sC,IACIjzC,IACAxG,EAAgBkB,OACpBu4C,IAAqBC,IAAaxuC,OAGrC7I,KAAK8K,MACG;YAAEA,WAAAA;YAAWysC,IAAAF;;;IAKpBl/C,GACN45B,GACArJ,GACAssB;QAEA,MAAM9rB,IAAQR,EAAYQ,OACpBsuB,IAAUtuB,EAAMpgB;QACtB,IAAI2uC,IAAeluB,GAAmBU;QAiCtC,OAhCAutB,EAAQn9C,QAAQouB;YACdgvB,IAAeA,EACZz3C,KAAK,MACGg1C,EAAezoB,GAASwF,GAAKtJ,IAErCzoB,KAAMwyB;gBACL,IAAI/oB,IAAM+oB;gBACV,MAAMklB,IAAahvB,EAAYU,GAAYpuB,IAAIytB;gBAn8BhDtxB,EAq8BkB,SAAfugD,MAGGjuC,KAAOA,EAAI4N,QAAQnE,OAAyB,OAC/CzJ,IAAMyf,EAAMyuB,GAAsBlvB,GAAQhf,GAAKif,IAC1Cjf;;;;gBAaHurC,EAAe7d,GAAS1tB,GAAKif,EAAYS;;YAK5CsuB,EAAaz3C,KAAK,MACvBxG,KAAKyyB,GAAc0Y,GAAoB5S,GAAK7I;;IAIhD/wB,GAAe2oC;QACb,OAAOtnC,KAAK45C,YAAY9X,eACtB,mBACA,qBACAvJ,KAAO+O,EAAiB8W,GAAQ7lB,GAAKv4B,KAAKi8C;;;;;;;;;;aAKhCoC;;AAEdzE,GACAC,GACAC;IAEA,OAAO,IAAIH,GAAeC,GAAaC,GAAaC;;;;;;;;;;;;0BA5vBpDH;QAAsD;;AAyyBxD,MAAM2E,WAA+B3E;IAMnCh7C,YACYi7C,GACVC,GACAC;QAEA32C,MAAMy2C,GAAaC,GAAaC,IAJtB95C,mBAAA45C,GAMV55C,KAAKyyB,KAAgBmnB,EAAYI,GAAiBF,IAClD95C,KAAKi6C,KAAkBL,EAAYnR,MACnCzoC,KAAK+gC,KAAc6Y,EAAYlS;;qCAIjC/oC;QACE,OAAOqB,KAAKu+C;;IAGd5/C,GAAwBmwB;QACtB,OAAO9uB,KAAK45C,YAAY9X,eACtB,6BACA,YACAvJ,KACSv4B,KAAKyyB,GACT+rB,GAAmBjmB,GAAKzJ,GACxBtoB,KAAK8I,KACAA,IACKtP,KAAKk6C,GAAeY,GACzBviB,GACAjpB,KAGKygB,GAAmBU,QAAiC;;IAOvE9xB,GAAkCmwB;QAChC9uB,KAAKyyB,GAAc2Y,GAAyBtc;;IAG9CnwB,GAAkBkkC;QAChB7iC,KAAK45C,YAAY6E,GAAkB5b;;IAGrClkC;QACE,OAAOqB,KAAK45C,YAAY8E;;IAG1B//C,GAAU4L;QACR,MAAMkzC,IAAmBz9C,KAAKi8C,GAAmBz6C,IAAI+I;QAErD,OAAIkzC,IACK9sB,QAAQF,QAAQgtB,EAAiB31C,UAEjC9H,KAAK45C,YAAY9X,eACtB,mBACA,YACAvJ,KACSv4B,KAAK+gC,GACTtqB,GAAuB8hB,GAAKhuB,GAC5B/D,KAAK2O,KAAeA,IAAaA,EAAWrN,SAAS;;IAMhEnJ;QACE,OAAOqB,KAAK45C,YACT9X,eAAe,4BAA4B,YAAYvJ,KACtDv4B,KAAKi6C,GAAgB0E,GACnBpmB,GACAv4B,KAAK4+C,KAGRtd,KAAK,EAAGpE,IAAAJ,GAAazd,UAAAA,QACpBrf,KAAK4+C,KAA6Bv/B;QAC3Byd;;IAIbn+B;QACEqB,KAAK4+C,WAAmC5+C,KAAK45C,YAAY9X,eACvD,8CACA,YACAvJ,KAAOv4B,KAAKi6C,GAAgB4E,GAAgBtmB;;;;;;;;;;;;;;AAwB3C+J,eAAegW,GACpBtnB;IAEA,IACEA,EAAI9tB,SAASnB,EAAKW,uBAClBsuB,EAAIvzB,YAAY00B,IAIhB,MAAMnB;IAFNz0B,EA9nCY,cA8nCM;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;UCjqCTuiD;IAAbngD;;QAEEqB,UAAoB,IAAI2N,GAAUoxC,GAAaC;;QAG/Ch/C,UAAuB,IAAI2N,GAAUoxC,GAAaE;;wEAGlDtgD;QACE,OAAOqB,KAAKk/C,GAAUn+C;;2EAIxBpC,GAAa6B,GAAkBW;QAC7B,MAAMg+C,IAAM,IAAIJ,GAAav+C,GAAKW;QAClCnB,KAAKk/C,KAAYl/C,KAAKk/C,GAAU1wC,IAAI2wC,IACpCn/C,KAAKo/C,KAAep/C,KAAKo/C,GAAa5wC,IAAI2wC;;0EAI5CxgD,GAAc2Q,GAAsBnO;QAClCmO,EAAKzO,QAAQL,KAAOR,KAAK+/B,GAAav/B,GAAKW;;;;;WAO7CxC,GAAgB6B,GAAkBW;QAChCnB,KAAKq/C,GAAU,IAAIN,GAAav+C,GAAKW;;IAGvCxC,GAAiB2Q,GAAsBnO;QACrCmO,EAAKzO,QAAQL,KAAOR,KAAKggC,GAAgBx/B,GAAKW;;;;;WAOhDxC,GAAsBwC;QACpB,MAAMm+C,IAAW,IAAI74C,EAAY,IAAInB,EAAa,MAC5Ci6C,IAAW,IAAIR,GAAaO,GAAUn+C,IACtCq+C,IAAS,IAAIT,GAAaO,GAAUn+C,IAAK,IACzCmO,IAAsB;QAK5B,OAJAtP,KAAKo/C,GAAaK,GAAe,EAACF,GAAUC,KAASL;YACnDn/C,KAAKq/C,GAAUF,IACf7vC,EAAK7N,KAAK09C,EAAI3+C;YAET8O;;IAGT3Q;QACEqB,KAAKk/C,GAAUr+C,QAAQs+C,KAAOn/C,KAAKq/C,GAAUF;;IAGvCxgD,GAAUwgD;QAChBn/C,KAAKk/C,KAAYl/C,KAAKk/C,GAAUhvC,OAAOivC,IACvCn/C,KAAKo/C,KAAep/C,KAAKo/C,GAAalvC,OAAOivC;;IAG/CxgD,GAAgBwC;QACd,MAAMm+C,IAAW,IAAI74C,EAAY,IAAInB,EAAa,MAC5Ci6C,IAAW,IAAIR,GAAaO,GAAUn+C,IACtCq+C,IAAS,IAAIT,GAAaO,GAAUn+C,IAAK;QAC/C,IAAImO,IAAOD;QAIX,OAHArP,KAAKo/C,GAAaK,GAAe,EAACF,GAAUC,KAASL;YACnD7vC,IAAOA,EAAKd,IAAI2wC,EAAI3+C;YAEf8O;;IAGT3Q,GAAY6B;QACV,MAAM2+C,IAAM,IAAIJ,GAAav+C,GAAK,IAC5Bk/C,IAAW1/C,KAAKk/C,GAAUS,GAAkBR;QAClD,OAAoB,SAAbO,KAAqBl/C,EAAI8D,QAAQo7C,EAASl/C;;;;MAIxCu+C;IACXpgD,YACS6B,GACAo/C;QADA5/C,WAAAQ,aACAo/C;;wCAITjhD,UAAoBO,GAAoBC;QACtC,OACEsH,EAAYpH,EAAWH,EAAKsB,KAAKrB,EAAMqB,QACvCvB,EAAoBC,EAAK0gD,IAAiBzgD,EAAMygD;;wCAKpDjhD,UAAyBO,GAAoBC;QAC3C,OACEF,EAAoBC,EAAK0gD,IAAiBzgD,EAAMygD,OAChDn5C,EAAYpH,EAAWH,EAAKsB,KAAKrB,EAAMqB;;;;;;;;;;;;;;;;;;;;;;;;;;aCjG7Bq/C,GAAeC,GAAsBljD;IACnD,IAAoB,MAAhBA,EAAKkC,QACP,MAAM,IAAImE,EACRlB,EAAKI,kBACL,YAAY29C,qCACV,yBACAC,GAAanjD,EAAKkC,QAAQ,cAC1B;;;;;;;;;aAYQkhD,GACdF,GACAljD,GACAqjD;IAEA,IAAIrjD,EAAKkC,WAAWmhD,GAClB,MAAM,IAAIh9C,EACRlB,EAAKI,kBACL,YAAY29C,kBACVC,GAAaE,GAAc,cAC3B,2BACAF,GAAanjD,EAAKkC,QAAQ,cAC1B;;;;;;;;;;aAaQohD,GACdJ,GACAljD,GACAujD;IAEA,IAAIvjD,EAAKkC,SAASqhD,GAChB,MAAM,IAAIl9C,EACRlB,EAAKI,kBACL,YAAY29C,2BACVC,GAAaI,GAAiB,cAC9B,2BACAJ,GAAanjD,EAAKkC,QAAQ,cAC1B;;;;;;;;;;aAaQshD,GACdN,GACAljD,GACAujD,GACAE;IAEA,IAAIzjD,EAAKkC,SAASqhD,KAAmBvjD,EAAKkC,SAASuhD,GACjD,MAAM,IAAIp9C,EACRlB,EAAKI,kBACL,YAAY29C,wBAAmCK,WAC7C,GAAGE,sCACHN,GAAanjD,EAAKkC,QAAQ,cAC1B;;;;;;;;;;;SA6BQwhD,GACdR,GACAnvC,GACAuV,GACAq6B;IAEAC,GAAaV,GAAcnvC,GAAM,GAAG8vC,GAAQv6B,eAAsBq6B;;;;;;aAOpDG,GACdZ,GACAnvC,GACAuV,GACAq6B;SAEiBj/C,MAAbi/C,KACFD,GAAgBR,GAAcnvC,GAAMuV,GAAUq6B;;;;;;aAQlCI,GACdb,GACAnvC,GACAiwC,GACAL;IAEAC,GAAaV,GAAcnvC,GAAM,GAAGiwC,YAAqBL;;;;;;aAO3CM,GACdf,GACAnvC,GACAiwC,GACAL;SAEiBj/C,MAAbi/C,KACFI,GAAkBb,GAAcnvC,GAAMiwC,GAAYL;;;SA+BtCO,GACdhB,GACAc,GACAG,GACAR,GACAS;SAEiB1/C,MAAbi/C,cAjCJT,GACAc,GACAG,GACAR,GACAS;QAEA,MAAMT,aAAoBU,QACxB,MAAM,IAAIh+C,EACRlB,EAAKI,kBACL,YAAY29C,oBAA+Bc,OACzC,sCAAsCM,GAAiBX;QAI7D,KAAK,IAAIjiD,IAAI,GAAGA,IAAIiiD,EAASzhD,UAAUR,GACrC,KAAK0iD,EAAUT,EAASjiD,KACtB,MAAM,IAAI2E,EACRlB,EAAKI,kBACL,YAAY29C,oBAA+Bc,OACzC,kBAAkBG,6BAA2CziD,OAC7D,QAAQ4iD,GAAiBX,EAASjiD;KAcxC6iD,CACErB,GACAc,GACAG,GACAR,GACAS;;;;;;;;;;SAoCUI,GACdtB,GACAuB,GACAT,GACAU,GACAC;SAEcjgD,MAAVggD,cAlCJxB,GACAuB,GACAT,GACAU,GACAC;QAEA,MAAMC,IAAgC;QAEtC,KAAK,MAAM/8B,KAAO88B,GAAU;YAC1B,IAAI98B,MAAQ68B,GACV;YAEFE,EAAoB//C,KAAKy/C,GAAiBz8B;;QAG5C,MAAMg9B,IAAoBP,GAAiBI;QAC3C,MAAM,IAAIr+C,EACRlB,EAAKI,kBACL,iBAAiBs/C,0BAA0C3B,oBACzD,IAAIc,0BAAmCY,EAAoBh8C,KAAK;KAgBlEk8C,CACE5B,GACAuB,GACAT,GACAU,GACAC;;;;;;;;;;;aAcUI,GACd7B,GACA8B,GACA17B,GACAq6B;IAEA,KAAKqB,EAAM95B,KAAKC,KAAWA,MAAYw4B,IACrC,MAAM,IAAIt9C,EACRlB,EAAKI,kBACL,iBAAiB++C,GAAiBX,6BAChC,GAAGT,eAA0BW,GAAQv6B,6BACrC,WAAW07B,EAAMp8C,KAAK;IAG5B,OAAO+6C;;;uDA8BT,UAASC,GACPV,GACAnvC,GACA0wC,GACAC;IAEA,IAAIO,KAAQ;IASZ,IAPEA,IADW,aAATlxC,IACMmxC,GAAcR,KACJ,uBAAT3wC,IACgB,mBAAV2wC,KAAgC,OAAVA,WAEtBA,MAAU3wC;KAGtBkxC,GAAO;QACV,MAAME,IAAcb,GAAiBI;QACrC,MAAM,IAAIr+C,EACRlB,EAAKI,kBACL,YAAY29C,oBAA+BuB,OACzC,iBAAiB1wC,kBAAqBoxC;;;;;;;aAS9BD,GAAcR;IAC5B,OACmB,mBAAVA,KACG,SAAVA,MACC7gD,OAAOuhD,eAAeV,OAAW7gD,OAAOC,aACN,SAAjCD,OAAOuhD,eAAeV;;;oFAKZJ,GAAiBI;IAC/B,SAAchgD,MAAVggD,GACF,OAAO;IACF,IAAc,SAAVA,GACT,OAAO;IACF,IAAqB,mBAAVA,GAIhB,OAHIA,EAAMxiD,SAAS,OACjBwiD,IAAQ,GAAGA,EAAMjqB,UAAU,GAAG;IAEzBj6B,KAAKC,UAAUikD;IACjB,IAAqB,mBAAVA,KAAuC,oBAAVA,GAC7C,OAAO,KAAKA;IACP,IAAqB,mBAAVA,GAAoB;QACpC,IAAIA,aAAiBL,OACnB,OAAO;QACF;YACL,MAAMgB;;qBAe2BX;gBACrC,IAAIA,EAAMxjD,aAAa;oBACrB,MACM+xB,IADgB,4BACQtU,KAAK+lC,EAAMxjD,YAAYsF;oBACrD,IAAIysB,KAAWA,EAAQ/wB,SAAS,GAC9B,OAAO+wB,EAAQ;;gBAGnB,OAAO;;8DAvBsBqyB;YACzB,OAAID,IACK,YAAYA,aAEZ;;;IAGN,OAAqB,qBAAVX,IACT,eAnYD/jD;;;SAsZM4kD,GACdrC,GACA55B,GACAq6B;IAEA,SAAiBj/C,MAAbi/C,GACF,MAAM,IAAIt9C,EACRlB,EAAKI,kBACL,YAAY29C,wBAAmCW,GAAQv6B,QACrD;;;;;;aASQk8B,GACdtC,GACA/zB,GACAs2B;IAEAxhD,EAAQkrB,GAA0B,CAACvrB,GAAKmB;QACtC,IAAI0gD,EAAY18C,QAAQnF,KAAO,GAC7B,MAAM,IAAIyC,EACRlB,EAAKI,kBACL,mBAAmB3B,yBAA2Bs/C,UAC5C,wBACAuC,EAAY78C,KAAK;;;;;;;aAUX88C,GACdxC,GACAnvC,GACAuV,GACAq6B;IAEA,MAAMwB,IAAcb,GAAiBX;IACrC,OAAO,IAAIt9C,EACTlB,EAAKI,kBACL,YAAY29C,oBAA+BW,GAAQv6B,QACjD,oBAAoBvV,kBAAqBoxC;;;SAI/BQ,GACdzC,GACA55B,GACAtZ;IAEA,IAAIA,KAAK,GACP,MAAM,IAAI3J,EACRlB,EAAKI,kBACL,YAAY29C,oBAA+BW,GACzCv6B,oDACiDtZ;;;2DAMzD,UAAS6zC,GAAQ+B;IACf,QAAQA;MACN,KAAK;QACH,OAAO;;MACT,KAAK;QACH,OAAO;;MACT,KAAK;QACH,OAAO;;MACT;QACE,OAAOA,IAAM;;;;;;GAOnB,UAASzC,GAAayC,GAAav8C;IACjC,OAAO,GAAGu8C,KAAOv8C,OAAiB,MAARu8C,IAAY,KAAK;;;;;;;;;;;;;;;;;;;oECze7C,UAASC;IACP,IAA0B,sBAAfrkD,YACT,MAAM,IAAI6E,EACRlB,EAAKc,eACL;;;;;;;;;UAsBO6/C;IAKX/jD,YAAYgkD;QAEV3iD,KAAK4iD,KAAcD;;IAGrBhkD,wBAAwB+K;QACtBs2C,GAA0B,yBAAyB6C,WAAW,IAC9DvC,GAAgB,yBAAyB,UAAU,GAAG52C;QAEtD;YACE,OAAO,IAAIg5C,GAAK94C,GAAWgS,iBAAiBlS;UAC5C,OAAOpM;YACP,MAAM,IAAI2F,EACRlB,EAAKI,kBACL,kDAAkD7E;;;IAKxDqB,sBAAsBmL;QAGpB,IAFAk2C,GAA0B,uBAAuB6C,WAAW,IAC5DJ,QACM34C,aAAiB1L,aACrB,MAAMkkD,GAAkB,uBAAuB,cAAc,GAAGx4C;QAElE,OAAO,IAAI44C,GAAK94C,GAAWiS,eAAe/R;;IAG5CnL;QAGE,OAFAqhD,GAA0B,iBAAiB6C,WAAW,IAE/C7iD,KAAK4iD,GAAY7nC;;IAG1Bpc;QAGE,OAFAqhD,GAA0B,qBAAqB6C,WAAW,IAC1DJ,MACOziD,KAAK4iD,GAAYjlC;;IAG1Bhf;QACE,OAAO,kBAAkBqB,KAAK+a,aAAa;;IAG7Cpc,QAAQ0B;QACN,OAAOL,KAAK4iD,GAAYt+C,QAAQjE,EAAMuiD;;;;;;;;;;;;;;;;;;;;;;;;;;UCpEpBE;IAIpBnkD,YAAYokD;kBF2FZjD,GACA3iD,GACAkG,GACA2/C;YAEA,MAAM7lD,aAAiB8jD,UAAU9jD,EAAM2B,SAASkkD,GAC9C,MAAM,IAAI//C,EACRlB,EAAKI,kBACL,YAAY29C,oBAA+Bz8C,yBACzC,yBACA,GAAG08C,GAAaiD,GAAqB;SEpGzCC,CACE,aACAF,GACA,cACA;QAGF,KAAK,IAAIzkD,IAAI,GAAGA,IAAIykD,EAAWjkD,UAAUR,GAEvC,IADAgiD,GAAgB,aAAa,UAAUhiD,GAAGykD,EAAWzkD,KACxB,MAAzBykD,EAAWzkD,GAAGQ,QAChB,MAAM,IAAImE,EACRlB,EAAKI,kBACL;QAMNnC,KAAKkjD,KAAgB,IAAIC,EAAkBJ;;;;;;;;UASlCh9C,WAAkB+8C;;;;;;;IAO7BnkD,eAAeokD;QACb5/C,MAAM4/C;;IAGRpkD;;;;;;;QAOE,OAAO,IAAIoH,GAAUo9C,EAAkBz2B,IAAWjnB;;IAGpD9G,QAAQ0B;QACN,MAAMA,aAAiB0F,KACrB,MAAMu8C,GAAkB,WAAW,aAAa,GAAGjiD;QAErD,OAAOL,KAAKkjD,GAAc5+C,QAAQjE,EAAM6iD;;;;;;GAO5C,OAAME,KAAW,IAAIjsC,OAAO;;;;;;;;;;;;;;;;;;;;;;;;;MC5DNksC;IAAtB1kD;;QAKEqB,UAA6CA;;;;MAOlCsjD,WAA6BD;IACxC1kD,YAAqB4kD;QACnBpgD,mBADmBogD;;IAIrB5kD,GAAkB6kD;QAChB,yBAAIA,EAAQC,IAIL,yBAAID,EAAQC,KAMXD,EAAQE,GACZ,GAAG1jD,KAAKujD,2CACN,yBAIEC,EAAQE,GACZ,GAAG1jD,KAAKujD,oDACN;;;QAGN,OAlBEC,EAAQ5iC,GAAUnf,KAAK+hD,EAAa,OAkB/B;;IAGT7kD,QAAQ0B;QACN,OAAOA,aAAiBijD;;;;;;;;;;;;;;;;;;;GAoB5B,UAASK,GACPC,GACAJ,GACAK;IAEA,OAAO,IAAIC,GACT;QACEC;QACAC,IAAWR,EAAQS,SAASC;QAC5BC,YAAYP,EAAWL;QACvBa,IAAAP;OAEFL,EAAQ7jD,GACR6jD,EAAQnmC,YACRmmC,EAAQa;;;MAICC,WAAsCjB;IACjD1kD,YAAqB4kD;QACnBpgD,mBADmBogD;;IAIrB5kD,GAAkB6kD;QAChB,OAAO,IAAI3gC,GAAe2gC,EAAa,MAAE,IAAIviC;;IAG/CtiB,QAAQ0B;QACN,OAAOA,aAAiBikD;;;;MAIfC,WAAiClB;IAC5C1kD,YACW4kD,GACQiB;QAEjBrhD,mBAHSogD,aACQiB;;IAKnB7lD,GAAkB6kD;QAChB,MAAMiB,IAAed,GACnB3jD,MACAwjD;oBACW,IAEPkB,IAAiB1kD,KAAKwkD,GAAU3nD,IACpCkrB,KAAW48B,GAAU58B,GAAS08B,KAE1BG,IAAa,IAAIxjC,GAA6BsjC;QACpD,OAAO,IAAI7hC,GAAe2gC,EAAQ99C,MAAOk/C;;IAG3CjmD,QAAQ0B;;QAEN,OAAOL,SAASK;;;;MAIPwkD,WAAkCxB;IAC7C1kD,YAAqB4kD,GAA8BiB;QACjDrhD,mBADmBogD,aAA8BiB;;IAInD7lD,GAAkB6kD;QAChB,MAAMiB,IAAed,GACnB3jD,MACAwjD;oBACW,IAEPkB,IAAiB1kD,KAAKwkD,GAAU3nD,IACpCkrB,KAAW48B,GAAU58B,GAAS08B,KAE1BG,IAAa,IAAIrjC,GAA8BmjC;QACrD,OAAO,IAAI7hC,GAAe2gC,EAAQ99C,MAAOk/C;;IAG3CjmD,QAAQ0B;;QAEN,OAAOL,SAASK;;;;MAIPykD,WAAuCzB;IAClD1kD,YAAqB4kD,GAAsCwB;QACzD5hD,mBADmBogD,aAAsCwB;;IAI3DpmD,GAAkB6kD;QAChB,MAAMwB,IAAmB,IAAIvjC,GAC3B+hC,EAAQnmC,YACRE,GAASimC,EAAQnmC,YAAYrd,KAAK+kD;QAEpC,OAAO,IAAIliC,GAAe2gC,EAAa,MAAEwB;;IAG3CrmD,QAAQ0B;;QAEN,OAAOL,SAASK;;;;0DAKE4kD,WAAmB5B;IAEvC1kD;QACEwE;;IAGFxE;QAEE,OADAkhD,GAAe,qBAAqBgD,YAC7B,IAAIqC,GACT,IAAI5B,GAAqB;;IAI7B3kD;QAEE,OADAkhD,GAAe,8BAA8BgD,YACtC,IAAIqC,GACT,IAAIZ,GAA8B;;IAItC3lD,qBAAqB2iB;;;QAInB,OAHA4+B,GAA4B,yBAAyB2C,WAAW,IAGzD,IAAIqC,GACT,IAAIX,GAAyB,yBAAyBjjC;;IAI1D3iB,sBAAsB2iB;;;QAIpB,OAHA4+B,GAA4B,0BAA0B2C,WAAW,IAG1D,IAAIqC,GACT,IAAIL,GAA0B,0BAA0BvjC;;IAI5D3iB,iBAAiBiO;QAGf,OAFA0zC,GAAgB,wBAAwB,UAAU,GAAG1zC,IACrDozC,GAA0B,wBAAwB6C,WAAW;QACtD,IAAIqC,GACT,IAAIJ,GAA+B,wBAAwBl4C;;;;;;;;;;;;GAcjE,OAAMs4C,WAA2BD;IAG/BtmD,YAAqBwmD;QACnBhiD,mBADmBgiD,GAEnBnlD,KAAKujD,KAAc4B,EAAU5B;;IAG/B5kD,GAAkB6kD;QAChB,OAAOxjD,KAAKmlD,GAAUC,GAAkB5B;;IAG1C7kD,QAAQ0B;QACN,OAAMA,aAAiB6kD,MAGhBllD,KAAKmlD,GAAU7gD,QAAQjE,EAAM8kD;;;;;;;;;;;;;;;;;;;;;;;UCzP3BE;IAMX1mD,YAAYqZ,GAAkBC;QAI5B,IAHA+nC,GAA0B,YAAY6C,WAAW,IACjDvC,GAAgB,YAAY,UAAU,GAAGtoC,IACzCsoC,GAAgB,YAAY,UAAU,GAAGroC;SACpCqtC,SAASttC,MAAaA,KAAY,MAAMA,IAAW,IACtD,MAAM,IAAI/U,EACRlB,EAAKI,kBACL,4DAA4D6V;QAGhE,KAAKstC,SAASrtC,MAAcA,KAAa,OAAOA,IAAY,KAC1D,MAAM,IAAIhV,EACRlB,EAAKI,kBACL,+DAA+D8V;QAInEjY,KAAKulD,KAAOvtC,GACZhY,KAAKwlD,KAAQvtC;;;;WAMfD;QACE,OAAOhY,KAAKulD;;;;WAMdttC;QACE,OAAOjY,KAAKwlD;;IAGd7mD,QAAQ0B;QACN,OAAOL,KAAKulD,OAASllD,EAAMklD,MAAQvlD,KAAKwlD,OAAUnlD,EAAMmlD;;;;;WAO1D7mD,EAAW0B;QACT,OACEpB,EAAoBe,KAAKulD,IAAMllD,EAAMklD,OACrCtmD,EAAoBe,KAAKwlD,IAAOnlD,EAAMmlD;;;;;;;;;;;;;;;;;;;aC3D5BC,GAAc9lD;IAC5B,OAAO,IAAIsd,GAAoBtd,yBAAiC;;;;;;;;;;;;;;;;;;GC8BlE,OAAM+lD,KAAuB;;;;;;;UAqBhBC;IACXhnD,YACWinD,GACAC,GACAC;kBAFAF,aACAC,aACAC;;;;4EAKAC;IACXpnD,YACWiP,GACAgT,GACAG;QAFA/gB,YAAA4N,aACAgT,GACA5gB,uBAAA+gB;;IAGXpiB,GAAY6B,GAAkBuhB;QAC5B,MAAMiN,IAAY;QAWlB,OAVuB,SAAnBhvB,KAAK4gB,KACPoO,EAAUvtB,KACR,IAAIgf,GAAcjgB,GAAKR,KAAK4N,MAAM5N,KAAK4gB,IAAWmB,MAGpDiN,EAAUvtB,KAAK,IAAI6e,GAAY9f,GAAKR,KAAK4N,MAAMmU;QAE7C/hB,KAAK+gB,gBAAgBjiB,SAAS,KAChCkwB,EAAUvtB,KAAK,IAAIof,GAAkBrgB,GAAKR,KAAK+gB,mBAE1CiO;;;;gFAKEg3B;IACXrnD,YACWiP,GACAgT,GACAG;QAFA/gB,YAAA4N,aACAgT,GACA5gB,uBAAA+gB;;IAGXpiB,GAAY6B,GAAkBuhB;QAC5B,MAAMiN,IAAY,EAChB,IAAIvO,GAAcjgB,GAAKR,KAAK4N,MAAM5N,KAAK4gB,IAAWmB;QAKpD,OAHI/hB,KAAK+gB,gBAAgBjiB,SAAS,KAChCkwB,EAAUvtB,KAAK,IAAIof,GAAkBrgB,GAAKR,KAAK+gB;QAE1CiO;;;;AAyBX,SAASi3B,GAAQxC;IACf,QAAQA;MACN;;cACA;;cACA;QACE,QAAO;;MACT;MACA;QACE,QAAO;;MACT;QACE,MA9HClmD;;;;uEA8JMumD;;;;;;;;;;;;;;;;;;;IAqBXnlD,YACWslD,GACAtkD,GACA0d,GACAgnC,GACTtjC,GACAH;QALS5gB,gBAAAikD,YACAtkD,GACAK,kBAAAqd,GACArd,iCAAAqkD;;;aAMe/iD,MAApByf,KACF/gB,KAAKkmD,MAEPlmD,KAAK+gB,kBAAkBA,KAAmB,IAC1C/gB,KAAK4gB,KAAYA,KAAa;;IAGhClb;QACE,OAAO1F,KAAKikD,SAASv+C;;IAGvBq+C;QACE,OAAO/jD,KAAKikD,SAASR;;6EAIvB9kD,GAAYwnD;QACV,OAAO,IAAIrC,mCACJ9jD,KAAKikD,WAAakC,IACvBnmD,KAAKL,GACLK,KAAKqd,YACLrd,KAAKqkD,2BACLrkD,KAAK+gB,iBACL/gB,KAAK4gB;;IAITjiB,GAAqB2J;;QACnB,MAAM89C,kBAAYpmD,KAAK0F,mCAAMwY,MAAM5V,IAC7Bk7C,IAAUxjD,KAAKqmD,GAAY;YAAE3gD,MAAM0gD;YAAWhC,KAAc;;QAElE,OADAZ,EAAQ8C,GAAoBh+C,IACrBk7C;;IAGT7kD,GAAyB2J;;QACvB,MAAM89C,kBAAYpmD,KAAK0F,mCAAMwY,MAAM5V,IAC7Bk7C,IAAUxjD,KAAKqmD,GAAY;YAAE3gD,MAAM0gD;YAAWhC,KAAc;;QAElE,OADAZ,EAAQ0C,MACD1C;;IAGT7kD,GAAqBY;;;QAGnB,OAAOS,KAAKqmD,GAAY;YAAE3gD,WAAMpE;YAAW8iD,KAAc;;;IAG3DzlD,GAAYwjC;QACV,OAAOuhB,GACLvhB,GACAniC,KAAKikD,SAASE,YACdnkD,KAAKikD,SAASsC,OAAgB,GAC9BvmD,KAAK0F,MACL1F,KAAKikD,SAASC;;sFAKlBvlD,SAASuiB;QACP,YACgE5f,MAA9DtB,KAAK4gB,GAAU5H,KAAK1Q,KAAS4Y,EAAUgH,EAAW5f,YAG5ChH,MAFNtB,KAAK+gB,gBAAgB/H,KAAK8H,KACxBI,EAAUgH,EAAWpH,EAAUxY;;IAK7B3J;;;QAGN,IAAKqB,KAAK0F,MAGV,KAAK,IAAIpH,IAAI,GAAGA,IAAI0B,KAAK0F,KAAK5G,QAAQR,KACpC0B,KAAKsmD,GAAoBtmD,KAAK0F,KAAKlE,IAAIlD;;IAInCK,GAAoBmG;QAC1B,IAAuB,MAAnBA,EAAQhG,QACV,MAAMkB,KAAK0jD,GAAY;QAEzB,IAAIuC,GAAQjmD,KAAKyjD,OAAeiC,GAAqB1/C,KAAKlB,IACxD,MAAM9E,KAAK0jD,GAAY;;;;;;;UAShB8C;IAGX7nD,YACmBgB,GACA0kD,GACjBhnC;iBAFiB1d,GACAK,iCAAAqkD,GAGjBrkD,KAAKqd,aAAaA,KAAcooC,GAAc9lD;;qDAIhDhB,GACE8kD,GACAU,GACAD,GACAqC,KAAe;QAEf,OAAO,IAAIzC,GACT;YACEC,IAAAN;YACAU,YAAAA;YACAH,IAAAE;YACAx+C,MAAMK,EAAU4Y;YAChBylC,KAAc;YACdqC,IAAAF;WAEFvmD,KAAKL,GACLK,KAAKqd,YACLrd,KAAKqkD;;;;uDAMKqC,GACdC,GACAxC,GACAD,GACA5C,GACAiF,GACAx6B,IAAgC;IAEhC,MAAMy3B,IAAUmD,EAAeC,GAC7B76B,EAAQ86B,SAAS96B,EAAQ+6B,+CAGzB3C,GACAD,GACAqC;IAEFQ,GAAoB,uCAAuCvD,GAASlC;IACpE,MAAM0F,IAAaC,GAAY3F,GAAOkC;IAEtC,IAAI5iC,GACAG;IAEJ,IAAIgL,EAAQ86B,OACVjmC,IAAY,IAAI8B,GAAU8gC,EAAQ5iC,KAClCG,IAAkByiC,EAAQziC,sBACrB,IAAIgL,EAAQ+6B,aAAa;QAC9B,MAAMI,IAAmC;QAEzC,KAAK,MAAMC,KAAqBp7B,EAAQ+6B,aAAa;YACnD,IAAI5lC;YAEJ,IAAIimC,aAA6BrE,IAC/B5hC,IAAYimC,EAAkBjE,SACzB;gBAAA,IAAiC,mBAAtBiE,GAOhB,MApWD5pD;gBA8VC2jB,IAAYkmC,GACVjD,GACAgD,GACAjD;;YAMJ,KAAKV,EAAQ/V,SAASvsB,IACpB,MAAM,IAAIje,EACRlB,EAAKI,kBACL,UAAU+e;YAITmmC,GAAkBH,GAAqBhmC,MAC1CgmC,EAAoBzlD,KAAKyf;;QAI7BN,IAAY,IAAI8B,GAAUwkC,IAC1BnmC,IAAkByiC,EAAQziC,gBAAgBlb,OAAOib,KAC/CF,EAAW0mC,GAAOxmC,EAAUxY;WAG9BsY,IAAY,MACZG,IAAkByiC,EAAQziC;IAG5B,OAAO,IAAIglC,GACT,IAAI7mC,GAAY8nC,IAChBpmC,GACAG;;;yDAKYwmC,GACdZ,GACAxC,GACAD,GACA5C;IAEA,MAAMkC,IAAUmD,EAAeC,oBAE7BzC,GACAD;IAEF6C,GAAoB,uCAAuCvD,GAASlC;IAEpE,MAAMkG,IAA8B,IAC9BR,IAAa,IAAI38B;IACvBxpB,EAAQygD,GAAwB,CAAC9gD,GAAKrD;QACpC,MAAMuI,IAAO0hD,GAAgCjD,GAAY3jD,GAAK0jD,IAExDuD,IAAejE,EAAQkE,GAAyBhiD;QACtD,IACEvI,aAAiBkmD,MACjBlmD,EAAMgoD,cAAqB7B;;QAG3BkE,EAAe/lD,KAAKiE,SACf;YACL,MAAMiiD,IAAchD,GAAUxnD,GAAOsqD;YAClB,QAAfE,MACFH,EAAe/lD,KAAKiE,IACpBshD,EAAWz3C,IAAI7J,GAAMiiD;;;IAK3B,MAAMC,IAAO,IAAIllC,GAAU8kC;IAC3B,OAAO,IAAIxB,GACTgB,EAAW18B,MACXs9B,GACApE,EAAQziC;;;wEAKI8mC,GACdlB,GACAxC,GACAD,GACA57C,GACAnL,GACA2qD;IAEA,MAAMtE,IAAUmD,EAAeC,oBAE7BzC,GACAD,IAEI50C,IAAO,EAACy4C,GAAsB5D,GAAY77C,GAAO47C,MACjDzrC,IAAS,EAACtb;IAEhB,IAAI2qD,EAAoBhpD,SAAS,KAAM,GACrC,MAAM,IAAImE,EACRlB,EAAKI,kBACL,YAAYgiD,gDACV;IAIN,KAAK,IAAI7lD,IAAI,GAAGA,IAAIwpD,EAAoBhpD,QAAQR,KAAK,GACnDgR,EAAK7N,KACHsmD,GACE5D,GACA2D,EAAoBxpD,MAGxBma,EAAOhX,KAAKqmD,EAAoBxpD,IAAI;IAGtC,MAAMkpD,IAA8B,IAC9BR,IAAa,IAAI38B;;;IAIvB,KAAK,IAAI/rB,IAAIgR,EAAKxQ,SAAS,GAAGR,KAAK,KAAKA,GACtC,KAAK+oD,GAAkBG,GAAgBl4C,EAAKhR,KAAK;QAC/C,MAAMoH,IAAO4J,EAAKhR,IACZnB,IAAQsb,EAAOna,IACfmpD,IAAejE,EAAQkE,GAAyBhiD;QACtD,IACEvI,aAAiBkmD,MACjBlmD,EAAMgoD,cAAqB7B;;QAG3BkE,EAAe/lD,KAAKiE,SACf;YACL,MAAMiiD,IAAchD,GAAUxnD,GAAOsqD;YAClB,QAAfE,MACFH,EAAe/lD,KAAKiE,IACpBshD,EAAWz3C,IAAI7J,GAAMiiD;;;IAM7B,MAAMC,IAAO,IAAIllC,GAAU8kC;IAC3B,OAAO,IAAIxB,GACTgB,EAAW18B,MACXs9B,GACApE,EAAQziC;;;;;;;;;aAWIinC,GACdrB,GACAxC,GACA7C,GACA2G,KAAc;IAYd,OANetD,GAAUrD,GAJTqF,EAAeC,GAC7BqB,+CACA9D;;;;;;;;;;;aAoBYQ,GACdrD,GACAkC;IAEA,IAAI0E,GAAoB5G,IAEtB,OADAyF,GAAoB,4BAA4BvD,GAASlC,IAClD2F,GAAY3F,GAAOkC;IACrB,IAAIlC,aAAiB+B;;;;;;;;;;IAO1B,OA2EJ,SACElmD,GACAqmD;;QAGA,KAAKyC,GAAQzC,EAAQC,KACnB,MAAMD,EAAQE,GACZ,GAAGvmD,EAAMomD;QAGb,KAAKC,EAAQ99C,MACX,MAAM89C,EAAQE,GACZ,GAAGvmD,EAAMomD;QAIb,MAAMviC,IAAiB7jB,EAAMioD,GAAkB5B;QAC3CxiC,KACFwiC,EAAQziC,gBAAgBtf,KAAKuf;;;;;;GA9F7BmnC,EAAwB7G,GAAOkC,IACxB;IAQP;;;IAJIA,EAAQ99C,QACV89C,EAAQ5iC,GAAUnf,KAAK+hD,EAAQ99C,OAG7B47C,aAAiBL,OAAO;;;;;;;QAO1B,IACEuC,EAAQS,SAASJ,gCACjBL,EAAQC,IAER,MAAMD,EAAQE,GAAY;QAE5B,OA+BN,SAAoB55C,GAAkB05C;YACpC,MAAM/qC,IAAsB;YAC5B,IAAI2vC,IAAa;YACjB,KAAK,MAAM9vB,KAASxuB,GAAO;gBACzB,IAAIu+C,IAAc1D,GAChBrsB,GACAkrB,EAAQ8E,GAAqBF;gBAEZ,QAAfC;;;gBAGFA,IAAc;oBAAE3hC,WAAW;oBAE7BjO,EAAOhX,KAAK4mD,IACZD;;YAEF,OAAO;gBAAE5vC,YAAY;oBAAEC,QAAAA;;;SA/CZ8vC,CAAWjH,GAAoBkC;;IAEtC,OA+EN,SACErmD,GACAqmD;QAEA,IAAc,SAAVrmD,GACF,OAAO;YAAEupB,WAAW;;QACf,IAAqB,mBAAVvpB,GAChB,OAAOogB,GAASimC,EAAQnmC,YAAYlgB;QAC/B,IAAqB,oBAAVA,GAChB,OAAO;YAAEma,cAAcna;;QAClB,IAAqB,mBAAVA,GAChB,OAAO;YAAE0Z,aAAa1Z;;QACjB,IAAIA,aAAiBuG,MAAM;YAChC,MAAMU,IAAYd,EAAUklD,SAASrrD;YACrC,OAAO;gBACLoa,gBAAgBiG,GAAYgmC,EAAQnmC,YAAYjZ;;;QAE7C,IAAIjH,aAAiBmG,GAAW;;;;YAIrC,MAAMc,IAAY,IAAId,EACpBnG,EAAMoG,SACiC,MAAvChF,KAAKC,MAAMrB,EAAMqG,cAAc;YAEjC,OAAO;gBACL+T,gBAAgBiG,GAAYgmC,EAAQnmC,YAAYjZ;;;QAE7C,IAAIjH,aAAiBkoD,IAC1B,OAAO;YACLttC,eAAe;gBACbC,UAAU7a,EAAM6a;gBAChBC,WAAW9a,EAAM8a;;;QAGhB,IAAI9a,aAAiBulD,IAC1B,OAAO;YAAE+F,YAAY/qC,GAAQ8lC,EAAQnmC,YAAYlgB;;QAC5C,IAAIA,aAAiBwoD,IAAsB;YAChD,MAAM+C,IAASlF,EAAQ7jD,GACjBgpD,IAAUxrD,EAAMyoD;YACtB,KAAK+C,EAAQrkD,QAAQokD,IACnB,MAAMlF,EAAQE,GACZ,wCACE,GAAGiF,EAAQzoD,aAAayoD,EAAQxoD,4BAChC,gBAAgBuoD,EAAOxoD,aAAawoD,EAAOvoD;YAGjD,OAAO;gBACL0X,gBAAgBmG,GACd7gB,EAAMyoD,MAAepC,EAAQ7jD,GAC7BxC,EAAM0oD,GAAKngD;;;QAGV,SAAcpE,MAAVnE,KAAuBqmD,EAAQa,2BACxC,OAAO;QAEP,MAAMb,EAAQE,GACZ,4BAA4BxC,GAAiB/jD;;;;;;;;GAxItCyrD,EAAiBtH,GAAOkC;;;AAKrC,SAASyD,GACPxqD,GACA+mD;IAEA,MAAM5sC,IAA0B;IAiBhC,OAfI7V,EAAQtE;;;IAGN+mD,EAAQ99C,QAAQ89C,EAAQ99C,KAAK5G,SAAS,KACxC0kD,EAAQ5iC,GAAUnf,KAAK+hD,EAAQ99C,QAGjC7E,EAAQpE,GAAK,CAAC+D,GAAaikB;QACzB,MAAMkjC,IAAchD,GAAUlgC,GAAK++B,EAAQqF,GAAqBroD;QAC7C,QAAfmnD,MACF/wC,EAAOpW,KAAOmnD;QAKb;QAAEhxC,UAAU;YAAEC,QAAAA;;;;;AA0HvB,SAASsxC,GAAoB5G;IAC3B,SACmB,mBAAVA,KACG,SAAVA,KACEA,aAAiBL,SACjBK,aAAiB59C,QACjB49C,aAAiBh+C,KACjBg+C,aAAiB+D,MACjB/D,aAAiBoB,MACjBpB,aAAiBqE,MACjBrE,aAAiB+B;;;AAIvB,SAAS0D,GACPtpD,GACA+lD,GACAlC;IAEA,KAAK4G,GAAoB5G,OAAWQ,GAAcR,IAAQ;QACxD,MAAMS,IAAcb,GAAiBI;QACrC,MAAoB,gBAAhBS,IAEIyB,EAAQE,GAAYjmD,IAAU,sBAE9B+lD,EAAQE,GAAYjmD,IAAU,MAAMskD;;;;;;aAQhCgG,GACd5D,GACAz+C,GACAw+C;IAEA,IAAIx+C,aAAgBo9C,IAClB,OAAOp9C,EAAKw9C;IACP,IAAoB,mBAATx9C,GAChB,OAAO0hD,GAAgCjD,GAAYz+C;IAGnD,MAAMg+C,GADU,6DAGdS;yBACoB;qBACR7iD,GACZ4iD;;;;;;;;;;aAaUkD,GACdjD,GACAz+C,GACAw+C;IAEA;QACE,gBJxsBmCx+C;YAErC,IADcA,EAAKojD,OAAO1F,OACb,GACX,MAAM,IAAIngD,EACRlB,EAAKI,kBACL,uBAAuBuD,gCACrB;YAGN;gBACE,OAAO,IAAIK,MAAaL,EAAKE,MAAM;cACnC,OAAOtI;gBACP,MAAM,IAAI2F,EACRlB,EAAKI,kBACL,uBAAuBuD,kCACrB;;SIyrBGqjD,CAAuBrjD,GAAMw9C;MACpC,OAAO5lD;QAEP,MAAMomD,IAgDYxmD,IAjDWI,cAkDPI,QAAQR,EAAMO,UAAUP,EAAMkG,YA/ClD+gD;6BACoB;yBACR7iD,GACZ4iD;;;;;;IA2CN,IAAsBhnD;;;AAtCtB,SAASwmD,GACPvhB,GACAgiB,GACAoC,GACA7gD,GACAw+C;IAEA,MAAM8E,IAAUtjD,MAASA,EAAK3E,KACxBkoD,SAA4B3nD,MAAd4iD;IACpB,IAAIzmD,IAAU,YAAY0mD;IACtBoC,MACF9oD,KAAW,2BAEbA,KAAW;IAEX,IAAIskD,IAAc;IAalB,QAZIiH,KAAWC,OACblH,KAAe,WAEXiH,MACFjH,KAAe,aAAar8C,MAE1BujD,MACFlH,KAAe,gBAAgBmC;IAEjCnC,KAAe,MAGV,IAAI9+C,EACTlB,EAAKI,kBACL1E,IAAU0kC,IAAS4f;;;AAavB,SAASsF,GAAkBvuC,GAAuBC;IAChD,OAAOD,EAASgP,KAAKhmB,KAAKA,EAAEwC,QAAQyU;;;;;;;;;;;;;;;;;;;;;;UCp1BzBmwC;IASXvqD,YAAqB0qC;QAAArpC,WAAAqpC;;IAErB1qC;QACE,OAAmB,QAAZqB,KAAKqpC;;;;;WAOd1qC;QACE,OAAIqB,KAAKspC,OACA,SAAStpC,KAAKqpC,MAEd;;IAIX1qC,QAAQwqD;QACN,OAAOA,EAAU9f,QAAQrpC,KAAKqpC;;;;8BA1BhB6f,sBAAkB,IAAIA,GAAK;;;AAI3CA,QAAqC,IAAIA,GAAK,2BAC9CA,QAA8B,IAAIA,GAAK;;;;;;;;;;;;;;;;;;MCiC5BE;IAGXzqD,YAAYxB,GAAsB0oC;QAAA7lC,YAAA6lC,GAFlC7lC,YAAO,SAGLA,KAAKqpD,KAAc;;QAEnBrpD,KAAKqpD,GAA2B,gBAAI,UAAUlsD;;;;sEAqCrCmsD;IAAb3qD;;;;;;QAMEqB,UAA0D;;IAE1DrB;QACE,OAAOgyB,QAAQF,QAAsB;;IAGvC9xB;IAEAA,GAAkB4qD;QAKhBvpD,KAAKupD,KAAiBA;;QAEtBA,EAAeL,GAAK1mD;;IAGtB7D;QAKEqB,KAAKupD,KAAiB;;;;MAIbC;IAwBX7qD,YAAY8qD;;;;;QAnBZzpD,UAAiE;;QAGzDA,mBAAoBkpD,GAAK1mD,iBACjCxC,WAAuC;;;;;QAMvCA,UAAuB;;QAGvBA,UAA0D,MAElDA,qBAAe,GAKrBA,KAAK0pD,KAAgB;YACnB1pD,KAAK2pD,MACL3pD,KAAK4pD,cAAc5pD,KAAK6pD,MACxB7pD,KAAK8pD,MAAsB,GACvB9pD,KAAKupD,MACPvpD,KAAKupD,GAAevpD,KAAK4pD;WAI7B5pD,KAAK2pD,KAAe,GAEpB3pD,KAAK+pD,OAAON,EAAaO,aAAa;YAAEC,WAAU;YAE9CjqD,KAAK+pD,OACP/pD,KAAK+pD,KAAKG,qBAAqBlqD,KAAmB;;QAGlDA,KAAK0pD,GAAc,OACnBD,EAAajoD,MAAM8/B,KACjByoB;YACE/pD,KAAK+pD,OAAOA,GACR/pD,KAAK0pD;;YAEP1pD,KAAK+pD,KAAKG,qBAAqBlqD,KAAK0pD;WAGxC;;IAON/qD;;;;QASE,MAAMwrD,IAAsBnqD,KAAK2pD,IAC3BS,IAAepqD,KAAKoqD;QAG1B,OAFApqD,KAAKoqD,gBAAe,GAEfpqD,KAAK+pD,OAIH/pD,KAAK+pD,KAAKM,SAASD,GAAc9oB,KAAKgpB;;;;QAIvCtqD,KAAK2pD,OAAiBQ,KACxB5tD,EACE,+BACA;QAEKyD,KAAKqqD,cAERC,KACF3sD,EACmC,mBAA1B2sD,EAAUC,cAGZ,IAAInB,GAAWkB,EAAUC,aAAavqD,KAAK4pD,gBAE3C,QArBJj5B,QAAQF,QAAQ;;IA2B3B9xB;QACEqB,KAAKoqD,gBAAe;;IAGtBzrD,GAAkB4qD;QAKhBvpD,KAAKupD,KAAiBA;;QAGlBvpD,KAAK8pD,MACPP,EAAevpD,KAAK4pD;;IAIxBjrD;QAUMqB,KAAK+pD,QACP/pD,KAAK+pD,KAAKS,wBAAwBxqD,KAAmB,KAEvDA,KAAK0pD,KAAgB,MACrB1pD,KAAKupD,KAAiB;;;;;;IAOhB5qD;QACN,MAAM8rD,IAAazqD,KAAK+pD,QAAQ/pD,KAAK+pD,KAAKW;QAK1C,OAJA/sD,EACiB,SAAf8sD,KAA6C,mBAAfA,IAGzB,IAAIvB,GAAKuB;;;;;;;;;;UAoBPE;IAIXhsD,YAAoBisD,GAAoBC;kBAApBD,aAAoBC,GAHxC7qD,YAAO,cACPA,YAAOkpD,GAAK4B;;IAIZC;QACE,MAAMC,IAAwC;YAC5CC,mBAAmBjrD,KAAK6qD;WAEpBK,IAAalrD,KAAK4qD,GAAKb,KAAKoB,GAAgC;QAIlE,OAHID,MACFF,EAAuB,gBAAIE,IAEtBF;;;;;;;;UASEI;IACXzsD,YAAoBisD,GAAoBC;kBAApBD,aAAoBC;;IAExClsD;QACE,OAAOgyB,QAAQF,QAAQ,IAAIk6B,GAAgB3qD,KAAK4qD,IAAM5qD,KAAK6qD;;IAG7DlsD,GAAkB4qD;;QAEhBA,EAAeL,GAAK4B;;IAGtBnsD;IAEAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;MChLoB0sD;IAkBpB1sD,YACUi3B,GACR01B,GACQC,GACEC,GACFC,GACEp5B;kBALFuD,aAEA21B,aACEC,aACFC,GACEzrD,gBAAAqyB,GAnBJryB;;;;;;QAMRA,UAAqB,GAErBA,UAAmD,MAC3CA,cAA+C,MAYrDA,KAAKu0C,KAAU,IAAI5e,GAAmBC,GAAO01B;;;;;;;;WAU/C3sD;QACE,4BACEqB,KAAK6S,0BACL7S,KAAK6S,6BACL7S,KAAK6S;;;;;WAQTlU;QACE,wBAAOqB,KAAK6S;;;;;;;;WAUdlU;0BACMqB,KAAK6S,QAST7S,KAAK+pD,SARH/pD,KAAK0rD;;;;;;;WAiBT/sD;QACMqB,KAAK2rD,cACD3rD,KAAKoiC;;;;;;;;;WAYfzjC;QAMEqB,KAAK6S,0BACL7S,KAAKu0C,GAAQte;;;;;;;;;;;WAaft3B;;;QAGMqB,KAAK4rD,QAA+B,SAAnB5rD,KAAK6rD,OACxB7rD,KAAK6rD,KAAY7rD,KAAK41B,GAAMc,GAC1B12B,KAAKurD,IAvJW,KAyJhB,MAAMvrD,KAAK8rD;;wDAMPntD,GAAYnC;QACpBwD,KAAK+rD,MACL/rD,KAAKgsD,OAAQC,KAAKzvD;;uFAIZmC;QACN,IAAIqB,KAAK4rD;;;QAGP,OAAO5rD,KAAKoiC;;gDAKRzjC;QACFqB,KAAK6rD,OACP7rD,KAAK6rD,GAAU11B,UACfn2B,KAAK6rD,KAAY;;;;;;;;;;;;;;WAiBbltD,YACNutD,GACAhvD;;QASA8C,KAAK+rD,MACL/rD,KAAKu0C,GAAQpe;;;QAIbn2B,KAAKmsD,wBAEDD;;QAEFlsD,KAAKu0C,GAAQte,UACJ/4B,KAASA,EAAMgG,SAASnB,EAAKU;;QAEtCzF,EAASE,EAAMkG,aACfpG,EACE;QAEFgD,KAAKu0C,GAAQ6X,QACJlvD,KAASA,EAAMgG,SAASnB,EAAKS;;;QAGtCxC,KAAKyrD,GAAoBY;;QAIP,SAAhBrsD,KAAKgsD,WACPhsD,KAAKssD,MACLtsD,KAAKgsD,OAAO5pB,SACZpiC,KAAKgsD,SAAS;;;QAKhBhsD,KAAK6S,QAAQq5C;;cAGPlsD,KAAKqyB,SAASk6B,GAAQrvD;;;;;WAOpByB;IAiBFA;QAMNqB,KAAK6S;QAEL,MAAM25C,IAAsBxsD,KAAKysD,GAA0BzsD,KAAKmsD,KAG1DA,IAAansD,KAAKmsD;;gBAExBnsD,KAAKyrD,GAAoBpB,WAAW/oB,KAClCorB;;;;;YAKM1sD,KAAKmsD,OAAeA;;;;YAItBnsD,KAAK2sD,GAAYD;WAGpBxvD;YACCsvD,EAAoB;gBAClB,MAAMI,IAAW,IAAI3pD,EACnBlB,EAAKG,SACL,iCAAiChF,EAAMO;gBAEzC,OAAOuC,KAAK6sD,GAAkBD;;;;IAM9BjuD,GAAY+tD;QAMlB,MAAMF,IAAsBxsD,KAAKysD,GAA0BzsD,KAAKmsD;QAEhEnsD,KAAKgsD,SAAShsD,KAAK8sD,GAASJ,IAC5B1sD,KAAKgsD,OAAOe,GAAO;YACjBP,EAAoB,OAKlBxsD,KAAK6S,uBACE7S,KAAKqyB,SAAU06B;YAG1B/sD,KAAKgsD,OAAOO,GAASrvD;YACnBsvD,EAAoB,MACXxsD,KAAK6sD,GAAkB3vD;YAGlC8C,KAAKgsD,OAAOgB,UAAWxwD;YACrBgwD,EAAoB,MACXxsD,KAAKgtD,UAAUxwD;;;IAKpBmC;QAKNqB,KAAK6S,0BAEL7S,KAAKu0C,GAAQY,GAAc7S;YAMzBtiC,KAAK6S,0BACL7S,KAAKoO;;;;IAMTzP,GAAkBzB;;;;;QAahB,OARAX,EAzbY,oBAybM,qBAAqBW,MAEvC8C,KAAKgsD,SAAS,MAMPhsD,KAAKoiC,sBAAmCllC;;;;;;;WASzCyB,GACNsuD;QAEA,OAAQnsD;YACNd,KAAK41B,GAAMkN,GAAiB,MACtB9iC,KAAKmsD,OAAec,IACfnsD,OAEPvE,EAldM,oBAodJ;YAEKo0B,QAAQF;;;;;;;;;;;UA0BZy8B,WAA+B7B;IAK1C1sD,YACEi3B,GACA41B,GACA2B,GACQ9vC,GACRgV;QAEAlvB,MACEyyB,0HAGA41B,GACA2B,GACA96B;QATMryB,kBAAAqd;;IAaA1e,GACR+tD;QAEA,OAAO1sD,KAAKwrD,GAAW4B,GACrB,UACAV;;IAIM/tD,UAAU0uD;;QAElBrtD,KAAKu0C,GAAQte;QAEb,MAAMhhB,IAAcsK,GAAgBvf,KAAKqd,YAAYgwC,IAC/CC,avCTR98C;;;;YAKA,MAAM,kBAAkBA,IACtB,OAAOrM,EAAgBkB;YAEzB,MAAM+O,IAAe5D,EAAoB;YACzC,OAAI4D,EAAatB,aAAasB,EAAatB,UAAUhU,SAC5CqF,EAAgBkB,QAEpB+O,EAAaiL,WAGXvB,GAAY1J,EAAaiL,YAFvBlb,EAAgBkB;SuCJNkoD,CAA0BF;QAC3C,OAAOrtD,KAAKqyB,SAAUm7B,GAAcv4C,GAAaq4C;;;;;;;WASnD3uD,GAAMwW;QACJ,MAAMi6B,IAAyB;QAC/BA,EAAQjvC,WAAWye,GAAqB5e,KAAKqd,aAC7C+xB,EAAQqe,qBvC6WVpwC,GACAlI;YAEA,IAAI1I;YACJ,MAAM3E,IAASqN,EAAWrN;YAc1B,OAXE2E,IADErD,GAAiBtB,KACV;gBAAEwJ,WAAW+R,GAAkBhG,GAAYvV;gBAE3C;gBAAEgJ,OAAOwS,GAAcjG,GAAYvV;eAG9C2E,EAAOlC,WAAW4K,EAAW5K,UAEzB4K,EAAWvK,YAAY6I,MAAwB,MACjDhH,EAAO7B,cAAc8S,GAAQL,GAAYlI,EAAWvK;YAG/C6B;SuC/XemZ,CAAS5lB,KAAKqd,YAAYlI;QAE9C,MAAMu4C,IAAS7nC,GAAsB7lB,KAAKqd,YAAYlI;QAClDu4C,MACFte,EAAQse,SAASA,IAGnB1tD,KAAK2tD,GAAYve;;;;;WAOnBzwC,GAAQ4L;QACN,MAAM6kC,IAAyB;QAC/BA,EAAQjvC,WAAWye,GAAqB5e,KAAKqd,aAC7C+xB,EAAQv6B,eAAetK,GACvBvK,KAAK2tD,GAAYve;;;;;;;;;;;;;;;;;;;;UAuCRwe,WAA8BvC;IAOzC1sD,YACEi3B,GACA41B,GACA2B,GACQ9vC,GACRgV;QAEAlvB,MACEyyB,sHAGA41B,GACA2B,GACA96B;QATMryB,kBAAAqd,GANVrd,WAA6B;;;;;WAiC7B6tD;QACE,OAAO7tD,KAAK8tD;;;IAIdnvD;QACEqB,KAAK8tD,MAAqB,GAC1B9tD,KAAK8uC,uBAAkBxtC,GACvB6B,MAAMiL;;IAGEzP;QACJqB,KAAK8tD,MACP9tD,KAAK+tD,GAAe;;IAIdpvD,GACR+tD;QAEA,OAAO1sD,KAAKwrD,GAAW4B,GACrB,SACAV;;IAIM/tD,UAAUqvD;QAQlB;;QANArwD,IACIqwD,EAAcC,cAGlBjuD,KAAK8uC,kBAAkBkf,EAAcC,aAEhCjuD,KAAK8tD,IAQH;;;;YAIL9tD,KAAKu0C,GAAQte;YAEb,MAAMpG,IAAU9M,GACdirC,EAAcE,cACdF,EAAc/qC,aAEV0M,IAAgB7R,GAAYkwC,EAAyB;YAC3D,OAAOhuD,KAAKqyB,SAAU87B,GAAiBx+B,GAAeE;;;QAZtD,OAvqBclyB,GAmqBXqwD,EAAcE,gBAAsD,MAAtCF,EAAcE,aAAapvD,SAG5DkB,KAAK8tD,MAAqB,GACnB9tD,KAAKqyB,SAAU+7B;;;;;;WAqB1BzvD;;;QASE,MAAMywC,IAAwB;QAC9BA,EAAQjvC,WAAWye,GAAqB5e,KAAKqd,aAC7Crd,KAAK2tD,GAAYve;;4EAInBzwC,GAAeqwB;QAWb,MAAMogB,IAAwB;YAC5B6e,aAAajuD,KAAK8uC;YAClBuf,QAAQr/B,EAAUnyB,IAAIwjB,KAAYD,GAAWpgB,KAAKqd,YAAYgD;;QAGhErgB,KAAK2tD,GAAYve;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC/sBrB,MAAMkf;IAVN3vD;;;QAGEqB,eAAYsB;;;IAUZ3C,YACW6sD,GACA2B,GACA9vC;QAETla,mBAJSqoD,GACAxrD,mBAAAmtD,GACAntD,kBAAAqd,GALXrd,WAAa;;IAULrB;QACN,IAAIqB,KAAKuuD,IACP,MAAM,IAAItrD,EACRlB,EAAKW,qBACL;;+DAMN/D,GAAqB6vD,GAAiBpf;QAEpC,OADApvC,KAAKyuD,MACEzuD,KAAKmtD,YACT9C,WACA/oB,KAAKorB,KACG1sD,KAAKwrD,GAAWkD,GAAqBF,GAASpf,GAASsd,IAE/DxqB,MAAOhlC;YAIN,MAHIA,EAAMgG,SAASnB,EAAKS,mBACtBxC,KAAKmtD,YAAYd,MAEbnvD;;;qFAKZyB,GACE6vD,GACApf;QAGA,OADApvC,KAAKyuD,MACEzuD,KAAKmtD,YACT9C,WACA/oB,KAAKorB,KACG1sD,KAAKwrD,GAAWmD,GACrBH,GACApf,GACAsd,IAGHxqB,MAAOhlC;YAIN,MAHIA,EAAMgG,SAASnB,EAAKS,mBACtBxC,KAAKmtD,YAAYd,MAEbnvD;;;;;;;;;;;;;;;;;;;;;;;;;MCxED0xD;IAoBXjwD,YAAoBkwD;kBAAAA;;QAlBpB7uD,UAAuB,IAAIgS,KACnBhS,iBAAwB,IAChCA,WAAoB;;;;;QAMpBA,UAAgD;;;;;;;QAQhDA,UAAwC,IAAI8uD;;IAI5CnwD,SAAa2Q;QAGX,IAFAtP,KAAK+uD,MAED/uD,KAAKgvB,UAAUlwB,SAAS,GAC1B,MAAM,IAAImE,EACRlB,EAAKI,kBACL;QAGJ,MAAM4O,UDkEHuxB,eACLusB,GACAv/C;YAEA,MAAM0/C,IAAgBnxD,EAAUgxD,IAC1BxnB,IAAS;gBACblnC,UAAUye,GAAqBowC,EAAc3xC;gBAC7C/L,WAAWhC,EAAKzS,IAAIgF,KAAKyc,GAAO0wC,EAAc3xC,YAAYxb;eAEtDotD,UAAiBD,EAAcL,GAGnC,qBAAqBtnB,IAEjBt2B,IAAO,IAAIiB;YACjBi9C,EAASpuD,QAAQie;gBACf,MAAM7O,IAAM8O,GAAkBiwC,EAAc3xC,YAAYyB;gBACxD/N,EAAKxB,IAAIU,EAAIzP,IAAI4C,YAAY6M;;YAE/B,MAAMxD,IAA0B;YAMhC,OALA6C,EAAKzO,QAAQL;gBACX,MAAMyP,IAAMc,EAAKvP,IAAIhB,EAAI4C;gBA/GrBzF,IAgHSsS,IACbxD,EAAOhL,KAAKwO;gBAEPxD;SC3FcyiD,CAA2BlvD,KAAK6uD,IAAWv/C;QAQ9D,OAPAyB,EAAKlQ,QAAQoP;YACPA,aAAeiE,MAAcjE,aAAe+D,KAC9ChU,KAAKmvD,GAAcl/C,KAEnB1S;YAGGwT;;IAGTpS,IAAI6B,GAAkBoN;QACpB5N,KAAKovD,MAAMxhD,EAAKyhD,GAAY7uD,GAAKR,KAAK+hB,GAAavhB,MACnDR,KAAKsvD,GAAY9gD,IAAIhO;;IAGvB7B,OAAO6B,GAAkBoN;QACvB;YACE5N,KAAKovD,MAAMxhD,EAAKyhD,GAAY7uD,GAAKR,KAAKuvD,GAAsB/uD;UAC5D,OAAOlD;YACP0C,KAAKwvD,KAAiBlyD;;QAExB0C,KAAKsvD,GAAY9gD,IAAIhO;;IAGvB7B,OAAO6B;QACLR,KAAKovD,MAAM,EAAC,IAAI5uC,GAAehgB,GAAKR,KAAK+hB,GAAavhB,QACtDR,KAAKsvD,GAAY9gD,IAAIhO;;IAGvB7B;QAGE,IAFAqB,KAAK+uD,MAED/uD,KAAKwvD,IACP,MAAMxvD,KAAKwvD;QAEb,MAAMC,IAAYzvD,KAAK0vD;;gBAEvB1vD,KAAKgvB,UAAUnuB,QAAQwf;YACrBovC,EAAUv/C,OAAOmQ,EAAS7f,IAAI4C;;;;QAIhCqsD,EAAU5uD,QAAQ,CAACc,GAAG+D;YACpB,MAAMlF,IAAM,IAAIiG,EAAYnB,EAAaoB,EAAWhB;YACpD1F,KAAKgvB,UAAUvtB,KAAK,IAAIogB,GAAerhB,GAAKR,KAAK+hB,GAAavhB;kBDS7D8hC,eACLusB,GACA7/B;YAEA,MAAMggC,IAAgBnxD,EAAUgxD,IAC1BxnB,IAAS;gBACblnC,UAAUye,GAAqBowC,EAAc3xC;gBAC7CgxC,QAAQr/B,EAAUnyB,IAAIyyB,KAAKlP,GAAW4uC,EAAc3xC,YAAYiS;;kBAE5D0/B,EAAcN,GAAU,UAAUrnB;SChBhCsoB,CAAgB3vD,KAAK6uD,IAAW7uD,KAAKgvB,YAC3ChvB,KAAK4vD,MAAY;;IAGXjxD,GAAcsR;QACpB,IAAI4/C;QAEJ,IAAI5/C,aAAe+D,IACjB67C,IAAa5/C,EAAI4N,cACZ;YAAA,MAAI5N,aAAeiE,KAIxB,MAvGI3W;;YAqGJsyD,IAAa1rD,EAAgBkB;;QAK/B,MAAMyqD,IAAkB9vD,KAAK0vD,GAAaluD,IAAIyO,EAAIzP,IAAI4C;QACtD,IAAI0sD;YACF,KAAKD,EAAWvrD,QAAQwrD;;YAEtB,MAAM,IAAI7sD,EACRlB,EAAKY,SACL;eAIJ3C,KAAK0vD,GAAangD,IAAIU,EAAIzP,IAAI4C,YAAYysD;;;;;WAQtClxD,GAAa6B;QACnB,MAAMqd,IAAU7d,KAAK0vD,GAAaluD,IAAIhB,EAAI4C;QAC1C,QAAKpD,KAAKsvD,GAAY/gD,IAAI/N,MAAQqd,IACzBwE,GAAapD,WAAWpB,KAExBwE,GAAaC;;;;WAOhB3jB,GAAsB6B;QAC5B,MAAMqd,IAAU7d,KAAK0vD,GAAaluD,IAAIhB,EAAI4C;;;gBAG1C,KAAKpD,KAAKsvD,GAAY/gD,IAAI/N,MAAQqd,GAAS;YACzC,IAAIA,EAAQvZ,QAAQH,EAAgBkB;;;;;;;;;;YAYlC,MAAM,IAAIpC,EACRlB,EAAKI,kBACL;;wBAIJ,OAAOkgB,GAAapD,WAAWpB;;;;QAI/B,OAAOwE,GAAaH,QAAO;;IAIvBvjB,MAAMqwB;QACZhvB,KAAK+uD,MACL/uD,KAAKgvB,YAAYhvB,KAAKgvB,UAAU5J,OAAO4J;;IAGjCrwB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;MCxJGoxD;IAyBXpxD,YACUg1C,GACAqc;kBADArc,aACAqc;;QAzBFhwD;;;;;;QAORA,UAA8B;;;;;;QAO9BA,UAA0D;;;;;;QAO1DA,WAAoC;;;;;;;;WAcpCrB;QACmC,MAA7BqB,KAAKiwD,OACPjwD,KAAKkwD,6BAMLlwD,KAAKmwD,KAAmBnwD,KAAK2zC,GAAWjd,qDA1Dd,KA6DxB,OACE12B,KAAKmwD,KAAmB;QAKxBnwD,KAAKowD,GACH,8CAGFpwD,KAAKkwD;QAMEv/B,QAAQF;;;;;;;WAYvB9xB,GAAyBzB;kCACnB8C,KAAK6S,QACP7S,KAAKkwD,+BAaLlwD,KAAKiwD;QACDjwD,KAAKiwD,MA/GmB,MAgH1BjwD,KAAKqwD,MAELrwD,KAAKowD,GACH,yBACE,6BAA6BlzD,EAAMkG;QAGvCpD,KAAKkwD;;;;;;;;WAYXvxD,IAAI2xD;QACFtwD,KAAKqwD,MACLrwD,KAAKiwD,KAAsB,6BAEvBK;;;QAGFtwD,KAAKuwD,MAA4B,IAGnCvwD,KAAKkwD,GAAgBI;;IAGf3xD,GAAgB2xD;QAClBA,MAAatwD,KAAK6S,UACpB7S,KAAK6S,QAAQy9C,GACbtwD,KAAKgwD,GAAmBM;;IAIpB3xD,GAAmC6xD;QACzC,MAAM/yD,IACJ,4CAA4C+yD,QAC5C;QAGExwD,KAAKuwD,MACPvzD,EAASS,IACTuC,KAAKuwD,MAA4B,KAEjCh0D,EAxKU,sBAwKQkB;;IAIdkB;QACwB,SAA1BqB,KAAKmwD,OACPnwD,KAAKmwD,GAAiBh6B,UACtBn2B,KAAKmwD,KAAmB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;MCnGjBM;IA4CX9xD;;;;IAIUs5C;;IAEA4W,GACAlb,GACRqc,GACAU;kBALQzY,aAEA4W,aACAlb;;;;;;;;;;;;;;;;;;QAjCV3zC,UAAyC;;;;;;;;;;QAWzCA,UAAwB,IAAIgS,KAK5BhS,UAA8D;;;;;QAM9DA,UAAwB,IAAI8uD,KAe1B9uD,KAAK0wD,KAAsBA,GAC3B1wD,KAAK0wD,GAAoBC,GAAahvD;YACpCgyC,EAAW7Q,GAAiBR;;;;gBAItBtiC,KAAK4wD,SACPr0D,EAtGM,eAwGJ;sBAEIyD,KAAK6wD;;YAKjB7wD,KAAK8wD,KAAqB,IAAIf,GAC5Bpc,GACAqc;;QAIFhwD,KAAK+wD,cHoCPlC,GACAj5B,GACAvD;YAEA,MAAM28B,IAAgBnxD,EAAUgxD;YAChC,OAAO,IAAI3B,GACTt3B,GACAo5B,EAAcxD,IACdwD,EAAc7B,aACd6B,EAAc3xC,YACdgV;SG9CmB2+B,CAAyBhxD,KAAK6uD,IAAWlb,GAAY;YACtEsd,IAAQjxD,KAAKkxD,GAAkBnd,KAAK/zC;YACpCmxD,IAASnxD,KAAKoxD,GAAmBrd,KAAK/zC;YACtCqxD,IAAerxD,KAAKsxD,GAAoBvd,KAAK/zC;YAG/CA,KAAKuxD,cHeP1C,GACAj5B,GACAvD;YAEA,MAAM28B,IAAgBnxD,EAAUgxD;YAChC,OAAO,IAAIjB,GACTh4B,GACAo5B,EAAcxD,IACdwD,EAAc7B,aACd6B,EAAc3xC,YACdgV;SGzBmBm/B,CAAyBxxD,KAAK6uD,IAAWlb,GAAY;YACtEsd,IAAQjxD,KAAKyxD,GAAkB1d,KAAK/zC;YACpCmxD,IAASnxD,KAAK0xD,GAAmB3d,KAAK/zC;YACtC2xD,IAAqB3xD,KAAK4xD,GAAyB7d,KAAK/zC;YACxD6xD,IAAkB7xD,KAAKmuD,GAAiBpa,KAAK/zC;;;;;;WAcjDrB;QACE,OAAOqB,KAAK8xD;;kDAIdnzD;QAEE,OADAqB,KAAK+xD,GAAc7hD,8BACZlQ,KAAKgyD;;IAGNrzD;QACFqB,KAAK4wD,SACH5wD,KAAKiyD,OACPjyD,KAAKkyD,OAELlyD,KAAK8wD,GAAmBvhD;;cAIpBvP,KAAKmyD;;;;;WAQfxzD;QACEqB,KAAK+xD,GAAcvjD,iCACbxO,KAAKoyD;;QAGXpyD,KAAK8wD,GAAmBvhD;;IAGlB5Q;cACAqB,KAAKuxD,GAAYc,cACjBryD,KAAK+wD,GAAYsB,QAEnBryD,KAAKsyD,GAAcxzD,SAAS,MAC9BvC,EArLU,eAuLR,8BAA8ByD,KAAKsyD,GAAcxzD;QAEnDkB,KAAKsyD,KAAgB,KAGvBtyD,KAAKuyD;;IAGP5zD;QACEpC,EAhMY,eAgMM,+BAClByD,KAAK+xD,GAAcvjD,6BACbxO,KAAKoyD;QACXpyD,KAAK0wD,GAAoBzpB;;;QAIzBjnC,KAAK8wD,GAAmBvhD;;;;;WAO1B5Q,OAAOwW;QACDnV,KAAKwyD,GAAcjkD,IAAI4G,EAAW5K;;QAKtCvK,KAAKwyD,GAAcjjD,IAAI4F,EAAW5K,UAAU4K,IAExCnV,KAAKiyD;;QAEPjyD,KAAKkyD,OACIlyD,KAAK+wD,GAAYnF,QAC1B5rD,KAAKyyD,GAAiBt9C;;;;;WAQ1BxW,GAAS4L;QAMPvK,KAAKwyD,GAActiD,OAAO3F,IACtBvK,KAAK+wD,GAAYnF,QACnB5rD,KAAK0yD,GAAmBnoD,IAGM,MAA5BvK,KAAKwyD,GAAcxtD,SACjBhF,KAAK+wD,GAAYnF,OACnB5rD,KAAK+wD,GAAY4B,OACR3yD,KAAK4wD;;;;QAId5wD,KAAK8wD,GAAmBvhD;;oEAM9B5Q,GAAuB4L;QACrB,OAAOvK,KAAKwyD,GAAchxD,IAAI+I,MAAa;;oEAI7C5L,GAAuB4L;QACrB,OAAOvK,KAAK4yD,GAAWv8C,GAAuB9L;;;;;WAOxC5L,GAAiBwW;QACvBnV,KAAK6yD,GAAuBv8C,GAA2BnB,EAAW5K,WAClEvK,KAAK+wD,GAAY+B,GAAM39C;;;;;;WAQjBxW,GAAmB4L;QACzBvK,KAAK6yD,GAAuBv8C,GAA2B/L,IACvDvK,KAAK+wD,GAAYgC,GAAQxoD;;IAGnB5L;QAMNqB,KAAK6yD,KAAwB,IAAIj/C,GAAsB5T,OACvDA,KAAK+wD,GAAY3iD,SACjBpO,KAAK8wD,GAAmBkC;;;;;WAOlBr0D;QACN,OACEqB,KAAK4wD,SACJ5wD,KAAK+wD,GAAYpF,QAClB3rD,KAAKwyD,GAAcxtD,OAAO;;IAI9BrG;QACE,OAAmC,MAA5BqB,KAAK+xD,GAAc/sD;;IAGpBrG;QACNqB,KAAK6yD,KAAwB;;IAGvBl0D;QACNqB,KAAKwyD,GAAc3xD,QAAQ,CAACsU,GAAY5K;YACtCvK,KAAKyyD,GAAiBt9C;;;IAIlBxW,SAAyBzB;QAU/B8C,KAAKuyD;;QAGDvyD,KAAKiyD,QACPjyD,KAAK8wD,GAAmBmC,OAExBjzD,KAAKkyD;;;;QAKLlyD,KAAK8wD,GAAmBvhD;;IAIpB5Q,SACNsW,GACAvK;QAKA;;QAFA1K,KAAK8wD,GAAmBvhD,4BAGtB0F,aAAuBrC,0BACvBqC,EAAYpC,SACZoC,EAAYlC;;;QAIZ;kBACQ/S,KAAKkzD,GAAkBj+C;UAC7B,OAAO3X;YACPf,EArWQ,eAuWN,oCACA0Y,EAAYnC,UAAUtN,KAAK,MAC3BlI;kBAEI0C,KAAKmzD,GAA4B71D;eAiB3C,IAZI2X,aAAuB3C,KACzBtS,KAAK6yD,GAAuBO,GAAqBn+C,KACxCA,aAAuBvC,KAChC1S,KAAK6yD,GAAuBQ,GAAsBp+C,KAMlDjV,KAAK6yD,GAAuBS,GAAmBr+C;SAG5CvK,EAAgBpG,QAAQH,EAAgBkB,QAC3C;YACE,MAAMu5B,UAAkC5+B,KAAKi4C,GAAW6D;YACpDpxC,EAAgBgP,EAAUklB,MAA8B;;;kBAGpD5+B,KAAKuzD,GAAmB7oD;UAEhC,OAAOpN;YACPf,EArYQ,eAqYU,6BAA6Be,UACzC0C,KAAKmzD,GAA4B71D;;;;;;;;;;;WAcrCqB,SACNrB,GACAqL;QAEA,KAAI66B,GAA4BlmC,IA0B9B,MAAMA;QArBN0C,KAAK+xD,GAAcvjD;;cAGbxO,KAAKoyD,MACXpyD,KAAK8wD,GAAmBvhD,8BAEnB5G;;;;QAIHA,IAAK,MAAM3I,KAAKi4C,GAAW6D;;QAI7B97C,KAAK2zC,GAAWvQ,GAAiBd;YAC/B/lC,EA5aQ,eA4aU,oCACZoM,KACN3I,KAAK+xD,GAAc7hD;kBACblQ,KAAKgyD;;;;;;WAWTrzD,GAAoBgK;QAC1B,OAAOA,IAAKu5B,MAAM5kC,KAAK0C,KAAKmzD,GAA4B71D,GAAGqL;;;;;;WAQrDhK,GAAmB+L;QAKzB,MAAMqL,IAAc/V,KAAK6yD,GAAuBW,GAC9C9oD;;;;QAuDF,OAlDAqL,EAAYnE,GAAc/Q,QAAQ,CAAC2P,GAAQjG;YACzC,IAAIiG,EAAO5F,YAAY6I,MAAwB,GAAG;gBAChD,MAAM0B,IAAanV,KAAKwyD,GAAchxD,IAAI+I;;gCAEtC4K,KACFnV,KAAKwyD,GAAcjjD,IACjBhF,GACA4K,EAAWmnC,GAAgB9rC,EAAO5F,aAAaF;;;;;QAQvDqL,EAAYlE,GAAiBhR,QAAQ0J;YACnC,MAAM4K,IAAanV,KAAKwyD,GAAchxD,IAAI+I;YAC1C,KAAK4K;;YAEH;;;wBAKFnV,KAAKwyD,GAAcjjD,IACjBhF,GACA4K,EAAWmnC,GACT1yC,GAAWiB,GACXsK,EAAWzK;;;YAMf1K,KAAK0yD,GAAmBnoD;;;;;YAMxB,MAAMkpD,IAAoB,IAAInpD,GAC5B6K,EAAWrN,QACXyC,qCAEA4K,EAAW1K;YAEbzK,KAAKyyD,GAAiBgB;YAIjBzzD,KAAK4yD,GAAWc,GAAiB39C;;2CAIlCpX,SACNsW;QAGA,MAAM/X,IAAQ+X,EAAkB;QAChC,KAAK,MAAM1K,KAAY0K,EAAYnC;;QAE7B9S,KAAKwyD,GAAcjkD,IAAIhE,aACnBvK,KAAK4yD,GAAWe,GAAappD,GAAUrN,IAC7C8C,KAAKwyD,GAActiD,OAAO3F,IAC1BvK,KAAK6yD,GAAuBh+C,aAAatK;;;;;;;;;WAa/C5L;QACE,IAAIi1D,IACF5zD,KAAKsyD,GAAcxzD,SAAS,IACxBkB,KAAKsyD,GAActyD,KAAKsyD,GAAcxzD,SAAS,GAAGgwB,WtCljB7B;QsCqjB3B,MAAO9uB,KAAK6zD,QACV;YACE,MAAMnkC,UAAc1vB,KAAKi4C,GAAW6b,GAClCF;YAGF,IAAc,SAAVlkC,GAAgB;gBACgB,MAA9B1vB,KAAKsyD,GAAcxzD,UACrBkB,KAAKuxD,GAAYoB;gBAEnB;;YAEAiB,IAAuBlkC,EAAMZ,SAC7B9uB,KAAK+zD,GAAmBrkC;UAE1B,OAAOpyB;kBACD0C,KAAKmzD,GAA4B71D;;QAIvC0C,KAAKg0D,QACPh0D,KAAKi0D;;;;;WAQDt1D;QACN,OACEqB,KAAK4wD,QAAmB5wD,KAAKsyD,GAAcxzD,SA7jBtB;;;IAkkBzBH;QACE,OAAOqB,KAAKsyD,GAAcxzD;;;;;WAOpBH,GAAmB+wB;QAKzB1vB,KAAKsyD,GAAc7wD,KAAKiuB,IAEpB1vB,KAAKuxD,GAAY3F,QAAY5rD,KAAKuxD,GAAY2C,MAChDl0D,KAAKuxD,GAAYxD,GAAer+B,EAAMV;;IAIlCrwB;QACN,OACEqB,KAAK4wD,SACJ5wD,KAAKuxD,GAAY5F,QAClB3rD,KAAKsyD,GAAcxzD,SAAS;;IAIxBH;QAKNqB,KAAKuxD,GAAYnjD;;IAGXzP;QACNqB,KAAKuxD,GAAY4C;;IAGXx1D;;QAEN,KAAK,MAAM+wB,KAAS1vB,KAAKsyD,IACvBtyD,KAAKuxD,GAAYxD,GAAer+B,EAAMV;;IAIlCrwB,SACNgxB,GACAE;QAQA,MAAMH,IAAQ1vB,KAAKsyD,GAAcpd,SAC3B/R,IAAU1T,GAAoBhM,KAAKiM,GAAOC,GAAeE;cAEzD7vB,KAAKo0D,GAAoB,MAC7Bp0D,KAAK4yD,GAAWyB,GAAqBlxB;;;cAKjCnjC,KAAKmyD;;IAGLxzD,SAAyBzB;;;QAY3BA,KAAS8C,KAAKuxD,GAAY2C;;cAEtBl0D,KAAKs0D;;;QAKTt0D,KAAKg0D,QACPh0D,KAAKi0D;;IAIDt1D,SAAuBzB;;;QAG7B,IrD1nBK8N,GAD6B9H,IqD2nBRhG,EAAMgG,SrD1nBDA,MAASnB,EAAKY,SqD0nBN;;;YAGrC,MAAM+sB,IAAQ1vB,KAAKsyD,GAAcpd;;;;wBAKjCl1C,KAAKuxD,GAAYgD,YAEXv0D,KAAKo0D,GAAoB,MAC7Bp0D,KAAK4yD,GAAW4B,GAAkB9kC,EAAMZ,SAAS5xB;;;kBAK7C8C,KAAKmyD;;YrD3oBqBjvD;;;;;;;IqDipBpCvE;QACE,OAAO,IAAIiwD,GAAY5uD,KAAK6uD;;IAGtBlwD;QACNqB,KAAK+xD,GAAcvjD,uCACbxO,KAAKoyD,MACXpyD,KAAK8wD,GAAmBvhD;QACxBvP,KAAKuxD,GAAYgD,MACjBv0D,KAAK+wD,GAAYwD,MACjBv0D,KAAK+xD,GAAc7hD,0CACblQ,KAAKgyD;;IAGbrzD,SAA6BknC;QAC3B7lC,KAAK2zC,GAAW8gB;;;;QAKhBl4D,EA/sBY,eA+sBM,yCAClByD,KAAK+xD,GAAcvjD;cAEbxO,KAAKoyD,MACXpyD,KAAK8wD,GAAmBvhD,oCAClBvP,KAAK4yD,GAAW8B,GAAuB7uB,IAE7C7lC,KAAK+xD,GAAc7hD;cACblQ,KAAKgyD;;;;WAMbrzD,SAAwB+iC;QAClBA,KACF1hC,KAAK+xD,GAAc7hD,mCACblQ,KAAKgyD,QACDtwB,MACV1hC,KAAK+xD,GAAcvjD;cACbxO,KAAKoyD,MACXpyD,KAAK8wD,GAAmBvhD;;;;;;;;;;;;;;;;;;;;;;;SCnwBdolD,GACd/0D,GACA4gC;IAOA,OAAO,qBAA8B5gC,KAAkB4gC;;;;;;;;;;;SAuBzCo0B,GACdh1D,GACAimC,GACA/W;IAEA,IAAI+lC,IAAc,uBAAgCj1D,KAAkBkvB;IAMpE,OAJI+W,EAAKyD,SACPurB,KAAe,IAAIhvB,EAAKwD,QAGnBwrB;;;;;;SAmBOC,GACdl1D,GACA2K;IAEA,OAAO,qBAA8B3K,KAAkB2K;;;;;;;;;;;MCwF5CwqD;IACXp2D,YACWknC,GACA/W,GACAjc,GACA3V;QAHA8C,YAAA6lC,GACA7lC,eAAA8uB,GACA9uB,aAAA6S,GACA7S,aAAA9C;;;;;WAYXyB,UACEknC,GACA/W,GACA3xB;QAEA,MAAM63D,IAAgB53D,KAAK63D,MAAM93D;QAEjC,IAAI+3D,IACuB,mBAAlBF,MAEJ,MADH,EAAC,WAAW,gBAAgB,aAAYrvD,QAAQqvD,EAAcniD,gBAErCvR,MAAxB0zD,EAAc93D,SACkB,mBAAxB83D,EAAc93D,QAErBi4D,SAA6C7zD;QAcjD,OAZI4zD,KAAaF,EAAc93D,UAC7Bg4D,IACyC,mBAAhCF,EAAc93D,MAAMO,WACS,mBAA7Bu3D,EAAc93D,MAAMgG;QACzBgyD,MACFC,IAAiB,IAAIlyD,EACnB+xD,EAAc93D,MAAMgG,MACpB8xD,EAAc93D,MAAMO,YAKtBy3D,IACK,IAAIH,GACTlvB,GACA/W,GACAkmC,EAAcniD,OACdsiD,MAGFn4D,EArLU,qBAuLR,0CAA0C8xB,OAAa3xB;QAElD;;IAIXwB;QACE,MAAMy2D,IAAwC;YAC5CviD,OAAO7S,KAAK6S;YACZ6yB,cAAchiC,KAAKC;;QAUrB,OAPI3D,KAAK9C,UACPk4D,EAAcl4D,QAAQ;YACpBgG,MAAMlD,KAAK9C,MAAMgG;YACjBzF,SAASuC,KAAK9C,MAAMO;YAIjBL,KAAKC,UAAU+3D;;;;;;;;;MASbC;IACX12D,YACW4L,GACAsI,GACA3V;QAFA8C,gBAAAuK,GACAvK,aAAA6S,GACA7S,aAAA9C;;;;;WAYXyB,UACE4L,GACApN;QAEA,MAAMmX,IAAclX,KAAK63D,MAAM93D;QAE/B,IAAI+3D,IACqB,mBAAhB5gD,MAEJ,MADH,EAAC,eAAe,WAAW,aAAY3O,QAAQ2O,EAAYzB,gBAEpCvR,MAAtBgT,EAAYpX,SACkB,mBAAtBoX,EAAYpX,QAEnBi4D,SAA6C7zD;QAcjD,OAZI4zD,KAAa5gD,EAAYpX,UAC3Bg4D,IACuC,mBAA9B5gD,EAAYpX,MAAMO,WACS,mBAA3B6W,EAAYpX,MAAMgG;QACvBgyD,MACFC,IAAiB,IAAIlyD,EACnBqR,EAAYpX,MAAMgG,MAClBoR,EAAYpX,MAAMO,YAKpBy3D,IACK,IAAIG,GACT9qD,GACA+J,EAAYzB,OACZsiD,MAGFn4D,EArQU,qBAuQR,wCAAwCuN,OAAcpN;QAEjD;;IAIXwB;QACE,MAAM2V,IAAsC;YAC1CzB,OAAO7S,KAAK6S;YACZ6yB,cAAchiC,KAAKC;;QAUrB,OAPI3D,KAAK9C,UACPoX,EAAYpX,QAAQ;YAClBgG,MAAMlD,KAAK9C,MAAMgG;YACjBzF,SAASuC,KAAK9C,MAAMO;YAIjBL,KAAKC,UAAUiX;;;;;;;GAiB1B,OAAMghD;IACJ32D,YACW6hC,GACAnB;QADAr/B,gBAAAwgC,GACAxgC,uBAAAq/B;;;;;WAOX1gC,UACE6hC,GACArjC;QAEA,MAAMo4D,IAAcn4D,KAAK63D,MAAM93D;QAE/B,IAAI+3D,IACqB,mBAAhBK,KACPA,EAAYl2B,2BAA2B4hB,OAErCuU,IAAqB/lD;QAEzB,KAAK,IAAInR,IAAI,GAAG42D,KAAa52D,IAAIi3D,EAAYl2B,gBAAgBvgC,UAAUR,GACrE42D,IAAYjuD,EAAcsuD,EAAYl2B,gBAAgB/gC;QACtDk3D,IAAqBA,EAAmBhnD,IACtC+mD,EAAYl2B,gBAAgB/gC;QAIhC,OAAI42D,IACK,IAAII,GAAkB90B,GAAUg1B,MAEvCx4D,EA3UU,qBA6UR,6CAA6CwjC,OAAcrjC;QAEtD;;;;;;;;UAUAs4D;IACX92D,YAAqB6hC,GAA2Bk1B;QAA3B11D,gBAAAwgC,GAA2BxgC,mBAAA01D;;;;;WAMhD/2D,UAA2BxB;QACzB,MAAMu4D,IAAct4D,KAAK63D,MAAM93D;QAQ/B,OALyB,mBAAhBu4D,MAEJ,MADH,EAAC,WAAW,UAAU,YAAW/vD,QAAQ+vD,EAAYA,gBAErB,mBAAzBA,EAAYl1B,WAGZ,IAAIi1B,GACTC,EAAYl1B,UACZk1B,EAAYA,gBAGd14D,EA/WU,qBA+WQ,iCAAiCG;QAC5C;;;;;;;;;;;;;;;MAgBAw4D;IAAbh3D;QACEqB,uBAAkByP;;IAElB9Q,GAAe4L;QACbvK,KAAKq/B,kBAAkBr/B,KAAKq/B,gBAAgB7wB,IAAIjE;;IAGlD5L,GAAkB4L;QAChBvK,KAAKq/B,kBAAkBr/B,KAAKq/B,gBAAgBnvB,OAAO3F;;;;;WAOrD5L;QACE,MAAMiP,IAA0B;YAC9ByxB,iBAAiBr/B,KAAKq/B,gBAAgB95B;YACtCmgC,cAAchiC,KAAKC;;QAErB,OAAOvG,KAAKC,UAAUuQ;;;;;;;;UASbgoD;IA2BXj3D,YACmB+hC,GACA9K,GACAh2B,GACAi2D,GACjB/b;QAJiB95C,cAAA0gC,aACA9K,GACA51B,sBAAAJ,aACAi2D,GA9BnB71D,UAA6C;QAC7CA,UAAkE,MAClEA,UAEW,MAKXA,UAAmCA,KAAK81D,GAAsB/hB,KAAK/zC,OAKnEA,UAAwB,IAAImL,GAC1BlM;QAEFe,WAAkB;;;;;QAOlBA,UAAsC;;;QAWpC,MAAM+1D,IAAwBn2D,EAAesG,QAC3C,uBACA;QAGFlG,KAAKg2D,UAAUh2D,KAAK0gC,OAAOM,cAC3BhhC,KAAK4pD,cAAc9P,GACnB95C,KAAKi2D,KAAwBtB,GAC3B30D,KAAKJ,gBACLI,KAAK61D;QAEP71D,KAAKk2D;;iBDzXPt2D;YAEA,OAAO,6BAAiCA;;;;;;;;;;;;;;;;;GCuXbu2D,EACvBn2D,KAAKJ,iBAEPI,KAAKo2D,KAAgBp2D,KAAKo2D,GAAc7qD,GACtCvL,KAAK61D,IACL,IAAIF,KAGN31D,KAAKq2D,KAAmB,IAAIl/C,OAC1B,sBAA+B4+C;QAEjC/1D,KAAKs2D,KAAqB,IAAIn/C,OAC5B,wBAAiC4+C,wBAEnC/1D,KAAKu2D,KAAmB,IAAIp/C,OAC1B,sBAA+B4+C;QAGjC/1D,KAAKw2D;;iBDnasC52D;YAC7C,OAAO,0BAA8BA;;;uECkab62D;SAA+Bz2D,KAAKJ;;;;;;;QAQ1DI,KAAK0gC,OAAOkG,iBAAiB,WAAW5mC,KAAK02D;;oFAI/C/3D,UAAmB+hC;QACjB,UAAUA,MAAUA,EAAOM;;IAG7BriC;;;QAaE,MAAMslC,UAAwBjkC,KAAK4yD,GAAYlU;QAE/C,KAAK,MAAMle,KAAYyD,GAAiB;YACtC,IAAIzD,MAAaxgC,KAAK61D,IACpB;YAGF,MAAMc,IAAc32D,KAAKmnC,QACvBwtB,GAA+B30D,KAAKJ,gBAAgB4gC;YAEtD,IAAIm2B,GAAa;gBACf,MAAMpB,IAAcD,GAAkBsB,GACpCp2B,GACAm2B;gBAEEpB,MACFv1D,KAAKo2D,KAAgBp2D,KAAKo2D,GAAc7qD,GACtCgqD,EAAY/0B,UACZ+0B;;;QAMRv1D,KAAK62D;;;QAIL,MAAMC,IAAkB92D,KAAKg2D,QAAQ7uB,QAAQnnC,KAAKw2D;QAClD,IAAIM,GAAiB;YACnB,MAAMpB,IAAc11D,KAAK+2D,GAA0BD;YAC/CpB,KACF11D,KAAKg3D,GAAuBtB;;QAIhC,KAAK,MAAM/yB,KAAS3iC,KAAKi3D,IACvBj3D,KAAK81D,GAAsBnzB;QAG7B3iC,KAAKi3D,KAAc;;;QAInBj3D,KAAK0gC,OAAOkG,iBAAiB,UAAU,MAAM5mC,KAAKinC,OAElDjnC,KAAKwiC,MAAU;;IAGjB7jC,GAAoB8L;QAClBzK,KAAKonC,QAAQpnC,KAAKk2D,IAAmB94D,KAAKC,UAAUoN;;IAGtD9L;QACE,OAAOqB,KAAKk3D,GAA0Bl3D,KAAKo2D;;IAG7Cz3D,GAAoB4L;QAClB,IAAIyU,KAAQ;QAMZ,OALAhf,KAAKo2D,GAAcv1D,QAAQ,CAACL,GAAKrD;YAC3BA,EAAMkiC,gBAAgB9wB,IAAIhE,OAC5ByU,KAAQ;YAGLA;;IAGTrgB,GAAmBmwB;QACjB9uB,KAAKm3D,GAAqBroC,GAAS;;IAGrCnwB,GACEmwB,GACAjc,GACA3V;QAEA8C,KAAKm3D,GAAqBroC,GAASjc,GAAO3V;;;;QAK1C8C,KAAKo3D,GAAoBtoC;;IAG3BnwB,GAAoB4L;QAClB,IAAI8sD,IAA+B;;;gBAInC,IAAIr3D,KAAKs3D,GAAoB/sD,IAAW;YACtC,MAAMosD,IAAc32D,KAAKg2D,QAAQ7uB,QAC/B2tB,GAAuC90D,KAAKJ,gBAAgB2K;YAG9D,IAAIosD,GAAa;gBACf,MAAMt7B,IAAWg6B,GAAoBuB,GACnCrsD,GACAosD;gBAEEt7B,MACFg8B,IAAah8B,EAASxoB;;;QAQ5B,OAHA7S,KAAKu3D,GAAiBC,GAAejtD,IACrCvK,KAAK62D,MAEEQ;;IAGT14D,GAAuB4L;QACrBvK,KAAKu3D,GAAiBE,GAAkBltD,IACxCvK,KAAK62D;;IAGPl4D,GAAmB4L;QACjB,OAAOvK,KAAKu3D,GAAiBl4B,gBAAgB9wB,IAAIhE;;IAGnD5L,GAAgB4L;QACdvK,KAAKukC,WACHuwB,GAAuC90D,KAAKJ,gBAAgB2K;;IAIhE5L,GACE4L,GACAsI,GACA3V;QAEA8C,KAAK03D,GAAwBntD,GAAUsI,GAAO3V;;IAGhDyB,GACEknC,GACA8U,GACAC;QAEAD,EAAgB95C,QAAQiuB;YACtB9uB,KAAKo3D,GAAoBtoC;YAE3B9uB,KAAK4pD,cAAc/jB,GACnB+U,EAAc/5C,QAAQiuB;YACpB9uB,KAAK23D,GAAmB7oC;;;IAI5BnwB,GAAe+2D;QACb11D,KAAK43D,GAAmBlC;;IAG1B/2D;QACMqB,KAAKwiC,OACPxiC,KAAK0gC,OAAOqG,oBAAoB,WAAW/mC,KAAK02D,KAChD12D,KAAKukC,WAAWvkC,KAAKi2D;QACrBj2D,KAAKwiC,MAAU;;IAIX7jC,QAAQ6B;QACd,MAAMrD,IAAQ6C,KAAKg2D,QAAQ7uB,QAAQ3mC;QAEnC,OADAjE,EA7pBY,qBA6pBM,QAAQiE,GAAKrD,IACxBA;;IAGDwB,QAAQ6B,GAAarD;QAC3BZ,EAlqBY,qBAkqBM,OAAOiE,GAAKrD,IAC9B6C,KAAKg2D,QAAQ5uB,QAAQ5mC,GAAKrD;;IAGpBwB,WAAW6B;QACjBjE,EAvqBY,qBAuqBM,UAAUiE,IAC5BR,KAAKg2D,QAAQzxB,WAAW/jC;;IAGlB7B,GAAsBgkC;;;QAG5B,MAAMk1B,IAAel1B;QACrB,IAAIk1B,EAAaC,gBAAgB93D,KAAKg2D,SAAS;YAG7C,IAFAz5D,EAhrBU,qBAgrBQ,SAASs7D,EAAar3D,KAAKq3D,EAAaltC,WAEtDktC,EAAar3D,QAAQR,KAAKi2D,IAK5B,YAJAj5D,EACE;YAMJgD,KAAK41B,GAAMwN,GAAiBd;gBAC1B,IAAKtiC,KAAKwiC;oBAKV,IAAyB,SAArBq1B,EAAar3D,KAIjB,IAAIR,KAAKq2D,GAAiBrwD,KAAK6xD,EAAar3D,MAAM;wBAChD,IAA6B,QAAzBq3D,EAAaltC,UAWV;4BACL,MAAM6V,IAAWxgC,KAAK+3D,GACpBF,EAAar3D;4BAEf,OAAOR,KAAKg4D,GAAuBx3B,GAAU;;wBAfZ;4BACjC,MAAM+0B,IAAcv1D,KAAKi4D,GACvBJ,EAAar3D,KACbq3D,EAAaltC;4BAEf,IAAI4qC,GACF,OAAOv1D,KAAKg4D,GACVzC,EAAY/0B,UACZ+0B;;2BASD,IAAIv1D,KAAKs2D,GAAmBtwD,KAAK6xD,EAAar3D;wBACnD,IAA8B,SAA1Bq3D,EAAaltC,UAAmB;4BAClC,MAAMutC,IAAmBl4D,KAAKm4D,GAC5BN,EAAar3D,KACbq3D,EAAaltC;4BAEf,IAAIutC,GACF,OAAOl4D,KAAKo4D,GAAyBF;;2BAGpC,IAAIl4D,KAAKu2D,GAAiBvwD,KAAK6xD,EAAar3D;wBACjD,IAA8B,SAA1Bq3D,EAAaltC,UAAmB;4BAClC,MAAM0tC,IAAsBr4D,KAAKs4D,GAC/BT,EAAar3D,KACbq3D,EAAaltC;4BAEf,IAAI0tC,GACF,OAAOr4D,KAAKu4D,GAAuBF;;2BAGlC,IAAIR,EAAar3D,QAAQR,KAAKw2D;wBACnC,IAA8B,SAA1BqB,EAAaltC,UAAmB;4BAClC,MAAM+qC,IAAc11D,KAAK+2D,GACvBc,EAAaltC;4BAEf,IAAI+qC,GACF,OAAO11D,KAAKg3D,GAAuBtB;;2BAGlC,IAAImC,EAAar3D,QAAQR,KAAKk2D,IAAmB;wBAKtD,MAAMzrD,IA4NhB,SACE+tD;4BAEA,IAAI/tD,IAAiBuqB,GAAesR;4BACpC,IAAiB,QAAbkyB,GACF;gCACE,MAAMC,IAASr7D,KAAK63D,MAAMuD;gCAj+BrB76D,EAm+Be,mBAAX86D,IAGThuD,IAAiBguD;8BACjB,OAAOn7D;gCACPN,EAj+BU,qBAi+BQ,kDAAkDM;;4BAGxE,OAAOmN;;;;;;GA5OwBiuD,EACrBb,EAAaltC;wBAEXlgB,MAAmBuqB,GAAesR,MACpCtmC,KAAKk1B,GAAuBzqB;;uBAhE9BzK,KAAKi3D,GAAYx1D,KAAKo2D;;;;IAuE9Bc;QACE,OAAO34D,KAAKo2D,GAAc50D,IAAIxB,KAAK61D;;IAG7Bl3D;QACNqB,KAAKonC,QACHpnC,KAAKi2D,IACLj2D,KAAKu3D,GAAiBqB;;IAIlBj6D,GACNmwB,GACAjc,GACA3V;QAEA,MAAM27D,IAAgB,IAAI9D,GACxB/0D,KAAK4pD,aACL96B,GACAjc,GACA3V,IAEI23D,IAAcD,GAClB50D,KAAKJ,gBACLI,KAAK4pD,aACL96B;QAEF9uB,KAAKonC,QAAQytB,GAAagE,EAAcD;;IAGlCj6D,GAAoBmwB;QAC1B,MAAM+lC,IAAcD,GAClB50D,KAAKJ,gBACLI,KAAK4pD,aACL96B;QAEF9uB,KAAKukC,WAAWswB;;IAGVl2D,GAAmB+2D;QACzB,MAAMp9B,IAAiC;YACrCkI,UAAUxgC,KAAK61D;YACfH,aAAAA;;QAEF11D,KAAKg2D,QAAQ5uB,QAAQpnC,KAAKw2D,IAAgBp5D,KAAKC,UAAUi7B;;IAGnD35B,GACN4L,GACAsI,GACA3V;QAEA,MAAM47D,IAAYhE,GAChB90D,KAAKJ,gBACL2K,IAEIwuD,IAAiB,IAAI1D,GAAoB9qD,GAAUsI,GAAO3V;QAChE8C,KAAKonC,QAAQ0xB,GAAWC,EAAeH;;;;;WAOjCj6D,GAA6B6B;QACnC,MAAMmwC,IAAQ3wC,KAAKq2D,GAAiB96C,KAAK/a;QACzC,OAAOmwC,IAAQA,EAAM,KAAK;;;;;WAOpBhyC,GACN6B,GACArD;QAEA,MAAMqjC,IAAWxgC,KAAK+3D,GAA6Bv3D;QAEnD,OAAO80D,GAAkBsB,GAAoBp2B,GAAUrjC;;;;;WAOjDwB,GACN6B,GACArD;QAEA,MAAMwzC,IAAQ3wC,KAAKs2D,GAAmB/6C,KAAK/a,IAGrCsuB,IAAU5nB,OAAOypC,EAAM,KACvBvI,SAAsB9mC,MAAbqvC,EAAM,KAAmBA,EAAM,KAAK;QACnD,OAAOokB,GAAiB6B,GACtB,IAAI1N,GAAK9gB,IACTtZ,GACA3xB;;;;;WAQIwB,GACN6B,GACArD;QAEA,MAAMwzC,IAAQ3wC,KAAKu2D,GAAiBh7C,KAAK/a,IAGnC+J,IAAWrD,OAAOypC,EAAM;QAC9B,OAAO0kB,GAAoBuB,GAAoBrsD,GAAUpN;;;;;WAOnDwB,GAA0BxB;QAChC,OAAOs4D,GAAkBmB,GAAoBz5D;;IAGvCwB,SACNq2D;QAEA,IAAIA,EAAcnvB,KAAKwD,QAAQrpC,KAAK4pD,YAAYvgB,KAQhD,OAAOrpC,KAAK4yD,GAAYoG,GACtBhE,EAAclmC,SACdkmC,EAAcniD,OACdmiD,EAAc93D;QAVdX,EAp4BU,qBAs4BR,yCAAyCy4D,EAAcnvB,KAAKwD;;IAY1D1qC,GACNo6D;QAEA,OAAO/4D,KAAK4yD,GAAYqG,GACtBF,EAAexuD,UACfwuD,EAAelmD,OACfkmD,EAAe77D;;IAIXyB,GACN6hC,GACA+0B;QAEA,MAAM2D,IAAiB3D,IACnBv1D,KAAKo2D,GAAc7qD,GAAOi1B,GAAU+0B,KACpCv1D,KAAKo2D,GAAc1qD,OAAO80B,IAExB24B,IAAkBn5D,KAAKk3D,GAA0Bl3D,KAAKo2D,KACtDgD,IAAap5D,KAAKk3D,GAA0BgC,IAE5CG,IAA2B,IAC3BC,IAA6B;QAcnC,OAZAF,EAAWv4D,QAAQ0J;YACZ4uD,EAAgB5qD,IAAIhE,MACvB8uD,EAAa53D,KAAK8I;YAItB4uD,EAAgBt4D,QAAQ0J;YACjB6uD,EAAW7qD,IAAIhE,MAClB+uD,EAAe73D,KAAK8I;YAIjBvK,KAAK4yD,GAAY2G,GACtBF,GACAC,GACAh4B,KAAK;YACLthC,KAAKo2D,KAAgB8C;;;IAIjBv6D,GAAuB+2D;;;;;;QAMzB11D,KAAKo2D,GAAc50D,IAAIk0D,EAAYl1B,aACrCxgC,KAAKgwD,GAAoB0F,EAAYA;;IAIjC/2D,GACN6mC;QAEA,IAAIg0B,IAAgB/pD;QAIpB,OAHA+1B,EAAQ3kC,QAAQ,CAAC44D,GAAKt8D;YACpBq8D,IAAgBA,EAAcE,GAAUv8D,EAAMkiC;YAEzCm6B;;;;MA4BEG;IAAbh7D;QACEqB,UAAqB,IAAI21D,IACzB31D,UAA+D,IAE/DA,UAA6C,MAC7CA,UAAkE,MAClEA,UAEW;;IAEXrB,GAAmBmwB;;;IAInBnwB,GACEmwB,GACAjc,GACA3V;;;IAKFyB,GAAoB4L;QAElB,OADAvK,KAAK45D,GAAWpC,GAAejtD,IACxBvK,KAAKq3D,GAAW9sD,MAAa;;IAGtC5L,GACE4L,GACAsI,GACA3V;QAEA8C,KAAKq3D,GAAW9sD,KAAYsI;;IAG9BlU,GAAuB4L;QACrBvK,KAAK45D,GAAWnC,GAAkBltD;;IAGpC5L,GAAmB4L;QACjB,OAAOvK,KAAK45D,GAAWv6B,gBAAgB9wB,IAAIhE;;IAG7C5L,GAAgB4L;eACPvK,KAAKq3D,GAAW9sD;;IAGzB5L;QACE,OAAOqB,KAAK45D,GAAWv6B;;IAGzB1gC,GAAoB4L;QAClB,OAAOvK,KAAK45D,GAAWv6B,gBAAgB9wB,IAAIhE;;IAG7C5L;QAEE,OADAqB,KAAK45D,KAAa,IAAIjE,IACfhlC,QAAQF;;IAGjB9xB,GACEknC,GACA8U,GACAC;;;IAKFj8C,GAAe+2D;;;IAIf/2D;IAEAA,GAAoB8L;;;;;;;;;;;;;;;;;;UCrkCTovD;IACXl7D,YAAmB6B;QAAAR,WAAAQ;;;;MAERs5D;IACXn7D,YAAmB6B;QAAAR,WAAAQ;;;;;;;;UA6BRu5D;IAiBXp7D,YACUmS;;IAEAkpD;QAFAh6D,aAAA8Q,aAEAkpD,GAnBVh6D,UAAsC;;;;;;;QAOtCA,WAAkB;;QAGlBA,UAAyBqP;;QAEzBrP,UAAsBqP,MASpBrP,KAAKi6D,KAAgBnsC,GAAmBhd,IACxC9Q,KAAKk6D,KAAc,IAAIxqD,GAAY1P,KAAKi6D;;;;;WAO1CE;QACE,OAAOn6D,KAAKg6D;;;;;;;;;;;WAadr7D,GACEsS,GACAmpD;QAEA,MAAMC,IAAYD,IACdA,EAAgBC,KAChB,IAAI9pD,IACF+pD,IAAiBF,IACnBA,EAAgBF,KAChBl6D,KAAKk6D;QACT,IAAIK,IAAiBH,IACjBA,EAAgBlpD,KAChBlR,KAAKkR,IACLspD,IAAiBF,GACjBG,KAAc;;;;;;;;;QAWlB,MAAMC,IACJ16D,KAAK8Q,MAAM6pD,QAAqBL,EAAet1D,SAAShF,KAAK8Q,MAAMjM,QAC/Dy1D,EAAet+B,SACf,MACA4+B,IACJ56D,KAAK8Q,MAAM+pD,QAAoBP,EAAet1D,SAAShF,KAAK8Q,MAAMjM,QAC9Dy1D,EAAep/C,UACf;;QAwFN,IAtFAjK,EAAWhF,GACT,CAACzL,GAAkBs6D;YACjB,MAAMC,IAAST,EAAe94D,IAAIhB;YAClC,IAAIiS,IAASqoD,aAAuB9mD,KAAW8mD,IAAc;YACzDroD,MAQFA,IAAS4a,GAAartB,KAAK8Q,OAAO2B,KAAUA,IAAS;YAGvD,MAAMuoD,MAA4BD,KAC9B/6D,KAAKkR,GAAY3C,IAAIwsD,EAAOv6D,MAE1By6D,MAA4BxoD,MAC9BA,EAAOuZ;;;YAGNhsB,KAAKkR,GAAY3C,IAAIkE,EAAOjS,QAAQiS,EAAOoW;YAGhD,IAAIqyC,KAAgB;;wBAGpB,IAAIH,KAAUtoD,GAAQ;gBACFsoD,EAAOntD,OAAOtJ,QAAQmO,EAAO7E,UAqBpCotD,MAA8BC,MACvCZ,EAAUc,MAAM;oBAAExqD;oBAA2BV,KAAKwC;oBAClDyoD,KAAgB,KArBXl7D,KAAKo7D,GAA4BL,GAAQtoD,OAC5C4nD,EAAUc,MAAM;oBACdxqD;oBACAV,KAAKwC;oBAEPyoD,KAAgB,IAGbR,KACC16D,KAAKi6D,GAAcxnD,GAAQioD,KAAkB,KAC9CE,KACC56D,KAAKi6D,GAAcxnD,GAAQmoD,KAAmB;;;;gBAKhDH,KAAc;oBAOVM,KAAUtoD,KACpB4nD,EAAUc,MAAM;gBAAExqD;gBAAwBV,KAAKwC;gBAC/CyoD,KAAgB,KACPH,MAAWtoD,MACpB4nD,EAAUc,MAAM;gBAAExqD;gBAA0BV,KAAK8qD;gBACjDG,KAAgB,IAEZR,KAAkBE;;;;YAIpBH,KAAc;YAIdS,MACEzoD,KACF+nD,IAAiBA,EAAehsD,IAAIiE,IAElC8nD,IADEU,IACeV,EAAe/rD,IAAIhO,KAEnB+5D,EAAerqD,OAAO1P,OAGzCg6D,IAAiBA,EAAetqD,OAAO1P,IACvC+5D,IAAiBA,EAAerqD,OAAO1P;YAO3CR,KAAK8Q,MAAM6pD,QAAqB36D,KAAK8Q,MAAM+pD,MAC7C,MAAOL,EAAex1D,OAAOhF,KAAK8Q,MAAY,SAAE;YAC9C,MAAMiqD,IAAS/6D,KAAK8Q,MAAM6pD,OACtBH,EAAex+B,SACfw+B,EAAet/C;YACnBs/C,IAAiBA,EAAetqD,OAAO6qD,EAAQv6D,MAC/C+5D,IAAiBA,EAAerqD,OAAO6qD,EAAQv6D,MAC/C65D,EAAUc,MAAM;gBAAExqD;gBAA0BV;;;QAQhD,OAAO;YACLorD,IAAab;YACbc,IAAAjB;YACAkB,IAAAd;YACAe,IAAajB;;;IAIT57D,GACNo8D,GACAtoD;;;;;;;;QASA,OACEsoD,EAAO/uC,MACPvZ,EAAOoW,0BACNpW,EAAOuZ;;;;;;;;;;;;;IAeZrtB,GACEsS,GACAwqD,GACArnD;QAMA,MAAMpD,IAAUhR,KAAKk6D;QACrBl6D,KAAKk6D,KAAcjpD,EAAWipD,IAC9Bl6D,KAAKkR,KAAcD,EAAWC;;QAE9B,MAAMN,IAAUK,EAAWopD,GAAUqB;QACrC9qD,EAAQ6J,KAAK,CAACkhD,GAAIC,MAsLtB,SAA2BD,GAAgBC;YACzC,MAAMv3C,IAAS7T;gBACb,QAAQA;kBACN;oBACE,OAAO;;kBACT;kBAEA;;;;oBAIE,OAAO;;kBACT;oBACE,OAAO;;kBACT;oBACE,OAzdYjT;;;YA6dlB,OAAO8mB,EAAMs3C,KAAMt3C,EAAMu3C;;;;;;;;;;;;;;;;;GAvMnBC,EAAkBF,EAAGhrD,MAAMirD,EAAGjrD,SAC9B3Q,KAAKi6D,GAAc0B,EAAG1rD,KAAK2rD,EAAG3rD,OAIlCjQ,KAAK87D,GAAkB1nD;QACvB,MAAM2nD,IAAeN,IACjBz7D,KAAKy7D,OACL,IAEEO,IADsC,MAA7Bh8D,KAAKi8D,GAAej3D,QAAchF,KAAKoG,sCAEhDgL,IAAmB4qD,MAAiBh8D,KAAKk8D;QAG/C,IAFAl8D,KAAKk8D,KAAYF,GAEM,MAAnBprD,EAAQ9R,UAAiBsS,GAGtB;YAWL,OAAO;gBACLk8C,UAXyB,IAAIz8C,GAC7B7Q,KAAK8Q,OACLG,EAAWipD,IACXlpD,GACAJ,GACAK,EAAWC,sBACX8qD,GACA5qD;gDAC+B;gBAI/B+qD,IAAAJ;;;;QAdF,OAAO;YAAEI,IAAAJ;;;;;;WAuBbp9D,GAAuB+2D;QACrB,OAAI11D,KAAKoG,kCAAWsvD;;;;;QAKlB11D,KAAKoG,MAAU,GACRpG,KAAKkyB,GACV;YACEmpC,IAAar7D,KAAKk6D;YAClBoB,IAAW,IAAI/qD;YACfirD,IAAax7D,KAAKkR;YAClBqqD,KAAa;;qCAEa,MAIvB;YAAEY,IAAc;;;;;WAOnBx9D,GAAgB6B;;QAEtB,QAAIR,KAAKg6D,GAAiBzrD,IAAI/N;;UAIzBR,KAAKk6D,GAAY3rD,IAAI/N,OAOtBR,KAAKk6D,GAAY14D,IAAIhB,GAAMwrB;;;;;WAWzBrtB,GAAkByV;QACpBA,MACFA,EAAajC,GAAetR,QAC1BL,KAAQR,KAAKg6D,KAAmBh6D,KAAKg6D,GAAiBxrD,IAAIhO,KAE5D4T,EAAahC,GAAkBvR,QAAQL,UAMvC4T,EAAa/B,GAAiBxR,QAC5BL,KAAQR,KAAKg6D,KAAmBh6D,KAAKg6D,GAAiB9pD,OAAO1P;QAE/DR,KAAKoG,KAAUgO,EAAahO;;IAIxBzH;;QAEN,KAAKqB,KAAKoG,IACR,OAAO;;;gBAKT,MAAMg2D,IAAoBp8D,KAAKi8D;QAC/Bj8D,KAAKi8D,KAAiB5sD,MACtBrP,KAAKk6D,GAAYr5D,QAAQoP;YACnBjQ,KAAKq8D,GAAgBpsD,EAAIzP,SAC3BR,KAAKi8D,KAAiBj8D,KAAKi8D,GAAeztD,IAAIyB,EAAIzP;;;QAKtD,MAAMoQ,IAAiC;QAWvC,OAVAwrD,EAAkBv7D,QAAQL;YACnBR,KAAKi8D,GAAe1tD,IAAI/N,MAC3BoQ,EAAQnP,KAAK,IAAIq4D,GAAqBt5D;YAG1CR,KAAKi8D,GAAep7D,QAAQL;YACrB47D,EAAkB7tD,IAAI/N,MACzBoQ,EAAQnP,KAAK,IAAIo4D,GAAmBr5D;YAGjCoQ;;;;;;;;;;;;;;;;;;;;;;IAuBTjS,GAA8B29D;QAC5Bt8D,KAAKg6D,KAAmBsC,EAAYze,IACpC79C,KAAKi8D,KAAiB5sD;QACtB,MAAM4B,IAAajR,KAAKu8D,GAAkBD,EAAYhrD;QACtD,OAAOtR,KAAKkyB,GAAajhB,8BAAsC;;;;;;;;IASjEtS;QACE,OAAOkS,GAAa2rD,GAClBx8D,KAAK8Q,OACL9Q,KAAKk6D,IACLl6D,KAAKkR,sBACLlR,KAAKk8D;;;;;;;;MC/bEO;IAIX99D,YACmBg1C,GACAkb,GACA6N,GACA5oB;kBAHAH,aACAkb,GACA7uD,sBAAA08D,aACA5oB,GAPnB9zC,UAPkB,GAgBhBA,KAAKu0C,KAAU,IAAI5e,GACjB31B,KAAK2zC;;oEAMTh1C;QACEqB,KAAK28D;;IAGCh+D;QACNqB,KAAKu0C,GAAQY,GAAc7S;YACzB,MAAM3Q,IAAc,IAAIi9B,GAAY5uD,KAAK6uD,KACnC7b,IAAchzC,KAAK48D,GAAqBjrC;YAC1CqhB,KACFA,EACG1R,KAAK70B;gBACJzM,KAAK2zC,GAAW7Q,GAAiB,MACxBnR,EACJkrC,SACAv7B,KAAK;oBACJthC,KAAK8zC,GAASrjB,QAAQhkB;mBAEvBy1B,MAAM46B;oBACL98D,KAAK+8D,GAAuBD;;eAInC56B,MAAM86B;gBACLh9D,KAAK+8D,GAAuBC;;;;IAM9Br+D,GAAqBgzB;QAC3B;YACE,MAAMqhB,IAAchzC,KAAK08D,eAAe/qC;YACxC,QACE5qB,EAAkBisC,MACjBA,EAAY9Q,SACZ8Q,EAAY1R,OAOR0R,KALLhzC,KAAK8zC,GAASpjB,OACZhzB,MAAM;YAED;UAGT,OAAOR;;YAGP,OADA8C,KAAK8zC,GAASpjB,OAAOxzB,IACd;;;IAIHyB,GAAuBzB;QACzB8C,KAAKi9D,KAAU,KAAKj9D,KAAKk9D,GAA4BhgE,MACvD8C,KAAKi9D,MAAW,GAChBj9D,KAAK2zC,GAAW7Q,GAAiB,OAC/B9iC,KAAK28D,MACEhsC,QAAQF,eAGjBzwB,KAAK8zC,GAASpjB,OAAOxzB;;IAIjByB,GAA4BzB;QAClC,IAAmB,oBAAfA,EAAMmG,MAA0B;;;YAGlC,MAAMH,IAAQhG,EAAyBgG;YACvC,OACW,cAATA,KACS,0BAATA,MACC8H,GAAiB9H;;QAGtB,QAAO;;;;;;;;;;;;;;;;;;;;;;;;AChCX,MAAMi6D;IACJx+D;;;;IAISmS;;;;;IAKAvG;;;;;;;IAOA6yD;QAZAp9D,aAAA8Q,GAKA9Q,gBAAAuK,GAOAvK,YAAAo9D;;;;iCAKX,OAAMC;IACJ1+D,YAAmB6B;QAAAR,WAAAQ;;;;;;;QAQnBR,WAA4B;;;;;;;;;;;GAyH9B,OAAMs9D;IAuCJ3+D,YACYs5C,GACAslB,GACA1O;;IAEA2O,GACF5T,GACA6T;kBANExlB,aACAslB,aACA1O,aAEA2O,GACFx9D,mBAAA4pD,aACA6T;QA7CVz9D,UAA0D,MAE1DA,UAA8B,IAAIgB,EAChC08D,KAAKvwC,GAAcuwC,IACnBjsD,KAEFzR,UAA4B,IAAIgS;;;;;QAKhChS,UAAkD;;;;;QAKlDA,UAAoC,IAAImL,GACtC1E,EAAYpH;;;;;QAMdW,UAA2C,IAAIgS,KAI/ChS,UAA8B,IAAI8+C;;QAElC9+C,UAAgC;;QAIhCA,UAAiC,IAAIgS,KACrChS,UAAiCo+B,GAAkBu/B,MAE3C39D;;IAYR49D;QACE,QAAO;;IAGTj/D,UAAUk/D;QAUR79D,KAAK69D,KAAqBA;;IAG5Bl/D,aAAamS;QAGX,IAAIvG,GACAwqB;QAHJ/0B,KAAK89D,GAAiB;QAKtB,MAAMC,IAAY/9D,KAAKg+D,GAAkBx8D,IAAIsP;QAC7C,IAAIitD;;;;;;;QAOFxzD,IAAWwzD,EAAUxzD,UACrBvK,KAAKw9D,GAAkBS,GAAoB1zD,IAC3CwqB,IAAegpC,EAAUX,KAAKc,WACzB;YACL,MAAM/oD,UAAmBnV,KAAKi4C,GAAWkmB,GAAertD,EAAM8U,OAExDhG,IAAS5f,KAAKw9D,GAAkBS,GACpC9oD,EAAW5K;YAEbA,IAAW4K,EAAW5K,UACtBwqB,UAAqB/0B,KAAKo+D,GACxBttD,GACAvG,GACW,cAAXqV,IAEE5f,KAAKq+D,MACPr+D,KAAKu9D,GAAYe,OAAOnpD;;QAI5B,OAAO4f;;;;;WAOCp2B,SACRmS,GACAvG,GACAnE;QAEA,MAAMk2D,UAAoBt8D,KAAKi4C,GAAWsmB,GACxCztD;mCAC0B,IAEtBssD,IAAO,IAAIrD,GAAKjpD,GAAOwrD,EAAYze,KACnC2gB,IAAiBpB,EAAKb,GAAkBD,EAAYhrD,YACpDmtD,IAA0BxsD,GAAaC,GAC3C3H,GACAnE,iCAAWpG,KAAK01D,cAEZ1Y,IAAaogB,EAAKlrC,GACtBssC;oCAC4Bx+D,KAAKq+D,IACjCI;QAEFz+D,KAAK0+D,GAAoBn0D,GAAUyyC,EAAW+e;QAO9C,MAAMnuD,IAAO,IAAIuvD,GAAUrsD,GAAOvG,GAAU6yD;QAO5C,OANAp9D,KAAKg+D,GAAkBzuD,IAAIuB,GAAOlD,IAC9B5N,KAAK2+D,GAAgBpwD,IAAIhE,KAC3BvK,KAAK2+D,GAAgBn9D,IAAI+I,GAAW9I,KAAKqP,KAEzC9Q,KAAK2+D,GAAgBpvD,IAAIhF,GAAU,EAACuG;QAE/BksC,EAAWsQ;;IAGpB3uD,SAAemS;QACb9Q,KAAK89D,GAAiB;QAEtB,MAAMC,IAAY/9D,KAAKg+D,GAAkBx8D,IAAIsP,IAQvC8tD,IAAU5+D,KAAK2+D,GAAgBn9D,IAAIu8D,EAAUxzD;;;gBACnD,IAAIq0D,EAAQ9/D,SAAS,GAMnB,OALAkB,KAAK2+D,GAAgBpvD,IACnBwuD,EAAUxzD,UACVq0D,EAAQ/4D,OAAO63D,MAAMjsD,GAAYisD,GAAG5sD;aAEtC9Q,KAAKg+D,GAAkB9tD,OAAOY;;gBAKhC,IAAI9Q,KAAKq+D,IAAiB;;;YAGxBr+D,KAAKw9D,GAAkBqB,GAAuBd,EAAUxzD,WAC5BvK,KAAKw9D,GAAkBlG,GACjDyG,EAAUxzD,mBAIJvK,KAAKi4C,GACR6mB,GAAcf,EAAUxzD,wCAAuC,GAC/D+2B,KAAK;gBACJthC,KAAKw9D,GAAkBuB,GAAgBhB,EAAUxzD,WACjDvK,KAAKu9D,GAAYyB,GAASjB,EAAUxzD,WACpCvK,KAAKi/D,GAAuBlB,EAAUxzD;eAEvC23B,MAAMoW;eAGXt4C,KAAKi/D,GAAuBlB,EAAUxzD,iBAChCvK,KAAKi4C,GAAW6mB,GACpBf,EAAUxzD;sCACmB;;IAKnC5L,YAAY+wB,GAAmBwvC;QAC7Bl/D,KAAK89D,GAAiB;QAEtB;YACE,MAAMrxD,UAAezM,KAAKi4C,GAAWknB,GAAWzvC;YAChD1vB,KAAKw9D,GAAkB7F,GAAmBlrD,EAAOqiB,UACjD9uB,KAAKo/D,GAAoB3yD,EAAOqiB,SAASowC,UACnCl/D,KAAKq/D,GAAgC5yD,EAAOmE,WAC5C5Q,KAAKu9D,GAAYpL;UACvB,OAAO70D;;;YAGP,MAAMJ,IAAQk5C,GAA6B94C,GAAG;YAC9C4hE,EAAaxuC,OAAOxzB;;;IAIxByB,eACEg1C,GACA+oB,GACA5oB;QAEA,IAAI2oB,GACF9oB,GACA3zC,KAAK6uD,IACL6N,GACA5oB,GACAwrB;;IAGJ3gE,SAAuBoX;QACrB/V,KAAK89D,GAAiB;QACtB;YACE,MAAMltD,UAAgB5Q,KAAKi4C,GAAWyb,GAAiB39C;;wBAEvDA,EAAYnE,GAAc/Q,QAAQ,CAACuT,GAAc7J;gBAC/C,MAAMg1D,IAAkBv/D,KAAKw/D,GAA+Bh+D,IAC1D+I;gBAEEg1D;;;gBAjb8B5hE,EAqb9ByW,EAAajC,GAAenN,OAC1BoP,EAAahC,GAAkBpN,OAC/BoP,EAAa/B,GAAiBrN,QAC9B,IAGAoP,EAAajC,GAAenN,OAAO,IACrCu6D,EAAgBE,MAAmB,IAC1BrrD,EAAahC,GAAkBpN,OAAO,IA7bjBrH,EA+b5B4hE,EAAgBE,MAGTrrD,EAAa/B,GAAiBrN,OAAO,MAlchBrH,EAoc5B4hE,EAAgBE;gBAGlBF,EAAgBE,MAAmB;sBAMnCz/D,KAAKq/D,GAAgCzuD,GAASmF;UACpD,OAAO7Y;kBACDo7C,GAAyBp7C;;;IAInCyB,GACE+2D,GACAgK;QAEA1/D,KAAK89D,GAAiB;QACtB,MAAM6B,IAAmB;QACzB3/D,KAAKg+D,GAAkBn9D,QAAQ,CAACiQ,GAAOitD;YACrC,MAAM/gB,IAAa+gB,EAAUX,KAAKwC,GAAuBlK;YAKrD1Y,EAAWsQ,YACbqS,EAAiBl+D,KAAKu7C,EAAWsQ;YAGrCttD,KAAK69D,GAAoBgC,GAAoBnK,IAC7C11D,KAAK69D,GAAoBrQ,GAAcmS,IACvC3/D,KAAK01D,cAAcA;;IAGrB/2D,SAAmB4L,GAAoBymB;QACrChxB,KAAK89D,GAAiB;;QAGtB99D,KAAKw9D,GAAkBsC,GAAiBv1D,GAAU,YAAYymB;QAE9D,MAAMuuC,IAAkBv/D,KAAKw/D,GAA+Bh+D,IAAI+I,IAC1Dw1D,IAAWR,KAAmBA,EAAgB/+D;QACpD,IAAIu/D,GAAU;;;;;;;YAQZ,IAAIjuD,IAAkB,IAAI3G,GACxB1E,EAAYpH;YAEdyS,IAAkBA,EAAgBvG,GAChCw0D,GACA,IAAI7rD,GAAW6rD,GAAU57D,EAAgBkB;YAE3C,MAAM0M,IAAyB1C,KAAiBb,IAAIuxD,IAC9Cp9B,IAAQ,IAAIhxB,GAChBxN,EAAgBkB;iCACK,IAAI2M;oCACD,IAAIrE,GAAoB1O,IAChD6S,GACAC;kBAGI/R,KAAK0zD,GAAiB/wB;;;;;;YAO5B3iC,KAAKggE,KAA0BhgE,KAAKggE,GAAwBt0D,OAC1Dq0D,IAEF//D,KAAKw/D,GAA+BtvD,OAAO3F,IAC3CvK,KAAKigE;qBAECjgE,KAAKi4C,GACR6mB,GAAcv0D,kCAAwC,GACtD+2B,KAAK,MAAMthC,KAAKi/D,GAAuB10D,GAAUymB,IACjDkR,MAAMoW;;IAIb35C,SACEuhE;QAEAlgE,KAAK89D,GAAiB;QAEtB,MAAMhvC,IAAUoxC,EAAoBxwC,MAAMZ;QAE1C;YACE,MAAMle,UAAgB5Q,KAAKi4C,GAAWkoB,GACpCD;;;;;wBAOFlgE,KAAKogE,GAAoBtxC,cAAoB,OAC7C9uB,KAAKqgE,GAA8BvxC,IAEnC9uB,KAAKw9D,GAAkB8C,GAAoBxxC,GAAS;kBAC9C9uB,KAAKq/D,GAAgCzuD;UAC3C,OAAO1T;kBACDo7C,GAAyBp7C;;;IAInCyB,SACEmwB,GACA5xB;QAEA8C,KAAK89D,GAAiB;QAEtB;YACE,MAAMltD,UAAgB5Q,KAAKi4C,GAAWsoB,GAAYzxC;;;;;wBAMlD9uB,KAAKogE,GAAoBtxC,GAAS5xB,IAClC8C,KAAKqgE,GAA8BvxC,IAEnC9uB,KAAKw9D,GAAkB8C,GAAoBxxC,GAAS,YAAY5xB,UAC1D8C,KAAKq/D,GAAgCzuD;UAC3C,OAAO1T;kBACDo7C,GAAyBp7C;;;IAInCyB,SAAoCqxB;QAC7BhwB,KAAKu9D,GAAY3M,QACpBr0D,EApiBU,cAsiBR;QAKJ;YACE,MAAMikE,UAAuBxgE,KAAKi4C,GAAW4D;YAC7C,K3C1lByB,M2C0lBrB2kB;;YAGF,YADAxwC,EAASS;YAIX,MAAMgwC,IAAYzgE,KAAK0gE,GAAuBl/D,IAAIg/D,MAAmB;YACrEC,EAAUh/D,KAAKuuB,IACfhwB,KAAK0gE,GAAuBnxD,IAAIixD,GAAgBC;UAChD,OAAOnjE;YACP,MAAM63D,IAAiB/e,GACrB94C,GACA;YAEF0yB,EAASU,OAAOykC;;;;;;WAQZx2D,GAA8BmwB;SACnC9uB,KAAK0gE,GAAuBl/D,IAAIstB,MAAY,IAAIjuB,QAAQmvB;YACvDA,EAASS;YAGXzwB,KAAK0gE,GAAuBxwD,OAAO4e;;uFAI7BnwB,GAAwCgiE;QAC9C3gE,KAAK0gE,GAAuB7/D,QAAQ4/D;YAClCA,EAAU5/D,QAAQmvB;gBAChBA,EAASU,OAAO,IAAIztB,EAAelB,EAAKE,WAAW0+D;;YAIvD3gE,KAAK0gE,GAAuBE;;IAGtBjiE,GACNmwB,GACAkB;QAEA,IAAI6wC,IAAe7gE,KAAK8gE,GAAsB9gE,KAAK4pD,YAAYmX;QAC1DF,MACHA,IAAe,IAAI11D,GACjBlM,KAGJ4hE,IAAeA,EAAat1D,GAAOujB,GAASkB,IAC5ChwB,KAAK8gE,GAAsB9gE,KAAK4pD,YAAYmX,QAAWF;;;;;WAO/CliE,GAAoBmwB,GAAkB5xB;QAC9C,IAAI2jE,IAAe7gE,KAAK8gE,GAAsB9gE,KAAK4pD,YAAYmX;;;gBAI/D,IAAIF,GAAc;YAChB,MAAM7wC,IAAW6wC,EAAar/D,IAAIstB;YAC9BkB,MAKE9yB,IACF8yB,EAASU,OAAOxzB,KAEhB8yB,EAASS,WAEXowC,IAAeA,EAAan1D,OAAOojB,KAErC9uB,KAAK8gE,GAAsB9gE,KAAK4pD,YAAYmX,QAAWF;;;IAIjDliE,GACR4L,GACArN,IAAsB;QAEtB8C,KAAKw9D,GAAkBqB,GAAuBt0D;QAQ9C,KAAK,MAAMuG,KAAS9Q,KAAK2+D,GAAgBn9D,IAAI+I,IAC3CvK,KAAKg+D,GAAkB9tD,OAAOY,IAC1B5T,KACF8C,KAAK69D,GAAoBmD,GAAalwD,GAAO5T;QAMjD,IAFA8C,KAAK2+D,GAAgBzuD,OAAO3F,IAExBvK,KAAKq+D,IAAiB;YACNr+D,KAAKihE,GAAkBC,GAAsB32D,GACrD1J,QAAQk/D;gBACK//D,KAAKihE,GAAkB34B,GAAYy3B;;gBAGtD//D,KAAKmhE,GAAkBpB;;;;IAMvBphE,GAAkB6B;;;QAGxB,MAAM4gE,IAAgBphE,KAAKggE,GAAwBx+D,IAAIhB;QACjC,SAAlB4gE,MAKJphE,KAAKu9D,GAAYyB,GAASoC,IAC1BphE,KAAKggE,KAA0BhgE,KAAKggE,GAAwBt0D,OAAOlL,IACnER,KAAKw/D,GAA+BtvD,OAAOkxD,IAC3CphE,KAAKigE;;IAGGthE,GACR4L,GACAwxD;QAEA,KAAK,MAAMsF,KAAetF,GACxB,IAAIsF,aAAuBxH,IACzB75D,KAAKihE,GAAkBlhC,GAAashC,EAAY7gE,KAAK+J,IACrDvK,KAAKshE,GAAiBD,SACjB,IAAIA,aAAuBvH,IAAsB;YACtDv9D,EAxrBQ,cAwrBU,kCAAkC8kE,EAAY7gE,MAChER,KAAKihE,GAAkBjhC,GAAgBqhC,EAAY7gE,KAAK+J;YACnCvK,KAAKihE,GAAkB34B,GAC1C+4B,EAAY7gE;;YAIZR,KAAKmhE,GAAkBE,EAAY7gE;eAGrCjD;;IAKEoB,GAAiB0iE;QACvB,MAAM7gE,IAAM6gE,EAAY7gE;QACnBR,KAAKggE,GAAwBx+D,IAAIhB,OACpCjE,EA1sBU,cA0sBQ,4BAA4BiE,IAC9CR,KAAKuhE,GAAyB9/D,KAAKjB;QACnCR,KAAKigE;;;;;;;;;WAYDthE;QACN,MACEqB,KAAKuhE,GAAyBziE,SAAS,KACvCkB,KAAKggE,GAAwBh7D,OAAOhF,KAAKy9D,MACzC;YACA,MAAMj9D,IAAMR,KAAKuhE,GAAyBrsB,SACpCksB,IAAgBphE,KAAKwhE,GAAuBh7D;YAClDxG,KAAKw/D,GAA+BjwD,IAClC6xD,GACA,IAAI/D,GAAgB78D,KAEtBR,KAAKggE,KAA0BhgE,KAAKggE,GAAwBz0D,GAC1D/K,GACA4gE,IAEFphE,KAAKu9D,GAAYe,OACf,IAAIh0D,GACFqb,GAAM8U,GAAOj6B,EAAIkF,MAAMkgB,MACvBw7C,6BAEApsC,GAAesR;;;;IAOvB3nC;QACE,OAAOqB,KAAKggE;;;IAIdrhE;QACE,OAAOqB,KAAKuhE;;IAGJ5iE,SACRiS,GACAmF;QAEA,MAAM0rD,IAA2B,IAC3BC,IAA2C,IAC3CC,IAAyC;QAE/C3hE,KAAKg+D,GAAkBn9D,QAAQ,CAACc,GAAGo8D;YACjC4D,EAAiBlgE,KACfkvB,QAAQF,UACL6Q,KAAK;gBACJ,MAAMk9B,IAAiBT,EAAUX,KAAKb,GAAkB3rD;gBACxD,OAAK4tD,EAAe/D,KAMbz6D,KAAKi4C,GACTsmB,GAAaR,EAAUjtD,kCAAiC,GACxDwwB,KAAK,EAAGhwB,WAAAA,OACAysD,EAAUX,KAAKb,GACpBjrD,GACAktD,MAVGA;;;;2BAcVl9B,KAAMk9B;gBACL,MAAMpqD,IACJ2B,KAAeA,EAAYnE,GAAcpQ,IAAIu8D,EAAUxzD,WACnDyyC,IAAa+gB,EAAUX,KAAKlrC,GAChCssC;4CAC4Bx+D,KAAKq+D,IACjCjqD;gBAMF,IAJApU,KAAK0+D,GACHX,EAAUxzD,UACVyyC,EAAW+e,KAET/e,EAAWsQ,UAAU;oBACnBttD,KAAKq+D,MACPr+D,KAAKw9D,GAAkBsC,GACrB/B,EAAUxzD,UACVyyC,EAAWsQ,SAASn8C,YAAY,gBAAgB;oBAIpDswD,EAAShgE,KAAKu7C,EAAWsQ;oBACzB,MAAMr8C,IAAa2jB,GAAiBgtC,GAClC7D,EAAUxzD,UACVyyC,EAAWsQ;oBAEboU,EAAqBjgE,KAAKwP;;;kBAM9B0f,QAAQE,IAAI8wC,IAClB3hE,KAAK69D,GAAoBrQ,GAAciU,UACjCzhE,KAAKi4C,GAAW4pB,GAAuBH;;IAGrC/iE,GAAiBmjE;IAO3BnjE,SAA6BknC;QAG3B,KAFqB7lC,KAAK4pD,YAAYtlD,QAAQuhC,IAE7B;YACftpC,EAv0BU,cAu0BQ,0BAA0BspC,EAAKk7B;YAEjD,MAAMt0D,UAAezM,KAAKi4C,GAAW8pB,GAAiBl8B;YACtD7lC,KAAK4pD,cAAc/jB;;YAGnB7lC,KAAKgiE,GACH;;YAGFhiE,KAAKw9D,GAAkBuE,GACrBl8B,GACAp5B,EAAOkuC,IACPluC,EAAOmuC,WAEH56C,KAAKq/D,GAAgC5yD,EAAOsuC;;;IAItDp8C;QACE,OAAOqB,KAAKu9D,GAAYzL;;IAG1BnzD;QACE,OAAOqB,KAAKu9D,GAAY0E;;IAG1BtjE,GAAuB4L;QACrB,MAAMg1D,IAAkBv/D,KAAKw/D,GAA+Bh+D,IAAI+I;QAChE,IAAIg1D,KAAmBA,EAAgBE,IACrC,OAAOpwD,KAAiBb,IAAI+wD,EAAgB/+D;QACvC;YACL,IAAI0hE,IAAS7yD;YACb,MAAMuvD,IAAU5+D,KAAK2+D,GAAgBn9D,IAAI+I;YACzC,KAAKq0D,GACH,OAAOsD;YAET,KAAK,MAAMpxD,KAAS8tD,GAAS;gBAC3B,MAAMb,IAAY/9D,KAAKg+D,GAAkBx8D,IAAIsP;gBAK7CoxD,IAASA,EAAOxI,GAAUqE,EAAUX,KAAK+E;;YAE3C,OAAOD;;;;;SAKGE,GACdnqB,GACAslB,GACA1O;;AAEA2O,GACA5T,GACA6T;IAEA,OAAO,IAAIH,GACTrlB,GACAslB,GACA1O,GACA2O,GACA5T,GACA6T;;;;;;;;;;;GAwBJ,OAAM4E,WAA+B/E;IAMnC3+D,YACYs5C,GACVslB,GACA1O,GACA2O,GACA5T,GACA6T;QAEAt6D,MACE80C,GACAslB,GACA1O,GACA2O,GACA5T,GACA6T,cAbQxlB;;;;QAHZj4C,eAAgDsB;;IAoBhDs8D;QACE,QAAiC,MAA1B59D,KAAKsiE;;IAGd3jE;QAEE,OADAqB,KAAKi4C,GAAWwG,IAAkB,IAC3Bt7C,MAAM2uD;;IAGfnzD;QAEE,OADAqB,KAAKi4C,GAAWwG,IAAkB,IAC3Bt7C,MAAM8+D;;;;;WAOPtjE,SACNo/D;QAEA,MAAMzB,UAAoBt8D,KAAKi4C,GAAWsmB,GACxCR,EAAUjtD;mCACgB,IAEtBikB,IAAegpC,EAAUX,KAAKmF,GAClCjG;QAKF,OAHIt8D,KAAKsiE,MACPtiE,KAAK0+D,GAAoBX,EAAUxzD,UAAUwqB,EAAagnC,KAErDhnC;;IAGTp2B,GACE+2D,GACAgK;;;QAII1/D,KAAKq+D,8BAAmBqB,MAC1Bv8D,MAAMy8D,GAAuBlK,GAAagK,IAC1C1/D,KAAKw9D,GAAkBgF,GAAe9M;;;;;QAQrC11D,KAAKq+D,oCACNqB,KAEAv8D,MAAMy8D,GAAuBlK,GAAagK;;IAI9C/gE,SACEmwB,GACA2zC,GACAvlE;QAEA8C,KAAK89D,GAAiB;QACtB,MAAMxsD,UAAkBtR,KAAKi4C,GAAWyqB,GAAwB5zC;QAE9C,SAAdxd,KAYe,cAAfmxD;;;;cAIIziE,KAAKu9D,GAAYpL,OACC,mBAAfsQ,KAAgD,eAAfA;;;QAG1CziE,KAAKogE,GAAoBtxC,GAAS5xB,KAAgB,OAClD8C,KAAKi4C,GAAW0qB,GAAkC7zC,MAElDvxB,WAGIyC,KAAKq/D,GAAgC/tD;;;;;;;;QAlBzC/U,EAjgCU,cAigCQ,0CAA0CuyB;;IAqBhEnwB,SAAwB+iC;QACtB,KAAkB,MAAdA,MAAgD,MAA1B1hC,KAAKsiE,IAA2B;;;;;;;YAOxD,MAAM9I,IAAgBx5D,KAAKw9D,GAAkBoF,MACvCC,UAAsB7iE,KAAK8iE,GAC/BtJ,EAAcj0D;sCACW;YAE3BvF,KAAKsiE,MAAmB,SAClBtiE,KAAKu9D,GAAYwF,IAAkB;YACzC,KAAK,MAAM5tD,KAAc0tD,GACvB7iE,KAAKu9D,GAAYe,OAAOnpD;eAErB,KAAkB,MAAdusB,MAAiD,MAA1B1hC,KAAKsiE,IAA4B;YACjE,MAAM9I,IAA4B;YAElC,IAAIjrC,IAAIoC,QAAQF;YAChBzwB,KAAK2+D,GAAgB99D,QAAQ,CAACc,GAAG4I;gBAC3BvK,KAAKw9D,GAAkBwF,GAAmBz4D,KAC5CivD,EAAc/3D,KAAK8I,KAEnBgkB,IAAIA,EAAE+S,KAAK,OACTthC,KAAKi/D,GAAuB10D,IACrBvK,KAAKi4C,GAAW6mB,GACrBv0D;8CAC6B,MAInCvK,KAAKu9D,GAAYyB,GAASz0D;sBAEtBgkB,SAEAvuB,KAAK8iE,GACTtJ;sCACyB,IAE3Bx5D,KAAKijE,MACLjjE,KAAKsiE,MAAmB,SAClBtiE,KAAKu9D,GAAYwF,IAAkB;;;IAIrCpkE;QACNqB,KAAKw/D,GAA+B3+D,QAAQ,CAACc,GAAG4I;YAC9CvK,KAAKu9D,GAAYyB,GAASz0D;YAE5BvK,KAAKihE,GAAkBiC,MACvBljE,KAAKw/D,KAAiC,IAAIxtD,KAC1ChS,KAAKggE,KAA0B,IAAI70D,GACjC1E,EAAYpH;;;;;;;;;;WAaRV,SACNiX,GACAutD;QAEA,MAAMN,IAA8B,IAC9BlD,IAAmC;QACzC,KAAK,MAAMp1D,KAAYqL,GAAS;YAC9B,IAAIT;YACJ,MAAMypD,IAAU5+D,KAAK2+D,GAAgBn9D,IAAI+I;YAEzC,IAAIq0D,KAA8B,MAAnBA,EAAQ9/D,QAAc;;;;;gBAKnCqW,UAAmBnV,KAAKi4C,GAAWkmB,GACjCS,EAAQ,GAAGh5C;gBAGb,KAAK,MAAM9U,KAAS8tD,GAAS;oBAC3B,MAAMb,IAAY/9D,KAAKg+D,GAAkBx8D,IAAIsP,IAMvCksC,UAAmBh9C,KAAKojE,GAC5BrF;oBAEE/gB,EAAWsQ,YACbqS,EAAiBl+D,KAAKu7C,EAAWsQ;;mBAGhC;;;gBAOL,MAAMxlD,UAAe9H,KAAKi4C,GAAWorB,GAAU94D;gBAE/C4K,UAAmBnV,KAAKi4C,GAAWkmB,GAAer2D,UAC5C9H,KAAKo+D,GACTp+D,KAAKsjE,OACL/4D;8BACa;;YAIjBs4D,EAAcphE;;QAIhB,OADAzB,KAAK69D,GAAoBrQ,GAAcmS,IAChCkD;;;;;;;;;;;WAaDlkE,GAAwBmJ;QAC9B,OAAO,IAAI6d,GACT7d,EAAOpC,MACPoC,EAAOP,iBACPO,EAAON,SACPM,EAAOL,SACPK,EAAOjD,yBAEPiD,EAAOJ,SACPI,EAAOH;;IAIXhJ;QACE,OAAOqB,KAAKi4C,GAAWyG;;IAGzB//C,SACE4L,GACAsI,GACA3V;QAEA,IAAI8C,KAAKsiE;;;QAGP/lE,EAtrCU,cAsrCQ,uDAIpB,IAAIyD,KAAK2+D,GAAgBpwD,IAAIhE,IAC3B,QAAQsI;UACN,KAAK;UACL,KAAK;YAAe;gBAClB,MAAMjC,UAAgB5Q,KAAKi4C,GAAW0G,MAChC4kB,IAAyB5xD,GAAY6xD,GACzCj5D,GACU,cAAVsI;sBAEI7S,KAAKq/D,GACTzuD,GACA2yD;gBAEF;;;UAEF,KAAK;kBACGvjE,KAAKi4C,GAAW6mB,GACpBv0D;2CAC8B,IAEhCvK,KAAKi/D,GAAuB10D,GAAUrN;YACtC;;UAEF;YACEK;;;IAKRoB,SACEi5B,GACA6rC;QAEA,IAAKzjE,KAAKsiE,IAAV;YAIA,KAAK,MAAM/3D,KAAYqtB,GAAO;gBAC5B,IAAI53B,KAAK2+D,GAAgBpwD,IAAIhE,IAAW;;oBAEtChO,EAluCQ,cAkuCU,qCAAqCgO;oBACvD;;gBAGF,MAAMzC,UAAe9H,KAAKi4C,GAAWorB,GAAU94D,IAKzC4K,UAAmBnV,KAAKi4C,GAAWkmB,GAAer2D;sBAClD9H,KAAKo+D,GACTp+D,KAAKsjE,GAAwBx7D,IAC7BqN,EAAW5K;8BACE,IAEfvK,KAAKu9D,GAAYe,OAAOnpD;;YAG1B,KAAK,MAAM5K,KAAYk5D;;;YAGhBzjE,KAAK2+D,GAAgBpwD,IAAIhE;;kBAKxBvK,KAAKi4C,GACR6mB,GAAcv0D,kCAAwC,GACtD+2B,KAAK;gBACJthC,KAAKu9D,GAAYyB,GAASz0D,IAC1BvK,KAAKi/D,GAAuB10D;eAE7B23B,MAAMoW;;;;;;;;;;;;;;;;;;;;;;;;;ACxzCf,MAAMorB;IAAN/kE;QACEqB,eAAqCsB,GACrCtB,iBAA6B;;;;;;;;UAgBlB2jE;IAUXhlE,YAAoBi0D;kBAAAA,GATpB5yD,UAAkB,IAAIgB,EACpB08D,KAAKvwC,GAAcuwC,IACnBjsD,KAGMzR;QAERA,UAAwD,IAAI8uD,KAG1D9uD,KAAK4yD,GAAWgR,UAAU5jE;;IAG5BrB,aAAa0zB;QACX,MAAMvhB,IAAQuhB,EAASvhB;QACvB,IAAI+yD,KAAc,GAEdC,IAAY9jE,KAAK4+D,GAAQp9D,IAAIsP;QAMjC,IALKgzD,MACHD,KAAc,GACdC,IAAY,IAAIJ,KAGdG,GACF;YACEC,EAAUC,WAAiB/jE,KAAK4yD,GAAW0L,OAAOxtD;UAClD,OAAOxT;YACP,MAAM63D,IAAiB/e,GACrB94C,GACA,4BAA4B8vB,GAAeiF,EAASvhB;YAGtD,YADAuhB,EAAS2xC,QAAQ7O;;QAKrBn1D,KAAK4+D,GAAQrvD,IAAIuB,GAAOgzD,IACxBA,EAAUG,UAAUxiE,KAAK4wB;;QAGLA,EAASutC,GAAuB5/D,KAAK01D;QAMzD,IAAIoO,EAAUC,IAAU;YACF1xC,EAAS6xC,GAAeJ,EAAUC,OAEpD/jE,KAAKmkE;;;IAKXxlE,SAAe0zB;QACb,MAAMvhB,IAAQuhB,EAASvhB;QACvB,IAAIszD,KAAa;QAEjB,MAAMN,IAAY9jE,KAAK4+D,GAAQp9D,IAAIsP;QACnC,IAAIgzD,GAAW;YACb,MAAMxlE,IAAIwlE,EAAUG,UAAUt+D,QAAQ0sB;YAClC/zB,KAAK,MACPwlE,EAAUG,UAAUviE,OAAOpD,GAAG,IAC9B8lE,IAA4C,MAA/BN,EAAUG,UAAUnlE;;QAIrC,IAAIslE,GAEF,OADApkE,KAAK4+D,GAAQ1uD,OAAOY,IACb9Q,KAAK4yD,GAAWoM,GAASluD;;IAIpCnS,GAAc0lE;QACZ,IAAIC,KAAc;QAClB,KAAK,MAAMP,KAAYM,GAAW;YAChC,MAAMvzD,IAAQizD,EAASjzD,OACjBgzD,IAAY9jE,KAAK4+D,GAAQp9D,IAAIsP;YACnC,IAAIgzD,GAAW;gBACb,KAAK,MAAMzxC,KAAYyxC,EAAUG,WAC3B5xC,EAAS6xC,GAAeH,OAC1BO,KAAc;gBAGlBR,EAAUC,KAAWA;;;QAGrBO,KACFtkE,KAAKmkE;;IAITxlE,GAAamS,GAAc5T;QACzB,MAAM4mE,IAAY9jE,KAAK4+D,GAAQp9D,IAAIsP;QACnC,IAAIgzD,GACF,KAAK,MAAMzxC,KAAYyxC,EAAUG,WAC/B5xC,EAAS2xC,QAAQ9mE;;;gBAMrB8C,KAAK4+D,GAAQ1uD,OAAOY;;IAGtBnS,GAAoB+2D;QAClB11D,KAAK01D,cAAcA;QACnB,IAAI4O,KAAc;QAClBtkE,KAAK4+D,GAAQ/9D,QAAQ,CAACc,GAAGmiE;YACvB,KAAK,MAAMzxC,KAAYyxC,EAAUG;;YAE3B5xC,EAASutC,GAAuBlK,OAClC4O,KAAc;YAIhBA,KACFtkE,KAAKmkE;;IAITxlE,GAA2B4lE;QACzBvkE,KAAKwkE,GAAyBh2D,IAAI+1D;;;QAGlCA,EAAS/9D;;IAGX7H,GAA8B4lE;QAC5BvkE,KAAKwkE,GAAyBt0D,OAAOq0D;;;IAI/B5lE;QACNqB,KAAKwkE,GAAyB3jE,QAAQ0jE;YACpCA,EAAS/9D;;;;;;;;;;UAsBFi+D;IAaX9lE,YACWmS,GACD4zD,GACR34C;QAFS/rB,aAAA8Q,aACD4zD;;;;;QAVV1kE,WAA6B,GAI7BA,UAAoC,MAE5BA,6CAONA,KAAK+rB,UAAUA,KAAW;;;;;;;WAS5BptB,GAAegmE;QAMb,KAAK3kE,KAAK+rB,QAAQ64C,wBAAwB;;YAExC,MAAM3zD,IAAmC;YACzC,KAAK,MAAM8C,KAAa4wD,EAAK1zD,iCACvB8C,EAAUpD,QACZM,EAAWxP,KAAKsS;YAGpB4wD,IAAO,IAAI9zD,GACT8zD,EAAK7zD,OACL6zD,EAAK5zD,MACL4zD,EAAK3zD,IACLC,GACA0zD,EAAKzzD,IACLyzD,EAAKxzD,WACLwzD,EAAKvzD;4CAC0B;;QAGnC,IAAIkzD,KAAc;QAYlB,OAXKtkE,KAAK6kE,KAKC7kE,KAAK8kE,GAAiBH,OAC/B3kE,KAAK0kE,GAAcl+D,KAAKm+D,IACxBL,KAAc,KANVtkE,KAAK+kE,GAAwBJ,GAAM3kE,KAAK01D,iBAC1C11D,KAAKglE,GAAkBL;QACvBL,KAAc,IAOlBtkE,KAAK2kE,KAAOA,GACLL;;IAGT3lE,QAAQzB;QACN8C,KAAK0kE,GAAcxnE,MAAMA;;qDAI3ByB,GAAuB+2D;QACrB11D,KAAK01D,cAAcA;QACnB,IAAI4O,KAAc;QASlB,OAPEtkE,KAAK2kE,OACJ3kE,KAAK6kE,MACN7kE,KAAK+kE,GAAwB/kE,KAAK2kE,IAAMjP,OAExC11D,KAAKglE,GAAkBhlE,KAAK2kE,KAC5BL,KAAc;QAETA;;IAGD3lE,GACNgmE,GACAjP;;QAQA,KAAKiP,EAAKxzD,WACR,QAAO;;;gBAKT,MAAM8zD,gCAAcvP;;;gBAGpB,SAAI11D,KAAK+rB,QAAQm5C,OAAyBD,QASlCN,EAAK5zD,KAAKhQ,mCAAa20D;;;IAGzB/2D,GAAiBgmE;;;;;QAKvB,IAAIA,EAAK1zD,WAAWnS,SAAS,GAC3B,QAAO;QAGT,MAAMqmE,IACJnlE,KAAK2kE,MAAQ3kE,KAAK2kE,GAAKnzD,qBAAqBmzD,EAAKnzD;QACnD,UAAImzD,EAAKvzD,OAAoB+zD,OACoB,MAAxCnlE,KAAK+rB,QAAQ64C;;;;;IAShBjmE,GAAkBgmE;QAKxBA,IAAO9zD,GAAa2rD,GAClBmI,EAAK7zD,OACL6zD,EAAK5zD,MACL4zD,EAAKzzD,IACLyzD,EAAKxzD,YAEPnR,KAAK6kE,MAAqB,GAC1B7kE,KAAK0kE,GAAcl+D,KAAKm+D;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;UCzSfS;IAGXzmE,GAAsBu7C;QACpBl6C,KAAKqlE,KAAqBnrB;;IAG5Bv7C,GACEgzB,GACA7gB,GACAnG,GACAkzC;;;;QAUA,OAAI/sC,EAAMw0D,QAMN36D,EAA6BrG,QAAQH,EAAgBkB,SALhDrF,KAAKulE,GAA0B5zC,GAAa7gB,KAS9C9Q,KAAKqlE,GAAoBvqB,GAAanpB,GAAaksB,GAAYr3C,KACpE8K;YACE,MAAMk0D,IAAkBxlE,KAAKylE,GAAW30D,GAAOQ;YAE/C,QACGR,EAAM6pD,QAAqB7pD,EAAM+pD,SAClC76D,KAAKy6D,GACH3pD,EAAMob,IACNs5C,GACA3nB,GACAlzC,KAGK3K,KAAKulE,GAA0B5zC,GAAa7gB,MAGjDzU,OAAiBK,EAASC,SAC5BJ,EACE,wBACA,yDACAoO,EAA6BvH,YAC7BgqB,GAAetc;YAMZ9Q,KAAKqlE,GAAoBnxC,GAC9BvC,GACA7gB,GACAnG,GACAnE,KAAKk/D;;;;YAILF,EAAgB3kE,QAAQoP;gBACtBy1D,IAAiBA,EAAen6D,GAAO0E,EAAIzP,KAAKyP;gBAE3Cy1D;;;;;+EAOP/mE,GACNmS,GACAQ;;;QAIA,IAAI6iB,IAAe,IAAIxmB,GAAoBmgB,GAAmBhd;QAM9D,OALAQ,EAAUzQ,QAAQ,CAACc,GAAG8mB;YAChBA,aAAoBzU,MAAYqZ,GAAavc,GAAO2X,OACtD0L,IAAeA,EAAa3lB,IAAIia;YAG7B0L;;;;;;;;;;;;WAcDx1B,GACNutB,GACAy5C,GACA9nB,GACA+nB;;;QAIA,IAAI/nB,EAAW74C,SAAS2gE,EAAsB3gE,MAC5C,QAAO;;;;;;;;;gBAWT,MAAM6gE,wBACJ35C,IACIy5C,EAAsB3pC,SACtB2pC,EAAsBzqD;QAC5B,SAAK2qD,MAKHA,EAAer0D,oBACfq0D,EAAehoD,QAAQnE,EAAUksD,KAA4B;;IAIzDjnE,GACNgzB,GACA7gB;QAUA,OARIzU,OAAiBK,EAASC,SAC5BJ,EACE,wBACA,gDACA6wB,GAAetc;QAIZ9Q,KAAKqlE,GAAoBnxC,GAC9BvC,GACA7gB,GACA3M,EAAgBkB;;;;;;;;;;;;;;;;;;;UChLTygE;IAaXnnE,YACmB+zB,GACA6L;kBADA7L,aACA6L;;;;;QAVnBv+B,UAAyC;;QAGzCA,UAA+B;;QAG/BA,UAA+B,IAAI2N,GAAUoxC,GAAaC;;IAO1DrgD,GAAWgzB;QACT,OAAO5B,GAAmBU,QAAsC,MAA9BzwB,KAAKyyB,GAAc3zB;;IAGvDH,GACEgzB,GACA5a,GACAgY,GACAC;QAIA,MAAMF,IAAU9uB,KAAKqqC;QAGrB,IAFArqC,KAAKqqC,MAEDrqC,KAAKyyB,GAAc3zB,SAAS,GAAG;YACnBkB,KAAKyyB,GAAczyB,KAAKyyB,GAAc3zB,SAAS;;QAO/D,MAAM4wB,IAAQ,IAAIb,GAChBC,GACA/X,GACAgY,GACAC;QAEFhvB,KAAKyyB,GAAchxB,KAAKiuB;;QAGxB,KAAK,MAAMrP,KAAY2O,GACrBhvB,KAAK+lE,KAAuB/lE,KAAK+lE,GAAqBv3D,IACpD,IAAIuwC,GAAa1+B,EAAS7f,KAAKsuB,KAGjC9uB,KAAK0yB,GAAaoL,GAChBnM,GACAtR,EAAS7f,IAAIkF,KAAKie;QAItB,OAAOoM,GAAmBU,QAAQf;;IAGpC/wB,GACEgzB,GACA7C;QAEA,OAAOiB,GAAmBU,QAAQzwB,KAAKgmE,GAAkBl3C;;IAG3DnwB,GACEgzB,GACA7C;QAEA,MAAMub,IAAcvb,IAAU,GAIxBm3C,IAAWjmE,KAAKkmE,GAAe77B,IAC/B9qC,IAAQ0mE,IAAW,IAAI,IAAIA;;;gBACjC,OAAOl2C,GAAmBU,QACxBzwB,KAAKyyB,GAAc3zB,SAASS,IAAQS,KAAKyyB,GAAclzB,KAAS;;IAIpEZ;QACE,OAAOoxB,GAAmBU,QACM,MAA9BzwB,KAAKyyB,GAAc3zB,U9CnFM,I8CmF2BkB,KAAKqqC,KAAc;;IAI3E1rC,GACEgzB;QAEA,OAAO5B,GAAmBU,QAAQzwB,KAAKyyB,GAAc7tB;;IAGvDjG,GACEgzB,GACAC;QAEA,MAAMxjB,IAAQ,IAAI2wC,GAAantB,GAAa,IACtC1sB,IAAM,IAAI65C,GAAantB,GAAa1qB,OAAOy4B,oBAC3ClzB,IAA0B;QAchC,OAbAzM,KAAK+lE,GAAqBtmB,GAAe,EAACrxC,GAAOlJ,KAAMi6C;YAKrD,MAAMzvB,IAAQ1vB,KAAKgmE,GAAkB7mB,EAAIS;YAKzCnzC,EAAOhL,KAAKiuB;YAGPK,GAAmBU,QAAQhkB;;IAGpC9N,GACEgzB,GACAI;QAEA,IAAI8Y,IAAiB,IAAIl9B,GAAkB1O;QAe3C,OAbA8yB,EAAalxB,QAAQ+wB;YACnB,MAAMxjB,IAAQ,IAAI2wC,GAAantB,GAAa,IACtC1sB,IAAM,IAAI65C,GAAantB,GAAa1qB,OAAOy4B;YACjD3/B,KAAK+lE,GAAqBtmB,GAAe,EAACrxC,GAAOlJ,KAAMi6C;gBAMrDtU,IAAiBA,EAAer8B,IAAI2wC,EAAIS;;YAIrC7vB,GAAmBU,QAAQzwB,KAAKmmE,GAAoBt7B;;IAG7DlsC,GACEgzB,GACA7gB;;;QAQA,MAAMs1D,IAASt1D,EAAMpL,MACf82B,IAA8B4pC,EAAOtnE,SAAS;;;;;QAMpD,IAAIunE,IAAYD;QACX3/D,EAAY4C,EAAcg9D,OAC7BA,IAAYA,EAAUnoD,MAAM;QAG9B,MAAM9P,IAAQ,IAAI2wC,GAAa,IAAIt4C,EAAY4/D,IAAY;;;gBAI3D,IAAIx7B,IAAiB,IAAIl9B,GAAkB1O;QAmB3C,OAjBAe,KAAK+lE,GAAqBjwD,GAAaqpC;YACrC,MAAMmnB,IAAannB,EAAI3+C,IAAIkF;YAC3B,SAAK0gE,EAAOl+C,EAAWo+C;;;;;;YAQjBA,EAAWxnE,WAAW09B,MACxBqO,IAAiBA,EAAer8B,IAAI2wC,EAAIS,OAEnC;WAERxxC,IAEI2hB,GAAmBU,QAAQzwB,KAAKmmE,GAAoBt7B;;IAGrDlsC,GAAoBusC;;;QAG1B,MAAMz+B,IAA0B;QAOhC,OANAy+B,EAASrqC,QAAQiuB;YACf,MAAMY,IAAQ1vB,KAAKgmE,GAAkBl3C;YACvB,SAAVY,KACFjjB,EAAOhL,KAAKiuB;YAGTjjB;;IAGT9N,GACEgzB,GACAjC;QAvMgC/xB,EA4Mf,MAFEqC,KAAKumE,GAAuB72C,EAAMZ,SAAS,aAK9D9uB,KAAKyyB,GAAcyiB;QAEnB,IAAIsxB,IAAaxmE,KAAK+lE;QACtB,OAAOh2C,GAAmBlvB,QAAQ6uB,EAAMV,WAAY3O;YAClD,MAAM8+B,IAAM,IAAIJ,GAAa1+B,EAAS7f,KAAKkvB,EAAMZ;YAEjD,OADA03C,IAAaA,EAAWt2D,OAAOivC,IACxBn/C,KAAKu+B,GAAkB8M,GAC5B1Z,GACAtR,EAAS7f;WAEVgG,KAAK;YACNxG,KAAK+lE,KAAuBS;;;IAIhC7nE,GAAyBmwB;;;IAIzBnwB,GACE45B,GACA/3B;QAEA,MAAM2+C,IAAM,IAAIJ,GAAav+C,GAAK,IAC5Bk/C,IAAW1/C,KAAK+lE,GAAqBpmB,GAAkBR;QAC7D,OAAOpvB,GAAmBU,QAAQjwB,EAAI8D,QAAQo7C,KAAYA,EAASl/C;;IAGrE7B,GACE45B;QAQA,OANIv4B,KAAKyyB,GAAc3zB,QAMhBixB,GAAmBU;;;;;;;;;WAWpB9xB,GAAuBmwB,GAAkB9iB;QAM/C,OALchM,KAAKkmE,GAAep3C;;;;;;;;;;WAiB5BnwB,GAAemwB;QACrB,IAAkC,MAA9B9uB,KAAKyyB,GAAc3zB;;QAErB,OAAO;;;;;gBAQT,OAAOgwB,IADc9uB,KAAKyyB,GAAc,GAAG3D;;;;;WAQrCnwB,GAAkBmwB;QACxB,MAAMvvB,IAAQS,KAAKkmE,GAAep3C;QAClC,OAAIvvB,IAAQ,KAAKA,KAASS,KAAKyyB,GAAc3zB,SACpC,OAGKkB,KAAKyyB,GAAclzB;;;;;;;;;;;;;;;;;;;UC9RxBknE;;;;;IAWX9nE,YACmB+zB,GACAg0C;kBADAh0C,aACAg0C;;QAXX1mE,YAPD,IAAImL,GACT1E,EAAYpH;;QASNW,YAAO;;;;;;;WAiBPrB,GACNgzB,GACA1hB,GACAoP;QAOA,MAAM7e,IAAMyP,EAAIzP,KACV83B,IAAQt4B,KAAK+Q,KAAKvP,IAAIhB,IACtBi9B,IAAenF,IAAQA,EAAMtzB,OAAO,GACpC2hE,IAAc3mE,KAAK0mE,GAAMz2D;QAU/B,OARAjQ,KAAK+Q,OAAO/Q,KAAK+Q,KAAKxF,GAAO/K,GAAK;YAChCk7B,IAAezrB;YACfjL,MAAM2hE;YACNtnD,UAAAA;YAGFrf,KAAKgF,QAAQ2hE,IAAclpC,GAEpBz9B,KAAK0yB,GAAaoL,GACvBnM,GACAnxB,EAAIkF,KAAKie;;;;;;;WAULhlB,GAAYizB;QAClB,MAAM0G,IAAQt4B,KAAK+Q,KAAKvP,IAAIowB;QACxB0G,MACFt4B,KAAK+Q,OAAO/Q,KAAK+Q,KAAKrF,OAAOkmB,IAC7B5xB,KAAKgF,QAAQszB,EAAMtzB;;IAIvBrG,GACEgzB,GACAC;QAEA,MAAM0G,IAAQt4B,KAAK+Q,KAAKvP,IAAIowB;QAC5B,OAAO7B,GAAmBU,QAAQ6H,IAAQA,EAAM7G,KAAgB;;IAGlE9yB,WACEgzB,GACAI;QAEA,IAAIlC,IAAU7gB;QAKd,OAJA+iB,EAAalxB,QAAQ+wB;YACnB,MAAM0G,IAAQt4B,KAAK+Q,KAAKvP,IAAIowB;YAC5B/B,IAAUA,EAAQtkB,GAAOqmB,GAAa0G,IAAQA,EAAM7G,KAAgB;YAE/D1B,GAAmBU,QAAQZ;;IAGpClxB,GACEgzB,GACA7gB,GACAwiB;QAMA,IAAIzD,IAAU3gB;;;gBAId,MAAMk3D,IAAS,IAAI3/D,EAAYqK,EAAMpL,KAAKwY,MAAM,MAC1C0oD,IAAW5mE,KAAK+Q,KAAK9C,GAAgBm4D;QAC3C,MAAOQ,EAAS14D,QAAW;YACzB,OAAM1N,KACJA,GACArD,QAAOu+B,IAAEjK,GAAapS,UAAEA,MACtBunD,EAASz4D;YACb,KAAK2C,EAAMpL,KAAKwiB,EAAW1nB,EAAIkF,OAC7B;YAEE2Z,EAAS3F,EAAU4Z,MAAkB,KAIvC7B,aAAyBzd,MACzBqZ,GAAavc,GAAO2gB,OAEpB5B,IAAUA,EAAQtkB,GAAOkmB,EAAcjxB,KAAKixB;;QAGhD,OAAO1B,GAAmBU,QAAQZ;;IAGpClxB,GACEgzB,GACAzpB;QAEA,OAAO6nB,GAAmBlvB,QAAQb,KAAK+Q,MAAOvQ,KAAqB0H,EAAE1H;;IAGvE7B,GAAgBotB;;;QAKd,OAAO,IAAI06C,GAA0Bl1C,GAA2BvxB;;IAGlErB,GAAQ45B;QACN,OAAOxI,GAAmBU,QAAQzwB,KAAKgF;;;;;;GAMzCyhE,SAA4C,cAAcl1C;IACxD5yB,YAA6B4+B;QAC3Bp6B,mBAD2Bo6B;;IAInB5+B,GACRgzB;QAEA,MAAMN,IAA4C;QAUlD,OATArxB,KAAK4Q,GAAQ/P,QAAQ,CAACL,GAAKyP;YACrBA,IACFohB,EAAS5vB,KACPzB,KAAKu9B,GAAcI,GAAShM,GAAa1hB,GAAKjQ,KAAKqf,aAGrDrf,KAAKu9B,GAAcM,GAAYr9B;YAG5BuvB,GAAmBuB,GAAQD;;IAG1B1yB,GACRgzB,GACAC;QAEA,OAAO5xB,KAAKu9B,GAAcxK,GAASpB,GAAaC;;IAGxCjzB,GACRgzB,GACAI;QAEA,OAAO/xB,KAAKu9B,GAActK,WAAWtB,GAAaI;;;;;;;;;;;;;;;;;;;;MCjM3C80C;IAyBXloE,YAA6Bi7C;QAAA55C,mBAAA45C;;;;QArB7B55C,UAAkB,IAAIgB,EACpB+4C,KAAKlyC,EAAekyC,IACpBlxC;;QAIM7I,iCAA4BmE,EAAgBkB;;QAE5CrF,uBAA4B;;QAEpCA,UAAsD;;;;;QAKtDA,UAAqB,IAAI8+C,IAEjB9+C,mBAAc,GAEtBA,UAA4Bo+B,GAAkB0oC;;IAI9CnoE,GACE45B,GACArwB;QAGA,OADAlI,KAAK4V,GAAQ/U,QAAQ,CAACc,GAAGwT,MAAejN,EAAEiN,KACnC4a,GAAmBU;;IAG5B9xB,GACEgzB;QAEA,OAAO5B,GAAmBU,QAAQzwB,KAAK4+B;;IAGzCjgC,GACEgzB;QAEA,OAAO5B,GAAmBU,QAAQzwB,KAAK+mE;;IAGzCpoE,GACEgzB;QAGA,OADA3xB,KAAK0+B,kBAAkB1+B,KAAKy+B,GAAkBj4B,QACvCupB,GAAmBU,QAAQzwB,KAAK0+B;;IAGzC//B,GACEgzB,GACAmN,GACAF;QAQA,OANIA,MACF5+B,KAAK4+B,4BAA4BA,IAE/BE,IAA8B9+B,KAAK+mE,OACrC/mE,KAAK+mE,KAAwBjoC;QAExB/O,GAAmBU;;IAGpB9xB,GAAewW;QACrBnV,KAAK4V,GAAQrG,IAAI4F,EAAWrN,QAAQqN;QACpC,MAAM5K,IAAW4K,EAAW5K;QACxBA,IAAWvK,KAAK0+B,oBAClB1+B,KAAKy+B,KAAoB,IAAIL,GAAkB7zB,IAC/CvK,KAAK0+B,kBAAkBn0B,IAErB4K,EAAW1K,iBAAiBzK,KAAK+mE,OACnC/mE,KAAK+mE,KAAwB5xD,EAAW1K;;IAI5C9L,GACEgzB,GACAxc;QAQA,OAFAnV,KAAK++B,GAAe5pB,IACpBnV,KAAKg/B,eAAe,GACbjP,GAAmBU;;IAG5B9xB,GACEgzB,GACAxc;QAOA,OADAnV,KAAK++B,GAAe5pB,IACb4a,GAAmBU;;IAG5B9xB,GACEgzB,GACAxc;QAUA,OAHAnV,KAAK4V,GAAQ1F,OAAOiF,EAAWrN,SAC/B9H,KAAKwmE,GAAWtF,GAAsB/rD,EAAW5K,WACjDvK,KAAKg/B,eAAe;QACbjP,GAAmBU;;IAG5B9xB,GACEgzB,GACAyN,GACAC;QAEA,IAAI9+B,IAAQ;QACZ,MAAMymE,IAA4C;QAalD,OAZAhnE,KAAK4V,GAAQ/U,QAAQ,CAACL,GAAK2U;YAEvBA,EAAW1K,kBAAkB20B,KACgB,SAA7CC,EAAgB79B,IAAI2T,EAAW5K,cAE/BvK,KAAK4V,GAAQ1F,OAAO1P,IACpBwmE,EAASvlE,KACPzB,KAAKk/B,GAA8BvN,GAAaxc,EAAW5K;YAE7DhK;YAGGwvB,GAAmBuB,GAAQ01C,GAAUxgE,KAAK,MAAMjG;;IAGzD5B,GACEgzB;QAEA,OAAO5B,GAAmBU,QAAQzwB,KAAKg/B;;IAGzCrgC,GACEgzB,GACA7pB;QAEA,MAAMqN,IAAanV,KAAK4V,GAAQpU,IAAIsG,MAAW;QAC/C,OAAOioB,GAAmBU,QAAQtb;;IAGpCxW,GACE45B,GACAjpB,GACA/E;QAGA,OADAvK,KAAKwmE,GAAWS,GAAc33D,GAAM/E,IAC7BwlB,GAAmBU;;IAG5B9xB,GACE45B,GACAjpB,GACA/E;QAEAvK,KAAKwmE,GAAWU,GAAiB53D,GAAM/E;QACvC,MAAMg0B,IAAoBv+B,KAAK45C,YAAYrb,IACrClN,IAA4C;QAMlD,OALIkN,KACFjvB,EAAKzO,QAAQL;YACX6wB,EAAS5vB,KAAK88B,EAAkB8M,GAAwB9S,GAAK/3B;YAG1DuvB,GAAmBuB,GAAQD;;IAGpC1yB,GACE45B,GACAhuB;QAGA,OADAvK,KAAKwmE,GAAWtF,GAAsB32D,IAC/BwlB,GAAmBU;;IAG5B9xB,GACE45B,GACAhuB;QAEA,MAAM48D,IAAennE,KAAKwmE,GAAWY,GAAgB78D;QACrD,OAAOwlB,GAAmBU,QAAQ02C;;IAGpCxoE,GACE45B,GACA/3B;QAEA,OAAOuvB,GAAmBU,QAAQzwB,KAAKwmE,GAAWl+B,GAAY9nC;;;;;;;;;;;;;;;;;;;;;;;;MCtLrD6mE;;;;;;;IAwBX1oE,YACE2oE;QAhBFtnE,UAAkE,IAGlEA,UAAkC,IAAIg1B,GAAe,IAErDh1B,WAAmB,GAajBA,KAAKiiC,MAAW,GAChBjiC,KAAKu+B,KAAoB+oC,EAAyBtnE;QAClDA,KAAK+gC,KAAc,IAAI8lC,GAAkB7mE;QAGzCA,KAAK0yB,KAAe,IAAI4E,IACxBt3B,KAAKwyB,KAAsB,IAAIi0C,GAC7BzmE,KAAK0yB,IAJQziB,KACbjQ,KAAKu+B,GAAkBgpC,GAAat3D;;IAQxCtR;QACE,OAAOgyB,QAAQF;;IAGjB9xB;;QAGE,OADAqB,KAAKiiC,MAAW,GACTtR,QAAQF;;IAGjBmV;QACE,OAAO5lC,KAAKiiC;;IAGdtjC;;;IAIAA;QACE,OAAOqB,KAAK0yB;;IAGd/zB,GAAiBknC;QACf,IAAIjQ,IAAQ51B,KAAKwnE,GAAe3hC,EAAKk7B;QAQrC,OAPKnrC,MACHA,IAAQ,IAAIkwC,GACV9lE,KAAK0yB,IACL1yB,KAAKu+B,KAEPv+B,KAAKwnE,GAAe3hC,EAAKk7B,QAAWnrC,IAE/BA;;IAGTj3B;QACE,OAAOqB,KAAK+gC;;IAGdpiC;QACE,OAAOqB,KAAKwyB;;IAGd7zB,eACEqN,GACAg6B,GACAC;QAIA1pC,EA7FY,qBA6FM,yBAAyByP;QAC3C,MAAMusB,IAAM,IAAIkvC,GAAkBznE,KAAKgiC,GAAex7B;QAEtD,OADAxG,KAAKu+B,GAAkBmpC,MAChBzhC,EAAqB1N,GACzB/xB,KAAKiG,KACGzM,KAAKu+B,GACTopC,GAAuBpvC,GACvB/xB,KAAK,MAAMiG,IAEfojC,KACAvO,KAAK70B,MACJ8rB,EAAIkO;QACGh6B;;IAIb9N,GACEgzB,GACAnxB;QAEA,OAAOuvB,GAAmB63C,GACxBnnE,OAAOgY,OAAOzY,KAAKwnE,IAAgB3qE,IAAI+4B,KAAS,MAC9CA,EAAM0S,GAAY3W,GAAanxB;;;;;;;UAU1BinE,WAA0Br1C;IACrCzzB,YAAqB2hC;QACnBn9B,mBADmBm9B;;;;MAWVunC;IAMXlpE,YAAqCi7C;QAAA55C,mBAAA45C;;QAJrC55C,UAA4C,IAAI8+C;;QAEhD9+C,UAAsD;;IAItDrB,UAAei7C;QACb,OAAO,IAAIiuB,GAAoBjuB;;IAGjCkuB;QACE,IAAK9nE,KAAK+nE,IAGR,OAAO/nE,KAAK+nE;QAFZ,MAhLqDxqE;;IAsLzDoB,GACE45B,GACAhuB,GACA/J;QAIA,OAFAR,KAAKgoE,GAAoBjoC,GAAav/B,GAAK+J,IAC3CvK,KAAKioE,GAAkB/3D,OAAO1P,IACvBuvB,GAAmBU;;IAG5B9xB,GACE45B,GACAhuB,GACA/J;QAIA,OAFAR,KAAKgoE,GAAoBhoC,GAAgBx/B,GAAK+J,IAC9CvK,KAAKioE,GAAkBz5D,IAAIhO,IACpBuvB,GAAmBU;;IAG5B9xB,GACE45B,GACA/3B;QAGA,OADAR,KAAKioE,GAAkBz5D,IAAIhO,IACpBuvB,GAAmBU;;IAG5B9xB,aACE45B,GACApjB;QAEiBnV,KAAKgoE,GAAoB9G,GACxC/rD,EAAW5K,UAEJ1J,QAAQL,KAAOR,KAAKioE,GAAkBz5D,IAAIhO;QACnD,MAAMguC,IAAQxuC,KAAK45C,YAAYlS;QAC/B,OAAO8G,EACJsP,GAA2BvlB,GAAKpjB,EAAW5K,UAC3C/D,KAAK8I;YACJA,EAAKzO,QAAQL,KAAOR,KAAKioE,GAAkBz5D,IAAIhO;WAEhDgG,KAAK,MAAMgoC,EAAMlP,GAAiB/G,GAAKpjB;;IAG5CxW;QACEqB,KAAK+nE,KAAqB,IAAIjZ;;IAGhCnwD,GACE45B;;QAGA,MACMiQ,IADQxoC,KAAK45C,YAAYnR,KACJC;QAC3B,OAAO3Y,GAAmBlvB,QACxBb,KAAKioE,IACJznE,KACQR,KAAKkoE,GAAa3vC,GAAK/3B,GAAKgG,KAAK0hE;YACjCA,KACH1/B,EAAa3K,GAAYr9B;YAI/BgG,KAAK,OACLxG,KAAK+nE,KAAqB,MACnBv/B,EAAa/+B,MAAM8uB;;IAI9B55B,GACE45B,GACA/3B;QAEA,OAAOR,KAAKkoE,GAAa3vC,GAAK/3B,GAAKgG,KAAK0hE;YAClCA,IACFloE,KAAKioE,GAAkB/3D,OAAO1P,KAE9BR,KAAKioE,GAAkBz5D,IAAIhO;;;IAKjC7B,GAAasR;;QAEX,OAAO;;IAGDtR,GACN45B,GACA/3B;QAEA,OAAOuvB,GAAmB63C,GAAG,EAC3B,MACE73C,GAAmBU,QAAQzwB,KAAKgoE,GAAoB1/B,GAAY9nC,KAClE,MAAMR,KAAK45C,YAAYlS,KAAiBY,GAAY/P,GAAK/3B,IACzD,MAAMR,KAAK45C,YAAYrR,GAAyBhQ,GAAK/3B;;;;;;;;;;;;;;;;;;;;;;;;UClR9C2nE;IAQXxpE,YAAY/B;QACVoD,KAAKooE,KAASxrE,EAAKwrE,IACnBpoE,KAAKqoE,KAAUzrE,EAAKyrE;;IAGtB1pE,GAAOqxB;QAELhwB,KAAKsoE,KAAgBt4C;;IAGvBrxB,GAAQqxB;QAENhwB,KAAKuoE,KAAiBv4C;;IAGxBrxB,UAAUqxB;QAERhwB,KAAKwoE,KAAmBx4C;;IAG1BrxB;QACEqB,KAAKqoE;;IAGP1pE,KAAKnC;QACHwD,KAAKooE,GAAO5rE;;IAGdmC;QAKEqB,KAAKsoE;;IAGP3pE,GAAYqyB;QAKVhxB,KAAKuoE,GAAev3C;;IAGtBryB,GAAcnC;QAKZwD,KAAKwoE,GAAiBhsE;;;;;;;;;;;;;;;;;;;GChC1B,OASMisE,KAAmD;IACzDC,mBAA6C;IAC7CC,QAAkC;GAK5BC,KAA0B,iBAAiB3sE;;MAIpC4sE;IAKXlqE,YAAYmqE;QACV9oE,KAAKL,IAAampE,EAAKnpE;QACvB,MAAMmf,IAAQgqD,EAAKhpE,MAAM,UAAU;QACnCE,KAAK+oE,KAAUjqD,IAAQ,QAAQgqD,EAAKjpE,MACpCG,KAAKD,mBAAmB+oE,EAAK/oE;;;;;WAOvBpB,GACNqsD,GACA0B;QAEA,IAAIA,GACF,KAAK,MAAMsc,KAAUtc,EAAMrD,IACrBqD,EAAMrD,GAAY1oD,eAAeqoE,OACnChe,EAAQge,KAAUtc,EAAMrD,GAAY2f;QAI1Che,EAAQ,uBAAuB4d;;IAGjCjqE,GACE6vD,GACApf,GACAsd;QAEA,MAAMuc,IAAMjpE,KAAKkpE,GAAQ1a;QAEzB,OAAO,IAAI79B,QAAQ,CAACF,GAAyBC;YAC3C,MAAMy4C,IAAM,IAAIC;YAChBD,EAAIE,WAAWC,EAAUC,UAAU;gBACjC;oBACE,QAAQJ,EAAIK;sBACV,KAAKC,EAAUC;wBACb,MAAMC,IAAOR,EAAIS;wBACjBrtE,EAhEE,cAgEgB,iBAAiBa,KAAKC,UAAUssE,KAClDl5C,EAAQk5C;wBACR;;sBACF,KAAKF,EAAUI;wBACbttE,EApEE,cAoEgB,UAAUiyD,IAAU,gBACtC99B,EACE,IAAIztB,EAAelB,EAAKK,mBAAmB;wBAE7C;;sBACF,KAAKqnE,EAAUK;wBACb,MAAMlqD,IAASupD,EAAIY;wBAQnB,IAPAxtE,EA3EE,cA6EA,UAAUiyD,IAAU,yBACpB5uC,GACA,kBACAupD,EAAIa;wBAEFpqD,IAAS,GAAG;4BACd,MAAMqqD,IAAiBd,EAAIS,kBACxB1sE;4BACH,IACI+sE,KACAA,EAAcrqD,UACdqqD,EAAcxsE,SAChB;gCACA,MAAMysE,alEwK2BtqD;oCACjD,MAAMuqD,IAAcvqD,EAAOwqD,cAAclkE,QAAQ,KAAK;oCACtD,OAAOzF,OAAOgY,OAAO1W,GAAM4D,QAAQwkE,MAAwB,IACtDA,IACDpoE,EAAKG;iCkE5KkCmoE,CACzBJ,EAAcrqD;gCAEhB8Q,EACE,IAAIztB,EACFinE,GACAD,EAAcxsE;mCAIlBizB,EACE,IAAIztB,EACFlB,EAAKG,SACL,kCAAkCinE,EAAIY;;;;wBAO5CxtE,EA9GA,cA8GkB,UAAUiyD,IAAU,aACtC99B,EACE,IAAIztB,EAAelB,EAAKgB,aAAa;wBAGzC;;sBACF;wBACExF;;;oBAYJhB,EAjIM,cAiIY,UAAUiyD,IAAU;;;;;;YAO1C,MAAM8b,IAAW7pE,kBAAK2uC;mBACfk7B,EAAQnqE;YAEf,MAAMoqE,IAAgBntE,KAAKC,UAAUitE;YACrC/tE,EA5IU,cA4IQ,iBAAiB0sE,IAAM,MAAMsB;;;;;;YAM/C,MAAMvf,IAAqB;gBAAEwf,gBAAgB;;YAE7CxqE,KAAKyqE,GAAwBzf,GAAS0B,IAEtCyc,EAAIld,KAAKgd,GAAK,QAAQsB,GAAevf,GApIlB;;;IAwIvBrsD,GACE6vD,GACApf,GACAsd;;;QAIA,OAAO1sD,KAAK0uD,GAAuBF,GAASpf,GAASsd;;IAGvD/tD,GACE6vD,GACA9B;QAEA,MAAMge,IAAW,EACf1qE,KAAK+oE,IACL,KAxKqB,iCA0KrB,KACAva,GACA,cAEImc,IAAsBC,KACtBx7B,IAA6B;;;YAGjCy7B,oBAAoB;YACpBC,oBAAoB;YACpBC,kBAAkB;;;gBAGhB5qE,UAAU,YAAYH,KAAKL,EAAWO,uBAAuBF,KAAKL,EAAWQ;;YAE/E6qE,cAAa;YACbC,yBAAwB;YACxBC,uBAAuB;;;;;;;gBAOrBC,gCAAgC;;YAElCprE,kBAAkBC,KAAKD;;QAGzBC,KAAKyqE,GAAwBr7B,EAA2B,oBAAEsd;;;;;;;;;;;;;;;;QAoBvD0e,OACAC,OACAC,OACAC,OACAC,OACAC,QAEDr8B,EAAQs8B,4BAA4B;QAGtC,MAAMzC,IAAMyB,EAASllE,KAAK;QAC1BjJ,EAxOY,cAwOM,0BAA0B0sE,IAAM,MAAM75B;QACxD,MAAMu8B,IAAUhB,EAAoBiB,iBAAiB3C,GAAK75B;;;;;;gBAO1D,IAAIy8B,KAAS,GAKTC,KAAS;;;;gBAEb,MAAMC,IAAe,IAAI5D,GAAwB;YAC/C6D,IAASxvE;gBACFsvE,IASHvvE,EAlQM,cAkQY,6CAA6CC,MAR1DqvE,MACHtvE,EA3PI,cA2Pc;gBAClBovE,EAAQr8B,QACRu8B,KAAS,IAEXtvE,EA/PM,cA+PY,uBAAuBC,IACzCmvE,EAAQ1f,KAAKzvD;;YAKjByvE,IAAS,MAAMN,EAAQvpC;YAOnB8pC,IAAuB,CAC3Bv7D,GACA7P;;;YAIA6qE,EAAQrN,OAAO3tD,GAAOw7D;gBACpB;oBACErrE,EAAGqrE;kBACH,OAAO7uE;oBACPk2C,WAAW;wBACT,MAAMl2C;uBACL;;;;;;;;gBAuFT,OAlFA4uE,EAAqBE,EAAW9C,UAAU+C,MAAM;YACzCP,KACHvvE,EA/RQ,cA+RU;YAItB2vE,EAAqBE,EAAW9C,UAAUgD,OAAO;YAC1CR,MACHA,KAAS,GACTvvE,EAtSQ,cAsSU,gCAClBwvE,EAAaQ;YAIjBL,EAA4BE,EAAW9C,UAAUrsE,OAAO+zB;YACjD86C,MACHA,KAAS,YtFjTOtvE,MAAgBC;gBACtC,IAAIN,EAAUG,YAAYI,EAAS8vE,MAAM;oBACvC,MAAM5vE,IAAOH,EAAII,IAAIC;oBACrBX,EAAUswE,KAAK,cAAcxwE,OAAiBO,QAAUI;;asF+SpD8vE,CA9SQ,cA8SS,iCAAiC17C,IAClD+6C,EAAaQ,GACX,IAAItpE,EACFlB,EAAKgB,aACL;YAaRmpE,EACEE,EAAW9C,UAAUqD,SACrBnwE;;YACE,KAAKsvE,GAAQ;gBACX,MAAMc,IAAUpwE,EAAKoR,KAAK;gBAjU9BjQ,IAkUiBivE;;;;;;gBAMb,MAAMC,IAA2CD,GAC3C1vE,IACJ2vE,EAAe3vE,wBACd2vE,EAAqC,iCAAI3vE;gBAC5C,IAAIA,GAAO;oBACTX,EA/UI,cA+Uc,8BAA8BW;;oBAEhD,MAAM0iB,IAAiB1iB,EAAM0iB;oBAC7B,IAAI1c,alEvRqB0c;;;wBAGnC,MAAM1c,IAAgB6H,GAAQ6U;wBAC9B,SAAate,MAAT4B,GAIJ,OAAO+H,GAAmB/H;qBkE+QL4pE,CAAqBltD,IAC5BniB,IAAUP,EAAMO;yBACP6D,MAAT4B,MACFA,IAAOnB,EAAKe,UACZrF,IACE,2BACAmiB,IACA,mBACA1iB,EAAMO;;oBAGVquE,KAAS,GACTC,EAAaQ,GAAY,IAAItpE,EAAeC,GAAMzF,KAClDkuE,EAAQvpC;uBAER7lC,EAjWI,cAiWc,wBAAwBqwE,IAC1Cb,EAAagB,GAAcH;;YAMnCp5B,WAAW;;;;;YAKTu4B,EAAaiB;WACZ,IACIjB;;;IAITptE,GAAQ6vD;QACN,MAAMye,IAAaxE,GAAsBja;QAKzC,OACExuD,KAAK+oE,KACL,kBAGA/oE,KAAKL,EAAWO,YAChB,gBACAF,KAAKL,EAAWQ,WAChB,gBACA8sE;;;;;;;;;;;;;;;;;;;;;;;;;MCtZOC;IAOXvuE;QANAqB,UAA4C,MAC1CA,KAAKmtE,MACPntE,UAA8C,MAC5CA,KAAKotE,MACPptE,UAAmD,IAGjDA,KAAKqtE;;IAGP1uE,GAAYqxB;QACVhwB,KAAKygE,GAAUh/D,KAAKuuB;;IAGtBrxB;QACE+hC,OAAOqG,oBAAoB,UAAU/mC,KAAKstE,KAC1C5sC,OAAOqG,oBAAoB,WAAW/mC,KAAKutE;;IAGrC5uE;QACN+hC,OAAOkG,iBAAiB,UAAU5mC,KAAKstE,KACvC5sC,OAAOkG,iBAAiB,WAAW5mC,KAAKutE;;IAGlC5uE;QACNpC,EA/BY,uBA+BM;QAClB,KAAK,MAAMyzB,KAAYhwB,KAAKygE,IAC1BzwC;;IAIIrxB;QACNpC,EAtCY,uBAsCM;QAClB,KAAK,MAAMyzB,KAAYhwB,KAAKygE,IAC1BzwC;;;;;IAOJrxB;QACE,OACoB,sBAAX+hC,eACqBp/B,MAA5Bo/B,OAAOkG,yBACwBtlC,MAA/Bo/B,OAAOqG;;;;;;;;;;;;;;;;;;;UC3DAymC;IACX7uE,GAAYqxB;;;IAIZrxB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACqCF,MAAM8uE,KACJ;;;;;UAuCWC;IASX/uE,iBAAiBgvE;QACf3tE,KAAKw9D,KAAoBx9D,KAAK4tE,GAAwBD,IACtD3tE,KAAK45C,cAAc55C,KAAK6tE,GAAkBF,UACpC3tE,KAAK45C,YAAYxrC;QACvBpO,KAAK8tE,KAAc9tE,KAAK+tE,GAAiCJ,IACzD3tE,KAAKi4C,KAAaj4C,KAAKguE,GAAiBL,IACxC3tE,KAAKu9D,KAAcv9D,KAAKiuE,GAAkBN,IAC1C3tE,KAAK4yD,KAAa5yD,KAAKkuE,GAAiBP;QACxC3tE,KAAKmuE,KAAenuE,KAAKouE,GAAmBT,IAE5C3tE,KAAKw9D,GAAkBxN,KAAqB0F,KAC1C11D,KAAK4yD,GAAWgN,GACdlK;QAGJ11D,KAAKu9D,GAAY3K,KAAa5yD,KAAK4yD,UAE7B5yD,KAAKi4C,GAAW7pC,eAChBpO,KAAKw9D,GAAkBpvD,eACvBpO,KAAKu9D,GAAYnvD;cAEjBpO,KAAKu9D,GAAYwF,GAAkB/iE,KAAK4yD,GAAWyL;;IAG3D1/D,GAAmBgvE;QACjB,OAAO,IAAIhK,GAAa3jE,KAAK4yD;;IAG/Bj0D,GACEgvE;QAEA,OAAO;;IAGThvE,GAAiBgvE;QACf,OAAOtvB,GACLr+C,KAAK45C,aACL,IAAIwrB,IACJuI,EAAI7zB;;IAIRn7C,GAAkBgvE;QAChB,IAAIA,EAAIU,GAAoBC,IAC1B,MAAM,IAAIrrE,EACRlB,EAAKW,qBACL+qE;QAGJ,OAAO,IAAIpG,GAAkBQ,GAAoB0G;;IAGnD5vE,GAAkBgvE;QAChB,OAAO,IAAIld,GACTzwD,KAAKi4C,IACL01B,EAAI9e,IACJ8e,EAAIh6B,IACJ+hB,KACE11D,KAAK4yD,GAAWgN,GACdlK,yBC1IJwX,GAA2BtsC,OACtB,IAAIssC,KAEJ,IAAIM;;ID8Ib7uE,GAAwBgvE;QACtB,OAAO,IAAIhU;;IAGbh7D,GAAiBgvE;QACf,OAAOvL,GACLpiE,KAAKi4C,IACLj4C,KAAKu9D,IACLoQ,EAAI9e,IACJ7uD,KAAKw9D,IACLmQ,EAAI7zB,IACJ6zB,EAAIlQ;;IAIR9+D,iBACEgB,GACAC;QAEA,MAAM,IAAIqD,EACRlB,EAAKW,qBACL+qE;;;;;;UAQOe,WAAmCd;IAG9C/uE,GAAiBgvE;QACf,OAAOtvB,GACLr+C,KAAK45C,aACL,IAAIwrB,IACJuI,EAAI7zB;;IAIRn7C,GAAiBgvE;QACf,OAAOvL,GACLpiE,KAAKi4C,IACLj4C,KAAKu9D,IACLoQ,EAAI9e,IACJ7uD,KAAKw9D,IACLmQ,EAAI7zB,IACJ6zB,EAAIlQ;;IAIR9+D,GACEgvE;QAEA,MAAMrmC,IAAmBtnC,KAAK45C,YAAYrb,GACvC+I;QACH,OAAO,IAAIyQ,GAAazQ,GAAkBqmC,EAAIh6B;;IAGhDh1C,GAAkBgvE;QAMhB,MAAM/tE,IAAiBupC,GACrBwkC,EAAIc,GAAa9uE,GACjBguE,EAAIc,GAAa7uE,iBAEbyd,IAAaooC,GAAckoB,EAAIc,GAAa9uE;QAClD,OAAO,IAAI64B,GACTm1C,EAAIU,GAAoBK,iBACxB9uE,GACA+tE,EAAIntC,UACJ8W,GAAUq3B,GAAchB,EAAIU,GAAoBO,iBAChDjB,EAAIh6B,IACJF,MlChOuB,sBAAbz9B,WAA2BA,WAAW,MkCkOhDqH,GACArd,KAAKw9D,IACLmQ,EAAIU,GAAoB1tC;;IAI5BhiC,GAAwBgvE;QACtB,OAAO,IAAIhU;;IAGbh7D,iBACEgB,GACAC;QAEA,OtCyiCG0iC,eACL1iC;YAEA,KAAKshC,GAASN,MACZ,OAAOjQ,QAAQF;YAEjB,MAAMqQ,IAASlhC,IAjsCY;kBAksCrBshC,GAAShxB,OAAO4wB;SsChjCb+tC,CACL1lC,GAAuBxpC,GAAYC;;;;;;;;;;;UAa5BkvE,WAA2CN;IAItD7vE,iBAAiBgvE;cACTxqE,MAAM4rE,WAAWpB;;;cAIjB3tE,KAAK45C,YAAYo1B,GAAwB1sC,MAAMZ;kBAC5C1hC,KAAK4yD,GAAkCmQ,GAC5CrhC,IAEE1hC,KAAK8tE,OACHpsC,MAAc1hC,KAAK8tE,GAAYtrC,KACjCxiC,KAAK8tE,GAAY1/D,MAAMpO,KAAKi4C,MAClBvW,KACV1hC,KAAK8tE,GAAYzb;;;IAMzB1zD,GAAiBgvE;;QACf,O/B83BF/zB,I+B73BI55C,KAAK45C,a/B83BTC,I+B73BI,IAAIurB,I/B83BRtrB,I+B73BI6zB,EAAI7zB,I/B+3BD,IAAIwE,GAAuB1E,GAAaC,GAAaC;YAJ5DF,GACAC,GACAC;;I+Bz3BAn7C,GAAiBgvE;QACf,MAAM/a,KXkiCR3a,IWjiCIj4C,KAAKi4C,IXkiCTslB,IWjiCIv9D,KAAKu9D,IXkiCT1O,IWjiCI8e,EAAI9e,IXkiCR2O,IWjiCIx9D,KAAKw9D,IXkiCT5T,IWjiCI+jB,EAAI7zB,IXkiCR2jB,IWjiCIkQ,EAAIlQ;QXmiCD,IAAI4E,GACTpqB,GACAslB,GACA1O,GACA2O,GACA5T,GACA6T;YAbFxlB,GACAslB,GACA1O,GACA2O,GACA5T,GACA6T;QW5hCE,OAHIz9D,KAAKw9D,cAA6B5H,OACpC51D,KAAKw9D,GAAkB5K,KAAaA,IAE/BA;;IAGTj0D,GAAwBgvE;QACtB,IACEA,EAAIU,GAAoBC,MACxBX,EAAIU,GAAoBK,iBACxB;YACA,MAAMhuC,IAAS+S;YACf,KAAKmiB,GAA4Bh1B,GAAYF,IAC3C,MAAM,IAAIz9B,EACRlB,EAAKc,eACL;YAGJ,MAAMjD,IAAiBupC,GACrBwkC,EAAIc,GAAa9uE,GACjBguE,EAAIc,GAAa7uE;YAEnB,OAAO,IAAIg2D,GACTl1B,GACAitC,EAAIh6B,IACJ/zC,GACA+tE,EAAIntC,UACJmtC,EAAI7zB;;QAGR,OAAO,IAAI6f;;;;;;;;;;;;;;;;;;;;;;;;;MEpRFsV;IAoBXtwE,YACUwuD;;;;;;;;;IASAxZ;QATA3zC,mBAAAmtD,aASAxZ,GAZO3zC,gBAAWtB,EAAOwwE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;WAoDnCvwE,MACE8vE,GACAU,GACAd;QAEAruE,KAAKyuD,MAELzuD,KAAKyuE,KAAeA;;;;;;;QASpB,MAAMW,IAAqB,IAAI35C,IAQzB45C,IAAoB,IAAI55C;;;;;;;gBAE9B,IAAI65C,KAAc;;;;QA4BlB,OA3BAtvE,KAAKmtD,YAAYoiB,GAAkB1pC;YACjC,KAAKypC,GAKH,OAJAA,KAAc,GAEd/yE,EA7HQ,mBA6HU,uBAAuBspC,EAAKwD,MAEvCrpC,KAAKwvE,GACVL,GACAd,GACAxoC,GACAwpC,GACA/tC,KAAK8tC,EAAmB3+C,SAAS2+C,EAAmB1+C;YAEtD1wB,KAAK2zC,GAAWvQ,GAAiB,MAC/BpjC,KAAKu9D,GAAY7I,GAAuB7uB;;;QAM9C7lC,KAAK2zC,GAAW7Q,GAAiB,MACxBssC,EAAmB15C,UAMrB25C,EAAkB35C;;kFAI3B/2B;QAEE,OADAqB,KAAKyuD,MACEzuD,KAAK2zC,GAAWiB,QAAQ,MACtB50C,KAAK4yD,GAAWd;;;;;;;;;;;;;;;;;;;;;WAwBnBnzD,SACNwwE,GACAd,GACAxoC,GACAwpC;QAEA;;;;YAKE,MAAM7jB,WDzNkBijB,ICyNezuE,KAAKyuE,IDxNzC99C,QAAQF,QAAQ,IAAIo4C,GAAqB4F,MCyNtCpxD,IAAaooC,GAAczlD,KAAKyuE,GAAa9uE,IAC7CkvD,arB7HVrD,GACA2B,GACA9vC;gBAEA,OAAO,IAAIixC,GAAc9C,GAAY2B,GAAa9vC;aqByH5BoyD,CAAajkB,GAAYxrD,KAAKmtD,aAAa9vC;kBAEvD8xD,EAAkBJ,WAAW;gBACjCW,IAAY1vE,KAAK2zC;gBACjBg8B,IAAc3vE,KAAKyuE;gBACnBmB,IAAA/gB;gBACAruB,UAAUxgC,KAAKwgC;gBACfqvC,IAAahqC;gBACbiqC,IAvMiC;gBAwMjCC,IAAA1B;gBAGFruE,KAAK45C,cAAcu1B,EAAkBv1B,aACrC55C,KAAKw9D,KAAoB2R,EAAkB3R,IAC3Cx9D,KAAKi4C,KAAak3B,EAAkBl3B,IACpCj4C,KAAKu9D,KAAc4R,EAAkB5R;YACrCv9D,KAAK4yD,KAAauc,EAAkBvc,IACpC5yD,KAAK8tE,KAAcqB,EAAkBrB,IACrC9tE,KAAKgwE,KAAWb,EAAkBhB;;;YAIlCnuE,KAAK45C,YAAYq2B,GAA2B3tC;sBACpCtiC,KAAKkwE;gBAGbb,EAAkB5+C;UAClB,OAAOvzB;;YAMP;;;YAHAmyE,EAAkB3+C,OAAOxzB,KAGpB8C,KAAKmwE,GAAYjzE,IACpB,MAAMA;YAOR,OALAkzE,QAAQ3D,KACN,+EAEEvvE;YAEG8C,KAAKwvE,GACV,IAAI9B,IACJ;gBAAE2C,KAAS;eACXxqC,GACAwpC;;YDxQsBZ;;;;;WCiRpB9vE,GAAYzB;QAClB,OAAmB,oBAAfA,EAAMmG,OAENnG,EAAMgG,SAASnB,EAAKW,uBACpBxF,EAAMgG,SAASnB,EAAKc,kBAGE,sBAAjBytE,gBACPpzE,aAAiBozE;;;;QAxPc,OAqQ7BpzE,EAAMgG,QAtQgB,OAuQtBhG,EAAMgG;;;QAxQsB,OA2Q5BhG,EAAMgG;;;;;WAWJvE;QACN,IAAIqB,KAAK2zC,GAAW48B,IAClB,MAAM,IAAIttE,EACRlB,EAAKW,qBACL;;qFAMN/D;QAEE,OADAqB,KAAKyuD,MACEzuD,KAAK2zC,GAAWiB,QAAQ,MACtB50C,KAAK4yD,GAAWqP;;IAI3BtjE;QACE,OAAOqB,KAAK2zC,GAAW68B,GAA2BluC;;YAE5CtiC,KAAK8tE,MACP9tE,KAAK8tE,GAAYzb,cAGbryD,KAAKu9D,GAAYt2B,YACjBjnC,KAAKw9D,GAAkBv2B,YACvBjnC,KAAK45C,YAAY3S;;;;YAKvBjnC,KAAKmtD,YAAYsjB;;;;;;;WASrB9xE;QACEqB,KAAKyuD;QAEL,MAAM3a,IAAW,IAAIre;QAIrB,OAHAz1B,KAAK2zC,GAAW7Q,GAAiB,MACxB9iC,KAAK4yD,GAAW8d,GAA8B58B,KAEhDA,EAASpe;;IAGlB/2B,OACEmS,GACAyzD,GACAx4C;QAEA/rB,KAAKyuD;QACL,MAAMp8B,IAAW,IAAIoyC,GAAc3zD,GAAOyzD,GAAUx4C;QAEpD,OADA/rB,KAAK2zC,GAAW7Q,GAAiB,MAAM9iC,KAAKgwE,GAAS1R,OAAOjsC,KACrDA;;IAGT1zB,GAAS0zB;;;QAGHryB,KAAK2wE,MAGT3wE,KAAK2zC,GAAW7Q,GAAiB,MACxB9iC,KAAKgwE,GAAShR,GAAS3sC;;IAIlC1zB,SACEswB;QAEAjvB,KAAKyuD;QACL,MAAM3a,IAAW,IAAIre;QA4BrB,aA3BMz1B,KAAK2zC,GAAWiB,QAAQtS;YAC5B;gBACE,MAAM7Z,UAAiBzoB,KAAKi4C,GAAW24B,GAAa3hD;gBAChDxG,aAAoBzU,KACtB8/B,EAASrjB,QAAQhI,KACRA,aAAoBvU,KAC7B4/B,EAASrjB,QAAQ,QAEjBqjB,EAASpjB,OACP,IAAIztB,EACFlB,EAAKgB,aACL;cAON,OAAOzF;gBACP,MAAM63D,IAAiB/e,GACrB94C,GACA,2BAA2B2xB;gBAE7B6kB,EAASpjB,OAAOykC;;YAIbrhB,EAASpe;;IAGlB/2B,SAAiCmS;QAC/B9Q,KAAKyuD;QACL,MAAM3a,IAAW,IAAIre;QAsBrB,aArBMz1B,KAAK2zC,GAAWiB,QAAQtS;YAC5B;gBACE,MAAMg6B,UAAoBt8D,KAAKi4C,GAAWsmB,GACxCztD;2CAC0B,IAEtBssD,IAAO,IAAIrD,GAAKjpD,GAAOwrD,EAAYze,KACnC2gB,IAAiBpB,EAAKb,GAAkBD,EAAYhrD,YACpD0rC,IAAaogB,EAAKlrC,GACtBssC;6CAC4B;gBAE9B1qB,EAASrjB,QAAQusB,EAAoB;cACrC,OAAO1/C;gBACP,MAAM63D,IAAiB/e,GACrB94C,GACA,4BAA4BwT;gBAE9BgjC,EAASpjB,OAAOykC;;YAGbrhB,EAASpe;;IAGlB/2B,MAAMqwB;QACJhvB,KAAKyuD;QACL,MAAM3a,IAAW,IAAIre;QAIrB,OAHAz1B,KAAK2zC,GAAW7Q,GAAiB,MAC/B9iC,KAAK4yD,GAAWxD,MAAMpgC,GAAW8kB,KAE5BA,EAASpe;;IAGlB/2B;QACE,OAAOqB,KAAKyuE,GAAa9uE;;IAG3BhB,GAA2B4lE;QACzBvkE,KAAKyuD,MACLzuD,KAAK2zC,GAAW7Q,GAAiB,OAC/B9iC,KAAKgwE,GAASa,GAA2BtM,IAClC5zC,QAAQF;;IAInB9xB,GAA8B4lE;;;QAGxBvkE,KAAK2wE,MAGT3wE,KAAK2zC,GAAW7Q,GAAiB,OAC/B9iC,KAAKgwE,GAASc,GAA8BvM,IACrC5zC,QAAQF;;IAInBsgD;;;;QAIE,OAAO/wE,KAAK2zC,GAAW48B;;IAGzB5xE,YACE+9D;QAEA18D,KAAKyuD;QACL,MAAM3a,IAAW,IAAIre;QAKrB,OAJAz1B,KAAK2zC,GAAW7Q,GAAiB,OAC/B9iC,KAAK4yD,GAAW9wB,eAAe9hC,KAAK2zC,IAAY+oB,GAAgB5oB,IACzDnjB,QAAQF;QAEVqjB,EAASpe;;;;;;;;;;;;;;;;;;;;;;;;UC5ePs7C;IAOXryE,YAAoB4lE;QAAAvkE,gBAAAukE;;;;;QAFZvkE,cAAQ;;IAIhBrB,KAAKxB;QACH6C,KAAKixE,GAAcjxE,KAAKukE,SAAS/9D,MAAMrJ;;IAGzCwB,MAAMzB;QACJ8C,KAAKixE,GAAcjxE,KAAKukE,SAASrnE,OAAOA;;IAG1CyB;QACEqB,KAAKkxE,SAAQ;;IAGPvyE,GAAiBwyE,GAA+BxuC;QACjD3iC,KAAKkxE,SACR19B,WAAW;YACJxzC,KAAKkxE,SACRC,EAAaxuC;WAEd;;;;;;;;;;;;;;;;;;;aCfOyuC,GAAkB30E;;;;;IAChC,OAOF,SAA8BA,GAAc40E;QAC1C,IAAmB,mBAAR50E,KAA4B,SAARA,GAC7B,QAAO;QAGT,MAAM60E,IAAS70E;QACf,KAAK,MAAM80E,KAAUF,GACnB,IAAIE,KAAUD,KAAoC,qBAAnBA,EAAOC,IACpC,QAAO;QAGX,QAAO;;;;;;;;;;;;;;;;;;;;;GAlBAC,EAAqB/0E,GAAK,EAAC,QAAQ,SAAS;;;MCYxCg1E;IACX9yE,YACmBgB,GACA+xE,GACAC,GACAC;iBAHAjyE,GACAK,6BAAA0xE,aACAC,aACAC;;IAKnBjzE,GAAaxB;QACX,QAAQia,GAAUja;UAChB;YACE,OAAO;;UACT;YACE,OAAOA,EAAMma;;UACf;YACE,OAAOQ,GAAgB3a,EAAMgb,gBAAgBhb,EAAMic;;UACrD;YACE,OAAOpZ,KAAK6xE,GAAiB10E,EAAqB;;UACpD;YACE,OAAO6C,KAAK8xE,GAAuB30E;;UACrC;YACE,OAAOA,EAAM0Z;;UACf;YACE,OAAO,IAAI6rC,GAAK/qC,GAAoBxa,EAAiB;;UACvD;YACE,OAAO6C,KAAK+xE,GAAiB50E,EAAqB;;UACpD;YACE,OAAO6C,KAAKgyE,GAAgB70E,EAAoB;;UAClD;YACE,OAAO6C,KAAKiyE,GAAa90E,EAAiB;;UAC5C;YACE,OAAO6C,KAAKkyE,GAAc/0E,EAAe;;UAC3C;YACE,MA3DRI;;;IA+DUoB,GAAcgY;QACpB,MAAMlK,IAAiC;QAIvC,OAHA5L,EAAQ8V,EAASC,UAAU,IAAI,CAACpW,GAAKrD;YACnCsP,EAAOjM,KAAOR,KAAKmyE,GAAah1E;YAE3BsP;;IAGD9N,GAAgBxB;QACtB,OAAO,IAAIkoD,GACTvtC,GAAgB3a,EAAM6a,WACtBF,GAAgB3a,EAAM8a;;IAIlBtZ,GAAa6Z;QACnB,QAAQA,EAAWC,UAAU,IAAI5b,IAAIM,KAAS6C,KAAKmyE,GAAah1E;;IAG1DwB,GAAuBxB;QAC7B,QAAQ6C,KAAK2xE;UACX,KAAK;YACH,MAAM7qD,alE1BEsrD,EAAiBj1E;gBAC/B,MAAM2pB,IAAgB3pB,EAAMwZ,SAAUC,OAA0B;gBAEhE,OAAIF,GAAkBoQ,KACbsrD,EAAiBtrD,KAEnBA;akEoBqBsrD,CAAiBj1E;YACvC,OAAqB,QAAjB2pB,IACK,OAEF9mB,KAAKmyE,GAAarrD;;UAC3B,KAAK;YACH,OAAO9mB,KAAK6xE,GAAiB/6D,GAAkB3Z;;UACjD;YACE,OAAO;;;IAILwB,GAAiBxB;QACvB,MAAMk1E,IAAkBr7D,GAAmB7Z,IACrCiH,IAAY,IAAId,EACpB+uE,EAAgB9uE,SAChB8uE,EAAgBp7D;QAElB,OAAIjX,KAAK0xE,wBACAttE,IAEAA,EAAUkuE;;IAIb3zE,GACN0E;QAEA,MAAMkvE,IAAejtE,EAAaoB,EAAWrD;QA3FrC1F,EA6FN0gB,GAAoBk0D;QAGtB,MAAM5yE,IAAa,IAAIM,EAAWsyE,EAAa/wE,IAAI,IAAI+wE,EAAa/wE,IAAI,KAClEhB,IAAM,IAAIiG,EAAY8rE,EAAa5rE,EAAS;QAclD,OAZKhH,EAAW2E,QAAQtE,KAAKL;;QAE3B3C,EACE,YAAYwD,2BACV,4CACA,GAAGb,EAAWO,aAAaP,EAAWQ,4BACtC,iEACA,aAAaH,KAAKL,EAAWO,aAAaF,KAAKL,EAAWQ,eAC1D;QAICH,KAAK4xE,GAAiBpxE;;;;;;;;;;;;;;;;;;;;uBCrDjC;MAWagyE,KAAuBl7B,GAAUQ;;;;;;;AAyB9C,MAAM26B;IAmBJ9zE,YAAYslD;;QACV,SAAsB3iD,MAAlB2iD,EAASpkD,MAAoB;YAC/B,SAAqByB,MAAjB2iD,EAASnkD,KACX,MAAM,IAAImD,EACRlB,EAAKI,kBACL;YAGJnC,KAAKH,OA/DU,4BAgEfG,KAAKF,OA/DS;eAiEd6gD,GAAkB,YAAY,oBAAoB,QAAQsD,EAASpkD,OACnEG,KAAKH,OAAOokD,EAASpkD,MAErBghD,GAA0B,YAAY,WAAW,OAAOoD,EAASnkD;QACjEE,KAAKF,oBAAMmkD,EAASnkD;QA0DtB,IAxDAsiD,GAAoB,YAAY6B,GAAU,EACxC,QACA,OACA,eACA,yBACA,kBACA,gCACA;QAGFpD,GACE,YACA,UACA,eACAoD,EAASkJ,cAEXntD,KAAKmtD,cAAclJ,EAASkJ;QAE5BtM,GACE,YACA,WACA,yBACAoD,EAASytB,wBAGX7wB,GACE,YACA,WACA,6BACAoD,EAASI;;;SAK4B,MAAnCJ,EAASytB,wBACX10E,EACE,6FAG0C,MAAnCinD,EAASytB,yBAClB10E,EACE;QAIJgD,KAAK0xE,sCACHztB,EAASytB;QACX1xE,KAAKqkD,0CACHJ,EAASI;QAEXxD,GACE,YACA,UACA,kBACAoD,EAAS2qB,sBAEqBttE,MAA5B2iD,EAAS2qB,gBACX5uE,KAAK4uE,iBAAiBt3B,GAAUO,SAC3B;YACL,IACEoM,EAAS2qB,mBAAmB4D,MAC5BvuB,EAAS2qB,iBAAiBt3B,GAAUo7B,IAEpC,MAAM,IAAIzvE,EACRlB,EAAKI,kBACL,mCAAmCm1C,GAAUo7B;YAG/C1yE,KAAK4uE,iBAAiB3qB,EAAS2qB;;QAInC/tB,GACE,YACA,WACA,gCACAoD,EAAS0uB;QAEX3yE,KAAKD,iCACHkkD,EAAS0uB;;IAGbh0E,QAAQ0B;QACN,OACEL,KAAKH,SAASQ,EAAMR,QACpBG,KAAKF,QAAQO,EAAMP,OACnBE,KAAK0xE,0BAA0BrxE,EAAMqxE,yBACrC1xE,KAAKmtD,gBAAgB9sD,EAAM8sD,eAC3BntD,KAAK4uE,mBAAmBvuE,EAAMuuE,kBAC9B5uE,KAAKD,qBAAqBM,EAAMN,oBAChCC,KAAKqkD,8BAA8BhkD,EAAMgkD;;;;;;UAQlCuuB;;;;IA4BXj0E,YACEk0E,GACAppB,GACA0lB,IAAuC,IAAIzB;QAE3C,IAzBF1tE,UAAoD;;;QAapDA,UAAkB,IAAIs0C,IAqQtBt0C,gBAAW;YACTkQ,QAAQoyB;;;gBAGNtiC,KAAK8yE,YACC9yE,KAAK+yE,GAAkB7C;;WA9PyB,mBAA5C2C,EAAgC9mD,SAAsB;;;YAGhE,MAAMinD,IAAMH;YACZ7yE,KAAKizE,KAAeD,GACpBhzE,KAAK4lD,KAAcgtB,GAAUM,GAAkBF,IAC/ChzE,KAAKmzE,KAAkBH,EAAI3vE,MAC3BrD,KAAKozE,KAAe,IAAI5pB,GAA4BC;eAC/C;YACL,MAAM4pB,IAAWR;YACjB,KAAKQ,EAASnzE,WACZ,MAAM,IAAI+C,EACRlB,EAAKI,kBACL;YAIJnC,KAAK4lD,KAAc,IAAI3lD,EAAWozE,EAASnzE,WAAWmzE,EAASlzE;;YAE/DH,KAAKmzE,KAAkB,aACvBnzE,KAAKozE,KAAe,IAAI9pB;;QAG1BtpD,KAAKszE,KAAqBnE,GAC1BnvE,KAAKuzE,KAAY,IAAId,GAAkB;;IAGzCe;QAYE,OAPKxzE,KAAKyzE;;QAERzzE,KAAKyzE,KAAkB,IAAIjtB,GACzBxmD,KAAK4lD,IACL5lD,KAAKuzE,GAAUlvB,6BAGZrkD,KAAKyzE;;IAGd90E,SAAS+0E;QACP1zB,GAA0B,sBAAsB6C,WAAW,IAC3DvC,GAAgB,sBAAsB,UAAU,GAAGozB;QAEnD,MAAMC,IAAc,IAAIlB,GAAkBiB;QAC1C,IAAI1zE,KAAK+yE,OAAqB/yE,KAAKuzE,GAAUjvE,QAAQqvE,IACnD,MAAM,IAAI1wE,EACRlB,EAAKW,qBACL;QAMJ1C,KAAKuzE,KAAYI,QACeryE,MAA5BqyE,EAAYxmB,gBACdntD,KAAKozE,c3BtBTjmB;YAEA,KAAKA,GACH,OAAO,IAAI7D;YAGb,QAAQ6D,EAAYx8C;cAClB,KAAK;gBACH,MAAM0zB,IAAS8oB,EAAY9oB;;gCAW3B,OATA1mC,IAEsB,mBAAX0mC,KACI,SAAXA,MACAA,EAAa,SACbA,EAAa,KAAmC;gBAI7C,IAAI+mB,GACT/mB,GACA8oB,EAAYtC,MAAgB;;cAGhC,KAAK;gBACH,OAAOsC,EAAY9oB;;cAErB;gBACE,MAAM,IAAIphC,EACRlB,EAAKI,kBACL;;;;;;;;;;;;;;;;;;G2BRkByxE,EAAwBD,EAAYxmB;;IAI5DxuD;QAEE,OADAqB,KAAK8yE,MACE9yE,KAAK+yE,GAAkBjhB;;IAGhCnzD;QAEE,OADAqB,KAAK8yE,MACE9yE,KAAK+yE,GAAkB9Q;;IAGhCtjE,kBAAkBslD;;QAChB,IAAIjkD,KAAK+yE,IACP,MAAM,IAAI9vE,EACRlB,EAAKW,qBACL;QAMJ,IAAIgsE,KAAkB,GAClBmF,KAA6B;QAEjC,IAAI5vB,WAC8C3iD,MAA5C2iD,EAAS6vB,kCACX92E,EACE;QAGJ0xE,gCACEzqB,EAASyqB,uCACTzqB,EAAS6vB;QAGXD,MAA6B5vB,EAAS4vB,8BAClC5vB,EAAS4vB,4BAGTnF,KAAmBmF,IACrB,MAAM,IAAI5wE,EACRlB,EAAKI,kBACL;QAKN,OAAOnC,KAAK+zE,GAAgB/zE,KAAKszE,IAAoB;YACnDjD,KAAS;YACTzB,gBAAgB5uE,KAAKuzE,GAAU3E;YAC/BF,iBAAAA;YACAsF,IAAgBH;;;IAIpBl1E;QACE,SAC4B2C,MAA1BtB,KAAK+yE,OACJ/yE,KAAK+yE,GAAiBpC,IAEvB,MAAM,IAAI1tE,EACRlB,EAAKW,qBACL;QAKJ,MAAMoxC,IAAW,IAAIre;QAYrB,OAXAz1B,KAAKi0E,GAAOC,GAAkC5xC;YAC5C;sBACQtiC,KAAKszE,GAAmBa,iBAC5Bn0E,KAAK4lD,IACL5lD,KAAKmzE,KAEPr/B,EAASrjB;cACT,OAAOnzB;gBACPw2C,EAASpjB,OAAOpzB;;YAGbw2C,EAASpe;;IAGlB/2B;QAEE,OADCqB,KAAKgzE,IAAqBoB,uBAAuB,cAC3Cp0E,KAAK8C,SAASoN;;IAGvBmkE;QAEE,OADAr0E,KAAK8yE,MACE9yE,KAAK+yE,GAAkBpC;;IAGhChyE;QAEE,OADAqB,KAAK8yE,MACE9yE,KAAK+yE,GAAkBuB;;IAKhC31E,kBAAkB41E;QAGhB,IAFAv0E,KAAK8yE,MAED1B,GAAkBmD,IACpB,OAAO1D,GACL7wE,KAAsB,IACtBu0E;QAEG;YACLj0B,GAAgB,+BAA+B,YAAY,GAAGi0B;YAC9D,MAAMhQ,IAAkC;gBACtC/9D,MAAM+tE;;YAER,OAAO1D,GAA2B7wE,KAAsB,IAAEukE;;;IAI9D5lE;QAQE,OAPKqB,KAAK+yE;;;QAGR/yE,KAAK+zE,GAAgB,IAAIrG,IAA2B;YAClD2C,KAAS;YAGNrwE,KAAK+yE;;IAGNp0E;QACN,OAAO,IAAIe,EACTM,KAAK4lD,IACL5lD,KAAKmzE,IACLnzE,KAAKuzE,GAAU1zE,MACfG,KAAKuzE,GAAUzzE,KACfE,KAAKuzE,GAAUxzE;;IAIXpB,GACNwwE,GACAd;QASA,MAAMI,IAAezuE,KAAKw0E;QAI1B,OAFAx0E,KAAK+yE,KAAmB,IAAI9D,GAAgBjvE,KAAKozE,IAAcpzE,KAAKi0E,KAE7Dj0E,KAAK+yE,GAAiB3kE,MAC3BqgE,GACAU,GACAd;;IAII1vE,UAAyBq0E;QAC/B,IAqnEcv2E,IArnEAu2E,EAAIjnD,SAqnESvrB,IArnEA,cAsnEtBC,OAAOC,UAAUC,eAAeC,KAAKnE,GAAK+D,IArnE7C,MAAM,IAAIyC,EACRlB,EAAKI,kBACL;QAknER,IAAkB1F,GAAa+D;;;;;;;;;;;;;;;;WA9mE3B,MAAMN,IAAY8yE,EAAIjnD,QAAQ7rB;QAC9B,KAAKA,KAAkC,mBAAdA,GACvB,MAAM,IAAI+C,EACRlB,EAAKI,kBACL;QAGJ,OAAO,IAAIlC,EAAWC;;IAGxB8yE;QACE,KAAKhzE,KAAKizE,IACR,MAAM,IAAIhwE,EACRlB,EAAKW,qBACL;QAIJ,OAAO1C,KAAKizE;;IAYdt0E,WAAW81E;QAIT,OAHAz0B,GAA0B,wBAAwB6C,WAAW,IAC7DvC,GAAgB,wBAAwB,oBAAoB,GAAGm0B;QAC/Dz0E,KAAK8yE,MACE,IAAI4B,GACTpvE,EAAaoB,EAAW+tE,IACxBz0E;yBACiB;;IAIrBrB,IAAI81E;QAIF,OAHAz0B,GAA0B,iBAAiB6C,WAAW,IACtDvC,GAAgB,iBAAiB,oBAAoB,GAAGm0B;QACxDz0E,KAAK8yE,MACE6B,GAAkBC,GACvBtvE,EAAaoB,EAAW+tE,IACxBz0E;yBACiB;;IAIrBrB,gBAAgBiI;QAQd,IAPAo5C,GAA0B,6BAA6B6C,WAAW,IAClEvC,GACE,6BACA,oBACA,GACA15C;QAEEA,EAAajB,QAAQ,QAAQ,GAC/B,MAAM,IAAI1C,EACRlB,EAAKI,kBACL,0BAA0ByE,2BACxB;QAIN,OADA5G,KAAK8yE,MACE,IAAIntD,GACT,IAAIkvD,GAAcvvE,EAAaqZ,KAAa/X,IAC5C5G;yBACiB;;IAIrBrB,eACE+9D;QAIA,OAFA1c,GAA0B,4BAA4B6C,WAAW,IACjEvC,GAAgB,4BAA4B,YAAY,GAAGoc;QACpD18D,KAAK8yE,KAAyBnhD,YAClCA,KACQ+qC,EAAe,IAAI9N,GAAY5uD,MAAM2xB;;IAKlDhzB;QAGE,OAFAqB,KAAK8yE,MAEE,IAAIgC,GAAW90E;;IAGxB1D;QACE,QAAQD;UACN,KAAKK,EAASC;YACZ,OAAO;;UACT,KAAKD,EAASO;YACZ,OAAO;;UACT,KAAKP,EAASq4E;YACZ,OAAO;;UACT,KAAKr4E,EAAS8vE;YACZ,OAAO;;UACT,KAAK9vE,EAASs4E;YACZ,OAAO;;UACT,KAAKt4E,EAASu4E;YACZ,OAAO;;UACT;;YAEE,OAAO;;;IAIbt2E,mBAAmBu2E;Y/F5mBOC;Q+F6mBxBn1B,GAA0B,yBAAyB6C,WAAW,IAC9DlB,GACE,eACA,EAAC,SAAS,SAAS,UAAU,QAAQ,QAAQ,aAC7C,GACAuzB;Q/FlnBsBC,I+FonBZD,G/FnnBd/4E,EAAUi5E,YAAYD;;;;I+FwnBtBx2E;QACE,OAAOqB,KAAKuzE,GAAU7B;;;;+DAKVb,GACdwE,GACA9Q;IAEA,MAGM+Q,IAAgB,IAAItE,GAAoB;QAC5CxqE,MAAM;YACA+9D,EAAS/9D,QACX+9D,EAAS/9D;;QAGbtJ,OATkB8zB;YAClB,MA1oBwBzzB;;;IAqpB1B,OADA83E,EAAgBxE,GAA2ByE,IACpC;QACLA,EAAcC,MACdF,EAAgBvE,GAA8BwE;;;;;;UAOrC1mB;IACXjwD,YACU62E,GACAC;kBADAD,aACAC;;IAGV92E,IACE+2E;QAEA11B,GAA0B,mBAAmB6C,WAAW;QACxD,MAAM1D,IAAMw2B,GACV,mBACAD,GACA11E,KAAKw1E;QAEP,OAAOx1E,KAAKy1E,GACTG,GAAO,EAACz2B,EAAI0G,MACZvkB,KAAMvwB;YACL,KAAKA,KAAwB,MAAhBA,EAAKjS,QAChB,OAjrBkBvB;YAmrBpB,MAAM0S,IAAMc,EAAK;YACjB,IAAId,aAAeiE,IACjB,OAAO,IAAI2hE,GACT71E,KAAKw1E,IACLr2B,EAAI0G,IACJ;8BACiB;qCACO,GACxB1G,EAAI2G;YAED,IAAI71C,aAAe+D,IACxB,OAAO,IAAI6hE,GACT71E,KAAKw1E,IACLr2B,EAAI0G,IACJ51C;8BACiB;qCACO,GACxBkvC,EAAI2G;YAGN,MAvsBkBvoD;;;IAotB1BoB,IACE+2E,GACAv4E,GACA4uB;QAEAq0B,GAA4B,mBAAmByC,WAAW,GAAG;QAC7D,MAAM1D,IAAMw2B,GACV,mBACAD,GACA11E,KAAKw1E;QAEPzpD,IAAU+pD,GAAmB,mBAAmB/pD;QAChD,MAAMgqD,IAAiBC,GACrB72B,EAAI2G,IACJ3oD,GACA4uB,IAEI0sC,IAAS/R,GACb1mD,KAAKw1E,GAAWS,IAChB,mBACA92B,EAAI0G,IACJkwB,GACmB,SAAnB52B,EAAI2G,IACJ/5B;QAGF,OADA/rB,KAAKy1E,GAAalmE,IAAI4vC,EAAI0G,IAAM4S,IACzBz4D;;IAaTrB,OACE+2E,GACAQ,GACA/4E,MACG2qD;QAEH,IAAI3I,GACAsZ;QAoCJ,OAjC+B,mBAAtByd,KACPA,aAA6BC,MAE7Bj2B,GAA4B,sBAAsB2C,WAAW;QAC7D1D,IAAMw2B,GACJ,sBACAD,GACA11E,KAAKw1E,KAEP/c,IAAS5Q,GACP7nD,KAAKw1E,GAAWS,IAChB,sBACA92B,EAAI0G,IACJqwB,GACA/4E,GACA2qD,OAGF9H,GAA0B,sBAAsB6C,WAAW;QAC3D1D,IAAMw2B,GACJ,sBACAD,GACA11E,KAAKw1E,KAEP/c,IAASlR,GACPvnD,KAAKw1E,GAAWS,IAChB,sBACA92B,EAAI0G,IACJqwB;QAIJl2E,KAAKy1E,GAAal1D,OAAO4+B,EAAI0G,IAAM4S,IAC5Bz4D;;IAGTrB,OAAO+2E;QACL11B,GAA0B,sBAAsB6C,WAAW;QAC3D,MAAM1D,IAAMw2B,GACV,sBACAD,GACA11E,KAAKw1E;QAGP,OADAx1E,KAAKy1E,GAAavlE,OAAOivC,EAAI0G,KACtB7lD;;;;MAIE80E;IAIXn2E,YAAoB62E;kBAAAA,GAHpBx1E,UAAqB,IACrBA,WAAqB;;IAUrBrB,IACE+2E,GACAv4E,GACA4uB;QAEAq0B,GAA4B,kBAAkByC,WAAW,GAAG,IAC5D7iD,KAAKo2E;QACL,MAAMj3B,IAAMw2B,GACV,kBACAD,GACA11E,KAAKw1E;QAEPzpD,IAAU+pD,GAAmB,kBAAkB/pD;QAC/C,MAAMgqD,IAAiBC,GACrB72B,EAAI2G,IACJ3oD,GACA4uB,IAEI0sC,IAAS/R,GACb1mD,KAAKw1E,GAAWS,IAChB,kBACA92B,EAAI0G,IACJkwB,GACmB,SAAnB52B,EAAI2G,IACJ/5B;QAKF,OAHA/rB,KAAKq2E,KAAar2E,KAAKq2E,GAAWjxD,OAChCqzC,EAAOpJ,GAAYlQ,EAAI0G,IAAMxjC,GAAaC,QAErCtiB;;IAaTrB,OACE+2E,GACAQ,GACA/4E,MACG2qD;QAIH,IAAI3I,GACAsZ;QAsCJ,OAzCAz4D,KAAKo2E,MAM0B,mBAAtBF,KACPA,aAA6BC,MAE7Bj2B,GAA4B,qBAAqB2C,WAAW;QAC5D1D,IAAMw2B,GACJ,qBACAD,GACA11E,KAAKw1E,KAEP/c,IAAS5Q,GACP7nD,KAAKw1E,GAAWS,IAChB,qBACA92B,EAAI0G,IACJqwB,GACA/4E,GACA2qD,OAGF9H,GAA0B,qBAAqB6C,WAAW;QAC1D1D,IAAMw2B,GACJ,qBACAD,GACA11E,KAAKw1E,KAEP/c,IAASlR,GACPvnD,KAAKw1E,GAAWS,IAChB,qBACA92B,EAAI0G,IACJqwB;QAIJl2E,KAAKq2E,KAAar2E,KAAKq2E,GAAWjxD,OAChCqzC,EAAOpJ,GAAYlQ,EAAI0G,IAAMxjC,GAAaH,QAAO,MAE5CliB;;IAGTrB,OAAO+2E;QACL11B,GAA0B,qBAAqB6C,WAAW,IAC1D7iD,KAAKo2E;QACL,MAAMj3B,IAAMw2B,GACV,qBACAD,GACA11E,KAAKw1E;QAKP,OAHAx1E,KAAKq2E,KAAar2E,KAAKq2E,GAAWjxD,OAChC,IAAI5E,GAAe2+B,EAAI0G,IAAMxjC,GAAaC,QAErCtiB;;IAGTrB;QAGE,OAFAqB,KAAKo2E,MACLp2E,KAAKs2E,MAAa,GACdt2E,KAAKq2E,GAAWv3E,SAAS,IACpBkB,KAAKw1E,GAAW1C,KAAyB1jB,MAAMpvD,KAAKq2E,MAGtD1lD,QAAQF;;IAGT9xB;QACN,IAAIqB,KAAKs2E,IACP,MAAM,IAAIrzE,EACRlB,EAAKW,qBACL;;;;;;UAUKiyE,WACHhvB;IAIRhnD,YACSknD,GACE0wB,GACAzwB;QAET3iD,MAAMozE,EAAU3wB,IAAaC,GAAMC,cAJ5BD,GACE7lD,iBAAAu2E,aACAzwB,GAGT9lD,KAAK+yE,KAAmB/yE,KAAKu2E,UAAUzD;;IAGzCn0E,UACE+G,GACA6wE,GACAC;QAEA,IAAI9wE,EAAK5G,SAAS,KAAM,GACtB,MAAM,IAAImE,EACRlB,EAAKI,kBACL,+FAEE,GAAGuD,EAAKD,WAAyBC,EAAK5G;QAG5C,OAAO,IAAI61E,GAAkB,IAAIluE,EAAYf,IAAO6wE,GAAWC;;IAGjEr1E;QACE,OAAOnB,KAAK6lD,GAAKngD,KAAKke;;IAGxBJ;QACE,OAAO,IAAIkxD,GACT10E,KAAK6lD,GAAKngD,KAAKie,KACf3jB,KAAKu2E,WACLv2E,KAAK8lD;;IAITpgD;QACE,OAAO1F,KAAK6lD,GAAKngD,KAAKD;;IAGxB9G,WACE81E;QASA,IAPAz0B,GAA0B,gCAAgC6C,WAAW,IACrEvC,GACE,gCACA,oBACA,GACAm0B;SAEGA,GACH,MAAM,IAAIxxE,EACRlB,EAAKI,kBACL;QAGJ,MAAMuD,IAAOJ,EAAaoB,EAAW+tE;QACrC,OAAO,IAAIC,GACT10E,KAAK6lD,GAAKngD,KAAKwY,MAAMxY,IACrB1F,KAAKu2E;yBACY;;IAIrB53E,QAAQ0B;QACN,MAAMA,aAAiBs0E,KACrB,MAAMryB,GAAkB,WAAW,qBAAqB,GAAGjiD;QAE7D,OACEL,KAAKu2E,cAAcl2E,EAAMk2E,aACzBv2E,KAAK6lD,GAAKvhD,QAAQjE,EAAMwlD,OACxB7lD,KAAK8lD,OAAezlD,EAAMylD;;IAM9BnnD,IAAIxB,GAAuB4uB;QACzBq0B,GAA4B,yBAAyByC,WAAW,GAAG,IACnE92B,IAAU+pD,GAAmB,yBAAyB/pD;QACtD,MAAMgqD,IAAiBC,GACrBh2E,KAAK8lD,IACL3oD,GACA4uB,IAEI0sC,IAAS/R,GACb1mD,KAAKu2E,UAAUN,IACf,yBACAj2E,KAAK6lD,IACLkwB,GACoB,SAApB/1E,KAAK8lD,IACL/5B;QAEF,OAAO/rB,KAAK+yE,GAAiB3jB,MAC3BqJ,EAAOpJ,GAAYrvD,KAAK6lD,IAAMxjC,GAAaC;;IAU/C3jB,OACEu3E,GACA/4E,MACG2qD;QAEH,IAAI2Q;QAyBJ,OAtB+B,mBAAtByd,KACPA,aAA6BC,MAE7Bj2B,GAA4B,4BAA4B2C,WAAW;QACnE4V,IAAS5Q,GACP7nD,KAAKu2E,UAAUN,IACf,4BACAj2E,KAAK6lD,IACLqwB,GACA/4E,GACA2qD,OAGF9H,GAA0B,4BAA4B6C,WAAW;QACjE4V,IAASlR,GACPvnD,KAAKu2E,UAAUN,IACf,4BACAj2E,KAAK6lD,IACLqwB,KAIGl2E,KAAK+yE,GAAiB3jB,MAC3BqJ,EAAOpJ,GAAYrvD,KAAK6lD,IAAMxjC,GAAaH,QAAO;;IAItDvjB;QAEE,OADAqhD,GAA0B,4BAA4B6C,WAAW,IAC1D7iD,KAAK+yE,GAAiB3jB,MAAM,EACjC,IAAI5uC,GAAexgB,KAAK6lD,IAAMxjC,GAAaC;;IAuB/C3jB,cAAc/B;;QACZwjD,GACE,gCACAyC,WACA,GACA;QAEF,IAAI92B,IAA2C;YAC7C64C,yBAAwB;WAEtB6R,IAAU;QAEa,mBAAlB75E,EAAK65E,MACXrF,GAAkBx0E,EAAK65E,QAExB1qD,IAAUnvB,EAAK65E,IACfr0B,GAAoB,gCAAgCr2B,GAAS,EAC3D;QAEF80B,GACE,gCACA,WACA,0BACA90B,EAAQ64C;QAEV6R;QAGF,MAAMC,IAAkB;YACtB9R,wBAAwB74C,EAAQ64C;;QAGlC,IAAIwM,GAAkBx0E,EAAK65E,KAAW;YACpC,MAAME,IAAe/5E,EAAK65E;YAG1B75E,EAAK65E,mBAAWE,EAAanwE,mCAAMutC,KAAK4iC,IACxC/5E,EAAK65E,IAAU,mBAAKE,EAAaz5E,oCAAO62C,KAAK4iC;YAC7C/5E,EAAK65E,IAAU,mBAAKE,EAAaC,uCAAU7iC,KAAK4iC;eAEhDr2B,GACE,gCACA,YACAm2B,GACA75E,EAAK65E,KAEP/1B,GACE,gCACA,YACA+1B,IAAU,GACV75E,EAAK65E,IAAU;QAEjB/1B,GACE,gCACA,YACA+1B,IAAU,GACV75E,EAAK65E,IAAU;QAInB,MAAMlS,IAA0C;YAC9C/9D,MAAM8mD;gBACA1wD,EAAK65E,MACN75E,EAAK65E,GACJz2E,KAAK62E,GAAsBvpB;;YAIjCpwD,OAAON,EAAK65E,IAAU;YACtBG,UAAUh6E,EAAK65E,IAAU;;QAG3B,OAAOK,GACL92E,KAAK+yE,IACL/yE,KAAK6lD,IACL6wB,GACAnS;;IAIJ5lE,IAAIotB;QAIF,OAHAq0B,GAA4B,yBAAyByC,WAAW,GAAG,IACnEk0B,GAAmB,yBAAyBhrD;QAExCA,KAA8B,YAAnBA,EAAQ2zC,SACd1/D,KAAKu2E,UACTzD,KACAkE,GAA0Bh3E,KAAK6lD,IAC/BvkB,KACCrxB,KACE,IAAI4lE,GACF71E,KAAKu2E,WACLv2E,KAAK6lD,IACL51C;wBACe,GACfA,aAAe+D,MAAW/D,EAAI+b,IAC9BhsB,KAAK8lD;;;;;iBA+EjBuvB,GACA70E,GACAurB;YAEA,MAAMtf,IAAS,IAAIgpB,IACbupC,IAAW8X,GACfzB,GACA70E,GACA;gBACEokE,yBAAwB;gBACxBqS,KAAuB;eAEzB;gBACEzwE,MAAOm+D;;;oBAGL3F;oBAEA,MAAM98C,IAASyiD,EAAK5zD,KAAKxC,IAAI/N;qBACxB0hB,KAAUyiD,EAAKxzD;;;;;;;;oBAQlB1E,EAAOikB,OACL,IAAIztB,EACFlB,EAAKgB,aACL,4DAIJmf,KACAyiD,EAAKxzD,aACL4a,KACmB,aAAnBA,EAAQ2zC,SAERjzD,EAAOikB,OACL,IAAIztB,EACFlB,EAAKgB,aACL,gLAOJ0J,EAAOgkB,QAAQk0C;;gBAGnBznE,OAAOI,KAAKmP,EAAOikB,OAAOpzB;;YAG9B,OAAOmP,EAAOipB;SAlIHwhD,CACLl3E,KAAK+yE,IACL/yE,KAAK6lD,IACL95B,GACAuV,KAAKgsB,KAAYttD,KAAK62E,GAAsBvpB;;IAIlD3uD,cACE63E;QAEA,OAAO,IAAI7B,GAAqB30E,KAAK6lD,IAAM7lD,KAAKu2E,WAAWC;;;;;WAOrD73E,GAAsB2uD;QAK5B,MAAMr9C,IAAMq9C,EAASv8C,KAAKvP,IAAIxB,KAAK6lD;QAEnC,OAAO,IAAIgwB,GACT71E,KAAKu2E,WACLv2E,KAAK6lD,IACL51C,GACAq9C,EAASn8C,WACTm8C,EAAS97C,kBACTxR,KAAK8lD;;;;mEAMKgxB,GACdzB,GACA70E,GACAurB,GACAw4C;IAEA,IAAI4S,IAAcnmD;QAChBo/C,QAAQlzE,MAAM,iCAAiC8zB;;IAE7CuzC,EAASrnE,UACXi6E,IAAa5S,EAASrnE,MAAM62C,KAAKwwB;IAGnC,MAAM+Q,IAAgB,IAAItE,GAA4B;QACpDxqE,MAAM8mD;YACAiX,EAAS/9D,QACX+9D,EAAS/9D,KAAK8mD;;QAGlBpwD,OAAOi6E;QAEHC,IAAmB/B,EAAgB/W,OACvCuW,GAAcp6C,GAAOj6B,EAAIkF,OACzB4vE,GACAvpD;IAGF,OAAO;QACLupD,EAAcC,MACdF,EAAgBrW,GAASoY;;;;MAmEhBC;IACX14E,YACW6S,GACAL;QADAnR,wBAAAwR,GACAxR,iBAAAmR;;IAGXxS,QAAQ0B;QACN,OACEL,KAAKwR,qBAAqBnR,EAAMmR,oBAChCxR,KAAKmR,cAAc9Q,EAAM8Q;;;;MAWlB0kE;IAEXl3E,YACU62E,GACA3vB,GACDyxB,GACCC,GACAC,GACS1xB;kBALT0vB,aACA3vB,aACDyxB,aACCC,aACAC,aACS1xB;;IAGnBnnD,KAAKotB;QAGH,IAFAq0B,GAA4B,yBAAyByC,WAAW,GAAG,IACnE92B,IAAU0rD,GAAwB,yBAAyB1rD;QACtD/rB,KAAKs3E,IAEH;;;YAGL,IAAIt3E,KAAK8lD,IAAY;gBACnB,MAAMwH,IAAW,IAAIoqB,GACnB13E,KAAKw1E,IACLx1E,KAAK6lD,IACL7lD,KAAKs3E,IACLt3E,KAAKu3E,IACLv3E,KAAKw3E;iCACY;gBAEnB,OAAOx3E,KAAK8lD,GAAW6xB,cAAcrqB,GAAUvhC;;YAS/C,OAPuB,IAAI0lD,GACzBzxE,KAAKw1E,GAAW5vB,IAChB5lD,KAAKw1E,GAAWoC,MAChB7rD,EAAQ8rD,oBAAoB,QAC5Br3E,KACE,IAAIm0E,GAAkBn0E,GAAKR,KAAKw1E,qBAA6B,OAE3CrD,GAAanyE,KAAKs3E,GAAU79C;;;IAKxD96B,IACEuiB,GACA6K;QAIA,IAFAq0B,GAA4B,wBAAwByC,WAAW,GAAG,IAClE92B,IAAU0rD,GAAwB,wBAAwB1rD;QACtD/rB,KAAKs3E,IAAW;YAClB,MAAMn6E,IAAQ6C,KAAKs3E,GAChB1pE,OACAtF,MACCy/C,GAAsB,wBAAwB7mC,GAAWlhB,KAAK6lD;YAElE,IAAc,SAAV1oD,GAAgB;gBAOlB,OANuB,IAAIs0E,GACzBzxE,KAAKw1E,GAAW5vB,IAChB5lD,KAAKw1E,GAAWoC,MAChB7rD,EAAQ8rD,oBAAoB,QAC5Br3E,KAAO,IAAIm0E,GAAkBn0E,GAAKR,KAAKw1E,IAAYx1E,KAAK8lD,KAEpCqsB,GAAah1E;;;;IAMzCgE;QACE,OAAOnB,KAAK6lD,GAAKngD,KAAKke;;IAGxBu7B;QACE,OAAO,IAAIw1B,GACT30E,KAAK6lD,IACL7lD,KAAKw1E,IACLx1E,KAAK8lD;;IAIT5jC;QACE,OAA0B,SAAnBliB,KAAKs3E;;IAGdj8C;QACE,OAAO,IAAIg8C,GAAiBr3E,KAAKw3E,IAAmBx3E,KAAKu3E;;IAG3D54E,QAAQ0B;QACN,MAAMA,aAAiBw1E,KACrB,MAAMvzB,GAAkB,WAAW,oBAAoB,GAAGjiD;QAE5D,OACEL,KAAKw1E,OAAen1E,EAAMm1E,MAC1Bx1E,KAAKu3E,OAAel3E,EAAMk3E,MAC1Bv3E,KAAK6lD,GAAKvhD,QAAQjE,EAAMwlD,QACJ,SAAnB7lD,KAAKs3E,KACkB,SAApBj3E,EAAMi3E,KACNt3E,KAAKs3E,GAAUhzE,QAAQjE,EAAMi3E,QACjCt3E,KAAK8lD,OAAezlD,EAAMylD;;;;MAKnB4xB,WACH7B;IAERl3E,KAAKotB;QAMH,OALa5oB,MAAMyK,KAAKme;;;;sFAuXZ+rD,GACdhnE;IAEA,IAAIA,EAAM+pD,QAAqD,MAAjC/pD,EAAMmb,GAAgBntB,QAClD,MAAM,IAAImE,EACRlB,EAAKc,eACL;;;MAKO8iB;IAvXXhnB,YACYinD,GACAqwB,GACA8B;kBAFAnyB,aACAqwB,aACA8B;;IAGFp5E,GACRuiB,GACAvY,GACAxL;QAEA,IAAIymD;QACJ,IAAI1iC,EAAUuL,KAAc;YAC1B,8CACE9jB,uDACAA,GAEA,MAAM,IAAI1F,EACRlB,EAAKI,kBACL,qCAAqCwG,QACnC;YAEC,sBAAIA,GAAoB;gBAC7B3I,KAAKg4E,GAAkC76E,GAAOwL;gBAC9C,MAAMsvE,IAA6B;gBACnC,KAAK,MAAMz/D,KAAcrb,GACvB86E,EAAcx2E,KAAKzB,KAAKk4E,GAAqB1/D;gBAE/CorC,IAAa;oBAAEprC,YAAY;wBAAEC,QAAQw/D;;;mBAErCr0B,IAAa5jD,KAAKk4E,GAAqB/6E;iCAGrCwL,uDAAsBA,KACxB3I,KAAKg4E,GAAkC76E,GAAOwL;QAEhDi7C,IAAaoE,GACXhoD,KAAKi2E,IACL,eACA94E,qBACAwL;QAGJ,MAAM9C,IAASoD,GAAYod,OAAOnF,GAAWvY,GAAIi7C;QAEjD,OADA5jD,KAAKm4E,GAAkBtyE,IAChBA;;IAGClH,GAAcuiB,GAAsBqD;QAC5C,IAA4B,SAAxBvkB,KAAK+3E,GAAOrwE,SACd,MAAM,IAAIzE,EACRlB,EAAKI,kBACL;QAIJ,IAA0B,SAAtBnC,KAAK+3E,GAAOpwE,OACd,MAAM,IAAI1E,EACRlB,EAAKI,kBACL;QAIJ,MAAMqF,IAAU,IAAI8d,GAAQpE,GAAWqD;QAEvC,OADAvkB,KAAKo4E,GAAmB5wE,IACjBA;;;;;;;;;;;;WAcC7I,GACRwlD,GACAl0C,GACAgW;QAEA,KAAKhW,GACH,MAAM,IAAIhN,EACRlB,EAAKM,WACL,yDACE,GAAG8hD;QAIT,MAAMk0B,IAA0B;;;;;;;;gBAShC,KAAK,MAAM7wE,KAAWxH,KAAK+3E,GAAOvwE,SAChC,IAAIA,EAAQc,MAAMmkB,KAChB4rD,EAAW52E,KAAKqa,GAAS9b,KAAK4lD,IAAa31C,EAAIzP,YAC1C;YACL,MAAMrD,IAAQ8S,EAAI3H,MAAMd,EAAQc;YAChC,IAAIoO,GAAkBvZ,IACpB,MAAM,IAAI8F,EACRlB,EAAKI,kBACL,iGAEEqF,EAAQc,QACR;YAGC,IAAc,SAAVnL,GAEJ;gBACL,MAAMmL,IAAQd,EAAQc,MAAM7C;gBAC5B,MAAM,IAAIxC,EACRlB,EAAKI,kBACL,mEACE,iCAAiCmG,qBACjC;;YAPJ+vE,EAAW52E,KAAKtE;;QAYtB,OAAO,IAAIgpB,GAAMkyD,GAAYpyD;;;;WAMrBtnB,GACRwlD,GACA1rC,GACAwN;;QAGA,MAAMze,IAAUxH,KAAK+3E,GAAO9rD;QAC5B,IAAIxT,EAAO3Z,SAAS0I,EAAQ1I,QAC1B,MAAM,IAAImE,EACRlB,EAAKI,kBACL,kCAAkCgiD,UAChC;QAKN,MAAMk0B,IAA0B;QAChC,KAAK,IAAI/5E,IAAI,GAAGA,IAAIma,EAAO3Z,QAAQR,KAAK;YACtC,MAAMg6E,IAAW7/D,EAAOna;YAExB,IADyBkJ,EAAQlJ,GACZgK,MAAMmkB,KAAc;gBACvC,IAAwB,mBAAb6rD,GACT,MAAM,IAAIr1E,EACRlB,EAAKI,kBACL,yDACE,GAAGgiD,yBAAkCm0B;gBAG3C,KACGt4E,KAAK+3E,GAAOtkD,SACc,MAA3B6kD,EAAS3yE,QAAQ,MAEjB,MAAM,IAAI1C,EACRlB,EAAKI,kBACL,uFACE,uBAAuBgiD,0CACvB,IAAIm0B;gBAGV,MAAM5yE,IAAO1F,KAAK+3E,GAAOryE,KAAKwY,MAAM5Y,EAAaoB,EAAW4xE;gBAC5D,KAAK7xE,EAAY4C,EAAc3D,IAC7B,MAAM,IAAIzC,EACRlB,EAAKI,kBACL,qEACE,+CAA+CgiD,0BAC/C,6BAA6Bz+C,iDAC7B;gBAGN,MAAMlF,IAAM,IAAIiG,EAAYf;gBAC5B2yE,EAAW52E,KAAKqa,GAAS9b,KAAK4lD,IAAaplD;mBACtC;gBACL,MAAM+3E,IAAUvwB,GAAgBhoD,KAAKi2E,IAAa9xB,GAAYm0B;gBAC9DD,EAAW52E,KAAK82E;;;QAIpB,OAAO,IAAIpyD,GAAMkyD,GAAYpyD;;;;;;WAQvBtnB,GAAqB65E;QAC3B,IAA+B,mBAApBA,GAA8B;YACvC,IAAwB,OAApBA,GACF,MAAM,IAAIv1E,EACRlB,EAAKI,kBACL;YAIJ,KACGnC,KAAK+3E,GAAOtkD,SACqB,MAAlC+kD,EAAgB7yE,QAAQ,MAExB,MAAM,IAAI1C,EACRlB,EAAKI,kBACL,oHAEE,IAAIq2E;YAGV,MAAM9yE,IAAO1F,KAAK+3E,GAAOryE,KAAKwY,MAC5B5Y,EAAaoB,EAAW8xE;YAE1B,KAAK/xE,EAAY4C,EAAc3D,IAC7B,MAAM,IAAIzC,EACRlB,EAAKI,kBACL,yIAEE,QAAQuD,uDAA0DA,EAAK5G;YAG7E,OAAOgd,GAAS9b,KAAK4lD,IAAa,IAAIn/C,EAAYf;;QAC7C,IAAI8yE,aAA2B7yB,IACpC,OAAO7pC,GAAS9b,KAAK4lD,IAAa4yB,EAAgB3yB;QAElD,MAAM,IAAI5iD,EACRlB,EAAKI,kBACL,mIAEE,GAAG++C,GAAiBs3B;;;;;WASpB75E,GACNxB,GACAs7E;QAEA,KAAKx3B,MAAMllC,QAAQ5e,MAA2B,MAAjBA,EAAM2B,QACjC,MAAM,IAAImE,EACRlB,EAAKI,kBACL,sDACE,IAAIs2E,EAASr1E;QAGnB,IAAIjG,EAAM2B,SAAS,IACjB,MAAM,IAAImE,EACRlB,EAAKI,kBACL,mBAAmBs2E,EAASr1E,mCAC1B;QAGN,IAAIjG,EAAMwI,QAAQ,SAAS,GACzB,MAAM,IAAI1C,EACRlB,EAAKI,kBACL,mBAAmBs2E,EAASr1E,+CAC1B;QAGN,IAAIjG,EAAM0I,OAAOkiB,KAAW7gB,OAAOoR,MAAMyP,IAAUjpB,SAAS,GAC1D,MAAM,IAAImE,EACRlB,EAAKI,kBACL,mBAAmBs2E,EAASr1E,8CAC1B;;IAKAzE,GAAkBkH;QACxB,IAAIA,aAAkBoD,IAAa;YACjC,MAAMyvE,IAAW,2FACXC,IAAiB,mEACjBC,IAAYF,EAAS/yE,QAAQE,EAAO8C,OAAO,GAC3CkwE,IAAkBF,EAAehzE,QAAQE,EAAO8C,OAAO;YAE7D,IAAI9C,EAAOmnB,MAAgB;gBACzB,MAAM8rD,IAAgB94E,KAAK+3E,GAAOzrD;gBAClC,IAAsB,SAAlBwsD,MAA2BA,EAAcx0E,QAAQuB,EAAOyC,QAC1D,MAAM,IAAIrF,EACRlB,EAAKI,kBACL,kHAEE,2BAA2B22E,EAAc11E,gBACzC,SAASyC,EAAOyC,MAAMlF;gBAI5B,MAAMmpB,IAAoBvsB,KAAK+3E,GAAOvrD;gBACZ,SAAtBD,KACFvsB,KAAK+4E,GACHlzE,EAAOyC,OACPikB;mBAGC,IAAIssD,KAAmBD,GAAW;;;gBAGvC,IAAII,IAAiC;gBAOrC,IANIH,MACFG,IAAgBh5E,KAAK+3E,GAAOkB,GAAmBN,KAE3B,SAAlBK,KAA0BJ,MAC5BI,IAAgBh5E,KAAK+3E,GAAOkB,GAAmBP,KAE3B,SAAlBM;;gBAEF,MAAIA,MAAkBnzE,EAAO8C,KACrB,IAAI1F,EACRlB,EAAKI,kBACL,iDACE,IAAI0D,EAAO8C,GAAGvF,yBAGZ,IAAIH,EACRlB,EAAKI,kBACL,kCAAkC0D,EAAO8C,GAAGvF,yBAC1C,SAAS41E,EAAc51E;;;;IAQ7BzE,GAAmB6I;QACzB,IAA2C,SAAvCxH,KAAK+3E,GAAOvrD,MAAiC;;YAE/C,MAAMH,IAAkBrsB,KAAK+3E,GAAOzrD;YACZ,SAApBD,KACFrsB,KAAK+4E,GAAkC1sD,GAAiB7kB,EAAQc;;;IAK9D3J,GACNu6E,GACA1xE;QAEA,KAAKA,EAAQlD,QAAQ40E,IACnB,MAAM,IAAIj2E,EACRlB,EAAKI,kBACL,+DACE,+BAA+B+2E,EAAW91E,iBAC1C,6BAA6B81E,EAAW91E,iBACxC,mEACA,gBAAgBoE,EAAQpE;;;IAmBhCzE,YACSo5E,GACExB,GACUzwB;QAEnB3iD,MAAMozE,EAAU3wB,IAAa2wB,EAAUN,IAAa8B,cAJ7CA,GACE/3E,iBAAAu2E,aACUzwB;;IAKrBnnD,MACE2J,GACA6wE,GACAh8E;QAEA6iD,GAA0B,eAAe6C,WAAW,IACpDV,GAAgB,eAAe,GAAGhlD;;QAGlC,MAUMwL,IAAKg5C,GAAmB,eAVH,gPAUsC,GAAGw3B,IAC9Dj4D,IAAY6mC,GAAsB,eAAez/C,IACjDzC,IAAS7F,KAAKo5E,GAAal4D,GAAWvY,GAAIxL;QAChD,OAAO,IAAIwoB,GACT3lB,KAAK+3E,GAAOsB,GAAUxzE,IACtB7F,KAAKu2E,WACLv2E,KAAK8lD;;IAITnnD,QACE2J,GACAgxE;QASA,IAAI/0D;QACJ,IARA67B,GAA4B,iBAAiByC,WAAW,GAAG,IAC3DnC,GACE,iBACA,oBACA,GACA44B;aAGmBh4E,MAAjBg4E,KAA+C,UAAjBA,GAChC/0D,gCACK;YAAA,IAAqB,WAAjB+0D,GAGT,MAAM,IAAIr2E,EACRlB,EAAKI,kBACL,mDAAmDm3E,SACjD;YALJ/0D;;QAQF,MAAMrD,IAAY6mC,GAAsB,iBAAiBz/C,IACnDd,IAAUxH,KAAKu5E,GAAcr4D,GAAWqD;QAC9C,OAAO,IAAIoB,GACT3lB,KAAK+3E,GAAOyB,GAAWhyE,IACvBxH,KAAKu2E,WACLv2E,KAAK8lD;;IAITnnD,MAAMiO;QAIJ,OAHAozC,GAA0B,eAAe6C,WAAW,IACpDvC,GAAgB,eAAe,UAAU,GAAG1zC,IAC5C21C,GAAuB,eAAe,GAAG31C;QAClC,IAAI+Y,GACT3lB,KAAK+3E,GAAO0B,GAAiB7sE,IAC7B5M,KAAKu2E,WACLv2E,KAAK8lD;;IAITnnD,YAAYiO;QAIV,OAHAozC,GAA0B,qBAAqB6C,WAAW,IAC1DvC,GAAgB,qBAAqB,UAAU,GAAG1zC;QAClD21C,GAAuB,qBAAqB,GAAG31C,IACxC,IAAI+Y,GACT3lB,KAAK+3E,GAAO2B,GAAgB9sE,IAC5B5M,KAAKu2E,WACLv2E,KAAK8lD;;IAITnnD,QACEg7E,MACG/iE;QAEHspC,GAA4B,iBAAiB2C,WAAW;QACxD,MAAM91B,IAAQ/sB,KAAK45E,GACjB,iBACAD,GACA/iE;qBACY;QAEd,OAAO,IAAI+O,GACT3lB,KAAK+3E,GAAO8B,GAAY9sD,IACxB/sB,KAAKu2E,WACLv2E,KAAK8lD;;IAITnnD,WACEg7E,MACG/iE;QAEHspC,GAA4B,oBAAoB2C,WAAW;QAC3D,MAAM91B,IAAQ/sB,KAAK45E,GACjB,oBACAD,GACA/iE;qBACY;QAEd,OAAO,IAAI+O,GACT3lB,KAAK+3E,GAAO8B,GAAY9sD,IACxB/sB,KAAKu2E,WACLv2E,KAAK8lD;;IAITnnD,UACEg7E,MACG/iE;QAEHspC,GAA4B,mBAAmB2C,WAAW;QAC1D,MAAM91B,IAAQ/sB,KAAK45E,GACjB,mBACAD,GACA/iE;qBACY;QAEd,OAAO,IAAI+O,GACT3lB,KAAK+3E,GAAO+B,GAAU/sD,IACtB/sB,KAAKu2E,WACLv2E,KAAK8lD;;IAITnnD,MACEg7E,MACG/iE;QAEHspC,GAA4B,eAAe2C,WAAW;QACtD,MAAM91B,IAAQ/sB,KAAK45E,GACjB,eACAD,GACA/iE;qBACY;QAEd,OAAO,IAAI+O,GACT3lB,KAAK+3E,GAAO+B,GAAU/sD,IACtB/sB,KAAKu2E,WACLv2E,KAAK8lD;;IAITnnD,QAAQ0B;QACN,MAAMA,aAAiBslB,KACrB,MAAM28B,GAAkB,WAAW,SAAS,GAAGjiD;QAEjD,OACEL,KAAKu2E,cAAcl2E,EAAMk2E,aACzB9kE,GAAYzR,KAAK+3E,IAAQ13E,EAAM03E,OAC/B/3E,KAAK8lD,OAAezlD,EAAMylD;;IAI9BnnD,cACE63E;QAEA,OAAO,IAAI7wD,GAAS3lB,KAAK+3E,IAAQ/3E,KAAKu2E,WAAWC;;0EAI3C73E,GACNwlD,GACAw1B,GACA/iE,GACAqP;QAGA,IADAk8B,GAAgBgC,GAAY,GAAGw1B,IAC3BA,aAAsB9D,IAExB,OADA71B,GAA0BmE,GAAY,EAACw1B,MAAe/iE,KAAS,IACxD5W,KAAK+5E,GAAkB51B,GAAYw1B,EAAWrC,IAAWrxD;QAC3D;YACL,MAAM+zD,IAAY,EAACL,IAAYv0D,OAAOxO;YACtC,OAAO5W,KAAKi6E,GAAgB91B,GAAY61B,GAAW/zD;;;IAuBvDtnB,cAAc/B;;QACZwjD,GAA4B,oBAAoByC,WAAW,GAAG;QAC9D,IAAI92B,IAA2C,IAC3C0qD,IAAU;QAkBd,IAhB2B,mBAAlB75E,EAAK65E,MACXrF,GAAkBx0E,EAAK65E,QAExB1qD,IAAUnvB,EAAK65E,IACfr0B,GAAoB,oBAAoBr2B,GAAS,EAC/C;QAEF80B,GACE,oBACA,WACA,0BACA90B,EAAQ64C;QAEV6R,MAGErF,GAAkBx0E,EAAK65E,KAAW;YACpC,MAAME,IAAe/5E,EAAK65E;YAG1B75E,EAAK65E,mBAAWE,EAAanwE,mCAAMutC,KAAK4iC,IACxC/5E,EAAK65E,IAAU,mBAAKE,EAAaz5E,oCAAO62C,KAAK4iC;YAC7C/5E,EAAK65E,IAAU,mBAAKE,EAAaC,uCAAU7iC,KAAK4iC;eAEhDr2B,GAAgB,oBAAoB,YAAYm2B,GAAS75E,EAAK65E,KAC9D/1B,GACE,oBACA,YACA+1B,IAAU,GACV75E,EAAK65E,IAAU;QAEjB/1B,GACE,oBACA,YACA+1B,IAAU,GACV75E,EAAK65E,IAAU;QAInB,MAAMlS,IAA0C;YAC9C/9D,MAAM8mD;gBACA1wD,EAAK65E,MACN75E,EAAK65E,GACJ,IAAIyD,GACFl6E,KAAKu2E,WACLv2E,KAAK+3E,IACLzqB,GACAttD,KAAK8lD;;YAKb5oD,OAAON,EAAK65E,IAAU;YACtBG,UAAUh6E,EAAK65E,IAAU;;QAK3B,OAFAqB,GAAyC93E,KAAK+3E,KAEvCoC,GADiBn6E,KAAKu2E,UAAUzD,MAGrC9yE,KAAK+3E,IACLhsD,GACAw4C;;IAIJ5lE,IAAIotB;QACFq0B,GAA4B,aAAayC,WAAW,GAAG,IACvDk0B,GAAmB,aAAahrD,IAChC+rD,GAAyC93E,KAAK+3E;QAE9C,MAAM1C,IAAkBr1E,KAAKu2E,UAAUzD;QACvC,QAAQ/mD,KAA8B,YAAnBA,EAAQ2zC,SACvB2V,EAAgB+E,GAA2Bp6E,KAAK+3E;;;;;iBActDxB,GACAzlE,GACAib;YAEA,MAAMtf,IAAS,IAAIgpB,IACbupC,IAAWmb,GACf5D,GACAzlE,GACA;gBACE8zD,yBAAwB;gBACxBqS,KAAuB;eAEzB;gBACEzwE,MAAM8mD;;;oBAGJ0R,KAEI1R,EAASn8C,aAAa4a,KAA8B,aAAnBA,EAAQ2zC,SAC3CjzD,EAAOikB,OACL,IAAIztB,EACFlB,EAAKgB,aACL,mLAOJ0J,EAAOgkB,QAAQ68B;;gBAGnBpwD,OAAOI,KAAKmP,EAAOikB,OAAOpzB;;YAG9B,OAAOmP,EAAOipB;;mEAhDR2kD,EAA2BhF,GAAiBr1E,KAAK+3E,IAAQhsD,IAC3DuV,KACAqjC,KACE,IAAIuV,GAAcl6E,KAAKu2E,WAAWv2E,KAAK+3E,IAAQpT,GAAM3kE,KAAK8lD;;;;SAiDlDq0B,GACd5D,GACAzlE,GACAib,GACAw4C;IAEA,IAAI4S,IAAcnmD;QAChBo/C,QAAQlzE,MAAM,iCAAiC8zB;;IAE7CuzC,EAASrnE,UACXi6E,IAAa5S,EAASrnE,MAAM62C,KAAKwwB;IAEnC,MAAM+Q,IAAgB,IAAItE,GAA4B;QACpDxqE,MAAOiG;YACD83D,EAAS/9D,QACX+9D,EAAS/9D,KAAKiG;;QAGlBvP,OAAOi6E;QAGHC,IAAmBb,EAAUjY,OAAOxtD,GAAOwkE,GAAevpD;IAChE,OAAO;QACLupD,EAAcC,MACdgB,EAAUvX,GAASoY;;;;MAIV8C;IAOXv7E,YACmB62E,GACA8E,GACAC,GACAz0B;kBAHA0vB,aACA8E,aACAC,aACAz0B,GATnB9lD,UAAoE,MACpEA,UAA+D;QAU7DA,KAAKq7B,WAAW,IAAIg8C,GAClBkD,EAAU/oE,kBACV+oE,EAAUppE;;IAIdJ;QACE,MAAMtE,IAAoD;QAE1D,OADAzM,KAAKa,QAAQoP,KAAOxD,EAAOhL,KAAKwO,KACzBxD;;IAGTge;QACE,OAAOzqB,KAAKu6E,GAAUxpE,KAAKhQ;;IAG7BiE;QACE,OAAOhF,KAAKu6E,GAAUxpE,KAAK/L;;IAG7BrG,QACEqxB,GACAwqD;QAEAp6B,GAA4B,yBAAyByC,WAAW,GAAG,IACnEvC,GAAgB,yBAAyB,YAAY,GAAGtwB;QACxDhwB,KAAKu6E,GAAUxpE,KAAKlQ,QAAQoP;YAC1B+f,EAASpvB,KACP45E,GACAx6E,KAAKy6E,GACHxqE,GACAjQ,KAAKq7B,SAASlqB,WACdnR,KAAKu6E,GAAUrpE,GAAY3C,IAAI0B,EAAIzP;;;IAM3CsQ;QACE,OAAO,IAAI6U,GAAM3lB,KAAKs6E,IAAgBt6E,KAAKw1E,IAAYx1E,KAAK8lD;;IAG9DnnD,WACEotB;QAEIA,MACFq2B,GAAoB,4BAA4Br2B,GAAS,EACvD,6BAEF80B,GACE,4BACA,WACA,0BACA90B,EAAQ64C;QAIZ,MAAMA,OACJ74C,MAAWA,EAAQ64C;QAGrB,IAAIA,KAA0B5kE,KAAKu6E,GAAUlpE,IAC3C,MAAM,IAAIpO,EACRlB,EAAKI,kBACL;QAiBJ,OAXGnC,KAAK06E,MACN16E,KAAK26E,OAAyC/V,MAE9C5kE,KAAK06E;;;;;;;;;;;iBAsNTptB,GACAsX,GACA4R;YAWA,IAAIlpB,EAASt8C,GAAQjQ,KAAW;;;gBAG9B,IAAI65E,GACAr7E,IAAQ;gBACZ,OAAO+tD,EAASr8C,WAAWpU,IAAI2T;oBAC7B,MAAMP,IAAMumE,EACVhmE,EAAOP,KACPq9C,EAASn8C,WACTm8C,EAASp8C,GAAY3C,IAAIiC,EAAOP,IAAIzP;oBAWtC,OADAo6E,IAAUpqE,EAAOP,KACV;wBACLU,MAAM;wBACNV,KAAAA;wBACA4qE,WAAW;wBACXC,UAAUv7E;;;;YAGT;;;gBAGL,IAAIw7E,IAAeztB,EAASt8C;gBAC5B,OAAOs8C,EAASr8C,WACbpL,OACC2K,KAAUo0D,0BAA0Bp0D,EAAOG,MAE5C9T,IAAI2T;oBACH,MAAMP,IAAMumE,EACVhmE,EAAOP,KACPq9C,EAASn8C,WACTm8C,EAASp8C,GAAY3C,IAAIiC,EAAOP,IAAIzP;oBAEtC,IAAIq6E,KAAY,GACZC,KAAY;oBAUhB,yBATItqE,EAAOG,SACTkqE,IAAWE,EAAap1E,QAAQ6K,EAAOP,IAAIzP,MAE3Cu6E,IAAeA,EAAa7qE,OAAOM,EAAOP,IAAIzP;wCAE5CgQ,EAAOG,SACToqE,IAAeA,EAAavsE,IAAIgC,EAAOP,MACvC6qE,IAAWC,EAAap1E,QAAQ6K,EAAOP,IAAIzP,OAEtC;wBAAEmQ,MAAMqqE,GAAiBxqE,EAAOG;wBAAOV,KAAAA;wBAAK4qE,UAAAA;wBAAUC,UAAAA;;;;SAvRzCG,CACpBj7E,KAAKu6E,IACL3V,GACA5kE,KAAKy6E,GAAsB1mC,KAAK/zC,QAElCA,KAAK26E,KAAuC/V,IAGvC5kE,KAAK06E;;kEAId/7E,QAAQ0B;QACN,MAAMA,aAAiB65E,KACrB,MAAM53B,GAAkB,WAAW,iBAAiB,GAAGjiD;QAGzD,OACEL,KAAKw1E,OAAen1E,EAAMm1E,MAC1B/jE,GAAYzR,KAAKs6E,IAAgBj6E,EAAMi6E,OACvCt6E,KAAKu6E,GAAUj2E,QAAQjE,EAAMk6E,OAC7Bv6E,KAAK8lD,OAAezlD,EAAMylD;;IAItBnnD,GACNsR,GACAkB,GACAK;QAEA,OAAO,IAAIkmE,GACT13E,KAAKw1E,IACLvlE,EAAIzP,KACJyP,GACAkB,GACAK,GACAxR,KAAK8lD;;;;MAKE4uB,WAAwD/uD;IAEnEhnB,YACWu8E,GACT3E,GACAzwB;QAGA,IADA3iD,MAAM0xE,GAAcp6C,GAAOygD,IAAQ3E,GAAWzwB,cAJrCo1B,GAKLA,EAAMp8E,SAAS,KAAM,GACvB,MAAM,IAAImE,EACRlB,EAAKI,kBACL,kGAEE,GAAG+4E,EAAMz1E,WAAyBy1E,EAAMp8E;;IAKhDqC;QACE,OAAOnB,KAAK+3E,GAAOryE,KAAKke;;IAG1BJ;QACE,MAAMkU,IAAa13B,KAAK+3E,GAAOryE,KAAKie;QACpC,OAAI+T,EAAW32B,MACN,OAEA,IAAI4zE,GACT,IAAIluE,EAAYixB,IAChB13B,KAAKu2E;yBACY;;IAKvB7wE;QACE,OAAO1F,KAAK+3E,GAAOryE,KAAKD;;IAG1B9G,IAAI81E;QACFr0B,GAA4B,2BAA2ByC,WAAW,GAAG;;;QAG5C,MAArBA,UAAU/jD,WACZ21E,IAAa/1E,EAAOwwE,MAEtB5uB,GACE,2BACA,oBACA,GACAm0B;QAEF,MAAM/uE,IAAOJ,EAAaoB;QAC1B,OAAOiuE,GAAkBC,GACvB50E,KAAK+3E,GAAOryE,KAAKwY,MAAMxY,IACvB1F,KAAKu2E,WACLv2E,KAAK8lD;;IAITnnD,IAAIxB;QACF6iD,GAA0B,2BAA2B6C,WAAW,IAIhEvC,GAAgB,2BAA2B,UAAU,GAH9BtgD,KAAK8lD,KACxB9lD,KAAK8lD,GAAWq1B,YAAYh+E,KAC5BA;QAEJ,MAAMi+E,IAASp7E,KAAKiQ;QACpB,OAAOmrE,EAAO7rE,IAAIpS,GAAOmkC,KAAK,MAAM85C;;IAGtCz8E,cACE63E;QAEA,OAAO,IAAI9B,GAAuB10E,KAAKk7E,IAAOl7E,KAAKu2E,WAAWC;;;;AAIlE,SAASV,GACP3xB,GACAp4B;IAEA,SAAgBzqB,MAAZyqB,GACF,OAAO;QACL86B,QAAO;;IAeX,IAXAzE,GAAoB+B,GAAYp4B,GAAS,EAAC,SAAS,kBACnD80B,GAA0BsD,GAAY,WAAW,SAASp4B,EAAQ86B,QAClE/F,GACEqD,GACA,eACA,2BACAp4B,EAAQ+6B,aACR/+B,KACqB,mBAAZA,KAAwBA,aAAmBouD;SAG1B70E,MAAxByqB,EAAQ+6B,oBAA+CxlD,MAAlByqB,EAAQ86B,OAC/C,MAAM,IAAI5jD,EACRlB,EAAKI,kBACL,sCAAsCgiD,0CACpC;IAIN,OAAOp4B;;;AAGT,SAAS0rD,GACPtzB,GACAp4B;IAEA,YAAgBzqB,MAAZyqB,IACK,MAGTq2B,GAAoB+B,GAAYp4B,GAAS,EAAC,uBAC1Cq1B,GACE+C,GACA,GACA,oBACAp4B,EAAQ8rD,kBACR,EAAC,YAAY,YAAY;IAEpB9rD;;;AAGT,SAASgrD,GACP5yB,GACAp4B;IAEA20B,GAAwByD,GAAY,UAAU,GAAGp4B,IAC7CA,MACFq2B,GAAoB+B,GAAYp4B,GAAS,EAAC,aAC1Cq1B,GACE+C,GACA,GACA,UACAp4B,EAAQ2zC,QACR,EAAC,WAAW,UAAU;;;AAK5B,SAASiW,GACPxxB,GACAuxB,GACAa;IAEA,IAAMb,aAAuB/vB,IAEtB;QAAA,IAAI+vB,EAAYa,cAAcA,GACnC,MAAM,IAAItzE,EACRlB,EAAKI,kBACL;QAGF,OAAOuzE;;IAPP,MAAMpzB,GAAkB6B,GAAY,qBAAqB,GAAGuxB;;;AA4FhE,SAASsF,GAAiBrqE;IACxB,QAAQA;MACN;QACE,OAAO;;MACT;MACA;QACE,OAAO;;MACT;QACE,OAAO;;MACT;QACE,OA7kFsBpT;;;;;;;;;;;;aA0lFZy4E,GACdQ,GACAr5E,GACA4uB;IAEA,IAAIgqD;;;;IAaJ,OAPIA,IALAS,IACEzqD,MAAYA,EAAQ86B,SAAS96B,EAAQ+6B,eAIrB0vB,EAAkB2E,YAAYh+E,GAAO4uB,KAEtCyqD,EAAU2E,YAAYh+E,KAGxBA;IAEZ44E;;;AC7lFT,MAAMsF,KAAqB;IACzBzI,WAAAA;IACAvtB,UAAAA;IACA/hD,WAAAA;IACAo/C,MAAAA;iBACAkM;IACAkmB,YAAAA;IACAH,mBAAAA;IACAkB,kBAAAA;WACAlwD;IACA+xD,uBAAAA;IACAwC,eAAAA;IACAxF,qBAAAA;eACA3uE;IACAk/C,YAAAA;IACAmwB,aAAaxC,GAAUwC;IACvB5C,sBAAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;SCzBc8I,GAAkBC;cDoChCr/E,GACAs/E;QAKCt/E,EAAgC4G,SAAS24E,kBACxC,IAAIC,EACF,aACAC;YACE,MAAM3I,IAAM2I,EAAUC,YAAY,OAAO5xB;YACzC,OAAOwxB,EAAiBxI,GAAK2I,EAAUC,YAAY;kCAGrDC,kCAAqBR;KCjDzBS,CACEP,GACA,CAACvI,GAAKjpB,MACJ,IAAI6oB,GAAUI,GAAKjpB,GAAM,IAAI+kB,MAEjCyM,EAASQ,iDAA+B;;;AAG1CT,GAAkBp/E;;"}