@dxos/echo-pipeline 0.8.3 → 0.8.4-main.1c7ec43d41

package/dist/lib/neutral/index.mjs.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../src/db-host/automerge-data-source.ts", "../../../src/db-host/data-service.ts", "../../../src/automerge/automerge-host.ts", "../../../src/automerge/collection-synchronizer.ts", "../../../src/automerge/echo-network-adapter.ts", "../../../src/automerge/network-protocol.ts", "../../../src/automerge/handle-state.ts", "../../../src/automerge/heads-store.ts", "../../../src/automerge/leveldb-storage-adapter.ts", "../../../src/automerge/mesh-echo-replicator.ts", "../../../src/automerge/mesh-echo-replicator-connection.ts", "../../../src/automerge/space-collection.ts", "../../../src/automerge/echo-data-monitor.ts", "../../../src/db-host/documents-synchronizer.ts", "../../../src/db-host/echo-host.ts", "../../../src/db-host/invalidation-hint.ts", "../../../src/db-host/local-queue-service.ts", "../../../src/db-host/query-service.ts", "../../../src/query/query-executor.ts", "../../../src/query/errors.ts", "../../../src/query/query-planner.ts", "../../../src/query/plan.ts", "../../../src/db-host/queue-data-source.ts", "../../../src/db-host/space-state-manager.ts", "../../../src/db-host/database-root.ts", "../../../src/db-host/automerge-metrics.ts", "../../../src/edge/echo-edge-replicator.ts", "../../../src/edge/inflight-request-limiter.ts", "../../../src/edge/echo-edge-subduction-replicator.ts", "../../../src/util.ts"],
+  "sourcesContent": ["//\n// Copyright 2026 DXOS.org\n//\n\nimport * as A from '@automerge/automerge';\nimport { type DocumentId } from '@automerge/automerge-repo';\nimport * as Effect from 'effect/Effect';\n\nimport { type Context } from '@dxos/context';\nimport { DatabaseDirectory, SpaceDocVersion } from '@dxos/echo-protocol';\nimport { objectStructureToJson } from '@dxos/echo/internal';\nimport { type DataSourceCursor, type IndexDataSource, type IndexerObject } from '@dxos/index-core';\nimport { PublicKey } from '@dxos/keys';\nimport { log } from '@dxos/log';\n\nimport { type AutomergeHost } from '../automerge';\nimport { createIdFromSpaceKey } from '../common';\n\nconst HEADS_DELIMITER = '|';\n\n/**\n * Codec for serializing/deserializing Automerge heads to cursor strings.\n */\nexport const headsCodec = {\n  /**\n   * Serialize automerge heads to a cursor string.\n   * Heads are sorted to ensure consistent comparison.\n   */\n  encode: (heads: A.Heads): string => [...heads].sort().join(HEADS_DELIMITER),\n\n  /**\n   * Deserialize a cursor string back to heads array.\n   */\n  decode: (cursor: string): string[] => (cursor ? cursor.split(HEADS_DELIMITER) : []),\n};\n\n/**\n * Check if document has changed by comparing cursor with current heads.\n */\nconst hasChanged = (cursor: string | undefined, currentHeads: A.Heads): boolean => {\n  if (!cursor) {\n    return true; // New document.\n  }\n  return cursor !== headsCodec.encode(currentHeads);\n};\n\n/**\n * Data source that fetches objects from AutomergeHost.\n * Iterates all documents from HeadsStore and tracks document heads as cursors to detect changes.\n */\nexport class AutomergeDataSource implements IndexDataSource {\n  readonly sourceName = 'automerge';\n\n  readonly #automergeHost: AutomergeHost;\n\n  constructor(automergeHost: AutomergeHost) {\n    this.#automergeHost = automergeHost;\n  }\n\n  getChangedObjects(\n    ctx: Context,\n    cursors: DataSourceCursor[],\n    opts?: { limit?: number },\n  ): Effect.Effect<{ objects: IndexerObject[]; cursors: DataSourceCursor[] }> {\n    return Effect.gen(this, function* () {\n      // Build a map of documentId -> cursor for quick lookup.\n      const cursorMap = new Map<string, string>();\n      for (const cursor of cursors) {\n        if (cursor.resourceId) {\n          cursorMap.set(cursor.resourceId, String(cursor.cursor));\n        }\n      }\n\n      // Find changed documents by iterating all documents from HeadsStore.\n      const changedDocuments = yield* Effect.promise(async () => {\n        const result: { documentId: DocumentId; heads: A.Heads }[] = [];\n        const limit = opts?.limit ?? Infinity;\n\n        for await (const { documentId, heads } of this.#automergeHost.listDocumentHeads()) {\n          const existingCursor = cursorMap.get(documentId);\n          if (hasChanged(existingCursor, heads)) {\n            result.push({ documentId, heads });\n            if (result.length >= limit) {\n              break;\n            }\n          }\n        }\n        return result;\n      });\n\n      // Load changed documents and extract objects.\n      const objects: IndexerObject[] = [];\n      const updatedCursors: DataSourceCursor[] = [];\n\n      for (const { documentId, heads: docHeads } of changedDocuments) {\n        try {\n          const handle = yield* Effect.promise(() => this.#automergeHost.loadDoc<DatabaseDirectory>(ctx, documentId));\n          const doc = handle.doc();\n          if (!doc) {\n            continue;\n          }\n\n          // Skip outdated docs.\n          if (doc.version !== SpaceDocVersion.CURRENT) {\n            continue;\n          }\n\n          // Extract spaceId from document.\n          const spaceKeyHex = DatabaseDirectory.getSpaceKey(doc);\n          if (!spaceKeyHex) {\n            // Skip documents without a space key.\n            continue;\n          }\n          const spaceKey = PublicKey.fromHex(spaceKeyHex);\n          const spaceId = yield* Effect.promise(() => createIdFromSpaceKey(spaceKey));\n\n          const existingCursor = cursorMap.get(documentId);\n          const { changedObjectIds, updatedAt } = inspectDocChanges(doc, existingCursor);\n\n          const docObjects = doc.objects ?? {};\n          for (const [objectId, structure] of Object.entries(docObjects)) {\n            if (changedObjectIds && !changedObjectIds.has(objectId)) {\n              continue;\n            }\n            objects.push({\n              spaceId,\n              documentId,\n              queueId: null,\n              queueNamespace: null,\n              recordId: null,\n              data: objectStructureToJson(objectId, structure),\n              updatedAt,\n            });\n          }\n\n          // Update cursor for this document.\n          updatedCursors.push({\n            spaceId,\n            resourceId: documentId,\n            cursor: headsCodec.encode(docHeads),\n          });\n        } catch (error) {\n          log.error('Error loading document for indexing', { documentId, error });\n        }\n      }\n\n      return { objects, cursors: updatedCursors };\n    });\n  }\n}\n\n/**\n * Determines which ECHO objects changed and the document-level max change timestamp.\n *\n * Uses `A.diff` to extract changed objectIds from patch paths (`[\"objects\", objectId, ...]`),\n * and `A.getChangesMetaSince` for the max timestamp (second-level precision).\n * Returns `changedObjectIds: null` when all objects should be indexed (new document).\n */\nconst inspectDocChanges = (\n  doc: DatabaseDirectory,\n  existingCursor: string | undefined,\n): { changedObjectIds: Set<string> | null; updatedAt: number } => {\n  if (!existingCursor) {\n    return { changedObjectIds: null, updatedAt: Date.now() };\n  }\n\n  const oldHeads = headsCodec.decode(existingCursor);\n\n  const patches = A.diff(doc, oldHeads, A.getHeads(doc));\n  const changedObjectIds = new Set<string>();\n  for (const patch of patches) {\n    if (patch.path.length >= 2 && patch.path[0] === 'objects') {\n      changedObjectIds.add(String(patch.path[1]));\n    }\n  }\n\n  const changes = A.getChangesMetaSince(doc, oldHeads);\n  let maxTime = 0;\n  for (const change of changes) {\n    if (change.time > maxTime) {\n      maxTime = change.time;\n    }\n  }\n  const updatedAt = maxTime > 0 ? maxTime * 1000 : Date.now();\n\n  return { changedObjectIds, updatedAt };\n};\n", "//\n// Copyright 2021 DXOS.org\n//\n\nimport { type DocumentId } from '@automerge/automerge-repo';\n\nimport { UpdateScheduler } from '@dxos/async';\nimport { type RequestOptions } from '@dxos/codec-protobuf';\nimport { Stream } from '@dxos/codec-protobuf/stream';\nimport { Context } from '@dxos/context';\nimport { invariant } from '@dxos/invariant';\nimport { SpaceId } from '@dxos/keys';\nimport { log } from '@dxos/log';\nimport {\n  type BatchedDocumentUpdates,\n  type CreateDocumentRequest,\n  type CreateDocumentResponse,\n  type DataService,\n  type FlushRequest,\n  type GetDocumentHeadsRequest,\n  type GetDocumentHeadsResponse,\n  type GetSpaceSyncStateRequest,\n  type ReIndexHeadsRequest,\n  type SpaceSyncState,\n  type SubscribeRequest,\n  type UpdateRequest,\n  type UpdateSubscriptionRequest,\n  type WaitUntilHeadsReplicatedRequest,\n} from '@dxos/protocols/proto/dxos/echo/service';\n\nimport { type AutomergeHost, deriveCollectionIdFromSpaceId } from '../automerge';\nimport { DocumentsSynchronizer } from './documents-synchronizer';\nimport { type SpaceStateManager } from './space-state-manager';\n\nexport type DataServiceProps = {\n  automergeHost: AutomergeHost;\n  spaceStateManager: SpaceStateManager;\n  updateIndexes: () => Promise<void>;\n};\n\n/**\n * Data sync between client and services.\n */\n// TODO(burdon): Move to client-services.\nexport class DataServiceImpl implements DataService {\n  /**\n   * Map of subscriptions.\n   * subscriptionId -> DocumentsSynchronizer\n   */\n  private readonly _subscriptions = new Map<string, DocumentsSynchronizer>();\n\n  private readonly _automergeHost: AutomergeHost;\n  private readonly _spaceStateManager: SpaceStateManager;\n  private readonly _updateIndexes: () => Promise<void>;\n\n  constructor(params: DataServiceProps) {\n    this._automergeHost = params.automergeHost;\n    this._spaceStateManager = params.spaceStateManager;\n    this._updateIndexes = params.updateIndexes;\n  }\n\n  subscribe(request: SubscribeRequest): Stream<BatchedDocumentUpdates> {\n    return new Stream<BatchedDocumentUpdates>(({ next, ready }) => {\n      const synchronizer = new DocumentsSynchronizer({\n        automergeHost: this._automergeHost,\n        sendUpdates: (updates) => next(updates),\n      });\n      synchronizer\n        .open()\n        .then(() => {\n          this._subscriptions.set(request.subscriptionId, synchronizer);\n          ready();\n        })\n        .catch((err) => log.catch(err));\n      return () => synchronizer.close();\n    });\n  }\n\n  async updateSubscription(request: UpdateSubscriptionRequest): Promise<void> {\n    const synchronizer = this._subscriptions.get(request.subscriptionId);\n    invariant(synchronizer, 'Subscription not found');\n\n    if (request.addIds?.length) {\n      await synchronizer.addDocuments(request.addIds as DocumentId[]);\n    }\n    if (request.removeIds?.length) {\n      await synchronizer.removeDocuments(request.removeIds as DocumentId[]);\n    }\n  }\n\n  async createDocument(request: CreateDocumentRequest): Promise<CreateDocumentResponse> {\n    const handle = await this._automergeHost.createDoc(request.initialValue);\n    return { documentId: handle.documentId };\n  }\n\n  async update(request: UpdateRequest, options?: RequestOptions): Promise<void> {\n    if (!request.updates) {\n      return;\n    }\n    const synchronizer = this._subscriptions.get(request.subscriptionId);\n    invariant(synchronizer, 'Subscription not found');\n\n    await synchronizer.update(options?.ctx ?? Context.default(), request.updates);\n  }\n\n  async flush(request: FlushRequest, options?: RequestOptions): Promise<void> {\n    await this._automergeHost.flush(options?.ctx ?? Context.default(), request);\n  }\n\n  async getDocumentHeads(request: GetDocumentHeadsRequest): Promise<GetDocumentHeadsResponse> {\n    const documentIds = request.documentIds;\n    if (!documentIds) {\n      return { heads: { entries: [] } };\n    }\n    const heads = await this._automergeHost.getHeads(documentIds as DocumentId[]);\n    return {\n      heads: {\n        entries: heads.map((heads, idx) => ({ documentId: documentIds[idx], heads })),\n      },\n    };\n  }\n\n  async waitUntilHeadsReplicated(\n    request: WaitUntilHeadsReplicatedRequest,\n    options?: RequestOptions | undefined,\n  ): Promise<void> {\n    await this._automergeHost.waitUntilHeadsReplicated(options?.ctx ?? Context.default(), request.heads);\n  }\n\n  async reIndexHeads(request: ReIndexHeadsRequest, _options?: RequestOptions): Promise<void> {\n    await this._automergeHost.reIndexHeads((request.documentIds ?? []) as DocumentId[]);\n  }\n\n  async updateIndexes(): Promise<void> {\n    await this._updateIndexes();\n  }\n\n  subscribeSpaceSyncState(request: GetSpaceSyncStateRequest): Stream<SpaceSyncState> {\n    return new Stream<SpaceSyncState>(({ ctx, next, ready }) => {\n      const spaceId = request.spaceId;\n      invariant(SpaceId.isValid(spaceId));\n\n      const rootDocumentId = this._spaceStateManager.getSpaceRootDocumentId(spaceId);\n      let collectionId = rootDocumentId && deriveCollectionIdFromSpaceId(spaceId, rootDocumentId);\n      this._spaceStateManager.spaceDocumentListUpdated.on(ctx, (event) => {\n        const newId = deriveCollectionIdFromSpaceId(spaceId, event.spaceRootId);\n        if (newId !== collectionId) {\n          collectionId = newId;\n          scheduler.trigger();\n        }\n      });\n\n      const scheduler = new UpdateScheduler(ctx, async () => {\n        const state = collectionId ? await this._automergeHost.getCollectionSyncState(collectionId) : { peers: [] };\n\n        next({ peers: state.peers });\n      });\n\n      this._automergeHost.collectionStateUpdated.on(ctx, (e) => {\n        if (e.collectionId === collectionId) {\n          scheduler.trigger();\n        }\n      });\n      scheduler.trigger();\n    });\n  }\n}\n", "//\n// Copyright 2023 DXOS.org\n//\n\nimport {\n  type Doc,\n  type Heads,\n  getBackend,\n  getHeads,\n  equals as headsEquals,\n  isAutomerge,\n  save,\n} from '@automerge/automerge';\nimport {\n  type AnyDocumentId,\n  type DocHandle,\n  type DocHandleChangePayload,\n  type DocumentId,\n  type DocumentQuery,\n  type PeerCandidatePayload,\n  type PeerDisconnectedPayload,\n  type PeerId,\n  Repo,\n  type StorageAdapterInterface,\n  type StorageKey,\n  type SubductionPolicy,\n  interpretAsDocumentId,\n  initSubduction,\n} from '@automerge/automerge-repo';\nimport { type MemorySigner } from '@automerge/automerge-subduction';\n\nimport { DeferredTask, Event, asyncTimeout } from '@dxos/async';\nimport { Context, type Lifecycle, Resource, cancelWithContext } from '@dxos/context';\nimport { type CollectionId, DatabaseDirectory } from '@dxos/echo-protocol';\nimport { invariant } from '@dxos/invariant';\nimport { PublicKey } from '@dxos/keys';\nimport { type LevelDB } from '@dxos/kv-store';\nimport { log } from '@dxos/log';\nimport { type SpaceSyncState } from '@dxos/protocols/proto/dxos/echo/service';\nimport { type DocHeadsList, type FlushRequest } from '@dxos/protocols/proto/dxos/echo/service';\nimport { trace } from '@dxos/tracing';\nimport { ComplexSet, bufferToArray, defaultMap, isNonNullable, range } from '@dxos/util';\n\nimport { type CollectionState, CollectionSynchronizer, diffCollectionState } from './collection-synchronizer';\nimport { type EchoDataMonitor } from './echo-data-monitor';\nimport { EchoNetworkAdapter, isEchoPeerMetadata } from './echo-network-adapter';\nimport { type AutomergeReplicator, type RemoteDocumentExistenceCheckProps } from './echo-replicator';\nimport { getHandleState } from './handle-state';\nimport { HeadsStore } from './heads-store';\nimport { type BeforeSaveProps, LevelDBStorageAdapter } from './leveldb-storage-adapter';\n\nexport type PeerIdProvider = () => string | undefined;\n\nexport type RootDocumentSpaceKeyProvider = (documentId: string) => PublicKey | undefined;\n\nconst SUBDUCTION_SERVICE_NAME = 'dxos-subduction';\n\nexport type AutomergeHostProps = {\n  db: LevelDB;\n  dataMonitor?: EchoDataMonitor;\n\n  /**\n   * Used for creating stable ids. A random key is generated on open, if no value is provided.\n   */\n  peerIdProvider?: PeerIdProvider;\n  getSpaceKeyByRootDocumentId?: RootDocumentSpaceKeyProvider;\n\n  /**\n   * Enable Subduction sedimentree transport.\n   *\n   * When `false` (default), the host wires {@link EchoNetworkAdapter} as a classical\n   * automerge-repo network adapter and skips all Subduction-specific initialization\n   * (WASM init, signer generation, subduction policy / adapters). When `true`, the\n   * host runs Subduction as the document byte transport.\n   */\n  useSubduction?: boolean;\n};\n\nexport type LoadDocOptions = {\n  timeout?: number;\n\n  /**\n   * If true, the document will be fetched from the network if it is not found in the local storage.\n   * Setting this to false does not guarantee that the document will not be fetched from the network.\n   */\n  fetchFromNetwork?: boolean;\n};\n\nexport type CreateDocOptions = {\n  /**\n   * Import the document together with its history.\n   */\n  preserveHistory?: boolean;\n\n  documentId?: DocumentId;\n};\n\n/**\n * Maximum amount of documents to sync in a single bundle.\n */\nconst BUNDLE_SIZE = 100;\n\n/**\n * Maximum amount of concurrent tasks to run when pushing or pulling bundles.\n */\nconst BUNDLE_SYNC_CONCURRENCY = 2;\n\n/**\n * If the number of documents to sync is greater than this threshold, we will use bundles.\n */\nconst BUNDLE_SYNC_THRESHOLD = 50;\n\n/**\n * Only announce documents that are known to require sync.\n */\nconst OPTIMIZED_SHARE_POLICY = true;\n\n/**\n * Abstracts over the AutomergeRepo.\n *\n * Runs Subduction as the document byte transport ({@link Repo.subductionAdapters}), while\n * the DXOS-specific {@link CollectionSynchronizer} rides on the same {@link EchoNetworkAdapter}\n * via `sync-request` / `sync-state` control messages that are intercepted at the adapter\n * level and never reach the Subduction sedimentree layer. Bundle sync remains available\n * for replicators that opt in.\n */\n@trace.resource({ lifecycle: true })\nexport class AutomergeHost extends Resource {\n  private readonly _db: LevelDB;\n  private readonly _echoNetworkAdapter: EchoNetworkAdapter;\n\n  private readonly _collectionSynchronizer = new CollectionSynchronizer({\n    queryCollectionState: this._queryCollectionState.bind(this),\n    sendCollectionState: this._sendCollectionState.bind(this),\n    shouldSyncCollection: this._shouldSyncCollection.bind(this),\n  });\n\n  private _repo!: Repo;\n  private _storage!: StorageAdapterInterface & Lifecycle;\n  private readonly _headsStore: HeadsStore;\n\n  private _syncTask: DeferredTask | undefined = undefined;\n  /**\n   * Cache of collections that would be synced on next sync task run.\n   */\n  private readonly _collectionsToSync = new ComplexSet<{ collectionId: string; peerId: PeerId }>(\n    ({ collectionId, peerId }) => `${collectionId}|${peerId}`,\n  );\n\n  @trace.info()\n  private _peerId!: PeerId;\n\n  private readonly _peerIdProvider?: PeerIdProvider;\n  private readonly _getSpaceKeyByRootDocumentId?: RootDocumentSpaceKeyProvider;\n\n  public readonly collectionStateUpdated = new Event<{ collectionId: CollectionId }>();\n\n  /**\n   * Fired after a batch of documents was saved to disk.\n   */\n  public readonly documentsSaved = new Event();\n\n  private readonly _headsUpdates = new Map<DocumentId, Heads>();\n  private _onHeadsChangedTask?: DeferredTask;\n\n  /**\n   * Documents created in this session.\n   */\n  private _createdDocuments = new Set<DocumentId>();\n\n  /**\n   * Documents that need to be synced based on the result of collection-sync.\n   */\n  private _documentsToSync = new Set<DocumentId>();\n\n  /**\n   * Documents that are not available locally that should be requested.\n   */\n  private _documentsToRequest = new Set<DocumentId>();\n\n  /**\n   * Documents requested by remote peers.\n   */\n  private _documentsRequested = new Map<PeerId, Set<DocumentId>>();\n\n  private _sharePolicyChangedTask?: DeferredTask;\n\n  private _signer: MemorySigner | undefined = undefined;\n  private readonly _useSubduction: boolean;\n\n  constructor({\n    db,\n    dataMonitor,\n    peerIdProvider,\n    getSpaceKeyByRootDocumentId,\n    useSubduction = false,\n  }: AutomergeHostProps) {\n    super();\n    this._db = db;\n    this._useSubduction = useSubduction;\n    this._storage = new LevelDBStorageAdapter({\n      db: db.sublevel('automerge'),\n      callbacks: {\n        beforeSave: async (params) => this._beforeSave(params),\n        afterSave: async (key) => this._afterSave(key),\n      },\n      monitor: dataMonitor,\n    });\n    this._echoNetworkAdapter = new EchoNetworkAdapter({\n      getContainingSpaceForDocument: this._getContainingSpaceForDocument.bind(this),\n      isDocumentInRemoteCollection: this._isDocumentInRemoteCollection.bind(this),\n      onCollectionStateQueried: this._onCollectionStateQueried.bind(this),\n      onCollectionStateReceived: this._onCollectionStateReceived.bind(this),\n      monitor: dataMonitor,\n    });\n    this._echoNetworkAdapter.documentRequested.on(({ peerId, documentId }) => {\n      defaultMap(this._documentsRequested, peerId, () => new Set()).add(documentId);\n      if (!this._useSubduction) {\n        this._sharePolicyChangedTask!.schedule();\n      }\n    });\n    this._headsStore = new HeadsStore({ db: db.sublevel('heads') });\n    this._peerIdProvider = peerIdProvider;\n    this._getSpaceKeyByRootDocumentId = getSpaceKeyByRootDocumentId;\n  }\n\n  protected override async _open(ctx: Context): Promise<void> {\n    this._peerId = `host-${this._peerIdProvider?.() ?? PublicKey.random().toHex()}` as PeerId;\n\n    this._onHeadsChangedTask = new DeferredTask(this._ctx, async () => {\n      const docHeads = Array.from(this._headsUpdates.entries());\n      this._headsUpdates.clear();\n      this._onHeadsChanged(docHeads);\n    });\n\n    await this._storage.open?.();\n\n    // `Repo` unconditionally constructs a Subduction `SubductionSource` (with a fresh\n    // `MemorySigner` when none is injected) regardless of whether we register any\n    // `subductionAdapters`. That source's signer needs the Subduction WASM module\n    // initialized first — `Repo` imports from `@automerge/automerge-subduction/slim`,\n    // which does not auto-init. So WASM init runs in both modes.\n    await initSubduction();\n\n    if (this._useSubduction) {\n      const { MemorySigner } = await import('@automerge/automerge-subduction');\n      this._signer ??= MemorySigner.generate();\n\n      this._repo = new Repo({\n        peerId: this._peerId as PeerId,\n        shareConfig: this._shareConfig,\n        subductionPolicy: this._subductionPolicy,\n        storage: this._storage,\n        network: [],\n        signer: this._signer,\n        subductionAdapters: [\n          {\n            adapter: this._echoNetworkAdapter,\n            serviceName: SUBDUCTION_SERVICE_NAME,\n            // DXOS hosts are always clients — the edge DO is the single `accept` peer in\n            // the DXOS-client <-> edge topology. `connect` uses Subduction's discovery mode,\n            // so peer-to-peer connections (e.g., mesh replicator, test networks) also work\n            // with `connect` on both sides.\n            role: 'connect',\n          },\n        ],\n      });\n    } else {\n      // Classical automerge-repo wiring: the EchoNetworkAdapter is registered as a\n      // network adapter and document bytes flow through the standard sync protocol.\n      // `Repo` will internally construct an unused `MemorySigner` for its always-on\n      // `SubductionSource`; with no `subductionAdapters` passed in that source has no\n      // peers to talk to, so it's effectively dormant.\n      this._repo = new Repo({\n        peerId: this._peerId as PeerId,\n        shareConfig: this._shareConfig,\n        storage: this._storage,\n        network: [this._echoNetworkAdapter],\n      });\n    }\n\n    let updatingAuthScope = false;\n    Event.wrap(this._echoNetworkAdapter, 'peer-candidate').on(\n      this._ctx,\n      ((e: PeerCandidatePayload) => !updatingAuthScope && this._onPeerConnected(e.peerId)) as any,\n    );\n    Event.wrap(this._echoNetworkAdapter, 'peer-disconnected').on(\n      this._ctx,\n      ((e: PeerDisconnectedPayload) => !updatingAuthScope && this._onPeerDisconnected(e.peerId)) as any,\n    );\n\n    this._collectionSynchronizer.remoteStateUpdated.on(this._ctx, ({ collectionId, peerId, newDocsAppeared }) => {\n      this._onRemoteCollectionStateUpdated(collectionId, peerId);\n      this.collectionStateUpdated.emit({ collectionId: collectionId as CollectionId });\n      if (!this._useSubduction && newDocsAppeared) {\n        updatingAuthScope = true;\n        try {\n          this._echoNetworkAdapter.onConnectionAuthScopeChanged(peerId);\n        } finally {\n          updatingAuthScope = false;\n        }\n      }\n    });\n\n    this._syncTask = new DeferredTask(this._ctx, async () => {\n      const collectionToSync = Array.from(this._collectionsToSync.values());\n      this._collectionsToSync.clear();\n      if (collectionToSync.length === 0) {\n        return;\n      }\n      await Promise.all(\n        collectionToSync.map(async ({ collectionId, peerId }) => {\n          try {\n            await this._handleCollectionSync(this._ctx, collectionId, peerId);\n          } catch (err) {\n            log.error('failed to sync collection', { collectionId, peerId, err });\n          }\n        }),\n      );\n    });\n\n    this._sharePolicyChangedTask = new DeferredTask(this._ctx, async () => {\n      log('share policy changed');\n      this._repo.shareConfigChanged();\n    });\n\n    await this._echoNetworkAdapter.open();\n    await this._collectionSynchronizer.open(ctx);\n    await this._echoNetworkAdapter.whenConnected();\n  }\n\n  protected override async _close(ctx: Context): Promise<void> {\n    await this._collectionSynchronizer.close(ctx);\n    await this._repo.flush().catch((err) => log.warn('failed to flush repo before shutdown', { err }));\n    await this._repo.shutdown().catch((err) => log.warn('failed to shutdown repo', { err }));\n    await this._storage.close?.();\n    await this._echoNetworkAdapter.close();\n    this._syncTask = undefined;\n    this._onHeadsChangedTask = undefined;\n    this._sharePolicyChangedTask = undefined;\n  }\n\n  get peerId(): PeerId {\n    return this._peerId;\n  }\n\n  get loadedDocsCount(): number {\n    return Object.keys(this._repo.handles).length;\n  }\n\n  get handles(): Readonly<Record<DocumentId, DocHandle<any>>> {\n    return this._repo.handles;\n  }\n\n  async addReplicator(ctx: Context, replicator: AutomergeReplicator): Promise<void> {\n    invariant(this.isOpen, 'AutomergeHost is not open');\n    await this._echoNetworkAdapter.addReplicator(ctx, replicator);\n  }\n\n  async removeReplicator(replicator: AutomergeReplicator): Promise<void> {\n    invariant(this.isOpen, 'AutomergeHost is not open');\n    await this._echoNetworkAdapter.removeReplicator(replicator);\n  }\n\n  async loadDoc<T>(ctx: Context, documentId: AnyDocumentId, opts?: LoadDocOptions): Promise<DocHandle<T>> {\n    invariant(this.isOpen, 'AutomergeHost is not open');\n    // Readiness lives on the `DocumentQuery`, not the `DocHandle` — see\n    // {@link getHandleState}.\n    const progress = this._repo.findWithProgress<T>(documentId as DocumentId);\n    const state = progress.peek();\n    if (state.state === 'ready') {\n      return state.handle;\n    }\n    if (!this._useSubduction) {\n      this._documentsToRequest.add(progress.documentId);\n      this._sharePolicyChangedTask!.schedule();\n    }\n    const readyPromise = progress.whenReady();\n    return opts?.timeout\n      ? await cancelWithContext(ctx, asyncTimeout(readyPromise, opts.timeout))\n      : await cancelWithContext(ctx, readyPromise);\n  }\n\n  /**\n   * Returns the live {@link DocumentQuery} for a document — exposes the\n   * always-attached `DocHandle` and the actual readiness state\n   * (`'loading' | 'ready' | 'unavailable' | 'failed'`) via `peek()` /\n   * `subscribe()` / `whenReady()`. Use this to observe sync state without\n   * forcing a wait. See {@link getHandleState} for why callers must read\n   * liveness off the query rather than the `DocHandle` itself.\n   */\n  findWithProgress<T>(documentId: AnyDocumentId): DocumentQuery<T> {\n    invariant(this.isOpen, 'AutomergeHost is not open');\n    return this._repo.findWithProgress<T>(documentId as DocumentId) as DocumentQuery<T>;\n  }\n\n  async exportDoc(id: AnyDocumentId): Promise<Uint8Array> {\n    invariant(this.isOpen, 'AutomergeHost is not open');\n    const documentId = interpretAsDocumentId(id);\n\n    const chunks = await this._storage.loadRange([documentId]);\n    return bufferToArray(Buffer.concat(chunks.map((c) => c.data!)));\n  }\n\n  /**\n   * Create new persisted document.\n   */\n  async createDoc<T>(initialValue?: T | Doc<T> | Uint8Array, opts?: CreateDocOptions): Promise<DocHandle<T>> {\n    invariant(this.isOpen, 'AutomergeHost is not open');\n    if (opts?.preserveHistory) {\n      if (initialValue instanceof Uint8Array) {\n        const handle = this._repo.import<T>(initialValue, { docId: opts?.documentId });\n        this._createdDocuments.add(handle.documentId);\n        if (!this._useSubduction) {\n          this._sharePolicyChangedTask!.schedule();\n        }\n        return handle;\n      }\n\n      if (!isAutomerge(initialValue)) {\n        throw new TypeError('Initial value must be an Automerge document');\n      }\n\n      // TODO(dmaretskyi): There's a more efficient way.\n      const handle = this._repo.import<T>(save(initialValue as Doc<T>), { docId: opts?.documentId });\n      this._createdDocuments.add(handle.documentId);\n      if (!this._useSubduction) {\n        this._sharePolicyChangedTask!.schedule();\n      }\n      return handle;\n    } else {\n      if (initialValue instanceof Uint8Array) {\n        throw new Error('Cannot create document from Uint8Array without preserving history');\n      }\n\n      if (opts?.documentId) {\n        throw new Error('Cannot prefil document id when not importing an existing doc');\n      }\n      const handle = await this._repo.create2<T>(initialValue);\n      this._createdDocuments.add(handle.documentId);\n      if (!this._useSubduction) {\n        this._sharePolicyChangedTask!.schedule();\n      }\n      return handle;\n    }\n  }\n\n  async waitUntilHeadsReplicated(ctx: Context, heads: DocHeadsList): Promise<void> {\n    invariant(this.isOpen, 'AutomergeHost is not open');\n    const entries = heads.entries;\n    if (!entries?.length) {\n      return;\n    }\n    const documentIds = entries.map((entry) => entry.documentId as DocumentId);\n    const documentHeads = await this.getHeads(documentIds);\n    const headsToWait = entries.filter((entry, index) => {\n      const targetHeads = entry.heads;\n      if (!targetHeads || targetHeads.length === 0) {\n        return false;\n      }\n      const currentHeads = documentHeads[index];\n      return !(currentHeads !== null && currentHeads !== undefined && headsEquals(currentHeads, targetHeads));\n    });\n    if (headsToWait.length > 0) {\n      await Promise.all(\n        headsToWait.map(async (entry) => {\n          const handle = await this.loadDoc<DatabaseDirectory>(ctx, entry.documentId as DocumentId);\n          await waitForHeads(handle, entry.heads!);\n        }),\n      );\n    }\n\n    // Flush to disk handles loaded to memory also so that the indexer can pick up the changes.\n    await this._repo.flush(documentIds.filter((documentId) => getHandleState(this._repo, documentId) === 'ready'));\n  }\n\n  async reIndexHeads(documentIds: DocumentId[]): Promise<void> {\n    invariant(this.isOpen, 'AutomergeHost is not open');\n    for (const documentId of documentIds) {\n      log('re-indexing heads for document', { documentId });\n      // `Repo.find()` resolves on `'ready'` and rejects on `'unavailable'`,\n      // so the handle is guaranteed to hold data here.\n      let handle: DocHandle<any>;\n      try {\n        handle = await this._repo.find(documentId);\n      } catch (err) {\n        log.error('failed to find document', { documentId, err });\n        continue;\n      }\n\n      const heads = handle.heads();\n      if (!heads) {\n        continue;\n      }\n      const batch = this._db.batch();\n      this._headsStore.setHeads(documentId, heads, batch);\n      await batch.write();\n    }\n    log('done re-indexing heads');\n  }\n\n  /**\n   * Share policy for the Repo's classical automerge-repo sync path (CollectionSynchronizer /\n   * DocSynchronizer — see `src/synchronizer/DocSynchronizer.ts#resolveSharePolicy`).\n   *\n   * NOTE: Subduction replication does NOT consult `shareConfig`.\n   * {@link AutomergeReplicator}s via {@link EchoNetworkAdapter}.\n   */\n  private readonly _shareConfig = {\n    access: async (_peerId: PeerId, _documentId?: DocumentId): Promise<boolean> => {\n      // Access-on-request is always allowed; per-doc authorization happens in the replicator.\n      return true;\n    },\n\n    // TODO(dmaretskyi): Share based on HALO permissions and space affinity.\n    // Hosts, running in the worker, don't share documents unless requested by other peers.\n    // NOTE: If both peers return sharePolicy=false the replication will not happen\n    // https://github.com/automerge/automerge-repo/pull/292\n    // Called for all loaded documents so they could be advertised to the sync server.\n    announce: async (peerId: PeerId, documentId?: DocumentId): Promise<boolean> => {\n      if (!documentId) {\n        return false;\n      }\n\n      if (OPTIMIZED_SHARE_POLICY) {\n        if (\n          !this._createdDocuments.has(documentId) &&\n          !this._documentsToSync.has(documentId) &&\n          !this._documentsToRequest.has(documentId)\n        ) {\n          // Skip advertising documents that don't need to be synced.\n          return false;\n        }\n      }\n\n      const peerMetadata = this._repo.peerMetadataByPeerId[peerId];\n      if (isEchoPeerMetadata(peerMetadata)) {\n        return this._echoNetworkAdapter.shouldAdvertise(peerId, { documentId });\n      }\n\n      return false;\n    },\n  };\n\n  /**\n   * Authorization policy consulted by the Subduction sedimentree protocol.\n   */\n  private readonly _subductionPolicy: SubductionPolicy = {\n    authorizeConnect: async (_peerId) => {},\n    authorizeFetch: async (_peerId, _sedimentreeId) => {},\n    authorizePut: async (_requestor, _author, _sedimentreeId) => {},\n    filterAuthorizedFetch: async (_peerId, sedimentreeIds) => sedimentreeIds,\n  };\n\n  private async _beforeSave({ path, batch }: BeforeSaveProps): Promise<void> {\n    const handle = this._repo.handles[path[0] as DocumentId];\n    if (!handle || getHandleState(this._repo, handle.documentId) !== 'ready') {\n      return;\n    }\n    const doc = handle.doc();\n    if (!doc) {\n      return;\n    }\n\n    const heads = getHeads(doc);\n    this._headsStore.setHeads(handle.documentId, heads, batch);\n  }\n\n  private _shouldSyncCollection(collectionId: string, peerId: PeerId): boolean {\n    // Under Subduction the Repo's `peerMetadataByPeerId` is not populated for peers that only\n    // speak Subduction (no classical peer message). Query the adapter directly — it maps\n    // peerId -> connection and the per-connection `shouldSyncCollection` gates the answer.\n    return this._echoNetworkAdapter.shouldSyncCollection(peerId, { collectionId });\n  }\n\n  /**\n   * Called by AutomergeStorageAdapter after levelDB batch commit.\n   */\n  private async _afterSave(path: StorageKey): Promise<void> {\n    if (!this.isOpen) {\n      return undefined;\n    }\n\n    const documentId = path[0] as DocumentId;\n    const handle = this._repo.handles[documentId];\n    if (!handle) {\n      return;\n    }\n    const document = handle.doc();\n    if (!document) {\n      return;\n    }\n\n    const heads = getHeads(document);\n    this._headsUpdates.set(documentId, heads);\n    invariant(this._onHeadsChangedTask, 'onHeadsChangedTask is not initialized');\n    this._onHeadsChangedTask.schedule();\n    this.documentsSaved.emit();\n  }\n\n  private async _isDocumentInRemoteCollection(params: RemoteDocumentExistenceCheckProps): Promise<boolean> {\n    for (const collectionId of this._collectionSynchronizer.getRegisteredCollectionIds()) {\n      const remoteCollections = this._collectionSynchronizer.getRemoteCollectionStates(collectionId);\n      const remotePeerDocs = remoteCollections.get(params.peerId as PeerId)?.documents;\n      if (remotePeerDocs && params.documentId in remotePeerDocs) {\n        return true;\n      }\n    }\n    return false;\n  }\n\n  private async _getContainingSpaceForDocument(documentId: string): Promise<PublicKey | null> {\n    // This runs inside share-policy resolution (see `MeshEchoReplicator.shouldAdvertise` ->\n    // `_shareConfig.announce` -> `DocSynchronizer.#resolveSharePolicy`). It must NOT block\n    // on the document becoming ready: under classical sync the network source's availability\n    // is itself gated on share policy returning, so awaiting `progress.whenReady()` here\n    // deadlocks the load (the document never transitions out of `'loading'`).\n    //\n    // Read the spaceKey iff the document is already loaded; otherwise let the share policy\n    // fall through to the `_getSpaceKeyByRootDocumentId` lookup or the\n    // `isDocumentInRemoteCollection` check on the caller.\n    const handle = this._repo.handles[documentId as any];\n    if (handle && getHandleState(this._repo, documentId as DocumentId) === 'ready') {\n      const doc = handle.doc();\n      if (doc) {\n        const spaceKeyHex = DatabaseDirectory.getSpaceKey(doc);\n        if (spaceKeyHex) {\n          return PublicKey.from(spaceKeyHex);\n        }\n      }\n    }\n\n    // Edge case on initial space setup: a peer may be sharing the space root document\n    // with us after a successful invitation, before our local handle has any data.\n    const rootDocSpaceKey = this._getSpaceKeyByRootDocumentId?.(documentId);\n    if (rootDocSpaceKey) {\n      return rootDocSpaceKey;\n    }\n\n    return null;\n  }\n\n  /**\n   * Flush documents to disk.\n   */\n  @trace.span({ showInBrowserTimeline: true, showInRemoteTracing: false })\n  async flush(ctx: Context, { documentIds }: FlushRequest = {}): Promise<void> {\n    const loadedDocuments = (documentIds ?? Object.keys(this._repo.handles)).filter(\n      (documentId): documentId is DocumentId => getHandleState(this._repo, documentId as DocumentId) === 'ready',\n    );\n    await this._repo.flush(loadedDocuments);\n\n    // Ensure that document versions have propagated across the system.\n    await this._onHeadsChangedTask?.runBlocking();\n  }\n\n  /**\n   * Returns current heads of each requested document.\n   *\n   * Loaded handles are read directly; unloaded documents fall back to the {@link HeadsStore},\n   * then to reconstruction from the automerge storage chunks (for docs persisted before\n   * the HeadsStore was populated).\n   */\n  async getHeads(documentIds: DocumentId[]): Promise<(Heads | undefined)[]> {\n    const result: (Heads | undefined)[] = [];\n    const storeRequestIds: DocumentId[] = [];\n    const storeResultIndices: number[] = [];\n    for (const documentId of documentIds) {\n      const handle = this._repo.handles[documentId];\n      if (handle && getHandleState(this._repo, documentId) === 'ready' && handle.doc()) {\n        result.push(getHeads(handle.doc()!));\n      } else {\n        storeRequestIds.push(documentId);\n        storeResultIndices.push(result.length);\n        result.push(undefined);\n      }\n    }\n    if (storeRequestIds.length > 0) {\n      const storedHeads = await this._headsStore.getHeads(storeRequestIds);\n      for (let i = 0; i < storedHeads.length; i++) {\n        result[storeResultIndices[i]] = storedHeads[i];\n      }\n    }\n    return result;\n  }\n\n  /**\n   * Iterate over all document heads stored on disk.\n   */\n  listDocumentHeads(): AsyncGenerator<{ documentId: DocumentId; heads: Heads }> {\n    return this._headsStore.iterateAll();\n  }\n\n  //\n  // Collection sync.\n  //\n\n  getLocalCollectionState(collectionId: string): CollectionState | undefined {\n    return this._collectionSynchronizer.getLocalCollectionState(collectionId);\n  }\n\n  getRemoteCollectionStates(collectionId: string): ReadonlyMap<PeerId, CollectionState> {\n    return this._collectionSynchronizer.getRemoteCollectionStates(collectionId);\n  }\n\n  refreshCollection(collectionId: string): void {\n    this._collectionSynchronizer.refreshCollection(collectionId);\n  }\n\n  async getCollectionSyncState(collectionId: string): Promise<SpaceSyncState> {\n    const result: SpaceSyncState = {\n      peers: [],\n    };\n\n    const localState = this.getLocalCollectionState(collectionId);\n    const remoteState = this.getRemoteCollectionStates(collectionId);\n\n    if (!localState) {\n      return result;\n    }\n\n    for (const [peerId, state] of remoteState) {\n      const diff = diffCollectionState(localState, state);\n      result.peers!.push({\n        peerId,\n        missingOnRemote: diff.missingOnRemote.length,\n        missingOnLocal: diff.missingOnLocal.length,\n        differentDocuments: diff.different.length,\n        localDocumentCount: Object.entries(localState.documents).filter(([_, heads]) => heads.length > 0).length,\n        remoteDocumentCount: Object.entries(state.documents).filter(([_, heads]) => heads.length > 0).length,\n        totalDocumentCount: new Set([...Object.keys(localState.documents), ...Object.keys(state.documents)]).size,\n        unsyncedDocumentCount: new Set([...diff.missingOnLocal, ...diff.missingOnRemote, ...diff.different]).size,\n      });\n    }\n\n    return result;\n  }\n\n  /**\n   * Update the local collection state based on the locally stored document heads.\n   */\n  async updateLocalCollectionState(collectionId: string, documentIds: DocumentId[]): Promise<void> {\n    const heads = await this.getHeads(documentIds);\n    const documents: Record<DocumentId, Heads> = Object.fromEntries(\n      heads.map((heads, index) => [documentIds[index], heads ?? []]),\n    );\n    this._collectionSynchronizer.setLocalCollectionState(collectionId, { documents });\n\n    // Proactively push our updated local state to peers that are interested in this collection.\n    // This reduces reliance on the next periodic query and prevents replication stalls in fast\n    // paths where the remote queries before our local state is ready.\n    const interestedPeers = this._echoNetworkAdapter.getPeersInterestedInCollection(collectionId);\n    if (interestedPeers.length > 0) {\n      for (const peerId of interestedPeers) {\n        this._sendCollectionState(collectionId, peerId, { documents });\n      }\n    }\n  }\n\n  async clearLocalCollectionState(collectionId: string): Promise<void> {\n    this._collectionSynchronizer.clearLocalCollectionState(collectionId);\n  }\n\n  private _onCollectionStateQueried(collectionId: string, peerId: PeerId): void {\n    this._collectionSynchronizer.onCollectionStateQueried(collectionId, peerId);\n  }\n\n  private _onCollectionStateReceived(collectionId: string, peerId: PeerId, state: unknown): void {\n    this._collectionSynchronizer.onRemoteStateReceived(collectionId, peerId, decodeCollectionState(state));\n  }\n\n  private _queryCollectionState(collectionId: string, peerId: PeerId): void {\n    this._echoNetworkAdapter.queryCollectionState(collectionId, peerId);\n  }\n\n  private _sendCollectionState(collectionId: string, peerId: PeerId, state: CollectionState): void {\n    this._echoNetworkAdapter.sendCollectionState(collectionId, peerId, encodeCollectionState(state));\n  }\n\n  private _onPeerConnected(peerId: PeerId): void {\n    this._collectionSynchronizer.onConnectionOpen(peerId);\n  }\n\n  private _onPeerDisconnected(peerId: PeerId): void {\n    this._collectionSynchronizer.onConnectionClosed(peerId);\n  }\n\n  private _onRemoteCollectionStateUpdated(collectionId: string, peerId: PeerId): void {\n    this._collectionsToSync.add({ collectionId, peerId });\n    this._syncTask?.schedule();\n  }\n\n  private async _handleCollectionSync(ctx: Context, collectionId: string, peerId: PeerId) {\n    const localState = this._collectionSynchronizer.getLocalCollectionState(collectionId);\n    const remoteState = this._collectionSynchronizer.getRemoteCollectionStates(collectionId).get(peerId);\n\n    if (!localState || !remoteState) {\n      return;\n    }\n\n    const { different, missingOnLocal, missingOnRemote } = diffCollectionState(localState, remoteState);\n\n    if (different.length === 0 && missingOnLocal.length === 0 && missingOnRemote.length === 0) {\n      return;\n    }\n\n    const toReplicateWithoutBatching = [...different];\n    const bundleSyncEnabled = this._echoNetworkAdapter.bundleSyncEnabledForPeer(peerId);\n    if (bundleSyncEnabled && missingOnRemote.length >= BUNDLE_SYNC_THRESHOLD) {\n      log('pushing bundle', { amount: missingOnRemote.length });\n      const { syncInteractively } = await this._pushInBundles(ctx, peerId, missingOnRemote);\n      toReplicateWithoutBatching.push(...syncInteractively);\n    } else {\n      log.verbose('failed to push bundle, replicating interactively', {\n        collectionId,\n        peerId,\n        amount: missingOnRemote.length,\n      });\n      toReplicateWithoutBatching.push(...missingOnRemote);\n    }\n    if (bundleSyncEnabled && missingOnLocal.length >= BUNDLE_SYNC_THRESHOLD) {\n      log('pulling bundle', { amount: missingOnLocal.length });\n      const { syncInteractively } = await this._pullInBundles(ctx, peerId, missingOnLocal);\n      toReplicateWithoutBatching.push(...syncInteractively);\n    } else {\n      log.verbose('failed to pull bundle, replicating interactively', {\n        collectionId,\n        peerId,\n        amount: missingOnLocal.length,\n      });\n      toReplicateWithoutBatching.push(...missingOnLocal);\n    }\n\n    if (toReplicateWithoutBatching.length === 0) {\n      return;\n    }\n\n    log('replicating documents after collection sync', {\n      collectionId,\n      peerId,\n      toReplicateWithoutBatching,\n      count: toReplicateWithoutBatching.length,\n    });\n\n    // Trigger replication of the missing documents. `findWithProgress` is the\n    // fire-and-forget trigger — it creates a DocHandle and attaches sources. Under classical\n    // sync this triggers automerge-repo's doc-synchronizer; under Subduction it registers a\n    // query for the sedimentreeId. Either way, once bytes arrive `_afterSave` populates\n    // `HeadsStore` so collection sync sees the updated heads on the next diff.\n    for (const documentId of toReplicateWithoutBatching) {\n      this._documentsToSync.add(documentId);\n      this._repo.findWithProgress(documentId as DocumentId);\n    }\n    if (!this._useSubduction) {\n      this._sharePolicyChangedTask!.schedule();\n    }\n  }\n\n  // TODO(mykola): Add retries of batches https://gist.github.com/mykola-vrmchk/fde270259e9209fcbf1331e5abbf12cf\n  private async _pushInBundles(\n    ctx: Context,\n    peerId: PeerId,\n    documentIds: DocumentId[],\n  ): Promise<{ syncInteractively: DocumentId[] }> {\n    const documentsToPush = [...documentIds];\n    const syncInteractively: DocumentId[] = [];\n\n    // Push bundles in parallel with BUNDLE_SYNC_CONCURRENCY max concurrent tasks.\n    while (documentsToPush.length > 0) {\n      await Promise.all(\n        range(BUNDLE_SYNC_CONCURRENCY).map(async () => {\n          const bundle = documentsToPush.splice(0, BUNDLE_SIZE);\n          if (bundle.length === 0) {\n            return;\n          }\n          await this._pushBundle(ctx, peerId, bundle).catch((err) => {\n            log.warn('failed to push bundle, replicating interactively', { peerId, bundle, err });\n            syncInteractively.push(...bundle);\n          });\n        }),\n      );\n    }\n\n    return { syncInteractively };\n  }\n\n  private async _pushBundle(ctx: Context, peerId: PeerId, documentIds: DocumentId[]): Promise<void> {\n    if (this._ctx.disposed) {\n      return;\n    }\n\n    const docs = documentIds.map((documentId) => {\n      if (getHandleState(this._repo, documentId) !== 'ready') {\n        log.warn('document not ready, skipping', { documentId });\n        return;\n      }\n      const handle = this._repo.handles[documentId];\n      const doc = handle.doc();\n      if (!doc) {\n        log.warn('document not available, skipping', { documentId });\n        return;\n      }\n      return {\n        documentId,\n        data: save(doc),\n        heads: getHeads(doc),\n      };\n    });\n\n    await this._echoNetworkAdapter.pushBundle(ctx, peerId, docs.filter(isNonNullable));\n  }\n\n  private async _pullInBundles(\n    ctx: Context,\n    peerId: PeerId,\n    documentIds: DocumentId[],\n  ): Promise<{ syncInteractively: DocumentId[] }> {\n    const documentsToPull = [...documentIds];\n    const syncInteractively: DocumentId[] = [];\n    const docsToImport: Record<DocumentId, Uint8Array> = {};\n\n    // Pull bundles in parallel with BUNDLE_SYNC_CONCURRENCY max concurrent tasks.\n    while (documentsToPull.length > 0) {\n      await Promise.all(\n        range(BUNDLE_SYNC_CONCURRENCY).map(async () => {\n          const bundle = documentsToPull.splice(0, BUNDLE_SIZE);\n          if (bundle.length === 0) {\n            return;\n          }\n          const result = await this._pullBundle(ctx, peerId, bundle).catch((err) => {\n            log.warn('failed to pull bundle, replicating interactively', { peerId, bundle, err });\n            syncInteractively.push(...bundle);\n          });\n          if (result) {\n            Object.assign(docsToImport, result.docsToImport);\n          }\n        }),\n      );\n    }\n\n    for (const [documentId, data] of Object.entries(docsToImport)) {\n      this._repo.import(data, { docId: documentId as DocumentId });\n    }\n    await this._repo.flush(Object.keys(docsToImport) as DocumentId[]);\n\n    return { syncInteractively };\n  }\n\n  private async _pullBundle(\n    ctx: Context,\n    peerId: PeerId,\n    documentIds: DocumentId[],\n  ): Promise<{ docsToImport: Record<DocumentId, Uint8Array> } | undefined> {\n    if (this._ctx.disposed) {\n      return;\n    }\n    // NOTE: We are expecting that documents that are being pulled are not present locally, so we are pulling all changes.\n    const docHeads = Object.fromEntries(documentIds.map((documentId) => [documentId, []]));\n    const bundle = await this._echoNetworkAdapter.pullBundle(ctx, peerId, docHeads);\n    return { docsToImport: bundle };\n  }\n\n  private _onHeadsChanged(docHeads: [DocumentId, Heads][]): void {\n    const collectionsChanged = new Set<CollectionId>();\n\n    for (const collectionId of this._collectionSynchronizer.getRegisteredCollectionIds()) {\n      const state = this._collectionSynchronizer.getLocalCollectionState(collectionId);\n      if (!state) {\n        continue;\n      }\n      let newState: CollectionState | undefined;\n\n      for (const [documentId, heads] of docHeads) {\n        if (documentId in state.documents) {\n          if (!newState) {\n            newState = structuredClone(state);\n          }\n          newState.documents[documentId] = heads;\n        }\n      }\n\n      if (newState) {\n        this._collectionSynchronizer.setLocalCollectionState(collectionId, newState);\n        collectionsChanged.add(collectionId as CollectionId);\n      }\n    }\n\n    for (const collectionId of collectionsChanged) {\n      this.collectionStateUpdated.emit({ collectionId });\n    }\n  }\n}\n\nconst waitForHeads = async (handle: DocHandle<DatabaseDirectory>, heads: Heads) => {\n  const unavailableHeads = new Set(heads);\n\n  // Check the current doc first, then subscribe to `change` to catch later\n  // updates. (We can't use `handle.whenReady()` to gate the subscription —\n  // see {@link getHandleState} for why `DocHandle.*` state is unusable in\n  // this fork.)\n  const checkPresentHeads = () => {\n    const doc = handle.doc();\n    if (!doc) {\n      return;\n    }\n    for (const changeHash of unavailableHeads.values()) {\n      if (changeIsPresentInDoc(doc, changeHash)) {\n        unavailableHeads.delete(changeHash);\n      }\n    }\n  };\n\n  checkPresentHeads();\n  if (unavailableHeads.size === 0) {\n    return;\n  }\n\n  await Event.wrap<DocHandleChangePayload<DatabaseDirectory>>(handle, 'change').waitForCondition(() => {\n    checkPresentHeads();\n    return unavailableHeads.size === 0;\n  });\n};\n\nconst changeIsPresentInDoc = (doc: Doc<any>, changeHash: string): boolean => {\n  return !!getBackend(doc).getChangeByHash(changeHash);\n};\n\nconst decodeCollectionState = (state: unknown): CollectionState => {\n  invariant(typeof state === 'object' && state !== null, 'Invalid state');\n\n  return state as CollectionState;\n};\n\nconst encodeCollectionState = (state: CollectionState): unknown => {\n  return state;\n};\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { next as A, type Heads } from '@automerge/automerge';\nimport type { DocumentId, PeerId } from '@automerge/automerge-repo';\nimport * as Array from 'effect/Array';\nimport * as Record from 'effect/Record';\n\nimport { Event, asyncReturn, scheduleTask, scheduleTaskInterval } from '@dxos/async';\nimport { type Context, Resource } from '@dxos/context';\nimport { log } from '@dxos/log';\nimport { trace } from '@dxos/tracing';\nimport { defaultMap } from '@dxos/util';\n\nconst MIN_QUERY_INTERVAL = 5_000;\n\nconst POLL_INTERVAL = 10_000;\n\nexport type CollectionSynchronizerProps = {\n  sendCollectionState: (collectionId: string, peerId: PeerId, state: CollectionState) => void;\n  queryCollectionState: (collectionId: string, peerId: PeerId) => void;\n  shouldSyncCollection: (collectionId: string, peerId: PeerId) => boolean;\n};\n\n/**\n * Implements collection sync protocol.\n */\n@trace.resource({ lifecycle: true })\nexport class CollectionSynchronizer extends Resource {\n  private readonly _sendCollectionState: CollectionSynchronizerProps['sendCollectionState'];\n  private readonly _queryCollectionState: CollectionSynchronizerProps['queryCollectionState'];\n  private readonly _shouldSyncCollection: CollectionSynchronizerProps['shouldSyncCollection'];\n\n  /**\n   * CollectionId -> State.\n   */\n  private readonly _perCollectionStates = new Map<string, PerCollectionState>();\n  private readonly _activeCollections = new Set<string>();\n\n  private readonly _connectedPeers = new Set<PeerId>();\n\n  public readonly remoteStateUpdated = new Event<{ collectionId: string; peerId: PeerId; newDocsAppeared: boolean }>();\n\n  constructor(params: CollectionSynchronizerProps) {\n    super();\n    this._sendCollectionState = params.sendCollectionState;\n    this._queryCollectionState = params.queryCollectionState;\n    this._shouldSyncCollection = params.shouldSyncCollection;\n  }\n\n  protected override async _open(ctx: Context): Promise<void> {\n    scheduleTaskInterval(\n      this._ctx,\n      async () => {\n        for (const collectionId of this._perCollectionStates.keys()) {\n          if (this._activeCollections.has(collectionId)) {\n            this.refreshCollection(collectionId);\n            await asyncReturn();\n          }\n        }\n      },\n      POLL_INTERVAL,\n    );\n  }\n\n  getRegisteredCollectionIds(): string[] {\n    return [...this._activeCollections];\n  }\n\n  getLocalCollectionState(collectionId: string): CollectionState | undefined {\n    return this._perCollectionStates.get(collectionId)?.localState;\n  }\n\n  setLocalCollectionState(collectionId: string, state: CollectionState): void {\n    this._activeCollections.add(collectionId);\n\n    log('setLocalCollectionState', { collectionId, state });\n    const perCollectionState = this._getOrCreatePerCollectionState(collectionId);\n    perCollectionState.localState = state;\n\n    for (const peerId of this._connectedPeers) {\n      this._diffCollectionState(collectionId, peerId);\n    }\n\n    this._scheduleBroadcast(collectionId);\n  }\n\n  /**\n   * Coalesce bursts of `setLocalCollectionState` (e.g. from `_onHeadsChanged` during an\n   * import) into one broadcast microtask per collection. If another call arrives while\n   * the microtask is pending, we just flag the collection dirty — the in-flight run\n   * already reads the latest `localState`. If it arrives during the run itself, we\n   * schedule exactly one follow-up.\n   */\n  private _scheduleBroadcast(collectionId: string): void {\n    const perCollectionState = this._getOrCreatePerCollectionState(collectionId);\n    queueMicrotask(() => {\n      this._refreshInterestedPeers(collectionId);\n      this._broadcastLocalState(collectionId);\n      this.refreshCollection(collectionId);\n    });\n  }\n\n  clearLocalCollectionState(collectionId: string): void {\n    this._activeCollections.delete(collectionId);\n    this._perCollectionStates.delete(collectionId);\n    log('clearLocalCollectionState', { collectionId });\n  }\n\n  getRemoteCollectionStates(collectionId: string): ReadonlyMap<PeerId, CollectionState> {\n    return this._getOrCreatePerCollectionState(collectionId).remoteStates;\n  }\n\n  refreshCollection(collectionId: string): void {\n    let scheduleAnotherRefresh = false;\n    const state = this._getOrCreatePerCollectionState(collectionId);\n    for (const peerId of this._connectedPeers) {\n      if (state.interestedPeers.has(peerId)) {\n        const lastQueried = state.lastQueried.get(peerId) ?? 0;\n        if (Date.now() - lastQueried > MIN_QUERY_INTERVAL) {\n          state.lastQueried.set(peerId, Date.now());\n          this._queryCollectionState(collectionId, peerId);\n        } else {\n          scheduleAnotherRefresh = true;\n        }\n      }\n    }\n    if (scheduleAnotherRefresh) {\n      scheduleTask(this._ctx, () => this.refreshCollection(collectionId), MIN_QUERY_INTERVAL);\n    }\n  }\n\n  /**\n   * Callback when a connection to a peer is established.\n   */\n  onConnectionOpen(peerId: PeerId): void {\n    log('onConnectionOpen', { peerId });\n    const spanId = getSpanId(peerId);\n    // Browser-timeline-only span; the derived ctx is intentionally discarded because\n    // the downstream `_queryCollectionState` hop is user-supplied callback land with\n    // no ctx plumbing.\n    void trace.spanStart({\n      id: spanId,\n      methodName: SYNC_SPAN_METHOD,\n      instance: this,\n      parentCtx: this._ctx,\n      showInBrowserTimeline: true,\n      attributes: { peerId },\n    });\n    this._connectedPeers.add(peerId);\n\n    queueMicrotask(async () => {\n      if (this._ctx.disposed) {\n        return;\n      }\n      for (const [collectionId, state] of this._perCollectionStates.entries()) {\n        if (this._activeCollections.has(collectionId) && this._shouldSyncCollection(collectionId, peerId)) {\n          state.interestedPeers.add(peerId);\n          state.lastQueried.set(peerId, Date.now());\n          this._queryCollectionState(collectionId, peerId);\n        }\n      }\n    });\n  }\n\n  /**\n   * Callback when a connection to a peer is closed.\n   */\n  onConnectionClosed(peerId: PeerId): void {\n    log('onConnectionClosed', { peerId });\n\n    this._connectedPeers.delete(peerId);\n\n    for (const perCollectionState of this._perCollectionStates.values()) {\n      perCollectionState.remoteStates.delete(peerId);\n    }\n  }\n\n  /**\n   * Callback when a peer queries the state of a collection.\n   *\n   * If we have no local state yet we silently drop the query; the peer will receive our\n   * state via {@link _broadcastLocalState} once `setLocalCollectionState` is called.\n   */\n  onCollectionStateQueried(collectionId: string, peerId: PeerId): void {\n    const perCollectionState = this._getOrCreatePerCollectionState(collectionId);\n\n    if (perCollectionState.localState) {\n      this._sendCollectionState(collectionId, peerId, perCollectionState.localState);\n    }\n  }\n\n  /**\n   * Callback when a peer sends the state of a collection.\n   */\n  onRemoteStateReceived(collectionId: string, peerId: PeerId, state: CollectionState): void {\n    log('onRemoteStateReceived', { collectionId, peerId, state });\n    validateCollectionState(state);\n    const perCollectionState = this._getOrCreatePerCollectionState(collectionId);\n    perCollectionState.remoteStates.set(peerId, state);\n    this._diffCollectionState(collectionId, peerId);\n  }\n\n  private _diffCollectionState(collectionId: string, peerId: PeerId) {\n    const perCollectionState = this._getOrCreatePerCollectionState(collectionId);\n    const remoteState = perCollectionState.remoteStates.get(peerId);\n    if (!remoteState) {\n      return;\n    }\n\n    log('diffCollectionState', { collectionId, peerId });\n    const localState = perCollectionState.localState ?? { documents: {} };\n    const diff = diffCollectionState(localState, remoteState);\n    const spanId = getSpanId(peerId);\n    if (diff.different.length === 0) {\n      trace.spanEnd(spanId);\n    } else {\n      // Browser-timeline-only span; see note in onConnectionOpen.\n      void trace.spanStart({\n        id: spanId,\n        methodName: SYNC_SPAN_METHOD,\n        instance: this,\n        parentCtx: this._ctx,\n        showInBrowserTimeline: true,\n        attributes: { peerId },\n      });\n    }\n    log('diff', {\n      localState: localState.documents,\n      remoteState: remoteState.documents,\n      missingOnLocal: diff.missingOnLocal,\n      missingOnRemote: diff.missingOnRemote,\n      different: diff.different,\n    });\n    if (diff.missingOnLocal.length > 0 || diff.different.length > 0 || diff.missingOnRemote.length > 0) {\n      log('emit remote state update');\n      this.remoteStateUpdated.emit({\n        peerId,\n        collectionId,\n        newDocsAppeared: diff.missingOnLocal.length > 0,\n      });\n    }\n  }\n\n  private _getOrCreatePerCollectionState(collectionId: string): PerCollectionState {\n    return defaultMap(this._perCollectionStates, collectionId, () => ({\n      localState: undefined,\n      remoteStates: new Map(),\n      interestedPeers: new Set(),\n      lastQueried: new Map(),\n      lastBroadcast: new Map(),\n    }));\n  }\n\n  /**\n   * Push local state to interested peers whose last-known remote state differs from local\n   * (or is unknown), then pull from peers via {@link refreshCollection}.\n   *\n   * Diff-gating avoids spamming peers that are already in sync; this matters because\n   * {@link setLocalCollectionState} is called on every local heads change.\n   */\n  private _broadcastLocalState(collectionId: string): void {\n    if (this._ctx.disposed || !this._activeCollections.has(collectionId)) {\n      return;\n    }\n    const perCollectionState = this._getOrCreatePerCollectionState(collectionId);\n    const localState = perCollectionState.localState;\n    if (!localState) {\n      return;\n    }\n    for (const peerId of perCollectionState.interestedPeers) {\n      const lastBroadcast = perCollectionState.lastBroadcast.get(peerId) ?? 0;\n      if (Date.now() - lastBroadcast > MIN_QUERY_INTERVAL) {\n        perCollectionState.lastBroadcast.set(peerId, Date.now());\n        this._sendCollectionState(collectionId, peerId, localState);\n      }\n    }\n  }\n\n  private _refreshInterestedPeers(collectionId: string): void {\n    for (const peerId of this._connectedPeers) {\n      if (this._shouldSyncCollection(collectionId, peerId)) {\n        this._getOrCreatePerCollectionState(collectionId).interestedPeers.add(peerId);\n      } else {\n        this._getOrCreatePerCollectionState(collectionId).interestedPeers.delete(peerId);\n      }\n    }\n  }\n}\n\ntype PerCollectionState = {\n  localState?: CollectionState;\n  remoteStates: Map<PeerId, CollectionState>;\n  interestedPeers: Set<PeerId>;\n  lastQueried: Map<PeerId, number>;\n  lastBroadcast: Map<PeerId, number>;\n};\n\nexport type CollectionState = {\n  /**\n   * DocumentId -> Heads.\n   */\n  documents: Record<DocumentId, Heads>;\n};\n\nexport type CollectionStateDiff = {\n  missingOnRemote: DocumentId[];\n  missingOnLocal: DocumentId[];\n  different: DocumentId[];\n};\n\nexport const diffCollectionState = (local: CollectionState, remote: CollectionState): CollectionStateDiff => {\n  const localDocuments = Record.filter(local.documents, (heads) => heads.length > 0);\n  const remoteDocuments = Record.filter(remote.documents, (heads) => heads.length > 0);\n  // NOTE: Using `Array.union` is slow.\n  const allDocuments = [...new Set([...Record.keys(localDocuments), ...Record.keys(remoteDocuments)])] as DocumentId[];\n\n  const missingOnRemote: DocumentId[] = [];\n  const missingOnLocal: DocumentId[] = [];\n  const different: DocumentId[] = [];\n  for (const documentId of allDocuments) {\n    if (!localDocuments[documentId]) {\n      missingOnLocal.push(documentId);\n    } else if (!remoteDocuments[documentId]) {\n      missingOnRemote.push(documentId);\n    } else if (!A.equals(local.documents[documentId], remote.documents[documentId])) {\n      different.push(documentId);\n    }\n  }\n\n  return {\n    missingOnRemote,\n    missingOnLocal,\n    different,\n  };\n};\n\nconst validateCollectionState = (state: CollectionState) => {\n  Object.entries(state.documents).forEach(([documentId, heads]) => {\n    if (!isValidDocumentId(documentId as DocumentId)) {\n      throw new Error(`Invalid documentId: ${documentId}`);\n    }\n    if (Array.isArray(heads) && heads.some((head) => typeof head !== 'string')) {\n      throw new Error(`Invalid heads: ${heads}`);\n    }\n  });\n};\n\nconst isValidDocumentId = (documentId: DocumentId) => {\n  return typeof documentId === 'string' && !documentId.includes(':');\n};\n\nconst SYNC_SPAN_METHOD = 'syncPeer';\n\nconst getSpanId = (peerId: PeerId) => {\n  return `collection-sync-${peerId}`;\n};\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport {\n  type DocumentId,\n  type Heads,\n  type Message,\n  NetworkAdapter,\n  type PeerId,\n  type PeerMetadata,\n} from '@automerge/automerge-repo';\n\nimport { Event, Trigger, synchronized } from '@dxos/async';\nimport { type Context, LifecycleState } from '@dxos/context';\nimport { invariant } from '@dxos/invariant';\nimport { type PublicKey } from '@dxos/keys';\nimport { log } from '@dxos/log';\nimport type { AutomergeProtocolMessage } from '@dxos/protocols';\nimport { isNonNullable } from '@dxos/util';\n\nimport { createIdFromSpaceKey } from '../common/space-id';\nimport {\n  type AutomergeReplicator,\n  type AutomergeReplicatorConnection,\n  type RemoteDocumentExistenceCheckProps,\n  type ShouldAdvertiseProps,\n  type ShouldSyncCollectionProps,\n} from './echo-replicator';\nimport {\n  type CollectionQueryMessage,\n  type CollectionStateMessage,\n  isCollectionQueryMessage,\n  isCollectionStateMessage,\n} from './network-protocol';\n\nexport interface NetworkDataMonitor {\n  recordPeerConnected(peerId: string): void;\n  recordPeerDisconnected(peerId: string): void;\n  recordMessageSent(message: Message, duration: number): void;\n  recordMessageReceived(message: Message): void;\n  recordMessageSendingFailed(message: Message): void;\n}\n\nexport type EchoNetworkAdapterProps = {\n  getContainingSpaceForDocument: (documentId: string) => Promise<PublicKey | null>;\n  isDocumentInRemoteCollection: (params: RemoteDocumentExistenceCheckProps) => Promise<boolean>;\n  onCollectionStateQueried: (collectionId: string, peerId: PeerId) => void;\n  onCollectionStateReceived: (collectionId: string, peerId: PeerId, state: unknown) => void;\n  monitor?: NetworkDataMonitor;\n};\n\ntype ConnectionEntry = {\n  isOpen: boolean;\n  connection: AutomergeReplicatorConnection;\n  reader: ReadableStreamDefaultReader<AutomergeProtocolMessage>;\n  writer: WritableStreamDefaultWriter<AutomergeProtocolMessage>;\n  requestedDocuments: Set<DocumentId>;\n};\n\n/**\n * Manages a set of {@link AutomergeReplicator} instances.\n */\nexport class EchoNetworkAdapter extends NetworkAdapter {\n  private readonly _replicators = new Set<AutomergeReplicator>();\n  /**\n   * Remote peer id -> connection.\n   */\n  private readonly _connections = new Map<PeerId, ConnectionEntry>();\n  private _lifecycleState: LifecycleState = LifecycleState.CLOSED;\n  private readonly _connected = new Trigger();\n  private readonly _ready = new Trigger();\n\n  public readonly documentRequested = new Event<{ documentId: DocumentId; peerId: PeerId }>();\n\n  constructor(private readonly _params: EchoNetworkAdapterProps) {\n    super();\n  }\n\n  override isReady(): boolean {\n    return this._lifecycleState === LifecycleState.OPEN;\n  }\n\n  override whenReady(): Promise<void> {\n    return this._ready.wait();\n  }\n\n  override connect(peerId: PeerId, peerMetadata?: PeerMetadata | undefined): void {\n    this.peerId = peerId;\n    this.peerMetadata = peerMetadata;\n    this._connected.wake();\n  }\n\n  override send(message: Message): void {\n    this._send(message);\n  }\n\n  override disconnect(): void {\n    // No-op\n  }\n\n  @synchronized\n  async open(): Promise<void> {\n    if (this._lifecycleState === LifecycleState.OPEN) {\n      return;\n    }\n    this._lifecycleState = LifecycleState.OPEN;\n    this._ready.wake();\n  }\n\n  @synchronized\n  async close(): Promise<this | undefined> {\n    if (this._lifecycleState === LifecycleState.CLOSED) {\n      return this;\n    }\n\n    for (const replicator of this._replicators) {\n      await replicator.disconnect();\n    }\n    this._replicators.clear();\n\n    this._ready.reset();\n    this._lifecycleState = LifecycleState.CLOSED;\n  }\n\n  async whenConnected(): Promise<void> {\n    await this._connected.wait({ timeout: 10_000 });\n  }\n\n  public onConnectionAuthScopeChanged(peer: PeerId): void {\n    const entry = this._connections.get(peer);\n    if (entry) {\n      this._onConnectionAuthScopeChanged(entry.connection);\n    }\n  }\n\n  @synchronized\n  async addReplicator(ctx: Context, replicator: AutomergeReplicator): Promise<void> {\n    invariant(this._lifecycleState === LifecycleState.OPEN);\n    invariant(this.peerId);\n    invariant(!this._replicators.has(replicator));\n\n    this._replicators.add(replicator);\n    await replicator.connect(ctx, {\n      peerId: this.peerId,\n      onConnectionOpen: this._onConnectionOpen.bind(this),\n      onConnectionClosed: this._onConnectionClosed.bind(this),\n      onConnectionAuthScopeChanged: this._onConnectionAuthScopeChanged.bind(this),\n      isDocumentInRemoteCollection: this._params.isDocumentInRemoteCollection,\n      getContainingSpaceForDocument: this._params.getContainingSpaceForDocument,\n      getContainingSpaceIdForDocument: async (documentId) => {\n        const key = await this._params.getContainingSpaceForDocument(documentId);\n        return key ? createIdFromSpaceKey(key) : null;\n      },\n    });\n  }\n\n  @synchronized\n  async removeReplicator(replicator: AutomergeReplicator): Promise<void> {\n    invariant(this._lifecycleState === LifecycleState.OPEN);\n    invariant(this._replicators.has(replicator));\n    await replicator.disconnect();\n    this._replicators.delete(replicator);\n  }\n\n  async shouldAdvertise(peerId: PeerId, params: ShouldAdvertiseProps): Promise<boolean> {\n    const connection = this._connections.get(peerId);\n    if (!connection) {\n      return false;\n    }\n\n    return connection.connection.shouldAdvertise(params);\n  }\n\n  shouldSyncCollection(peerId: PeerId, params: ShouldSyncCollectionProps): boolean {\n    const connection = this._connections.get(peerId);\n    if (!connection) {\n      return false;\n    }\n\n    return connection.connection.shouldSyncCollection(params);\n  }\n\n  queryCollectionState(collectionId: string, targetId: PeerId): void {\n    const message: CollectionQueryMessage = {\n      type: 'collection-query',\n      senderId: this.peerId as PeerId,\n      targetId,\n      collectionId,\n    };\n    this._send(message);\n  }\n\n  sendCollectionState(collectionId: string, targetId: PeerId, state: unknown): void {\n    const message: CollectionStateMessage = {\n      type: 'collection-state',\n      senderId: this.peerId as PeerId,\n      targetId,\n      collectionId,\n      state,\n    };\n    this._send(message);\n  }\n\n  // TODO(dmaretskyi): Remove.\n  getPeersInterestedInCollection(collectionId: string): PeerId[] {\n    return Array.from(this._connections.values())\n      .map((connection) => {\n        return connection.connection.shouldSyncCollection({ collectionId })\n          ? (connection.connection.peerId as PeerId)\n          : null;\n      })\n      .filter(isNonNullable);\n  }\n\n  bundleSyncEnabledForPeer(peerId: PeerId): boolean {\n    const connection = this._connections.get(peerId);\n    if (!connection) {\n      return false;\n    }\n    return connection.connection.bundleSyncEnabled;\n  }\n\n  async pushBundle(ctx: Context, peerId: PeerId, bundle: { documentId: DocumentId; data: Uint8Array; heads: Heads }[]) {\n    const connection = this._connections.get(peerId);\n    if (!connection) {\n      throw new Error('Connection not found.');\n    }\n    return connection.connection.pushBundle!(ctx, bundle);\n  }\n\n  async pullBundle(ctx: Context, peerId: PeerId, docHeads: Record<DocumentId, Heads>) {\n    const connection = this._connections.get(peerId);\n    if (!connection) {\n      throw new Error('Connection not found.');\n    }\n    return connection.connection.pullBundle!(ctx, docHeads);\n  }\n\n  private _send(message: Message): void {\n    const connectionEntry = this._connections.get(message.targetId);\n    if (!connectionEntry) {\n      throw new Error('Connection not found.');\n    }\n\n    // TODO(dmaretskyi): Find a way to enforce backpressure on AM-repo.\n    const start = Date.now();\n    connectionEntry.writer\n      .write(message as AutomergeProtocolMessage)\n      .then(() => {\n        this._params.monitor?.recordMessageSent(message, Date.now() - start);\n      })\n      .catch((err) => {\n        if (connectionEntry.isOpen) {\n          log.catch(err);\n        }\n\n        this._params.monitor?.recordMessageSendingFailed(message);\n      });\n  }\n\n  private _onConnectionOpen(connection: AutomergeReplicatorConnection): void {\n    log('connection opened', { peerId: connection.peerId });\n    invariant(!this._connections.has(connection.peerId as PeerId));\n    const connectionEntry: ConnectionEntry = {\n      isOpen: true,\n      connection,\n      reader: connection.readable.getReader(),\n      writer: connection.writable.getWriter(),\n      requestedDocuments: new Set(),\n    };\n\n    this._connections.set(connection.peerId as PeerId, connectionEntry);\n\n    // Read inbound messages.\n    queueMicrotask(async () => {\n      try {\n        while (true) {\n          // TODO(dmaretskyi): Find a way to enforce backpressure on AM-repo.\n          const { done, value } = await connectionEntry.reader.read();\n          if (done) {\n            break;\n          }\n\n          this._onMessage(connectionEntry, value as Message);\n        }\n      } catch (err) {\n        if (connectionEntry.isOpen) {\n          log.catch(err);\n        }\n      }\n    });\n\n    log('emit peer-candidate', { peerId: connection.peerId });\n    this._emitPeerCandidate(connection);\n    this._params.monitor?.recordPeerConnected(connection.peerId);\n  }\n\n  private _onMessage(connectionEntry: ConnectionEntry, message: Message): void {\n    const amMessage = message as AutomergeProtocolMessage;\n    if (amMessage.type === 'request') {\n      this.documentRequested.emit({\n        documentId: amMessage.documentId as DocumentId,\n        peerId: connectionEntry.connection.peerId as PeerId,\n      });\n    }\n\n    if (isCollectionQueryMessage(message)) {\n      this._params.onCollectionStateQueried(message.collectionId, message.senderId);\n    } else if (isCollectionStateMessage(message)) {\n      this._params.onCollectionStateReceived(message.collectionId, message.senderId, message.state);\n    } else {\n      this.emit('message', message);\n    }\n    this._params.monitor?.recordMessageReceived(message);\n  }\n\n  private _onConnectionClosed(connection: AutomergeReplicatorConnection): void {\n    log('connection closed', { peerId: connection.peerId });\n    const entry = this._connections.get(connection.peerId as PeerId);\n    invariant(entry);\n\n    entry.isOpen = false;\n    this.emit('peer-disconnected', { peerId: connection.peerId as PeerId });\n    this._params.monitor?.recordPeerDisconnected(connection.peerId);\n\n    void entry.writer.abort().catch((err) => log.catch(err));\n    void entry.reader.cancel().catch((err) => log.catch(err));\n\n    this._connections.delete(connection.peerId as PeerId);\n  }\n\n  /**\n   * Trigger doc-synchronizer shared documents set recalculation. Happens on peer-candidate.\n   * TODO(y): replace with a proper API call when sharePolicy update becomes supported by automerge-repo\n   */\n  private _onConnectionAuthScopeChanged(connection: AutomergeReplicatorConnection): void {\n    log('Connection auth scope changed', { peerId: connection.peerId });\n    const entry = this._connections.get(connection.peerId as PeerId);\n    invariant(entry);\n    this.emit('peer-disconnected', { peerId: connection.peerId as PeerId });\n    this._emitPeerCandidate(connection);\n  }\n\n  private _emitPeerCandidate(connection: AutomergeReplicatorConnection): void {\n    this.emit('peer-candidate', {\n      peerId: connection.peerId as PeerId,\n      peerMetadata: createEchoPeerMetadata(),\n    });\n  }\n}\n\nexport const createEchoPeerMetadata = (): PeerMetadata =>\n  ({\n    // TODO(dmaretskyi): Refactor this.\n    dxos_peerSource: 'EchoNetworkAdapter',\n  }) as any;\n\nexport const isEchoPeerMetadata = (metadata: PeerMetadata): boolean =>\n  (metadata as any)?.dxos_peerSource === 'EchoNetworkAdapter';\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport type { Message } from '@automerge/automerge-repo';\n\nimport {\n  type CollectionQueryMessage,\n  type CollectionStateMessage,\n  MESSAGE_TYPE_COLLECTION_QUERY,\n  MESSAGE_TYPE_COLLECTION_STATE,\n} from '@dxos/protocols';\n\nexport { type CollectionStateMessage, type CollectionQueryMessage };\n\nexport const isCollectionQueryMessage = (message: Message): message is CollectionQueryMessage =>\n  message.type === MESSAGE_TYPE_COLLECTION_QUERY;\n\nexport const isCollectionStateMessage = (message: Message): message is CollectionStateMessage =>\n  message.type === MESSAGE_TYPE_COLLECTION_STATE;\n", "//\n// Copyright 2026 DXOS.org\n//\n\nimport { type DocumentId, type QueryState, type Repo } from '@automerge/automerge-repo';\n\n/**\n * Variants reported by {@link QueryState}: `'loading' | 'ready' | 'unavailable' | 'failed'`.\n */\nexport type HandleQueryState = QueryState<unknown>['state'];\n\n/**\n * Returns the {@link QueryState} variant for a document already known to the\n * repo (i.e. one for which a handle has been registered via `Repo.find` /\n * `Repo.findWithProgress` / `Repo.create`), or `undefined` if no handle/query\n * exists for this document yet.\n *\n * Use this anywhere you need to ask \"is this document loaded?\" / \"did sync\n * give up?\" — read the result against the {@link HandleQueryState} variants\n * (e.g. `=== 'ready'`).\n *\n * # Why we can't just call `DocHandle.isReady()` / read `DocHandle.state`\n *\n * The current subduction fork of `@automerge/automerge-repo`\n * (`2.6.0-subduction.10`) **gutted** the per-handle state machine. Inside the\n * fork, every `DocHandle` state predicate is a constant placeholder:\n *\n * ```\n * isReady       = () => true\n * isUnloaded    = () => false\n * isDeleted     = () => false\n * isUnavailable = () => false\n * inState       = (states) => states.includes('ready')\n * get state     = () => 'ready'\n * whenReady     = async () => {}     // resolves immediately, ignores argument\n * ```\n *\n * That means `handle.isReady()` always lies \"yes\", `handle.state` always reads\n * `'ready'`, and `await handle.whenReady()` never blocks — even for handles\n * whose document has never been loaded from storage or synced from a peer.\n * Reading `handle.doc()` on such a \"ready\" handle returns the empty initial\n * doc (`A.init()` or `A.emptyChange(A.init())`) rather than throwing or\n * returning undefined, which can silently corrupt downstream logic that\n * trusted the handle's `isReady()` signal.\n *\n * Real liveness moved to the {@link DocumentQuery} returned by\n * `Repo.findWithProgress`, whose state goes through\n * `'loading' → 'ready' | 'unavailable' | 'failed'`. Production code that\n * needs to know whether a document is actually loaded must consult the query\n * state through this helper instead of any `DocHandle.*` predicate.\n *\n * TODO(mykola): Remove this helper once the fork either (a) restores the\n * `DocHandle` state machine, or (b) every caller is migrated to query\n * `DocumentProgress` directly with a richer API surface (await on state\n * transitions, etc.).\n */\nexport const getHandleState = (repo: Repo, documentId: DocumentId): HandleQueryState | undefined => {\n  if (!repo.handles[documentId]) {\n    return undefined;\n  }\n  return repo.findWithProgress(documentId).peek().state;\n};\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport type { Heads } from '@automerge/automerge';\nimport type { DocumentId } from '@automerge/automerge-repo';\nimport { type MixedEncoding } from 'level-transcoder';\n\nimport type { ProtoCodec } from '@dxos/codec-protobuf';\nimport type { BatchLevel, SublevelDB } from '@dxos/kv-store';\nimport { log } from '@dxos/log';\nimport { schema } from '@dxos/protocols/proto';\nimport type { Heads as HeadsProto } from '@dxos/protocols/proto/dxos/echo/query';\n\n// NOTE: Lazy so that code that doesn't use indexing doesn't need to load the codec (breaks in workerd).\nlet headsCodec: ProtoCodec<HeadsProto>;\nconst getHeadsCodec = () => (headsCodec ??= schema.getCodecForType('dxos.echo.query.Heads'));\n\nconst headsEncoding: MixedEncoding<Heads, Uint8Array, Heads> = {\n  encode: (value: Heads): Uint8Array => getHeadsCodec().encode({ hashes: value }),\n  decode: (encodedValue: Uint8Array): Heads => {\n    try {\n      return getHeadsCodec().decode(encodedValue).hashes!;\n    } catch {\n      // Legacy encoding migration path.\n      log.warn('Detected legacy encoding of heads in storage.');\n      const concatenatedHeads = Buffer.from(encodedValue).toString('utf8').replace(/\"/g, '');\n      const heads = [];\n      for (let i = 0; i < concatenatedHeads.length; i += 64) {\n        heads.push(concatenatedHeads.slice(i, i + 64));\n      }\n      return heads;\n    }\n  },\n  format: 'buffer',\n};\n\nexport type HeadsStoreProps = {\n  db: SublevelDB;\n};\n\nexport class HeadsStore {\n  private readonly _db: SublevelDB;\n\n  constructor({ db }: HeadsStoreProps) {\n    this._db = db;\n  }\n\n  setHeads(documentId: DocumentId, heads: Heads, batch: BatchLevel): void {\n    batch.put<DocumentId, Heads>(documentId, heads, {\n      sublevel: this._db,\n      keyEncoding: 'utf8',\n      valueEncoding: headsEncoding,\n    });\n  }\n\n  // TODO(dmaretskyi): Make batched.\n  async getHeads(documentIds: DocumentId[]): Promise<Array<Heads | undefined>> {\n    return this._db.getMany<DocumentId, Heads>(documentIds, {\n      keyEncoding: 'utf8',\n      valueEncoding: headsEncoding,\n    });\n  }\n\n  /**\n   * Iterate over all document IDs and their heads.\n   */\n  async *iterateAll(): AsyncGenerator<{ documentId: DocumentId; heads: Heads }> {\n    for await (const [documentId, heads] of this._db.iterator<DocumentId, Heads>({\n      keyEncoding: 'utf8',\n      valueEncoding: headsEncoding,\n    })) {\n      yield { documentId, heads };\n    }\n  }\n}\n", "//\n// Copyright 2024 DXOS.org\n// s\n\nimport { type Chunk, type StorageAdapterInterface, type StorageKey } from '@automerge/automerge-repo';\nimport { type MixedEncoding } from 'level-transcoder';\n\nimport { Resource } from '@dxos/context';\nimport { type BatchLevel, type SublevelDB } from '@dxos/kv-store';\nimport { type MaybePromise } from '@dxos/util';\n\nexport interface StorageAdapterDataMonitor {\n  recordBytesStored(count: number): void;\n  recordBytesLoaded(count: number): void;\n  recordLoadDuration(durationMs: number): void;\n  recordStoreDuration(durationMs: number): void;\n}\n\nexport type LevelDBStorageAdapterProps = {\n  db: SublevelDB;\n  callbacks?: StorageCallbacks;\n  monitor?: StorageAdapterDataMonitor;\n};\n\nexport type BeforeSaveProps = { path: StorageKey; batch: BatchLevel };\n\nexport interface StorageCallbacks {\n  beforeSave(params: BeforeSaveProps): MaybePromise<void>;\n  afterSave(path: StorageKey): MaybePromise<void>;\n}\n\nexport class LevelDBStorageAdapter extends Resource implements StorageAdapterInterface {\n  constructor(private readonly _params: LevelDBStorageAdapterProps) {\n    super();\n  }\n\n  async load(keyArray: StorageKey): Promise<Uint8Array | undefined> {\n    try {\n      if (!this.isOpen) {\n        // TODO(mykola): this should be an error.\n        return undefined;\n      }\n      const startMs = Date.now();\n      const chunk = await this._params.db.get<StorageKey, Uint8Array>(keyArray, { ...encodingOptions });\n      this._params.monitor?.recordBytesLoaded(chunk.byteLength);\n      this._params.monitor?.recordLoadDuration(Date.now() - startMs);\n      return chunk;\n    } catch (err: any) {\n      if (isLevelDbNotFoundError(err)) {\n        return undefined;\n      }\n      throw err;\n    }\n  }\n\n  async save(keyArray: StorageKey, binary: Uint8Array): Promise<void> {\n    if (!this.isOpen) {\n      return undefined;\n    }\n    const startMs = Date.now();\n    const batch = this._params.db.batch();\n\n    await this._params.callbacks?.beforeSave?.({ path: keyArray, batch });\n    batch.put<StorageKey, Uint8Array>(keyArray, Buffer.from(binary), {\n      ...encodingOptions,\n    });\n    await batch.write();\n    this._params.monitor?.recordBytesStored(binary.byteLength);\n\n    await this._params.callbacks?.afterSave?.(keyArray);\n    this._params.monitor?.recordStoreDuration(Date.now() - startMs);\n  }\n\n  /**\n   * Atomically persist multiple key/value entries in a single LevelDB batch write.\n   */\n  async saveBatch(entries: Array<[StorageKey, Uint8Array]>): Promise<void> {\n    if (!this.isOpen || entries.length === 0) {\n      return undefined;\n    }\n    const startMs = Date.now();\n    const batch = this._params.db.batch();\n\n    for (const [keyArray] of entries) {\n      await this._params.callbacks?.beforeSave?.({ path: keyArray, batch });\n    }\n    for (const [keyArray, binary] of entries) {\n      batch.put<StorageKey, Uint8Array>(keyArray, Buffer.from(binary), {\n        ...encodingOptions,\n      });\n    }\n    await batch.write();\n\n    let bytesStored = 0;\n    for (const [keyArray, binary] of entries) {\n      bytesStored += binary.byteLength;\n      await this._params.callbacks?.afterSave?.(keyArray);\n    }\n    this._params.monitor?.recordBytesStored(bytesStored);\n    this._params.monitor?.recordStoreDuration(Date.now() - startMs);\n  }\n\n  async remove(keyArray: StorageKey): Promise<void> {\n    if (!this.isOpen) {\n      return undefined;\n    }\n    await this._params.db.del<StorageKey>(keyArray, { ...encodingOptions });\n  }\n\n  async loadRange(keyPrefix: StorageKey): Promise<Chunk[]> {\n    if (!this.isOpen) {\n      return [];\n    }\n    const startMs = Date.now();\n    const result: Chunk[] = [];\n    for await (const [key, value] of this._params.db.iterator<StorageKey, Uint8Array>({\n      gte: keyPrefix,\n      lte: [...keyPrefix, '\\uffff'],\n      ...encodingOptions,\n    })) {\n      result.push({\n        key,\n        data: value,\n      });\n      this._params.monitor?.recordBytesLoaded(value.byteLength);\n    }\n    this._params.monitor?.recordLoadDuration(Date.now() - startMs);\n    return result;\n  }\n\n  async removeRange(keyPrefix: StorageKey): Promise<void> {\n    if (!this.isOpen) {\n      return undefined;\n    }\n    const batch = this._params.db.batch();\n\n    for await (const [key] of this._params.db.iterator<StorageKey, Uint8Array>({\n      gte: keyPrefix,\n      lte: [...keyPrefix, '\\uffff'],\n      ...encodingOptions,\n    })) {\n      batch.del<StorageKey>(key, { ...encodingOptions });\n    }\n    await batch.write();\n  }\n}\n\nconst keyEncoder: MixedEncoding<StorageKey, Uint8Array, StorageKey> = {\n  encode: (key: StorageKey): Uint8Array =>\n    Buffer.from(key.map((k) => k.replaceAll('%', '%25').replaceAll('-', '%2D')).join('-')),\n  decode: (key: Uint8Array): StorageKey =>\n    Buffer.from(key)\n      .toString()\n      .split('-')\n      .map((k) => k.replaceAll('%2D', '-').replaceAll('%25', '%')),\n  format: 'buffer',\n};\n\nexport const encodingOptions = {\n  keyEncoding: keyEncoder,\n  valueEncoding: 'buffer',\n};\n\nconst isLevelDbNotFoundError = (err: any): boolean => err.code === 'LEVEL_NOT_FOUND';\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { type Context } from '@dxos/context';\nimport type { CollectionId } from '@dxos/echo-protocol';\nimport { invariant } from '@dxos/invariant';\nimport { PublicKey, type SpaceId } from '@dxos/keys';\nimport { log } from '@dxos/log';\nimport type * as TeleportAutomergeReplicator from '@dxos/teleport-extension-automerge-replicator';\nimport { ComplexSet, defaultMap } from '@dxos/util';\n\nimport { createIdFromSpaceKey } from '../common/space-id';\nimport {\n  type AutomergeReplicator,\n  type AutomergeReplicatorContext,\n  type ShouldAdvertiseProps,\n} from './echo-replicator';\nimport { MeshReplicatorConnection } from './mesh-echo-replicator-connection';\nimport { getSpaceIdFromCollectionId } from './space-collection';\n\n// TODO(dmaretskyi): Move out of @dxos/echo-pipeline.\n\n/**\n * Used to replicate with other peers over the network.\n */\nexport class MeshEchoReplicator implements AutomergeReplicator {\n  /**\n   * We might have multiple connections open with a peer (one per space), but there'll be only one enabled\n   * connection at any given moment, because there's a single repo for all the spaces.\n   * When a connection closes (space was closed) it gets removed from the list and the next connection\n   * in the line gets enabled.\n   */\n  private readonly _connectionsPerPeer = new Map<string, MeshReplicatorConnection[]>();\n  /**\n   * A set of all connections (enabled and disabled).\n   */\n  private readonly _connections = new Set<MeshReplicatorConnection>();\n\n  /**\n   * spaceId -> deviceKey[]\n   */\n  private readonly _authorizedDevices = new Map<SpaceId, ComplexSet<PublicKey>>();\n\n  private _context: AutomergeReplicatorContext | null = null;\n\n  async connect(_ctx: Context, context: AutomergeReplicatorContext): Promise<void> {\n    this._context = context;\n  }\n\n  async disconnect(): Promise<void> {\n    for (const connection of this._connections) {\n      if (connection.isEnabled) {\n        this._context?.onConnectionClosed(connection);\n      }\n    }\n\n    for (const connection of this._connections) {\n      await connection.close();\n    }\n\n    this._connections.clear();\n    this._connectionsPerPeer.clear();\n\n    this._context = null;\n  }\n\n  createExtension(\n    extensionFactory?: TeleportAutomergeReplicator.AutomergeReplicatorFactory,\n  ): TeleportAutomergeReplicator.AutomergeReplicator {\n    invariant(this._context);\n\n    const connection: MeshReplicatorConnection = new MeshReplicatorConnection({\n      ownPeerId: this._context.peerId,\n      replicatorFactory: extensionFactory,\n      onRemoteConnected: async () => {\n        log('onRemoteConnected', { peerId: connection.peerId });\n        invariant(this._context);\n\n        const existingConnections = this._connectionsPerPeer.get(connection.peerId);\n        if (existingConnections?.length) {\n          const enabledConnection = existingConnections[0];\n          this._context.onConnectionAuthScopeChanged(enabledConnection);\n          existingConnections.push(connection);\n        } else {\n          this._connectionsPerPeer.set(connection.peerId, [connection]);\n          this._context.onConnectionOpen(connection);\n          connection.enable();\n        }\n      },\n      onRemoteDisconnected: async () => {\n        log('onRemoteDisconnected', { peerId: connection.peerId });\n\n        this._connections.delete(connection);\n\n        const existingConnections = this._connectionsPerPeer.get(connection.peerId) ?? [];\n\n        const index = existingConnections.indexOf(connection);\n        if (index < 0) {\n          log.warn('disconnected connection not found', { peerId: connection.peerId });\n          return;\n        }\n\n        existingConnections.splice(index, 1);\n\n        if (connection.isEnabled) {\n          this._context?.onConnectionClosed(connection);\n          connection.disable();\n\n          // Promote the next connection to enabled\n          if (existingConnections.length > 0) {\n            this._context?.onConnectionOpen(existingConnections[0]);\n            existingConnections[0].enable();\n          }\n        }\n      },\n      shouldAdvertise: async (params: ShouldAdvertiseProps) => {\n        log('shouldAdvertise', { peerId: connection.peerId, documentId: params.documentId });\n        invariant(this._context);\n        try {\n          const spaceKey = await this._context.getContainingSpaceForDocument(params.documentId);\n          if (!spaceKey) {\n            const remoteDocumentExists = await this._context.isDocumentInRemoteCollection({\n              documentId: params.documentId,\n              peerId: connection.peerId,\n            });\n            log('document not found locally for share policy check', {\n              peerId: connection.peerId,\n              documentId: params.documentId,\n              acceptDocument: remoteDocumentExists,\n            });\n\n            // If a document is not present locally return true if another peer claims to have it.\n            // Simply returning true will add the peer to \"generous peers list\" for this document which will\n            // start replication of the document after we receive, even if the peer is not in the corresponding space.\n            return remoteDocumentExists;\n          }\n\n          const spaceId = await createIdFromSpaceKey(spaceKey);\n\n          const authorizedDevices = this._authorizedDevices.get(spaceId);\n\n          if (!connection.remoteDeviceKey) {\n            log('device key not found for share policy check', {\n              peerId: connection.peerId,\n              documentId: params.documentId,\n            });\n            return false;\n          }\n\n          const isAuthorized = authorizedDevices?.has(connection.remoteDeviceKey) ?? false;\n          log('share policy check', {\n            localPeer: this._context.peerId,\n            remotePeer: connection.peerId,\n            documentId: params.documentId,\n            deviceKey: connection.remoteDeviceKey,\n            spaceKey,\n            isAuthorized,\n          });\n          return isAuthorized;\n        } catch (err) {\n          log.catch(err);\n          return false;\n        }\n      },\n      shouldSyncCollection: ({ collectionId }) => {\n        const spaceId = getSpaceIdFromCollectionId(collectionId as CollectionId);\n\n        const authorizedDevices = this._authorizedDevices.get(spaceId);\n\n        if (!connection.remoteDeviceKey) {\n          log('device key not found for collection sync check', {\n            peerId: connection.peerId,\n            collectionId,\n          });\n          return false;\n        }\n\n        const isAuthorized = authorizedDevices?.has(connection.remoteDeviceKey) ?? false;\n        return isAuthorized;\n      },\n    });\n    this._connections.add(connection);\n\n    return connection.replicatorExtension;\n  }\n\n  async authorizeDevice(spaceKey: PublicKey, deviceKey: PublicKey): Promise<void> {\n    log('authorizeDevice', { spaceKey, deviceKey });\n    const spaceId = await createIdFromSpaceKey(spaceKey);\n    defaultMap(this._authorizedDevices, spaceId, () => new ComplexSet(PublicKey.hash)).add(deviceKey);\n    for (const connection of this._connections) {\n      if (connection.isEnabled && connection.remoteDeviceKey && connection.remoteDeviceKey.equals(deviceKey)) {\n        if (this._connectionsPerPeer.has(connection.peerId)) {\n          this._context?.onConnectionAuthScopeChanged(connection);\n        }\n      }\n    }\n  }\n}\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport * as A from '@automerge/automerge';\nimport { cbor } from '@automerge/automerge-repo';\n\nimport { Resource } from '@dxos/context';\nimport { invariant } from '@dxos/invariant';\nimport { type PublicKey } from '@dxos/keys';\nimport { log } from '@dxos/log';\nimport type { AutomergeProtocolMessage } from '@dxos/protocols';\nimport { AutomergeReplicator, type AutomergeReplicatorFactory } from '@dxos/teleport-extension-automerge-replicator';\n\nimport type { AutomergeReplicatorConnection, ShouldAdvertiseProps, ShouldSyncCollectionProps } from './echo-replicator';\n\nconst DEFAULT_FACTORY: AutomergeReplicatorFactory = (params) => new AutomergeReplicator(...params);\n\nexport type MeshReplicatorConnectionProps = {\n  ownPeerId: string;\n  onRemoteConnected: () => void;\n  onRemoteDisconnected: () => void;\n  shouldAdvertise: (params: ShouldAdvertiseProps) => Promise<boolean>;\n  shouldSyncCollection: (params: ShouldSyncCollectionProps) => boolean;\n  replicatorFactory?: AutomergeReplicatorFactory;\n};\n\nexport class MeshReplicatorConnection extends Resource implements AutomergeReplicatorConnection {\n  public readable: ReadableStream<AutomergeProtocolMessage>;\n  public writable: WritableStream<AutomergeProtocolMessage>;\n  public remoteDeviceKey: PublicKey | null = null;\n\n  public readonly replicatorExtension: AutomergeReplicator;\n\n  private _remotePeerId: string | null = null;\n  private _isEnabled = false;\n\n  constructor(private readonly _params: MeshReplicatorConnectionProps) {\n    super();\n\n    let readableStreamController!: ReadableStreamDefaultController<AutomergeProtocolMessage>;\n    this.readable = new ReadableStream<AutomergeProtocolMessage>({\n      start: (controller) => {\n        readableStreamController = controller;\n        this._ctx.onDispose(() => controller.close());\n      },\n    });\n\n    this.writable = new WritableStream<AutomergeProtocolMessage>({\n      write: async (message: AutomergeProtocolMessage, controller) => {\n        invariant(this._isEnabled, 'Writing to a disabled connection');\n        try {\n          logSendSync(message);\n          await this.replicatorExtension.sendSyncMessage({ payload: cbor.encode(message) });\n        } catch (err) {\n          controller.error(err);\n          this._disconnectIfEnabled();\n        }\n      },\n    });\n\n    const createAutomergeReplicator = this._params.replicatorFactory ?? DEFAULT_FACTORY;\n    this.replicatorExtension = createAutomergeReplicator([\n      {\n        peerId: this._params.ownPeerId,\n      },\n      {\n        onStartReplication: async (info, remotePeerId /** Teleport ID */) => {\n          // Note: We store only one enabled extension per peer.\n          //       There can be a case where two connected peers have more than one teleport connection between them\n          //       and each of them uses different teleport connections to send messages.\n          //       It works because we receive messages from all teleport connections and Automerge Repo dedup them.\n          // TODO(mykola): Use only one teleport connection per peer.\n\n          this.remoteDeviceKey = remotePeerId;\n\n          // Set automerge id.\n          this._remotePeerId = info.id;\n\n          log('onStartReplication', { id: info.id, thisPeerId: this.peerId, remotePeerId: remotePeerId.toHex() });\n\n          this._params.onRemoteConnected();\n        },\n        onSyncMessage: async ({ payload }) => {\n          if (!this._isEnabled) {\n            return;\n          }\n          const message = cbor.decode(payload) as AutomergeProtocolMessage;\n          // Note: automerge Repo dedup messages.\n          readableStreamController.enqueue(message);\n        },\n        onClose: async () => {\n          this._disconnectIfEnabled();\n        },\n      },\n    ]);\n  }\n\n  private _disconnectIfEnabled(): void {\n    if (this._isEnabled) {\n      this._params.onRemoteDisconnected();\n    }\n  }\n\n  get peerId(): string {\n    invariant(this._remotePeerId != null, 'Remote peer has not connected yet.');\n    return this._remotePeerId;\n  }\n\n  get isEnabled() {\n    return this._isEnabled;\n  }\n\n  get bundleSyncEnabled(): boolean {\n    return false;\n  }\n\n  async shouldAdvertise(params: ShouldAdvertiseProps): Promise<boolean> {\n    return this._params.shouldAdvertise(params);\n  }\n\n  shouldSyncCollection(params: ShouldSyncCollectionProps): boolean {\n    return this._params.shouldSyncCollection(params);\n  }\n\n  /**\n   * Start exchanging messages with the remote peer.\n   * Call after the remote peer has connected.\n   */\n  enable(): void {\n    invariant(this._remotePeerId != null, 'Remote peer has not connected yet.');\n    this._isEnabled = true;\n  }\n\n  /**\n   * Stop exchanging messages with the remote peer.\n   */\n  disable(): void {\n    this._isEnabled = false;\n  }\n}\n\nconst logSendSync = (message: AutomergeProtocolMessage) => {\n  log('sendSyncMessage', () => {\n    const decodedSyncMessage = message.type === 'sync' && message.data ? A.decodeSyncMessage(message.data) : undefined;\n    return {\n      sync: decodedSyncMessage && {\n        headsLength: decodedSyncMessage.heads.length,\n        requesting: decodedSyncMessage.need.length > 0,\n        sendingChanges: decodedSyncMessage.changes.length > 0,\n      },\n      type: message.type,\n      from: message.senderId,\n      to: message.targetId,\n    };\n  });\n};\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { type DocumentId } from '@automerge/automerge-repo';\n\nimport type { CollectionId } from '@dxos/echo-protocol';\nimport { invariant } from '@dxos/invariant';\nimport { SpaceId } from '@dxos/keys';\n\nexport const deriveCollectionIdFromSpaceId = (spaceId: SpaceId, rootDocumentId?: DocumentId): CollectionId =>\n  (rootDocumentId ? `space:${spaceId}:${rootDocumentId}` : `space:${spaceId}`) as CollectionId;\n\nexport const getSpaceIdFromCollectionId = (collectionId: CollectionId): SpaceId => {\n  const spaceId = collectionId.split(':')[1];\n  invariant(SpaceId.isValid(spaceId));\n  return spaceId;\n};\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { type Message } from '@automerge/automerge-repo';\n\nimport { type TimeAware, trace } from '@dxos/tracing';\nimport { CircularBuffer, SlidingWindowSummary, type SlidingWindowSummaryConfig, mapValues } from '@dxos/util';\n\nimport { type NetworkDataMonitor } from './echo-network-adapter';\nimport { type StorageAdapterDataMonitor } from './leveldb-storage-adapter';\nimport { isCollectionQueryMessage, isCollectionStateMessage } from './network-protocol';\n\nconst PER_SECOND_RATE_AVG_WINDOW_SIZE = 5;\nconst DEFAULT_AVG_WINDOW_SIZE = 25;\n\nexport type EchoDataMonitorOptions = {\n  timeSeriesLength: number;\n};\n\n@trace.resource()\nexport class EchoDataMonitor implements StorageAdapterDataMonitor, NetworkDataMonitor, TimeAware {\n  private _lastTick = 0;\n\n  private _activeCounters = createLocalCounters();\n  private _lastCompleteCounters: LocalCounters | undefined;\n  private readonly _localTimeSeries = createLocalTimeSeries();\n  private readonly _storageAverages = createStorageAverages();\n  private readonly _replicationAverages = createNetworkAverages();\n  private readonly _sizeByMessage: { [type: string]: SlidingWindowSummary } = {};\n  private readonly _lastReceivedMessages = new CircularBuffer<StoredMessage>(100);\n  private readonly _lastSentMessages = new CircularBuffer<StoredMessage>(100);\n\n  private _connectionsCount = 0;\n\n  constructor(private readonly _params: EchoDataMonitorOptions = { timeSeriesLength: 30 }) {}\n\n  public tick(timeMs: number): void {\n    this._advanceTimeWindow(timeMs - this._lastTick);\n    this._lastTick = timeMs;\n  }\n\n  public computeStats(): EchoDataStats {\n    return {\n      meta: {\n        rateAverageOverSeconds: PER_SECOND_RATE_AVG_WINDOW_SIZE,\n      },\n      storage: {\n        reads: {\n          payloadSize: this._storageAverages.loadedChunkSize.average(),\n          opDuration: this._storageAverages.loadDuration.average(),\n          countPerSecond: this._storageAverages.loadsPerSecond.average(),\n        },\n        writes: {\n          payloadSize: this._storageAverages.storedChunkSize.average(),\n          opDuration: this._storageAverages.storeDuration.average(),\n          countPerSecond: this._storageAverages.storesPerSecond.average(),\n        },\n      },\n      replicator: {\n        connections: this._connectionsCount,\n        receivedMessages: {\n          payloadSize: this._replicationAverages.receivedMessageSize.average(),\n          countPerSecond: this._replicationAverages.receivedPerSecond.average(),\n        },\n        sentMessages: {\n          payloadSize: this._replicationAverages.sentMessageSize.average(),\n          opDuration: this._replicationAverages.sendDuration.average(),\n          countPerSecond: this._replicationAverages.sentPerSecond.average(),\n          failedPerSecond: this._replicationAverages.sendsFailedPerSecond.average(),\n        },\n        countByMessage: this._computeMessageHistogram('type'),\n        avgSizeByMessage: mapValues(this._sizeByMessage, (summary) => summary.average()),\n      },\n    };\n  }\n\n  public get connectionsCount() {\n    return this._connectionsCount;\n  }\n\n  /**\n   * @internal\n   */\n  get lastPerSecondStats() {\n    return this._lastCompleteCounters;\n  }\n\n  /**\n   * @internal\n   */\n  get timeSeries() {\n    return { ...this._localTimeSeries.storage, ...this._localTimeSeries.replication };\n  }\n\n  /**\n   * @internal\n   */\n  get messagesByPeerId() {\n    return this._computeMessageHistogram('peerId');\n  }\n\n  private _advanceTimeWindow(millisPassed: number): void {\n    const oldMetrics = Object.freeze(this._activeCounters);\n    this._activeCounters = createLocalCounters();\n    this._lastCompleteCounters = oldMetrics;\n    for (const peerId of Object.keys(oldMetrics.byPeerId)) {\n      this._activeCounters.byPeerId[peerId] = createMessageCounter();\n    }\n    this._addToTimeSeries(oldMetrics.replication, this._localTimeSeries.replication);\n    this._addToTimeSeries(oldMetrics.storage, this._localTimeSeries.storage);\n    // Prevent skewed measurements of incomplete buckets / after CPU freezes.\n    if (Math.abs(millisPassed - 1000) < 100) {\n      this._reportPerSecondRate(oldMetrics);\n    }\n  }\n\n  private _addToTimeSeries<T extends object>(values: T, timeSeries: TimeSeries<T>): void {\n    for (const [key, value] of Object.entries(values)) {\n      const values: (typeof value)[] = (timeSeries as any)[key];\n      values.push(value);\n      if (values.length > this._params.timeSeriesLength) {\n        values.shift();\n      }\n    }\n  }\n\n  private _reportPerSecondRate(metrics: LocalCounters): void {\n    const toReport: [string, number, SlidingWindowSummary][] = [\n      ['storage.load', metrics.storage.loadedChunks, this._storageAverages.loadsPerSecond],\n      ['storage.store', metrics.storage.storedChunks, this._storageAverages.storesPerSecond],\n      ['network.receive', metrics.replication.received, this._replicationAverages.receivedPerSecond],\n      ['network.send', metrics.replication.sent, this._replicationAverages.sentPerSecond],\n    ];\n    for (const [metricName, metric, summary] of toReport) {\n      summary.record(metric);\n      if (metric > 0) {\n        trace.metrics.distribution(`dxos.echo.${metricName}-rate`, metric);\n        trace.metrics.increment(`dxos.echo.${metricName}`, 1, { tags: { status: 'busy' } });\n      } else {\n        trace.metrics.increment(`dxos.echo.${metricName}`, 1, { tags: { status: 'idle' } });\n      }\n    }\n    this._replicationAverages.sendsFailedPerSecond.record(metrics.replication.failed);\n  }\n\n  public recordPeerConnected(peerId: string): void {\n    this._activeCounters.byPeerId[peerId] = createMessageCounter();\n    this._connectionsCount++;\n  }\n\n  public recordPeerDisconnected(peerId: string): void {\n    this._connectionsCount--;\n    delete this._activeCounters.byPeerId[peerId];\n  }\n\n  public recordBytesStored(count: number): void {\n    this._activeCounters.storage.storedChunks++;\n    this._activeCounters.storage.storedBytes += count;\n    this._storageAverages.storedChunkSize.record(count);\n    trace.metrics.distribution('dxos.echo.storage.bytes-stored', count, { unit: 'bytes' });\n  }\n\n  public recordLoadDuration(durationMs: number): void {\n    this._storageAverages.loadDuration.record(durationMs);\n  }\n\n  public recordStoreDuration(durationMs: number): void {\n    this._storageAverages.storeDuration.record(durationMs);\n  }\n\n  public recordBytesLoaded(count: number): void {\n    this._activeCounters.storage.loadedChunks++;\n    this._activeCounters.storage.loadedBytes += count;\n    this._storageAverages.loadedChunkSize.record(count);\n    trace.metrics.distribution('dxos.echo.storage.bytes-loaded', count, { unit: 'bytes' });\n  }\n\n  public recordMessageSent(message: Message, duration: number): void {\n    let metricsGroupName;\n    const bytes = getByteCount(message);\n    const tags = { type: message.type };\n    if (isAutomergeProtocolMessage(message)) {\n      this._activeCounters.replication.sent++;\n      this._replicationAverages.sendDuration.record(duration);\n      this._replicationAverages.sentMessageSize.record(bytes);\n      metricsGroupName = 'replication';\n    } else {\n      metricsGroupName = 'collection-sync';\n    }\n    trace.metrics.distribution(`dxos.echo.${metricsGroupName}.bytes-sent`, bytes, { unit: 'bytes', tags });\n    trace.metrics.distribution(`dxos.echo.${metricsGroupName}.send-duration`, duration, { unit: 'millisecond', tags });\n    trace.metrics.increment(`dxos.echo.${metricsGroupName}.send-status`, 1, { tags: { ...tags, success: true } });\n    const { messageSize, messageCounts } = this._getStatsForType(message);\n    messageSize.record(bytes);\n    messageCounts.sent++;\n    this._lastSentMessages.push({ type: message.type, peerId: message.targetId });\n  }\n\n  public recordMessageReceived(message: Message): void {\n    const bytes = getByteCount(message);\n    const tags = { type: message.type };\n    if (isAutomergeProtocolMessage(message)) {\n      this._activeCounters.replication.received++;\n      this._replicationAverages.receivedMessageSize.record(bytes);\n      trace.metrics.distribution('dxos.echo.replication.bytes-received', bytes, { unit: 'bytes', tags });\n    } else {\n      trace.metrics.distribution('dxos.echo.collection-sync.bytes-received', bytes, { unit: 'bytes', tags });\n    }\n    const { messageSize, messageCounts } = this._getStatsForType(message);\n    messageSize.record(bytes);\n    messageCounts.received++;\n    this._lastReceivedMessages.push({ type: message.type, peerId: message.senderId });\n  }\n\n  public recordMessageSendingFailed(message: Message): void {\n    const tags = { type: message.type, success: false };\n    if (isAutomergeProtocolMessage(message)) {\n      this._activeCounters.replication.failed++;\n      trace.metrics.increment('dxos.echo.replication.send-status', 1, { unit: 'bytes', tags });\n    } else {\n      trace.metrics.increment('dxos.echo.collection-sync.send-status', 1, { unit: 'bytes', tags });\n    }\n    const { messageCounts } = this._getStatsForType(message);\n    messageCounts.failed++;\n  }\n\n  private _getStatsForType(message: Message): { messageCounts: MessageCounts; messageSize: SlidingWindowSummary } {\n    const messageSize = (this._sizeByMessage[message.type] ??= createSlidingWindow());\n    const messageCounts = (this._activeCounters.byType[message.type] ??= createMessageCounter());\n    return { messageCounts, messageSize };\n  }\n\n  private _computeMessageHistogram(groupKey: keyof StoredMessage): MessageAttributeHistogram {\n    const result: MessageAttributeHistogram = {};\n    for (const receivedMessage of this._lastReceivedMessages) {\n      const counters = (result[receivedMessage[groupKey]] ??= { received: 0, sent: 0 });\n      counters.received++;\n    }\n    for (const receivedMessage of this._lastSentMessages) {\n      const counters = (result[receivedMessage[groupKey]] ??= { received: 0, sent: 0 });\n      counters.sent++;\n    }\n    return result;\n  }\n}\n\ntype BaseDataOpStats = {\n  payloadSize: number;\n  countPerSecond: number;\n};\n\nexport type TimedDataOpStats = BaseDataOpStats & { opDuration: number };\n\ntype TimeSeries<T extends object> = { [key in keyof T]: T[key][] };\n\ntype StorageCounts = {\n  storedChunks: number;\n  storedBytes: number;\n  loadedChunks: number;\n  loadedBytes: number;\n};\ntype StorageCountTimeSeries = TimeSeries<StorageCounts>;\n\ntype MessageCounts = {\n  sent: number;\n  received: number;\n  failed: number;\n};\ntype MessageCountTimeSeries = TimeSeries<MessageCounts>;\n\ntype MessageAttributeHistogram = {\n  [Message: string]: {\n    received: number;\n    sent: number;\n  };\n};\n\nexport type EchoDataStats = {\n  meta: {\n    rateAverageOverSeconds: number;\n  };\n  storage: {\n    reads: TimedDataOpStats;\n    writes: TimedDataOpStats;\n  };\n  replicator: {\n    connections: number;\n    receivedMessages: BaseDataOpStats;\n    sentMessages: TimedDataOpStats & { failedPerSecond: number };\n    avgSizeByMessage: { [Message: string]: number };\n    countByMessage: MessageAttributeHistogram;\n  };\n};\n\ntype StoredMessage = { type: string; peerId: string };\n\ntype StorageAverages = {\n  storedChunkSize: SlidingWindowSummary;\n  storesPerSecond: SlidingWindowSummary;\n  loadedChunkSize: SlidingWindowSummary;\n  loadsPerSecond: SlidingWindowSummary;\n  loadDuration: SlidingWindowSummary;\n  storeDuration: SlidingWindowSummary;\n};\n\n// TODO(burdon): Standardize: `sent`/`recv`.\ntype NetworkAverages = {\n  receivedMessageSize: SlidingWindowSummary;\n  receivedPerSecond: SlidingWindowSummary;\n  sentMessageSize: SlidingWindowSummary;\n  sentPerSecond: SlidingWindowSummary;\n  sendDuration: SlidingWindowSummary;\n  sendsFailedPerSecond: SlidingWindowSummary;\n};\n\ntype LocalCounters = {\n  storage: StorageCounts;\n  replication: MessageCounts;\n  byPeerId: { [peerId: string]: MessageCounts };\n  byType: { [type: string]: MessageCounts };\n};\n\ntype LocalTimeSeries = {\n  storage: StorageCountTimeSeries;\n  replication: MessageCountTimeSeries;\n};\n\nconst isAutomergeProtocolMessage = (message: Message) => {\n  return !(isCollectionQueryMessage(message) || isCollectionStateMessage(message));\n};\n\nconst createSlidingWindow = (overrides?: SlidingWindowSummaryConfig) =>\n  new SlidingWindowSummary({ dataPoints: DEFAULT_AVG_WINDOW_SIZE, precision: 2, ...overrides });\n\nconst createLocalCounters = (): LocalCounters => ({\n  storage: { loadedBytes: 0, storedBytes: 0, storedChunks: 0, loadedChunks: 0 },\n  replication: createMessageCounter(),\n  byPeerId: {},\n  byType: {},\n});\n\nconst createLocalTimeSeries = (): LocalTimeSeries => ({\n  storage: { loadedBytes: [], storedBytes: [], storedChunks: [], loadedChunks: [] },\n  replication: { sent: [], failed: [], received: [] },\n});\n\nconst createMessageCounter = (): MessageCounts => ({ sent: 0, received: 0, failed: 0 });\n\nconst createNetworkAverages = (): NetworkAverages => ({\n  receivedMessageSize: createSlidingWindow(),\n  sentMessageSize: createSlidingWindow(),\n  sendDuration: createSlidingWindow(),\n  receivedPerSecond: createSlidingWindow({ dataPoints: PER_SECOND_RATE_AVG_WINDOW_SIZE }),\n  sentPerSecond: createSlidingWindow({ dataPoints: PER_SECOND_RATE_AVG_WINDOW_SIZE }),\n  sendsFailedPerSecond: createSlidingWindow({ dataPoints: PER_SECOND_RATE_AVG_WINDOW_SIZE }),\n});\n\nconst createStorageAverages = (): StorageAverages => ({\n  storedChunkSize: createSlidingWindow(),\n  loadedChunkSize: createSlidingWindow(),\n  loadDuration: createSlidingWindow(),\n  storeDuration: createSlidingWindow(),\n  loadsPerSecond: createSlidingWindow({ dataPoints: PER_SECOND_RATE_AVG_WINDOW_SIZE }),\n  storesPerSecond: createSlidingWindow({ dataPoints: PER_SECOND_RATE_AVG_WINDOW_SIZE }),\n});\n\nconst getByteCount = (message: Message): number => {\n  return (\n    message.type.length +\n    message.senderId.length +\n    message.targetId.length +\n    (message.data?.byteLength ?? 0) +\n    (message.documentId?.length ?? 0)\n  );\n};\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { next as A, type Heads } from '@automerge/automerge';\nimport { type DocumentId, type DocumentQuery } from '@automerge/automerge-repo';\n\nimport { UpdateScheduler } from '@dxos/async';\nimport { Context, LifecycleState, Resource } from '@dxos/context';\nimport { type DatabaseDirectory } from '@dxos/echo-protocol';\nimport { invariant } from '@dxos/invariant';\nimport { log } from '@dxos/log';\nimport { type BatchedDocumentUpdates, type DocumentUpdate } from '@dxos/protocols/proto/dxos/echo/service';\nimport { retry } from '@dxos/util';\n\nimport type { AutomergeHost } from '../automerge';\n\nconst MAX_UPDATE_FREQ = 10; // [updates/sec]\n\nexport type DocumentsSynchronizerProps = {\n  automergeHost: AutomergeHost;\n  sendUpdates: (updates: BatchedDocumentUpdates) => void;\n};\n\ninterface DocSyncState {\n  docQuery: DocumentQuery<DatabaseDirectory>;\n  lastSentHead?: Heads;\n  clearSubscriptions?: () => void;\n}\n\nconst WRAP_AROUND_RETRY_LIMIT = 3;\nconst WRAP_AROUND_RETRY_INITIAL_DELAY = 100; // [ms]\n\n/**\n * Manages a connection and replication between worker's Automerge Repo and the client's Repo.\n */\nexport class DocumentsSynchronizer extends Resource {\n  private readonly _syncStates = new Map<DocumentId, DocSyncState>();\n  /**\n   * Documents that have pending updates.\n   * Used to batch updates.\n   */\n  private readonly _pendingUpdates = new Set<DocumentId>();\n\n  /**\n   * Job that schedules if there are pending updates.\n   */\n  private _sendUpdatesJob?: UpdateScheduler = undefined;\n\n  constructor(private readonly _params: DocumentsSynchronizerProps) {\n    super();\n  }\n\n  async addDocuments(documentIds: DocumentId[]): Promise<void> {\n    await Promise.all(\n      documentIds.map(async (documentId) => {\n        try {\n          await retry(\n            { count: WRAP_AROUND_RETRY_LIMIT, delayMs: WRAP_AROUND_RETRY_INITIAL_DELAY, exponent: 2 },\n            async () => {\n              try {\n                log('loading document', { documentId });\n                const docQuery = this._params.automergeHost.findWithProgress<DatabaseDirectory>(\n                  documentId as DocumentId,\n                );\n                this._startSync(docQuery);\n                this._pendingUpdates.add(docQuery.documentId);\n                this._sendUpdatesJob!.trigger();\n              } catch (err) {\n                log.warn('failed to load document', { err });\n                throw err;\n              }\n            },\n          );\n        } catch (err) {\n          log.catch(err);\n        }\n      }),\n    );\n  }\n\n  removeDocuments(documentIds: DocumentId[]): void {\n    for (const documentId of documentIds) {\n      this._syncStates.get(documentId)?.clearSubscriptions?.();\n      this._syncStates.delete(documentId);\n      this._pendingUpdates.delete(documentId);\n    }\n  }\n\n  protected override async _open(): Promise<void> {\n    this._sendUpdatesJob = new UpdateScheduler(this._ctx, this._checkAndSendUpdates.bind(this), {\n      maxFrequency: MAX_UPDATE_FREQ,\n    });\n  }\n\n  protected override async _close(): Promise<void> {\n    await this._sendUpdatesJob!.join();\n    this._syncStates.clear();\n  }\n\n  async update(ctx: Context, updates: DocumentUpdate[]): Promise<void> {\n    for (const { documentId, mutation } of updates) {\n      await this._writeMutation(documentId as DocumentId, mutation);\n    }\n    // TODO(mykola): This should not be required.\n    await this._params.automergeHost.flush(ctx, {\n      documentIds: updates.map(({ documentId }) => documentId as DocumentId),\n    });\n  }\n\n  private _startSync(docQuery: DocumentQuery<DatabaseDirectory>) {\n    if (this._syncStates.has(docQuery.documentId)) {\n      log('Document already being synced', { documentId: docQuery.documentId });\n      return;\n    }\n\n    const syncState: DocSyncState = { docQuery };\n    this._subscribeForChanges(syncState);\n    this._syncStates.set(docQuery.documentId, syncState);\n    return syncState;\n  }\n\n  _subscribeForChanges(syncState: DocSyncState): void {\n    const handler = () => {\n      this._pendingUpdates.add(syncState.docQuery.documentId);\n      this._sendUpdatesJob!.trigger();\n    };\n    syncState.docQuery.handle.on('heads-changed', handler);\n    syncState.clearSubscriptions = () => syncState.docQuery.handle.off('heads-changed', handler);\n  }\n\n  private async _checkAndSendUpdates(): Promise<void> {\n    const updates: DocumentUpdate[] = [];\n\n    const docsWithPendingUpdates = Array.from(this._pendingUpdates);\n    this._pendingUpdates.clear();\n\n    for (const documentId of docsWithPendingUpdates) {\n      const update = this._getPendingChanges(documentId);\n      if (update) {\n        updates.push({\n          documentId,\n          mutation: update,\n        });\n      }\n    }\n\n    if (updates.length > 0) {\n      this._params.sendUpdates({ updates });\n    }\n  }\n\n  private _getPendingChanges(documentId: DocumentId): Uint8Array | void {\n    const syncState = this._syncStates.get(documentId);\n    invariant(syncState, 'Sync state for document not found');\n    const handle = syncState.docQuery.handle;\n    if (!handle || syncState.docQuery.peek().state !== 'ready') {\n      return;\n    }\n    const doc = handle.doc();\n    if (!doc) {\n      return;\n    }\n    const mutation = syncState.lastSentHead ? A.saveSince(doc, syncState.lastSentHead) : A.save(doc);\n    if (mutation.length === 0) {\n      return;\n    }\n    syncState.lastSentHead = A.getHeads(doc);\n    return mutation;\n  }\n\n  private async _writeMutation(documentId: DocumentId, mutation: Uint8Array): Promise<void> {\n    if (this._lifecycleState === LifecycleState.CLOSED) {\n      return;\n    }\n    log('write mutation', { documentId });\n\n    const syncState = this._syncStates.get(documentId);\n    invariant(syncState, 'Sync state for document not found');\n    const headsBefore = A.getHeads(syncState.docQuery.handle.doc());\n    // This will update corresponding handle in the repo.\n    await this._params.automergeHost.createDoc(mutation, { documentId, preserveHistory: true });\n\n    if (A.equals(headsBefore, syncState.lastSentHead)) {\n      // No new mutations were discovered on network, so we do not need to send updates from worker to client.\n      syncState.lastSentHead = A.getHeads(syncState.docQuery.handle.doc());\n    }\n  }\n}\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { type AnyDocumentId, type AutomergeUrl, type DocHandle, type DocumentId } from '@automerge/automerge-repo';\nimport * as SqlClient from '@effect/sql/SqlClient';\nimport * as Effect from 'effect/Effect';\n\nimport { asyncTimeout, DeferredTask, sleep } from '@dxos/async';\nimport { Context, LifecycleState, Resource } from '@dxos/context';\nimport { todo } from '@dxos/debug';\nimport { type DatabaseDirectory, SpaceDocVersion, createIdFromSpaceKey } from '@dxos/echo-protocol';\nimport { RuntimeProvider } from '@dxos/effect';\nimport { FeedStore } from '@dxos/feed';\nimport { IndexEngine, type IndexingResult } from '@dxos/index-core';\nimport { invariant } from '@dxos/invariant';\nimport { type ObjectId, type PublicKey, type SpaceId } from '@dxos/keys';\nimport { type LevelDB } from '@dxos/kv-store';\nimport { log } from '@dxos/log';\nimport { type FeedProtocol } from '@dxos/protocols';\nimport type { SyncQueueRequest } from '@dxos/protocols/proto/dxos/client/services';\nimport type * as SqlTransaction from '@dxos/sql-sqlite/SqlTransaction';\nimport { trace } from '@dxos/tracing';\n\nimport {\n  AutomergeHost,\n  type AutomergeReplicator,\n  type CreateDocOptions,\n  EchoDataMonitor,\n  type EchoDataStats,\n  type LoadDocOptions,\n  type PeerIdProvider,\n  type RootDocumentSpaceKeyProvider,\n  deriveCollectionIdFromSpaceId,\n} from '../automerge';\nimport { AutomergeDataSource } from './automerge-data-source';\nimport { DataServiceImpl } from './data-service';\nimport { type DatabaseRoot } from './database-root';\nimport { hintFromIndexingResult } from './invalidation-hint';\nimport { LocalQueueServiceImpl } from './local-queue-service';\nimport { QueryServiceImpl } from './query-service';\nimport { QueueDataSource } from './queue-data-source';\nimport { SpaceStateManager } from './space-state-manager';\n\n/**\n * Executes \"PRAGMA quick_check;\" on SQLite database on startup.\n *\n * NOTE: Keep DISABLED in production, \"quick\" check is O(dbSize) which took 6 seconds for my relatively-small profile.\n *\n */\nconst RUN_SQLITE_QUICK_CHECK_ON_STARTUP = false;\n\nexport type EchoHostProps = {\n  kv: LevelDB;\n  peerIdProvider?: PeerIdProvider;\n  getSpaceKeyByRootDocumentId?: RootDocumentSpaceKeyProvider;\n\n  runtime: RuntimeProvider.RuntimeProvider<SqlClient.SqlClient | SqlTransaction.SqlTransaction>;\n\n  /**\n   * This peer is allowed to assign positions (global-order) to items appended to the queue.\n   * @default false\n   */\n  assignQueuePositions?: boolean;\n\n  /**\n   * Callback to run blocking queue sync.\n   */\n  syncQueue?: (ctx: Context, request: SyncQueueRequest) => Promise<void>;\n\n  /**\n   * Enable Subduction sedimentree transport for Automerge document replication.\n   * @default false\n   */\n  useSubduction?: boolean;\n};\n\n/**\n * Host for the Echo database.\n * Manages multiple spaces.\n * Stores data to disk.\n * Can sync with pluggable data replicators.\n */\nexport class EchoHost extends Resource {\n  private readonly _automergeHost: AutomergeHost;\n  private readonly _queryService: QueryServiceImpl;\n  private readonly _dataService: DataServiceImpl;\n  private readonly _spaceStateManager = new SpaceStateManager();\n  private readonly _echoDataMonitor: EchoDataMonitor;\n\n  private readonly _automergeDataSource: AutomergeDataSource;\n  private readonly _indexEngine: IndexEngine;\n  private readonly _runtime: RuntimeProvider.RuntimeProvider<SqlClient.SqlClient | SqlTransaction.SqlTransaction>;\n  private readonly _feedStore: FeedStore;\n  private readonly _queueDataSource: QueueDataSource;\n\n  private _updateIndexes!: DeferredTask;\n\n  private _queuesService: FeedProtocol.QueueService;\n\n  private _indexesUpToDate = false;\n\n  constructor({\n    kv,\n    peerIdProvider,\n    getSpaceKeyByRootDocumentId,\n    runtime,\n    assignQueuePositions = false,\n    syncQueue,\n    useSubduction,\n  }: EchoHostProps) {\n    super();\n\n    this._echoDataMonitor = new EchoDataMonitor();\n    this._automergeHost = new AutomergeHost({\n      db: kv,\n      dataMonitor: this._echoDataMonitor,\n      peerIdProvider,\n      getSpaceKeyByRootDocumentId,\n      useSubduction,\n    });\n\n    this._runtime = runtime;\n    this._automergeDataSource = new AutomergeDataSource(this._automergeHost);\n\n    this._feedStore = new FeedStore({ assignPositions: assignQueuePositions, localActorId: crypto.randomUUID() });\n    this._queueDataSource = new QueueDataSource({\n      feedStore: this._feedStore,\n      runtime: this._runtime,\n      getSpaceIds: () => this._spaceStateManager.spaceIds,\n    });\n    this._queuesService = new LocalQueueServiceImpl(runtime, this._feedStore, syncQueue);\n\n    // SQLite-based index engine for all queries.\n    this._indexEngine = new IndexEngine();\n\n    this._queryService = new QueryServiceImpl({\n      automergeHost: this._automergeHost,\n      indexEngine: this._indexEngine,\n      runtime: this._runtime,\n      spaceStateManager: this._spaceStateManager,\n    });\n\n    this._dataService = new DataServiceImpl({\n      automergeHost: this._automergeHost,\n      spaceStateManager: this._spaceStateManager,\n      updateIndexes: async () => {\n        do {\n          await this._updateIndexes.runBlocking();\n        } while (!this._indexesUpToDate);\n      },\n    });\n\n    trace.diagnostic<EchoStatsDiagnostic>({\n      id: 'echo-stats',\n      name: 'Echo Stats',\n      fetch: async () => {\n        return {\n          dataStats: this._echoDataMonitor.computeStats(),\n          loadedDocsCount: this._automergeHost.loadedDocsCount,\n        };\n      },\n    });\n\n    trace.diagnostic({\n      id: 'database-roots',\n      name: 'Database Roots',\n      fetch: async () => {\n        return Array.from(this._spaceStateManager.roots.values()).map((root) => ({\n          url: root.url,\n          isLoaded: root.isLoaded,\n          spaceKey: root.getSpaceKey(),\n          inlineObjects: root.getInlineObjectCount(),\n          linkedObjects: root.getLinkedObjectCount(),\n        }));\n      },\n    });\n\n    trace.diagnostic({\n      id: 'database-root-metrics',\n      name: 'Database Roots (with metrics)',\n      fetch: async () => {\n        return Array.from(this._spaceStateManager.roots.values()).map((root) => ({\n          url: root.url,\n          isLoaded: root.isLoaded,\n          spaceKey: root.getSpaceKey(),\n          inlineObjects: root.getInlineObjectCount(),\n          linkedObjects: root.getLinkedObjectCount(),\n          ...(root.measureMetrics() ?? {}),\n        }));\n      },\n    });\n  }\n\n  get spaceIds(): SpaceId[] {\n    return this._spaceStateManager.spaceIds;\n  }\n\n  get queryService(): QueryServiceImpl {\n    return this._queryService;\n  }\n\n  get dataService(): DataServiceImpl {\n    return this._dataService;\n  }\n\n  get queuesService(): FeedProtocol.QueueService {\n    return this._queuesService;\n  }\n\n  get roots(): ReadonlyMap<DocumentId, DatabaseRoot> {\n    return this._spaceStateManager.roots;\n  }\n\n  get feedStore(): FeedStore {\n    return this._feedStore;\n  }\n\n  /**\n   * Index engine for queries.\n   */\n  get indexEngine(): IndexEngine {\n    return this._indexEngine;\n  }\n\n  protected override async _open(ctx: Context): Promise<void> {\n    log('echo-host: opening automerge host...');\n    await this._automergeHost.open(ctx);\n    log('echo-host: automerge host opened');\n\n    log('echo-host: opening query service...');\n    await this._queryService.open(ctx);\n    log('echo-host: query service opened');\n\n    log('echo-host: opening space state manager...');\n    await this._spaceStateManager.open(ctx);\n    log('echo-host: space state manager opened');\n\n    // Timeout needs to be outside effect runtime to catch the layer hanging on startup.\n    await asyncTimeout(\n      RuntimeProvider.runPromise(this._runtime)(testSqlite()),\n      15_000,\n      new Error('SQLite quick check timed out'),\n    );\n\n    log('echo-host: running index engine migration...');\n    await RuntimeProvider.runPromise(this._runtime)(this._indexEngine.migrate());\n    log('echo-host: index engine migration done');\n    this._updateIndexes = new DeferredTask(this._ctx, this._runUpdateIndexes);\n\n    log('echo-host: running feed store migration...');\n    await RuntimeProvider.runPromise(this._runtime)(this._feedStore.migrate());\n    log('echo-host: feed store migration done');\n    this._feedStore.onNewBlocks.on(this._ctx, () => {\n      this._updateIndexes.schedule();\n    });\n\n    this._spaceStateManager.spaceDocumentListUpdated.on(this._ctx, (e) => {\n      if (e.previousRootId) {\n        void this._automergeHost.clearLocalCollectionState(deriveCollectionIdFromSpaceId(e.spaceId, e.previousRootId));\n      }\n      void this._automergeHost.updateLocalCollectionState(\n        deriveCollectionIdFromSpaceId(e.spaceId, e.spaceRootId),\n        e.documentIds,\n      );\n    });\n    this._automergeHost.documentsSaved.on(this._ctx, () => {\n      this._updateIndexes.schedule();\n    });\n    this._updateIndexes.schedule();\n    log('echo-host: open complete');\n  }\n\n  protected override async _close(ctx: Context): Promise<void> {\n    await this._queryService.close(ctx);\n    await this._spaceStateManager.close(ctx);\n    await this._automergeHost.close();\n  }\n\n  /**\n   * Flush all pending writes to the underlying storage.\n   */\n  async flush(ctx: Context): Promise<void> {\n    await this._automergeHost.flush(ctx);\n  }\n\n  /**\n   * Perform any pending index updates.\n   */\n  async updateIndexes(): Promise<void> {\n    do {\n      await this._updateIndexes.runBlocking();\n    } while (!this._indexesUpToDate);\n  }\n\n  /**\n   * Loads the document handle from the repo and waits for it to be ready.\n   */\n  async loadDoc<T>(ctx: Context, documentId: AnyDocumentId, opts?: LoadDocOptions): Promise<DocHandle<T>> {\n    return await this._automergeHost.loadDoc(ctx, documentId, opts);\n  }\n\n  async exportDoc(id: AnyDocumentId): Promise<Uint8Array> {\n    return await this._automergeHost.exportDoc(id);\n  }\n\n  /**\n   * Create new persisted document.\n   */\n  async createDoc<T>(initialValue?: T, opts?: CreateDocOptions): Promise<DocHandle<T>> {\n    return this._automergeHost.createDoc(initialValue, opts);\n  }\n\n  /**\n   * Create new space root.\n   */\n  async createSpaceRoot(ctx: Context, spaceKey: PublicKey): Promise<DatabaseRoot> {\n    invariant(this._lifecycleState === LifecycleState.OPEN);\n    const spaceId = await createIdFromSpaceKey(spaceKey);\n\n    const automergeRoot = await this._automergeHost.createDoc<DatabaseDirectory>({\n      version: SpaceDocVersion.CURRENT,\n      access: { spaceKey: spaceKey.toHex() },\n\n      // Better to initialize them right away to avoid merge conflicts and data loss that can occur if those maps get created on the fly.\n      objects: {},\n      links: {},\n    });\n\n    await this._automergeHost.flush(ctx, { documentIds: [automergeRoot.documentId] });\n\n    return await this.openSpaceRoot(ctx, spaceId, automergeRoot.url);\n  }\n\n  // TODO(dmaretskyi): Change to document id.\n  async openSpaceRoot(ctx: Context, spaceId: SpaceId, automergeUrl: AutomergeUrl): Promise<DatabaseRoot> {\n    invariant(this._lifecycleState === LifecycleState.OPEN);\n    const handle = await this._automergeHost.loadDoc<DatabaseDirectory>(ctx, automergeUrl, {\n      fetchFromNetwork: true,\n    });\n    const query = this._automergeHost.findWithProgress<DatabaseDirectory>(handle.documentId);\n\n    return this._spaceStateManager.assignRootToSpace(spaceId, query);\n  }\n\n  // TODO(dmaretskyi): Change to document id.\n  async closeSpaceRoot(_automergeUrl: AutomergeUrl): Promise<void> {\n    todo();\n  }\n\n  /**\n   * Install data replicator.\n   */\n  async addReplicator(ctx: Context, replicator: AutomergeReplicator): Promise<void> {\n    await this._automergeHost.addReplicator(ctx, replicator);\n  }\n\n  /**\n   * Remove data replicator.\n   */\n  async removeReplicator(replicator: AutomergeReplicator): Promise<void> {\n    await this._automergeHost.removeReplicator(replicator);\n  }\n\n  /**\n   * Run collection sync for the given space.\n   * Does not wait for the sync to complete.\n   */\n  async runCollectionSync(spaceId: SpaceId) {\n    const root = this._spaceStateManager.getRootBySpaceId(spaceId);\n    if (!root) {\n      throw new Error(`Space not found: ${spaceId}`);\n    }\n    this._automergeHost.refreshCollection(deriveCollectionIdFromSpaceId(spaceId, root.documentId));\n  }\n\n  /**\n   * Get all feeds and their blocks for a space.\n   * Used for space archive export.\n   */\n  async getAllFeedsForSpace(\n    spaceId: SpaceId,\n  ): Promise<Array<{ feedId: string; feedNamespace: string; blocks: FeedProtocol.Block[] }>> {\n    return RuntimeProvider.runPromise(this._runtime)(this._feedStore.getAllFeedsForSpace({ spaceId }));\n  }\n\n  private _runUpdateIndexes = async (): Promise<void> => {\n    if (this._ctx.disposed || !this.isOpen) {\n      return;\n    }\n\n    try {\n      const combinedResult = _makeEmptyMergedResult();\n\n      {\n        performance.mark('indexEngine.update.automerge:start');\n        const result = await this._indexEngine\n          .update(this._ctx, this._automergeDataSource, { spaceId: null, limit: 50 })\n          .pipe(RuntimeProvider.runPromise(this._runtime));\n        _mergeInto(combinedResult, result);\n        performance.measure('Index Automerge', {\n          start: 'indexEngine.update.automerge:start',\n          detail: {\n            devtools: {\n              dataType: 'track-entry',\n              track: 'Indexing',\n              trackGroup: 'ECHO', // Group related tracks together\n              color: 'tertiary-dark',\n              properties: [['count', result.updated]],\n            },\n          },\n        });\n      }\n      if (this._ctx.disposed || !this.isOpen) {\n        return;\n      }\n\n      {\n        performance.mark('indexEngine.update.queue:start');\n        const result = await this._indexEngine\n          .update(this._ctx, this._queueDataSource, { spaceId: null, limit: 50 })\n          .pipe(RuntimeProvider.runPromise(this._runtime));\n        _mergeInto(combinedResult, result);\n        performance.measure('Index Queues', {\n          start: 'indexEngine.update.queue:start',\n          detail: {\n            devtools: {\n              dataType: 'track-entry',\n              track: 'Indexing',\n              trackGroup: 'ECHO',\n              color: 'tertiary-dark',\n              properties: [['count', result.updated]],\n            },\n          },\n        });\n      }\n\n      log.verbose('indexEngine update completed', {\n        updated: combinedResult.updated,\n        done: combinedResult.done,\n        spaces: combinedResult.spaces.size,\n        queues: combinedResult.queues.size,\n        documents: combinedResult.documents.size,\n        types: combinedResult.types.size,\n        objects: combinedResult.objects.size,\n      });\n      await sleep(1);\n      if (!combinedResult.done) {\n        this._indexesUpToDate = false;\n        this._updateIndexes!.schedule();\n      } else {\n        this._indexesUpToDate = true;\n      }\n\n      // Invalidate queries after index update — the indexer is the sole invalidation source.\n      const hint = hintFromIndexingResult(combinedResult);\n      if (hint) {\n        this._queryService.invalidateQueries(hint);\n      }\n    } catch (err) {\n      if (this._ctx.disposed || !this.isOpen) {\n        return;\n      }\n      log.catch(err);\n      // Failsafe: prevent queries from freezing if the indexer faults.\n      this._queryService.invalidateQueries();\n      throw err;\n    }\n  };\n}\n\nexport type { EchoDataStats };\n\ntype MutableIndexingAccumulator = {\n  updated: number;\n  done: boolean;\n  spaces: Set<SpaceId>;\n  queues: Set<ObjectId>;\n  documents: Set<string>;\n  types: Set<string>;\n  objects: Set<ObjectId>;\n};\n\nconst _makeEmptyMergedResult = (): MutableIndexingAccumulator => ({\n  updated: 0,\n  done: true,\n  spaces: new Set(),\n  queues: new Set(),\n  documents: new Set(),\n  types: new Set(),\n  objects: new Set(),\n});\n\nconst _mergeInto = (acc: MutableIndexingAccumulator, r: IndexingResult): void => {\n  acc.updated += r.updated;\n  acc.done = acc.done && r.done;\n  for (const s of r.spaces) {\n    acc.spaces.add(s);\n  }\n  for (const q of r.queues) {\n    acc.queues.add(q);\n  }\n  for (const d of r.documents) {\n    acc.documents.add(d);\n  }\n  for (const t of r.types) {\n    acc.types.add(t);\n  }\n  for (const o of r.objects) {\n    acc.objects.add(o);\n  }\n};\n\nexport type EchoStatsDiagnostic = {\n  loadedDocsCount: number;\n  dataStats: EchoDataStats;\n};\n\n/**\n * Sqlite health check on startup.\n *\n * Always runs a cheap schema-level probe (`PRAGMA schema_version` + a read from\n * `sqlite_schema`). These do not walk user data, but they fail fast if the DB\n * file header or schema root page is unreadable.\n *\n * Additionally runs `PRAGMA quick_check` when `RUN_SQLITE_QUICK_CHECK_ON_STARTUP`\n * is enabled. That walks every page and is O(dbSize) — slow on OPFS.\n */\nconst testSqlite = () =>\n  Effect.gen(function* () {\n    log('begin sqlite health check');\n    const sql = yield* SqlClient.SqlClient;\n    const databases = yield* sql<{ seq: number; name: string; file: string }>`PRAGMA database_list`;\n    log('SQLite databases', { databases });\n\n    // Cheap header/schema probe: forces SQLite to read the file header and\n    // schema root page. Catches catastrophic corruption (bad header,\n    // unreadable schema) without walking user data.\n    const [schemaVersion] = yield* sql<{ schema_version: number }>`PRAGMA schema_version`;\n    const [schemaCount] = yield* sql<{ n: number }>`SELECT count(*) AS n FROM sqlite_schema`;\n    log('sqlite schema probe passed', {\n      schemaVersion: schemaVersion.schema_version,\n      objectCount: schemaCount.n,\n    });\n\n    if (RUN_SQLITE_QUICK_CHECK_ON_STARTUP) {\n      // NOTE: This is slow on non-trivial databases: O(dbSize).\n      log('starting sqlite quick_check');\n      const [result] = yield* sql<{ quick_check: string }>`PRAGMA quick_check`;\n      if (result.quick_check !== 'ok') {\n        throw new Error('SQLite quick check failed');\n      }\n      log('sqlite quick_check passed');\n    } else {\n      log('sqlite quick_check skipped');\n    }\n    log('sqlite health check complete');\n  });\n", "//\n// Copyright 2026 DXOS.org\n//\n\nimport type { IndexingResult } from '@dxos/index-core';\nimport type { ObjectId, SpaceId } from '@dxos/keys';\n\nexport type InvalidationHint = {\n  spaceIds?: ReadonlySet<SpaceId>;\n  queueIds?: ReadonlySet<ObjectId>;\n  typenames?: ReadonlySet<string>;\n  objectIds?: ReadonlySet<ObjectId>;\n};\n\n/**\n * Converts an IndexingResult to an InvalidationHint.\n * Returns undefined when nothing was indexed (no need to invalidate).\n */\nexport const hintFromIndexingResult = (r: IndexingResult): InvalidationHint | undefined => {\n  if (r.updated === 0) {\n    return undefined;\n  }\n  return {\n    spaceIds: r.spaces.size > 0 ? r.spaces : undefined,\n    queueIds: r.queues.size > 0 ? r.queues : undefined,\n    typenames: r.types.size > 0 ? r.types : undefined,\n    objectIds: r.objects.size > 0 ? r.objects : undefined,\n  };\n};\n\n/**\n * Merges two hints for the same tick.\n * If either side leaves a dimension unconstrained (undefined), the merged result is also unconstrained on that dimension.\n */\nexport const mergeHints = (a: InvalidationHint, b: InvalidationHint): InvalidationHint => ({\n  spaceIds: unionOrUndefined(a.spaceIds, b.spaceIds),\n  queueIds: unionOrUndefined(a.queueIds, b.queueIds),\n  typenames: unionOrUndefined(a.typenames, b.typenames),\n  objectIds: unionOrUndefined(a.objectIds, b.objectIds),\n});\n\nconst unionOrUndefined = <T>(\n  a: ReadonlySet<T> | undefined,\n  b: ReadonlySet<T> | undefined,\n): ReadonlySet<T> | undefined => {\n  if (a === undefined || b === undefined) {\n    return undefined;\n  }\n  return new Set<T>([...a, ...b]);\n};\n", "//\n// Copyright 2025 DXOS.org\n//\n\nimport type * as SqlClient from '@effect/sql/SqlClient';\nimport * as Effect from 'effect/Effect';\nimport * as Function from 'effect/Function';\n\nimport { type RequestOptions } from '@dxos/codec-protobuf';\nimport { Context } from '@dxos/context';\nimport { EchoFeedCodec } from '@dxos/echo-protocol';\nimport { type ObjectJSON } from '@dxos/echo/internal';\nimport { RuntimeProvider } from '@dxos/effect';\nimport { type FeedStore } from '@dxos/feed';\nimport { assertArgument, invariant } from '@dxos/invariant';\nimport { type SpaceId } from '@dxos/keys';\nimport { FeedProtocol } from '@dxos/protocols';\nimport {\n  type DeleteFromQueueRequest,\n  type InsertIntoQueueRequest,\n  type QueryQueueRequest,\n  type QueueQueryResult,\n  type QueueService,\n  type SyncQueueRequest,\n} from '@dxos/protocols/proto/dxos/client/services';\nimport type { SqlTransaction } from '@dxos/sql-sqlite';\n\n/**\n * Writes queue data to a local FeedStore.\n */\nexport class LocalQueueServiceImpl implements QueueService {\n  #runtime: RuntimeProvider.RuntimeProvider<SqlClient.SqlClient | SqlTransaction.SqlTransaction>;\n  #feedStore: FeedStore;\n  #syncQueue?: (ctx: Context, request: SyncQueueRequest) => Promise<void>;\n\n  constructor(\n    runtime: RuntimeProvider.RuntimeProvider<SqlClient.SqlClient | SqlTransaction.SqlTransaction>,\n    feedStore: FeedStore,\n    syncQueue?: (ctx: Context, request: SyncQueueRequest) => Promise<void>,\n  ) {\n    this.#runtime = runtime;\n    this.#feedStore = feedStore;\n    this.#syncQueue = syncQueue;\n  }\n\n  queryQueue(request: QueryQueueRequest): Promise<QueueQueryResult> {\n    const { query } = request;\n    invariant(query, 'query is required');\n    const { spaceId, queueIds } = query;\n    return RuntimeProvider.runPromise(this.#runtime)(\n      Effect.gen(this, function* () {\n        const cursor = query.after ? parseInt(query.after) : -1;\n        const result = yield* this.#feedStore.query({\n          requestId: crypto.randomUUID(),\n          feedNamespace: request.query.queuesNamespace || FeedProtocol.WellKnownNamespaces.data,\n          spaceId: spaceId! as SpaceId,\n          query: { feedIds: queueIds ?? [] },\n          position: cursor,\n          limit: query.limit,\n        });\n\n        const objects = result.blocks.map((block: FeedProtocol.Block) =>\n          JSON.stringify(EchoFeedCodec.decode(block.data, block.position ?? undefined) as ObjectJSON),\n        );\n\n        const lastBlock = result.blocks[result.blocks.length - 1];\n        const nextCursor = lastBlock && lastBlock.position != null ? String(lastBlock.position) : null;\n\n        return Function.identity<QueueQueryResult>({\n          objects,\n\n          // TODO(dmaretskyi): This is wrong, fix later - cursors should come directly from the feed.\n          nextCursor: nextCursor?.toString() ?? '',\n          prevCursor: '',\n        });\n      }),\n    );\n  }\n\n  insertIntoQueue(request: InsertIntoQueueRequest): Promise<void> {\n    const { subspaceTag, spaceId, queueId, objects } = request;\n    const feedNamespace = subspaceTag ?? FeedProtocol.WellKnownNamespaces.data;\n    assertArgument(\n      FeedProtocol.isWellKnownNamespace(feedNamespace),\n      'request.subspaceTag',\n      'expected a well-known queue namespace',\n    );\n    return RuntimeProvider.runPromise(this.#runtime)(\n      Effect.gen(this, function* () {\n        const messages = (objects ?? []).map((encoded) => ({\n          spaceId: spaceId,\n          feedId: queueId!,\n          feedNamespace,\n          data: EchoFeedCodec.encode(JSON.parse(encoded) as ObjectJSON),\n        }));\n\n        yield* this.#feedStore.appendLocal(messages);\n      }),\n    );\n  }\n\n  deleteFromQueue(request: DeleteFromQueueRequest): Promise<void> {\n    const { subspaceTag, spaceId, queueId, objectIds } = request;\n    const feedNamespace = subspaceTag ?? FeedProtocol.WellKnownNamespaces.data;\n    assertArgument(\n      FeedProtocol.isWellKnownNamespace(feedNamespace),\n      'request.subspaceTag',\n      'expected a well-known queue namespace',\n    );\n    return RuntimeProvider.runPromise(this.#runtime)(\n      Effect.gen(this, function* () {\n        const messages = objectIds!.map((id) => ({\n          spaceId: spaceId,\n          feedId: queueId!,\n          feedNamespace,\n          data: EchoFeedCodec.encode({ id, '@deleted': true }),\n        }));\n\n        yield* this.#feedStore.appendLocal(messages);\n      }),\n    );\n  }\n\n  async syncQueue(request: SyncQueueRequest, options?: RequestOptions): Promise<void> {\n    await this.#syncQueue?.(options?.ctx ?? Context.default(), request);\n  }\n}\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport type * as SqlClient from '@effect/sql/SqlClient';\nimport * as Schema from 'effect/Schema';\n\nimport { DeferredTask, scheduleMicroTask, synchronized } from '@dxos/async';\nimport { Stream } from '@dxos/codec-protobuf/stream';\nimport { type Context, Resource } from '@dxos/context';\nimport { raise } from '@dxos/debug';\nimport { QueryAST } from '@dxos/echo-protocol';\nimport { type RuntimeProvider } from '@dxos/effect';\nimport { type IndexEngine } from '@dxos/index-core';\nimport { log } from '@dxos/log';\nimport {\n  type QueryRequest,\n  type QueryResponse,\n  type QueryResult,\n  type QueryService,\n} from '@dxos/protocols/proto/dxos/echo/query';\nimport { trace } from '@dxos/tracing';\n\nimport { type AutomergeHost } from '../automerge';\nimport { QueryExecutor } from '../query';\nimport { type InvalidationHint, mergeHints } from './invalidation-hint';\nimport type { SpaceStateManager } from './space-state-manager';\n\nexport type QueryServiceProps = {\n  indexEngine: IndexEngine;\n  runtime: RuntimeProvider.RuntimeProvider<SqlClient.SqlClient>;\n  automergeHost: AutomergeHost;\n  spaceStateManager: SpaceStateManager;\n};\n\n/**\n * Represents an active query (stream and query state connected to that stream).\n */\ntype ActiveQuery = {\n  executor: QueryExecutor;\n  /**\n   * Schedule re-execution of the query if true.\n   */\n  dirty: boolean;\n\n  open: boolean;\n\n  firstResult: boolean;\n\n  sendResults: (results: QueryResult[]) => void;\n  onError: (err: Error) => void;\n\n  close: () => Promise<void>;\n};\n\ntype QueryInvalidationStats = {\n  totalInvalidations: number;\n  catchAllInvalidations: number;\n  hintedInvalidations: number;\n  totalDirtyQueriesExecuted: number;\n  totalExecutionBatches: number;\n  averageDirtyPerBatch: number;\n  averageQueriesActive: number;\n};\n\n@trace.resource()\nexport class QueryServiceImpl extends Resource implements QueryService {\n  // TODO(dmaretskyi): We need to implement query deduping. Idle composer has 80 queries with only 10 being unique.\n  private readonly _queries = new Set<ActiveQuery>();\n\n  private _updateQueries!: DeferredTask;\n\n  // 'all' = catch-all; null = no pending hint.\n  #pendingHint: InvalidationHint | 'all' | null = null;\n\n  // Diagnostic counters.\n  #stats: QueryInvalidationStats = {\n    totalInvalidations: 0,\n    catchAllInvalidations: 0,\n    hintedInvalidations: 0,\n    totalDirtyQueriesExecuted: 0,\n    totalExecutionBatches: 0,\n    averageDirtyPerBatch: 0,\n    averageQueriesActive: 0,\n  };\n\n  // TODO(burdon): OK for options, but not params. Pass separately and type readonly here.\n  constructor(private readonly _params: QueryServiceProps) {\n    super();\n\n    trace.diagnostic({\n      id: 'active-queries',\n      name: 'Active Queries',\n      fetch: () => {\n        return Array.from(this._queries).map((query) => {\n          return {\n            query: JSON.stringify(query.executor.query),\n            plan: JSON.stringify(query.executor.plan),\n            trace: JSON.stringify(query.executor.trace),\n          };\n        });\n      },\n    });\n\n    trace.diagnostic<QueryInvalidationStats>({\n      id: 'query-invalidation',\n      name: 'Query Invalidation',\n      fetch: async () => ({ ...this.#stats }),\n    });\n  }\n\n  override async _open(): Promise<void> {\n    this._updateQueries = new DeferredTask(this._ctx, () => this._executeQueries(this._ctx));\n  }\n\n  @synchronized\n  override async _close(): Promise<void> {\n    await this._updateQueries.join();\n    await Promise.all(Array.from(this._queries).map((query) => query.close()));\n  }\n\n  /**\n   * @deprecated No longer needed with SQL-based indexing.\n   */\n  async setConfig(): Promise<void> {\n    // No-op: SQL indexer doesn't need explicit configuration.\n  }\n\n  /**\n   * @deprecated No longer needed with SQL-based indexing.\n   */\n  async reindex(): Promise<void> {\n    // No-op: SQL indexer handles re-indexing automatically.\n    log.warn('reindex() is deprecated and no longer has any effect');\n  }\n\n  execQuery(request: QueryRequest): Stream<QueryResponse> {\n    return new Stream<QueryResponse>(({ next, close, ctx }) => {\n      const queryEntry = this._createQuery(ctx, request, next, close, close);\n      scheduleMicroTask(ctx, async () => {\n        await queryEntry.executor.open();\n        queryEntry.open = true;\n        this._updateQueries.schedule();\n      });\n      return queryEntry.close;\n    });\n  }\n\n  /**\n   * Schedule re-execution of queries, optionally guided by a targeted hint.\n   * When called without a hint, all queries are marked dirty (catch-all invalidation).\n   */\n  invalidateQueries(hint?: InvalidationHint): void {\n    this.#stats.totalInvalidations++;\n    if (!hint) {\n      this.#pendingHint = 'all';\n      this.#stats.catchAllInvalidations++;\n    } else {\n      this.#stats.hintedInvalidations++;\n      if (this.#pendingHint !== 'all') {\n        this.#pendingHint = this.#pendingHint ? mergeHints(this.#pendingHint, hint) : hint;\n      }\n    }\n    this._updateQueries.schedule();\n  }\n\n  private _createQuery(\n    ctx: Context,\n    request: QueryRequest,\n    onResults: (respose: QueryResponse) => void,\n    onError: (err: Error) => void,\n    onClose: () => void,\n  ): ActiveQuery {\n    const parsedQuery = QueryAST.Query.pipe(Schema.decodeUnknownSync)(JSON.parse(request.query));\n    const queryEntry: ActiveQuery = {\n      executor: new QueryExecutor({\n        indexEngine: this._params.indexEngine,\n        runtime: this._params.runtime,\n        automergeHost: this._params.automergeHost,\n        queryId: request.queryId ?? raise(new Error('query id required')),\n        query: parsedQuery,\n        reactivity: request.reactivity,\n        spaceStateManager: this._params.spaceStateManager,\n      }),\n      dirty: true,\n      open: false,\n      firstResult: true,\n      sendResults: (results) => {\n        if (ctx.disposed) {\n          return;\n        }\n        onResults({ queryId: request.queryId, results });\n      },\n      onError,\n      close: async () => {\n        onClose();\n        await queryEntry.executor.close();\n        this._queries.delete(queryEntry);\n      },\n    };\n    this._queries.add(queryEntry);\n    return queryEntry;\n  }\n\n  @trace.span({ showInBrowserTimeline: true, showInRemoteTracing: false })\n  private async _executeQueries(_ctx: Context) {\n    const hint = this.#pendingHint;\n    this.#pendingHint = null;\n\n    // Apply hint to determine which queries need re-execution.\n    for (const query of this._queries) {\n      if (!query.open) {\n        continue;\n      }\n      if (query.firstResult) {\n        // First run is always executed regardless of hint.\n        query.dirty = true;\n        continue;\n      }\n      if (hint === 'all') {\n        query.dirty = true;\n        continue;\n      }\n      if (hint && query.executor.matchesHint(hint)) {\n        query.dirty = true;\n      }\n    }\n\n    const begin = performance.now();\n    let dirtyCount = 0;\n    const activeCount = this._queries.size;\n    await Promise.all(\n      Array.from(this._queries).map(async (query) => {\n        if (!query.dirty || !query.open) {\n          return;\n        }\n        dirtyCount++;\n\n        try {\n          const { changed } = await query.executor.execQuery();\n          query.dirty = false;\n          if (changed || query.firstResult) {\n            query.firstResult = false;\n            query.sendResults(query.executor.getResults());\n          }\n        } catch (err) {\n          log.catch(err, {\n            queryId: query.executor.queryId,\n            query: JSON.stringify(query.executor.query),\n          });\n          query.onError(err as Error);\n        }\n      }),\n    );\n\n    this.#stats.totalExecutionBatches++;\n    this.#stats.totalDirtyQueriesExecuted += dirtyCount;\n    this.#stats.averageDirtyPerBatch = this.#stats.totalDirtyQueriesExecuted / this.#stats.totalExecutionBatches;\n    this.#stats.averageQueriesActive =\n      (this.#stats.averageQueriesActive * (this.#stats.totalExecutionBatches - 1) + activeCount) /\n      this.#stats.totalExecutionBatches;\n\n    log.verbose('executed queries', { dirty: dirtyCount, active: activeCount, duration: performance.now() - begin });\n  }\n}\n", "//\n// Copyright 2025 DXOS.org\n//\n\nimport type { AutomergeUrl, DocumentId } from '@automerge/automerge-repo';\nimport type * as SqlClient from '@effect/sql/SqlClient';\nimport type * as Effect from 'effect/Effect';\nimport * as Runtime from 'effect/Runtime';\n\nimport { ContextDisposedError, LifecycleState, Resource } from '@dxos/context';\nimport { type Obj, Query } from '@dxos/echo';\nimport {\n  DatabaseDirectory,\n  EncodedReference,\n  type ObjectPropPath,\n  ObjectStructure,\n  type QueryAST,\n  isEncodedReference,\n} from '@dxos/echo-protocol';\nimport { ATTR_PARENT, ATTR_RELATION_SOURCE, ATTR_RELATION_TARGET } from '@dxos/echo/internal';\nimport { type RuntimeProvider, runAndForwardErrors, unwrapExit } from '@dxos/effect';\nimport { EscapedPropPath, type IndexEngine, type ObjectMeta, type ReverseRef } from '@dxos/index-core';\nimport { invariant } from '@dxos/invariant';\nimport { DXN, type ObjectId, type SpaceId } from '@dxos/keys';\nimport { log } from '@dxos/log';\nimport { type QueryReactivity, type QueryResult } from '@dxos/protocols/proto/dxos/echo/query';\nimport { compositeKey, getDeep, isNonNullable } from '@dxos/util';\n\nimport type { AutomergeHost } from '../automerge';\nimport type { InvalidationHint, SpaceStateManager } from '../db-host';\nimport { filterMatchObject, filterMatchObjectJSON } from '../filter';\nimport { QueryError } from './errors';\nimport type { QueryPlan } from './plan';\nimport { QueryPlanner } from './query-planner';\n\ntype QueryExecutorOptions = {\n  indexEngine: IndexEngine;\n  runtime: RuntimeProvider.RuntimeProvider<SqlClient.SqlClient>;\n  automergeHost: AutomergeHost;\n  spaceStateManager: SpaceStateManager;\n\n  queryId: string;\n  query: QueryAST.Query;\n  reactivity: QueryReactivity;\n};\n\ntype QueryExecutionResult = {\n  /**\n   * Whether the query results have changed since the last execution.\n   */\n  changed: boolean;\n};\n\n/**\n * Represents an item in the query working set during execution.\n */\ntype QueryItem = {\n  objectId: ObjectId;\n\n  spaceId: SpaceId;\n  queueId: ObjectId | null;\n  queueNamespace: string | null;\n\n  // For objects from automerge documents.\n  documentId: DocumentId | null;\n\n  // For objects from automerge documents.\n  doc: ObjectStructure | null;\n\n  // For objects from queues.\n  data: Obj.JSON | null;\n\n  /**\n   * Relevance rank for this item.\n   * Higher values indicate better matches for FTS/vector searches.\n   * Defaults to 1 for non-ranked queries (predicate matches).\n   */\n  rank: number;\n};\n\nconst QueryItem = Object.freeze({\n  /**\n   * Checks if the item is deleted.\n   * Only applies to this item, not its parents.\n   */\n  isDeleted: (item: QueryItem) => {\n    if (item.doc) {\n      return ObjectStructure.isDeleted(item.doc);\n    } else if (item.data) {\n      return item.data['@deleted'] === true;\n    } else {\n      throw new Error('Invalid query item');\n    }\n  },\n\n  getProperty: (item: QueryItem, property: ObjectPropPath) => {\n    if (item.doc) {\n      return getDeep(item.doc.data, property);\n    } else if (item.data) {\n      return getDeep(item.data, property);\n    } else {\n      throw new Error('Invalid query item');\n    }\n  },\n\n  getParent: (item: QueryItem): DXN.String | undefined => {\n    if (item.doc) {\n      return ObjectStructure.getParent(item.doc)?.['/'] as DXN.String | undefined;\n    } else if (item.data) {\n      return item.data[ATTR_PARENT] as DXN.String;\n    } else {\n      throw new Error('Invalid query item');\n    }\n  },\n\n  getRelationSource: (item: QueryItem): DXN.String | undefined => {\n    if (item.doc) {\n      return ObjectStructure.getRelationSource(item.doc)?.['/'] as DXN.String | undefined;\n    } else if (item.data) {\n      return item.data[ATTR_RELATION_SOURCE] as DXN.String;\n    } else {\n      throw new Error('Invalid query item');\n    }\n  },\n\n  getRelationTarget: (item: QueryItem): DXN.String | undefined => {\n    if (item.doc) {\n      return ObjectStructure.getRelationTarget(item.doc)?.['/'] as DXN.String | undefined;\n    } else if (item.data) {\n      return item.data[ATTR_RELATION_TARGET] as DXN.String;\n    } else {\n      throw new Error('Invalid query item');\n    }\n  },\n});\n\n/**\n * Recursive data structure that represents the execution trace of a query.\n */\nexport type ExecutionTrace = {\n  name: string;\n  details: string;\n\n  objectCount: number;\n  documentsLoaded: number;\n  indexHits: number;\n\n  beginTs: number;\n  endTs: number;\n\n  executionTime: number;\n  indexQueryTime: number;\n  documentLoadTime: number;\n\n  children: ExecutionTrace[];\n};\n\nexport const ExecutionTrace = Object.freeze({\n  makeEmpty: (): ExecutionTrace => ({\n    name: 'Empty',\n    details: '',\n    objectCount: 0,\n    documentsLoaded: 0,\n    indexHits: 0,\n    beginTs: 0,\n    endTs: 0,\n    indexQueryTime: 0,\n    documentLoadTime: 0,\n    executionTime: 0,\n    children: [],\n  }),\n  markEnd: (trace: ExecutionTrace) => {\n    trace.endTs = performance.now();\n    trace.executionTime = trace.endTs - trace.beginTs;\n  },\n  putOnPerformanceTimeline: (trace: ExecutionTrace) => {\n    performance.measure(trace.name, {\n      start: trace.beginTs,\n      end: trace.endTs,\n      detail: {\n        devtools: {\n          dataType: 'track-entry',\n          track: 'Query Execution',\n          trackGroup: 'ECHO', // Group related tracks together\n          color: 'tertiary-dark',\n          properties: [\n            ['objectCount', trace.objectCount],\n            ['documentsLoaded', trace.documentsLoaded],\n            ['index hits', trace.indexHits],\n            ['indexQueryTime', trace.indexQueryTime],\n            ['documentLoadTime', trace.documentLoadTime],\n          ],\n          tooltipText: trace.details,\n        },\n      },\n    });\n    for (const child of trace.children) {\n      ExecutionTrace.putOnPerformanceTimeline(child);\n    }\n  },\n  format: (trace: ExecutionTrace): string => {\n    const go = (trace: ExecutionTrace, indent: number): string => {\n      return [\n        `${' '.repeat(indent)} - ${trace.name}(${trace.details})`,\n        `${' '.repeat(indent)}   objects: ${trace.objectCount}  docs: ${trace.documentsLoaded}  index hits: ${trace.indexHits} | total: ${trace.executionTime.toFixed(0)}ms  index: ${trace.indexQueryTime.toFixed(0)}ms  load: ${trace.documentLoadTime.toFixed(0)}ms`,\n        '',\n        ...trace.children.map((child) => go(child, indent + 2)),\n      ].join('\\n');\n    };\n    return go(trace, 0);\n  },\n});\n\ntype StepExecutionResult = {\n  workingSet: QueryItem[];\n  trace: ExecutionTrace;\n};\n\ndeclare global {\n  interface ImportMeta {\n    env: ImportMetaEnv;\n  }\n\n  interface ImportMetaEnv {\n    DX_TRACE_QUERY_EXECUTION: string;\n  }\n}\n\nconst TRACE_QUERY_EXECUTION = !!import.meta.env?.DX_TRACE_QUERY_EXECUTION;\n\nconst MAX_DEPTH_FOR_DELETION_TRACING = 10;\nconst MAX_DEPTH_FOR_CHILD_OF_TRACING = 10;\n\n/**\n * Cached scope constraints extracted from a query plan.\n * Used to quickly determine whether an invalidation hint can affect this query.\n *\n * A null dimension means the query is unconstrained on that dimension (matches any value).\n */\ntype QueryScopes = {\n  /**\n   * False for text-search, traversal, union, set-difference, or child-of queries.\n   * When false, matchesHint always returns true (conservative: always re-execute).\n   */\n  isSimple: boolean;\n  spaceIds: Set<SpaceId> | null;\n  queueIds: Set<ObjectId> | null;\n  typenames: Set<string> | null;\n  objectIds: Set<ObjectId> | null;\n};\n\nconst extractScopes = (plan: QueryPlan.Plan): QueryScopes => {\n  const scopes: QueryScopes = {\n    isSimple: true,\n    spaceIds: null,\n    queueIds: null,\n    typenames: null,\n    objectIds: null,\n  };\n\n  for (const step of plan.steps) {\n    switch (step._tag) {\n      case 'SelectStep': {\n        // Extract spaceIds from scope.\n        if (step.scope.spaceIds && step.scope.spaceIds.length > 0) {\n          if (!scopes.spaceIds) {\n            scopes.spaceIds = new Set();\n          }\n          for (const spaceId of step.scope.spaceIds) {\n            scopes.spaceIds.add(spaceId as SpaceId);\n          }\n        }\n\n        // Extract queueIds from explicit queue DXNs and derive spaceIds from them.\n        if (step.scope.queues && step.scope.queues.length > 0 && !step.scope.allQueuesFromSpaces) {\n          let parseFailed = false;\n          const derivedQueueIds = new Set<ObjectId>();\n          const derivedSpaceIds = new Set<SpaceId>();\n          for (const queueDxnStr of step.scope.queues as DXN.String[]) {\n            try {\n              const queueDxn = DXN.parse(queueDxnStr).asQueueDXN();\n              if (queueDxn) {\n                derivedQueueIds.add(queueDxn.queueId as ObjectId);\n                derivedSpaceIds.add(queueDxn.spaceId as SpaceId);\n              }\n            } catch {\n              parseFailed = true;\n            }\n          }\n\n          if (!parseFailed) {\n            if (derivedQueueIds.size > 0) {\n              scopes.queueIds ??= new Set<ObjectId>();\n              for (const id of derivedQueueIds) {\n                scopes.queueIds.add(id);\n              }\n            }\n            if (derivedSpaceIds.size > 0) {\n              scopes.spaceIds ??= new Set<SpaceId>();\n              for (const id of derivedSpaceIds) {\n                // Derive spaceId from the queue DXN so space-scoped hints can skip this query.\n                scopes.spaceIds.add(id);\n              }\n            }\n          }\n          // On any parse error, leave queue-derived dimensions unconstrained.\n        }\n\n        // Extract typename / objectId constraints from selector.\n        switch (step.selector._tag) {\n          case 'TypeSelector': {\n            if (step.selector.inverted) {\n              // Inverted type selectors come from Filter.not — mark as non-simple.\n              scopes.isSimple = false;\n            } else {\n              if (!scopes.typenames) {\n                scopes.typenames = new Set();\n              }\n              for (const typename of step.selector.typename) {\n                scopes.typenames.add(typename as string);\n              }\n            }\n            break;\n          }\n          case 'IdSelector': {\n            if (!scopes.objectIds) {\n              scopes.objectIds = new Set();\n            }\n            for (const id of step.selector.objectIds) {\n              scopes.objectIds.add(id);\n            }\n            break;\n          }\n          case 'TextSelector': {\n            scopes.isSimple = false;\n            break;\n          }\n          default:\n            // WildcardSelector, TimestampSelector — no type/id constraint.\n            break;\n        }\n        break;\n      }\n      case 'FilterStep': {\n        // child-of filters require transitive parent traversal which can't be hinted.\n        if (step.filter.type === 'child-of') {\n          scopes.isSimple = false;\n        }\n        break;\n      }\n      case 'TraverseStep':\n      case 'UnionStep':\n      case 'SetDifferenceStep':\n        scopes.isSimple = false;\n        break;\n      default:\n        // ClearWorkingSetStep, FilterDeletedStep, OrderStep, LimitStep are fine.\n        break;\n    }\n  }\n\n  return scopes;\n};\n\nconst setsOverlap = <T>(a: ReadonlySet<T>, b: ReadonlySet<T>): boolean => {\n  const [smaller, larger]: [ReadonlySet<T>, ReadonlySet<T>] = a.size <= b.size ? [a, b] : [b, a];\n  for (const item of smaller) {\n    if (larger.has(item)) {\n      return true;\n    }\n  }\n  return false;\n};\n\nconst overlapsOrUnconstrained = <T>(hintSet: ReadonlySet<T> | undefined, scopeSet: Set<T> | null): boolean =>\n  hintSet === undefined || scopeSet === null || setsOverlap(hintSet, scopeSet);\n\n/**\n * Executes query plans against the IndexEngine and AutomergeHost.\n *\n * The QueryExecutor is responsible for:\n * - Executing query plans step by step\n * - Managing the working set of query results\n * - Loading documents from the database\n * - Tracking execution performance metrics\n * - Handling different types of query operations (select, filter, traverse, etc.)\n */\nexport class QueryExecutor extends Resource {\n  private readonly _indexEngine: IndexEngine;\n  private readonly _runtime: RuntimeProvider.RuntimeProvider<SqlClient.SqlClient>;\n  private readonly _automergeHost: AutomergeHost;\n  private readonly _spaceStateManager: SpaceStateManager;\n  /**\n   * Id of this query.\n   */\n  private readonly _id: string;\n  private readonly _query: QueryAST.Query;\n  // TODO(dmaretskyi): Might be used in the future.\n  private readonly _reactivity: QueryReactivity;\n\n  private _plan: QueryPlan.Plan;\n  #scopes: QueryScopes;\n  private _trace: ExecutionTrace = ExecutionTrace.makeEmpty();\n  private _lastResultSet: QueryItem[] = [];\n\n  constructor(options: QueryExecutorOptions) {\n    super();\n\n    this._indexEngine = options.indexEngine;\n    this._runtime = options.runtime;\n    this._automergeHost = options.automergeHost;\n    this._spaceStateManager = options.spaceStateManager;\n\n    this._id = options.queryId;\n    this._query = options.query;\n    this._reactivity = options.reactivity;\n\n    const queryPlanner = new QueryPlanner();\n    this._plan = queryPlanner.createPlan(this._query);\n    this.#scopes = extractScopes(this._plan);\n  }\n\n  get queryId(): string {\n    return this._id;\n  }\n\n  get query(): QueryAST.Query {\n    return this._query;\n  }\n\n  get plan(): QueryPlan.Plan {\n    return this._plan;\n  }\n\n  get trace(): ExecutionTrace {\n    return this._trace;\n  }\n\n  getResults(): QueryResult[] {\n    return this._lastResultSet.map(\n      (item): QueryResult => ({\n        id: item.objectId,\n        documentId: item.documentId ?? undefined,\n        queueId: item.queueId ?? undefined,\n        queueNamespace: item.queueNamespace ?? undefined,\n        spaceId: item.spaceId,\n\n        rank: item.rank,\n\n        documentJson: item.doc ? JSON.stringify(item.doc) : item.data ? JSON.stringify(item.data) : undefined,\n      }),\n    );\n  }\n\n  /**\n   * Returns true if the given invalidation hint could affect this query's result set.\n   * When false, the query can safely be skipped for this invalidation cycle.\n   *\n   * Conservative: returns true for complex queries (traversals, text-search, unions) and\n   * for any dimension where either the hint or the query is unconstrained.\n   */\n  matchesHint(hint: InvalidationHint): boolean {\n    if (!this.#scopes.isSimple) {\n      return true;\n    }\n    return (\n      overlapsOrUnconstrained(hint.spaceIds, this.#scopes.spaceIds) &&\n      overlapsOrUnconstrained(hint.queueIds, this.#scopes.queueIds) &&\n      overlapsOrUnconstrained(hint.typenames, this.#scopes.typenames) &&\n      overlapsOrUnconstrained(hint.objectIds, this.#scopes.objectIds)\n    );\n  }\n\n  async execQuery(): Promise<QueryExecutionResult> {\n    invariant(this._lifecycleState === LifecycleState.OPEN);\n\n    log('exec query', {\n      queryId: this._id,\n      query: Query.pretty(Query.fromAst(this._query)),\n    });\n\n    const prevResultSet = this._lastResultSet;\n    const { workingSet, trace } = await this._execPlan(this._plan, []);\n    this._lastResultSet = workingSet;\n    trace.name = 'Root';\n    trace.details = JSON.stringify({ id: this._id, query: Query.pretty(Query.fromAst(this._query)) });\n    this._trace = trace;\n\n    const changed =\n      prevResultSet.length !== workingSet.length ||\n      prevResultSet.some(\n        (item, index) =>\n          workingSet[index].objectId !== item.objectId ||\n          workingSet[index].spaceId !== item.spaceId ||\n          workingSet[index].documentId !== item.documentId ||\n          workingSet[index].queueId !== item.queueId ||\n          workingSet[index].queueNamespace !== item.queueNamespace,\n      );\n\n    // Disabled because concurrent queries don't print hierarchies correctly.\n    // ExecutionTrace.putOnPerformanceTimeline(trace);\n\n    if (TRACE_QUERY_EXECUTION) {\n      // eslint-disable-next-line no-console\n      console.log(ExecutionTrace.format(trace));\n    }\n\n    return {\n      changed,\n    };\n  }\n\n  private async _execPlan(plan: QueryPlan.Plan, workingSet: QueryItem[]): Promise<StepExecutionResult> {\n    const trace = ExecutionTrace.makeEmpty();\n    for (const step of plan.steps) {\n      if (this._ctx.disposed) {\n        throw new ContextDisposedError();\n      }\n\n      const result = await this._execStep(step, workingSet);\n      workingSet = result.workingSet;\n      trace.children.push(result.trace);\n    }\n    trace.objectCount = workingSet.length;\n    ExecutionTrace.markEnd(trace);\n    return { workingSet, trace };\n  }\n\n  private async _execStep(step: QueryPlan.Step, workingSet: QueryItem[]): Promise<StepExecutionResult> {\n    if (this._ctx.disposed) {\n      return { workingSet, trace: ExecutionTrace.makeEmpty() };\n    }\n    let newWorkingSet: QueryItem[], trace: ExecutionTrace;\n\n    const begin = performance.now();\n    switch (step._tag) {\n      case 'ClearWorkingSetStep':\n        newWorkingSet = [];\n        trace = ExecutionTrace.makeEmpty();\n        break;\n      case 'SelectStep':\n        ({ workingSet: newWorkingSet, trace } = await this._execSelectStep(step, workingSet));\n        break;\n      case 'FilterStep':\n        ({ workingSet: newWorkingSet, trace } = await this._execFilterStep(step, workingSet));\n        break;\n      case 'FilterDeletedStep':\n        ({ workingSet: newWorkingSet, trace } = await this._execFilterDeletedStep(step, workingSet));\n        break;\n      case 'UnionStep':\n        ({ workingSet: newWorkingSet, trace } = await this._execUnionStep(step, workingSet));\n        break;\n      case 'SetDifferenceStep':\n        ({ workingSet: newWorkingSet, trace } = await this._execSetDifferenceStep(step, workingSet));\n        break;\n      case 'TraverseStep':\n        ({ workingSet: newWorkingSet, trace } = await this._execTraverseStep(step, workingSet));\n        break;\n      case 'OrderStep':\n        ({ workingSet: newWorkingSet, trace } = await this._execOrderStep(step, workingSet));\n        break;\n      case 'LimitStep':\n        ({ workingSet: newWorkingSet, trace } = await this._execLimitStep(step, workingSet));\n        break;\n      default:\n        throw new Error(`Unknown step type: ${(step as any)._tag}`);\n    }\n    trace.beginTs = begin;\n    ExecutionTrace.markEnd(trace);\n\n    return { workingSet: newWorkingSet, trace };\n  }\n\n  private async _execSelectStep(step: QueryPlan.SelectStep, workingSet: QueryItem[]): Promise<StepExecutionResult> {\n    workingSet = [...workingSet];\n\n    const spaces = (step.scope.spaceIds ?? []) as SpaceId[];\n    const queues = (step.scope.queues ?? []) as DXN.String[];\n    const allQueuesFromSpaces = step.scope.allQueuesFromSpaces ?? false;\n\n    const trace: ExecutionTrace = {\n      ...ExecutionTrace.makeEmpty(),\n      name: 'Select',\n      details: JSON.stringify(step.selector),\n      beginTs: performance.now(),\n    };\n\n    switch (step.selector._tag) {\n      case 'WildcardSelector': {\n        const beginIndexQuery = performance.now();\n        const queueIds = extractQueueIds(queues);\n        const metas = await this._queryAllFromSqlIndex(spaces, allQueuesFromSpaces, queueIds);\n        trace.indexHits = metas.length;\n        trace.indexQueryTime += performance.now() - beginIndexQuery;\n\n        if (this._ctx.disposed) {\n          return { workingSet, trace };\n        }\n\n        const documentLoadStart = performance.now();\n        const results = await this._loadDocumentsAfterSqlQuery(metas);\n        trace.documentsLoaded += results.length;\n        trace.documentLoadTime += performance.now() - documentLoadStart;\n\n        workingSet.push(...results.filter(isNonNullable));\n        trace.objectCount = workingSet.length;\n\n        break;\n      }\n\n      case 'IdSelector': {\n        const beginLoad = performance.now();\n\n        const items = await Promise.all(\n          step.selector.objectIds.map((id) => {\n            if (queues.length > 0) {\n              const { spaceId } = DXN.parse(queues[0]).asQueueDXN()!;\n              return this._loadFromDXN(DXN.parse(queues[0]).extend([id]), { sourceSpaceId: spaceId });\n            } else if (spaces.length > 0) {\n              return this._loadFromDXN(DXN.fromLocalObjectId(id), { sourceSpaceId: spaces[0] });\n            } else {\n              return null; // Unknown scope.\n            }\n          }),\n        );\n        trace.documentLoadTime += performance.now() - beginLoad;\n\n        workingSet.push(...items.filter(isNonNullable));\n        trace.objectCount = workingSet.length;\n        break;\n      }\n\n      case 'TypeSelector': {\n        const beginIndexQuery = performance.now();\n        const queueIds = extractQueueIds(queues);\n        const metas = await this._queryTypesFromSqlIndex(\n          spaces,\n          step.selector.typename,\n          step.selector.inverted,\n          allQueuesFromSpaces,\n          queueIds,\n        );\n        trace.indexHits = metas.length;\n        trace.indexQueryTime += performance.now() - beginIndexQuery;\n\n        if (this._ctx.disposed) {\n          return { workingSet, trace };\n        }\n\n        const documentLoadStart = performance.now();\n        const results = await this._loadDocumentsAfterSqlQuery(metas);\n        trace.documentsLoaded += results.length;\n        trace.documentLoadTime += performance.now() - documentLoadStart;\n\n        workingSet.push(...results.filter(isNonNullable));\n        trace.objectCount = workingSet.length;\n\n        break;\n      }\n\n      case 'TimestampSelector': {\n        const beginIndexQuery = performance.now();\n        const queueIds = extractQueueIds(queues);\n        const metas = await this._runInRuntime(\n          this._indexEngine.queryByTimeRange({\n            spaceIds: spaces,\n            updatedAfter: step.selector.updatedAfter,\n            updatedBefore: step.selector.updatedBefore,\n            createdAfter: step.selector.createdAfter,\n            createdBefore: step.selector.createdBefore,\n            includeAllQueues: allQueuesFromSpaces,\n            queueIds,\n          }),\n        );\n        trace.indexHits = metas.length;\n        trace.indexQueryTime += performance.now() - beginIndexQuery;\n\n        if (this._ctx.disposed) {\n          return { workingSet, trace };\n        }\n\n        const documentLoadStart = performance.now();\n        const results = await this._loadDocumentsAfterSqlQuery(metas);\n        trace.documentsLoaded += results.length;\n        trace.documentLoadTime += performance.now() - documentLoadStart;\n\n        workingSet.push(...results.filter(isNonNullable));\n        trace.objectCount = workingSet.length;\n\n        break;\n      }\n\n      case 'TextSelector': {\n        // TODO(dmaretskyi): type + FTS queries would be very common so we should support those, maybe chunk the fts index.\n        // TODO(dmaretskyi): nice to have matched text snippets/highlighting.\n        if (step.selector.searchKind === 'vector') {\n          // Vector search is not currently supported.\n          log.warn('Vector search is not supported');\n          break;\n        }\n\n        // Full-text search using SQLite FTS5.\n        const beginIndexQuery = performance.now();\n        invariant(spaces.length <= 1, 'Multiple spaces are not supported for full-text search');\n        const queueIds = extractQueueIds(queues);\n        const textResults = await this._runInRuntime(\n          this._indexEngine.queryText({\n            query: step.selector.text,\n            spaceId: spaces,\n            includeAllQueues: allQueuesFromSpaces,\n            queueIds,\n          }),\n        );\n        trace.indexHits = textResults.length;\n        trace.indexQueryTime += performance.now() - beginIndexQuery;\n\n        if (this._ctx.disposed) {\n          return { workingSet, trace };\n        }\n\n        // Load documents from the results.\n        const documentLoadStart = performance.now();\n\n        // Separate queue items from space items.\n        const queueResults = textResults.filter((r) => r.queueId);\n        const spaceResults = textResults.filter((r) => !r.queueId);\n\n        // Build a map from recordId to rank for all FTS results.\n        const rankMap = new Map(textResults.map((r) => [r.recordId, r.rank]));\n\n        // Load queue items from indexed snapshots.\n        let queueItems: QueryItem[] = [];\n        if (queueResults.length > 0) {\n          const snapshots = await this._runInRuntime(\n            this._indexEngine.querySnapshotsJSON(queueResults.map((r) => r.recordId)),\n          );\n          const snapshotMap = new Map(snapshots.map((s) => [s.recordId, s.snapshot]));\n          queueItems = queueResults\n            .map((result): QueryItem | null => {\n              const snapshot = snapshotMap.get(result.recordId);\n              if (!snapshot || typeof snapshot !== 'object') {\n                return null;\n              }\n              return {\n                objectId: result.objectId as ObjectId,\n                spaceId: result.spaceId as SpaceId,\n                queueId: result.queueId as ObjectId,\n                queueNamespace: result.queueNamespace || null,\n                documentId: null,\n                doc: null,\n                data: snapshot as Obj.JSON,\n                rank: rankMap.get(result.recordId) ?? 1,\n              };\n            })\n            .filter(isNonNullable);\n        }\n\n        // Load space items from documents.\n        const spaceItems = await Promise.all(\n          spaceResults.map(async (result): Promise<QueryItem | null> => {\n            const dxn = DXN.fromLocalObjectId(result.objectId);\n            const item = await this._loadFromDXN(dxn, { sourceSpaceId: result.spaceId as SpaceId });\n            if (item) {\n              // Override the default rank with the FTS rank.\n              item.rank = rankMap.get(result.recordId) ?? 1;\n            }\n            return item;\n          }),\n        );\n\n        const items = [...queueItems, ...spaceItems.filter(isNonNullable)];\n        trace.documentsLoaded += items.length;\n        trace.documentLoadTime += performance.now() - documentLoadStart;\n\n        workingSet.push(\n          ...items.filter((item) => {\n            if (spaces.includes(item.spaceId)) {\n              return true;\n            }\n            if (item.queueId) {\n              return queues.some((dxn) => {\n                const { queueId, spaceId } = DXN.parse(dxn).asQueueDXN()!;\n                return queueId === item.queueId && spaceId === item.spaceId;\n              });\n            }\n            return false;\n          }),\n        );\n        trace.objectCount = workingSet.length;\n        break;\n      }\n\n      default:\n        throw new Error(`Unknown selector type: ${(step.selector as any)._tag}`);\n    }\n\n    // Apply limit if specified on the select step.\n    if (step.limit !== undefined && workingSet.length > step.limit) {\n      workingSet = workingSet.slice(0, step.limit);\n      trace.objectCount = workingSet.length;\n    }\n\n    return { workingSet, trace };\n  }\n\n  private async _execFilterStep(step: QueryPlan.FilterStep, workingSet: QueryItem[]): Promise<StepExecutionResult> {\n    if (step.filter.type === 'child-of') {\n      return this._execChildOfFilterStep(step.filter, workingSet);\n    }\n\n    const timestampParams = extractTimestampParams(step.filter);\n    if (timestampParams !== null) {\n      return this._execTimestampFilterStep(step, workingSet, timestampParams);\n    }\n\n    if (filterContainsTimestamp(step.filter)) {\n      throw new QueryError({\n        message:\n          'Timestamp filter in unsupported composition (not, or). Use Filter.updated/Filter.created with explicit range instead.',\n        context: {},\n      });\n    }\n\n    const result = workingSet.filter((item) => {\n      if (item.doc) {\n        return filterMatchObject(step.filter, {\n          id: item.objectId,\n          spaceId: item.spaceId,\n          doc: item.doc,\n        });\n      } else if (item.data) {\n        return filterMatchObjectJSON(step.filter, item.data);\n      } else {\n        return false;\n      }\n    });\n\n    return {\n      workingSet: result,\n      trace: {\n        ...ExecutionTrace.makeEmpty(),\n        name: 'Filter',\n        details: JSON.stringify(step.filter),\n        objectCount: result.length,\n      },\n    };\n  }\n\n  private async _execTimestampFilterStep(\n    step: QueryPlan.FilterStep,\n    workingSet: QueryItem[],\n    params: { updatedAfter?: number; updatedBefore?: number; createdAfter?: number; createdBefore?: number },\n  ): Promise<StepExecutionResult> {\n    const spaces = [...new Set(workingSet.map((item) => item.spaceId).filter(isNonNullable))];\n    const metas = await this._runInRuntime(\n      this._indexEngine.queryByTimeRange({\n        spaceIds: spaces,\n        ...params,\n        includeAllQueues: false,\n        queueIds: [],\n      }),\n    );\n    const matchingIds = new Set(metas.map((m) => m.objectId));\n    const result = workingSet.filter((item) => matchingIds.has(item.objectId));\n    return {\n      workingSet: result,\n      trace: {\n        ...ExecutionTrace.makeEmpty(),\n        name: 'Filter(timestamp)',\n        details: JSON.stringify(params),\n        objectCount: result.length,\n      },\n    };\n  }\n\n  private async _execFilterDeletedStep(\n    step: QueryPlan.FilterDeletedStep,\n    workingSet: QueryItem[],\n  ): Promise<StepExecutionResult> {\n    const expected = step.mode === 'only-deleted';\n\n    const deletedState = workingSet.map((item) => QueryItem.isDeleted(item));\n    await Promise.all(\n      workingSet.map(async (item, index) => {\n        if (deletedState[index]) {\n          return;\n        }\n        deletedState[index] ||= await this._getTransitiveDeletionState(item, MAX_DEPTH_FOR_DELETION_TRACING);\n      }),\n    );\n\n    const result = workingSet.filter((item, index) => deletedState[index] === expected);\n\n    // TODO(dmaretskyi): How do we handle items with parents and cascade deletions? -- perhaps we forbid queue items from having parents -- i.e. queue is their parent.\n    return {\n      workingSet: result,\n      trace: {\n        ...ExecutionTrace.makeEmpty(),\n        name: 'FilterDeleted',\n        details: step.mode,\n        objectCount: result.length,\n      },\n    };\n  }\n\n  private async _execChildOfFilterStep(\n    filter: QueryAST.FilterChildOf,\n    workingSet: QueryItem[],\n  ): Promise<StepExecutionResult> {\n    const parentObjectIds = new Set<string>();\n    for (const parentDxnStr of filter.parents) {\n      const dxn = DXN.parse(parentDxnStr);\n      const echoDxn = dxn.asEchoDXN();\n      if (echoDxn) {\n        parentObjectIds.add(echoDxn.echoId);\n      }\n    }\n    const maxDepth = filter.transitive ? MAX_DEPTH_FOR_CHILD_OF_TRACING : 1;\n\n    const matches = await Promise.all(\n      workingSet.map(async (item) => this._isChildOfAny(item, parentObjectIds, maxDepth)),\n    );\n    const result = workingSet.filter((_item, index) => matches[index]);\n\n    return {\n      workingSet: result,\n      trace: {\n        ...ExecutionTrace.makeEmpty(),\n        name: 'Filter(child-of)',\n        details: JSON.stringify({ parents: filter.parents, transitive: filter.transitive }),\n        objectCount: result.length,\n      },\n    };\n  }\n\n  /**\n   * Checks if an item is a child of any of the given parent object IDs.\n   * Walks up the parent chain (and feed ownership for queue items) until a match is found or depth is exhausted.\n   */\n  private async _isChildOfAny(item: QueryItem, parentObjectIds: Set<string>, remainingDepth: number): Promise<boolean> {\n    if (remainingDepth <= 0) {\n      return false;\n    }\n\n    const parentRefs: { dxnStr: string; objectId: string }[] = [];\n\n    const directParent = QueryItem.getParent(item);\n    if (directParent) {\n      const echoDxn = DXN.parse(directParent).asEchoDXN();\n      if (echoDxn) {\n        parentRefs.push({ dxnStr: directParent, objectId: echoDxn.echoId });\n      }\n    }\n\n    if (item.queueId && !directParent) {\n      parentRefs.push({\n        dxnStr: DXN.fromSpaceAndObjectId(item.spaceId, item.queueId).toString(),\n        objectId: item.queueId,\n      });\n    }\n\n    for (const ref of parentRefs) {\n      if (parentObjectIds.has(ref.objectId)) {\n        return true;\n      }\n    }\n\n    for (const ref of parentRefs) {\n      const parentItem = await this._loadFromDXN(DXN.parse(ref.dxnStr), { sourceSpaceId: item.spaceId });\n      if (parentItem && (await this._isChildOfAny(parentItem, parentObjectIds, remainingDepth - 1))) {\n        return true;\n      }\n    }\n\n    return false;\n  }\n\n  // TODO(dmaretskyi): This needs to be completed.\n  private async _execTraverseStep(step: QueryPlan.TraverseStep, workingSet: QueryItem[]): Promise<StepExecutionResult> {\n    const trace: ExecutionTrace = {\n      ...ExecutionTrace.makeEmpty(),\n      name: 'Traverse',\n      details: JSON.stringify(step.traversal),\n    };\n\n    const newWorkingSet: QueryItem[] = [];\n\n    switch (step.traversal._tag) {\n      case 'ReferenceTraversal': {\n        switch (step.traversal.direction) {\n          case 'outgoing': {\n            invariant(step.traversal.property !== null, 'Outgoing reference traversal requires a property');\n            const property = EscapedPropPath.unescape(step.traversal.property);\n\n            const refs = workingSet\n              .flatMap((item) => {\n                const ref = QueryItem.getProperty(item, property);\n                const refs = Array.isArray(ref) ? ref : [ref];\n                return refs.map((ref) => {\n                  try {\n                    return isEncodedReference(ref)\n                      ? {\n                          ref: DXN.parse(ref['/']),\n                          spaceId: item.spaceId,\n                        }\n                      : null;\n                  } catch {\n                    log.warn('invalid reference', { ref: ref['/'] });\n                    return null;\n                  }\n                });\n              })\n              .filter(isNonNullable);\n\n            const beginLoad = performance.now();\n            const items = await Promise.all(\n              refs.map(({ ref, spaceId }) => this._loadFromDXN(ref, { sourceSpaceId: spaceId })),\n            );\n            trace.documentLoadTime += performance.now() - beginLoad;\n\n            newWorkingSet.push(...items.filter(isNonNullable));\n            trace.objectCount = newWorkingSet.length;\n\n            break;\n          }\n          case 'incoming': {\n            const beginIndexQuery = performance.now();\n            const metas = await this._queryIncomingReferencesFromSqlIndex(workingSet, step.traversal.property);\n            trace.indexHits += metas.length;\n            trace.indexQueryTime += performance.now() - beginIndexQuery;\n\n            const documentLoadStart = performance.now();\n            const results = await this._loadDocumentsAfterSqlQuery(metas);\n            trace.documentsLoaded += results.length;\n            trace.documentLoadTime += performance.now() - documentLoadStart;\n\n            newWorkingSet.push(...results.filter(isNonNullable));\n            trace.objectCount = newWorkingSet.length;\n\n            break;\n          }\n        }\n        break;\n      }\n      case 'RelationTraversal': {\n        switch (step.traversal.direction) {\n          case 'relation-to-source':\n          case 'relation-to-target': {\n            const refs = workingSet\n              .map((item) => {\n                const dxn =\n                  step.traversal.direction === 'relation-to-source'\n                    ? QueryItem.getRelationSource(item)\n                    : QueryItem.getRelationTarget(item);\n                if (!dxn) {\n                  return null;\n                }\n                try {\n                  return {\n                    ref: DXN.parse(dxn),\n                    spaceId: item.spaceId,\n                  };\n                } catch {\n                  log.warn('invalid reference', { ref: dxn });\n                  return null;\n                }\n              })\n              .filter(isNonNullable);\n\n            const beginLoad = performance.now();\n            const items = await Promise.all(\n              refs.map(({ ref, spaceId }) => this._loadFromDXN(ref, { sourceSpaceId: spaceId })),\n            );\n            trace.documentLoadTime += performance.now() - beginLoad;\n\n            newWorkingSet.push(...items.filter(isNonNullable));\n            trace.objectCount = newWorkingSet.length;\n\n            break;\n          }\n\n          case 'source-to-relation':\n          case 'target-to-relation': {\n            const beginIndexQuery = performance.now();\n            const metas = await this._queryRelationsFromSqlIndex(\n              workingSet,\n              step.traversal.direction === 'source-to-relation' ? 'source' : 'target',\n            );\n            trace.indexHits += metas.length;\n            trace.indexQueryTime += performance.now() - beginIndexQuery;\n\n            const documentLoadStart = performance.now();\n            const results = await this._loadDocumentsAfterSqlQuery(metas);\n            trace.documentsLoaded += results.length;\n            trace.documentLoadTime += performance.now() - documentLoadStart;\n\n            newWorkingSet.push(...results.filter(isNonNullable));\n            trace.objectCount = newWorkingSet.length;\n\n            break;\n          }\n        }\n        break;\n      }\n      case 'HierarchyTraversal': {\n        switch (step.traversal.direction) {\n          case 'to-parent': {\n            // Traverse from child to parent using the parent reference in the document.\n            const refs = workingSet\n              .map((item) => {\n                if (!item.doc) {\n                  return null; // TODO(dmaretskyi): Queue items not supported here.\n                }\n                const ref = ObjectStructure.getParent(item.doc);\n                if (!EncodedReference.isEncodedReference(ref)) {\n                  return null;\n                }\n                try {\n                  return {\n                    ref: DXN.parse(ref['/']),\n                    spaceId: item.spaceId,\n                  };\n                } catch {\n                  log.warn('invalid parent reference', { ref: ref['/'] });\n                  return null;\n                }\n              })\n              .filter(isNonNullable);\n\n            const beginLoad = performance.now();\n            const items = await Promise.all(\n              refs.map(({ ref, spaceId }) => this._loadFromDXN(ref, { sourceSpaceId: spaceId })),\n            );\n            trace.documentLoadTime += performance.now() - beginLoad;\n\n            newWorkingSet.push(...items.filter(isNonNullable));\n            trace.objectCount = newWorkingSet.length;\n            break;\n          }\n\n          case 'to-children': {\n            // Traverse from parent to children using the SQL index.\n            // Covers both standard parent/child hierarchy (via the `parent` field) and\n            // feed -> queue items (via the `queueId` field — a feed's queue id matches the feed's object id).\n            // Group working set by spaceId.\n            const bySpace = new Map<SpaceId, ObjectId[]>();\n            for (const item of workingSet) {\n              const existing = bySpace.get(item.spaceId);\n              if (existing) {\n                existing.push(item.objectId);\n              } else {\n                bySpace.set(item.spaceId, [item.objectId]);\n              }\n            }\n\n            const beginIndexQuery = performance.now();\n            const allMetas: ObjectMeta[] = [];\n            for (const [spaceId, parentIds] of bySpace) {\n              const children = await this._runInRuntime(\n                this._indexEngine.queryChildren({ spaceId: [spaceId], parentIds }),\n              );\n              allMetas.push(...children);\n            }\n            trace.indexHits += allMetas.length;\n            trace.indexQueryTime += performance.now() - beginIndexQuery;\n\n            const documentLoadStart = performance.now();\n            const results = await this._loadDocumentsAfterSqlQuery(allMetas);\n            trace.documentsLoaded += results.filter(isNonNullable).length;\n            trace.documentLoadTime += performance.now() - documentLoadStart;\n\n            newWorkingSet.push(...results.filter(isNonNullable));\n            trace.objectCount = newWorkingSet.length;\n            break;\n          }\n        }\n        break;\n      }\n      default:\n        throw new Error(`Unknown traversal type: ${(step.traversal as any)._tag}`);\n    }\n\n    return { workingSet: newWorkingSet, trace };\n  }\n\n  private async _execUnionStep(step: QueryPlan.UnionStep, workingSet: QueryItem[]): Promise<StepExecutionResult> {\n    const results = new Map<ObjectId, QueryItem>();\n\n    const resultSets = await Promise.all(step.plans.map((plan) => this._execPlan(plan, [...workingSet])));\n\n    const trace: ExecutionTrace = {\n      ...ExecutionTrace.makeEmpty(),\n      name: 'Union',\n    };\n\n    // NOTE: Doing insertion after execution to ensure deterministic results. Probably not needed.\n    for (const resultSet of resultSets) {\n      for (const item of resultSet.workingSet) {\n        // Could be duplicate object ids in different spaces or in different epochs of the same space.\n        results.set(compositeKey(item.spaceId, String(item.documentId), item.objectId), item);\n      }\n      trace.children.push(resultSet.trace);\n    }\n\n    return {\n      workingSet: [...results.values()],\n      trace,\n    };\n  }\n\n  private async _execSetDifferenceStep(\n    step: QueryPlan.SetDifferenceStep,\n    workingSet: QueryItem[],\n  ): Promise<StepExecutionResult> {\n    const trace: ExecutionTrace = {\n      ...ExecutionTrace.makeEmpty(),\n      name: 'SetDifference',\n    };\n\n    const sourceResult = await this._execPlan(step.source, [...workingSet]);\n    const excludeResult = await this._execPlan(step.exclude, [...workingSet]);\n    trace.children.push(sourceResult.trace, excludeResult.trace);\n\n    return {\n      workingSet: sourceResult.workingSet.filter((item) => {\n        const index = excludeResult.workingSet.findIndex((i) => i.objectId === item.objectId);\n        return index === -1;\n      }),\n      trace,\n    };\n  }\n\n  private async _execOrderStep(step: QueryPlan.OrderStep, workingSet: QueryItem[]): Promise<StepExecutionResult> {\n    let sortedWorkingSet = [...workingSet].sort((a, b) => this._compareMultiOrder(a, b, step.order));\n\n    // Apply limit if specified on the order step.\n    if (step.limit !== undefined && sortedWorkingSet.length > step.limit) {\n      sortedWorkingSet = sortedWorkingSet.slice(0, step.limit);\n    }\n\n    return {\n      workingSet: sortedWorkingSet,\n      trace: {\n        ...ExecutionTrace.makeEmpty(),\n        name: 'Order',\n        details: JSON.stringify({ order: step.order, limit: step.limit }),\n        objectCount: sortedWorkingSet.length,\n      },\n    };\n  }\n\n  private async _execLimitStep(step: QueryPlan.LimitStep, workingSet: QueryItem[]): Promise<StepExecutionResult> {\n    const limitedWorkingSet = workingSet.slice(0, step.limit);\n\n    return {\n      workingSet: limitedWorkingSet,\n      trace: {\n        ...ExecutionTrace.makeEmpty(),\n        name: 'Limit',\n        details: JSON.stringify({ limit: step.limit }),\n        objectCount: limitedWorkingSet.length,\n      },\n    };\n  }\n\n  private _compareMultiOrder(a: QueryItem, b: QueryItem, orders: readonly QueryAST.Order[]): number {\n    // Short circuit for common cases.\n    if (orders.length === 0) {\n      return 0;\n    } else if (orders.length === 1) {\n      return this._compareByOrder(a, b, orders[0]);\n    }\n\n    for (const order of orders) {\n      const comparison = this._compareByOrder(a, b, order);\n      if (comparison !== 0) {\n        return comparison;\n      }\n    }\n    return 0;\n  }\n\n  private _compareByOrder(a: QueryItem, b: QueryItem, order: QueryAST.Order): number {\n    switch (order.kind) {\n      case 'natural':\n        return a.objectId.localeCompare(b.objectId);\n      case 'property': {\n        const comparison = this._compareByProperty(a, b, order.property);\n        return order.direction === 'desc' ? -comparison : comparison;\n      }\n      case 'rank': {\n        // Higher rank = better match. By default, descending order (best first).\n        const comparison = a.rank - b.rank;\n        return order.direction === 'desc' ? -comparison : comparison;\n      }\n      default:\n        // Should never reach here with proper TypeScript types.\n        return 0;\n    }\n  }\n\n  private _compareByProperty(a: QueryItem, b: QueryItem, property: string): number {\n    const aValue = QueryItem.getProperty(a, [property]);\n    const bValue = QueryItem.getProperty(b, [property]);\n\n    // Both null or undefined\n    if (aValue == null && bValue == null) {\n      return 0;\n    }\n\n    // Only a is null/undefined\n    if (aValue == null) {\n      return 1;\n    }\n\n    // Only b is null/undefined\n    if (bValue == null) {\n      return -1;\n    }\n\n    // Both strings\n    if (typeof aValue === 'string' && typeof bValue === 'string') {\n      return aValue.localeCompare(bValue);\n    }\n\n    // Both numbers\n    if (typeof aValue === 'number' && typeof bValue === 'number') {\n      return aValue - bValue;\n    }\n\n    // Both booleans\n    if (typeof aValue === 'boolean' && typeof bValue === 'boolean') {\n      return aValue === bValue ? 0 : aValue ? 1 : -1;\n    }\n\n    // Fallback: convert to strings and compare\n    return String(aValue).localeCompare(String(bValue));\n  }\n\n  private async _runInRuntime<T>(effect: Effect.Effect<T, unknown, SqlClient.SqlClient>): Promise<T> {\n    const runtimeProvider = this._runtime;\n    invariant(runtimeProvider, 'SQL runtime is required.');\n    const runtime = await runAndForwardErrors(runtimeProvider);\n    return await unwrapExit(await effect.pipe(Runtime.runPromiseExit(runtime)));\n  }\n\n  private async _queryAllFromSqlIndex(\n    spaceIds: readonly SpaceId[],\n    includeAllQueues: boolean,\n    queueIds: readonly ObjectId[] | null,\n  ): Promise<readonly ObjectMeta[]> {\n    return await this._runInRuntime(this._indexEngine.queryAll({ spaceIds, includeAllQueues, queueIds }));\n  }\n\n  private async _queryTypesFromSqlIndex(\n    spaceIds: readonly SpaceId[],\n    typeDxns: readonly string[],\n    inverted: boolean,\n    includeAllQueues: boolean,\n    queueIds: readonly ObjectId[] | null,\n  ): Promise<readonly ObjectMeta[]> {\n    return await this._runInRuntime(\n      this._indexEngine.queryTypes({ spaceIds, typeDxns, inverted, includeAllQueues, queueIds }),\n    );\n  }\n\n  private async _queryIncomingReferencesFromSqlIndex(\n    workingSet: QueryItem[],\n    property: EscapedPropPath | null,\n  ): Promise<readonly ObjectMeta[]> {\n    const anchorDxns = workingSet.map((item) => DXN.fromLocalObjectId(item.objectId).toString());\n    const rows: readonly ReverseRef[] = (\n      await Promise.all(\n        anchorDxns.map((targetDxn) => this._runInRuntime(this._indexEngine.queryReverseRef({ targetDxn }))),\n      )\n    ).flat();\n\n    const recordIds = rows\n      .filter((row) => {\n        if (property === null) {\n          return true;\n        }\n\n        const queryPath = EscapedPropPath.unescape(property);\n        const rowPath = EscapedPropPath.unescape(row.propPath);\n        return QueryExecutor._matchesReferencePropertyPath(rowPath, queryPath);\n      })\n      .map((row) => row.recordId);\n\n    const uniqueRecordIds = Array.from(new Set<number>(recordIds));\n    return await this._runInRuntime(this._indexEngine.lookupByRecordIds(uniqueRecordIds));\n  }\n\n  /**\n   * Matches a reverse-reference row path against a query property path.\n   * Allows numeric segments in the row path (array indices) that are not present in the query.\n   *\n   * Examples:\n   * - query: ['assignee'] matches row: ['assignee'] and ['assignee', '0'].\n   * - query: ['items', 'assignee'] matches row: ['items', '0', 'assignee'].\n   * - query: ['a', 'b'] does NOT match row: ['a'].\n   * - query: ['a'] does NOT match row: ['a', 'b'].\n   */\n  private static _matchesReferencePropertyPath(rowPath: readonly string[], queryPath: readonly string[]): boolean {\n    const isNumericSegment = (segment: string) => /^[0-9]+$/.test(segment);\n\n    let i = 0; // queryPath index.\n    let j = 0; // rowPath index.\n\n    while (i < queryPath.length && j < rowPath.length) {\n      if (rowPath[j] === queryPath[i]) {\n        i++;\n        j++;\n        continue;\n      }\n\n      // Row may contain array indices that aren't present in the query path.\n      if (isNumericSegment(rowPath[j])) {\n        j++;\n        continue;\n      }\n\n      return false;\n    }\n\n    // Must consume full query path.\n    if (i !== queryPath.length) {\n      return false;\n    }\n\n    // Any remaining row segments must be numeric (array indices).\n    for (; j < rowPath.length; j++) {\n      if (!isNumericSegment(rowPath[j])) {\n        return false;\n      }\n    }\n\n    return true;\n  }\n\n  private async _queryRelationsFromSqlIndex(\n    workingSet: QueryItem[],\n    endpoint: 'source' | 'target',\n  ): Promise<readonly ObjectMeta[]> {\n    const anchorDxns = workingSet.map((item) => DXN.fromLocalObjectId(item.objectId).toString());\n    return await this._runInRuntime(this._indexEngine.queryRelations({ endpoint, anchorDxns }));\n  }\n\n  private async _loadDocumentsAfterSqlQuery(metas: readonly ObjectMeta[]): Promise<(QueryItem | null)[]> {\n    const snapshotMap = await this._loadQueueSnapshotMap(metas);\n    return await Promise.all(\n      metas.map(async (meta) => {\n        // Branch 1: Document-backed object.\n        if (meta.documentId) {\n          return this._loadFromAutomerge(meta);\n        }\n\n        // Branch 2: Queue-backed object.\n        if (meta.queueId) {\n          return this._loadFromQueue(meta, snapshotMap);\n        }\n\n        return null;\n      }),\n    );\n  }\n\n  private async _loadQueueSnapshotMap(metas: readonly ObjectMeta[]): Promise<Map<number, unknown>> {\n    const queueMetas = metas.filter((meta) => !meta.documentId && !!meta.queueId);\n    if (queueMetas.length === 0) {\n      return new Map();\n    }\n\n    const snapshots = await this._runInRuntime(\n      this._indexEngine.querySnapshotsJSON(queueMetas.map((meta) => meta.recordId)),\n    );\n    return new Map(snapshots.map((s) => [s.recordId, s.snapshot]));\n  }\n\n  /**\n   * Loads a queue-backed object from an indexed snapshot (by `recordId`).\n   * Returns `null` when the snapshot is missing or is not a JSON object.\n   */\n  private _loadFromQueue(meta: ObjectMeta, snapshotMap: Map<number, unknown>): QueryItem | null {\n    const snapshot = snapshotMap.get(meta.recordId);\n    if (!snapshot || typeof snapshot !== 'object') {\n      return null;\n    }\n\n    return {\n      objectId: meta.objectId as ObjectId,\n      spaceId: meta.spaceId as SpaceId,\n      queueId: meta.queueId as ObjectId,\n      queueNamespace: meta.queueNamespace || null,\n      documentId: null,\n      doc: null,\n      data: snapshot as Obj.JSON,\n      rank: 1,\n    };\n  }\n\n  /**\n   * Loads a document-backed object from an Automerge `DatabaseDirectory`.\n   * Returns `null` if the document can't be loaded, the inline object isn't present, or if the meta does not have a\n   * document id (e.g. queue-backed objects).\n   */\n  private async _loadFromAutomerge(meta: ObjectMeta): Promise<QueryItem | null> {\n    if (!meta.documentId) {\n      return null;\n    }\n    const handle = await this._automergeHost.loadDoc<DatabaseDirectory>(this._ctx, meta.documentId as DocumentId, {\n      fetchFromNetwork: false,\n    });\n    const doc = handle.doc();\n    if (!doc) {\n      return null;\n    }\n    const object = DatabaseDirectory.getInlineObject(doc, meta.objectId);\n    if (!object) {\n      return null;\n    }\n    return {\n      objectId: meta.objectId,\n      documentId: meta.documentId as DocumentId,\n      spaceId: meta.spaceId as SpaceId,\n      queueId: null,\n      queueNamespace: null,\n      doc: object,\n      data: null,\n      rank: 1,\n    };\n  }\n\n  private async _loadFromDXN(dxn: DXN, { sourceSpaceId }: { sourceSpaceId: SpaceId }): Promise<QueryItem | null> {\n    switch (dxn.kind) {\n      case DXN.kind.ECHO: {\n        const echoDxn = dxn.asEchoDXN();\n        if (!echoDxn) {\n          log.warn('unable to resolve DXN', { dxn });\n          return null;\n        }\n\n        const spaceId = echoDxn.spaceId ?? sourceSpaceId;\n\n        const spaceRoot = this._spaceStateManager.getRootBySpaceId(spaceId);\n        if (!spaceRoot) {\n          log.warn('no space state found for', { spaceId });\n          return null;\n        }\n        const dbDirectory = spaceRoot.doc();\n        if (!dbDirectory) {\n          log.warn('no space state found for', { spaceId });\n          return null;\n        }\n\n        const inlineObject = DatabaseDirectory.getInlineObject(dbDirectory, echoDxn.echoId);\n        if (inlineObject) {\n          return {\n            objectId: echoDxn.echoId,\n            documentId: spaceRoot.documentId,\n            spaceId,\n            queueId: null,\n            queueNamespace: null,\n            data: null,\n            doc: inlineObject,\n            rank: 1,\n          };\n        }\n\n        const link = DatabaseDirectory.getLink(dbDirectory, echoDxn.echoId);\n        if (!link) {\n          return null;\n        }\n\n        const handle = await this._automergeHost.loadDoc<DatabaseDirectory>(this._ctx, link as AutomergeUrl, {\n          fetchFromNetwork: false,\n        });\n        const doc = handle.doc();\n        if (!doc) {\n          return null;\n        }\n\n        const object = DatabaseDirectory.getInlineObject(doc, echoDxn.echoId);\n        if (!object) {\n          return null;\n        }\n\n        return {\n          objectId: echoDxn.echoId,\n          documentId: handle.documentId,\n          spaceId,\n          queueId: null,\n          queueNamespace: null,\n          data: null,\n          doc: object,\n          rank: 1,\n        };\n        break;\n      }\n      case DXN.kind.QUEUE: {\n        const queueDxn = dxn.asQueueDXN();\n        if (!queueDxn || !queueDxn.objectId) {\n          log.warn('unable to resolve queue DXN', { dxn });\n          return null;\n        }\n\n        const { spaceId, queueId, objectId } = queueDxn;\n        const meta = await this._runInRuntime(\n          this._indexEngine.lookupByObjectId({\n            objectId,\n            spaceId,\n            queueId,\n          }),\n        );\n        if (!meta) {\n          return null;\n        }\n\n        const snapshotMap = await this._loadQueueSnapshotMap([meta]);\n        return this._loadFromQueue(meta, snapshotMap);\n      }\n      default: {\n        log.warn('unable to resolve DXN', { dxn });\n        return null;\n      }\n    }\n  }\n\n  private async _getTransitiveDeletionState(item: QueryItem, remainingDepth: number): Promise<boolean> {\n    const strongDeps = [\n      QueryItem.getParent(item),\n      QueryItem.getRelationSource(item),\n      QueryItem.getRelationTarget(item),\n    ].filter((x) => x !== undefined);\n\n    if (strongDeps.length === 0) {\n      return false;\n    }\n\n    // TODO(dmaretskyi): This could be optimized to bail early if any of the dependencies are deleted.\n    const strongDepStates = await Promise.all(\n      strongDeps.map(async (dxn) => {\n        const dep = await this._loadFromDXN(DXN.parse(dxn), { sourceSpaceId: item.spaceId });\n        if (!dep) {\n          return false;\n        }\n        if (QueryItem.isDeleted(dep)) {\n          return true;\n        }\n        if (remainingDepth > 0) {\n          return this._getTransitiveDeletionState(dep, remainingDepth - 1);\n        }\n        return false;\n      }),\n    );\n\n    return strongDepStates.some((x) => x);\n  }\n}\n\nconst extractQueueIds = (queues: readonly DXN.String[]): ObjectId[] | null => {\n  if (queues.length === 0) {\n    return null;\n  }\n  return queues.map((dxnStr) => DXN.parse(dxnStr).asQueueDXN()?.queueId).filter(Boolean) as ObjectId[];\n};\n\n/**\n * Extract timestamp parameters from a filter AST node.\n * Returns null if the filter doesn't contain timestamp nodes.\n */\nconst extractTimestampParams = (\n  filter: QueryAST.Filter,\n): { updatedAfter?: number; updatedBefore?: number; createdAfter?: number; createdBefore?: number } | null => {\n  const collect = (f: QueryAST.Filter): QueryAST.FilterTimestamp[] => {\n    if (f.type === 'timestamp') {\n      return [f];\n    }\n    if (f.type === 'and') {\n      return f.filters.flatMap(collect);\n    }\n    return [];\n  };\n\n  const timestamps = collect(filter);\n  if (timestamps.length === 0) {\n    return null;\n  }\n\n  const params: { updatedAfter?: number; updatedBefore?: number; createdAfter?: number; createdBefore?: number } = {};\n  for (const ts of timestamps) {\n    if (ts.field === 'updatedAt' && (ts.operator === 'gt' || ts.operator === 'gte')) {\n      params.updatedAfter = ts.value;\n    } else if (ts.field === 'updatedAt' && (ts.operator === 'lt' || ts.operator === 'lte')) {\n      params.updatedBefore = ts.value;\n    } else if (ts.field === 'createdAt' && (ts.operator === 'gt' || ts.operator === 'gte')) {\n      params.createdAfter = ts.value;\n    } else if (ts.field === 'createdAt' && (ts.operator === 'lt' || ts.operator === 'lte')) {\n      params.createdBefore = ts.value;\n    }\n  }\n  return params;\n};\n\nfunction filterContainsTimestamp(filter: QueryAST.Filter): boolean {\n  if (filter.type === 'timestamp') {\n    return true;\n  }\n  if (filter.type === 'and' || filter.type === 'or') {\n    return filter.filters.some(filterContainsTimestamp);\n  }\n  if (filter.type === 'not') {\n    return filterContainsTimestamp(filter.filter);\n  }\n  return false;\n}\n", "//\n// Copyright 2025 DXOS.org\n//\n\nimport { BaseError } from '@dxos/errors';\n\nexport class QueryError extends BaseError.extend('QueryError') {}\n\nexport class InvalidQueryError extends QueryError.extend('InvalidQueryError') {}\n", "//\n// Copyright 2025 DXOS.org\n//\n\nimport { Order, Query } from '@dxos/echo';\nimport { QueryAST } from '@dxos/echo-protocol';\nimport { invariant } from '@dxos/invariant';\nimport type { DXN } from '@dxos/keys';\n\nimport { QueryError } from './errors';\nimport { QueryPlan } from './plan';\n\n/**\n * Creates a QueryError with \"Query too complex\" message and includes the prettified query in the context.\n */\nconst queryTooComplexError = (query: QueryAST.Query | null): QueryError => {\n  if (query === null) {\n    return new QueryError({\n      message: 'Query too complex',\n      context: { query: null },\n    });\n  }\n  const prettyQuery = Query.pretty(Query.fromAst(query));\n  return new QueryError({\n    message: `Query too complex: ${prettyQuery}`,\n    context: { query, prettyQuery },\n  });\n};\n\nexport type QueryPlannerOptions = {\n  defaultTextSearchKind: QueryPlan.TextSearchKind;\n};\n\nconst DEFAULT_OPTIONS: QueryPlannerOptions = {\n  defaultTextSearchKind: 'full-text',\n};\n\n/**\n * Constructs an optimized query plan.\n */\n// TODO(dmaretskyi): Implement inefficient versions of complex queries.\nexport class QueryPlanner {\n  private readonly _options: QueryPlannerOptions;\n\n  constructor(options?: Partial<QueryPlannerOptions>) {\n    this._options = {\n      ...DEFAULT_OPTIONS,\n      ...options,\n    };\n  }\n\n  createPlan(query: QueryAST.Query): QueryPlan.Plan {\n    this._validateQueryScoped(query);\n    let plan = this._generate(query, { ...DEFAULT_CONTEXT, originalQuery: query });\n    plan = this._optimizeEmptyFilters(plan);\n    plan = this._optimizeSoloUnions(plan);\n    plan = this._ensureOrderStep(plan);\n    plan = this._optimizeLimits(plan);\n    return plan;\n  }\n\n  private _generate(query: QueryAST.Query, context: GenerationContext): QueryPlan.Plan {\n    switch (query.type) {\n      case 'options':\n        return this._generateOptionsClause(query, context);\n      case 'select':\n        return this._generateSelectClause(query, context);\n      case 'filter':\n        return this._generateFilterClause(query, context);\n      case 'incoming-references':\n        return this._generateIncomingReferencesClause(query, context);\n      case 'relation':\n        return this._generateRelationClause(query, context);\n      case 'relation-traversal':\n        return this._generateRelationTraversalClause(query, context);\n      case 'reference-traversal':\n        return this._generateReferenceTraversalClause(query, context);\n      case 'hierarchy-traversal':\n        return this._generateHierarchyTraversalClause(query, context);\n      case 'union':\n        return this._generateUnionClause(query, context);\n      case 'set-difference':\n        return this._generateSetDifferenceClause(query, context);\n      case 'order':\n        return this._generateOrderClause(query, context);\n      case 'limit':\n        return this._generateLimitClause(query, context);\n      case 'from':\n        return this._generateFromClause(query, context);\n      default:\n        throw new QueryError({\n          message: `Unsupported query type: ${(query as any).type}`,\n          context: { query: context.originalQuery },\n        });\n    }\n  }\n\n  private _generateOptionsClause(query: QueryAST.QueryOptionsClause, context: GenerationContext): QueryPlan.Plan {\n    const newContext = {\n      ...context,\n    };\n    if (query.options.deleted) {\n      newContext.deletedHandling = query.options.deleted;\n    }\n    return this._generate(query.query, newContext);\n  }\n\n  private _generateFromClause(query: QueryAST.QueryFromClause, context: GenerationContext): QueryPlan.Plan {\n    if (query.from._tag === 'scope') {\n      return this._generate(query.query, { ...context, scope: query.from.scope });\n    }\n\n    // Subquery from: flatten by rewriting the outer query's leaf select into a filter on the subquery.\n    const subquery = query.from.query;\n    const rewritten = QueryAST.map(query.query, (node) =>\n      node.type === 'select' ? { type: 'filter', selection: subquery, filter: node.filter } : node,\n    );\n    return this._generate(rewritten, context);\n  }\n\n  private _generateSelectClause(query: QueryAST.QuerySelectClause, context: GenerationContext): QueryPlan.Plan {\n    return this._generateSelectionFromFilter(query.filter, context);\n  }\n\n  // TODO(dmaretskyi): This can be rewritten as a function of (filter[]) -> (selection ? undefined, rest: filter[]) that recurses onto itself.\n  // TODO(dmaretskyi): If the tip of the query ast is a [select, ...filter] shape we can reorder the filters so the query is most efficient.\n  private _generateSelectionFromFilter(filter: QueryAST.Filter, context: GenerationContext): QueryPlan.Plan {\n    switch (filter.type) {\n      // Props\n      case 'object': {\n        if (\n          context.selectionInverted &&\n          filter.id === undefined &&\n          filter.typename === null &&\n          Object.keys(filter.props).length === 0\n        ) {\n          // filter of nothing -> clear working set.\n          return QueryPlan.Plan.make([\n            {\n              _tag: 'ClearWorkingSetStep',\n            },\n            ...this._generateDeletedHandlingSteps(context),\n          ]);\n        }\n        if (context.selectionInverted) {\n          throw queryTooComplexError(context.originalQuery);\n        }\n\n        // Try to utilize indexes during selection, prioritizing selecting by id, then by typename.\n        // After selection, filter out using the remaining predicates.\n        if (filter.id && filter.id?.length > 0) {\n          return QueryPlan.Plan.make([\n            {\n              _tag: 'SelectStep',\n              scope: context.scope,\n              selector: {\n                _tag: 'IdSelector',\n                objectIds: filter.id,\n              },\n            },\n            ...this._generateDeletedHandlingSteps(context),\n            {\n              _tag: 'FilterStep',\n              filter: { ...filter, id: undefined },\n            },\n          ]);\n        } else if (filter.typename) {\n          return QueryPlan.Plan.make([\n            {\n              _tag: 'SelectStep',\n              scope: context.scope,\n              selector: {\n                _tag: 'TypeSelector',\n                typename: [filter.typename as DXN.String],\n                inverted: false,\n              },\n            },\n            ...this._generateDeletedHandlingSteps(context),\n            // TODO(dmaretskyi): Normally we could skip filtering by typename here, but since the index does not separate schema versions, we need to do additional filter to only select the correct version.\n            {\n              _tag: 'FilterStep',\n              filter: { ...filter },\n            },\n          ]);\n        } else {\n          return QueryPlan.Plan.make([\n            {\n              _tag: 'SelectStep',\n              scope: context.scope,\n              selector: {\n                _tag: 'WildcardSelector',\n              },\n            },\n            ...this._generateDeletedHandlingSteps(context),\n            {\n              _tag: 'FilterStep',\n              filter: { ...filter },\n            },\n          ]);\n        }\n      }\n\n      // Tag\n      case 'tag': {\n        return QueryPlan.Plan.make([\n          {\n            _tag: 'SelectStep',\n            scope: context.scope,\n            selector: {\n              _tag: 'WildcardSelector',\n            },\n          },\n          ...this._generateDeletedHandlingSteps(context),\n          {\n            _tag: 'FilterStep',\n            filter: { ...filter },\n          },\n        ]);\n      }\n\n      // Text\n      case 'text-search': {\n        return QueryPlan.Plan.make([\n          {\n            _tag: 'SelectStep',\n            scope: context.scope,\n            selector: {\n              _tag: 'TextSelector',\n              text: filter.text,\n              searchKind: filter.searchKind ?? this._options.defaultTextSearchKind,\n              typename: null,\n            },\n          },\n          ...this._generateDeletedHandlingSteps(context),\n        ]);\n      }\n\n      // Timestamp\n      case 'timestamp': {\n        if (context.selectionInverted) {\n          throw new QueryError({\n            message:\n              'Negated timestamp filters are not supported. Use Filter.updated/Filter.created with the inverted range instead.',\n            context: { query: context.originalQuery },\n          });\n        }\n        return QueryPlan.Plan.make([\n          {\n            _tag: 'SelectStep',\n            scope: context.scope,\n            selector: _timestampFilterToSelector(filter),\n          },\n          ...this._generateDeletedHandlingSteps(context),\n        ]);\n      }\n\n      // ChildOf\n      case 'child-of': {\n        return QueryPlan.Plan.make([\n          {\n            _tag: 'SelectStep',\n            scope: context.scope,\n            selector: {\n              _tag: 'WildcardSelector',\n            },\n          },\n          ...this._generateDeletedHandlingSteps(context),\n          {\n            _tag: 'FilterStep',\n            filter: { ...filter },\n          },\n        ]);\n      }\n\n      // Compare\n      case 'compare':\n        throw queryTooComplexError(context.originalQuery);\n      case 'in':\n        throw queryTooComplexError(context.originalQuery);\n      case 'range':\n        throw queryTooComplexError(context.originalQuery);\n\n      // Boolean\n      case 'not':\n        return this._generateSelectionFromFilter(filter.filter, {\n          ...context,\n          selectionInverted: !context.selectionInverted,\n        });\n      case 'and': {\n        const flatFilters = _flattenAnd(filter.filters);\n        const timestampFilters = flatFilters.filter((f): f is QueryAST.FilterTimestamp => f.type === 'timestamp');\n        const childOfFilters = flatFilters.filter((f): f is QueryAST.FilterChildOf => f.type === 'child-of');\n        const otherFilters = flatFilters.filter((f) => f.type !== 'timestamp' && f.type !== 'child-of');\n\n        if (timestampFilters.length > 0 && context.selectionInverted) {\n          throw new QueryError({\n            message:\n              'Negated timestamp filters are not supported. Use Filter.updated/Filter.created with the inverted range instead.',\n            context: { query: context.originalQuery },\n          });\n        }\n\n        if (timestampFilters.length > 0 && otherFilters.length <= 1 && childOfFilters.length === 0) {\n          const innerFilter = otherFilters[0];\n          const innerPlan = innerFilter\n            ? this._generateSelectionFromFilter(innerFilter, context)\n            : QueryPlan.Plan.make([\n                {\n                  _tag: 'SelectStep',\n                  scope: context.scope,\n                  selector: { _tag: 'WildcardSelector' },\n                },\n                ...this._generateDeletedHandlingSteps(context),\n              ]);\n\n          const selectIdx = innerPlan.steps.findIndex((s) => s._tag === 'SelectStep');\n          if (selectIdx !== -1) {\n            const newSteps = [...innerPlan.steps];\n            newSteps.splice(selectIdx + 1, 0, {\n              _tag: 'FilterStep',\n              filter: { type: 'and', filters: timestampFilters },\n            });\n            return QueryPlan.Plan.make(newSteps);\n          }\n\n          const selector = _mergeTimestampSelectors(timestampFilters.map(_timestampFilterToSelector));\n          return QueryPlan.Plan.make([\n            {\n              _tag: 'SelectStep',\n              scope: context.scope,\n              selector,\n            },\n            ...this._generateDeletedHandlingSteps(context),\n          ]);\n        }\n\n        if (timestampFilters.length > 0 && childOfFilters.length === 0) {\n          throw new QueryError({\n            message:\n              'Timestamp filters can only be combined with a single type or property filter via AND. Split complex filters into a subquery.',\n            context: { query: context.originalQuery },\n          });\n        }\n\n        if (childOfFilters.length > 0) {\n          const remainingFilters = flatFilters.filter((f) => f.type !== 'child-of');\n          const innerPlan =\n            remainingFilters.length === 1\n              ? this._generateSelectionFromFilter(remainingFilters[0], context)\n              : remainingFilters.length > 1\n                ? this._generateSelectionFromFilter({ type: 'and', filters: remainingFilters }, context)\n                : QueryPlan.Plan.make([\n                    {\n                      _tag: 'SelectStep',\n                      scope: context.scope,\n                      selector: { _tag: 'WildcardSelector' },\n                    },\n                    ...this._generateDeletedHandlingSteps(context),\n                  ]);\n\n          const childOfSteps: QueryPlan.Step[] = childOfFilters.map((f) => ({\n            _tag: 'FilterStep' as const,\n            filter: f,\n          }));\n\n          return QueryPlan.Plan.make([...innerPlan.steps, ...childOfSteps]);\n        }\n\n        throw queryTooComplexError(context.originalQuery);\n      }\n      case 'or':\n        // Optimized case\n        if (filter.filters.every(isTrivialTypenameFilter)) {\n          const typenames = filter.filters.map((filter) => {\n            invariant(filter.type === 'object' && filter.typename !== null);\n            return filter.typename;\n          });\n\n          return QueryPlan.Plan.make([\n            {\n              _tag: 'SelectStep',\n              scope: context.scope,\n              selector: {\n                _tag: 'TypeSelector',\n                typename: typenames as DXN.String[],\n                inverted: context.selectionInverted,\n              },\n            },\n            ...this._generateDeletedHandlingSteps(context),\n            {\n              _tag: 'FilterStep',\n              filter: { ...filter },\n            },\n          ]);\n        } else {\n          throw queryTooComplexError(context.originalQuery);\n        }\n\n      default:\n        throw new QueryError({\n          message: `Unsupported filter type: ${(filter as any).type}`,\n          context: { query: context.originalQuery },\n        });\n    }\n  }\n\n  private _generateDeletedHandlingSteps(context: GenerationContext): QueryPlan.Step[] {\n    switch (context.deletedHandling) {\n      case 'include':\n        return [];\n      case 'exclude':\n        return [\n          {\n            _tag: 'FilterDeletedStep',\n            mode: 'only-non-deleted',\n          },\n        ];\n      case 'only':\n        return [\n          {\n            _tag: 'FilterDeletedStep',\n            mode: 'only-deleted',\n          },\n        ];\n    }\n  }\n\n  private _generateUnionClause(query: QueryAST.QueryUnionClause, context: GenerationContext): QueryPlan.Plan {\n    return QueryPlan.Plan.make([\n      {\n        _tag: 'UnionStep',\n        plans: query.queries.map((query) => this._generate(query, context)),\n      },\n    ]);\n  }\n\n  private _generateSetDifferenceClause(\n    query: QueryAST.QuerySetDifferenceClause,\n    context: GenerationContext,\n  ): QueryPlan.Plan {\n    return QueryPlan.Plan.make([\n      {\n        _tag: 'SetDifferenceStep',\n        source: this._generate(query.source, context),\n        exclude: this._generate(query.exclude, context),\n      },\n    ]);\n  }\n\n  private _generateReferenceTraversalClause(\n    query: QueryAST.QueryReferenceTraversalClause,\n    context: GenerationContext,\n  ): QueryPlan.Plan {\n    return QueryPlan.Plan.make([\n      ...this._generate(query.anchor, context).steps,\n      {\n        _tag: 'TraverseStep',\n        traversal: {\n          _tag: 'ReferenceTraversal',\n          direction: 'outgoing',\n          property: query.property,\n        },\n      },\n      ...this._generateDeletedHandlingSteps(context),\n    ]);\n  }\n\n  private _generateIncomingReferencesClause(\n    query: QueryAST.QueryIncomingReferencesClause,\n    context: GenerationContext,\n  ): QueryPlan.Plan {\n    return QueryPlan.Plan.make([\n      ...this._generate(query.anchor, context).steps,\n      {\n        _tag: 'TraverseStep',\n        traversal: {\n          _tag: 'ReferenceTraversal',\n          direction: 'incoming',\n          property: query.property ?? null,\n        },\n      },\n      ...this._generateDeletedHandlingSteps(context),\n      {\n        _tag: 'FilterStep',\n        filter: {\n          type: 'object',\n          typename: query.typename,\n          props: {},\n        },\n      },\n    ]);\n  }\n\n  private _generateRelationTraversalClause(\n    query: QueryAST.QueryRelationTraversalClause,\n    context: GenerationContext,\n  ): QueryPlan.Plan {\n    switch (query.direction) {\n      case 'source': {\n        return QueryPlan.Plan.make([\n          ...this._generate(query.anchor, context).steps,\n          createRelationTraversalStep('relation-to-source'),\n          ...this._generateDeletedHandlingSteps(context),\n        ]);\n      }\n      case 'target': {\n        return QueryPlan.Plan.make([\n          ...this._generate(query.anchor, context).steps,\n          createRelationTraversalStep('relation-to-target'),\n          ...this._generateDeletedHandlingSteps(context),\n        ]);\n      }\n      case 'both': {\n        const anchorPlan = this._generate(query.anchor, context);\n        return QueryPlan.Plan.make([\n          ...anchorPlan.steps,\n          {\n            _tag: 'UnionStep',\n            plans: [\n              QueryPlan.Plan.make([createRelationTraversalStep('relation-to-source')]),\n              QueryPlan.Plan.make([createRelationTraversalStep('relation-to-target')]),\n            ],\n          },\n          ...this._generateDeletedHandlingSteps(context),\n        ]);\n      }\n    }\n  }\n\n  private _generateRelationClause(query: QueryAST.QueryRelationClause, context: GenerationContext): QueryPlan.Plan {\n    switch (query.direction) {\n      case 'outgoing': {\n        return QueryPlan.Plan.make([\n          ...this._generate(query.anchor, context).steps,\n          createRelationTraversalStep('source-to-relation'),\n          ...this._generateDeletedHandlingSteps(context),\n          {\n            _tag: 'FilterStep',\n            filter: query.filter ?? NOOP_FILTER,\n          },\n        ]);\n      }\n      case 'incoming': {\n        return QueryPlan.Plan.make([\n          ...this._generate(query.anchor, context).steps,\n          createRelationTraversalStep('target-to-relation'),\n          ...this._generateDeletedHandlingSteps(context),\n          {\n            _tag: 'FilterStep',\n            filter: query.filter ?? NOOP_FILTER,\n          },\n        ]);\n      }\n      case 'both': {\n        const anchorPlan = this._generate(query.anchor, context);\n        return QueryPlan.Plan.make([\n          ...anchorPlan.steps,\n          {\n            _tag: 'UnionStep',\n            plans: [\n              QueryPlan.Plan.make([createRelationTraversalStep('source-to-relation')]),\n              QueryPlan.Plan.make([createRelationTraversalStep('target-to-relation')]),\n            ],\n          },\n          ...this._generateDeletedHandlingSteps(context),\n          {\n            _tag: 'FilterStep',\n            filter: query.filter ?? NOOP_FILTER,\n          },\n        ]);\n      }\n    }\n  }\n\n  private _generateFilterClause(query: QueryAST.QueryFilterClause, context: GenerationContext): QueryPlan.Plan {\n    return QueryPlan.Plan.make([\n      ...this._generate(query.selection, context).steps,\n      {\n        _tag: 'FilterStep',\n        filter: query.filter,\n      },\n    ]);\n  }\n\n  private _generateHierarchyTraversalClause(\n    query: QueryAST.QueryHierarchyTraversalClause,\n    context: GenerationContext,\n  ): QueryPlan.Plan {\n    return QueryPlan.Plan.make([\n      ...this._generate(query.anchor, context).steps,\n      {\n        _tag: 'TraverseStep',\n        traversal: {\n          _tag: 'HierarchyTraversal',\n          direction: query.direction,\n        },\n      },\n      ...this._generateDeletedHandlingSteps(context),\n    ]);\n  }\n\n  private _validateQueryScoped(query: QueryAST.Query): void {\n    let hasScope = false;\n    QueryAST.visit(query, (node) => {\n      if (node.type === 'from') {\n        hasScope = true;\n      }\n    });\n    if (!hasScope) {\n      throw new QueryError({\n        message: 'Query must be scoped with a from() clause',\n        context: { query },\n      });\n    }\n  }\n\n  /**\n   * Removes filter steps that have no predicates.\n   */\n  private _optimizeEmptyFilters(plan: QueryPlan.Plan): QueryPlan.Plan {\n    return QueryPlan.Plan.make(\n      plan.steps\n        .filter((step) => {\n          if (step._tag === 'FilterStep') {\n            return !QueryPlan.FilterStep.isNoop(step);\n          } else {\n            return true;\n          }\n        })\n        .map((step) => {\n          if (step._tag === 'UnionStep') {\n            return {\n              _tag: 'UnionStep',\n              plans: step.plans.map((plan) => this._optimizeEmptyFilters(plan)),\n            };\n          } else {\n            return step;\n          }\n        }),\n    );\n  }\n\n  /**\n   * Removes union steps that have only one child.\n   */\n  private _optimizeSoloUnions(plan: QueryPlan.Plan): QueryPlan.Plan {\n    // TODO(dmaretskyi): Implement this.\n    return plan;\n  }\n\n  private _generateOrderClause(query: QueryAST.QueryOrderClause, context: GenerationContext): QueryPlan.Plan {\n    return QueryPlan.Plan.make([\n      ...this._generate(query.query, context).steps,\n      {\n        _tag: 'OrderStep',\n        order: query.order,\n      },\n    ]);\n  }\n\n  private _generateLimitClause(query: QueryAST.QueryLimitClause, context: GenerationContext): QueryPlan.Plan {\n    return QueryPlan.Plan.make([\n      ...this._generate(query.query, context).steps,\n      {\n        _tag: 'LimitStep',\n        limit: query.limit,\n      },\n    ]);\n  }\n\n  // After complete plan is built, inspect it from the end:\n  //   - Walk backwards until hitting an object set changer.\n  //   - If an order step is found, skip.\n  //   - Otherwise insert natural order before any limit steps (since limit should be applied after ordering).\n  // This method is recursive and also processes sub-plans in unions and set differences.\n  private _ensureOrderStep(plan: QueryPlan.Plan): QueryPlan.Plan {\n    // First, recursively process any sub-plans.\n    const processedSteps = plan.steps.map((step): QueryPlan.Step => {\n      if (step._tag === 'UnionStep') {\n        return {\n          _tag: 'UnionStep',\n          plans: step.plans.map((subPlan) => this._ensureOrderStep(subPlan)),\n        };\n      } else if (step._tag === 'SetDifferenceStep') {\n        return {\n          _tag: 'SetDifferenceStep',\n          source: this._ensureOrderStep(step.source),\n          exclude: this._ensureOrderStep(step.exclude),\n        };\n      }\n      return step;\n    });\n\n    const processedPlan = QueryPlan.Plan.make(processedSteps);\n\n    const OBJECT_SET_CHANGERS = new Set(['SelectStep', 'TraverseStep', 'UnionStep', 'SetDifferenceStep']);\n    for (let i = processedPlan.steps.length - 1; i >= 0; i--) {\n      const step = processedPlan.steps[i];\n      if (step._tag === 'OrderStep') {\n        return processedPlan;\n      }\n      if (OBJECT_SET_CHANGERS.has(step._tag)) {\n        break;\n      }\n    }\n\n    // Find the position to insert the order step (before any limit steps).\n    let insertIndex = processedPlan.steps.length;\n    for (let i = processedPlan.steps.length - 1; i >= 0; i--) {\n      if (processedPlan.steps[i]._tag === 'LimitStep') {\n        insertIndex = i;\n      } else {\n        break;\n      }\n    }\n\n    const newSteps = [...processedPlan.steps];\n    newSteps.splice(insertIndex, 0, {\n      _tag: 'OrderStep',\n      order: [Order.natural.ast],\n    });\n\n    return QueryPlan.Plan.make(newSteps);\n  }\n\n  /**\n   * Propagates limits from LimitStep to SelectStep and OrderStep when possible.\n   * Limits can only be propagated if there are no unions or traversals between the LimitStep and SelectStep/OrderStep.\n   */\n  private _optimizeLimits(plan: QueryPlan.Plan): QueryPlan.Plan {\n    // First, recursively process any sub-plans.\n    const processedSteps = plan.steps.map((step): QueryPlan.Step => {\n      if (step._tag === 'UnionStep') {\n        return {\n          _tag: 'UnionStep',\n          plans: step.plans.map((subPlan) => this._optimizeLimits(subPlan)),\n        };\n      } else if (step._tag === 'SetDifferenceStep') {\n        return {\n          _tag: 'SetDifferenceStep',\n          source: this._optimizeLimits(step.source),\n          exclude: this._optimizeLimits(step.exclude),\n        };\n      }\n      return step;\n    });\n\n    // Find if there's a LimitStep at the end (possibly after OrderStep).\n    let limitStepIndex = -1;\n    let limitValue: number | undefined;\n\n    for (let i = processedSteps.length - 1; i >= 0; i--) {\n      const step = processedSteps[i];\n      if (step._tag === 'LimitStep') {\n        limitStepIndex = i;\n        limitValue = step.limit;\n        break;\n      }\n      // Only allow OrderStep after LimitStep when looking backwards.\n      if (step._tag !== 'OrderStep') {\n        break;\n      }\n    }\n\n    if (limitStepIndex === -1 || limitValue === undefined) {\n      return QueryPlan.Plan.make(processedSteps);\n    }\n\n    // Check if we can propagate the limit to a SelectStep and/or OrderStep.\n    // We can only do this if there are no unions, traversals, or set differences between them.\n    const BLOCKERS = new Set(['UnionStep', 'TraverseStep', 'SetDifferenceStep']);\n\n    let selectStepIndex = -1;\n    let orderStepIndex = -1;\n    for (let i = 0; i < limitStepIndex; i++) {\n      const step = processedSteps[i];\n      if (step._tag === 'SelectStep') {\n        selectStepIndex = i;\n      }\n      if (step._tag === 'OrderStep') {\n        orderStepIndex = i;\n      }\n      if (BLOCKERS.has(step._tag)) {\n        // Found a blocker after the select/order step - can't propagate.\n        selectStepIndex = -1;\n        orderStepIndex = -1;\n      }\n    }\n\n    if (selectStepIndex === -1 && orderStepIndex === -1) {\n      return QueryPlan.Plan.make(processedSteps);\n    }\n\n    // Create a mutable copy of steps to modify.\n    const newSteps = [...processedSteps];\n\n    // Propagate the limit to the SelectStep if found.\n    if (selectStepIndex !== -1) {\n      const selectStep = newSteps[selectStepIndex] as QueryPlan.SelectStep;\n      newSteps[selectStepIndex] = {\n        ...selectStep,\n        limit: limitValue,\n      };\n    }\n\n    // Propagate the limit to the OrderStep if found.\n    if (orderStepIndex !== -1) {\n      const orderStep = newSteps[orderStepIndex] as QueryPlan.OrderStep;\n      newSteps[orderStepIndex] = {\n        ...orderStep,\n        limit: limitValue,\n      };\n    }\n\n    // Remove the LimitStep since limit is now propagated.\n    newSteps.splice(limitStepIndex, 1);\n\n    return QueryPlan.Plan.make(newSteps);\n  }\n}\n\n/**\n * Context for query planning.\n */\ntype GenerationContext = {\n  /**\n   * The original query.\n   */\n  originalQuery: QueryAST.Query | null;\n\n  /**\n   * The scope to select from (space IDs, queues, etc.).\n   */\n  scope: QueryAST.Scope;\n\n  /**\n   * How to handle deleted objects.\n   */\n  deletedHandling: 'include' | 'exclude' | 'only';\n\n  /**\n   * When generating a selection clause, whether to invert the filter.\n   */\n  selectionInverted: boolean;\n};\n\nconst DEFAULT_CONTEXT: GenerationContext = {\n  originalQuery: null,\n  scope: {},\n  deletedHandling: 'exclude',\n  selectionInverted: false,\n};\n\nconst NOOP_FILTER: QueryAST.Filter = {\n  type: 'object',\n  typename: null,\n  id: [],\n  props: {},\n};\n\nconst createRelationTraversalStep = (direction: QueryPlan.RelationTraversal['direction']): QueryPlan.Step => ({\n  _tag: 'TraverseStep',\n  traversal: {\n    _tag: 'RelationTraversal',\n    direction,\n  },\n});\n\n/**\n * Recursively flattens nested `and` filters into a single list.\n */\nconst _flattenAnd = (filters: readonly QueryAST.Filter[]): QueryAST.Filter[] => {\n  const result: QueryAST.Filter[] = [];\n  for (const f of filters) {\n    if (f.type === 'and') {\n      result.push(..._flattenAnd(f.filters));\n    } else {\n      result.push(f);\n    }\n  }\n  return result;\n};\n\nconst _timestampFilterToSelector = (filter: QueryAST.FilterTimestamp): QueryPlan.TimestampSelector => {\n  const selector: QueryPlan.TimestampSelector = { _tag: 'TimestampSelector' };\n  const key =\n    filter.field === 'updatedAt'\n      ? filter.operator === 'gte' || filter.operator === 'gt'\n        ? 'updatedAfter'\n        : 'updatedBefore'\n      : filter.operator === 'gte' || filter.operator === 'gt'\n        ? 'createdAfter'\n        : 'createdBefore';\n  selector[key] = filter.value;\n  return selector;\n};\n\nconst _mergeTimestampSelectors = (selectors: QueryPlan.TimestampSelector[]): QueryPlan.TimestampSelector => {\n  const merged: QueryPlan.TimestampSelector = { _tag: 'TimestampSelector' };\n  for (const s of selectors) {\n    if (s.updatedAfter != null) {\n      merged.updatedAfter = Math.max(merged.updatedAfter ?? 0, s.updatedAfter);\n    }\n    if (s.updatedBefore != null) {\n      merged.updatedBefore = Math.min(merged.updatedBefore ?? Infinity, s.updatedBefore);\n    }\n    if (s.createdAfter != null) {\n      merged.createdAfter = Math.max(merged.createdAfter ?? 0, s.createdAfter);\n    }\n    if (s.createdBefore != null) {\n      merged.createdBefore = Math.min(merged.createdBefore ?? Infinity, s.createdBefore);\n    }\n  }\n  return merged;\n};\n\nconst isTrivialTypenameFilter = (filter: QueryAST.Filter): boolean => {\n  return (\n    filter.type === 'object' &&\n    filter.typename !== null &&\n    Object.keys(filter.props).length === 0 &&\n    (filter.id === undefined || filter.id.length === 0) &&\n    (filter.foreignKeys === undefined || filter.foreignKeys.length === 0)\n  );\n};\n", "//\n// Copyright 2025 DXOS.org\n//\n\nimport type { QueryAST } from '@dxos/echo-protocol';\nimport type { EscapedPropPath } from '@dxos/index-core';\nimport type { DXN, ObjectId } from '@dxos/keys';\n\nexport namespace QueryPlan {\n  export type TextSearchKind = 'full-text' | 'vector' | 'hybrid';\n\n  /**\n   * A series of linear steps to execute a query.\n   * Steps can potentially contain sub-plans in case of unions.\n   *\n   * The query executor will execute each step in sequence.\n   * The plans start with a select step, which adds objects to the current working set.\n   * Then the next steps will act on the current working set, preforming filters, traversals, etc.\n   */\n  export type Plan = {\n    steps: Step[];\n  };\n\n  export const Plan = Object.freeze({\n    make: (steps: Step[]): Plan => ({ steps }),\n  });\n\n  export type Step =\n    | ClearWorkingSetStep\n    | SelectStep\n    | FilterStep\n    | FilterDeletedStep\n    | TraverseStep\n    | UnionStep\n    | SetDifferenceStep\n    | OrderStep\n    | LimitStep;\n\n  /**\n   * Clear the current working set.\n   */\n  export type ClearWorkingSetStep = {\n    _tag: 'ClearWorkingSetStep';\n  };\n\n  /**\n   * Select objects based on id, typename, or other predicates.\n   * Specifies the spaces and/or queues to select from.\n   * The results from spaces and queues are unioned together.\n   */\n  export type SelectStep = {\n    _tag: 'SelectStep';\n\n    /**\n     * What to select from the scope.\n     */\n    selector: Selector;\n\n    /**\n     * Where to select from.\n     */\n    scope: QueryAST.Scope;\n\n    /**\n     * Optional limit on the number of results to select.\n     * When set, the index scan can be optimized to stop early.\n     */\n    limit?: number;\n  };\n\n  /**\n   * Specifier to scan the database for objects.\n   * Optimized to utilize database indexes.\n   */\n  export type Selector = WildcardSelector | IdSelector | TypeSelector | TextSelector | TimestampSelector;\n\n  export type WildcardSelector = {\n    _tag: 'WildcardSelector';\n  };\n\n  export type IdSelector = {\n    _tag: 'IdSelector';\n\n    objectIds: readonly ObjectId[];\n  };\n\n  /**\n   * Select objects by typename.\n   * Supports passing an array of typenames and an optional inverse flag to optimize for index implementation.\n   */\n  export type TypeSelector = {\n    _tag: 'TypeSelector';\n\n    typename: DXN.String[];\n    /**\n     * If true, select objects that do not match the typename.\n     */\n    inverted: boolean;\n  };\n\n  /**\n   * Select objects by preforming a full-text or vector search.\n   */\n  export type TextSelector = {\n    _tag: 'TextSelector';\n\n    text: string;\n    searchKind: TextSearchKind;\n\n    /**\n     * Optionally select only objects of the given typenames.\n     */\n    typename: DXN.String[] | null;\n  };\n\n  /**\n   * Select objects by timestamp range (createdAt / updatedAt).\n   * Uses the ObjectMetaIndex timestamp columns.\n   */\n  export type TimestampSelector = {\n    _tag: 'TimestampSelector';\n\n    updatedAfter?: number;\n    updatedBefore?: number;\n    createdAfter?: number;\n    createdBefore?: number;\n  };\n\n  /**\n   * Filter objects in the current working set based on a predicate.\n   */\n  export type FilterStep = {\n    _tag: 'FilterStep';\n\n    filter: QueryAST.Filter;\n  };\n\n  export const FilterStep = Object.freeze({\n    isNoop: (step: FilterStep): boolean => {\n      switch (step.filter.type) {\n        case 'object': {\n          // TODO(dmaretskyi): This is error-prone, it could easily break if we add more clauses.\n          return (\n            step.filter.typename === null &&\n            (step.filter.id === undefined || step.filter.id.length === 0) &&\n            (step.filter.props === undefined || Object.keys(step.filter.props).length === 0) &&\n            (step.filter.foreignKeys === undefined || step.filter.foreignKeys.length === 0)\n          );\n        }\n        default:\n          return false;\n      }\n    },\n  });\n\n  /**\n   * Filter objects in the current working set based on the deleted state.\n   */\n  export type FilterDeletedStep = {\n    _tag: 'FilterDeletedStep';\n\n    mode: 'only-deleted' | 'only-non-deleted';\n  };\n\n  /**\n   * Traverse the object graph, starting from objects in the current working set.\n   */\n  export type TraverseStep = {\n    _tag: 'TraverseStep';\n\n    traversal: Traversal;\n  };\n\n  /**\n   * Describes a traversal of the object graph.\n   */\n  export type Traversal = ReferenceTraversal | RelationTraversal | HierarchyTraversal;\n\n  /**\n   * Traverse a reference connection.\n   */\n  export type ReferenceTraversal = {\n    _tag: 'ReferenceTraversal';\n\n    /**\n     * Property path where the reference is located.\n     * If null, matches references from any property (only valid for incoming direction).\n     */\n    property: EscapedPropPath | null;\n\n    /**\n     * outgoing: the reference points from the anchor object to the target.\n     * incoming: the reference points to the anchor object from the target.\n     */\n    direction: 'outgoing' | 'incoming';\n  };\n\n  /**\n   * Traverse a relation.\n   */\n  export type RelationTraversal = {\n    _tag: 'RelationTraversal';\n\n    /**\n     * The direction of the traversal.\n     * There are for variants since each relation has two connectors (source & target) and there are two directions to traverse each.\n     */\n    direction: 'source-to-relation' | 'relation-to-source' | 'target-to-relation' | 'relation-to-target';\n  };\n\n  /**\n   * Traverse parent-child hierarchy.\n   */\n  export type HierarchyTraversal = {\n    _tag: 'HierarchyTraversal';\n\n    /**\n     * to-parent: traverse from child to parent.\n     * to-children: traverse from parent to children.\n     */\n    direction: 'to-parent' | 'to-children';\n  };\n\n  /**\n   * Combine results from multiple plans.\n   * Each of the plans starts with a copy of the current working set.\n   * This supports plans where we first perform a selection, then traverse in different directions, and then combine the results.\n   */\n  export type UnionStep = {\n    _tag: 'UnionStep';\n\n    plans: Plan[];\n  };\n\n  /**\n   * Subtract the results of one plan from another.\n   */\n  export type SetDifferenceStep = {\n    _tag: 'SetDifferenceStep';\n\n    source: Plan;\n    exclude: Plan;\n  };\n\n  /**\n   * Order the results of the plan.\n   */\n  export type OrderStep = {\n    _tag: 'OrderStep';\n\n    // Defaults to natural order if empty.\n    order: readonly QueryAST.Order[];\n\n    /**\n     * Optional limit on the number of results to return after ordering.\n     * When set, the sorting can be optimized to only track the top N elements.\n     */\n    // TODO(dmaretskyi): Remove. This doesn't belong here.\n    limit?: number;\n  };\n\n  /**\n   * Limit the number of results.\n   */\n  export type LimitStep = {\n    _tag: 'LimitStep';\n\n    limit: number;\n  };\n}\n", "//\n// Copyright 2026 DXOS.org\n//\n\nimport type * as SqlClient from '@effect/sql/SqlClient';\nimport * as Effect from 'effect/Effect';\n\nimport { type Context } from '@dxos/context';\nimport { EchoFeedCodec } from '@dxos/echo-protocol';\nimport { type ObjectJSON } from '@dxos/echo/internal';\nimport { RuntimeProvider } from '@dxos/effect';\nimport { type FeedStore } from '@dxos/feed';\nimport { type DataSourceCursor, type IndexDataSource, type IndexerObject } from '@dxos/index-core';\nimport { failedInvariant } from '@dxos/invariant';\nimport type { SpaceId } from '@dxos/keys';\nimport { log } from '@dxos/log';\nimport { FeedProtocol } from '@dxos/protocols';\n\nexport type QueueDataSourceOptions = {\n  feedStore: FeedStore;\n  runtime: RuntimeProvider.RuntimeProvider<SqlClient.SqlClient>;\n  /**\n   * Callback to get the list of space IDs that should be indexed.\n   */\n  getSpaceIds: () => SpaceId[];\n\n  /**\n   * Feed namespaces to index.\n   * @default [WellKnownNamespaces.data, WellKnownNamespaces.trace]\n   */\n  feedNamespaces?: string[];\n};\n\nexport class QueueDataSource implements IndexDataSource {\n  readonly sourceName = 'queue';\n\n  /**\n   * Feed namespaces to index.\n   */\n  private readonly _feedNamespaces: string[];\n  private readonly _feedStore: FeedStore;\n  private readonly _runtime: RuntimeProvider.RuntimeProvider<SqlClient.SqlClient>;\n  private readonly _getSpaceIds: () => SpaceId[];\n\n  constructor(options: QueueDataSourceOptions) {\n    this._feedStore = options.feedStore;\n    this._runtime = options.runtime;\n    this._getSpaceIds = options.getSpaceIds;\n    this._feedNamespaces = options.feedNamespaces ?? [\n      FeedProtocol.WellKnownNamespaces.data,\n      FeedProtocol.WellKnownNamespaces.trace,\n    ];\n  }\n\n  getChangedObjects(\n    _ctx: Context,\n    cursors: DataSourceCursor[],\n    opts?: { limit?: number },\n  ): Effect.Effect<{ objects: IndexerObject[]; cursors: DataSourceCursor[] }> {\n    // For queue, the cursor is assumed to have:\n    // spaceId = set\n    // resourceId = null\n    // cursor = feed cursor\n\n    // We also add new cursors from all previously unindexed spaces.\n\n    return Effect.gen(this, function* () {\n      const objects: IndexerObject[] = [];\n      const updatedCursors: DataSourceCursor[] = [];\n\n      // Delete old cursors that did not have feed namespace set.\n      let augmentedCursors = [...cursors].filter((c) => c.resourceId !== null);\n      for (const spaceId of this._getSpaceIds()) {\n        for (const feedNamespace of this._feedNamespaces) {\n          if (!augmentedCursors.some((c) => c.spaceId === spaceId && c.resourceId === feedNamespace)) {\n            // Add a new cursor for this space starting from the beginning.\n            // Empty string cursor means \"start from beginning\".\n            augmentedCursors.push({\n              spaceId,\n              resourceId: feedNamespace,\n              cursor: '',\n            });\n          }\n        }\n      }\n\n      // Limit per call, but we might have multiple spaces.\n      // We should distribute limit or just fill up to limit.\n      let remainingLimit = opts?.limit ?? Infinity;\n\n      for (const cursor of augmentedCursors) {\n        if (remainingLimit <= 0) {\n          // Remaining cursors are not processed in this call.\n          updatedCursors.push(cursor);\n          continue;\n        }\n        if (!cursor.spaceId) {\n          // Ignore cursors without spaceId.\n          updatedCursors.push(cursor);\n          continue;\n        }\n        if (\n          FeedProtocol.WellKnownNamespaces.data !== cursor.resourceId &&\n          FeedProtocol.WellKnownNamespaces.trace !== cursor.resourceId\n        ) {\n          // TODO(dmaretskyi): Update/remove this check when adding new feed namespaces.\n          log.warn('Ignoring cursor with invaliding feed namespace', { namespace: cursor.resourceId });\n          // Ignore cursors with unknown resourceId.\n          updatedCursors.push(cursor);\n          continue;\n        }\n\n        // Empty string cursor means \"start from beginning\".\n        const currentCursor =\n          typeof cursor.cursor === 'string' && cursor.cursor !== ''\n            ? FeedProtocol.FeedCursor.make(cursor.cursor)\n            : undefined;\n\n        try {\n          const result = yield* this._feedStore.query({\n            spaceId: cursor.spaceId,\n            feedNamespace: cursor.resourceId,\n            cursor: currentCursor,\n            limit: remainingLimit,\n          });\n\n          // Process blocks\n          for (const block of result.blocks) {\n            try {\n              const data = EchoFeedCodec.decode(block.data) as ObjectJSON;\n\n              objects.push({\n                spaceId: cursor.spaceId,\n                queueId: block.feedId ?? failedInvariant(),\n                queueNamespace: cursor.resourceId,\n                documentId: null,\n                recordId: null,\n                data,\n                updatedAt: block.timestamp,\n              });\n            } catch (err) {\n              log.warn('Failed to parse block data for indexing', { spaceId: cursor.spaceId, err });\n            }\n          }\n\n          remainingLimit -= result.blocks.length;\n          updatedCursors.push({\n            spaceId: cursor.spaceId,\n            resourceId: cursor.resourceId,\n            cursor: result.nextCursor,\n          });\n        } catch (error) {\n          log.error('Error querying queue for indexing', { spaceId: cursor.spaceId, error });\n        }\n      }\n\n      return { objects, cursors: updatedCursors };\n    }).pipe(RuntimeProvider.provide(this._runtime), Effect.withSpan('QueueDataSource.getChangedObjects'), Effect.orDie);\n  }\n}\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { type DocumentId, type DocumentQuery, interpretAsDocumentId } from '@automerge/automerge-repo';\nimport isEqual from 'fast-deep-equal';\n\nimport { Event, UpdateScheduler } from '@dxos/async';\nimport { Context, LifecycleState, Resource } from '@dxos/context';\nimport { type DatabaseDirectory } from '@dxos/echo-protocol';\nimport { invariant } from '@dxos/invariant';\nimport { type SpaceId } from '@dxos/keys';\n\nimport { DatabaseRoot } from './database-root';\n\nexport class SpaceStateManager extends Resource {\n  private readonly _roots = new Map<DocumentId, DatabaseRoot>();\n  private readonly _rootBySpace = new Map<SpaceId, DocumentId>();\n  private readonly _perRootContext = new Map<DocumentId, Context>();\n  private readonly _lastSpaceDocumentList = new Map<SpaceId, DocumentId[]>();\n\n  public readonly spaceDocumentListUpdated = new Event<SpaceDocumentListUpdatedEvent>();\n\n  protected override async _close(ctx: Context): Promise<void> {\n    for (const [_, rootCtx] of this._perRootContext) {\n      await rootCtx.dispose();\n    }\n    this._roots.clear();\n  }\n\n  get roots(): ReadonlyMap<DocumentId, DatabaseRoot> {\n    return this._roots;\n  }\n\n  get spaceIds(): SpaceId[] {\n    return Array.from(this._rootBySpace.keys());\n  }\n\n  getRootByDocumentId(documentId: DocumentId): DatabaseRoot | undefined {\n    return this._roots.get(documentId);\n  }\n\n  getSpaceRootDocumentId(spaceId: SpaceId): DocumentId | undefined {\n    return this._rootBySpace.get(spaceId);\n  }\n\n  getRootBySpaceId(spaceId: SpaceId): DatabaseRoot | undefined {\n    invariant(this._lifecycleState === LifecycleState.OPEN);\n    const documentId = this._rootBySpace.get(spaceId);\n    if (!documentId) {\n      return undefined;\n    }\n    return this._roots.get(documentId);\n  }\n\n  async assignRootToSpace(spaceId: SpaceId, query: DocumentQuery<DatabaseDirectory>): Promise<DatabaseRoot> {\n    let root: DatabaseRoot;\n    if (this._roots.has(query.documentId)) {\n      root = this._roots.get(query.documentId)!;\n    } else {\n      root = new DatabaseRoot(query);\n      this._roots.set(query.documentId, root);\n    }\n\n    if (this._rootBySpace.get(spaceId) === root.handle.documentId) {\n      return root;\n    }\n\n    const prevRootId = this._rootBySpace.get(spaceId);\n    if (prevRootId) {\n      void this._perRootContext.get(prevRootId)?.dispose();\n      this._perRootContext.delete(prevRootId);\n    }\n\n    this._rootBySpace.set(spaceId, root.handle.documentId);\n    const ctx = new Context();\n\n    this._perRootContext.set(root.handle.documentId, ctx);\n\n    const documentListCheckScheduler = new UpdateScheduler(\n      ctx,\n      async () => {\n        const documentIds = [root.documentId, ...root.getAllLinkedDocuments().map((url) => interpretAsDocumentId(url))];\n        if (!isEqual(documentIds, this._lastSpaceDocumentList.get(spaceId))) {\n          this._lastSpaceDocumentList.set(spaceId, documentIds);\n          this.spaceDocumentListUpdated.emit(\n            new SpaceDocumentListUpdatedEvent(spaceId, root.documentId, prevRootId, documentIds),\n          );\n        }\n      },\n      { maxFrequency: 50 },\n    );\n    const triggerCheckOnChange = () => documentListCheckScheduler.trigger();\n    root.handle.addListener('change', triggerCheckOnChange);\n    ctx.onDispose(() => root.handle.removeListener('change', triggerCheckOnChange));\n\n    documentListCheckScheduler.trigger();\n\n    return root;\n  }\n}\n\nexport class SpaceDocumentListUpdatedEvent {\n  constructor(\n    public readonly spaceId: SpaceId,\n    public readonly spaceRootId: DocumentId,\n    public readonly previousRootId: DocumentId | undefined,\n    public readonly documentIds: DocumentId[],\n  ) {}\n}\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport type * as A from '@automerge/automerge';\nimport {\n  type AutomergeUrl,\n  type DocHandle,\n  type DocumentId,\n  type DocumentQuery,\n  interpretAsDocumentId,\n} from '@automerge/automerge-repo';\n\nimport { DatabaseDirectory, SpaceDocVersion } from '@dxos/echo-protocol';\nimport { invariant } from '@dxos/invariant';\n\nimport { type DocMetrics, measureDocMetrics } from './automerge-metrics';\n\nexport class DatabaseRoot {\n  static mapLinks(doc: DocHandle<DatabaseDirectory>, mapping: Record<DocumentId, DocumentId>): void {\n    doc.change((d) => {\n      if (!d.links) {\n        return;\n      }\n      for (const [key, value] of Object.entries(d.links)) {\n        const documentId = interpretAsDocumentId(value.toString() as any);\n        if (mapping[documentId]) {\n          d.links[key] = `automerge:${mapping[documentId]}`;\n        }\n      }\n    });\n  }\n\n  /**\n   * @param _query - Live `DocumentQuery` for the root doc. Carries both the\n   * `DocHandle` (synchronously created with the query) and the actual\n   * readiness state. See `getHandleState` in `@dxos/echo-pipeline` for why\n   * we read liveness off the query rather than `DocHandle.*` predicates.\n   */\n  constructor(private readonly _query: DocumentQuery<DatabaseDirectory>) {}\n\n  get documentId(): DocumentId {\n    return this._query.documentId;\n  }\n\n  get url() {\n    return this._query.handle.url;\n  }\n\n  get isLoaded(): boolean {\n    return this._query.peek().state === 'ready';\n  }\n\n  get handle(): DocHandle<DatabaseDirectory> {\n    return this._query.handle;\n  }\n\n  doc(): A.Doc<DatabaseDirectory> | null {\n    return this.isLoaded ? this._query.handle.doc() : null;\n  }\n\n  getVersion(): SpaceDocVersion | null {\n    const doc = this.doc();\n    if (!doc) {\n      return null;\n    }\n\n    return doc.version ?? SpaceDocVersion.LEGACY;\n  }\n\n  getSpaceKey(): string | null {\n    const doc = this.doc();\n    if (!doc) {\n      return null;\n    }\n\n    return DatabaseDirectory.getSpaceKey(doc);\n  }\n\n  getInlineObjectCount(): number | null {\n    const doc = this.doc();\n    if (!doc) {\n      return null;\n    }\n\n    return Object.keys(doc.objects ?? {}).length;\n  }\n\n  getLinkedObjectCount(): number | null {\n    const doc = this.doc();\n    if (!doc) {\n      return null;\n    }\n\n    return Object.keys(doc.links ?? {}).length;\n  }\n\n  getAllLinkedDocuments(): AutomergeUrl[] {\n    const doc = this.doc();\n    invariant(doc);\n\n    // .toString() to handle RawString.\n    return Object.values(doc.links ?? {}).map((s) => s.toString()) as AutomergeUrl[];\n  }\n\n  measureMetrics(): DocMetrics | null {\n    const doc = this.doc();\n    if (!doc) {\n      return null;\n    }\n    return measureDocMetrics(doc);\n  }\n}\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport * as A from '@automerge/automerge';\n\nimport { log } from '@dxos/log';\n\nexport type DocMetrics = {\n  compressedByteSize: number;\n  loadTime: number;\n  mutationCount: number;\n};\n\n/**\n * WARN: Slow to run on large docs.\n */\nexport const measureDocMetrics = (doc: A.Doc<any>): DocMetrics => {\n  const snapshot = A.save(doc);\n\n  const start = Date.now();\n  const temp = A.load(snapshot);\n  const end = Date.now();\n  A.free(temp);\n\n  const getAllChangesStart = Date.now();\n  const mutationCount = A.getAllChanges(doc).length;\n  const getAllChangesEnd = Date.now();\n\n  if (getAllChangesEnd - getAllChangesStart > 300) {\n    log.warn('getAllChanges took too long', { elapsed: getAllChangesEnd - getAllChangesStart });\n  }\n\n  return {\n    compressedByteSize: snapshot.byteLength,\n    loadTime: end - start,\n    mutationCount,\n  };\n};\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport * as A from '@automerge/automerge';\nimport { type DocumentId, type Heads, cbor } from '@automerge/automerge-repo';\n\nimport { Mutex, scheduleMicroTask, scheduleTask } from '@dxos/async';\nimport { Context, Resource } from '@dxos/context';\nimport { randomUUID } from '@dxos/crypto';\nimport type { CollectionId } from '@dxos/echo-protocol';\nimport { type EdgeConnection, type EdgeHttpClient } from '@dxos/edge-client';\nimport { invariant } from '@dxos/invariant';\nimport type { SpaceId } from '@dxos/keys';\nimport { log } from '@dxos/log';\nimport {\n  type AutomergeProtocolMessage,\n  DocumentCodec,\n  EdgeService,\n  type ErrorProtocolMessage,\n  type ExportBundleRequest,\n  type ImportBundleRequest,\n  type PeerId,\n} from '@dxos/protocols';\nimport { buf } from '@dxos/protocols/buf';\nimport {\n  type Message as RouterMessage,\n  MessageSchema as RouterMessageSchema,\n} from '@dxos/protocols/buf/dxos/edge/messenger_pb';\nimport { trace } from '@dxos/tracing';\nimport { bufferToArray, compositeKey, setDeep } from '@dxos/util';\n\nimport {\n  type AutomergeReplicator,\n  type AutomergeReplicatorConnection,\n  type AutomergeReplicatorContext,\n  type ShouldAdvertiseProps,\n  type ShouldSyncCollectionProps,\n  getSpaceIdFromCollectionId,\n} from '../automerge';\nimport { InflightRequestLimiter } from './inflight-request-limiter';\n\n/**\n * Delay before restarting the connection after receiving a forbidden error.\n */\nconst INITIAL_RESTART_DELAY = 500;\nconst RESTART_DELAY_JITTER = 250;\nconst MAX_RESTART_DELAY = 5000;\n\nexport type EchoEdgeReplicatorProps = {\n  edgeConnection: EdgeConnection;\n  edgeHttpClient: EdgeHttpClient;\n  disableSharePolicy?: boolean;\n};\n\n@trace.resource()\nexport class EchoEdgeReplicator implements AutomergeReplicator {\n  private readonly _edgeConnection: EdgeConnection;\n  private readonly _edgeHttpClient: EdgeHttpClient;\n  private readonly _mutex = new Mutex();\n\n  private _ctx?: Context = undefined;\n  private _context: AutomergeReplicatorContext | null = null;\n  private _connectedSpaces = new Set<SpaceId>();\n  private _connections = new Map<SpaceId, EdgeReplicatorConnection>();\n  private _sharePolicyEnabled = true;\n\n  constructor({ edgeConnection, edgeHttpClient, disableSharePolicy }: EchoEdgeReplicatorProps) {\n    this._edgeConnection = edgeConnection;\n    this._edgeHttpClient = edgeHttpClient;\n    this._sharePolicyEnabled = !disableSharePolicy;\n  }\n\n  async connect(ctx: Context, context: AutomergeReplicatorContext): Promise<void> {\n    log('connecting...', { peerId: context.peerId, connectedSpaces: this._connectedSpaces.size });\n    this._context = context;\n    this._ctx = ctx.derive();\n    this._ctx.onDispose(\n      this._edgeConnection.onReconnected(() => {\n        this._ctx && scheduleMicroTask(this._ctx, () => this._handleReconnect());\n      }),\n    );\n  }\n\n  private async _handleReconnect(): Promise<void> {\n    using _guard = await this._mutex.acquire();\n\n    const spaces = [...this._connectedSpaces];\n    for (const connection of this._connections.values()) {\n      await connection.close();\n    }\n    this._connections.clear();\n\n    if (this._context !== null) {\n      for (const spaceId of spaces) {\n        await this._openConnection(this._ctx!, spaceId);\n      }\n    }\n  }\n\n  async disconnect(): Promise<void> {\n    using _guard = await this._mutex.acquire();\n    await this._ctx?.dispose();\n\n    for (const connection of this._connections.values()) {\n      await connection.close();\n    }\n    this._connections.clear();\n  }\n\n  @trace.span({ showInBrowserTimeline: true, op: 'replication' })\n  async connectToSpace(ctx: Context, spaceId: SpaceId): Promise<void> {\n    log('connectToSpace', { spaceId });\n    using _guard = await this._mutex.acquire();\n\n    if (this._connectedSpaces.has(spaceId)) {\n      return;\n    }\n    this._connectedSpaces.add(spaceId);\n\n    if (this._context !== null) {\n      await this._openConnection(ctx, spaceId);\n    }\n  }\n\n  async disconnectFromSpace(spaceId: SpaceId): Promise<void> {\n    using _guard = await this._mutex.acquire();\n\n    this._connectedSpaces.delete(spaceId);\n\n    const connection = this._connections.get(spaceId);\n    if (connection) {\n      await connection.close();\n      this._connections.delete(spaceId);\n    }\n  }\n\n  @trace.span({ showInBrowserTimeline: true, op: 'replication' })\n  private async _openConnection(ctx: Context, spaceId: SpaceId, reconnects: number = 0): Promise<void> {\n    invariant(this._context);\n    invariant(!this._connections.has(spaceId));\n\n    let restartScheduled = false;\n\n    const connection = new EdgeReplicatorConnection({\n      edgeHttpClient: this._edgeHttpClient,\n      edgeConnection: this._edgeConnection,\n      spaceId,\n      context: this._context,\n      sharedPolicyEnabled: this._sharePolicyEnabled,\n      onRemoteConnected: async () => {\n        log.trace('dxos.echo.edge.replicator.onRemoteConnected', { spaceId });\n        this._context?.onConnectionOpen(connection);\n      },\n      onRemoteDisconnected: async () => {\n        log.trace('dxos.echo.edge.replicator.onRemoteDisconnected', { spaceId });\n        this._context?.onConnectionClosed(connection);\n      },\n      onRestartRequested: async () => {\n        if (!this._ctx || restartScheduled) {\n          return;\n        }\n\n        const restartDelay =\n          Math.min(MAX_RESTART_DELAY, INITIAL_RESTART_DELAY * reconnects) + Math.random() * RESTART_DELAY_JITTER;\n\n        log('connection restart scheduled', { spaceId, reconnects, restartDelay });\n\n        restartScheduled = true;\n        scheduleTask(\n          this._ctx!,\n          async () => {\n            using _guard = await this._mutex.acquire();\n            if (this._connections.get(spaceId) !== connection) {\n              return;\n            }\n\n            const replicatorCtx = this._ctx;\n            await connection.close();\n            this._connections.delete(spaceId);\n            if (replicatorCtx?.disposed) {\n              return;\n            }\n            log.trace('dxos.echo.edge.replicator.restart', { spaceId, reconnects, restartDelay });\n            await this._openConnection(replicatorCtx!, spaceId, reconnects + 1);\n          },\n          restartDelay,\n        );\n      },\n    });\n    this._connections.set(spaceId, connection);\n\n    await connection.open(ctx);\n  }\n}\n\ntype EdgeReplicatorConnectionsProps = {\n  edgeConnection: EdgeConnection;\n  edgeHttpClient: EdgeHttpClient;\n  spaceId: SpaceId;\n  context: AutomergeReplicatorContext;\n  sharedPolicyEnabled: boolean;\n  onRemoteConnected: () => Promise<void>;\n  onRemoteDisconnected: () => Promise<void>;\n  onRestartRequested: () => Promise<void>;\n};\n\nconst MAX_INFLIGHT_REQUESTS = 5;\nconst MAX_RATE_LIMIT_WAIT_TIME_MS = 3000;\n\nclass EdgeReplicatorConnection extends Resource implements AutomergeReplicatorConnection {\n  private readonly _connectionId = randomUUID();\n  private readonly _edgeConnection: EdgeConnection;\n  private readonly _edgeHttpClient: EdgeHttpClient;\n  private readonly _remotePeerId: string | null = null;\n  private readonly _targetServiceId: string;\n  private readonly _spaceId: SpaceId;\n  private readonly _context: AutomergeReplicatorContext;\n  private readonly _sharedPolicyEnabled: boolean;\n  private readonly _onRemoteConnected: () => Promise<void>;\n  private readonly _onRemoteDisconnected: () => Promise<void>;\n  private readonly _onRestartRequested: () => void;\n  private _sequence = 0;\n\n  private _requestLimiter = new InflightRequestLimiter({\n    maxInflightRequests: MAX_INFLIGHT_REQUESTS,\n    resetBalanceTimeoutMs: MAX_RATE_LIMIT_WAIT_TIME_MS,\n  });\n\n  private _readableStreamController!: ReadableStreamDefaultController<AutomergeProtocolMessage>;\n\n  public readable: ReadableStream<AutomergeProtocolMessage>;\n  public writable: WritableStream<AutomergeProtocolMessage>;\n\n  constructor({\n    edgeConnection,\n    edgeHttpClient,\n    spaceId,\n    context,\n    sharedPolicyEnabled,\n    onRemoteConnected,\n    onRemoteDisconnected,\n    onRestartRequested,\n  }: EdgeReplicatorConnectionsProps) {\n    super();\n    this._edgeConnection = edgeConnection;\n    this._edgeHttpClient = edgeHttpClient;\n    this._spaceId = spaceId;\n    this._context = context;\n    // Generate a unique peer id for every connection.\n    // This way automerge-repo will have separate sync states for every connection.\n    // This is important because the previous connection might have had some messages that failed to deliver\n    // abd if we don't clear the sync-state, automerge will not attempt to deliver them again.\n    this._targetServiceId = compositeKey(EdgeService.AUTOMERGE_REPLICATOR, spaceId);\n    // TODO(wittjosiah): Use compositeKey.\n    this._remotePeerId = `${this._targetServiceId}-${this._connectionId}`;\n    this._sharedPolicyEnabled = sharedPolicyEnabled;\n    this._onRemoteConnected = onRemoteConnected;\n    this._onRemoteDisconnected = onRemoteDisconnected;\n    this._onRestartRequested = onRestartRequested;\n\n    this.readable = new ReadableStream<AutomergeProtocolMessage>({\n      start: (controller) => {\n        this._readableStreamController = controller;\n      },\n    });\n\n    this.writable = new WritableStream<AutomergeProtocolMessage>({\n      write: async (message: AutomergeProtocolMessage, controller) => {\n        await this._requestLimiter.rateLimit(message);\n\n        await this._sendMessage(this._ctx, message);\n      },\n    });\n  }\n\n  protected override async _open(ctx: Context): Promise<void> {\n    log('opening...');\n\n    await this._requestLimiter.open();\n\n    this._ctx.onDispose(\n      this._edgeConnection.onMessage((msg: RouterMessage) => {\n        this._onMessage(msg);\n      }),\n    );\n\n    let firstReconnect = true;\n    this._ctx.onDispose(\n      // NOTE: This will fire immediately if the connection is already open.\n      this._edgeConnection.onReconnected(async () => {\n        if (firstReconnect) {\n          log.verbose('first reconnect skipped');\n          firstReconnect = false;\n          return;\n        }\n\n        this._onRestartRequested();\n      }),\n    );\n\n    await this._onRemoteConnected();\n  }\n\n  protected override async _close(ctx: Context): Promise<void> {\n    log('closing...');\n    this._readableStreamController.close();\n\n    await this._requestLimiter.close();\n\n    await this._onRemoteDisconnected();\n  }\n\n  get peerId(): string {\n    invariant(this._remotePeerId, 'Not connected');\n    return this._remotePeerId;\n  }\n\n  async shouldAdvertise(params: ShouldAdvertiseProps): Promise<boolean> {\n    if (!this._sharedPolicyEnabled) {\n      return true;\n    }\n    const spaceId = await this._context.getContainingSpaceIdForDocument(params.documentId);\n    if (!spaceId) {\n      const remoteDocumentExists = await this._context.isDocumentInRemoteCollection({\n        documentId: params.documentId,\n        peerId: this._remotePeerId as PeerId,\n      });\n\n      log.verbose('document not found locally for share policy check', {\n        documentId: params.documentId,\n        acceptDocument: remoteDocumentExists,\n        remoteId: this._remotePeerId,\n      });\n\n      // If a document is not present locally return true only if it already exists on edge.\n      // Simply returning true will add edge to \"generous peers list\" for this document which will\n      // start replication of the document after we receive it potentially pushing it to replicator of the wrong space.\n      return remoteDocumentExists;\n    }\n    return spaceId === this._spaceId;\n  }\n\n  shouldSyncCollection(params: ShouldSyncCollectionProps): boolean {\n    if (!this._sharedPolicyEnabled) {\n      return true;\n    }\n    const spaceId = getSpaceIdFromCollectionId(params.collectionId as CollectionId);\n    // Only sync collections of form space:id:rootDoc, edge ignores legacy space:id collections\n    return spaceId === this._spaceId && params.collectionId.split(':').length === 3;\n  }\n\n  private _onMessage(message: RouterMessage): void {\n    if (message.serviceId !== this._targetServiceId) {\n      return;\n    }\n\n    const payload = cbor.decode(message.payload!.value) as AutomergeProtocolMessage;\n    log.verbose('received', {\n      ...getMessageInfo(payload),\n      remoteId: this._remotePeerId,\n    });\n\n    // Fix the peer id.\n    payload.senderId = this._remotePeerId! as PeerId;\n    this._processMessage(payload);\n  }\n\n  get bundleSyncEnabled(): boolean {\n    return true;\n  }\n\n  async pushBundle(ctx: Context, bundle: { documentId: DocumentId; data: Uint8Array; heads: Heads }[]) {\n    const request: ImportBundleRequest = {\n      bundle: bundle.map(({ documentId, data, heads }) => ({\n        documentId,\n        mutation: DocumentCodec.encode(data),\n        heads,\n      })),\n    };\n    await this._edgeHttpClient.importBundle(ctx, this._spaceId, request);\n  }\n\n  async pullBundle(ctx: Context, docHeads: Record<DocumentId, Heads>): Promise<Record<DocumentId, Uint8Array>> {\n    const request: ExportBundleRequest = { docHeads };\n    const response = await this._edgeHttpClient.exportBundle(ctx, this._spaceId, request);\n    return Object.fromEntries(response.bundle.map((doc) => [doc.documentId, DocumentCodec.decode(doc.mutation)]));\n  }\n\n  private _processMessage(message: AutomergeProtocolMessage): void {\n    // There's a race between the credentials being replicated that are needed for access control and the data replication.\n    // AutomergeReplicator might return a Forbidden error if the credentials are not yet replicated.\n    // We restart the connection with some delay to account for that.\n    if (isErrorMessage(message)) {\n      log.verbose('stream error', { error: (message as ErrorProtocolMessage).message });\n      this._onRestartRequested();\n      return;\n    }\n\n    this._requestLimiter.handleResponse(message);\n\n    this._readableStreamController.enqueue(message);\n  }\n\n  private async _sendMessage(ctx: Context, message: AutomergeProtocolMessage): Promise<void> {\n    // Fix the peer id.\n    (message as any).targetId = this._targetServiceId as PeerId;\n\n    // Note: This is used on EDGE to detect out-of-order messages per connection.\n    setDeep(message, ['metadata', 'dxos_sequence'], this._getSequence());\n    setDeep(message, ['metadata', 'dxos_connectionId'], this._connectionId);\n\n    log.verbose('sending...', {\n      ...getMessageInfo(message),\n      remoteId: this._remotePeerId,\n    });\n\n    const encoded = cbor.encode(message);\n\n    try {\n      await this._edgeConnection.send(\n        ctx,\n        buf.create(RouterMessageSchema, {\n          serviceId: this._targetServiceId,\n          source: {\n            identityKey: this._edgeConnection.identityKey,\n            peerKey: this._edgeConnection.peerKey,\n          },\n          payload: { value: bufferToArray(encoded) },\n        }),\n      );\n    } catch (err) {\n      log.error('failed to send message', { err });\n    }\n  }\n\n  private _getSequence(): number {\n    return this._sequence++;\n  }\n}\n\n/**\n * This message is sent by EDGE AutomergeReplicator when the authorization is denied.\n */\nconst isErrorMessage = (message: AutomergeProtocolMessage) => message.type === 'error';\n\nconst getMessageInfo = (msg: AutomergeProtocolMessage) => {\n  const { have, heads, need, changes } = msg.type === 'sync' ? A.decodeSyncMessage(msg.data) : {};\n  return {\n    type: msg.type,\n    documentId: 'documentId' in msg ? msg.documentId : undefined,\n    collectionId: 'collectionId' in msg ? msg.collectionId : undefined,\n    have,\n    heads,\n    need,\n    changes: changes?.length,\n    sequence: msg.metadata?.dxos_sequence,\n  };\n};\n", "//\n// Copyright 2025 DXOS.org\n//\n\nimport { Trigger } from '@dxos/async';\nimport { Resource } from '@dxos/context';\nimport { log } from '@dxos/log';\nimport { type AutomergeProtocolMessage } from '@dxos/protocols';\n\ntype InflightRequestLimiterConfig = {\n  maxInflightRequests: number;\n  resetBalanceTimeoutMs: number;\n};\n\nexport class InflightRequestLimiter extends Resource {\n  /**\n   * Decrement when we receive a sync message, increment when we send one.\n   * Can't exceed _config.maxInflightRequests.\n   * Resets after timeout to avoid replicator being stuck.\n   */\n  private _inflightRequestBalance = 0;\n  private _requestBarrier = new Trigger();\n  private _resetBalanceTimeout: NodeJS.Timeout | undefined;\n\n  constructor(private readonly _config: InflightRequestLimiterConfig) {\n    super();\n  }\n\n  protected override async _open(): Promise<void> {\n    this._inflightRequestBalance = 0;\n    this._requestBarrier.reset();\n    this._requestBarrier.wake();\n  }\n\n  protected override async _close(): Promise<void> {\n    this._inflightRequestBalance = 0;\n    this._requestBarrier.throw(new Error('Rate limiter closed.'));\n    clearTimeout(this._resetBalanceTimeout);\n  }\n\n  public async rateLimit(message: AutomergeProtocolMessage): Promise<void> {\n    if (message.type !== 'sync') {\n      return;\n    }\n    while (this._inflightRequestBalance >= this._config.maxInflightRequests) {\n      await this._requestBarrier.wait();\n    }\n    this._inflightRequestBalance++;\n    if (this._inflightRequestBalance === this._config.maxInflightRequests) {\n      this._requestBarrier.reset();\n      this._resetBalanceTimeout = setTimeout(() => {\n        log.warn('Request balance has not changed during specified timeout, resetting request limiter.');\n        this._inflightRequestBalance = 0;\n        this._requestBarrier.wake();\n      }, this._config.resetBalanceTimeoutMs);\n    }\n  }\n\n  public handleResponse(message: AutomergeProtocolMessage): void {\n    if (message.type !== 'sync') {\n      return;\n    }\n    this._inflightRequestBalance--;\n    if (this._inflightRequestBalance + 1 === this._config.maxInflightRequests) {\n      this._requestBarrier.wake();\n      clearInterval(this._resetBalanceTimeout);\n    }\n  }\n}\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { cbor } from '@automerge/automerge-repo';\n\nimport { Mutex, scheduleMicroTask, scheduleTask } from '@dxos/async';\nimport { Context, Resource } from '@dxos/context';\nimport { randomUUID } from '@dxos/crypto';\nimport type { CollectionId } from '@dxos/echo-protocol';\nimport { type EdgeConnection, type EdgeHttpClient } from '@dxos/edge-client';\nimport { invariant } from '@dxos/invariant';\nimport type { SpaceId } from '@dxos/keys';\nimport { log } from '@dxos/log';\nimport { type AutomergeProtocolMessage, EdgeService, type PeerId } from '@dxos/protocols';\nimport { buf } from '@dxos/protocols/buf';\nimport {\n  type Message as RouterMessage,\n  MessageSchema as RouterMessageSchema,\n} from '@dxos/protocols/buf/dxos/edge/messenger_pb';\nimport { trace } from '@dxos/tracing';\nimport { bufferToArray, compositeKey } from '@dxos/util';\n\nimport {\n  type AutomergeReplicator,\n  type AutomergeReplicatorConnection,\n  type AutomergeReplicatorContext,\n  type ShouldAdvertiseProps,\n  type ShouldSyncCollectionProps,\n  getSpaceIdFromCollectionId,\n} from '../automerge';\n\n/**\n * Delay before restarting the connection after the edge requests it.\n */\nconst INITIAL_RESTART_DELAY = 500;\nconst RESTART_DELAY_JITTER = 250;\nconst MAX_RESTART_DELAY = 5000;\n\nexport type EchoEdgeSubductionReplicatorProps = {\n  edgeConnection: EdgeConnection;\n  edgeHttpClient: EdgeHttpClient;\n  disableSharePolicy?: boolean;\n};\n\n/**\n * Edge replicator for the Subduction transport.\n *\n * Subduction byte tunnel over the Edge router WebSocket. Every inbound router message\n * targeting the subduction service is forwarded verbatim to the local Repo via an\n * {@link AutomergeReplicatorConnection}. Outbound repo messages are wrapped in a router\n * frame and sent to the edge.\n *\n * No classical automerge-repo sync, collection-query/state, bundle sync, or rate-limiting\n * runs through this class — Subduction's sedimentree protocol replaces those\n * responsibilities. For the classical sync path see {@link EchoEdgeReplicator}.\n */\n@trace.resource()\nexport class EchoEdgeSubductionReplicator implements AutomergeReplicator {\n  private readonly _edgeConnection: EdgeConnection;\n  private readonly _edgeHttpClient: EdgeHttpClient;\n  private readonly _mutex = new Mutex();\n  private readonly _disableSharePolicy: boolean;\n\n  private _ctx?: Context = undefined;\n  private _context: AutomergeReplicatorContext | null = null;\n  private _connectedSpaces = new Set<SpaceId>();\n  private _connections = new Map<SpaceId, EdgeSubductionReplicatorConnection>();\n\n  constructor({ edgeConnection, edgeHttpClient, disableSharePolicy }: EchoEdgeSubductionReplicatorProps) {\n    this._edgeConnection = edgeConnection;\n    this._edgeHttpClient = edgeHttpClient;\n    this._disableSharePolicy = disableSharePolicy ?? false;\n  }\n\n  async connect(ctx: Context, context: AutomergeReplicatorContext): Promise<void> {\n    log('connecting...', { peerId: context.peerId, connectedSpaces: this._connectedSpaces.size });\n    this._context = context;\n    this._ctx = ctx.derive();\n    this._ctx.onDispose(\n      this._edgeConnection.onReconnected(() => {\n        this._ctx && scheduleMicroTask(this._ctx, () => this._handleReconnect());\n      }),\n    );\n  }\n\n  private async _handleReconnect(): Promise<void> {\n    using _guard = await this._mutex.acquire();\n\n    const spaces = [...this._connectedSpaces];\n    for (const connection of this._connections.values()) {\n      await connection.close();\n    }\n    this._connections.clear();\n\n    if (this._context !== null) {\n      for (const spaceId of spaces) {\n        await this._openConnection(spaceId);\n      }\n    }\n  }\n\n  async disconnect(): Promise<void> {\n    using _guard = await this._mutex.acquire();\n    await this._ctx?.dispose();\n\n    for (const connection of this._connections.values()) {\n      await connection.close();\n    }\n    this._connections.clear();\n  }\n\n  @trace.span({ showInBrowserTimeline: true })\n  async connectToSpace(ctx: Context, spaceId: SpaceId): Promise<void> {\n    log('connectToSpace', { spaceId });\n    using _guard = await this._mutex.acquire();\n\n    if (this._connectedSpaces.has(spaceId)) {\n      return;\n    }\n    this._connectedSpaces.add(spaceId);\n\n    if (this._context !== null) {\n      await this._openConnection(spaceId);\n    }\n  }\n\n  async disconnectFromSpace(spaceId: SpaceId): Promise<void> {\n    using _guard = await this._mutex.acquire();\n\n    this._connectedSpaces.delete(spaceId);\n\n    const connection = this._connections.get(spaceId);\n    if (connection) {\n      await connection.close();\n      this._connections.delete(spaceId);\n    }\n  }\n\n  private async _openConnection(spaceId: SpaceId, reconnects: number = 0): Promise<void> {\n    invariant(this._context);\n    invariant(!this._connections.has(spaceId));\n\n    let restartScheduled = false;\n\n    const connection = new EdgeSubductionReplicatorConnection({\n      edgeConnection: this._edgeConnection,\n      spaceId,\n      context: this._context,\n      sharedPolicyEnabled: !this._disableSharePolicy,\n      onRemoteConnected: async () => {\n        log.trace('dxos.echo.edge.subduction-replicator.onRemoteConnected', { spaceId });\n        this._context?.onConnectionOpen(connection);\n      },\n      onRemoteDisconnected: async () => {\n        log.trace('dxos.echo.edge.subduction-replicator.onRemoteDisconnected', { spaceId });\n        this._context?.onConnectionClosed(connection);\n      },\n      onRestartRequested: async () => {\n        if (!this._ctx || restartScheduled) {\n          return;\n        }\n\n        const restartDelay =\n          Math.min(MAX_RESTART_DELAY, INITIAL_RESTART_DELAY * reconnects) + Math.random() * RESTART_DELAY_JITTER;\n\n        log('connection restart scheduled', { spaceId, reconnects, restartDelay });\n\n        restartScheduled = true;\n        scheduleTask(\n          this._ctx!,\n          async () => {\n            using _guard = await this._mutex.acquire();\n            if (this._connections.get(spaceId) !== connection) {\n              return;\n            }\n\n            const ctx = this._ctx;\n            await connection.close();\n            this._connections.delete(spaceId);\n            if (ctx?.disposed) {\n              return;\n            }\n            log.trace('dxos.echo.edge.subduction-replicator.restart', { spaceId, reconnects, restartDelay });\n            await this._openConnection(spaceId, reconnects + 1);\n          },\n          restartDelay,\n        );\n      },\n    });\n    this._connections.set(spaceId, connection);\n\n    await connection.open();\n  }\n}\n\ntype EdgeSubductionReplicatorConnectionProps = {\n  edgeConnection: EdgeConnection;\n  spaceId: SpaceId;\n  context: AutomergeReplicatorContext;\n  sharedPolicyEnabled: boolean;\n  onRemoteConnected: () => Promise<void>;\n  onRemoteDisconnected: () => Promise<void>;\n  onRestartRequested: () => Promise<void>;\n};\n\nclass EdgeSubductionReplicatorConnection extends Resource implements AutomergeReplicatorConnection {\n  private readonly _connectionId = randomUUID();\n  private readonly _edgeConnection: EdgeConnection;\n  private readonly _remotePeerId: string;\n  private readonly _subductionServiceId: string;\n  private readonly _spaceId: SpaceId;\n  private readonly _context: AutomergeReplicatorContext;\n  private readonly _sharedPolicyEnabled: boolean;\n  private readonly _onRemoteConnected: () => Promise<void>;\n  private readonly _onRemoteDisconnected: () => Promise<void>;\n  private readonly _onRestartRequested: () => void;\n\n  private _readableStreamController!: ReadableStreamDefaultController<AutomergeProtocolMessage>;\n\n  public readable: ReadableStream<AutomergeProtocolMessage>;\n  public writable: WritableStream<AutomergeProtocolMessage>;\n\n  constructor({\n    edgeConnection,\n    spaceId,\n    context,\n    sharedPolicyEnabled,\n    onRemoteConnected,\n    onRemoteDisconnected,\n    onRestartRequested,\n  }: EdgeSubductionReplicatorConnectionProps) {\n    super();\n    this._edgeConnection = edgeConnection;\n    this._spaceId = spaceId;\n    this._context = context;\n    this._sharedPolicyEnabled = sharedPolicyEnabled;\n    // Generate a unique peer id for every connection so sync-state is fresh on reconnect.\n    this._subductionServiceId = compositeKey(EdgeService.SUBDUCTION_REPLICATOR, spaceId);\n    this._remotePeerId = `${this._subductionServiceId}-${this._connectionId}`;\n    this._onRemoteConnected = onRemoteConnected;\n    this._onRemoteDisconnected = onRemoteDisconnected;\n    this._onRestartRequested = onRestartRequested;\n\n    this.readable = new ReadableStream<AutomergeProtocolMessage>({\n      start: (controller) => {\n        this._readableStreamController = controller;\n      },\n    });\n\n    this.writable = new WritableStream<AutomergeProtocolMessage>({\n      write: async (message: AutomergeProtocolMessage) => {\n        await this._sendMessage(this._ctx, message);\n      },\n    });\n  }\n\n  protected override async _open(ctx: Context): Promise<void> {\n    log('opening...');\n\n    this._ctx.onDispose(\n      this._edgeConnection.onMessage((msg: RouterMessage) => {\n        this._onMessage(msg);\n      }),\n    );\n\n    let firstReconnect = true;\n    this._ctx.onDispose(\n      this._edgeConnection.onReconnected(async () => {\n        if (firstReconnect) {\n          log.verbose('first reconnect skipped');\n          firstReconnect = false;\n          return;\n        }\n\n        this._onRestartRequested();\n      }),\n    );\n\n    await this._onRemoteConnected();\n  }\n\n  protected override async _close(ctx: Context): Promise<void> {\n    log('closing...');\n    this._readableStreamController.close();\n    await this._onRemoteDisconnected();\n  }\n\n  get peerId(): string {\n    return this._remotePeerId;\n  }\n\n  get bundleSyncEnabled(): boolean {\n    return false;\n  }\n\n  async shouldAdvertise(params: ShouldAdvertiseProps): Promise<boolean> {\n    if (!this._sharedPolicyEnabled) {\n      return true;\n    }\n    const spaceId = await this._context.getContainingSpaceIdForDocument(params.documentId);\n    if (!spaceId) {\n      const remoteDocumentExists = await this._context.isDocumentInRemoteCollection({\n        documentId: params.documentId,\n        peerId: this._remotePeerId as PeerId,\n      });\n      log.verbose('document not found locally for share policy check', {\n        documentId: params.documentId,\n        acceptDocument: remoteDocumentExists,\n        remoteId: this._remotePeerId,\n      });\n      // If a document is not present locally return true only if it already exists on edge.\n      return remoteDocumentExists;\n    }\n    return spaceId === this._spaceId;\n  }\n\n  shouldSyncCollection(params: ShouldSyncCollectionProps): boolean {\n    if (!this._sharedPolicyEnabled) {\n      return true;\n    }\n    const spaceId = getSpaceIdFromCollectionId(params.collectionId as CollectionId);\n    // Only sync collections of form `space:id:rootDoc`; edge ignores legacy `space:id` collections.\n    return spaceId === this._spaceId && params.collectionId.split(':').length === 3;\n  }\n\n  private _onMessage(message: RouterMessage): void {\n    if (message.serviceId !== this._subductionServiceId) {\n      return;\n    }\n\n    const payload = cbor.decode(message.payload!.value) as any;\n\n    // Out-of-band reconnect signal from the edge (sent after DO hibernation).\n    if (payload?.type === 'subduction-reconnect') {\n      log.info('received subduction-reconnect signal');\n      this._onRestartRequested();\n      return;\n    }\n\n    log.verbose('received subduction frame', { remoteId: this._remotePeerId });\n\n    // Fix the peer id so subduction routing inside the Repo accepts the frame.\n    const msg = payload as AutomergeProtocolMessage;\n    msg.senderId = this._remotePeerId as PeerId;\n    this._readableStreamController.enqueue(msg);\n  }\n\n  private async _sendMessage(ctx: Context, message: AutomergeProtocolMessage): Promise<void> {\n    // Fix the peer id for the outbound frame.\n    (message as any).targetId = this._subductionServiceId as PeerId;\n\n    log.verbose('sending...', {\n      type: message.type,\n      serviceId: this._subductionServiceId,\n      remoteId: this._remotePeerId,\n    });\n\n    const encoded = cbor.encode(message);\n\n    try {\n      await this._edgeConnection.send(\n        ctx,\n        buf.create(RouterMessageSchema, {\n          serviceId: this._subductionServiceId,\n          source: {\n            identityKey: this._edgeConnection.identityKey,\n            peerKey: this._edgeConnection.peerKey,\n          },\n          payload: { value: bufferToArray(encoded) },\n        }),\n      );\n    } catch (err) {\n      log.error('failed to send message', { err });\n    }\n  }\n}\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { type DatabaseDirectory, EncodedReference, ObjectStructure } from '@dxos/echo-protocol';\n\n/**\n * Assumes properties are at root.\n */\nexport const findInlineObjectOfType = (\n  spaceDoc: DatabaseDirectory,\n  typename: string,\n): [string, ObjectStructure] | undefined => {\n  for (const id in spaceDoc.objects ?? {}) {\n    const obj = spaceDoc.objects![id];\n    const objType = ObjectStructure.getTypeReference(obj);\n    if (objType) {\n      const typeDXN = EncodedReference.toDXN(objType);\n      const typeDXNInfo = typeDXN.asTypeDXN();\n      if (typeDXNInfo?.type === typename) {\n        return [id, obj];\n      }\n    }\n  }\n\n  return undefined;\n};\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAIA,YAAYA,OAAO;AAEnB,YAAYC,YAAY;AAGxB,SAASC,mBAAmBC,uBAAuB;AACnD,SAASC,6BAA6B;AAEtC,SAASC,iBAAiB;AAC1B,SAASC,WAAW;AAKpB,IAAA,eAAMC;;;;;;;UAU+C,CAAA,UAAQA;IAE3D,GAAA;;;;;EAMF,QAAA,CAAA,WAAA,SAAA,OAAA,MAAA,eAAA,IAAA,CAAA;;IAKI,aAAa,CAAA,QAAA,iBAAgB;AAC/B,MAAA,CAAA,QAAA;AACA,WAAOC;EACT;AAEA,SAAA,WAAA,WAAA,OAAA,YAAA;;AAOW,IAAA,sBAAA,MAA8B;EAEvC,aAAYC;;EAEZ,YAAA,eAAA;AAEAC,SAAAA,iBAEEC;;oBAIE,KAAA,SAAA,MAAA;WACMC,WAAAA,MAAY,aAAIC;YAEpB,YAAWC,oBAAAA,IAAU;iBACnBF,UAAa,SAAQE;AACvB,YAAA,OAAA,YAAA;AACF,oBAAA,IAAA,OAAA,YAAA,OAAA,OAAA,MAAA,CAAA;QAEA;MACA;YAEE,mBAAoBC,OAASC,eAAAA,YAAAA;AAE7B,cAAA,SAAW,CAAA;cACT,QAAMC,MAAAA,SAAiBL;yBACnBM,EAAWD,YAAAA,MAAgBE,KAAAA,KAAQ,eAAA,kBAAA,GAAA;gBACrCC,iBAAY,UAAA,IAAA,UAAA;yBAAEC,gBAAAA,KAAAA,GAAAA;mBAAYF,KAAAA;cAAM;cAC5BC;;AAEJ,gBAAA,OAAA,UAAA,OAAA;AACF;YACF;UACA;QACF;AAEA,eAAA;MACA,CAAA;AAGA,YAAK,UAAQC,CAAAA;YACX,iBAAI,CAAA;iBACF,EAAA,YAAe,OAAOC,SAAOC,KAAQ,kBAAW;YAChD;AACA,gBAAKC,SAAK,OAAA,eAAA,MAAA,KAAA,eAAA,QAAA,KAAA,UAAA,CAAA;gBACR,MAAA,OAAA,IAAA;AACF,cAAA,CAAA,KAAA;AAEA;UACA;AAEA,cAAA,IAAA,YAAA,gBAAA,SAAA;AAEA;UACA;gBAGE,cAAA,kBAAA,YAAA,GAAA;AACF,cAAA,CAAA,aAAA;AACA;UACA;AAEA,gBAAMP,WAAAA,UAAiBL,QAAUa,WAAIJ;AACrC,gBAAM,UAAEK,OAAkBC,eAAW,MAAGC,qBAAuBX,QAAAA,CAAAA;AAE/D,gBAAMY,iBAAiBC,UAAO,IAAK,UAAA;AACnC,gBAAK,EAAA,kBAAiBC,UAAcC,IAAAA,kBAAeH,KAAa,cAAA;gBAC9D,aAAIH,IAAAA,WAAqBA,CAAAA;qBACvB,CAAA,UAAA,SAAA,KAAA,OAAA,QAAA,UAAA,GAAA;AACF,gBAAA,oBAAA,CAAA,iBAAA,IAAA,QAAA,GAAA;AACAI;;oBAEET,KAAAA;cACAY;cACAC;cACAC,SAAAA;cACAC,gBAAMC;cACNV,UAAAA;cACF,MAAA,sBAAA,UAAA,SAAA;cACF;YAEA,CAAA;UACAW;yBAEExB,KAAYO;YACZb;YACF,YAAA;YACA,QAAc,WAAA,OAAA,QAAA;UACd+B,CAAAA;iBAAmDlB,OAAAA;cAAYmB,MAAAA,uCAAAA;YAAM;YACvE;UACF,GAAA,EAAA,YAAA,YAAA,GAAA,cAAA,GAAA,KAAA,GAAA,KAAA,CAAA;QAEA;;aAAkB7B;QAAwB;QAC5C,SAAA;MACF;IACF,CAAA;EAEA;;IAYI,oBAAO,CAAA,KAAA,mBAAA;uBAAEe;WAAwBC;MAAsB,kBAAA;MACzD,WAAA,KAAA,IAAA;IAEA;EAEA;AACA,QAAMD,WAAAA,WAAmB,OAAIe,cAAAA;AAC7B,QAAK,UAAMC,OAASC,KAAS,UAAA,WAAA,GAAA,CAAA;QAC3B,mBAAqB,oBAAI,IAAA;aACvBjB,SAAAA,SAAoB;AACtB,QAAA,MAAA,KAAA,UAAA,KAAA,MAAA,KAAA,CAAA,MAAA,WAAA;AACF,uBAAA,IAAA,OAAA,MAAA,KAAA,CAAA,CAAA,CAAA;IAEA;EACA;AACA,QAAK,UAAMkB,sBAAmB,KAAA,QAAA;MAC5B,UAAIA;aACFC,UAAUD,SAAW;AACvB,QAAA,OAAA,OAAA,SAAA;AACF,gBAAA,OAAA;IACA;EAEA;QAASlB,YAAAA,UAAAA,IAAAA,UAAAA,MAAAA,KAAAA,IAAAA;SAAkBC;IAAU;IACvC;;;;;ACpLA,SAASmB,mBAAAA,wBAAuB;AAEhC,SAASC,cAAc;AACvB,SAASC,eAAe;AACxB,SAASC,aAAAA,kBAAiB;AAC1B,SAASC,WAAAA,gBAAe;AACxB,SAASC,OAAAA,YAAW;;;ACCpB,SASEC,YAIAC,YAAAA,WAAAA,UACAC,aAAc,aACT,YAAA;AAGP,SAASC,MAAAA,uBAAqBC,sBAAoB;AAClD,SAAkCC,cAAUC,SAAAA,QAAAA,oBAAyB;AACrE,SAA4BC,YAAAA,WAAAA,yBAAyB;AACrD,SAASC,qBAAAA,0BAAiB;AAC1B,SAASC,aAAAA,kBAAiB;AAE1B,SAASC,aAAAA,kBAAW;AAGpB,SAASC,OAAAA,YAAK;AACd,SAASC,SAAAA,cAAYC;AAErB,SAA+BC,YAAAA,eAAwBC,cAAAA,aAAAA,iBAAAA,gBAA2B,aAAA;;;ACrClF,SAAA,QAAYC,UAAW;AACvB,YAAYC,YAAAA;AAEZ,YAASC,YAAOC;AAChB,SAAuBC,OAAAA,aAAgB,cAAgB,4BAAA;AACvD,SAASC,gBAAW;AACpB,SAASC,OAAAA,YAAK;AACd,SAASC,aAAU;AAEnB,SAAMC,kBAAqB;AAf3B,IAAEC,gBAAA;;;;;;AAIF;AAaA,IAAMC,qBAAgB;AAYtB,IAAA,gBAAaC;AACMC,IAAAA,yBAAAA,cAAyE,SAAA;EACzEC;EACAC;EAEjB;;;;EAIiBC,uBAAyBC,oBAAAA,IAAc;EAEvCC,qBAAkB,oBAAID,IAAc;EAErCE,kBAAAA,oBAAqB,IAAIhB;EAEzC,qBAAiD,IAAA,MAAA;cAC1C,QAAA;AACL,UAAKU;AACL,SAAKC,uBAAqB,OAAGM;AAC7B,SAAKL,wBAAwBK,OAAOC;AACtC,SAAA,wBAAA,OAAA;EAEA;QACEC,MAAAA,KAAAA;yBAGeC,KAAAA,MAAgB,YAAKC;iBAC1B,gBAAKR,KAAmBS,qBAAmB,KAAA,GAAA;YAC7C,KAAKC,mBAAkBH,IAAAA,YAAAA,GAAAA;AACvB,eAAA,kBAAMnB,YAAAA;AACR,gBAAA,YAAA;QACF;MAEFO;IAEJ,GAAA,aAAA;EAEAgB;+BACS;WAAI;MAAwB,GAAA,KAAA;IACrC;EAEAC;0BACcJ,cAAqBK;AACnC,WAAA,KAAA,qBAAA,IAAA,YAAA,GAAA;EAEAC;0BACOd,cAAuBO,OAAAA;AAE5BjB,SAAI,mBAAA,IAAA,YAA2B;SAAEiB,2BAAAA;MAAcQ;MAAM;IACrD,GAAA,EAAA,YAAMC,YAAAA,GAAqBtB,eAAKuB,GAAAA,IAAAA,GAAAA,KAAAA,CAAAA;AAChCD,UAAAA,qBAAmBE,KAAaH,+BAAAA,YAAAA;AAEhC,uBAAWI,aAAejB;eACnBkB,UAAAA,KAAAA,iBAAqBb;AAC5B,WAAA,qBAAA,cAAA,MAAA;IAEA;AACF,SAAA,mBAAA,YAAA;EAEA;;;;;;;;qBAQQS,cAAyB;AAC/BK,UAAAA,qBAAe,KAAA,+BAAA,YAAA;mBACRC,MAAAA;AACL,WAAKC,wBAAqBhB,YAAAA;AAC1B,WAAKG,qBAAkBH,YAAAA;AACzB,WAAA,kBAAA,YAAA;IACF,CAAA;EAEAiB;4BACOxB,cAA0BO;AAC/B,SAAKC,mBAAAA,OAAqBiB,YAAOlB;AACjCjB,SAAI,qBAAA,OAA6B,YAAA;SAAEiB,6BAAAA;MAAa;IAClD,GAAA,EAAA,YAAA,YAAA,GAAAb,eAAA,GAAA,IAAA,GAAA,KAAA,CAAA;EAEAgC;4BACcT,cAAAA;AACd,WAAA,KAAA,+BAAA,YAAA,EAAA;EAEAP;oBACMiB,cAAAA;AACJ,QAAA,yBAAmBV;AACnB,UAAK,QAAME,KAAAA,+BAAgC,YAAA;eACrCJ,UAAMa,KAAAA,iBAAoBT;UAC5B,MAAMU,gBAAcd,IAAMc,MAAAA,GAAAA;AAC1B,cAAIC,cAAaD,MAAAA,YAAcpC,IAAAA,MAAAA,KAAoB;YACjDsB,KAAAA,IAAMc,IAAAA,cAAgBV,oBAAgB;AACtC,gBAAKrB,YAAAA,IAAAA,QAAsBS,KAAAA,IAAAA,CAAAA;AAC7B,eAAO,sBAAA,cAAA,MAAA;eACLoB;AACF,mCAAA;QACF;MACF;IACA;QACEI,wBAAwB;AAC1B,mBAAA,KAAA,MAAA,MAAA,KAAA,kBAAA,YAAA,GAAA,kBAAA;IACF;EAEA;;;;mBAIM,QAAA;SAAsBZ,oBAAAA;MAAO;IACjC,GAAA,EAAA,YAAMa,YAAmBb,GAAAA,eAAAA,GAAAA,KAAAA,GAAAA,KAAAA,CAAAA;AACzB,UAAA,SAAA,UAAA,MAAA;SAIEc,MAAID,UAAAA;MACJE,IAAAA;MACAC,YAAU;MACVC,UAAAA;MACAC,WAAAA,KAAAA;MACAC,uBAAY;kBAAEnB;QAAO;MACvB;IACA,CAAA;AAEAE,SAAAA,gBAAe,IAAA,MAAA;mBACJkB,YAAKC;UACZ,KAAA,KAAA,UAAA;AACF;MACA;iBACM,CAAI,cAACxC,KAAkB,KAAKO,KAAAA,qBAAsBR,QAAAA,GAAAA;YACpDgB,KAAAA,mBAAsB0B,IAAItB,YAAAA,KAAAA,KAAAA,sBAAAA,cAAAA,MAAAA,GAAAA;AAC1BJ,gBAAMc,gBAAgBV,IAAAA,MAAQW;AAC9B,gBAAKhC,YAAAA,IAAAA,QAAsBS,KAAAA,IAAAA,CAAAA;AAC7B,eAAA,sBAAA,cAAA,MAAA;QACF;MACF;IACF,CAAA;EAEA;;;;qBAIM,QAAA;SAAwBY,sBAAAA;MAAO;IAEnC,GAAA,EAAA,YAAKjB,YAAgBuB,GAAM/B,eAACyB,GAAAA,KAAAA,GAAAA,KAAAA,CAAAA;AAE5B,SAAK,gBAAMH,OAAAA,MAAsB;eAC/BA,sBAAmB0B,KAAajB,qBAAON,OAAAA,GAAAA;AACzC,yBAAA,aAAA,OAAA,MAAA;IACF;EAEA;;;;;;;2BAOQH,cAA0BC,QAAAA;AAEhC,UAAID,qBAAmBE,KAAAA,+BAAY,YAAA;QACjC,mBAAKrB,YAAqBU;AAC5B,WAAA,qBAAA,cAAA,QAAA,mBAAA,UAAA;IACF;EAEA;;;;wBAIM,cAAyB,QAAA,OAAA;SAAEA,yBAAAA;MAAcY;MAAQJ;MAAM;IAC3D4B,GAAAA,EAAAA,YAAAA,YAAwB5B,GAAAA,eAAAA,GAAAA,KAAAA,GAAAA,KAAAA,CAAAA;AACxB,4BAAMC,KAAqB;AAC3BA,UAAAA,qBAAmB0B,KAAaE,+BAAY7B,YAAAA;AAC5C,uBAAKK,aAAqBb,IAAAA,QAAcY,KAAAA;AAC1C,SAAA,qBAAA,cAAA,MAAA;EAEQC;uBACAJ,cAAyB,QAACC;AAChC,UAAM4B,qBAAc7B,KAAAA,+BAAoCG,YAAAA;AACxD,UAAK0B,cAAa,mBAAA,aAAA,IAAA,MAAA;QAChB,CAAA,aAAA;AACF;IAEAvD;SAA6BiB,uBAAAA;MAAcY;MAAO;IAClD,GAAA,EAAA,YAAMD,YAAaF,GAAAA,eAAmBE,GAAAA,KAAAA,GAAU,KAAI,CAAA;UAAE4B,aAAY,mBAAA,cAAA;MAAE,WAAA,CAAA;IACpE;AACA,UAAMd,QAAAA,oBAAmBb,YAAAA,WAAAA;AACzB,UAAI4B,SAAKC,UAAgB,MAAK;QAC5BzD,MAAAA,UAAcyC,WAAAA,GAAAA;AAChB,YAAO,QAAA,MAAA;WACL;WAEEC,MAAID,UAAAA;QACJE,IAAAA;QACAC,YAAU;QACVC,UAAAA;QACAC,WAAAA,KAAAA;QACAC,uBAAY;oBAAEnB;UAAO;QACvB;MACF,CAAA;IACA7B;SACE4B,QAAAA;MACA2B,YAAAA,WAAaA;MACbI,aAAAA,YAAqBA;MACrBC,gBAAAA,MAAiBH;MACjBC,iBAAgBA,MAAAA;MAClB,WAAAD,MAAA;IACA,GAAA,EAAA,YAASE,YAAeE,GAAAA,eAAcJ,GAAAA,KAAKC,GAAAA,KAAS,CAACG;QACnD7D,MAAI,eAAA,SAAA,KAAAyD,MAAA,UAAA,SAAA,KAAAA,MAAA,gBAAA,SAAA,GAAA;AACJ,MAAAzD,KAAI,4BAAyB,QAAA,EAAA,YAAA,YAAA,GAAAI,eAAA,GAAA,KAAA,GAAA,KAAA,CAAA;WAC3ByB,mBAAAA,KAAAA;QACAZ;QACA6C;QACF,iBAAAL,MAAA,eAAA,SAAA;MACF,CAAA;IACF;EAEQ9B;iCACiBT,cAAAA;sBACrBU,KAAYmC,sBAAAA,cAAAA,OAAAA;MACZX,YAAAA;MACAd,cAAAA,oBAAiB,IAAI3B;MACrB4B,iBAAiByB,oBAAAA,IAAAA;MACjBC,aAAAA,oBAAe,IAAID;MACrB,eAAA,oBAAA,IAAA;IACF,EAAA;EAEA;;;;;;;;uBAQgBd,cAAkBxC;QAC9B,KAAA,KAAA,YAAA,CAAA,KAAA,mBAAA,IAAA,YAAA,GAAA;AACF;IACA;AACA,UAAMkB,qBAAaF,KAAAA,+BAA6B,YAAA;AAChD,UAAKE,aAAY,mBAAA;QACf,CAAA,YAAA;AACF;IACA;eACQqC,UAAAA,mBAAgBvC,iBAAmBuC;AACzC,YAAIzB,gBAAayB,mBAAgB9D,cAAoB,IAAA,MAAA,KAAA;UACnDuB,KAAAA,IAAAA,IAAAA,gBAAmBuC,oBAA0BzB;AAC7C,2BAAKjC,cAAqBU,IAAAA,QAAcY,KAAQD,IAAAA,CAAAA;AAClD,aAAA,qBAAA,cAAA,QAAA,UAAA;MACF;IACF;EAEQI;0BACKH,cAAejB;eACpB,UAAKH,KAAAA,iBAAsBQ;UAC7B,KAAKU,sBAAAA,cAA+BV,MAAAA,GAAcqB;AACpD,aAAO,+BAAA,YAAA,EAAA,gBAAA,IAAA,MAAA;aACL;AACF,aAAA,+BAAA,YAAA,EAAA,gBAAA,OAAA,MAAA;MACF;IACF;EACF;;yBArQO4B,aAAAA;QAAWC,SAAW;;;AA4R7B,GAAA,sBAAaC;AACX,IAAMC,sBAAwBC,CAAAA,OAAOC,WAAMf;AAC3C,QAAMgB,iBAAkB5E,cAAa,MAAC6E,WAAgB,CAAA,UAAGC,MAAUA,SAAY,CAAA;AAC/E,QAAA,kBAAA,cAAqC,OAAA,WAAA,CAAA,UAAA,MAAA,SAAA,CAAA;uBACJ;2BAAI9E,IAAAA;SAAuC+E,YAAKH,cAAAA;MAAiB,GAAA,YAAA,eAAA;IAAE,CAAA;EAEpG;AACA,QAAMb,kBAA+B,CAAE;AACvC,QAAMD,iBAA4B,CAAA;AAClC,QAAK,YAAMkB,CAAAA;aACJP,cAAeO,cAAa;QAC/BjB,CAAAA,eAAekB,UAAKD,GAAAA;AACtB,qBAAYJ,KAAAA,UAAgBI;eAC1BhB,CAAAA,gBAAqBgB,UAAAA,GAAAA;AACvB,sBAAoB,KAACL,UAAMf;eACzBE,CAAAA,GAAUmB,OAAKD,MAAAA,UAAAA,UAAAA,GAAAA,OAAAA,UAAAA,UAAAA,CAAAA,GAAAA;AACjB,gBAAA,KAAA,UAAA;IACF;EAEA;SACEhB;IACAD;IACAD;IACF;EACA;AAEF;IACEoB,0BAAqBtB,CAAAA,UAAWuB;SAC9B,QAAKC,MAAAA,SAAkBJ,EAAAA,QAA2B,CAAA,CAAA,YAAA,KAAA,MAAA;QAChD,CAAA,kBAAiB,UAAA,GAAA;AACnB,YAAA,IAAA,MAAA,uBAAA,UAAA,EAAA;IACA;QACQ,eAAIK,KAAO,KAAA,MAAA,KAAiBP,CAAAA,SAAO,OAAA,SAAA,QAAA,GAAA;AAC3C,YAAA,IAAA,MAAA,kBAAA,KAAA,EAAA;IACF;EACF,CAAA;AAEA;IACE,oBAAcE,CAAAA,eAAe;AAC/B,SAAA,OAAA,eAAA,YAAA,CAAA,WAAA,SAAA,GAAA;AAEA;AAEA,IAAMM,mBAAarD;IACjB,YAAQ,CAAA,WAAgB;AAC1B,SAAA,mBAAA,MAAA;;;;ACxVA,SAASsD,sBAAgBC;AACzB,SAAuBC,SAAAA,QAAAA,SAAc,oBAAQ;AAC7C,SAASC,sBAAiB;AAE1B,SAASC,iBAAW;AAEpB,SAASC,OAAAA,YAAAA;AAET,SAASC,qBAAoB;;;ACf7B,SAGEC,+BACAC,qCACK;AAIA,IAAMC,2BAA2B,CAACC,YACvCA,QAAQC,SAASJ;AAEZ,IAAMK,2BAA2B,CAACF,YACvCA,QAAQC,SAASH;;;ADnBnB,IAAEK,gBAAA;;;;;;AAIF;;EA4DmBC;EACjB,eAAA,oBAAA,IAAA;;;;EAIQC,eAAAA,oBAAkCC,IAAAA;EACzBC,kBAAiBC,eAAU;EAC3BC,aAAaD,IAAAA,QAAU;EAExBE,SAAAA,IAAAA,QAAoB;EAEpC,oBAA+D,IAAAC,OAAA;cACxD,SADsBC;AAE7B,UAAA,GAAA,KAAA,UAAA;EAESC;YACP;AACF,WAAA,KAAA,oBAAA,eAAA;EAESC;cACA;AACT,WAAA,KAAA,OAAA,KAAA;EAESC;UACH,QAAO,cAAGC;AACd,SAAKC,SAAAA;AACL,SAAKV,eAAe;AACtB,SAAA,WAAA,KAAA;EAESW;OACP,SAAU;AACZ,SAAA,MAAA,OAAA;EAESC;EACP,aAAQ;EAGV;QAEE,OAASd;QACP,KAAA,oBAAA,eAAA,MAAA;AACF;IACA;AACA,SAAKI,kBAAW,eAAA;AAClB,SAAA,OAAA,KAAA;EAEA;QAEE,QAASJ;QACP,KAAA,oBAAW,eAAA,QAAA;AACb,aAAA;IAEA;eACQe,cAAWD,KAAAA,cAAU;AAC7B,YAAA,WAAA,WAAA;IACA;AAEA,SAAKV,aAAY,MAAA;AACjB,SAAKJ,OAAAA,MAAAA;AACP,SAAA,kBAAA,eAAA;EAEA;QACE,gBAAWE;UAAkBc,KAAAA,WAAS,KAAA;MAAO,SAAA;IAC/C,CAAA;EAEOC;+BACcC,MAAY;AAC/B,UAAIC,QAAO,KAAA,aAAA,IAAA,IAAA;QACT,OAAKC;AACP,WAAA,8BAAA,MAAA,UAAA;IACF;EAEA;QAEEC,cAAerB,KAAAA,YAAe;AAC9BqB,cAAU,KAAKV,oBAAM,eAAA,MAAA,QAAA,EAAA,YAAA,YAAA,GAAAb,eAAA,GAAA,IAAA,GAAA,MAAA,GAAA,CAAA,gDAAA,EAAA,EAAA,CAAA;AACrBuB,cAAU,KAAK,QAACtB,QAAauB,EAAAA,YAAIP,YAAAA,GAAAA,eAAAA,GAAAA,IAAAA,GAAAA,MAAAA,GAAAA,CAAAA,eAAAA,EAAAA,EAAAA,CAAAA;AAEjC,cAAKhB,CAAAA,KAAAA,aAAiBgB,IAAAA,UAAAA,GAAAA,QAAAA,EAAAA,YAAAA,YAAAA,GAAAA,eAAAA,GAAAA,IAAAA,GAAAA,MAAAA,GAAAA,CAAAA,sCAAAA,EAAAA,EAAAA,CAAAA;AACtB,SAAA,aAAiBL,IAAAA,UAAa;UAC5BC,WAAaA,QAAM,KAAA;MACnBY,QAAAA,KAAAA;MACAC,kBAAAA,KAAoB,kBAAKC,KAAoBC,IAAK;MAClDT,oBAAAA,KAAAA,oBAAmCG,KAAAA,IAAAA;MACnCO,8BAA8B,KAAKpB,8BAAQoB,KAAAA,IAA4B;MACvEC,8BAAAA,KAAmC,QAAQ;MAC3CC,+BAAAA,KAAiC,QAAOC;uCACfvB,OAAQqB,eAAAA;AAC/B,cAAA,MAAOG,MAAMC,KAAAA,QAAAA,8BAA4B,UAAA;AAC3C,eAAA,MAAA,qBAAA,GAAA,IAAA;MACF;IACF,CAAA;EAEA;QAEEX,iBAAerB,YAAe;AAC9BqB,cAAU,KAAKtB,oBAAiBgB,eAAAA,MAAAA,QAAAA,EAAAA,YAAAA,YAAAA,GAAAA,eAAAA,GAAAA,IAAAA,GAAAA,MAAAA,GAAAA,CAAAA,gDAAAA,EAAAA,EAAAA,CAAAA;AAChC,cAAMA,KAAAA,aAAqB,IAAA,UAAA,GAAA,QAAA,EAAA,YAAA,YAAA,GAAAjB,eAAA,GAAA,IAAA,GAAA,MAAA,GAAA,CAAA,qCAAA,EAAA,EAAA,CAAA;AAC3B,UAAKC,WAAY,WAAQgB;AAC3B,SAAA,aAAA,OAAA,UAAA;EAEA;QACE,gBAAMkB,QAAkBf,QAAAA;AACxB,UAAKe,aAAY,KAAA,aAAA,IAAA,MAAA;QACf,CAAA,YAAO;AACT,aAAA;IAEA;AACF,WAAA,WAAA,WAAA,gBAAA,MAAA;EAEAC;uBACQD,QAAkBf,QAAAA;AACxB,UAAKe,aAAY,KAAA,aAAA,IAAA,MAAA;QACf,CAAA,YAAO;AACT,aAAA;IAEA;AACF,WAAA,WAAA,WAAA,qBAAA,MAAA;EAEAE;uBAC0C,cAAA,UAAA;UACtCC,UAAM;MACNC,MAAAA;MACAC,UAAAA,KAAAA;MACAC;MACF;IACA;AACF,SAAA,MAAA,OAAA;EAEAC;sBAC0C,cAAA,UAAA,OAAA;UACtCJ,UAAM;MACNC,MAAAA;MACAC,UAAAA,KAAAA;MACAC;MACAE;MACF;IACA;AACF,SAAA,MAAA,OAAA;EAEA;;iCAEyBvB,cAAawB;WAEhC,MAAOT,KAAAA,KAAWA,aAAWC,OAAAA,CAAAA,EAAAA,IAAAA,CAAAA,eAAqB;aAAEK,WAAAA,WAAAA,qBAAAA;QAAa;MAIlEI,CAAAA,IAAM,WAACC,WAAAA,SAAAA;IACZ,CAAA,EAAA,OAAA,aAAA;EAEAC;2BACqB,QAAK3B;AACxB,UAAKe,aAAY,KAAA,aAAA,IAAA,MAAA;QACf,CAAA,YAAO;AACT,aAAA;IACA;AACF,WAAA,WAAA,WAAA;EAEA;QACE,WAAMA,KAAAA,QAAkBf,QAAAA;AACxB,UAAKe,aAAY,KAAA,aAAA,IAAA,MAAA;QACf,CAAA,YAAUa;AACZ,YAAA,IAAA,MAAA,uBAAA;IACA;AACF,WAAA,WAAA,WAAA,WAAA,KAAA,MAAA;EAEA;QACE,WAAMb,KAAAA,QAAkBf,UAAY;AACpC,UAAKe,aAAY,KAAA,aAAA,IAAA,MAAA;QACf,CAAA,YAAUa;AACZ,YAAA,IAAA,MAAA,uBAAA;IACA;AACF,WAAA,WAAA,WAAA,WAAA,KAAA,QAAA;EAEQC;QACN,SAAMC;AACN,UAAKA,kBAAiB,KAAA,aAAA,IAAA,QAAA,QAAA;QACpB,CAAA,iBAAgB;AAClB,YAAA,IAAA,MAAA,uBAAA;IAEA;AAEAA,UAAAA,QAAAA,KAAgBC,IACbC;oBAEa,OAACC,MAASC,OAAAA,EAAAA,KAAAA,MAAkBC;AAEzCC,WAAM,QAACC,SAAAA,kBAAAA,SAAAA,KAAAA,IAAAA,IAAAA,KAAAA;aACFP,CAAAA,QAAAA;UACFQ,gBAAUD,QAAAA;AACZ,QAAAC,KAAA,MAAA,KAAA,QAAA,EAAA,YAAA,YAAA,GAAA1D,eAAA,GAAA,KAAA,GAAA,KAAA,CAAA;MAEA;AACF,WAAA,QAAA,SAAA,2BAAA,OAAA;IACJ,CAAA;EAEQ2D;oBACF,YAAqB;SAAE9C,qBAAmBA;MAAO,QAAA,WAAA;IACrDU,GAAAA,EAAAA,YAAW,YAAKH,GAAAA,eAAiBe,GAAAA,KAAWtB,GAAAA,KAAM,CAAA;AAClD,cAAMqC,CAAAA,KAAAA,aAAmC,IAAA,WAAA,MAAA,GAAA,QAAA,EAAA,YAAA,YAAA,GAAAlD,eAAA,GAAA,KAAA,GAAA,MAAA,GAAA,CAAA,6CAAA,EAAA,EAAA,CAAA;UACvC4D,kBAAQ;MACRzB,QAAAA;MACA0B;MACAV,QAAQhB,WAAW2B,SAASC,UAAS;MACrCC,QAAAA,WAAAA,SAAwBC,UAAAA;MAC1B,oBAAA,oBAAA,IAAA;IAEA;AAEA,SAAA,aAAA,IAAA,WAAyB,QAAA,eAAA;mBAEnB,YAAA;UACF;eACE,MAAA;AAEA,gBAAIC,EAAAA,MAAM,MAAA,IAAA,MAAA,gBAAA,OAAA,KAAA;cACR,MAAA;AACF;UAEA;AACF,eAAA,WAAA,iBAAA,KAAA;QACA;eACIhB,KAAAA;YACFQ,gBAAUD,QAAAA;AACZ,UAAAC,KAAA,MAAA,KAAA,QAAA,EAAA,YAAA,YAAA,GAAA1D,eAAA,GAAA,KAAA,GAAA,KAAA,CAAA;QACF;MACF;IAEA0D,CAAAA;SAA6B7C,uBAAmBA;MAAO,QAAA,WAAA;IACvD,GAAA,EAAA,YAAKsD,YAAmBhC,GAAAA,eAAAA,GAAAA,KAAAA,GAAAA,KAAAA,CAAAA;AACxB,SAAK1B,mBAAiB2D,UAAAA;AACxB,SAAA,QAAA,SAAA,oBAAA,WAAA,MAAA;EAEQC;aACAC,iBAAYf,SAAAA;AAClB,UAAIe,YAAc;QAChB,UAAK/D,SAAAA,WAAuB;WAC1ByB,kBAAYsC,KAAUtC;QACtBnB,YAAQqC,UAAAA;QACV,QAAA,gBAAA,WAAA;MACF,CAAA;IAEA;QACE,yBAAaqB,OAAAA,GAAAA;AACf,WAAO,QAAIC,yBAAyBjB,QAAU,cAAA,QAAA,QAAA;eACvC9C,yBAAQgE,OAA0BlB,GAAAA;AACzC,WAAO,QAAA,0BAAA,QAAA,cAAA,QAAA,UAAA,QAAA,KAAA;WACL;AACF,WAAA,KAAA,WAAA,OAAA;IACA;AACF,SAAA,QAAA,SAAA,sBAAA,OAAA;EAEQ5B;sBACF,YAAqB;SAAEd,qBAAmBA;MAAO,QAAA,WAAA;IACrD,GAAA,EAAA,YAAc,YAAKO,GAAAA,eAAiBe,GAAAA,KAAAA,GAAWtB,KAAAA,CAAM;AACrDU,UAAAA,QAAUF,KAAAA,aAAAA,IAAAA,WAAAA,MAAAA;AAEVA,cAAMuC,OAAS,QAAA,EAAA,YAAA,YAAA,GAAA5D,eAAA,GAAA,KAAA,GAAA,MAAA,GAAA,CAAA,SAAA,EAAA,EAAA,CAAA;AACf,UAAK0E,SAAK;SAAuB7D,KAAAA,qBAAyB;MAAW,QAAA,WAAA;IACrE,CAAA;AAEA,SAAKQ,QAAM8B,SAAOwB,uBAA2BnB,WAAMC,MAAAA;AACnD,SAAKpC,MAAMwC,OAAOe,MAAM,EAAA,MAAQ,CAAC,QAACnB,KAAQC,MAAS,KAACD,QAAAA,EAAAA,YAAAA,YAAAA,GAAAA,eAAAA,GAAAA,KAAAA,GAAAA,KAAAA,CAAAA,CAAAA;AAEpD,SAAKrC,MAAAA,OAAayD,OAAO1C,EAAAA,MAAAA,CAAAA,QAAWtB,KAAM,MAAA,KAAA,QAAA,EAAA,YAAA,YAAA,GAAAb,eAAA,GAAA,KAAA,GAAA,KAAA,CAAA,CAAA;AAC5C,SAAA,aAAA,OAAA,WAAA,MAAA;EAEA;;;;;gCAKM,YAAiC;SAAEa,iCAAyB;MAAC,QAAA,WAAA;IACjE,GAAA,EAAA,YAAc,YAAKO,GAAAA,eAAiBe,GAAAA,KAAAA,GAAWtB,KAAAA,CAAM;AACrDU,UAAAA,QAAUF,KAAAA,aAAAA,IAAAA,WAAAA,MAAAA;AACV,cAAU,OAAA,QAAA,EAAA,YAAqB,YAAA,GAAArB,eAAA,GAAA,KAAA,GAAA,MAAA,GAAA,CAAA,SAAA,EAAA,EAAA,CAAA;SAAEa,KAAAA,qBAAyB;MAAW,QAAA,WAAA;IACrE,CAAA;AACF,SAAA,mBAAA,UAAA;EAEQsD;qBACI,YAAA;SACRtD,KAAAA,kBAAmBA;MACnBC,QAAAA,WAAcgE;MAChB,cAAA,uBAAA;IACF,CAAA;EACF;;;;;;;;;;;;;AAEA,GAAA,mBAAaA,WAAAA,oBACV,IAAA;IACC,yBAAA,OAAmC;;EAE3B,iBAAA;AAEZ;;;;AE9SO,IAAMC,iBAAiB,CAACC,MAAYC,eAAAA;AACzC,MAAI,CAACD,KAAKE,QAAQD,UAAAA,GAAa;AAC7B,WAAOE;EACT;AACA,SAAOH,KAAKI,iBAAiBH,UAAAA,EAAYI,KAAI,EAAGC;AAClD;;;ACnDA,SAASC,OAAAA,YAAW;AACpB,SAASC,cAAc;AAGvB,IAAAC,gBAAA;AAIA,IAAAC;IACEC,gBAAsCC,MAAAA,gBAAgBD,OAAO,gBAAA,uBAAA;oBAAUE;UAAM,CAAA,UAAA,cAAA,EAAA,OAAA;IACrE,QAACC;EACP,CAAA;UACE,CAAA,iBAAOF;AACT,QAAE;AACA,aAAA,cAAA,EAAA,OAAA,YAAkC,EAAA;YAC9BG;AAEJ,MAAAR,KAAA,KAAMS,iDAAU,QAAA,EAAA,YAAA,YAAA,GAAAP,eAAA,GAAA,IAAA,GAAA,OAAA,CAAA;AAChB,YAAK,oBAAeQ,OAAAA,KAAkBC,YAAa,EAAA,SAAI,MAAA,EAAA,QAAA,MAAA,EAAA;YACrDF,QAAU,CAACC;AACb,eAAA,IAAA,GAAA,IAAA,kBAAA,QAAA,KAAA,IAAA;AACA,cAAOD,KAAAA,kBAAAA,MAAAA,GAAAA,IAAAA,EAAAA,CAAAA;MACT;AACF,aAAA;IACAG;EACF;EAMA,QAAO;;AAGL,IAAA,aAAA,MAAqC;;EAErC,YAAA,EAAA,GAAA,GAAA;AAEAC,SAASC,MAAAA;;WAELC,YAAU,OAAQ,OAAA;UAClBC,IAAAA,YAAa,OAAA;MACbC,UAAAA,KAAeC;MACjB,aAAA;MACF,eAAA;IAEA,CAAA;EACA;;iBAEIF,aAAa;WACbC,KAAAA,IAAAA,QAAeC,aAAAA;MACjB,aAAA;MACF,eAAA;IAEA,CAAA;;;;;SAKIF,aAAa;qBACbC,CAAAA,YAAeC,KAAAA,KAAAA,KAAAA,IAAAA,SAAAA;MACb,aAAA;MACF,eAAM;;YAAcT;QAAM;QAC5B;MACF;IACF;;;;;ACpEA,SAASU,YAAAA,iBAAgB;AAwBlB,IAAMC,wBAAN,cAAoCD,UAAAA;;EACzC,YAA6BE,SAAqC;AAChE,UAAK,GAAA,KADsBA,UAAAA;EAE7B;EAEA,MAAMC,KAAKC,UAAuD;AAChE,QAAI;AACF,UAAI,CAAC,KAAKC,QAAQ;AAEhB,eAAOC;MACT;AACA,YAAMC,UAAUC,KAAKC,IAAG;AACxB,YAAMC,QAAQ,MAAM,KAAKR,QAAQS,GAAGC,IAA4BR,UAAU;QAAE,GAAGS;MAAgB,CAAA;AAC/F,WAAKX,QAAQY,SAASC,kBAAkBL,MAAMM,UAAU;AACxD,WAAKd,QAAQY,SAASG,mBAAmBT,KAAKC,IAAG,IAAKF,OAAAA;AACtD,aAAOG;IACT,SAASQ,KAAU;AACjB,UAAIC,uBAAuBD,GAAAA,GAAM;AAC/B,eAAOZ;MACT;AACA,YAAMY;IACR;EACF;EAEA,MAAME,KAAKhB,UAAsBiB,QAAmC;AAClE,QAAI,CAAC,KAAKhB,QAAQ;AAChB,aAAOC;IACT;AACA,UAAMC,UAAUC,KAAKC,IAAG;AACxB,UAAMa,QAAQ,KAAKpB,QAAQS,GAAGW,MAAK;AAEnC,UAAM,KAAKpB,QAAQqB,WAAWC,aAAa;MAAEC,MAAMrB;MAAUkB;IAAM,CAAA;AACnEA,UAAMI,IAA4BtB,UAAUuB,OAAOC,KAAKP,MAAAA,GAAS;MAC/D,GAAGR;IACL,CAAA;AACA,UAAMS,MAAMO,MAAK;AACjB,SAAK3B,QAAQY,SAASgB,kBAAkBT,OAAOL,UAAU;AAEzD,UAAM,KAAKd,QAAQqB,WAAWQ,YAAY3B,QAAAA;AAC1C,SAAKF,QAAQY,SAASkB,oBAAoBxB,KAAKC,IAAG,IAAKF,OAAAA;EACzD;;;;EAKA,MAAM0B,UAAUC,SAAyD;AACvE,QAAI,CAAC,KAAK7B,UAAU6B,QAAQC,WAAW,GAAG;AACxC,aAAO7B;IACT;AACA,UAAMC,UAAUC,KAAKC,IAAG;AACxB,UAAMa,QAAQ,KAAKpB,QAAQS,GAAGW,MAAK;AAEnC,eAAW,CAAClB,QAAAA,KAAa8B,SAAS;AAChC,YAAM,KAAKhC,QAAQqB,WAAWC,aAAa;QAAEC,MAAMrB;QAAUkB;MAAM,CAAA;IACrE;AACA,eAAW,CAAClB,UAAUiB,MAAAA,KAAWa,SAAS;AACxCZ,YAAMI,IAA4BtB,UAAUuB,OAAOC,KAAKP,MAAAA,GAAS;QAC/D,GAAGR;MACL,CAAA;IACF;AACA,UAAMS,MAAMO,MAAK;AAEjB,QAAIO,cAAc;AAClB,eAAW,CAAChC,UAAUiB,MAAAA,KAAWa,SAAS;AACxCE,qBAAef,OAAOL;AACtB,YAAM,KAAKd,QAAQqB,WAAWQ,YAAY3B,QAAAA;IAC5C;AACA,SAAKF,QAAQY,SAASgB,kBAAkBM,WAAAA;AACxC,SAAKlC,QAAQY,SAASkB,oBAAoBxB,KAAKC,IAAG,IAAKF,OAAAA;EACzD;EAEA,MAAM8B,OAAOjC,UAAqC;AAChD,QAAI,CAAC,KAAKC,QAAQ;AAChB,aAAOC;IACT;AACA,UAAM,KAAKJ,QAAQS,GAAG2B,IAAgBlC,UAAU;MAAE,GAAGS;IAAgB,CAAA;EACvE;EAEA,MAAM0B,UAAUC,WAAyC;AACvD,QAAI,CAAC,KAAKnC,QAAQ;AAChB,aAAO,CAAA;IACT;AACA,UAAME,UAAUC,KAAKC,IAAG;AACxB,UAAMgC,SAAkB,CAAA;AACxB,qBAAiB,CAACC,KAAKC,KAAAA,KAAU,KAAKzC,QAAQS,GAAGiC,SAAiC;MAChFC,KAAKL;MACLM,KAAK;WAAIN;QAAW;;MACpB,GAAG3B;IACL,CAAA,GAAI;AACF4B,aAAOM,KAAK;QACVL;QACAM,MAAML;MACR,CAAA;AACA,WAAKzC,QAAQY,SAASC,kBAAkB4B,MAAM3B,UAAU;IAC1D;AACA,SAAKd,QAAQY,SAASG,mBAAmBT,KAAKC,IAAG,IAAKF,OAAAA;AACtD,WAAOkC;EACT;EAEA,MAAMQ,YAAYT,WAAsC;AACtD,QAAI,CAAC,KAAKnC,QAAQ;AAChB,aAAOC;IACT;AACA,UAAMgB,QAAQ,KAAKpB,QAAQS,GAAGW,MAAK;AAEnC,qBAAiB,CAACoB,GAAAA,KAAQ,KAAKxC,QAAQS,GAAGiC,SAAiC;MACzEC,KAAKL;MACLM,KAAK;WAAIN;QAAW;;MACpB,GAAG3B;IACL,CAAA,GAAI;AACFS,YAAMgB,IAAgBI,KAAK;QAAE,GAAG7B;MAAgB,CAAA;IAClD;AACA,UAAMS,MAAMO,MAAK;EACnB;AACF;AAEA,IAAMqB,aAAgE;EACpEC,QAAQ,CAACT,QACPf,OAAOC,KAAKc,IAAIU,IAAI,CAACC,MAAMA,EAAEC,WAAW,KAAK,KAAA,EAAOA,WAAW,KAAK,KAAA,CAAA,EAAQC,KAAK,GAAA,CAAA;EACnFC,QAAQ,CAACd,QACPf,OAAOC,KAAKc,GAAAA,EACTe,SAAQ,EACRC,MAAM,GAAA,EACNN,IAAI,CAACC,MAAMA,EAAEC,WAAW,OAAO,GAAA,EAAKA,WAAW,OAAO,GAAA,CAAA;EAC3DK,QAAQ;AACV;AAEO,IAAM9C,kBAAkB;EAC7B+C,aAAaV;EACbW,eAAe;AACjB;AAEA,IAAM1C,yBAAyB,CAACD,QAAsBA,IAAI4C,SAAS;;;ANnKnE,IAAEC,gBAAA;;;;;;AAIF;AA6FA,IAAA,0BAAA;AAKA,IAAA,cAAA;AAKA,IAAA,0BAAA;AAKA,IAAA,wBAAA;AAeA,IAAO,yBAA4BC;AAChBC,IAAa,gBAAbA,cAAaD,UAAA;EACbE;EAEAC;4BACO,IAAI,uBAAuBC;IACjDC,sBAAqB,KAAKC,sBAAqBF,KAAK,IAAI;IACxDG,qBAAAA,KAA0B,qBAACC,KAAsBJ,IAAK;IACrD,sBAAA,KAAA,sBAAA,KAAA,IAAA;EAEKK,CAAAA;EACAC;EACSC;EAETC;EACR,YAAA;;;;EAQQC,qBAAiB,IAAA,WAAA,CAAA,EAAA,cAAA,OAAA,MAAA,GAAA,YAAA,IAAA,MAAA,EAAA;EAERC;EACAC;EAEDC;EAEhB,yBAAA,IAAAC,OAAA;;;;EAKiBC,iBAAgB,IAAIC,OAAyB;EACtDC,gBAAAA,oBAAmC,IAAA;EAE3C;;;;EAKA,oBAAA,oBAAA,IAAA;;;;EAKA,mBAAA,oBAAA,IAAA;;;;EAKA,sBAAA,oBAAA,IAAA;;;;EAKQC,sBAAuC,oBAAA,IAAA;EAEvCC;EACSC,UAAAA;EAEjB;cAOO,EAAA,IAAA,aAAA,gBAAA,6BAAA,gBAAA,MAAA,GAAA;AACL,UAAKtB;AACL,SAAKsB,MAAAA;AACL,SAAKb,iBAAec;SAClBC,WAAOC,IAAS,sBAAA;MAChBC,IAAAA,GAAAA,SAAW,WAAA;iBACTC;QACAC,YAAW,OAAOC,WAAY,KAACC,YAAWD,MAAAA;QAC5C,WAAA,OAAA,QAAA,KAAA,WAAA,GAAA;MACAE;MACF,SAAA;IACA,CAAA;SACEC,sBAAAA,IAAAA,mBAAoCC;MACpCC,+BAA8B,KAAKC,+BAA8BhC,KAAK,IAAI;MAC1EiC,8BAA8B,KAACC,8BAA+B,KAAI,IAAA;MAClEC,0BAAAA,KAA+B,0BAACC,KAA2BpC,IAAK;MAChE4B,2BAASS,KAAAA,2BAAAA,KAAAA,IAAAA;MACX,SAAA;IACA,CAAA;SACEC,oBAAgBC,kBAAqBC,GAAAA,CAAAA,EAAQ,QAAUC,WAAWC,MAAAA;AAClE,MAAAJ,YAAUnB,KAAAA,qBAAgB,QAAA,MAAA,oBAAA,IAAA,CAAA,EAAA,IAAA,UAAA;UACxB,CAAA,KAAKF,gBAAAA;AACP,aAAA,wBAAA,SAAA;MACF;IACA,CAAA;SAAoCI,cAAe,IAAC,WAAA;MAAS,IAAA,GAAA,SAAA,OAAA;IAC7D,CAAA;AACA,SAAKV,kBAAAA;AACP,SAAA,+BAAA;EAEA;QACE,MAAKF,KAAO;AAEZ,SAAKO,UAAAA,QAAAA,KAAsB,kBAAiB,KAAK2B,WAAM,OAAA,EAAA,MAAA,CAAA;SACrD,sBAAuBC,IAAI,aAAM9B,KAAAA,MAAc+B,YAAO;AACtD,YAAK/B,WAAAA,MAAcgC,KAAK,KAAA,cAAA,QAAA,CAAA;AACxB,WAAKC,cAAAA,MAAgBC;AACvB,WAAA,gBAAA,QAAA;IAEA,CAAA;AAEA,UAAA,KAAA,SAAA,OAAA;AAOA,UAAI,eAAK7B;QACP,KAAA,gBAAoB;AACpB,YAAKD,EAAAA,aAAY+B,IAAAA,MAAaC,OAAQ,iCAAA;AAEtC,WAAK7C,YAAY8C,aAAK,SAAA;WACpBX,QAAQ,IAAK/B,KAAAA;QACb2C,QAAAA,KAAa;QACbC,aAAAA,KAAkB;QAClBC,kBAAchD,KAAQ;QACtBiD,SAAS,KAAE;QACXC,SAAQ,CAAA;QACRC,QAAAA,KAAAA;4BACE;;YAEEC,SAAAA,KAAaC;YACb,aAAA;;;;;YAKF,MAAA;UACD;QACH;MACF,CAAA;WACE;WAMEnB,QAAQ,IAAK/B,KAAAA;QACb2C,QAAAA,KAAa;QACbE,aAAa,KAAChD;QACdiD,SAAS,KAAA;iBAAMzD;UAAoB,KAAA;QACrC;MACF,CAAA;IAEA;AACAe,QAAAA,oBAAgBf;AAIhBe,IAAAA,OAAM+C,KAAK,KAAK9D,qBAAqB,gBAAA,EAAA,GAAqB+D,KACxD,MAAKlB,CAAI,MACPmB,CAAAA,qBAAgCC,KAAqB,iBAAKC,EAAAA,MAAsBxB,CAAAA;AAGpF,IAAA3B,OAAKd,KAAAA,KAAAA,qBAAwBkE,mBAA2BtB,EAAAA,GAAI,KAAKuB,MAAAA,CAAAA,MAAY,CAAA,qBAAUC,KAAiB,oBAAA,EAAA,MAAA,CAAA;SACtG,wBAAKC,mBAAgCF,GAAAA,KAAc1B,MAAAA,CAAAA,EAAAA,cAAAA,QAAAA,gBAAAA,MAAAA;AACnD,WAAK5B,gCAA4B,cAAA,MAAA;WAAEsD,uBAAcA,KAAAA;QAA6B;MAC9E,CAAA;UACEH,CAAAA,KAAAA,kBAAoB,iBAAA;AACpB,4BAAI;YACF;AACF,eAAU,oBAAA,6BAAA,MAAA;;AAEV,8BAAA;QACF;MACF;IAEA,CAAA;SACE,YAAMM,IAAAA,aAAmBC,KAAU,MAAMC,YAAAA;AACzC,YAAKA,mBAAmBzB,MAAK,KAAA,KAAA,mBAAA,OAAA,CAAA;AAC7B,WAAIuB,mBAAiBG,MAAM;UACzB,iBAAA,WAAA,GAAA;AACF;MACA;YAEI,QAAI,IAAA,iBAAA,IAAA,OAAA,EAAA,cAAA,OAAA,MAAA;YACF;AACA,gBAAOC,KAAK,sBAAA,KAAA,MAAA,cAAA,MAAA;iBACRC,KAAM;eAA+BR,MAAAA,6BAAAA;YAAc1B;YAAQiC;YAAI;UACrE,GAAA,EAAA,YAAA,YAAA,GAAA9E,eAAA,GAAA,KAAA,GAAA,KAAA,CAAA;QACF;MAEJ,CAAA,CAAA;IAEA,CAAA;SACEgF,0BAAI,IAAA,aAAA,KAAA,MAAA,YAAA;AACJ,MAAAA,KAAI,wBAAOC,QAAkB,EAAA,YAAA,YAAA,GAAAjF,eAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AAC/B,WAAA,MAAA,mBAAA;IAEA,CAAA;AACA,UAAM,KAAKI,oBAAAA,KAAwB8E;AACnC,UAAM,KAAK/E,wBAAoBgF,KAAAA,GAAAA;AACjC,UAAA,KAAA,oBAAA,cAAA;EAEA;QACE,OAAM,KAAK/E;AACX,UAAM,KAAKM,wBAAqBoE,MAAQE,GAAII;eAA+CN,MAAAA,MAAAA,EAAAA,MAAAA,CAAAA,QAAAA,KAAAA,KAAAA,wCAAAA;MAAI;IAC/F,GAAM,EAAA,YAAWO,YAAWC,GAAAA,eAAeN,GAAII,KAAK,GAAA,KAAA,CAAA,CAAA;eAA6BN,MAAAA,SAAAA,EAAAA,MAAAA,CAAAA,QAAAA,KAAAA,KAAAA,2BAAAA;MAAI;IACrF,GAAM,EAAA,YAAKnE,YAAc,GAAAX,eAAA,GAAA,KAAA,GAAA,KAAA,CAAA,CAAA;AACzB,UAAM,KAAKG,SAAAA,QAAAA;AACX,UAAKU,KAAAA,oBAAY0E,MAAAA;AACjB,SAAKlE,YAAAA;AACL,SAAKC,sBAAAA;AACP,SAAA,0BAAA;EAEA;MACE,SAAO;AACT,WAAA,KAAA;EAEA;MACE,kBAAkB;AACpB,WAAA,OAAA,KAAA,KAAA,MAAA,OAAA,EAAA;EAEA;MACE,UAAO;AACT,WAAA,KAAA,MAAA;EAEA;QACEkE,cAAeC,KAAM,YAAE;AACvB,IAAAD,WAAU,KAACrF,QAAAA,6BAAuCuF,EAAAA,YAAAA,YAAAA,GAAAA,eAAAA,GAAAA,KAAAA,GAAAA,MAAAA,GAAAA,CAAAA,eAAAA,6BAAAA,EAAAA,CAAAA;AACpD,UAAA,KAAA,oBAAA,cAAA,KAAA,UAAA;EAEA;QACEF,iBAAeC,YAAQ;AACvB,IAAAD,WAAU,KAACrF,QAAAA,6BAAqCuF,EAAAA,YAAAA,YAAAA,GAAAA,eAAAA,GAAAA,KAAAA,GAAAA,MAAAA,GAAAA,CAAAA,eAAAA,6BAAAA,EAAAA,CAAAA;AAClD,UAAA,KAAA,oBAAA,iBAAA,UAAA;EAEA;QACEF,QAAU,KAAKC,YAAQ,MAAA;AACvB,IAAAD,WAAA,KAAA,QAAA,6BAAA,EAAA,YAAA,YAAoE,GAAAxF,eAAA,GAAA,KAAA,GAAA,MAAA,GAAA,CAAA,eAAA,6BAAA,EAAA,CAAA;AAGpE,UAAM2F,WAAQC,KAAAA,MAAa,iBAAA,UAAA;AAC3B,UAAID,QAAMA,SAAU,KAAA;QAClB,MAAA,UAAaE,SAAM;AACrB,aAAA,MAAA;IACA;QACE,CAAA,KAAKC,gBAAAA;AACL,WAAKxE,oBAAAA,IAAyByE,SAAQ,UAAA;AACxC,WAAA,wBAAA,SAAA;IACA;AACA,UAAA,eAAaC,SACHC,UAAAA;AAEZ,WAAA,MAAA,UAAA,MAAA,kBAAA,KAAA,aAAA,cAAA,KAAA,OAAA,CAAA,IAAA,MAAA,kBAAA,KAAA,YAAA;EAEA;;;;;;;;;mBASiBR,YAAQ;AACvB,IAAAD,WAAO,KAAK9E,QAAMwF,6BAAoBnD,EAAAA,YAAAA,YAAAA,GAAAA,eAAAA,GAAAA,KAAAA,GAAAA,MAAAA,GAAAA,CAAAA,eAAAA,6BAAAA,EAAAA,CAAAA;AACxC,WAAA,KAAA,MAAA,iBAAA,UAAA;EAEA;QACEyC,UAAU,IAAKC;AACf,IAAAD,WAAMzC,KAAAA,QAAaoD,6BAAsBC,EAAAA,YAAAA,YAAAA,GAAAA,eAAAA,GAAAA,KAAAA,GAAAA,MAAAA,GAAAA,CAAAA,eAAAA,6BAAAA,EAAAA,CAAAA;AAEzC,UAAMC,aAAS,sBAAoBC,EAAAA;UAAWvD,SAAAA,MAAAA,KAAAA,SAAAA,UAAAA;MAAW;IACzD,CAAA;AACF,WAAA,cAAA,OAAA,OAAA,OAAA,IAAA,CAAA,MAAA,EAAA,IAAA,CAAA,CAAA;EAEA;;;;QAIEyC,UAAc,cAAS,MAAA;AACvB,IAAAA,WAAUe,KAAAA,QAAAA,6BAAiB,EAAA,YAAA,YAAA,GAAAvG,eAAA,GAAA,KAAA,GAAA,MAAA,GAAA,CAAA,eAAA,6BAAA,EAAA,CAAA;QACzB,MAAIwG,iBAAAA;UACF,wBAAoB9F,YAAgB8F;cAAgBC,UAAOC,KAAM3D,MAAAA,OAAAA,cAAAA;UAAW,OAAA,MAAA;QAC5E,CAAA;AACA,aAAK,kBAAKvB,IAAgBqE,QAAA,UAAA;YACxB,CAAA,KAAKvE,gBAAAA;AACP,eAAA,wBAAA,SAAA;QACA;AACF,eAAAuE;MAEA;UACE,CAAA,YAAUc,YAAU,GAAA;AACtB,cAAA,IAAA,UAAA,6CAAA;MAEA;YACoEF,SAAOC,KAAM3D,MAAAA,OAAAA,KAAAA,YAAAA,GAAAA;QAAW,OAAA,MAAA;MAC5F,CAAA;AACA,WAAK,kBAAKvB,IAAgB,OAAA,UAAA;UACxB,CAAA,KAAKF,gBAAAA;AACP,aAAA,wBAAA,SAAA;MACA;AACF,aAAO;WACL;UACE,wBAAgB,YAAA;AAClB,cAAA,IAAA,MAAA,mEAAA;MAEA;UACE,MAAM,YAAU;AAClB,cAAA,IAAA,MAAA,8DAAA;MACA;AACA,YAAKsF,SAAAA,MAAAA,KAAqB,MAACf,QAAO9C,YAAU;AAC5C,WAAK,kBAAKvB,IAAgB,OAAA,UAAA;UACxB,CAAA,KAAKF,gBAAAA;AACP,aAAA,wBAAA,SAAA;MACA;AACF,aAAA;IACF;EAEA;QACEkE,yBAAuB,KAAA,OAAA;AACvB,IAAAA,WAAMtC,KAAAA,QAAgBA,6BAAO,EAAA,YAAA,YAAA,GAAAlD,eAAA,GAAA,KAAA,GAAA,MAAA,GAAA,CAAA,eAAA,6BAAA,EAAA,CAAA;AAC7B,UAAKkD,UAAS2B,MAAQ;QACpB,CAAA,SAAA,QAAA;AACF;IACA;AACA,UAAMgC,cAAAA,QAAsB,IAAI,CAACC,UAAQ,MAACC,UAAAA;AAC1C,UAAMC,gBAAc9D,MAAQ+D,KAAAA,SAAQC,WAAOC;UACzC,cAAMC,QAAcF,OAAW,CAAA,OAAA,UAAA;AAC/B,YAAKE,cAAeA,MAAAA;UAClB,CAAA,eAAO,YAAA,WAAA,GAAA;AACT,eAAA;MACA;AACA,YAAA,eAASC,cAAyBA,KAAAA;AACpC,aAAA,EAAA,iBAAA,QAAA,iBAAA,UAAA,YAAA,cAAA,WAAA;IACA,CAAA;QACE,YAAMC,SACJN,GAAAA;YACE,QAAMnB,IAAAA,YAAoB0B,IAAAA,OAA2BC,UAAWzE;AAChE,cAAM0E,SAAAA,MAAa5B,KAAAA,QAAc6B,KAAK,MAAA,UAAA;AACxC,cAAA,aAAA,QAAA,MAAA,KAAA;MAEJ,CAAA,CAAA;IAEA;AAEF,UAAA,KAAA,MAAA,MAAA,YAAA,OAAA,CAAA,eAAA,eAAA,KAAA,OAAA,UAAA,MAAA,OAAA,CAAA;EAEA;QACElC,aAAeC,aAAQ;AACvB,IAAAD,WAAK,KAAMzC,QAAAA,6BAA2B,EAAA,YAAA,YAAA,GAAA/C,eAAA,GAAA,KAAA,GAAA,MAAA,GAAA,CAAA,eAAA,6BAAA,EAAA,CAAA;eAChC,cAAA,aAAA;WAAoC+C,kCAAAA;QAAW;MACnD,GAAA,EAAA,YAAA,YAAA,GAAA/C,eAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AAGA,UAAI;UACF6F;AACA,iBAAOf,MAAK,KAAA,MAAA,KAAA,UAAA;eACRC,KAAM;aAA6BhC,MAAAA,2BAAAA;UAAY+B;UAAI;QACvD,GAAA,EAAA,YAAA,YAAA,GAAA9E,eAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AACF;MAEA;AACA,YAAK0H,QAAO,OAAA,MAAA;UACV,CAAA,OAAA;AACF;MACA;AACA,YAAK9G,QAAAA,KAAY+G,IAAAA,MAAS5E;AAC1B,WAAA,YAAiB,SAAA,YAAA,OAAA,KAAA;AACnB,YAAA,MAAA,MAAA;IACAiC;AACF,IAAAA,KAAA,0BAAA,QAAA,EAAA,YAAA,YAAA,GAAAhF,eAAA,GAAA,KAAA,GAAA,KAAA,CAAA;EAEA;;;;;;;;iBAQU;YACN,OAAA,SAAA,gBAAA;AAEF,aAAA;IAEA;;;;;;cAMO+C,OAAAA,QAAY,eAAA;UACf,CAAA,YAAO;AACT,eAAA;MAEA;UACE,wBACQ6D;YAIN,CAAA,KAAA,kBAAA,IAAA,UAAA,KAAA,CAAA,KAAA,iBAA2D,IAAA,UAAA,KAAA,CAAA,KAAA,oBAAA,IAAA,UAAA,GAAA;AAE7D,iBAAA;QACF;MAEA;AACA,YAAIgB,eAAAA,KAAmBC,MAAAA,qBAAe,MAAA;UACpC,mBAAY1H,YAAmB,GAAC2H;eAA0B/E,KAAAA,oBAAAA,gBAAAA,QAAAA;UAAW;QACvE,CAAA;MAEA;AACF,aAAA;IACA;EAEF;;;;sBAIoB;IAClBgF,kBAAgB,OAAOjH,YAASkH;IAAAA;IAChCC,gBAAc,OAAOC,SAAAA,mBAAqBF;IAAAA;IAC1CG,cAAAA,OAAAA,YAA8BrH,SAASsH,mBAAmBA;IAAAA;IAC1D,uBAAA,OAAA,SAAA,mBAAA;EAEF;QACE,YAAMvC,EAAS,MAAKnF,MAAM2H,GAAAA;AAC1B,UAAKxC,SAAUyC,KAAAA,MAAAA,QAAmB,KAAC5H,CAAK,CAAA;QACtC,CAAA,UAAA,eAAA,KAAA,OAAA,OAAA,UAAA,MAAA,SAAA;AACF;IACA;AACA,UAAK6H,MAAK,OAAA,IAAA;QACR,CAAA,KAAA;AACF;IAEA;AACA,UAAK3H,QAAAA,UAAY+G,GAAS9B;AAC5B,SAAA,YAAA,SAAA,OAAA,YAAA,OAAA,KAAA;EAEQpF;wBACN,cAAA,QAAA;WAG+D8D,KAAAA,oBAAAA,qBAAAA,QAAAA;MAAa;IAC9E,CAAA;EAEA;;;;QAIM,WAAMkB,MAAQ;QAChB,CAAA,KAAA,QAAOF;AACT,aAAA;IAEA;AACA,UAAMM,aAAa,KAACnF,CAAK;AACzB,UAAKmF,SAAQ,KAAA,MAAA,QAAA,UAAA;QACX,CAAA,QAAA;AACF;IACA;AACA,UAAK2C,WAAU,OAAA,IAAA;QACb,CAAA,UAAA;AACF;IAEA;AACA,UAAKrH,QAAAA,UAAkB4B,QAAAA;AACvByC,SAAAA,cAAenE,IAAAA,YAAmB,KAAE;AACpC,IAAAmE,WAAKnE,KAAAA,qBAA4B,yCAAA,EAAA,YAAA,YAAA,GAAArB,eAAA,GAAA,KAAA,GAAA,MAAA,GAAA,CAAA,4BAAA,yCAAA,EAAA,CAAA;AACjC,SAAKyI,oBAAmB,SAAA;AAC1B,SAAA,eAAA,KAAA;EAEA;QACE,8BAAgCrI,QAAAA;eACxBsI,gBAAAA,KAAoB,wBAAKtI,2BAAwBuI,GAA0BpE;AACjF,YAAMqE,oBAAiBF,KAAAA,wBAA6B7F,0BAAmBgG,YAAAA;AACvE,YAAID,iBAAkBE,kBAAiB,IAAIF,OAAAA,MAAAA,GAAgB;UACzD,kBAAO,OAAA,cAAA,gBAAA;AACT,eAAA;MACF;IACA;AACF,WAAA;EAEA;QACE,+BAAA,YAAA;AAUA,UAAI/C,SAAUyC,KAAAA,MAAAA,QAAoB5H,UAAOqC;QACvC,UAAMwF,eAAgB,KAAA,OAAA,UAAA,MAAA,SAAA;AACtB,YAAIA,MAAK,OAAA,IAAA;UACP,KAAA;AACA,cAAIQ,cAAaC,mBAAA,YAAA,GAAA;YACf,aAAOC;AACT,iBAAAA,WAAA,KAAA,WAAA;QACF;MACF;IAEA;AAGA,UAAIC,kBAAiB,KAAA,+BAAA,UAAA;QACnB,iBAAOA;AACT,aAAA;IAEA;AACF,WAAA;EAEA;;;;QAKE,MAAMC,KAAAA,EAAAA,YAAmBpC,IAAAA,CAAAA,GAAAA;AAGzB,UAAM,mBAAiBoC,eAAAA,OAAAA,KAAAA,KAAAA,MAAAA,OAAAA,GAAAA,OAAAA,CAAAA,eAAAA,eAAAA,KAAAA,OAAAA,UAAAA,MAAAA,OAAAA;AAEvB,UAAA,KAAA,MAAA,MAAA,eAAA;AAEF,UAAA,KAAA,qBAAA,YAAA;EAEA;;;;;;;;QAQE,SAAMC,aAAkC;AACxC,UAAMC,SAAAA,CAAAA;AACN,UAAMC,kBAAAA,CAAAA;AACN,UAAK,qBAAoBvC,CAAAA;eACjBlB,cAAcnF,aAAa;AACjC,YAAImF,SAAUyC,KAAAA,MAAAA,QAAoB5H,UAAOqC;UACvCqG,UAAOG,eAAc1D,KAAO0C,OAAG,UAAA,MAAA,WAAA,OAAA,IAAA,GAAA;AACjC,eAAO,KAAAzB,UAAA,OAAA,IAAA,CAAA,CAAA;aACLuC;AACAC,wBAAAA,KAAmBC,UAAY1E;AAC/BuE,2BAAY7D,KAAAA,OAAAA,MAAAA;AACd,eAAA,KAAA,MAAA;MACF;IACA;QACE,gBAAMiE,SAAc,GAAM;AAC1B,YAAK,cAAeA,MAAAA,KAAY3E,YAAa,SAAA,eAAA;eAC3CuE,IAAOE,GAAAA,IAAAA,YAAmBG,QAAMD,KAAAA;AAClC,eAAA,mBAAA,CAAA,CAAA,IAAA,YAAA,CAAA;MACF;IACA;AACF,WAAA;EAEA;;;;sBAIc5I;AACd,WAAA,KAAA,YAAA,WAAA;EAEA;;;;0BAKcR,cAAAA;AACd,WAAA,KAAA,wBAAA,wBAAA,YAAA;EAEAuI;4BACcvI,cAAwBuI;AACtC,WAAA,KAAA,wBAAA,0BAAA,YAAA;EAEAe;oBACOtJ,cAAuB;AAC9B,SAAA,wBAAA,kBAAA,YAAA;EAEA;QACE,uBAA+B,cAAA;UAC7BuJ,SAAS;MACX,OAAA,CAAA;IAEA;AACA,UAAMC,aAAAA,KAAkB,wBAACjB,YAA0BpE;AAEnD,UAAKsF,cAAY,KAAA,0BAAA,YAAA;QACf,CAAA,YAAOT;AACT,aAAA;IAEA;eACQU,CAAAA,QAAOC,KAAAA,KAAAA,aAAoBF;AACjCT,YAAAA,QAAcG,oBAAK,YAAA,KAAA;aACjB1G,MAAAA,KAAAA;QACAmH;QACAC,iBAAgBH,MAAKG,gBAAepF;QACpCqF,gBAAAA,MAAoBJ,eAAejF;QACnCsF,oBAAoBC,MAAAA,UAAeP;QACnCQ,oBAAAA,OAAqBD,QAAc,WAAOvB,SAAW5B,EAAAA,OAASqD,CAAG5C,CAAAA,GAAAA,KAAWA,MAAAA,MAAM7C,SAAYA,CAAAA,EAAAA;QAC9F0F,qBAAoB,OAAQ,QAAA,MAAA,SAAA,EAAA,OAAA,CAAA,CAAA,GAAA,KAAA,MAAA,MAAA,SAAA,CAAA,EAAA;6BAAgBV,oBAAAA,IAAAA;aAA0BO,OAAOI,KAAK7E,WAAMkD,SAAS;UAAI4B,GAAI,OAAA,KAAA,MAAA,SAAA;QACzGC,CAAAA,GAAAA;gCAAwCT,oBAAc,IAAA;aAAKH,MAAKE;aAAoBF,MAAKa;UAAYF,GAAIX,MAAA;QAC3G,CAAA,GAAA;MACF,CAAA;IAEA;AACF,WAAA;EAEA;;;;QAIE,2BAAyBhD,cAASC,aAAAA;AAClC,UAAM8B,QAAAA,MAAuCuB,KAAOQ,SAAAA,WAC5CC;sBAAuB9D,OAAYI,YAAM,MAAA,IAAA,CAAAO,QAAA,UAAA;MAAEA,YAAW,KAAA;MAACA,UAAA,CAAA;IAE3D,CAACtH,CAAAA;SAAgEyI,wBAAAA,wBAAAA,cAAAA;MAAU;IAE/E,CAAA;AAIA,UAAIiC,kBAAgBjG,KAAS,oBAAG,+BAAA,YAAA;QAC9B,gBAAWhC,SAAUiI,GAAAA;iBACdvK,UAAAA,iBAAqBgE;aAAwBsE,qBAAAA,cAAAA,QAAAA;UAAU;QAC9D,CAAA;MACF;IACF;EAEA;QACE,0BAA4B,cAACkC;AAC/B,SAAA,wBAAA,0BAAA,YAAA;EAEQxI;4BACDnC,cAAwBkC,QAAAA;AAC/B,SAAA,wBAAA,yBAAA,cAAA,MAAA;EAEQG;6BACDrC,cAAwB4K,QAAAA,OAAsBzG;AACrD,SAAA,wBAAA,sBAAA,cAAA,QAAA,sBAAA,KAAA,CAAA;EAEQ0G;wBACD9K,cAAoB+K,QAAAA;AAC3B,SAAA,oBAAA,qBAAA,cAAA,MAAA;EAEQ3K;uBACDJ,cAAoBG,QAAAA,OAAoBiE;AAC/C,SAAA,oBAAA,oBAAA,cAAA,QAAA,sBAAA,KAAA,CAAA;EAEQ4G;mBACD/K,QAAAA;AACP,SAAA,wBAAA,iBAAA,MAAA;EAEQiE;sBACDjE,QAAAA;AACP,SAAA,wBAAA,mBAAA,MAAA;EAEQqE;kCACsB,cAAA,QAAA;SAAEF,mBAAAA,IAAAA;MAAc1B;MAAO;IACnD,CAAA;AACF,SAAA,WAAA,SAAA;EAEA;QACE,sBAAwBzC,KAAAA,cAAAA,QAAwBgL;AAChD,UAAMxB,aAAAA,KAAkB,wBAAwB,wBAACjB,YAA0BpE;AAE3E,UAAKsF,cAAeD,KAAAA,wBAAa,0BAAA,YAAA,EAAA,IAAA,MAAA;QAC/B,CAAA,cAAA,CAAA,aAAA;AACF;IAEA;AAEA,UAAIe,EAAAA,WAAU9F,gBAAgBoF,gBAAqB,IAAA,oBAAUD,YAAsB,WAAQ;QACzF,UAAA,WAAA,KAAA,eAAA,WAAA,KAAA,gBAAA,WAAA,GAAA;AACF;IAEA;uCAAuCW;MAAU,GAAA;IACjD;AACA,UAAIU,oBAAqBrB,KAAAA,oBAA0BsB,yBAAuB,MAAA;QACxEtG,qBAAI,gBAAkB,UAAA,uBAAA;WAAEuG,kBAAQvB;QAAuB,QAAA,gBAAA;MACvD,GAAA,EAAA,YAAQwB,YAAiB,GAAExL,eAAa,GAACyL,KAAAA,GAAAA,KAAAA,CAAAA;AACzCC,YAAAA,EAAAA,kBAAAA,IAA2BnC,MAAQiC,KAAAA,eAAAA,KAAAA,QAAAA,eAAAA;AACrC,iCAAO,KAAA,GAAA,iBAAA;WACLxG;WACET,QAAAA,oDAAAA;QACA1B;QACA0I;QACF,QAAA,gBAAA;MACAG,GAAAA,EAAAA,YAAAA,YAAAA,GAA2BnC,eAAQS,GAAAA,KAAAA,GAAAA,KAAAA,CAAAA;AACrC,iCAAA,KAAA,GAAA,eAAA;IACA;QACEhF,qBAAI,eAAkB,UAAA,uBAAA;WAAEuG,kBAAQtB;QAAsB,QAAA,eAAA;MACtD,GAAA,EAAA,YAAQuB,YAAiB,GAAExL,eAAa,GAAC2L,KAAAA,GAAAA,KAAAA,CAAAA;AACzCD,YAAAA,EAAAA,kBAAAA,IAA2BnC,MAAQiC,KAAAA,eAAAA,KAAAA,QAAAA,cAAAA;AACrC,iCAAO,KAAA,GAAA,iBAAA;WACLxG;WACET,QAAAA,oDAAAA;QACA1B;QACA0I;QACF,QAAA,eAAA;MACAG,GAAAA,EAAAA,YAAAA,YAAAA,GAA2BnC,eAAQU,GAAAA,KAAAA,GAAAA,KAAAA,CAAAA;AACrC,iCAAA,KAAA,GAAA,cAAA;IAEA;QACE,2BAAA,WAAA,GAAA;AACF;IAEAjF;SACET,+CAAAA;MACA1B;MACA6I;MACAE;MACF,OAAA,2BAAA;IAEA,GAAA,EAAA,YAAA,YAAA,GAAA5L,eAAA,GAAA,KAAA,GAAA,KAAA,CAAA;eAMO6L,cAAgB,4BAAK9I;AAC1B,WAAKrC,iBAAMwF,IAAAA,UAAiBnD;AAC9B,WAAA,MAAA,iBAAA,UAAA;IACA;QACE,CAAA,KAAKzB,gBAAAA;AACP,WAAA,wBAAA,SAAA;IACF;EAEA;;QAME,eAAMwK,KAAAA,QAAkB,aAAA;4BAAI/E;MAAY,GAAA;IACxC;AAEA,UAAA,oBAAA,CAAA;WAEE,gBACEgF,SAAMC,GAAAA;YACJ,QAAMC,IAAAA,MAASH,uBAA0BI,EAAAA,IAAAA,YAAAA;AACzC,cAAID,SAAOpH,gBAAc,OAAA,GAAA,WAAA;YACvB,OAAA,WAAA,GAAA;AACF;QACA;cACEG,KAAII,YAAK,KAAA,QAAA,MAAA,EAAA,MAAA,CAAA,QAAA;eAAsDvC,KAAAA,oDAAAA;YAAQoJ;YAAQnH;YAAI;UACnF0G,GAAAA,EAAAA,YAAAA,YAAsB,GAAIS,eAAAA,GAAAA,KAAAA,GAAAA,KAAAA,CAAAA;AAC5B,4BAAA,KAAA,GAAA,MAAA;QACF,CAAA;MAEJ,CAAA,CAAA;IAEA;WAAST;MAAkB;IAC7B;EAEA;QACE,YAAcW,KAAAA,QAAU,aAAA;QACtB,KAAA,KAAA,UAAA;AACF;IAEA;UACE,OAAI7D,YAAe,IAAK5H,CAAAA,eAAOqC;UAC7BiC,eAAS,KAAA,OAAA,UAAA,MAAgC,SAAA;aAAEjC,KAAAA,gCAAAA;UAAW;QACtD,GAAA,EAAA,YAAA,YAAA,GAAA/C,eAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AACF;MACA;AACA,YAAMuI,SAAM1C,KAAO0C,MAAG,QAAA,UAAA;AACtB,YAAKA,MAAK,OAAA,IAAA;UACRvD,CAAAA,KAAII;aAA2CrC,KAAAA,oCAAAA;UAAW;QAC1D,GAAA,EAAA,YAAA,YAAA,GAAA/C,eAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AACF;MACA;aACE+C;QACAqJ;QACA1E,MAAAA,KAAOZ,GAAAA;QACT,OAAAA,UAAA,GAAA;MACF;IAEA,CAAA;AACF,UAAA,KAAA,oBAAA,WAAA,KAAA,QAAA,KAAA,OAAAuF,cAAA,CAAA;EAEA;QAKE,eAAMC,KAAAA,QAAkB,aAAA;4BAAIvF;MAAY,GAAA;IACxC;AACA,UAAMwF,oBAAgD,CAAA;AAEtD,UAAA,eAAA,CAAA;WAEE,gBACER,SAAMC,GAAAA;YACJ,QAAMC,IAAAA,MAASK,uBAA0BJ,EAAAA,IAAAA,YAAAA;AACzC,cAAID,SAAOpH,gBAAc,OAAA,GAAA,WAAA;YACvB,OAAA,WAAA,GAAA;AACF;QACA;cACEG,SAAS,MAAA,KAAA,YAAA,KAAA,QAAA,MAAA,EAAA,MAAoD,CAAA,QAAA;eAAEnC,KAAAA,oDAAAA;YAAQoJ;YAAQnH;YAAI;UACnF0G,GAAAA,EAAAA,YAAAA,YAAsB,GAAIS,eAAAA,GAAAA,KAAAA,GAAAA,KAAAA,CAAAA;AAC5B,4BAAA,KAAA,GAAA,MAAA;QACA,CAAA;YACE7B,QAAOoC;AACT,iBAAA,OAAA,cAAA,OAAA,YAAA;QACF;MAEJ,CAAA,CAAA;IAEA;eACO9L,CAAAA,YAAa0L,IAAM,KAAA,OAAA,QAAA,YAAA,GAAA;WAAE3F,MAAO1D,OAAAA,MAAAA;QAAyB,OAAA;MAC5D,CAAA;IACA;AAEA,UAAA,KAAO,MAAA,MAAA,OAAA,KAAA,YAAA,CAAA;WAAEyI;MAAkB;IAC7B;EAEA;QAKE,YAAcW,KAAAA,QAAU,aAAA;QACtB,KAAA,KAAA,UAAA;AACF;IACA;qBACqEpJ,OAAAA,YAAAA,YAAAA,IAAAA,CAAAA,eAAAA;MAAY;MAAG,CAAA;IACpF,CAAA,CAAMkJ;AACN,UAAA,SAAO,MAAA,KAAA,oBAAA,WAAA,KAAA,QAAA,QAAA;WAAEM;MAAqB,cAAA;IAChC;EAEQnJ;kBACAqJ,UAAAA;AAEN,UAAK,qBAAsB,oBAAI,IAACrM;eACxBuF,gBAAavF,KAAAA,wBAAwBgL,2BAAwB7G,GAAAA;AACnE,YAAKoB,QAAO,KAAA,wBAAA,wBAAA,YAAA;UACV,CAAA,OAAA;AACF;MACA;AAEA,UAAA;iBACM5C,CAAAA,YAAc4C,KAAMkD,KAAAA,UAAW;YACjC,cAAK6D,MAAU,WAAA;cACbA,CAAAA,UAAWC;AACb,uBAAA,gBAAA,KAAA;UACAD;AACF,mBAAA,UAAA,UAAA,IAAA;QACF;MAEA;UACE,UAAKtM;AACLqM,aAAAA,wBAAuBlI,wBAAAA,cAAAA,QAAAA;AACzB,2BAAA,IAAA,YAAA;MACF;IAEA;eACOtD,gBAAAA,oBAA4B;WAAEsD,uBAAAA,KAAAA;QAAa;MAClD,CAAA;IACF;EACF;;cA10BSqI;;;cAgfAC;SAAOC,KAAAA;IAA6BC,uBAAqB;;;;gBAvgB3DC,cAAAA;SAAWC,SAAW;;;AAm2B7B,GAAA,aAAMxF;IACJ,eAAMyF,OAAAA,QAAuBpK,UAAI4E;AAEjC,QAAA,mBAAA,IAAA,IAAA,KAAA;QAKE,oBAAsB,MAAA;AACtB,UAAKa,MAAK,OAAA,IAAA;QACR,CAAA,KAAA;AACF;IACA;eACM4E,cAAAA,iBAA0BC,OAAa,GAAA;UACzCF,qBAAiBG,KAAOD,UAAAA,GAAAA;AAC1B,yBAAA,OAAA,UAAA;MACF;IACF;EAEAE;AACA,oBAAIJ;MACF,iBAAA,SAAA,GAAA;AACF;EAEA;QACEI,OAAAA,KAAAA,QAAAA,QAAAA,EAAAA,iBAAAA,MAAAA;AACA,sBAAOJ;AACT,WAAA,iBAAA,SAAA;EACF,CAAA;AAEA;IACE,uBAAyBK,CAAAA,KAAAA,eAAgBH;AAC3C,SAAA,CAAA,CAAA,WAAA,GAAA,EAAA,gBAAA,UAAA;AAEA;IACE5H,wBAAiBG,CAAU,UAAA;AAE3B,EAAAH,WAAOG,OAAAA,UAAAA,YAAAA,UAAAA,MAAAA,iBAAAA,EAAAA,YAAAA,YAAAA,GAAAA,eAAAA,GAAAA,KAAAA,GAAAA,QAAAA,GAAAA,CAAAA,+CAAAA,iBAAAA,EAAAA,CAAAA;AACT,SAAA;AAEA;IACE,wBAAOA,CAAAA,UAAAA;AACT,SAAA;;;;AOrgCA,SAAS6H,aAAAA,kBAAiB;AAC1B,SAASC,aAAAA,kBAA+B;AACxC,SAASC,OAAAA,YAAW;AAEpB,SAASC,cAAAA,aAAYC,cAAAA,mBAAkB;;;ACNvC,YAAYC,QAAO;AACnB,SAASC,YAAY;AAErB,SAASC,YAAAA,iBAAgB;AACzB,SAASC,aAAAA,kBAAiB;AAE1B,SAASC,OAAAA,YAAW;AAEpB,SAASC,2BAA4D;AAIrE,IAAAC,gBAAMC;;AAYGC,IAAmD,2BAAnDA,cAAmDN,UAAA;EACnDO;EACAC;EAESC;EAERC,kBAA+B;EAC/BC;EAER,gBAA6BC;eACtB;cAEDC,SAAAA;AACJ,UAAKP,GAAAA,KAAQ,UAAOQ;QAClBC;oBACEF,IAAAA,eAA2BG;aAC3B,CAAI,eAAMC;AACZ,mCAAA;AACF,aAAA,KAAA,UAAA,MAAA,WAAA,MAAA,CAAA;MAEI;;oBAEAhB,IAAU,eAAiB;aAC3B,OAAI,SAAA,eAAA;mBACFiB,KAAAA,YAAYC,oCAAAA,EAAAA,YAAAA,YAAAA,GAAAA,eAAAA,GAAAA,IAAAA,GAAAA,MAAAA,GAAAA,CAAAA,mBAAAA,oCAAAA,EAAAA,CAAAA;YACZ;sBAAiDC,OAAcC;AAAgB,gBAAA,KAAA,oBAAA,gBAAA;YAC/E,SAAY,KAAA,OAAA,OAAA;UACZL,CAAAA;iBACKM,KAAAA;AACP,qBAAA,MAAA,GAAA;AACF,eAAA,qBAAA;QACF;MAEA;IACA,CAAA;UACE,4BAAA,KAAA,QAAA,qBAAA;+BACeV,0BAAiB;MAChC;QACA,QAAA,KAAA,QAAA;;;4BAGI,OAAA,MAAA,iBAAA;AAQA,eAAKF,kBAAgBa;eAEOC,gBAAW,KAAA;eAAEC,sBAAiBC;YAAQC,IAAAA,KAAAA;YAAmC,YAAA,KAAA;YAEjG,cAASC,aAAiB,MAAA;UAChC,GAAA,EAAA,YAAA,YAAA,GAAAxB,eAAA,GAAA,IAAA,GAAA,KAAA,CAAA;AACAyB,eAAAA,QAAe,kBAAkB;;uBAE7B,OAAA,EAAA,QAAA,MAAA;AACF,cAAA,CAAA,KAAA,YAAA;AACA;UACA;AACAhB,gBAAAA,UAAAA,KAAAA,OAAyBiB,OAAQX;AAEnCY,mCAAS,QAAA,OAAA;;QAET,SAAA,YAAA;AACF,eAAA,qBAAA;QACD;MACH;IAEQT,CAAAA;;yBAESU;AACf,QAAA,KAAA,YAAA;AACF,WAAA,QAAA,qBAAA;IAEIN;;MAEF,SAAO;AACT,IAAAzB,WAAA,KAAA,iBAAA,MAAA,sCAAA,EAAA,YAAA,YAAA,GAAAG,eAAA,GAAA,IAAA,GAAA,MAAA,GAAA,CAAA,8BAAA,sCAAA,EAAA,CAAA;AAEI6B,WAAAA,KAAY;;EAEhB,IAAA,YAAA;AAEIC,WAAAA,KAAAA;;EAEJ,IAAA,oBAAA;AAEA,WAAMC;;EAEN,MAAA,gBAAA,QAAA;AAEAC,WAAAA,KAAAA,QAAqBC,gBAA4C,MAAA;;EAEjE,qBAAA,QAAA;AAEA,WAAA,KAAA,QAAA,qBAAA,MAAA;;;;;;WAMO1B;AACP,IAAAV,WAAA,KAAA,iBAAA,MAAA,sCAAA,EAAA,YAAA,YAAA,GAAAG,eAAA,GAAA,KAAA,GAAA,MAAA,GAAA,CAAA,8BAAA,sCAAA,EAAA,CAAA;AAEA,SAAA,aAAA;;;;;EAKA,UAAA;AACF,SAAA,aAAA;EAEA;;kBAEUkC,CAAAA,YAAAA;OACN,mBAAO,MAAA;UACLC,qBAAMD,QAAsB,SAAA,UAAA,QAAA,OAAA,qBAAA,QAAA,IAAA,IAAA;;YAE1BE,sBAAYF;QACZG,aAAAA,mBAAgBH,MAAmBI;QACrC,YAAA,mBAAA,KAAA,SAAA;QACAC,gBAAkB,mBAAA,QAAA,SAAA;MAClBC;MACAC,MAAI1B,QAAQ2B;MACd,MAAA,QAAA;MACF,IAAA,QAAA;IACF;;;;;ACrJA,SAASC,aAAAA,kBAAiB;AAC1B,SAASC,eAAe;AAExB,IAAAC,gBAAaC;AAIX,IAAMC,gCAAkC,CAAE,SAAA,mBAAA,iBAAA,SAAA,OAAA,IAAA,cAAA,KAAA,SAAA,OAAA;AAC1CJ,IAAAA,6BAA0BI,CAAAA,iBAAAA;AAC1B,QAAA,UAAOA,aAAAA,MAAAA,GAAAA,EAAAA,CAAAA;AACP,EAAAJ,WAAA,QAAA,QAAA,OAAA,GAAA,QAAA,EAAA,YAAA,YAAA,GAAAE,eAAA,GAAA,GAAA,GAAA,QAAA,GAAA,CAAA,4BAAA,EAAA,EAAA,CAAA;;;;;AFIF,IAAAG,gBAAA;;;;;;;;;;;;;;;;EAyBE,qBAA6BC,oBAAmC,IAAiB;aAC1EC;EACP,MAAA,QAAA,MAAA,SAAA;AAEA,SAAMC,WAA4B;;qBAE1BC;eACF,cAAeC,KAAAA,cAAmBD;AACpC,UAAA,WAAA,WAAA;AACF,aAAA,UAAA,mBAAA,UAAA;MAEA;;AAEA,eAAA,cAAA,KAAA,cAAA;AAEI,YAACE,WAAaC,MAAK;IACvB;AAEA,SAAKL,aAAW,MAAA;AAClB,SAAA,oBAAA,MAAA;AAEAM,SAAAA,WACEC;;kBAIML,kBAA2CM;eAC/CC,KAAW,UAAKT,QAASU,EAAAA,YAAM,YAAA,GAAAZ,eAAA,GAAA,IAAA,GAAA,MAAA,GAAA,CAAA,iBAAA,EAAA,EAAA,CAAA;UAC/Ba,aAAAA,IAAmBJ,yBAAAA;MACnBK,WAAAA,KAAAA,SAAmB;yBACb;yBAA+BV,YAAWQ;AAAO,QAAAG,KAAA,qBAAA;UACrDC,QAAU,WAAa;QAEvB,GAAA,EAAA,YAAMC,YAAAA,GAAAA,eAA2BC,GAAAA,IAAAA,GAAAA,KAAAA,CAAmB;AACpD,QAAAF,WAAIC,KAAAA,UAAAA,QAAqBE,EAAAA,YAAQ,YAAA,GAAAnB,eAAA,GAAA,IAAA,GAAA,MAAA,GAAA,CAAA,iBAAA,EAAA,EAAA,CAAA;cAC/B,sBAAMoB,KAAoBH,oBAAsB,IAAA,WAAA,MAAA;YAChD,qBAAcI,QAAAA;AACdJ,gBAAAA,oBAAyBb,oBAAAA,CAAAA;AAC3B,eAAO,SAAA,6BAAA,iBAAA;AACL,8BAAKc,KAAoBI,UAAIlB;;eAA+B,oBAAA,IAAA,WAAA,QAAA;YACxD;UACJA,CAAAA;AACF,eAAA,SAAA,iBAAA,UAAA;AACF,qBAAA,OAAA;QACAmB;;4BACwCnB,YAAWQ;AAAO,QAAAG,KAAA,wBAAA;UAEpD,QAACT,WAAakB;QAElB,GAAA,EAAA,YAAMP,YAAAA,GAAAA,eAA2BC,GAAAA,IAAAA,GAAAA,KAAAA,CAAmB;AAEpD,aAAA,aAAcD,OAAAA,UAAoBQ;AAClC,cAAIC,sBAAW,KAAA,oBAAA,IAAA,WAAA,MAAA,KAAA,CAAA;cACbX,QAAS,oBAAA,QAAA,UAAqC;oBAAEH,GAAAA;AAA0B,UAAAG,KAAA,KAAA,qCAAA;YAC1E,QAAA,WAAA;UACF,GAAA,EAAA,YAAA,YAAA,GAAAf,eAAA,GAAA,IAAA,GAAA,KAAA,CAAA;AAEAiB;QAEA;4BACiBZ,OAAAA,OAAAA,CAAAA;YACfD,WAAWuB,WAAO;AAElB,eAAA,UAAA,mBAAA,UAAyC;AACzC,qBAAIV,QAAAA;cAEFA,oBAAoB,SAAS,GAAA;AAC/B,iBAAA,UAAA,iBAAA,oBAAA,CAAA,CAAA;AACF,gCAAA,CAAA,EAAA,OAAA;UACF;QACAW;;uBACmCxB,OAAAA,WAAiB;aAAEyB,mBAAmBA;UAAW,QAAA,WAAA;UAClFb,YAAed,OAAQ;QACvB,GAAA,EAAA,YAAI,YAAA,GAAAF,eAAA,GAAA,IAAA,GAAA,KAAA,CAAA;mBACI8B,KAAAA,UAAW,QAAU,EAAC5B,YAAS6B,YAAAA,GAAAA,eAAAA,GAA8BC,IAAAA,GAAAA,MAAOH,GAAAA,CAAAA,iBAAU,EAAA,EAAA,CAAA;YACpF;gBACE,WAAMI,MAAAA,KAAAA,SAAuB,8BAAoBC,OAAAA,UAA6B;yBAC5EL;kBACAjB,uBAAyB,MAAA,KAAA,SAAA,6BAAA;cAC3B,YAAA,OAAA;cACI,QAAA,WAAA;;iBAEFiB,qDAA6B;cAC7BM,QAAAA,WAAgBF;cAClB,YAAA,OAAA;cAEA,gBAAA;YACA,GAAA,EAAA,YAAA,YAAA,GAAAjC,eAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AAKF,mBAAMoC;UAEN;AAEA,gBAAKhC,UAAWiC,MAAAA,qBAAiB,QAAA;gBAC/BtB,oBAAI,KAAA,mBAAA,IAAA,OAA+C;0BACzCX,iBAAiB;iBACzByB,+CAA6B;cAC/B,QAAA,WAAA;cACA,YAAO,OAAA;YACT,GAAA,EAAA,YAAA,YAAA,GAAA7B,eAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AAEA,mBAAMsC;UACNvB;gBACEwB,eAAgBrC,mBAAe,IAAA,WAAA,eAAA,KAAA;eAC/BsC,sBAAYpC;YACZyB,WAAAA,KAAYG,SAAOH;YACnBY,YAAWrC,WAAWiC;YACtBP,YAAAA,OAAAA;YACAQ,WAAAA,WAAAA;YACF;YACA;UACA,GAAA,EAAA,YAAY,YAAA,GAAAtC,eAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AACZe,iBAAI2B;iBACJ,KAAO;AACT,UAAA3B,KAAA,MAAA,KAAA,QAAA,EAAA,YAAA,YAAA,GAAAf,eAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AACF,iBAAA;QACA2C;;4BAGQC,CAAAA,EAAAA,aAAyBC,MAAAA;AAE/B,cAAKzC,UAAWiC,2BAAiB,YAAA;cAC/BtB,oBAAI,KAAA,mBAAA,IAAA,OAAkD;wBAC5CX,iBAAiB;eACzB0C,kDAAAA;YACF,QAAA,WAAA;YACA;UACF,GAAA,EAAA,YAAA,YAAA,GAAA9C,eAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AAEA,iBAAMsC;QACN;AACF,cAAA,eAAA,mBAAA,IAAA,WAAA,eAAA,KAAA;AACF,eAAA;MACI;IAEJ,CAAA;AACF,SAAA,aAAA,IAAA,UAAA;AAEA,WAAMS,WAAgBjB;;wBACKA,UAAAA,WAAAA;SAAUW,mBAAAA;MAAU;MAC7C;IACAO,GAAAA,EAAAA,YAAW,YAAKH,GAAAA,eAAoBT,GAAAA,KAAS,GAAA,KAAM,CAAIa;AACvD,UAAK,UAAM7C,MAAAA,qBAAiC,QAAA;gBACtCA,KAAAA,oBAAwBA,SAAWiC,MAAAA,IAAAA,YAAmBjC,WAAWiC,IAAAA,CAAAA,EAAAA,IAAAA,SAAgBa;eACnF,cAAShC,KAAAA,cAAwBd;qBAC1BF,aAAUmB,WAAAA,mBAA6BjB,WAAAA,gBAAAA,OAAAA,SAAAA,GAAAA;AAC9C,YAAA,KAAA,oBAAA,IAAA,WAAA,MAAA,GAAA;AACF,eAAA,UAAA,6BAAA,UAAA;QACF;MACF;IACF;;;;;AGjMA,SAAyB+C,SAAAA,cAAa;AACtC,SAASC,gBAAgBC,sBAAuDC,iBAAiB;;;;;;;AAMjG,IAAMC,kCAAkC;AACxC,IAAMC,0BAA0B;AAOzB,IAAMC,kBAAN,MAAMA;;EACHC,YAAY;EAEZC,kBAAkBC,oBAAAA;EAClBC;EACSC,mBAAmBC,sBAAAA;EACnBC,mBAAmBC,sBAAAA;EACnBC,uBAAuBC,sBAAAA;EACvBC,iBAA2D,CAAC;EAC5DC,wBAAwB,IAAIC,eAA8B,GAAA;EAC1DC,oBAAoB,IAAID,eAA8B,GAAA;EAE/DE,oBAAoB;EAE5B,YAA6BC,UAAkC;IAAEC,kBAAkB;EAAG,GAAG;SAA5DD,UAAAA;EAA6D;EAEnFE,KAAKC,QAAsB;AAChC,SAAKC,mBAAmBD,SAAS,KAAKlB,SAAS;AAC/C,SAAKA,YAAYkB;EACnB;EAEOE,eAA8B;AACnC,WAAO;MACLC,MAAM;QACJC,wBAAwBzB;MAC1B;MACA0B,SAAS;QACPC,OAAO;UACLC,aAAa,KAAKnB,iBAAiBoB,gBAAgBC,QAAO;UAC1DC,YAAY,KAAKtB,iBAAiBuB,aAAaF,QAAO;UACtDG,gBAAgB,KAAKxB,iBAAiByB,eAAeJ,QAAO;QAC9D;QACAK,QAAQ;UACNP,aAAa,KAAKnB,iBAAiB2B,gBAAgBN,QAAO;UAC1DC,YAAY,KAAKtB,iBAAiB4B,cAAcP,QAAO;UACvDG,gBAAgB,KAAKxB,iBAAiB6B,gBAAgBR,QAAO;QAC/D;MACF;MACAS,YAAY;QACVC,aAAa,KAAKvB;QAClBwB,kBAAkB;UAChBb,aAAa,KAAKjB,qBAAqB+B,oBAAoBZ,QAAO;UAClEG,gBAAgB,KAAKtB,qBAAqBgC,kBAAkBb,QAAO;QACrE;QACAc,cAAc;UACZhB,aAAa,KAAKjB,qBAAqBkC,gBAAgBf,QAAO;UAC9DC,YAAY,KAAKpB,qBAAqBmC,aAAahB,QAAO;UAC1DG,gBAAgB,KAAKtB,qBAAqBoC,cAAcjB,QAAO;UAC/DkB,iBAAiB,KAAKrC,qBAAqBsC,qBAAqBnB,QAAO;QACzE;QACAoB,gBAAgB,KAAKC,yBAAyB,MAAA;QAC9CC,kBAAkBC,UAAU,KAAKxC,gBAAgB,CAACyC,YAAYA,QAAQxB,QAAO,CAAA;MAC/E;IACF;EACF;EAEA,IAAWyB,mBAAmB;AAC5B,WAAO,KAAKtC;EACd;;;;EAKA,IAAIuC,qBAAqB;AACvB,WAAO,KAAKlD;EACd;;;;EAKA,IAAImD,aAAa;AACf,WAAO;MAAE,GAAG,KAAKlD,iBAAiBmB;MAAS,GAAG,KAAKnB,iBAAiBmD;IAAY;EAClF;;;;EAKA,IAAIC,mBAAmB;AACrB,WAAO,KAAKR,yBAAyB,QAAA;EACvC;EAEQ7B,mBAAmBsC,cAA4B;AACrD,UAAMC,aAAaC,OAAOC,OAAO,KAAK3D,eAAe;AACrD,SAAKA,kBAAkBC,oBAAAA;AACvB,SAAKC,wBAAwBuD;AAC7B,eAAWG,UAAUF,OAAOG,KAAKJ,WAAWK,QAAQ,GAAG;AACrD,WAAK9D,gBAAgB8D,SAASF,MAAAA,IAAUG,qBAAAA;IAC1C;AACA,SAAKC,iBAAiBP,WAAWH,aAAa,KAAKnD,iBAAiBmD,WAAW;AAC/E,SAAKU,iBAAiBP,WAAWnC,SAAS,KAAKnB,iBAAiBmB,OAAO;AAEvE,QAAI2C,KAAKC,IAAIV,eAAe,GAAA,IAAQ,KAAK;AACvC,WAAKW,qBAAqBV,UAAAA;IAC5B;EACF;EAEQO,iBAAmCI,QAAWf,YAAiC;AACrF,eAAW,CAACgB,KAAKC,KAAAA,KAAUZ,OAAOa,QAAQH,MAAAA,GAAS;AACjD,YAAMA,UAA4Bf,WAAmBgB,GAAAA;AACrDD,MAAAA,QAAOI,KAAKF,KAAAA;AACZ,UAAIF,QAAOK,SAAS,KAAK3D,QAAQC,kBAAkB;AACjDqD,QAAAA,QAAOM,MAAK;MACd;IACF;EACF;EAEQP,qBAAqBQ,SAA8B;AACzD,UAAMC,WAAqD;MACzD;QAAC;QAAgBD,QAAQrD,QAAQuD;QAAc,KAAKxE,iBAAiByB;;MACrE;QAAC;QAAiB6C,QAAQrD,QAAQwD;QAAc,KAAKzE,iBAAiB6B;;MACtE;QAAC;QAAmByC,QAAQrB,YAAYyB;QAAU,KAAKxE,qBAAqBgC;;MAC5E;QAAC;QAAgBoC,QAAQrB,YAAY0B;QAAM,KAAKzE,qBAAqBoC;;;AAEvE,eAAW,CAACsC,YAAYC,QAAQhC,OAAAA,KAAY0B,UAAU;AACpD1B,cAAQiC,OAAOD,MAAAA;AACf,UAAIA,SAAS,GAAG;AACdE,QAAAA,OAAMT,QAAQU,aAAa,aAAaJ,UAAAA,SAAmBC,MAAAA;AAC3DE,QAAAA,OAAMT,QAAQW,UAAU,aAAaL,UAAAA,IAAc,GAAG;UAAEM,MAAM;YAAEC,QAAQ;UAAO;QAAE,CAAA;MACnF,OAAO;AACLJ,QAAAA,OAAMT,QAAQW,UAAU,aAAaL,UAAAA,IAAc,GAAG;UAAEM,MAAM;YAAEC,QAAQ;UAAO;QAAE,CAAA;MACnF;IACF;AACA,SAAKjF,qBAAqBsC,qBAAqBsC,OAAOR,QAAQrB,YAAYmC,MAAM;EAClF;EAEOC,oBAAoB9B,QAAsB;AAC/C,SAAK5D,gBAAgB8D,SAASF,MAAAA,IAAUG,qBAAAA;AACxC,SAAKlD;EACP;EAEO8E,uBAAuB/B,QAAsB;AAClD,SAAK/C;AACL,WAAO,KAAKb,gBAAgB8D,SAASF,MAAAA;EACvC;EAEOgC,kBAAkBC,OAAqB;AAC5C,SAAK7F,gBAAgBsB,QAAQwD;AAC7B,SAAK9E,gBAAgBsB,QAAQwE,eAAeD;AAC5C,SAAKxF,iBAAiB2B,gBAAgBmD,OAAOU,KAAAA;AAC7CT,IAAAA,OAAMT,QAAQU,aAAa,kCAAkCQ,OAAO;MAAEE,MAAM;IAAQ,CAAA;EACtF;EAEOC,mBAAmBC,YAA0B;AAClD,SAAK5F,iBAAiBuB,aAAauD,OAAOc,UAAAA;EAC5C;EAEOC,oBAAoBD,YAA0B;AACnD,SAAK5F,iBAAiB4B,cAAckD,OAAOc,UAAAA;EAC7C;EAEOE,kBAAkBN,OAAqB;AAC5C,SAAK7F,gBAAgBsB,QAAQuD;AAC7B,SAAK7E,gBAAgBsB,QAAQ8E,eAAeP;AAC5C,SAAKxF,iBAAiBoB,gBAAgB0D,OAAOU,KAAAA;AAC7CT,IAAAA,OAAMT,QAAQU,aAAa,kCAAkCQ,OAAO;MAAEE,MAAM;IAAQ,CAAA;EACtF;EAEOM,kBAAkBC,SAAkBC,UAAwB;AACjE,QAAIC;AACJ,UAAMC,QAAQC,aAAaJ,OAAAA;AAC3B,UAAMf,OAAO;MAAEoB,MAAML,QAAQK;IAAK;AAClC,QAAIC,2BAA2BN,OAAAA,GAAU;AACvC,WAAKtG,gBAAgBsD,YAAY0B;AACjC,WAAKzE,qBAAqBmC,aAAayC,OAAOoB,QAAAA;AAC9C,WAAKhG,qBAAqBkC,gBAAgB0C,OAAOsB,KAAAA;AACjDD,yBAAmB;IACrB,OAAO;AACLA,yBAAmB;IACrB;AACApB,IAAAA,OAAMT,QAAQU,aAAa,aAAamB,gBAAAA,eAA+BC,OAAO;MAAEV,MAAM;MAASR;IAAK,CAAA;AACpGH,IAAAA,OAAMT,QAAQU,aAAa,aAAamB,gBAAAA,kBAAkCD,UAAU;MAAER,MAAM;MAAeR;IAAK,CAAA;AAChHH,IAAAA,OAAMT,QAAQW,UAAU,aAAakB,gBAAAA,gBAAgC,GAAG;MAAEjB,MAAM;QAAE,GAAGA;QAAMsB,SAAS;MAAK;IAAE,CAAA;AAC3G,UAAM,EAAEC,aAAaC,cAAa,IAAK,KAAKC,iBAAiBV,OAAAA;AAC7DQ,gBAAY3B,OAAOsB,KAAAA;AACnBM,kBAAc/B;AACd,SAAKpE,kBAAkB4D,KAAK;MAAEmC,MAAML,QAAQK;MAAM/C,QAAQ0C,QAAQW;IAAS,CAAA;EAC7E;EAEOC,sBAAsBZ,SAAwB;AACnD,UAAMG,QAAQC,aAAaJ,OAAAA;AAC3B,UAAMf,OAAO;MAAEoB,MAAML,QAAQK;IAAK;AAClC,QAAIC,2BAA2BN,OAAAA,GAAU;AACvC,WAAKtG,gBAAgBsD,YAAYyB;AACjC,WAAKxE,qBAAqB+B,oBAAoB6C,OAAOsB,KAAAA;AACrDrB,MAAAA,OAAMT,QAAQU,aAAa,wCAAwCoB,OAAO;QAAEV,MAAM;QAASR;MAAK,CAAA;IAClG,OAAO;AACLH,MAAAA,OAAMT,QAAQU,aAAa,4CAA4CoB,OAAO;QAAEV,MAAM;QAASR;MAAK,CAAA;IACtG;AACA,UAAM,EAAEuB,aAAaC,cAAa,IAAK,KAAKC,iBAAiBV,OAAAA;AAC7DQ,gBAAY3B,OAAOsB,KAAAA;AACnBM,kBAAchC;AACd,SAAKrE,sBAAsB8D,KAAK;MAAEmC,MAAML,QAAQK;MAAM/C,QAAQ0C,QAAQa;IAAS,CAAA;EACjF;EAEOC,2BAA2Bd,SAAwB;AACxD,UAAMf,OAAO;MAAEoB,MAAML,QAAQK;MAAME,SAAS;IAAM;AAClD,QAAID,2BAA2BN,OAAAA,GAAU;AACvC,WAAKtG,gBAAgBsD,YAAYmC;AACjCL,MAAAA,OAAMT,QAAQW,UAAU,qCAAqC,GAAG;QAAES,MAAM;QAASR;MAAK,CAAA;IACxF,OAAO;AACLH,MAAAA,OAAMT,QAAQW,UAAU,yCAAyC,GAAG;QAAES,MAAM;QAASR;MAAK,CAAA;IAC5F;AACA,UAAM,EAAEwB,cAAa,IAAK,KAAKC,iBAAiBV,OAAAA;AAChDS,kBAActB;EAChB;EAEQuB,iBAAiBV,SAAuF;AAC9G,UAAMQ,cAAe,KAAKrG,eAAe6F,QAAQK,IAAI,MAAMU,oBAAAA;AAC3D,UAAMN,gBAAiB,KAAK/G,gBAAgBsH,OAAOhB,QAAQK,IAAI,MAAM5C,qBAAAA;AACrE,WAAO;MAAEgD;MAAeD;IAAY;EACtC;EAEQ/D,yBAAyBwE,UAA0D;AACzF,UAAMC,SAAoC,CAAC;AAC3C,eAAWC,mBAAmB,KAAK/G,uBAAuB;AACxD,YAAMgH,WAAYF,OAAOC,gBAAgBF,QAAAA,CAAS,MAAM;QAAExC,UAAU;QAAGC,MAAM;MAAE;AAC/E0C,eAAS3C;IACX;AACA,eAAW0C,mBAAmB,KAAK7G,mBAAmB;AACpD,YAAM8G,WAAYF,OAAOC,gBAAgBF,QAAAA,CAAS,MAAM;QAAExC,UAAU;QAAGC,MAAM;MAAE;AAC/E0C,eAAS1C;IACX;AACA,WAAOwC;EACT;AACF;;SAjOOG,SAAAA;;AAoTP,IAAMf,6BAA6B,CAACN,YAAAA;AAClC,SAAO,EAAEsB,yBAAyBtB,OAAAA,KAAYuB,yBAAyBvB,OAAAA;AACzE;AAEA,IAAMe,sBAAsB,CAACS,cAC3B,IAAIC,qBAAqB;EAAEC,YAAYnI;EAAyBoI,WAAW;EAAG,GAAGH;AAAU,CAAA;AAE7F,IAAM7H,sBAAsB,OAAsB;EAChDqB,SAAS;IAAE8E,aAAa;IAAGN,aAAa;IAAGhB,cAAc;IAAGD,cAAc;EAAE;EAC5EvB,aAAaS,qBAAAA;EACbD,UAAU,CAAC;EACXwD,QAAQ,CAAC;AACX;AAEA,IAAMlH,wBAAwB,OAAwB;EACpDkB,SAAS;IAAE8E,aAAa,CAAA;IAAIN,aAAa,CAAA;IAAIhB,cAAc,CAAA;IAAID,cAAc,CAAA;EAAG;EAChFvB,aAAa;IAAE0B,MAAM,CAAA;IAAIS,QAAQ,CAAA;IAAIV,UAAU,CAAA;EAAG;AACpD;AAEA,IAAMhB,uBAAuB,OAAsB;EAAEiB,MAAM;EAAGD,UAAU;EAAGU,QAAQ;AAAE;AAErF,IAAMjF,wBAAwB,OAAwB;EACpD8B,qBAAqB+E,oBAAAA;EACrB5E,iBAAiB4E,oBAAAA;EACjB3E,cAAc2E,oBAAAA;EACd9E,mBAAmB8E,oBAAoB;IAAEW,YAAYpI;EAAgC,CAAA;EACrF+C,eAAe0E,oBAAoB;IAAEW,YAAYpI;EAAgC,CAAA;EACjFiD,sBAAsBwE,oBAAoB;IAAEW,YAAYpI;EAAgC,CAAA;AAC1F;AAEA,IAAMU,wBAAwB,OAAwB;EACpD0B,iBAAiBqF,oBAAAA;EACjB5F,iBAAiB4F,oBAAAA;EACjBzF,cAAcyF,oBAAAA;EACdpF,eAAeoF,oBAAAA;EACfvF,gBAAgBuF,oBAAoB;IAAEW,YAAYpI;EAAgC,CAAA;EAClFsC,iBAAiBmF,oBAAoB;IAAEW,YAAYpI;EAAgC,CAAA;AACrF;AAEA,IAAM8G,eAAe,CAACJ,YAAAA;AACpB,SACEA,QAAQK,KAAKlC,SACb6B,QAAQa,SAAS1C,SACjB6B,QAAQW,SAASxC,UAChB6B,QAAQ4B,MAAMC,cAAc,MAC5B7B,QAAQ8B,YAAY3D,UAAU;AAEnC;;;ACnXA,SAAS4D,QAAQC,UAAqB;AAGtC,SAASC,uBAAuB;AAChC,SAAkBC,kBAAAA,iBAAgBC,YAAAA,iBAAgB;AAElD,SAASC,aAAAA,kBAAiB;AAC1B,SAASC,OAAAA,YAAW;AAEpB,SAASC,aAAa;AAItB,IAAAC,gBAAMC;AAcN,IAAMC,kBAAAA;AAEN,IAAA,0BAAA;;AAImBC,IAAAA,wBAAAA,cAAkDP,UAAA;EACnE;;;;;;;;;;oBAW6BQ;EAE7B,YAAA,SAAA;AAEA,UAAMC,GAAAA,KAAAA,UAAaC;;qBAGT,aAAA;kBACIP,IAAAA,YACJ,IAAA,OAAA,eAAA;;cAAkCQ,MAAAA;UAA0CC,OAAAA;UAC5E,SAAA;UACE,UAAI;uBACE;;AAAiC,YAAAV,KAAA,oBAAA;cACrC;YAGA,GAAA,EAAA,YAAKW,YAAWC,GAAAA,eAAAA,GAAAA,IAAAA,GAAAA,KAAAA,CAAAA;AAChB,kBAAKC,WAAAA,KAAgBC,QAAIF,cAAmB,iBAAA,UAAA;AAC5C,iBAAKG,WAAAA,QAAiBC;AACtB,iBAAOC,gBAAK,IAAA,SAAA,UAAA;AACZjB,iBAAIkB,gBAAK,QAAA;mBAA6BD,KAAAA;AAAI,YAAAjB,KAAA,KAAA,2BAAA;cAC1C;YACF,GAAA,EAAA,YAAA,YAAA,GAAAE,eAAA,GAAA,IAAA,GAAA,KAAA,CAAA;AACF,kBAAA;UAEF;QACAF,CAAAA;MACF,SAAA,KAAA;AACF,QAAAA,KAAA,MAAA,KAAA,QAAA,EAAA,YAAA,YAAA,GAAAE,eAAA,GAAA,IAAA,GAAA,KAAA,CAAA;MAEJ;IAEAiB,CAAAA,CAAAA;;kBAESd,aAAgBe;eAChBf,cAAYgB,aAAOD;AACxB,WAAKP,YAAAA,IAAgBQ,UAAOD,GAAAA,qBAAAA;AAC9B,WAAA,YAAA,OAAA,UAAA;AACF,WAAA,gBAAA,OAAA,UAAA;IAEA;;gBAEIE;AACF,SAAA,kBAAA,IAAA,gBAAA,KAAA,MAAA,KAAA,qBAAA,KAAA,IAAA,GAAA;MACF,cAAA;IAEA,CAAA;;QAEE,SAAKjB;AACP,UAAA,KAAA,gBAAA,KAAA;AAEA,SAAMkB,YAAqBC,MAA0C;;eAEjE,KAAU,SAACC;AACb,eAAA,EAAA,YAAA,SAAA,KAAA,SAAA;AACA,YAAA,KAAA,eAAA,YAAA,QAA6C;IAC7C;AAEA,UAAA,KAAA,QAAA,cAAA,MAAA,KAAA;MACF,aAAA,QAAA,IAAA,CAAA,EAAA,WAAA,MAAA,UAAA;IAEQd,CAAAA;;aAEJX,UAAI;aAAmCoB,YAAYR,IAAAA,SAASQ,UAAU,GAAA;AAAC,MAAApB,KAAA,iCAAA;QACvE,YAAA,SAAA;MACF,GAAA,EAAA,YAAA,YAAA,GAAAE,eAAA,GAAA,IAAA,GAAA,KAAA,CAAA;AAEA;;AAA2C,UAAA,YAAA;MACvC;IACJ;AACA,SAAA,qBAAOwB,SAAAA;AACT,SAAA,YAAA,IAAA,SAAA,YAAA,SAAA;AAEAC,WAAAA;;uBAESd,WAAmB;UACxB,UAAKE,MAAAA;AACP,WAAA,gBAAA,IAAA,UAAA,SAAA,UAAA;AACAW,WAAAA,gBAAyB,QAAI;IAC7BA;AACF,cAAA,SAAA,OAAA,GAAA,iBAAA,OAAA;AAEA,cAAcE,qBAAsC,MAAA,UAAA,SAAA,OAAA,IAAA,iBAAA,OAAA;;QAGlD,uBAAMC;AACN,UAAKhB,UAAAA,CAAAA;AAEL,UAAK,yBAAoBgB,MAAAA,KAAAA,KAAAA,eAAwB;SAC/C,gBAAe,MAAKC;eAChBP,cAAQ,wBAAA;YACVC,SAAQO,KAAK,mBAAA,UAAA;kBACXX;gBACAY,KAAAA;UACF;UACF,UAAA;QACF,CAAA;MAEIR;;gBACyBA,SAAAA,GAAAA;AAAQ,WAAA,QAAA,YAAA;QACrC;MACF,CAAA;IAEQM;;qBAEIJ,YAAW;AACrB,UAAMO,YAASP,KAAAA,YAAmBO,IAAAA,UAAM;AACxC,IAAAlC,WAAKkC,WAAUP,qCAAoC,EAAA,YAAS,YAAA,GAAAxB,eAAA,GAAA,KAAA,GAAA,MAAA,GAAA,CAAA,aAAA,qCAAA,EAAA,CAAA;UAC1D,SAAA,UAAA,SAAA;AACF,QAAA,CAAA,UAAA,UAAA,SAAA,KAAA,EAAA,UAAA,SAAA;AACA;IACA;UACE,MAAA,OAAA,IAAA;AACF,QAAA,CAAA,KAAA;AACA;IACA;UACE,WAAA,UAAA,eAAAP,GAAA,UAAA,KAAA,UAAA,YAAA,IAAAA,GAAA,KAAA,GAAA;AACF,QAAA,SAAA,WAAA,GAAA;AACA+B;IACA;AACF,cAAA,eAAA/B,GAAA,SAAA,GAAA;AAEA,WAAc8B;;uBAEV,YAAA,UAAA;AACF,QAAA,KAAA,oBAAA5B,gBAAA,QAAA;AACI;;AAA+B,IAAAG,KAAA,kBAAA;MAEnC;IACAD,GAAAA,EAAAA,YAAU2B,YAAW,GAAAxB,eAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AACrB,UAAMgC,YAAAA,KAAgBC,YAAST,IAAAA,UAAkB;AACjD,IAAA3B,WAAA,WAAA,qCAAqD,EAAA,YAAA,YAAA,GAAAG,eAAA,GAAA,KAAA,GAAA,MAAA,GAAA,CAAA,aAAA,qCAAA,EAAA,CAAA;AACrD,UAAM,cAAakC,GAAAA,SAAAA,UAAcC,SAAUL,OAAU,IAAA,CAAA;UAAcM,KAAAA,QAAAA,cAAiB,UAAA,UAAA;MAAK;MAErF3C,iBAASuC;;QAEXR,GAAAA,OAAAA,aAAsB,UAAKS,YAAST,GAAUd;AAElD,gBAAA,eAAAjB,GAAA,SAAA,UAAA,SAAA,OAAA,IAAA,CAAA;IACF;;;;;AZpJA,IAAA4C,iBAAA;;;;;;EAYmBC,iBAAsC,oBAAA,IAAA;EACtCC;EAEjB;;cAEOD,QAAAA;AACL,SAAKC,iBAAiBC,OAAOC;AAC/B,SAAA,qBAAA,OAAA;AAEAC,SAAAA,iBAAqE,OAAA;;YAEjE,SAAMC;eACJC,OAAAA,CAAAA,EAAAA,MAAmB,MAACC,MAAAA;YACpBC,eAAcC,IAAAA,sBAAiBA;QACjC,eAAA,KAAA;QACAJ,aACO,CAAA,YACC,KAAA,OAAA;;mBAEJK,KAAAA,EAAAA,KAAAA,MAAAA;AAEDC,aAAM,eAAaA,IAAMC,QAAAA,gBAAAA,YAAAA;AAC5B,cAAO;MACT,CAAA,EAAA,MAAA,CAAA,QAAAC,KAAA,MAAA,KAAA,QAAA,EAAA,YAAA,YAAA,GAAAd,gBAAA,GAAA,IAAA,GAAA,KAAA,CAAA,CAAA;AACF,aAAA,MAAA,aAAA,MAAA;IAEA,CAAA;;QAEEe,mBAAUT,SAAc;AAExB,UAAIU,eAAgBC,KAAAA,eAAQ,IAAA,QAAA,cAAA;eACpBX,cAAaY,0BAAqBC,EAAM,YAAA,YAAA,GAAAnB,gBAAA,GAAA,IAAA,GAAA,MAAA,GAAA,CAAA,gBAAA,0BAAA,EAAA,CAAA;AAChD,QAAA,QAAA,QAAA,QAAA;AACIgB,YAAAA,aAAmBC,aAAQ,QAAA,MAAA;;AAE/B,QAAA,QAAA,WAAA,QAAA;AACF,YAAA,aAAA,gBAAA,QAAA,SAAA;IAEA;;QAEE,eAAO,SAAA;UAAEG,SAAAA,MAAYC,KAAOD,eAAU,UAAA,QAAA,YAAA;AAAC,WAAA;MACzC,YAAA,OAAA;IAEA;;eAEI,SAAA,SAAA;AACF,QAAA,CAAA,QAAA,SAAA;AACA;IACAL;AAEA,UAAMT,eAAagB,KAAOC,eAASC,IAAOC,QAAQC,cAAWV;AAC/D,IAAAD,WAAA,cAAA,0BAAA,EAAA,YAAA,YAAA,GAAAf,gBAAA,GAAA,IAAA,GAAA,MAAA,GAAA,CAAA,gBAAA,0BAAA,EAAA,CAAA;AAEA,UAAM2B,aAA6BJ,OAAyC,SAAA,OAAA,QAAA,QAAA,QAAA,EAAA,YAAA,YAAA,GAAAvB,gBAAA,GAAA,GAAA,CAAA,GAAA,QAAA,OAAA;;EAE5E,MAAA,MAAA,SAAA,SAAA;AAEA,UAAM4B,KAAAA,eAAiD,MAAqC,SAAA,OAAA,QAAA,QAAA,QAAA,EAAA,YAAA,YAAA,GAAA5B,gBAAA,GAAA,GAAA,CAAA,GAAA,OAAA;;QAE1F,iBAAkB,SAAA;UAChB,cAAO,QAAA;sBAAS;;QAAc,OAAA;UAAE,SAAA,CAAA;QAClC;MACA;IACA;UACE6B,QAAO,MAAA,KAAA,eAAA,SAAA,WAAA;;;iBAC+DA,MAAAA,IAAAA,CAAAA,QAAAA,SAAAA;UAAM,YAAA,YAAA,GAAA;UAC5E,OAAAA;QACF,EAAA;MACF;IAEA;;EAKA,MAAA,yBAAA,SAAA,SAAA;AAEA,UAAMC,KAAAA,eAA2CC,yBAA0C,SAAA,OAAA,QAAA,QAAA,QAAA,EAAA,YAAA,YAAA,GAAA/B,gBAAA,GAAA,GAAA,CAAA,GAAA,QAAA,KAAA;;EAE3F,MAAA,aAAA,SAAA,UAAA;AAEA,UAAMI,KAAAA,eAA+B,aAAA,QAAA,eAAA,CAAA,CAAA;;EAErC,MAAA,gBAAA;AAEA4B,UAAAA,KAAAA,eAAwBhB;;0BAEJA,SAAQiB;WACxBlB,IAAAA,OAAUmB,CAAAA,EAAAA,KAAQC,MAAQF,MAAAA,MAAAA;AAE1B,YAAMG,UAAAA,QAAiB;AACvB,MAAArB,WAAIsB,SAAAA,QAAeD,OAAAA,GAAAA,QAAkBE,EAAAA,YAAAA,YAAAA,GAA8BL,gBAASG,GAAAA,IAAAA,GAAAA,MAAAA,GAAAA,CAAAA,4BAAAA,EAAAA,EAAAA,CAAAA;AAC5E,YAAKnC,iBAAkB,KAACsC,mBAAAA,uBAAkCC,OAAAA;UACxD,eAAcF,kBAAAA,8BAA6CG,SAAW,cAAA;WACtE,mBAAcJ,yBAAc,GAAA,KAAA,CAAA,UAAA;cAC1BA,QAAAA,8BAAeK,SAAAA,MAAAA,WAAAA;YACfC,UAAUC,cAAO;AACnB,yBAAA;AACF,oBAAA,QAAA;QAEA;;wBAC2G,IAAAC,iBAAA,KAAA,YAAA;AAAC,cAAA,QAAA,eAAA,MAAA,KAAA,eAAA,uBAAA,YAAA,IAAA;UAE1GC,OAAK,CAAA;;AAAqB,aAAA;UAC5B,OAAA,MAAA;QAEI,CAACtC;;0BAESoC,uBAAO,GAAA,KAAA,CAAA,MAAA;AACnB,YAAA,EAAA,iBAAA,cAAA;AACF,oBAAA,QAAA;QACAD;MACF,CAAA;AACF,gBAAA,QAAA;IACF,CAAA;;;;;AajKA,YAAYI,eAAe;AAC3B,YAAYC,aAAY;AAExB,SAASC,gBAAAA,eAAcC,gBAAAA,eAAcC,aAAa;AAClD,SAAkBC,kBAAAA,iBAAgBC,YAAAA,iBAAgB;AAClD,SAASC,YAAY;AACrB,SAAiCC,mBAAAA,kBAAiBC,wBAAAA,6BAA4B;AAC9E,SAASC,mBAAAA,wBAAuB;AAChC,SAASC,iBAAiB;AAC1B,SAASC,mBAAwC;AACjD,SAASC,aAAAA,mBAAiB;AAG1B,SAASC,OAAAA,aAAW;AAIpB,SAASC,SAAAA,cAAa;;;ACJf,IAAMC,yBAAyB,CAACC,MAAAA;AACrC,MAAIA,EAAEC,YAAY,GAAG;AACnB,WAAOC;EACT;AACA,SAAO;IACLC,UAAUH,EAAEI,OAAOC,OAAO,IAAIL,EAAEI,SAASF;IACzCI,UAAUN,EAAEO,OAAOF,OAAO,IAAIL,EAAEO,SAASL;IACzCM,WAAWR,EAAES,MAAMJ,OAAO,IAAIL,EAAES,QAAQP;IACxCQ,WAAWV,EAAEW,QAAQN,OAAO,IAAIL,EAAEW,UAAUT;EAC9C;AACF;AAMO,IAAMU,aAAa,CAACC,GAAqBC,OAA2C;EACzFX,UAAUY,iBAAiBF,EAAEV,UAAUW,EAAEX,QAAQ;EACjDG,UAAUS,iBAAiBF,EAAEP,UAAUQ,EAAER,QAAQ;EACjDE,WAAWO,iBAAiBF,EAAEL,WAAWM,EAAEN,SAAS;EACpDE,WAAWK,iBAAiBF,EAAEH,WAAWI,EAAEJ,SAAS;AACtD;AAEA,IAAMK,mBAAmB,CACvBF,GACAC,MAAAA;AAEA,MAAID,MAAMX,UAAaY,MAAMZ,QAAW;AACtC,WAAOA;EACT;AACA,SAAO,oBAAIc,IAAO;OAAIH;OAAMC;GAAE;AAChC;;;AC5CA,YAAYG,aAAY;AACxB,YAAYC,cAAc;AAG1B,SAASC,WAAAA,gBAAe;AACxB,SAASC,qBAAqB;AAE9B,SAASC,uBAAuB;AAEhC,SAASC,gBAAgBC,aAAAA,kBAAiB;AAE1C,SAASC,oBAAoB;AAW7B,IAAAC,iBAAA;AAKE,IAAsB,wBAAtB,MAAsB;EACtB;EAEA;;cAMO,SAAU,WAAGC,WAAAA;AAClB,SAAK,WAAU;AACjB,SAAA,aAAA;AAEAC,SAAAA,aAAkE;;aAEhEJ,SAAUK;AACV,UAAM,EAAEC,MAAAA,IAASC;AACjB,IAAAP,WAAOF,OAAAA,qBAA2B,EAAI,YACpCJ,YAAW,GAAAQ,gBAAM,GAAA,IAAA,GAAA,MAAA,GAAA,CAAA,SAAA,qBAAA,EAAA,CAAA;UACf,EAAA,SAAMM,SAAeC,IAAK;WAC1B,gBAAe,WAAY,KAAA,QAAgB,EAAC,YAAA,MAAA,aAAA;YAC1CC,SAAWC,MAAAA,QAAOC,SAAU,MAAA,KAAA,IAAA;YAC5BC,SAAAA,OAAeC,KAAQT,WAAMU,MAAAA;QAC7BT,WAASA,OAAAA,WAAAA;QACTD,eAAO,QAAA,MAAA,mBAAA,aAAA,oBAAA;;QAA0B,OAAA;UACjCW,SAAUR,YAAAA,CAAAA;QACVS;QACF,UAAA;QAEA,OAAMC,MAAUC;MAIhB,CAAA;AACA,YAAMC,UAAAA,OAAaC,OAAAA,IAAaA,CAAAA,UAAUL,KAAAA,UAAY,cAAcK,OAAUL,MAAAA,MAAY,MAAA,YAAA,MAAA,CAAA,CAAA;AAE1F,YAAA,YAAgBM,OAA2B,OAAA,OAAA,OAAA,SAAA,CAAA;YACzCJ,aAAAA,aAAAA,UAAAA,YAAAA,OAAAA,OAAAA,UAAAA,QAAAA,IAAAA;aAEA,kBAAA;QACAE;;QAEF,YAAA,YAAA,SAAA,KAAA;QACF,YAAA;MAEJ,CAAA;IAEAG,CAAAA,CAAAA;;kBAEQV,SAAAA;AACNd,UAAAA,EAAAA,aACEE,SAAauB,SAAAA,QAAAA,IAAqBX;AAIpC,UAAA,gBAAOf,eAA2B,aAChCJ,oBAAiB;mBACT+B,aAAYP,qBAAoBQ,aAAa,GAAA,uBAAA,uCAAA;2BACxCpB,WAAAA,KAAAA,QAAAA,EAAAA,YAAAA,MAAAA,aAAAA;wBACDqB,WAAAA,CAAAA,GAAAA,IAAAA,CAAAA,aAAAA;QACRd;QACAe,QAAM/B;QACR;QAEO,MAAK,cAAWgC,OAAYJ,KAAAA,MAAAA,OAAAA,CAAAA;MACrC,EAAA;AAEJ,aAAA,KAAA,WAAA,YAAA,QAAA;IAEAK,CAAAA,CAAAA;;kBAEQjB,SAAAA;AACNd,UAAAA,EAAAA,aACEE,SAAauB,SAAAA,UAAqBX,IAAAA;AAIpC,UAAA,gBAAOf,eAA2B,aAChCJ,oBAAiB;mBACT+B,aAAWM,qBAAwB,aAAA,GAAA,uBAAA,uCAAA;2BAC9BzB,WAAAA,KAAAA,QAAAA,EAAAA,YAAAA,MAAAA,aAAAA;uBACDqB,UAAAA,IAAAA,CAAAA,QAAAA;QACRd;QACAe,QAAM/B;;cAA2B,cAAY,OAAA;UAAK;UACpD,YAAA;QAEO,CAAA;MACT,EAAA;AAEJ,aAAA,KAAA,WAAA,YAAA,QAAA;IAEA,CAAA,CAAMmC;;EAEN,MAAA,UAAA,SAAA,SAAA;AACF,UAAA,KAAA,aAAA,SAAA,OAAApC,SAAA,QAAA,QAAA,EAAA,YAAA,YAAA,GAAAM,gBAAA,GAAA,GAAA,CAAA,GAAA,OAAA;;;;;ACvHA,YAAS+B,YAAcC;AACvB,SAASC,gBAAAA,eAAc,mBAAA,gBAAAC,qBAA8B;AACrD,SAAuBC,UAAAA,eAAQ;AAC/B,SAASC,YAAAA,iBAAa;AACtB,SAASC,aAAQ;AAGjB,SAASC,YAAAA,iBAAW;AAOpB,SAASC,OAAAA,aAAK;AAGd,SAASC,SAAAA,cAAa;;;ACjBtB,YAAYC,aAAa;AAEzB,SAASC,sBAAsBC,kBAAAA,iBAAgBC,YAAAA,iBAAgB;AAC/D,SAAmBC,SAAAA,cAAa;AAChC,SACEC,qBAAAA,oBACAC,kBAEAC,iBAEAC,0BACK;AACP,SAASC,aAAaC,sBAAsBC,4BAA4B;AACxE,SAA+BC,qBAAqBC,kBAAkB;AACtE,SAASC,uBAA2E;AACpF,SAASC,aAAAA,mBAAiB;AAC1B,SAASC,WAAwC;AACjD,SAASC,OAAAA,aAAW;AAEpB,SAASC,cAAcC,SAASC,iBAAAA,sBAAqB;;;ACtBrD,SAASC,iBAAiB;AAEnB,IAAMC,aAAN,cAAyBD,UAAUE,OAAO,YAAA,EAAA;AAAe;AAEzD,IAAMC,oBAAN,cAAgCF,WAAWC,OAAO,mBAAA,EAAA;AAAsB;;;ACJ/E,SAASE,OAAOC,aAAa;AAC7B,SAASC,gBAAgB;AACzB,SAASC,aAAAA,kBAAiB;;;UCETC,YAAAA;aAeFC,OAAOC,OAAOC,OAAO;IAChCC,MAAM,CAACC,WAAyB;MAAEA;IAAM;EAC1C,CAAA;aAgHaC,aAAaJ,OAAOC,OAAO;IACtCI,QAAQ,CAACC,SAAAA;AACP,cAAQA,KAAKC,OAAOC,MAAI;QACtB,KAAK,UAAU;AAEb,iBACEF,KAAKC,OAAOE,aAAa,SACxBH,KAAKC,OAAOG,OAAOC,UAAaL,KAAKC,OAAOG,GAAGE,WAAW,OAC1DN,KAAKC,OAAOM,UAAUF,UAAaX,OAAOc,KAAKR,KAAKC,OAAOM,KAAK,EAAED,WAAW,OAC7EN,KAAKC,OAAOQ,gBAAgBJ,UAAaL,KAAKC,OAAOQ,YAAYH,WAAW;QAEjF;QACA;AACE,iBAAO;MACX;IACF;EACF,CAAA;AAoHF,GArQiBd,cAAAA,YAAAA,CAAAA,EAAAA;;;;ADIjB,IAAAkB,iBAAA;IAKI,uBAAsB,CAAA,UAAA;gBACpBC,MAAS;WACTC,IAAAA,WAAS;eAAEC;MAAY,SAAA;QACzB,OAAA;MACF;IACA,CAAA;EACA;QACEF,cAAU,MAAA,OAAmB,MAAEG,QAAAA,KAAa,CAAA;SAC5CF,IAAAA,WAAS;aAAEC,sBAAAA,WAAAA;aAAOC;MAAY;MAChC;IACF;EAMA,CAAA;;AAEA,IAAA,kBAAA;EAEA,uBAAA;;AAOE,IAAA,eAAA,MAAoD;;cAE7CC,SAAAA;SACH,WAAU;MACZ,GAAA;MACF,GAAA;IAEAC;;aAEMC,OAAO;SAAwB,qBAAkB,KAAA;QAAEC,OAAAA,KAAAA,UAAeL,OAAAA;MAAM,GAAA;MAC5EI,eAAYE;IACZF,CAAAA;AACAA,WAAO,KAAKG,sBAAiBH,IAAAA;AAC7BA,WAAO,KAAKI,oBAAgBJ,IAAAA;AAC5B,WAAOA,KAAAA,iBAAAA,IAAAA;AACT,WAAA,KAAA,gBAAA,IAAA;AAEQK,WAAUT;;YAEd,OAAK,SAAA;kBACH,MAAO;MACT,KAAK;AACH,eAAO,KAAKU,uBAAsBV,OAAOD,OAAAA;MAC3C,KAAK;AACH,eAAO,KAAKY,sBAAsBX,OAAOD,OAAAA;MAC3C,KAAK;AACH,eAAO,KAAKa,sBAAAA,OAAAA,OAAkCZ;MAChD,KAAK;AACH,eAAO,KAAKa,kCAA+Bd,OAAAA,OAAAA;MAC7C,KAAK;AACH,eAAO,KAAKe,wBAAAA,OAAAA,OAAiCd;MAC/C,KAAK;AACH,eAAO,KAAKe,iCAAiC,OAACf,OAAOD;MACvD,KAAK;AACH,eAAO,KAAKiB,kCAAkChB,OAAOD,OAAAA;MACvD,KAAK;AACH,eAAO,KAAKkB,kCAA4BlB,OAAAA,OAAAA;MAC1C,KAAK;AACH,eAAO,KAAKmB,qBAAAA,OAA4B,OAAClB;MAC3C,KAAK;AACH,eAAO,KAAKmB,6BAA4BpB,OAAAA,OAAAA;MAC1C,KAAK;AACH,eAAO,KAAKqB,qBAAqBpB,OAAOD,OAAAA;MAC1C,KAAK;AACH,eAAO,KAAKsB,qBAAoBrB,OAAOD,OAAAA;MACzC,KAAA;AACE,eAAM,KAAIuB,oBAAW,OAAA,OAAA;;cAEnBvB,IAAAA,WAAS;mBAAEC,2BAA4B,MAAA,IAAA;UAAC,SAAA;YAC1C,OAAA,QAAA;UACJ;QACF,CAAA;IAEQuB;;yBAEM,OAAA,SAAA;AACZ,UAAA,aAAA;MACIvB,GAAAA;;AAEJ,QAAA,MAAA,QAAA,SAAA;AACA,iBAAYS,kBAAqB,MAAEe,QAAAA;IACrC;AAEQH,WAAAA,KAAAA,UAAmD,MAAEtB,OAA4C,UAAA;;sBAEzFU,OAAAA,SAAgBT;cAAS,KAAGD,SAAO,SAAA;aAAE0B,KAAOzB,UAAWyB,MAAK,OAAA;QAAC,GAAA;QAC3E,OAAA,MAAA,KAAA;MAEA,CAAA;IACA;qBAEmC,MAAA,KAAA;sBAAUC,SAAWC,IAAAA,MAAAA,OAAAA,CAAAA,SAAAA,KAAAA,SAAAA,WAAAA;MAAUC,MAAAA;MAAwBC,WAAAA;MAEnF,QAAKpB,KAAS;IACvB,IAAA,IAAA;AAEQC,WAAAA,KAAAA,UAAsBV,WAA6D,OAAkB;;EAE7G,sBAAA,OAAA,SAAA;AAEA,WAAA,KAAA,6BAAA,MAAA,QAAA,OAAA;EACA;;;+BAGY4B,SAAA,SAAA;YACRA,QAAK,MAAA;;;YAQD,QAAOE,qBAAoBF,QAAA,OAAA,UAAAA,QAAA,aAAA,QAAA,OAAA,KAAAA,QAAA,KAAA,EAAA,WAAA,GAAA;2BAEjB,KAAA,KAAA;YACR;cACG,MAAKG;YACT;YACH,GAAA,KAAA,8BAAA,OAAA;UACIhC,CAAAA;;AAEJ,YAAA,QAAA,mBAAA;AAEA,gBAAA,qBAAA,QAAA,aAAA;QACA;oBAGI,MAAA6B,QAAA,IAAA,SAAA,GAAA;2BACQ,KAAA,KAAA;;cAENI,MAAAA;qBACEC,QAAM;wBACNC;gBACF,MAAA;gBACF,WAAAN,QAAA;cACG;YACH;oBACEK,8BAAM,OAAA;;oBACI;sBAAeE;gBAAU,GAAAP;gBACrC,IAAA;cACD;YACI;UACL,CAAA;mBACEA,QAAA,UAAA;2BACQ,KAAA,KAAA;;cAENI,MAAAA;qBACEC,QAAM;wBACNG;sBAAWR;0BAA8B;kBACzCS,QAAU;gBACZ;gBACF,UAAA;cACG;YACH;YACA,GAAA,KAAA,8BAAA,OAAA;;;oBAEY;cAAU,QAAA;gBACtB,GAAAT;cACD;YACI;UACL,CAAA;;2BAEU,KAAA,KAAA;;cAENI,MAAAA;qBACEC,QAAM;cACR,UAAA;gBACF,MAAA;cACG;YACH;oBACEA,8BAAM,OAAA;;oBACI;cAAU,QAAA;gBACtB,GAAAL;cACD;YACH;UACF,CAAA;QAEM;MACN;;;yBAGY,KAAA,KAAA;;YAENI,MAAAA;mBACEC,QAAM;YACR,UAAA;cACF,MAAA;YACG;UACH;kBACEA,8BAAM,OAAA;;kBACI;YAAU,QAAA;cACtB,GAAAL;YACD;UACH;QAEO,CAAA;MACP;;;yBAGY,KAAA,KAAA;;YAENI,MAAAA;mBACEC,QAAM;sBACAL;cACNU,MAAAA;cACAF,MAAAA,QAAU;cACZ,YAAAR,QAAA,cAAA,KAAA,SAAA;cACF,UAAA;YACG;UACJ;UACH,GAAA,KAAA,8BAAA,OAAA;QAEA,CAAA;MACA;;;oBAGM9B,mBACE;gBACFC,IAAAA,WAAS;qBAAEC;YAA6B,SAAA;cAC1C,OAAA,QAAA;YACF;UACA,CAAA;;yBAEU,KAAA,KAAA;;YAENgC,MAAAA;YACF,OAAA,QAAA;YACG,UAAKD,2BAA8BhC,OAAAA;UACvC;UACH,GAAA,KAAA,8BAAA,OAAA;QAEA,CAAA;MACA;;;yBAGY,KAAA,KAAA;;YAENiC,MAAAA;mBACEC,QAAM;YACR,UAAA;cACF,MAAA;YACG;UACH;kBACEA,8BAAM,OAAA;;kBACI;YAAU,QAAA;cACtB,GAAAL;YACD;UACH;QAEA,CAAA;MACA;;MAEA,KAAK;AACH,cAAMW,qBAAqBxC,QAAQM,aAAa;MAClD,KAAK;AACH,cAAMkC,qBAAqBxC,QAAQM,aAAa;MAElD,KAAA;AACA,cAAK,qBAAA,QAAA,aAAA;;;eAGDmC,KAAAA,6BAA4BA,QAAAA,QAAiB;UAC/C,GAAA;UACG,mBAAA,CAAA,QAAA;QAAO,CAAA;;AAGV,cAAMC,cAAAA,YAAiBC,QAAYd,OAAQe;AAC3C,cAAMC,mBAAeF,YAAYd,OAAQe,CAAMA,MAAEE,EAAI,SAAK,WAAeF;AAEzE,cAAIG,iBAAiBC,YAAchD,OAAAA,CAAQyC,MAAAA,EAAAA,SAAAA,UAAmB;cAC5D,eAAUlB,YAAW,OAAA,CAAA,MAAA,EAAA,SAAA,eAAA,EAAA,SAAA,UAAA;6BAEjB,SAAA,KAAA,QAAA,mBAAA;gBACFvB,IAAAA,WAAS;qBAAEC;YAA6B,SAAA;cAC1C,OAAA,QAAA;YACF;UAEI8C,CAAAA;;YAEF,iBAAME,SAAYC,KAAAA,aACTC,UAAAA,KAAAA,eAA6BD,WAAalD,GAAAA;gBAE7C,cAAA,aAAA,CAAA;4BACQ,cAAA,KAAA,6BAAA,aAAA,OAAA,IAAA,UAAA,KAAA,KAAA;;cAENiC,MAAAA;qBAAYC,QAAM;cAAmB,UAAA;gBACvC,MAAA;cACG;YACJ;YAEL,GAAMkB,KAAAA,8BAA4BC,OAAiBC;UACnD,CAAA;gBACE,YAAMC,UAAW,MAAA,UAAA,CAAA,MAAA,EAAA,SAAA,YAAA;4BAAIN,IAAUO;kBAAM,WAAA;cACrCD,GAAAA,UAAgBH;;qBAEdvB,OAAQ,YAAA,GAAA,GAAA;oBAAEiB;sBAAaW;gBAA0B,MAAA;gBACnD,SAAA;cACA;YACF,CAAA;AAEA,mBAAMxB,UAAWyB,KAAAA,KAAAA,QAAAA;UACjB;gBACE,WAAA,yBAAA,iBAAA,IAAA,0BAAA,CAAA;2BACQ,KAAA,KAAA;;cAENzB,MAAAA;cACF,OAAA,QAAA;cACG;YACJ;YACH,GAAA,KAAA,8BAAA,OAAA;UAEIc,CAAAA;;6BAGE,SAAA,KAAA,eAAA,WAAA,GAAA;gBACF/C,IAAAA,WAAS;qBAAEC;YAA6B,SAAA;cAC1C,OAAA,QAAA;YACF;UAEIyC,CAAAA;;YAEF,eAAMO,SACJU,GAAAA;gBAG0Cb,mBAAM,YAAA,OAAA,CAAA,MAAA,EAAA,SAAA,UAAA;gBAAOW,YAASE,iBAAAA,WAAAA,IAAAA,KAAAA,6BAAAA,iBAAAA,CAAAA,GAAAA,OAAAA,IAAAA,iBAAAA,SAAAA,IAAAA,KAAAA,6BAAAA;YAAoB3D,MAAAA;YAE5E,SAAA;oBACEkC,IAAM,UAAA,KAAA,KAAA;;cAEND,MAAAA;qBAAYC,QAAM;cAAmB,UAAA;gBACvC,MAAA;cACG;YACJ;YAET,GAAM0B,KAAAA,8BAAqDhB,OAAO;;+BAExDA,eAAAA,IAAAA,CAAAA,OAAAA;YACV,MAAA;YAEOb,QAAAA;;iBAA4C6B,UAAAA,KAAAA,KAAAA;YAAa,GAAA,UAAA;YAClE,GAAA;UAEA,CAAA;QACF;AACK,cAAA,qBAAA,QAAA,aAAA;MACH;WACA;oBAEIC,QAAUhC,MAAOiB,uBAAqBjB,GAAAA;gBACtC,YAAcQ,QAAAA,QAAQ,IAAA,CAAAR,YAAA;AACxB,YAAAgC,WAAAhC,QAAA,SAAA,YAAAA,QAAA,aAAA,MAAA,QAAA,EAAA,YAAA,YAAA,GAAA/B,gBAAA,GAAA,KAAA,GAAA,MAAA,GAAA,CAAA,wDAAA,EAAA,EAAA,CAAA;AAEA,mBAAOiC,QAAU+B;;2BAEP,KAAA,KAAA;;cAEN7B,MAAAA;qBACEC,QAAM;wBACNG;gBACAC,MAAAA;gBACF,UAAA;gBACF,UAAA,QAAA;cACG;YACH;oBACEJ,8BAAM,OAAA;;oBACI;cAAU,QAAA;gBACtB,GAAAL;cACD;YACI;UACL,CAAA;QACF,OAAA;AAEF,gBAAA,qBAAA,QAAA,aAAA;QACE;;cAEE7B,IAAAA,WAAS;mBAAEC,4BAA4B4B,QAAA,IAAA;UAAC,SAAA;YAC1C,OAAA,QAAA;UACJ;QACF,CAAA;IAEQG;;gCAEC,SAAA;oBACI,iBAAE;MACX,KAAK;AACH,eAAO,CAAA;;;;YAIL,MAAA;YACD,MAAA;UACE;QACH;;;;YAIE,MAAA;YACD,MAAA;UACL;QACF;IAEQd;;uBAEJ,OAAA,SAAA;qBACQ,KAAA,KAAA;;QAER,MAAA;QACD,OAAA,MAAA,QAAA,IAAA,CAAAjB,WAAA,KAAA,UAAAA,QAAA,OAAA,CAAA;MACH;IAEQkB,CAAAA;;+BAKJ,OAAA,SAAA;qBACQ,KAAA,KAAA;;QAEN4C,MAAAA;QACF,QAAA,KAAA,UAAA,MAAA,QAAA,OAAA;QACD,SAAA,KAAA,UAAA,MAAA,SAAA,OAAA;MACH;IAEQ/C,CAAAA;;oCAKoBgD,OAAQhE,SAASwD;WACzC,UAAA,KAAA,KAAA;cACEtB,UAAM,MAAA,QAAA,OAAA,EAAA;;cAEJA;mBACA+B;UACAC,MAAAA;UACF,WAAA;UACF,UAAA,MAAA;QACG;MACJ;MACH,GAAA,KAAA,8BAAA,OAAA;IAEQrD,CAAAA;;oCAKoBmD,OAAQhE,SAASwD;WACzC,UAAA,KAAA,KAAA;cACEtB,UAAM,MAAA,QAAA,OAAA,EAAA;;cAEJA;mBACA+B;UACAC,MAAAA;UACF,WAAA;UACF,UAAA,MAAA,YAAA;QACG;MACH;cACEhC,8BAAM,OAAA;;cAEJY;gBACAT;UACA8B,MAAAA;UACF,UAAA,MAAA;UACF,OAAA,CAAA;QACD;MACH;IAEQpD,CAAAA;;mCAKC,OAAA,SAAA;kBAAU,WAAA;;eAGXqD,UAAAA,KAAAA,KAAAA;aACG,KAAKpC,UAAAA,MAAAA,QAAAA,OAA8BhC,EAAAA;UACvC,4BAAA,oBAAA;UACH,GAAA,KAAA,8BAAA,OAAA;QACK,CAAA;MAAU;;eAGXoE,UAAAA,KAAAA,KAAAA;aACG,KAAKpC,UAAAA,MAAAA,QAAAA,OAA8BhC,EAAAA;UACvC,4BAAA,oBAAA;UACH,GAAA,KAAA,8BAAA,OAAA;QACK,CAAA;MAAQ;;2BAGKwD,KAAK,UAAA,MAAA,QAAA,OAAA;eACnB,UAAA,KAAA,KAAA;wBACQ;;kBAEJzB;;wBAAuE,KAAA,KAAA;gBACvEA,4BAAoB,oBAAA;;wBAAmD,KAAA,KAAA;gBACxE,4BAAA,oBAAA;cACH,CAAA;YACG;UACJ;UACH,GAAA,KAAA,8BAAA,OAAA;QACF,CAAA;MACF;IAEQjB;;0BAEC,OAAA,SAAA;kBAAY,WAAA;;eAGbsD,UAAAA,KAAAA,KAAAA;aACG,KAAKpC,UAAAA,MAAAA,QAAAA,OAA8BhC,EAAAA;UACtC,4BAAA,oBAAA;kBACEkC,8BAAM,OAAA;;YAER,MAAA;YACD,QAAA,MAAA,UAAA;UACH;QACK,CAAA;MAAY;;eAGbkC,UAAAA,KAAAA,KAAAA;aACG,KAAKpC,UAAAA,MAAAA,QAAAA,OAA8BhC,EAAAA;UACtC,4BAAA,oBAAA;kBACEkC,8BAAM,OAAA;;YAER,MAAA;YACD,QAAA,MAAA,UAAA;UACH;QACK,CAAA;MAAQ;;2BAGKsB,KAAK,UAAA,MAAA,QAAA,OAAA;eACnB,UAAA,KAAA,KAAA;wBACQ;;kBAEJzB;;wBAAuE,KAAA,KAAA;gBACvEA,4BAAoB,oBAAA;;wBAAmD,KAAA,KAAA;gBACxE,4BAAA,oBAAA;cACH,CAAA;YACG;UACH;kBACEG,8BAAM,OAAA;;YAER,MAAA;YACD,QAAA,MAAA,UAAA;UACH;QACF,CAAA;MACF;IAEQtB;;wBAEIF,OAAUT,SAAM0B;WACxB,UAAA,KAAA,KAAA;cACEO,UAAM,MAAA,WAAA,OAAA,EAAA;;QAER,MAAA;QACD,QAAA,MAAA;MACH;IAEQjB,CAAAA;;oCAKoB+C,OAAQhE,SAASwD;WACzC,UAAA,KAAA,KAAA;cACEtB,UAAM,MAAA,QAAA,OAAA,EAAA;;cAEJA;mBACA+B;UACF,MAAA;UACF,WAAA,MAAA;QACG;MACJ;MACH,GAAA,KAAA,8BAAA,OAAA;IAEQI,CAAAA;;uBAESpE,OAAQ6B;QACrB,WAASgB;aACPwB,MAAAA,OAAW,CAAA,SAAA;AACb,UAAA,KAAA,SAAA,QAAA;AACF,mBAAA;MACI;;mBAEAvE;YACAC,IAAAA,WAAS;iBAAEC;QAAM,SAAA;UACnB;QACF;MACF,CAAA;IAEA;;;;;wBAOqB,MAAK;qBACR8B,KAAAA,KAAUwC,KAAAA,MAAWC,OAAOC,CAAAA,SAAAA;AACtC,UAAA,KAAO,SAAA,cAAA;AACL,eAAO,CAAA,UAAA,WAAA,OAAA,IAAA;MACT,OAAA;AAEIA,eAAAA;MACJ;YACE,SAAO;eACLvC,SAAM,aAAA;eACNwC;UACF,MAAA;UACK,OAAA,KAAA,MAAA,IAAA,CAAArE,UAAA,KAAA,sBAAAA,KAAA,CAAA;QACL;MACF,OAAA;AACF,eAAA;MAEN;IAEA,CAAA,CAAA;;;;;sBAKSA,MAAAA;AAGDe,WAAAA;;uBAEIV,OAAUT,SAAW;WAC7B,UAAA,KAAA,KAAA;cACEiC,UAAM,MAAA,OAAA,OAAA,EAAA;;QAER,MAAA;QACD,OAAA,MAAA;MACH;IAEQb,CAAAA;;uBAEIX,OAAUT,SAAW;WAC7B,UAAA,KAAA,KAAA;cACEiC,UAAM,MAAA,OAAA,OAAA,EAAA;;QAER,MAAA;QACD,OAAA,MAAA;MACH;IAEA,CAAA;EACA;;;;;;mBAMQyC,MAAAA;2BAEK,KAAA,MAAA,IAAA,CAAA,SAAA;eACLzC,SAAM,aAAA;eACNwC;UACF,MAAA;UACK,OAAID,KAAS,MAAK,IAAA,CAAA,YAAA,KAAqB,iBAAA,OAAA,CAAA;QAC5C;iBACEvC,KAAM,SAAA,qBAAA;eACN0C;UACAb,MAAAA;UACF,QAAA,KAAA,iBAAA,KAAA,MAAA;UACF,SAAA,KAAA,iBAAA,KAAA,OAAA;QACA;MACF;AAEA,aAAMc;IAEN,CAAA;UAAqC,gBAAA,UAAA,KAAA,KAAA,cAAA;UAAc,sBAAA,oBAAA,IAAA;MAAgB;MAAa;MAAoB;MAC/F;;aAECJ,IAAAA,cAAc,MAAA,SAAa,GAAA,KAAA,GAAA,KAAA;YAC7B,OAAOI,cAAAA,MAAAA,CAAAA;AACT,UAAA,KAAA,SAAA,aAAA;AACIC,eAAAA;;AAEJ,UAAA,oBAAA,IAAA,KAAA,IAAA,GAAA;AACF;MAEA;IACA;QAEE,cAAID,cAAuB3C,MAAI;aAC7B6C,IAAAA,cAAcC,MAAAA,SAAAA,GAAAA,KAAAA,GAAAA,KAAAA;AAChB,UAAA,cAAO,MAAA,CAAA,EAAA,SAAA,aAAA;AACL,sBAAA;MACF,OAAA;AACF;MAEA;;UAAyC,WAAA;MACzCzB,GAAAA,cAAgBwB;;aAEdE,OAAO,aAAA,GAAA;YAACC;aAAkB;QAC5B,MAAA,QAAA;MAEA;IACF,CAAA;AAEA,WAAA,UAAA,KAAA,KAAA,QAAA;;;;;;kBAMQP,MAAAA;2BAEK,KAAA,MAAA,IAAA,CAAA,SAAA;eACLzC,SAAM,aAAA;eACNwC;UACF,MAAA;UACK,OAAID,KAAS,MAAK,IAAA,CAAA,YAAA,KAAqB,gBAAA,OAAA,CAAA;QAC5C;iBACEvC,KAAM,SAAA,qBAAA;eACN0C;UACAb,MAAAA;UACF,QAAA,KAAA,gBAAA,KAAA,MAAA;UACF,SAAA,KAAA,gBAAA,KAAA,OAAA;QACA;MACF;AAEA,aAAA;IACA,CAAA;AAGA,QAAK,iBAAQY;QACX;aACIF,IAAAA,eAAc,SAAa,GAAA,KAAA,GAAA,KAAA;YAC7BU,OAAAA,eAAiBH,CAAAA;UACjBI,KAAAA,SAAaX,aAAU;AACvB,yBAAA;AACF,qBAAA,KAAA;AACA;MACA;AAEA,UAAA,KAAA,SAAA,aAAA;AACF;MAEIU;;AAEJ,QAAA,mBAAA,MAAA,eAAA,QAAA;AAEA,aAAA,UAAA,KAAA,KAAA,cAAA;IACA;UACuC,WAAA,oBAAA,IAAA;MAAgB;MAAoB;MAEvEE;IACJ,CAAA;AACA,QAAK,kBAAeF;QAClB,iBAAaR;aACTF,IAAAA,GAAKvC,IAAI,gBAAK,KAAc;YAC9BmD,OAAAA,eAAkBL,CAAAA;AACpB,UAAA,KAAA,SAAA,cAAA;AACIP,0BAAc;;AAElB,UAAA,KAAA,SAAA,aAAA;AACIa,yBAAab;;UAEfY,SAAAA,IAAAA,KAAkB,IAAC,GAAA;AAErB,0BAAA;AACF,yBAAA;MAEIA;;AAEJ,QAAA,oBAAA,MAAA,mBAAA,IAAA;AAEA,aAAA,UAAA,KAAA,KAAA,cAA4C;IAC5C;UAAoC,WAAA;MAEpC,GAAA;IACA;QAEE9B,oBAAS8B,IAAAA;YACP,aAAa,SAAA,eAAA;eACbE,eAAOH,IAAAA;QACT,GAAA;QACF,OAAA;MAEA;IACA;QAEE7B,mBAASiC,IAAAA;YACP,YAAY,SAAA,cAAA;eACZD,cAAOH,IAAAA;QACT,GAAA;QACF,OAAA;MAEA;IACA7B;AAGF,aAAA,OAAA,gBAAA,CAAA;AACF,WAAA,UAAA,KAAA,KAAA,QAAA;EA2BA;;IAEE7B,kBAAQ;EACR+D,eAAAA;EACAhD,OAAAA,CAAAA;EACF,iBAAA;EAEA,mBAAqC;;IAEnCJ,cAAU;EACVqD,MAAM;EACNvB,UAAQ;EACV,IAAA,CAAA;EAEA,OAAMC,CAAAA;;kCAEO,CAAA,eAAA;QACTlC;aACA+B;IACF,MAAA;IACF;EAEA;;AAKE,IAAK,cAAWR,CAAAA,YAAS;QACvB,SAAU,CAAA;aACRkC,KAAOC,SAAQC;AACjB,QAAA,EAAA,SAAO,OAAA;AACLF,aAAOC,KAAKhD,GAAAA,YAAAA,EAAAA,OAAAA,CAAAA;IACd,OAAA;AACF,aAAA,KAAA,CAAA;IACA;EACF;AAEA,SAAMkD;;iCACkD,CAAAjE,YAAA;AAAoB,QAAA,WAAA;IAC1E,MAAMkE;EAQN9D;AACA,QAAA,MAAOA,QAAAA,UAAAA,cAAAA,QAAAA,aAAAA,SAAAA,QAAAA,aAAAA,OAAAA,iBAAAA,kBAAAA,QAAAA,aAAAA,SAAAA,QAAAA,aAAAA,OAAAA,iBAAAA;AACT,WAAA,GAAA,IAAAJ,QAAA;AAEA,SAAM6B;;+BACgD,CAAA,cAAA;AAAoB,QAAA,SAAA;IACxE,MAAK;;aAEDsC,KAAOC,WAAAA;AACT,QAAA,EAAA,gBAAA,MAAA;AACI3C,aAAE4C,eAAiB,KAAM,IAAA,OAAA,gBAAA,GAAA,EAAA,YAAA;;AAE7B,QAAA,EAAA,iBAAA,MAAA;AACI5C,aAAE6C,gBAAgB,KAAM,IAAA,OAAA,iBAAA,UAAA,EAAA,aAAA;;AAE5B,QAAA,EAAA,gBAAA,MAAA;AACI7C,aAAE8C,eAAiB,KAAM,IAAA,OAAA,gBAAA,GAAA,EAAA,YAAA;;AAE7B,QAAA,EAAA,iBAAA,MAAA;AACF,aAAA,gBAAA,KAAA,IAAA,OAAA,iBAAA,UAAA,EAAA,aAAA;IACA;EACF;AAEA,SAAMC;;AAQN,IAAA,0BAAA,CAAAxE,YAAA;;;;;AF50BA,IAAAyE,iBAAMC;;;;;;aAOA,CAAA,SAAOC;AACT,QAAA,KAAO,KAAIC;AACT,aAAOA,gBAAU,UAAgB,KAAA,GAAA;IACnC,WAAO,KAAA,MAAA;AACL,aAAM,KAAIC,KAAM,UAAA,MAAA;IAClB,OAAA;AACF,YAAA,IAAA,MAAA,oBAAA;IAEAC;;eAEI,CAAA,MAAOC,aAAgB;AACzB,QAAA,KAAO,KAAIH;AACT,aAAOG,QAAQH,KAAKI,IAAI,MAAEC,QAAAA;IAC5B,WAAO,KAAA,MAAA;AACL,aAAM,QAAIJ,KAAM,MAAA,QAAA;IAClB,OAAA;AACF,YAAA,IAAA,MAAA,oBAAA;IAEAK;;aAEI,CAAA,SAAOP;AACT,QAAA,KAAO,KAAIC;AACT,aAAOA,gBAAUO,UAAY,KAAA,GAAA,IAAA,GAAA;IAC/B,WAAO,KAAA,MAAA;AACL,aAAM,KAAIN,KAAM,WAAA;IAClB,OAAA;AACF,YAAA,IAAA,MAAA,oBAAA;IAEAO;;qBAEWT,CAAAA,SAAAA;AACT,QAAA,KAAO,KAAIC;AACT,aAAOA,gBAAUS,kBAAqB,KAAA,GAAA,IAAA,GAAA;IACxC,WAAO,KAAA,MAAA;AACL,aAAM,KAAIR,KAAM,oBAAA;IAClB,OAAA;AACF,YAAA,IAAA,MAAA,oBAAA;IAEAS;;qBAEWX,CAAAA,SAAAA;AACT,QAAA,KAAO,KAAIC;AACT,aAAOA,gBAAUW,kBAAqB,KAAA,GAAA,IAAA,GAAA;IACxC,WAAO,KAAA,MAAA;AACL,aAAM,KAAIV,KAAM,oBAAA;IAClB,OAAA;AACF,YAAA,IAAA,MAAA,oBAAA;IACF;EAuBA;;IAEIW,iBAAM,OAAA,OAAA;aACNC,OAAAA;IACAC,MAAAA;IACAC,SAAAA;IACAC,aAAW;IACXC,iBAAS;IACTC,WAAO;IACPC,SAAAA;IACAC,OAAAA;IACAC,gBAAe;IACfC,kBAAY;IACd,eAAA;IACAC,UAAUC,CAAAA;EACRA;WACAA,CAAMH,WAAAA;AACR,IAAAG,OAAA,QAAA,YAAA,IAAA;AACAC,IAAAA,OAAAA,gBAA0BD,OAACA,QAAAA,OAAAA;;4BAEVP,CAAAA,WAAO;gBACfO,QAAWA,OAAA,MAAA;MAChBE,OAAAA,OAAQ;WACNC,OAAAA;cACEC;kBACAC;UACAC,UAAAA;UACAC,OAAO;UACPC,YAAY;iBACV;sBAAC;;cAAiC;cAClCR,OAAA;;;cAA0C;cAC1CA,OAAA;;;cAA+B;cAC/BA,OAAA;;;cAAwC;cACxCA,OAAA;;;cAA4C;cAC7CA,OAAA;YACDS;UACF;UACF,aAAAT,OAAA;QACF;MACA;;AAEA,eAAA,SAAAA,OAAA,UAAA;AACF,qBAAA,yBAAA,KAAA;IACAU;;UAEI,CAAAV,WAAO;eACF,CAAAA,QAAIW,WAAOC;aACX;QACH,GAAA,IAAA,OAAA,MAAA,CAAA,MAAAZ,OAAA,IAAA,IAAAA,OAAA,OAAA;WACGA,IAAAA,OAAMF,MAASe,CAAG,eAAeC,OAAOF,WAAS,WAAAZ,OAAA,eAAA,iBAAAA,OAAA,SAAA,aAAAA,OAAA,cAAA,QAAA,CAAA,CAAA,cAAAA,OAAA,eAAA,QAAA,CAAA,CAAA,aAAAA,OAAA,iBAAA,QAAA,CAAA,CAAA;QACpDe;QACJ,GAAAf,OAAA,SAAA,IAAA,CAAA,UAAA,GAAA,OAAA,SAAA,CAAA,CAAA;MACA,EAAA,KAAUA,IAAAA;IACZ;AACC,WAAA,GAAAA,QAAA,CAAA;EAiBH;AAEA,CAAA;AACA,IAAMgB,wBAAAA,CAAAA,CAAAA,YAAiC,KAAA;AAoBvC,IAAMC,iCAAiBC;IACrB,iCAA4B;oBAChB,CAAA,SAAA;QACVC,SAAU;IACVC,UAAU;IACVC,UAAAA;IACAC,UAAAA;IACF,WAAA;IAEA,WAAWC;;aAEP,QAAK,KAAA,OAAA;iBAAc,MAAA;;iBAIbC,MAAOL,YAAW,KAAIM,MAAAA,SAAAA,SAAAA,GAAAA;AACxB,cAAA,CAAA,OAAA,UAAA;AACA,mBAAWC,WAAWH,oBAAAA,IAAKI;;AAE3B,qBAAA,WAAA,KAAA,MAAA,UAAA;AACF,mBAAA,SAAA,IAAA,OAAA;UAEA;QACA;YAEE,KAAA,MAAMC,UAAAA,KAAkB,MAAIH,OAAAA,SAAAA,KAAAA,CAAAA,KAAAA,MAAAA,qBAAAA;AAC5B,cAAA,cAAMI;AACN,gBAAK,kBAAMC,oBAAeP,IAAKI;gBAC7B,kBAAI,oBAAA,IAAA;qBACF,eAAiBI,KAAIC,MAAMF,QAAAA;gBAC3B;oBACEF,WAAAA,IAAgBK,MAAIC,WAASC,EAAO,WAAA;kBACpCN,UAAAA;AACF,gCAAA,IAAA,SAAA,OAAA;AACA,gCAAM,IAAA,SAAA,OAAA;cACNO;YACF,QAAA;AACF,4BAAA;YAEI;;4BAEOhB;gBACP,gBAAWiB,OAAMT,GAAAA;qBACfJ,aAAgBS,oBAAII,IAAAA;AACtB,yBAAA,MAAA,iBAAA;AACF,uBAAA,SAAA,IAAA,EAAA;cACIR;;gBAEF,gBAAWQ,OAAMR,GAAAA;qBACf,aAAA,oBAAA,IAAA;yBACOV,MAAAA,iBAAakB;AAExB,uBAAA,SAAA,IAAA,EAAA;cACF;YACA;UACF;QAGA;qBACuB,SAAA,MAAA;;gBAGjBb,KAAAA,SAAOc,UAAW;AAElB,qBAAKd,WAAOH;;AAEZ,kBAAA,CAAA,OAAA,WAAA;AACA,uBAAWkB,YAAYhB,oBAAAA,IAAKiB;;AAE5B,yBAAA,YAAA,KAAA,SAAA,UAAA;AACF,uBAAA,UAAA,IAAA,QAAA;cACA;YACF;AACK;UAAc;;AAGjB,gBAAA,CAAA,OAAA,WAAA;AACA,qBAAWH,YAAWG,oBAAAA,IAASlB;;AAE/B,uBAAA,MAAA,KAAA,SAAA,WAAA;AACA,qBAAA,UAAA,IAAA,EAAA;YACF;AACK;UAAgB;;AAGrB,mBAAA,WAAA;AACA;UAEE;UACJ;AACA;QACF;AACK;MAAc;;AAIjB,YAAA,KAAA,OAAA,SAAA,YAAA;AACA,iBAAA,WAAA;QACF;AACK;MACL;MACA,KAAK;WACHE;WACA;AACF,eAAA,WAAA;AAEE;MACJ;AACF;IAEA;EACF;AAEA,SAAMiB;;kBAC4EC,CAAAA,GAAAA,MAAAA;QAAGC,CAAAA,SAAAA,MAAAA,IAAAA,EAAAA,QAAAA,EAAAA,OAAAA;IAAK;IAACA;MAAGD;IAAE;IAC9F;;aAEI,QAAO,SAAA;AACT,QAAA,OAAA,IAAA,IAAA,GAAA;AACF,aAAA;IACA;EACF;AAEA,SAAME;AAGN;;AAYmBC,IAA+D,gBAA/DA,MAA+D,uBAAAC,UAAA;EAC/DC;EACAC;EACjB;;;;;EAKA;EACiBC;;EAGjB;EACQC;EACAC;EAER,SAAA,eAA2C,UAAA;mBACpC,CAAA;cAEAC,SAAAA;AACL,UAAKP;AACL,SAAKE,eAAc,QAAGM;AACtB,SAAKL,WAAAA,QAAkB;AAEvB,SAAKM,iBAAcC,QAAO;AAC1B,SAAKC,qBAAiBC,QAAK;AAC3B,SAAKR,MAAAA,QAAcI;AAEnB,SAAA,SAAMK,QAAe;AACrB,SAAKC,cAAQD,QAAaE;AAC1B,UAAK,eAAU3C,IAAAA,aAAmB0C;AACpC,SAAA,QAAA,aAAA,WAAA,KAAA,MAAA;AAEIJ,SAAAA,UAAkB,cAAA,KAAA,KAAA;;EAEtB,IAAA,UAAA;AAEIE,WAAAA,KAAwB;;EAE5B,IAAA,QAAA;AAEIvC,WAAuB,KAAA;;EAE3B,IAAA,OAAA;AAEIlB,WAAAA,KAAwB;;EAE5B,IAAA,QAAA;AAEA6D,WAAAA,KAA4B;;eAGtBxB;gBACAyB,eAAiBA,IAAAA,CAAAA,UAAcC;MAC/B5B,IAAAA,KAAS3D;MACTwF,YAAAA,KAAgBxF,cAAKwF;MACrBtC,SAASlD,KAAKkD,WAAO;MAErBuC,gBAAe,KAAA,kBAAA;MAEfC,SAAAA,KAAc1F;MAChB,MAAA,KAAA;MAEJ,cAAA,KAAA,MAAA,KAAA,UAAA,KAAA,GAAA,IAAA,KAAA,OAAA,KAAA,UAAA,KAAA,IAAA,IAAA;IAEA,EAAA;;;;;;;;;cASI,MAAO;AACT,QAAA,CAAA,KAAA,QAAA,UAAA;AACA,aACEoE;IAKJ;AAEA,WAAMuB,wBAA2C,KAAA,UAAA,KAAA,QAAA,QAAA,KAAA,wBAAA,KAAA,UAAA,KAAA,QAAA,QAAA,KAAA,wBAAA,KAAA,WAAA,KAAA,QAAA,SAAA,KAAA,wBAAA,KAAA,WAAA,KAAA,QAAA,SAAA;;QAG/CC,YAAI;gBACFb,KAAS,oBAAQc,gBAAA,MAAA,QAAA,EAAA,YAAA,YAAA,GAAAhG,gBAAA,GAAA,KAAA,GAAA,MAAA,GAAA,CAAA,gDAAA,EAAA,EAAA,CAAA;UACjBoF,cAAaa;MACf,SAAA,KAAA;MAEA,OAAMC,OAAAA,OAAgBC,OAAKrB,QAAAA,KAAc,MAAA,CAAA;IACzC,GAAA,EAAA,YAAQsB,YAAiB,GAAEpG,gBAAa,GAACqG,KAAAA,GAAAA,KAAU,CAAA;AACnD,UAAKvB,gBAAiBsB,KAAAA;AACtBzE,UAAMZ,EAAAA,YAAO,OAAAY,OAAA,IAAA,MAAA,KAAA,UAAA,KAAA,OAAA,CAAA,CAAA;AACbA,SAAAA,iBAAqB2E;WAAYtC,OAASiB;WAAKG,UAAOe,KAAMF,UAAaM;MAAsB,IAAA,KAAA;MAC3F,OAAOJ,OAAGxE,OAAAA,OAAAA,QAAAA,KAAAA,MAAAA,CAAAA;IAEd,CAAA;AAWA,SAAA,SAAAA;AACA,UAAA,UAAA,cAAA,WAAA,WAAkD,UAAA,cAAA,KAAA,CAAA,MAAA,UAAA,WAAA,KAAA,EAAA,aAAA,KAAA,YAAA,WAAA,KAAA,EAAA,YAAA,KAAA,WAAA,WAAA,KAAA,EAAA,eAAA,KAAA,cAAA,WAAA,KAAA,EAAA,YAAA,KAAA,WAAA,WAAA,KAAA,EAAA,mBAAA,KAAA,cAAA;QAIhD6E,uBAAYC;AAGd,cAAO,IAAA,eAAA,OAAA9E,MAAA,CAAA;;AAEP,WAAA;MACF;IAEA;;QAEE,UAAWuB,MAAAA,YAAoB;UAC7BvB,SAAS+E,eAAe,UAAA;eACtB,QAAUC,KAAAA,OAAAA;AACZ,UAAA,KAAA,KAAA,UAAA;AAEA,cAAMC,IAAAA,qBAA6B;MACnCR;AACAzE,YAAMF,SAASoF,MAAKD,KAAAA,UAAY,MAAA,UAAA;AAClC,mBAAA,OAAA;AACAjF,MAAAA,OAAMV,SAAW,KAAGmF,OAAWU,KAAAA;IAC/BL;AACA,IAAA9E,OAAA,cAAO,WAAA;mBAAEyE,QAAAA,MAAAA;WAAYzE;MAAM;MAC7B,OAAAA;IAEA;;kBAEW,MAAA,YAAA;aAAEyE,KAAAA,UAAAA;aAAYzE;QAAkC;QACzD,OAAA,eAAA,UAAA;MACIoF;IAEJ;AACA,QAAA,eAAiBpF;UACf,QAAK,YAAA,IAAA;iBACHoF,MAAAA;WACApF;AACA,wBAAA,CAAA;AACF,QAAAA,SAAK,eAAA,UAAA;AACF;WACD;AACF,SAAK,EAAA,YAAA,eAAA,OAAAA,OAAA,IAAA,MAAA,KAAA,gBAAA,MAAA,UAAA;AACF;WACD;AACF,SAAK,EAAA,YAAA,eAAA,OAAAA,OAAA,IAAA,MAAA,KAAA,gBAAA,MAAA,UAAA;AACF;WACD;AACF,SAAK,EAAA,YAAA,eAAA,OAAAA,OAAA,IAAA,MAAA,KAAA,uBAAA,MAAA,UAAA;AACF;WACD;AACF,SAAK,EAAA,YAAA,eAAA,OAAAA,OAAA,IAAA,MAAA,KAAA,eAAA,MAAA,UAAA;AACF;WACD;AACF,SAAK,EAAA,YAAA,eAAA,OAAAA,OAAA,IAAA,MAAA,KAAA,uBAAA,MAAA,UAAA;AACF;WACD;AACF,SAAK,EAAA,YAAA,eAAA,OAAAA,OAAA,IAAA,MAAA,KAAA,kBAAA,MAAA,UAAA;AACF;WACD;AACF,SAAK,EAAA,YAAA,eAAA,OAAAA,OAAA,IAAA,MAAA,KAAA,eAAA,MAAA,UAAA;AACF;WACD;AACF,SAAA,EAAA,YAAA,eAAA,OAAAA,OAAA,IAAA,MAAA,KAAA,eAAA,MAAA,UAAA;AACE;MACJ;AACMP,cAAO,IAAG4F,MAAAA,sBAAAA,KAAAA,IAAAA,EAAAA;IAChBP;AAEA,IAAA9E,OAAA,UAAO;mBAAEyE,QAAYW,MAAAA;WAAepF;MAAM,YAAA;MAC5C,OAAAA;IAEA;;wBACmByE,MAAAA,YAAAA;iBAAW;MAE5B,GAAMa;IACN;AACA,UAAMC,SAAAA,KAAAA,MAAAA,YAAgC,CAACA;AAEvC,UAAMvF,SAAwB,KAAA,MAAA,UAAA,CAAA;UAC5B,sBAAkBwF,KAAW,MAAA,uBAAA;UAC7BpG,SAAM;MACNC,GAAAA,eAAcsF,UAAUpD;MACxB9B,MAAAA;MACF,SAAA,KAAA,UAAA,KAAA,QAAA;MAEA,SAAa+C,YAAa,IAAA;;iBACC,SAAA,MAAA;;AAGvB,cAAMiD,kBAAkB,YAACC,IAAAA;AACzB1F,cAAMR,WAAS,gBAAe,MAAA;AAC9BQ,cAAML,QAAAA,MAAc,KAAIgG,sBAAoBC,QAAAA,qBAAAA,QAAAA;AAE5C,QAAA5F,OAAI,YAAU6F,MAAU;eACtB,kBAAO,YAAA,IAAA,IAAA;iBAAEpB,KAAAA,UAAAA;iBAAYzE;YAAM;YAC7B,OAAAA;UAEA;QACA;AACAA,cAAMT,oBAAmBuG,YAAQX,IAAM;AACvCnF,cAAMJ,UAAAA,MAAgB,KAAI+F,4BAAoBI,KAAAA;AAE9CtB,QAAAA,OAAAA,mBAAmBqB,QAAc;AACjC9F,QAAAA,OAAMV,oBAAcmF,YAAiB,IAAA,IAAA;AAErC,mBAAA,KAAA,GAAA,QAAA,OAAAuB,cAAA,CAAA;AACF,QAAAhG,OAAA,cAAA,WAAA;AAEK;MAAc;;cAKb,YAAWmF,YAAY,IAAA;sBACf,MAAEzD,QAAYK,IAAIC,KAAK,SAAQ,UAAIiE,IAAU,CAAA,OAAA;cACnD,OAAO,SAAKC,GAAAA;kBAA0C7D,EAAAA,QAAAA,IAAAA,IAAAA,MAAAA,OAAAA,CAAAA,CAAAA,EAAAA,WAAAA;mBAAM,KAAA,aAAA,IAAA,MAAA,OAAA,CAAA,CAAA,EAAA,OAAA;cAAE8D;YAAuB,CAAA,GAAA;cAChF,eAAWhB;YAChB,CAAA;qBAAsDgB,OAAAA,SAAeb,GAAO;AAAG,mBAAA,KAAA,aAAA,IAAA,kBAAA,EAAA,GAAA;cAC1E,eAAA,OAAA,CAAA;YACL,CAAA;UACF,OAAA;AACF,mBAAA;UAEFtF;QAEAyE,CAAAA,CAAAA;AACAzE,QAAAA,OAAMV,oBAAcmF,YAAiB,IAAA,IAAA;AACrC,mBAAA,KAAA,GAAA,MAAA,OAAAuB,cAAA,CAAA;AACF,QAAAhG,OAAA,cAAA,WAAA;AAEK;MAAgB;;AAGnB,cAAMyF,kBAAkB,YAACW,IAAAA;AAOzBpG,cAAMR,WAAS,gBAAe,MAAA;AAC9BQ,cAAML,QAAAA,MAAc,KAAIgG,wBAAoBC,QAAAA,KAAAA,SAAAA,UAAAA,KAAAA,SAAAA,UAAAA,qBAAAA,QAAAA;AAE5C,QAAA5F,OAAI,YAAU6F,MAAU;eACtB,kBAAO,YAAA,IAAA,IAAA;iBAAEpB,KAAAA,UAAAA;iBAAYzE;YAAM;YAC7B,OAAAA;UAEA;QACA;AACAA,cAAMT,oBAAmBuG,YAAQX,IAAM;AACvCnF,cAAMJ,UAAAA,MAAgB,KAAI+F,4BAAoBI,KAAAA;AAE9CtB,QAAAA,OAAAA,mBAAmBqB,QAAc;AACjC9F,QAAAA,OAAMV,oBAAcmF,YAAiB,IAAA,IAAA;AAErC,mBAAA,KAAA,GAAA,QAAA,OAAAuB,cAAA,CAAA;AACF,QAAAhG,OAAA,cAAA,WAAA;AAEK;MAAqB;;AAGxB,cAAMyF,kBAAkB,YAACY,IACvB;cACElF,WAAUmE,gBAAAA,MAAAA;cACVgB,QAAAA,MAAc/E,KAAKiB,cAAS8D,KAAY,aAAA,iBAAA;UACxCC,UAAAA;UACAC,cAAcjF,KAAKiB,SAASgE;UAC5BC,eAAelF,KAAKiB,SAASiE;UAC7BC,cAAAA,KAAkBnB,SAAAA;UAClBnE,eAAAA,KAAAA,SAAAA;UACF,kBAAA;UAEFpB;QACAA,CAAAA,CAAAA;AAEA,QAAAA,OAAI,YAAU6F,MAAU;eACtB,kBAAO,YAAA,IAAA,IAAA;iBAAEpB,KAAAA,UAAAA;iBAAYzE;YAAM;YAC7B,OAAAA;UAEA;QACA;AACAA,cAAMT,oBAAmBuG,YAAQX,IAAM;AACvCnF,cAAMJ,UAAAA,MAAgB,KAAI+F,4BAAoBI,KAAAA;AAE9CtB,QAAAA,OAAAA,mBAAmBqB,QAAc;AACjC9F,QAAAA,OAAMV,oBAAcmF,YAAiB,IAAA,IAAA;AAErC,mBAAA,KAAA,GAAA,QAAA,OAAAuB,cAAA,CAAA;AACF,QAAAhG,OAAA,cAAA,WAAA;AAEK;MAAgB;;YAKjBoE,KAAIuC,SAAK,eAAA,UAAA;AAEX,UAAAvC,MAAA,KAAA,kCAAA,QAAA,EAAA,YAAA,YAAA,GAAA/F,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AAEA;QACA;AAEA,cAAM+C,kBAAWwF,YAAgBC,IAAAA;AACjC,QAAAC,YAAMC,OAAAA,UAAoB,GAAI,0DACA,EAAA,YAAA,YAAA,GAAA1I,gBAAA,GAAA,KAAA,GAAA,MAAA,GAAA,CAAA,sBAAA,0DAAA,EAAA,CAAA;cAC1BoF,WAAYjB,gBAAa,MAAA;cACzBd,cAAS4D,MAAAA,KAAAA,cAAAA,KAAAA,aAAAA,UAAAA;UACToB,OAAAA,KAAAA,SAAkBnB;UAClBnE,SAAAA;UACF,kBAAA;UAEFpB;QACAA,CAAAA,CAAAA;AAEA,QAAAA,OAAI,YAAU6F,YAAU;eACtB,kBAAO,YAAA,IAAA,IAAA;iBAAEpB,KAAAA,UAAAA;iBAAYzE;YAAM;YAC7B,OAAAA;UAEA;QACA;AAGA,cAAMgH,oBAAeD,YAAYE,IAAQC;AAGzC,cAAA,eAAA,YAAA,OAAA,CAAA,MAAA,EAAA,OAAA;AACA,cAAMC,eAAcC,YAAIL,OAAgB,CAACG,MAAM,CAAA,EAAA,OAAA;wBAAmB,IAAA,IAAA,YAAA,IAAA,CAAA,MAAA;UAAC,EAAA;UAEnE,EAAA;QACIG,CAAAA,CAAAA;YAEF,aAAMC,CAAAA;YAGN,aAAMC,SAAc,GAAIH;4BAAoC,MAAA,KAAA,cAAA,KAAA,aAAA,mBAAA,aAAA,IAAA,CAAA,MAAA,EAAA,QAAA,CAAA,CAAA;8BAAY,IAAA,IAAA,UAAA,IAAA,CAAA,MAAA;YAAC,EAAA;YACzEC,EAAAA;UAEI,CAAA,CAAA;uBACKG,aAAY,IAAOA,CAAAA,WAAAA;kBACtB,WAAO,YAAA,IAAA,OAAA,QAAA;AACT,gBAAA,CAAA,YAAA,OAAA,aAAA,UAAA;AACA,qBAAO;;mBAEL9F;cACAS,UAAS8C,OAAO9C;cAChB6B,SAAAA,OAAgBiB;cAChBnB,SAAAA,OAAY;cACZ2D,gBAAK,OAAA,kBAAA;cACL7I,YAAM4I;cACNvD,KAAAA;cACF,MAAA;cAEDgD,MAAOjB,QAAAA,IAAAA,OAAAA,QAAAA,KAAAA;YACZ;UAEA,CAAA,EAAA,OAAAA,cAAA;QACA;cAGI,aAAa,MAAM,QAAKE,IAAAA,aAAkB,IAAA,OAAA,WAAA;gBAAEC,MAAAA,IAAAA,kBAA6B,OAAA,QAAA;AAAY,gBAAA,OAAA,MAAA,KAAA,aAAA,KAAA;YACjF3H,eAAM,OAAA;;cAERA,MAAKyF;AAEP,iBAAOzF,OAAAA,QAAAA,IAAAA,OAAAA,QAAAA,KAAAA;UACT;AAGF,iBAAMkJ;;sBAA2BC;UAAiC,GAAA;UAClE3H,GAAMT,WAAAA,OAAmBmI,cAAY;QACrC1H;AAEAyE,QAAAA,OAAAA,mBACWwC,MAAM;eACb,oBAAoBzI,YAAY,IAAG,IAAA;mBACjC,KAAO,GAAA,MAAA,OAAA,CAAA,SAAA;AACT,cAAA,OAAA,SAAA,KAAA,OAAA,GAAA;AACIA,mBAAK2D;;mBAEL,SAAQA;mBACR,OAAOA,KAAAA,CAAAA,QAAY3D;AACrB,oBAAA,EAAA,SAAA,QAAA,IAAA,IAAA,MAAA,GAAA,EAAA,WAAA;AACF,qBAAA,YAAA,KAAA,WAAA,YAAA,KAAA;YACA,CAAA;UACF;AAEFwB,iBAAMV;QACN,CAAA,CAAA;AACF,QAAAU,OAAA,cAAA,WAAA;AAEA;MACE;MACJ;AAEA,cAAA,IAAA,MAAA,0BAA+C,KAAA,SAAA,IAAA,EAAA;IAC/C;QAEEA,KAAAA,UAAMV,UAAcmF,WAAiB,SAAA,KAAA,OAAA;AACvC,mBAAA,WAAA,MAAA,GAAA,KAAA,KAAA;AAEA,MAAAzE,OAAO,cAAA,WAAA;;WAAcA;MAAM;MAC7B,OAAAA;IAEA;;wBAEgB4H,MAAAA,YAAAA;AACd,QAAA,KAAA,OAAA,SAAA,YAAA;AAEA,aAAMC,KAAAA,uBAAkBC,KAAAA,QAA4Bb,UAAM;IAC1D;UACE,kBAAYc,uBAA+BtD,KAAAA,MAAAA;AAC7C,QAAA,oBAAA,MAAA;AAEIuD,aAAAA,KAAAA,yBAAmC,MAAG,YAAA,eAAA;;gCAGpC,KAAA,MAAA,GAAA;YACFC,IAAAA,WAAU;QACZ,SAAA;QACF,SAAA,CAAA;MAEA,CAAA;;mBAEWC,WAAAA,OAAkB3G,CAAAA,SAAK0F;eAC5B5E,KAAI7D;eACJkD,kBAAqB,KAAA,QAAA;UACrB+F,IAAAA,KAAKjJ;UACP,SAAA,KAAA;UACK,KAAIA,KAAKI;QACd,CAAA;MACF,WAAO,KAAA,MAAA;AACL,eAAO,sBAAA,KAAA,QAAA,KAAA,IAAA;MACT,OAAA;AACF,eAAA;MAEA;;WAEEoB;kBACK8E;aACH1F;QACAC,GAAAA,eAAcsF,UAAUpD;QACxBjC,MAAAA;QACF,SAAA,KAAA,UAAA,KAAA,MAAA;QACF,aAAA,OAAA;MACF;IAEA;;iCAKwCuB,MAAKrC,YAAckD,QAASuF;UAAuB,SAAA;MACzF,GAAMxB,IAAAA,IAAQ,WAAWY,IAAAA,CAAAA,SAAa,KAChC,OAACjD,EAAAA,OAAa+E,cAAAA,CAAgB;;UAEhC,QAAS,MAAA,KAAA,cAAA,KAAA,aAAA,iBAAA;MACTzB,UAAAA;MACAtF,GAAAA;MACF,kBAAA;MAEF,UAAMgH,CAAAA;IACN,CAAA,CAAA;AACA,UAAA,cAAO,IAAA,IAAA,MAAA,IAAA,CAAA,MAAA,EAAA,QAAA,CAAA;UACL3D,SAAAA,WAAYQ,OAAAA,CAAAA,SAAAA,YAAAA,IAAAA,KAAAA,QAAAA,CAAAA;WACZjF;kBACK8E;aACH1F;QACAC,GAAAA,eAAcsF,UAAU0D;QACxB/I,MAAAA;QACF,SAAA,KAAA,UAAA,MAAA;QACF,aAAA,OAAA;MACF;IAEA;;QAME,uBAAqBmF,MAAAA,YAAgBjG;AACrC,UAAM8J,WAAW,KACf7D,SAAW5D;UACT,eAAiB0H,WAAQ,IAAA,CAAA,SAAA,UAAA,UAAA,IAAA,CAAA;kBACvB,IAAA,WAAA,IAAA,OAAA,MAAA,UAAA;AACF,UAAA,aAAA,KAAA,GAAA;AACAC;MACF;AAGF,mBAAe/D,KAAAA,MAAWwC,MAAQzI,KAAAA,4BAAmC,MAAKiK,8BAAAA;IAE1E,CAAA,CAAA;AACA,UAAA,SAAO,WAAA,OAAA,CAAA,MAAA,UAAA,aAAA,KAAA,MAAA,QAAA;WAELzI;kBACK8E;aACH1F;QACAC,GAAAA,eAAkB,UAAA;QAClBC,MAAAA;QACF,SAAA,KAAA;QACF,aAAA,OAAA;MACF;IAEA;;QAKE,uBAAWoJ,SAAgBzB,YAAgB;UACzC,kBAAgBjF,oBAAM0G,IAAAA;eAChBC,gBAAcC,QAAS,SAAA;AAC7B,YAAID,MAAAA,IAAS,MAAA,YAAA;YACXE,UAAAA,IAAgB5G,UAAI0G;AACtB,UAAA,SAAA;AACF,wBAAA,IAAA,QAAA,MAAA;MACA;IAEA;AAGA,UAAM1D,WAASR,QAAAA,aAAmBqE,iCAA+B;AAEjE,UAAA,UAAO,MAAA,QAAA,IAAA,WAAA,IAAA,OAAA,SAAA,KAAA,cAAA,MAAA,iBAAA,QAAA,CAAA,CAAA;UACLrE,SAAAA,WAAYQ,OAAAA,CAAAA,OAAAA,UAAAA,QAAAA,KAAAA,CAAAA;WACZjF;kBACK8E;aACH1F;QACAC,GAAAA,eAAcsF,UAAU;cAAEoE;iBAAyBC,KAAAA,UAAmBA;UAAW,SAAA/B,QAAA;UACjF3H,YAAa2F,QAAOE;QACtB,CAAA;QACF,aAAA,OAAA;MACF;IAEA;;;;;;QAMI,cAAO,MAAA,iBAAA,gBAAA;AACT,QAAA,kBAAA,GAAA;AAEA,aAAM8D;IAEN;AACA,UAAIC,aAAc,CAAA;UAChB,eAAgBnH,UAAUmH,UAAAA,IAAcN;QACxC,cAAa;YACXK,UAAW/D,IAAK,MAAA,YAAA,EAAA,UAAA;mBAAEiE;mBAAsBC,KAAUT;UAAe,QAAA;UACnE,UAAA,QAAA;QACF,CAAA;MAEInK;;aAEA2K,WAAYE,CAAAA,cAAAA;iBACZD,KAAU5K;QACZ,QAAA,IAAA,qBAAA,KAAA,SAAA,KAAA,OAAA,EAAA,SAAA;QACF,UAAA,KAAA;MAEA,CAAK;;eAED,OAAO,YAAA;AACT,UAAA,gBAAA,IAAA,IAAA,QAAA,GAAA;AACF,eAAA;MAEA;;eACsE2H,OAAAA,YAAoBzE;AAAQ,YAAA,aAAA,MAAA,KAAA,aAAA,IAAA,MAAA,IAAA,MAAA,GAAA;QAC5F4H,eAAe,KAAM;;AAEzB,UAAA,cAAA,MAAA,KAAA,cAAA,YAAA,iBAAA,iBAAA,CAAA,GAAA;AACF,eAAA;MAEA;IACF;AAEA,WAAA;EACA;;0BAEOxE,MAAeU,YAAW;UAC7BpG,SAAM;MACNC,GAAAA,eAAcsF,UAAUpD;MAC1B,MAAA;MAEA,SAAM6D,KAAAA,UAA+B,KAAA,SAAA;IAErC;UACE,gBAAK,CAAA;iBAAsB,UAAA,MAAA;;qBAEN,UAAA,WAAA;;AAIf,YAAA0B,YAAMyC,KAAO9E,UACV+E,aAAShL,MAAAA,oDAAAA,EAAAA,YAAAA,YAAAA,GAAAA,gBAAAA,GAAAA,KAAAA,GAAAA,MAAAA,GAAAA,CAAAA,oCAAAA,oDAAAA,EAAAA,CAAAA;kBACR,WAAYF,gBAAUI,SAAYF,KAAMK,UAAAA,QAAAA;kBACxC,OAAM0K,WAAaE,QAAQC,CAAAA,SAAOA;oBAAOA,MAAAA,UAAAA,YAAAA,MAAAA,QAAAA;oBAAIH,QAAA,MAAA,QAAA,GAAA,IAAA,MAAA;gBAC7C;;2BAEI,IAAOI,CAAAA,SAAAA;;yBAGDjI,mBAAqBgI,IAAA,IAAA;oBAEvB,KAAA,IAAA,MAAAA,KAAA,GAAA,CAAA;oBACJ,SAAM,KAAA;kBACNtF,IAAIuC;wBAA4B+C;AAAc,kBAAAtF,MAAA,KAAA,qBAAA;oBAC9C,KAAOsF,KAAA,GAAA;kBACT,GAAA,EAAA,YAAA,YAAA,GAAArL,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AACF,yBAAA;gBAED4I;cAEH,CAAA;YACA,CAAA,EAAA,OAAMS,cAAcY;8BACsCnC,YAAezE,IAAAA;kBAAQ,QAAA,MAAA,QAAA,IAAA,KAAA,IAAA,CAAA,EAAA,KAAA,QAAA,MAAA,KAAA,aAAA,KAAA;cAE3E9B,eAAgB;YAEtBwF,CAAAA,CAAAA,CAAAA;AACApF,YAAAA,OAAMV,oBAAc8F,YAAcD,IAAM,IAAA;AAExC,0BAAA,KAAA,GAAA,MAAA,OAAAa,cAAA,CAAA;AACF,YAAAhG,OAAA,cAAA,cAAA;AACK;UAAY;;AAGfA,kBAAMR,kBAAaiG,YAAY,IAAA;AAC/BzF,kBAAML,QAAAA,MAAc,KAAIgG,qCAAoBC,YAAAA,KAAAA,UAAAA,QAAAA;AAE5C,YAAA5F,OAAM+F,aAAAA,MAAAA;AACN,YAAA/F,OAAM8F,kBAAgB,YAAK8D,IAAAA,IAAAA;AAC3B5J,kBAAMT,oBAAmBuG,YAAQX,IAAM;AACvCnF,kBAAMJ,UAAAA,MAAgB,KAAI+F,4BAAoBI,KAAAA;AAE9CX,YAAAA,OAAAA,mBAAsBU,QAAQmB;AAC9BjH,YAAAA,OAAMV,oBAAc8F,YAAcD,IAAM,IAAA;AAExC,0BAAA,KAAA,GAAA,QAAA,OAAAa,cAAA,CAAA;AACF,YAAAhG,OAAA,cAAA,cAAA;AACF;UACA;QACF;AACK;MAAqB;;gBAGtB,KAAK,UAAA,WAAA;eAAsB;;kBAOrB,OAAK6J,WAAK,IAAA,CAAA,SAAA;oBACR,MAAO,KAAA,UAAA,cAAA,uBAAA,UAAA,kBAAA,IAAA,IAAA,UAAA,kBAAA,IAAA;AACT,kBAAA,CAAA,KAAA;AACI,uBAAA;;;uBAGAnI;kBACF,KAAA,IAAA,MAAA,GAAA;kBACA,SAAM,KAAA;gBACN0C;sBAAgCsF;AAAS,gBAAAtF,MAAA,KAAA,qBAAA;kBACzC,KAAO;gBACT,GAAA,EAAA,YAAA,YAAA,GAAA/F,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AAED4I,uBAAOjB;cAEV;YACA,CAAA,EAAA,OAAM0B,cAAcY;8BACsCnC,YAAezE,IAAAA;kBAAQ,QAAA,MAAA,QAAA,IAAA,KAAA,IAAA,CAAA,EAAA,KAAA,QAAA,MAAA,KAAA,aAAA,KAAA;cAE3E9B,eAAgB;YAEtBwF,CAAAA,CAAAA,CAAAA;AACApF,YAAAA,OAAMV,oBAAc8F,YAAcD,IAAM,IAAA;AAExC,0BAAA,KAAA,GAAA,MAAA,OAAAa,cAAA,CAAA;AACF,YAAAhG,OAAA,cAAA,cAAA;AAEK;UACL;eAA2B;;AAMzBA,kBAAMR,kBAAaiG,YAAY,IAAA;AAC/BzF,kBAAML,QAAAA,MAAc,KAAIgG,4BAAoBC,YAAAA,KAAAA,UAAAA,cAAAA,uBAAAA,WAAAA,QAAAA;AAE5C,YAAA5F,OAAM+F,aAAAA,MAAAA;AACN,YAAA/F,OAAM8F,kBAAgB,YAAK8D,IAAAA,IAAAA;AAC3B5J,kBAAMT,oBAAmBuG,YAAQX,IAAM;AACvCnF,kBAAMJ,UAAAA,MAAgB,KAAI+F,4BAAoBI,KAAAA;AAE9CX,YAAAA,OAAAA,mBAAsBU,QAAQmB;AAC9BjH,YAAAA,OAAMV,oBAAc8F,YAAcD,IAAM,IAAA;AAExC,0BAAA,KAAA,GAAA,QAAA,OAAAa,cAAA,CAAA;AACF,YAAAhG,OAAA,cAAA,cAAA;AACF;UACA;QACF;AACK;MAAsB;;qBAEL,UAAA,WAAA;;yBAKV,WAAa,IAAA,CAAA,SAAA;AACf,kBAAA,CAAA,KAAA,KAAA;AACA,uBAAM0J;cACN;oBACE,MAAO,gBAAA,UAAA,KAAA,GAAA;AACT,kBAAA,CAAA,iBAAA,mBAAA,GAAA,GAAA;AACI,uBAAA;;;uBAGAhI;kBACF,KAAA,IAAA,MAAA,IAAA,GAAA,CAAA;kBACA,SAAM,KAAA;gBACN0C;sBAAuCsF;AAAc,gBAAAtF,MAAA,KAAA,4BAAA;kBACrD,KAAO,IAAA,GAAA;gBACT,GAAA,EAAA,YAAA,YAAA,GAAA/F,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AAED4I,uBAAOjB;cAEV;YACA,CAAA,EAAA,OAAM0B,cAAcY;8BACsCnC,YAAezE,IAAAA;kBAAQ,QAAA,MAAA,QAAA,IAAA,KAAA,IAAA,CAAA,EAAA,KAAA,QAAA,MAAA,KAAA,aAAA,KAAA;cAE3E9B,eAAgB;YAEtBwF,CAAAA,CAAAA,CAAAA;AACApF,YAAAA,OAAMV,oBAAc8F,YAAcD,IAAM,IAAA;AACxC,0BAAA,KAAA,GAAA,MAAA,OAAAa,cAAA,CAAA;AACF,YAAAhG,OAAA,cAAA,cAAA;AAEK;UAAe;;kBAOhB,UAAM8J,oBAAAA,IAAWC;uBACbD,QAAU,YAAA;oBACZA,WAAa,QAAMV,IAAAA,KAAQ,OAAA;AAC7B,kBAAA,UAAO;AACLW,yBAAQC,KAAIxL,KAAKkD,QAAS;;wBAAe,IAAA,KAAA,SAAA;kBAC3C,KAAA;gBACF,CAAA;cAEA;YACA;AACA,kBAAK,kBAAgBuI,YAAcF,IAAAA;kBACjC,WAAMjK,CAAAA;uBAC8B4B,CAAAA,SAAS,SAAA,KAAA,SAAA;+BAACA,MAAAA,KAAAA,cAAAA,KAAAA,aAAAA,cAAAA;yBAAQ;kBAAEuI;gBAAU;gBAElEC;cACF,CAAA,CAAA;AACAlK,uBAAMR,KAAS,GAAI0K,QAAS/E;YAC5BnF;AAEA,YAAAA,OAAM+F,aAAAA,SAAoBJ;AAC1B,YAAA3F,OAAM8F,kBAAgB,YAAK8D,IAAAA,IAAAA;AAC3B5J,kBAAMT,oBAAmBuG,YAAQmB,IAAOjB;AACxChG,kBAAMJ,UAAAA,MAAgB,KAAI+F,4BAAoBI,QAAAA;AAE9CX,YAAAA,OAAAA,mBAAsBU,QAAQmB,OAAOjB,cAAAA,EAAAA;AACrChG,YAAAA,OAAMV,oBAAc8F,YAAcD,IAAM,IAAA;AACxC,0BAAA,KAAA,GAAA,QAAA,OAAAa,cAAA,CAAA;AACF,YAAAhG,OAAA,cAAA,cAAA;AACF;UACA;QACF;AACA;MACE;MACJ;AAEO,cAAA,IAAA,MAAA,2BAAA,KAAA,UAAA,IAAA,EAAA;;WAA6BA;MAAM,YAAA;MAC5C,OAAAA;IAEA;;QAGE,eAAMmK,MAAa,YAAcC;oBAAsD3F,oBAAAA,IAAAA;UAAW,aAAA,MAAA,QAAA,IAAA,KAAA,MAAA,IAAA,CAAA,SAAA,KAAA,UAAA,MAAA;MAE5FzE,GAAAA;IACJ,CAAA,CAAA,CAAG8E;UACH1F,SAAM;MACR,GAAA,eAAA,UAAA;MAEA,MAAA;IACA;eAEI,aAAA,YAAA;iBACA0G,QAAYuE,UAAa7L,YAAKkD;AAEhC1B,gBAAMF,IAASoF,aAAKoF,KAAUtK,SAAK,OAAA,KAAA,UAAA,GAAA,KAAA,QAAA,GAAA,IAAA;MACrC;AAEA,MAAAA,OAAO,SAAA,KAAA,UAAA,KAAA;;;kBAC4B;QACjCA,GAAAA,QAAAA,OAAAA;MACF;MACF,OAAAA;IAEA;;+BAKsBwF,MAAS,YAAE;UAC7BpG,SAAM;MACR,GAAA,eAAA,UAAA;MAEA,MAAMmL;;UAAgE,eAAA,MAAA,KAAA,UAAA,KAAA,QAAA;MACtE,GAAMC;;UAAkE,gBAAA,MAAA,KAAA,UAAA,KAAA,SAAA;MACxExK,GAAMF;IAEN,CAAA;WACE2E,SAAAA,KAAY8F,aAAa9F,OAAWwC,cAAQzI,KAAAA;;kBAEnC+J,aAAW,WAAA,OAAA,CAAA,SAAA;AACpB,cAAA,QAAA,cAAA,WAAA,UAAA,CAAA,MAAA,EAAA,aAAA,KAAA,QAAA;AACAvI,eAAAA,UAAAA;MACF,CAAA;MACF,OAAAA;IAEA;;uBAC6ByE,MAAAA,YAAAA;QAAYgG,mBAAoBC;MAE3D,GAAA;IACA,EAAA,KAAInJ,CAAAA,GAAKoJ,MAAK,KAAK5G,mBAAa6G,GAAAA,GAAAA,KAAiBzF,KAAM,CAAA;AAEvD,QAAA,KAAA,UAAA,UAAA,iBAAA,SAAA,KAAA,OAAA;AAEA,yBAAO,iBAAA,MAAA,GAAA,KAAA,KAAA;;WAELnF;kBACK8E;aACH1F;QACAC,GAAAA,eAAcsF,UAAU;cAAEkG;iBAAmBF,KAAOpJ,UAAU;UAAC,OAAA,KAAA;UAC/DjC,OAAAA,KAAasL;QACf,CAAA;QACF,aAAA,iBAAA;MACF;IAEA;;QAGE,eAAO,MAAA,YAAA;UACLnG,oBAAYqG,WAAAA,MAAAA,GAAAA,KAAAA,KAAAA;WACZ9K;kBACK8E;aACH1F;QACAC,GAAAA,eAAcsF,UAAU;cAAEgG;QAAkB,SAAA,KAAA,UAAA;UAC5CrL,OAAAA,KAAawL;QACf,CAAA;QACF,aAAA,kBAAA;MACF;IAEQJ;;qBAEKvF,GAAM,GAAA,QAAQ;AAEzB,QAAA,OAAW4F,WAAO5F,GAAM;AACtB,aAAO;IACT,WAAA,OAAA,WAAA,GAAA;AAEA,aAAW0F,KAAAA,gBAAiB,GAAA,GAAA,OAAA,CAAA,CAAA;;eAEtBG,SAAAA,QAAkB;YACpB,aAAOA,KAAAA,gBAAAA,GAAAA,GAAAA,KAAAA;AACT,UAAA,eAAA,GAAA;AACF,eAAA;MACA;IACF;AAEQC,WAAAA;;kBAEC,GAAA,GAAA,OAAA;kBACH,MAAS7B;MACX,KAAK;AAAY,eAAA,EAAA,SAAA,cAAA,EAAA,QAAA;;AAGjB,cAAA,aAAA,KAAA,mBAAA,GAAA,GAAA,MAAA,QAAA;AACK,eAAA,MAAA,cAAA,SAAA,CAAA,aAAA;MAAQ;;AAIb,cAAA,aAAA,EAAA,OAAA,EAAA;AACA,eAAA,MAAA,cAAA,SAAA,CAAA,aAAA;MACE;;AAGN,eAAA;IAEQ8B;;qBACmCrM,GAAAA,GAAAA,UAAAA;UAAS,SAAA,UAAA,YAAA,GAAA;MAClD;;UAAkD,SAAA,UAAA,YAAA,GAAA;MAElD;IACA,CAAA;AAEA,QAAA,UAAA,QAAA,UAAA,MAAA;AAEA,aAAA;IACA;AAEA,QAAA,UAAA,MAAA;AAEA,aAAA;IACA;AAEA,QAAA,UAAA,MAAA;AAEA,aAAA;IACA;AAEA,QAAA,OAAA,WAAA,YAAA,OAAA,WAAA,UAAA;AAEA,aAAA,OAAe,cAAA,MAAA;IACf;AAEA,QAAA,OAAA,WAAA,YAAA,OAAA,WAAA,UAAA;AAEA,aAAA,SAAgB;IAChB;AAEA,QAAA,OAAA,WAAA,aAAA,OAAA,WAAA,WAAA;AAEA,aAAA,WAAA,SAAA,IAAA,SAA2C,IAAA;IAC3C;AAGF,WAAcwH,OAAAA,MAAiB8E,EAAsD,cAAc,OAAA,MAAA,CAAA;;QAEjGrE,cAAUsE,QAAAA;AACV,UAAMC,kBAAgBC,KAAAA;AACtB,IAAAxE,YAAO,iBAAiB,4BAA0ByE,EAAAA,YAAeF,YAAAA,GAAAA,gBAAAA,GAAAA,MAAAA,GAAAA,MAAAA,GAAAA,CAAAA,mBAAAA,4BAAAA,EAAAA,CAAAA;AACnE,UAAA,UAAA,MAAA,oBAAA,eAAA;AAEA,WAAc3F,MAAAA,WACZvE,MAAAA,OACAuF,KAAyB,uBAEO,OAAA,CAAA,CAAA;;8BAC6BvF,UAAAA,kBAAAA,UAAAA;WAAUuF,MAAAA,KAAAA,cAAAA,KAAAA,aAAAA,SAAAA;MAAkBtF;MAAS;MACpG;IAEA,CAAA,CAAcgF;;gCAQqBjF,UAAAA,UAAAA,UAAAA,kBAAAA,UAAAA;WAAUqK,MAAAA,KAAAA,cAAAA,KAAAA,aAAAA,WAAAA;MAAUC;MAAU/E;MAAkBtF;MAAS;MAE5F;IAEA,CAAA,CAAcsK;;QAKZ,qCAEIC,YAAgBC,UAAc;uBAAuDA,WAAAA,IAAAA,CAAAA,SAAAA,IAAAA,kBAAAA,KAAAA,QAAAA,EAAAA,SAAAA,CAAAA;UAAU,QAEjGC,MAAI,QAAA,IAAA,WAAA,IAAA,CAAA,cAAA,KAAA,cAAA,KAAA,aAAA,gBAAA;MAEAC;IAEF,CAAA,CAAA,CAAA,CAAIjN,GAAAA,KAAAA;sBACK,KAAA,OAAA,CAAA,QAAA;AACT,UAAA,aAAA,MAAA;AAEA,eAAMkN;MACN;AACA,YAAA,YAAOC,gBAAcC,SAAAA,QAA8BC;AAEpDrL,YAAKsL,UAAYC,gBAAQ,SAAA,IAAA,QAAA;AAE5B,aAAMC,eAAkBC,8BAA2BR,SAAAA,SAAAA;IACnD,CAAA,EAAA,IAAO,CAAA,QAAM,IAAKzF,QAAAA;AACpB,UAAA,kBAAA,MAAA,KAAA,IAAA,IAAA,SAAA,CAAA;AAEA,WAAA,MAAA,KAAA,cAAA,KAAA,aAAA,kBAAA,eAAA,CAAA;;;;;;;;;;;;SAaMkG,8BAA0B,SAAA,WAAA;AAC9B,UAAIC,mBAAO,CAAA,YAAiB,WAAA,KAAA,OAAA;AAE5B,QAAA,IAAOD;QACL,IAAIL;eACFK,UAAAA,UAAAA,IAAAA,QAAAA,QAAAA;UACAC,QAAAA,CAAAA,MAAAA,UAAAA,CAAAA,GAAAA;AACA;AACF;AAEA;MACA;UAEE,iBAAA,QAAA,CAAA,CAAA,GAAA;AACF;AAEA;MACF;AAEA,aAAA;IACA;AAEA,QAAA,MAAA,UAAA,QAAA;AAEA,aAAA;IACA;eAEI,QAAO,QAAA,KAAA;AACT,UAAA,CAAA,iBAAA,QAAA,CAAA,CAAA,GAAA;AACF,eAAA;MAEA;IACF;AAEA,WAAcC;;QAKZ,4BAAkBpG,YAAmBjD,UAAasJ;UAAiBC,aAAAA,WAAAA,IAAAA,CAAAA,SAAAA,IAAAA,kBAAAA,KAAAA,QAAAA,EAAAA,SAAAA,CAAAA;WAAUhB,MAAAA,KAAAA,cAAAA,KAAAA,aAAAA,eAAAA;MAAW;MAC1F;IAEA,CAAA,CAAc/B;;QAEZ,4BACEnE,OAAU;UACR,cAAA,MAAA,KAAA,sBAAoC,KAAA;WACpC,MAAS3B,QAAAA,IAAY,MAAA,IAAA,OAAA,SAAA;AAErB,UAAA,KAAA,YAAA;AAEA,eAAA,KAAA,mBAAiC,IAAA;MACjC;AAEA,UAAA,KAAA,SAAA;AAEA,eAAO,KAAA,eAAA,MAAA,WAAA;MACT;AAEJ,aAAA;IAEA,CAAA,CAAc8I;;QAEZ,sBAAqB,OAAQ;UAC3B,aAAWxF,MAAAA,OAAAA,CAAAA,SAAAA,CAAAA,KAAAA,cAAAA,CAAAA,CAAAA,KAAAA,OAAAA;AACb,QAAA,WAAA,WAAA,GAAA;AAEA,aAAME,oBAAAA,IAAY;IAGlB;sBAA+C,MAAA,KAAA,cAAA,KAAA,aAAA,mBAAA,WAAA,IAAA,CAAA,SAAA,KAAA,QAAA,CAAA,CAAA;eAAIE,IAAAA,UAAQ,IAAA,CAAA,MAAA;MAAC,EAAA;MAC9D,EAAA;IAEA,CAAA,CAAA;;;;;;iBAMOA,MAAY,aAAOA;UACtB,WAAO,YAAA,IAAA,KAAA,QAAA;AACT,QAAA,CAAA,YAAA,OAAA,aAAA,UAAA;AAEA,aAAO;;WAEL9F;MACAS,UAAS0K,KAAK1K;MACd6B,SAAAA,KAAAA;MACAF,SAAAA,KAAY;MACZ2D,gBAAK,KAAA,kBAAA;MACL7I,YAAM4I;MACNvD,KAAAA;MACF,MAAA;MACF,MAAA;IAEA;;;;;;;QAOI,mBAAO,MAAA;AACT,QAAA,CAAA,KAAA,YAAA;AACA,aAAM6I;;AAEN,UAAA,SAAA,MAAA,KAAA,eAAA,QAAA,KAAA,MAAA,KAAA,YAAA;MACA,kBAAsB;IACtB,CAAA;UACE,MAAO,OAAA,IAAA;AACT,QAAA,CAAA,KAAA;AACA,aAAMC;IACN;UACE,SAAOC,mBAAA,gBAAA,KAAA,KAAA,QAAA;AACT,QAAA,CAAA,QAAA;AACA,aAAO;;WAELlJ;MACApC,UAASmL,KAAKnL;MACdS,YAAS,KAAA;MACT6B,SAAAA,KAAAA;MACAyD,SAAKsF;MACLnO,gBAAM;MACNqF,KAAAA;MACF,MAAA;MACF,MAAA;IAEA;;qBAEagJ,KAAKC,EAAI,cAAA,GAAA;gBAAE,MAAA;eAClB,KAAMvE;cAEJvE,UAAS,IAAA,UAAA;sBAA2ByF;AAAI,UAAAzF,MAAA,KAAA,yBAAA;YACxC;UACF,GAAA,EAAA,YAAA,YAAA,GAAA/F,gBAAA,GAAA,MAAA,GAAA,KAAA,CAAA;AAEA,iBAAMqD;QAEN;AACA,cAAKyL,UAAW,QAAA,WAAA;cACd/I,YAAS,KAAA,mBAA4B,iBAAA,OAAA;wBAAE1C;AAAQ,UAAA0C,MAAA,KAAA,4BAAA;YAC/C;UACF,GAAA,EAAA,YAAA,YAAA,GAAA/F,gBAAA,GAAA,MAAA,GAAA,KAAA,CAAA;AACA,iBAAM+O;QACN;cACEhJ,cAAS,UAAA,IAAA;0BAA8B1C;AAAQ,UAAA0C,MAAA,KAAA,4BAAA;YAC/C;UACF,GAAA,EAAA,YAAA,YAAA,GAAA/F,gBAAA,GAAA,MAAA,GAAA,KAAA,CAAA;AAEA,iBAAMgP;QACN;cACE,eAAOL,mBAAA,gBAAA,aAAA,QAAA,MAAA;0BACKrE;iBACV7E;YACApC,UAAAA,QAAAA;YACAS,YAAS,UAAA;YACT6B;YACApF,SAAM;YACN6I,gBAAK4F;YACLpJ,MAAM;YACR,KAAA;YACF,MAAA;UAEA;QACA;cACE,OAAO+I,mBAAA,QAAA,aAAA,QAAA,MAAA;AACT,YAAA,CAAA,MAAA;AAEA,iBAAMF;;AAEN,cAAA,SAAA,MAAA,KAAA,eAAA,QAAA,KAAA,MAAA,MAAA;UACA,kBAAsB;QACtB,CAAA;cACE,MAAO,OAAA,IAAA;AACT,YAAA,CAAA,KAAA;AAEA,iBAAMC;QACN;cACE,SAAOC,mBAAA,gBAAA,KAAA,QAAA,MAAA;AACT,YAAA,CAAA,QAAA;AAEA,iBAAO;;eAELlJ;UACApC,UAAAA,QAAAA;UACAS,YAAS,OAAA;UACT6B;UACApF,SAAM;UACN6I,gBAAKsF;UACL9I,MAAM;UACR,KAAA;UACA,MAAA;QACF;AACKlC;MAAgB;eACnB,KAAMG;cAEJkC,WAAS,IAAA,WAAA;yBAAiCyF,CAAAA,SAAAA,UAAAA;AAAI,UAAAzF,MAAA,KAAA,+BAAA;YAC9C;UACF,GAAA,EAAA,YAAA,YAAA,GAAA/F,gBAAA,GAAA,MAAA,GAAA,KAAA,CAAA;AAEA,iBAAQqD;QACR;cAEI0H,EAAAA,SAAAA,SAAAA,SAAAA,IAAAA;cACA1H,OAAAA,MAAAA,KAAAA,cAAAA,KAAAA,aAAAA,iBAAAA;UACAS;UACF;UAEE;;AAEJ,YAAA,CAAA,MAAA;AAEA,iBAAMoF;;cAAqD,cAAA,MAAA,KAAA,sBAAA;UAC3D;QACF,CAAA;AACA,eAAA,KAAA,eAAA,MAAA,WAAA;MAAS;;AACiC,QAAAnD,MAAA,KAAA,yBAAA;UACxC;QACF,GAAA,EAAA,YAAA,YAAA,GAAA/F,gBAAA,GAAA,MAAA,GAAA,KAAA,CAAA;AACF,eAAA;MACF;IAEA;;oCAEwBG,MAAAA,gBAAAA;UACpBF,aAAUU;MACVV,UAAUY,UAAAA,IAAAA;MACV+H,UAAcqG,kBAAMvJ,IAAAA;MAElBwJ,UAAAA,kBAAyB,IAAA;aAC3B,CAAA,MAAO,MAAA,MAAA;AACT,QAAA,WAAA,WAAA,GAAA;AAEA,aAAA;IACA;4BAEyE/O,MAAKkD,QAAO,IAAA,WAAA,IAAA,OAAA,QAAA;AAAC,YAAA,MAAA,MAAA,KAAA,aAAA,IAAA,MAAA,GAAA,GAAA;QAC9E,eAAM,KAAA;;AAEV,UAAA,CAAA,KAAA;AACIpD,eAAAA;;AAEJ,UAAA,UAAA,UAAA,GAAA,GAAA;AACIkP,eAAAA;;AAEJ,UAAA,iBAAA,GAAA;AACA,eAAO,KAAA,4BAAA,KAAA,iBAAA,CAAA;MACT;AAGF,aAAOC;IACT,CAAA,CAAA;AACF,WAAA,gBAAA,KAAA,CAAA,MAAA,CAAA;EAEA;;sBAEW,CAAA,WAAA;AACT,MAAA,OAAA,WAAA,GAAA;AACA,WAAO5G;EACT;AAEA,SAAA,OAAA,IAAA,CAAA,WAAA,IAAA,MAAA,MAAA,EAAA,WAAA,GAAA,OAAA,EAAA,OAAA,OAAA;;IAQI,yBAAe,CAAaI,YAAA;kBACnB,CAAA,MAAA;mBAACyG,aAAAA;aAAE;QACZ;MACIA;;AAEJ,QAAA,EAAA,SAAA,OAAA;AACA,aAAS,EAAA,QAAA,QAAA,OAAA;IACX;AAEA,WAAMC,CAAAA;EACN;QACE,aAAO,QAAA1G,OAAA;AACT,MAAA,WAAA,WAAA,GAAA;AAEA,WAAMoB;EACN;QACE,SAAOuF,CAAK;aACVvF,MAAO/B,YAAY;AACrB,QAAA,GAAO,UAAOsH,gBAAU,GAAA,aAAmBC,QAAa,GAAA,aAAWA,QAAa;AAC9ExF,aAAO9B,eAAa,GAAGuH;IACzB,WAAWA,GAAGF,UAAU,gBAAgBE,GAAGD,aAAa,QAAQC,GAAGD,aAAa,QAAQ;AACtFxF,aAAO7B,gBAAesH,GAAGC;IAC3B,WAAWD,GAAGF,UAAU,gBAAgBE,GAAGD,aAAa,QAAQC,GAAGD,aAAa,QAAQ;AACtFxF,aAAO5B,eAAa,GAAGqH;IACzB,WAAA,GAAA,UAAA,gBAAA,GAAA,aAAA,QAAA,GAAA,aAAA,QAAA;AACF,aAAA,gBAAA,GAAA;IACA;EACF;AAEA,SAAS9F;;SAEL,wBAAOf,SAAA;AACT,MAAAA,QAAA,SAAA,aAAA;AACIA,WAAO+G;;AAEX,MAAA/G,QAAA,SAAA,SAAAA,QAAA,SAAA,MAAA;AACIA,WAAO+G,QAAI,QAAK,KAAO,uBAAA;;AAE3B,MAAA/G,QAAA,SAAA,OAAA;AACA,WAAO,wBAAAA,QAAA,MAAA;EACT;;;;;ADnrDA,IAAEgH,iBAAA;;;;;;AAKF;;EA8DE;;EAGQC,WAAAA,oBAA8B,IAAA;EAEtC;;EAGA,eAAA;;WAEEC;IACAC,oBAAAA;IACAC,uBAAqB;IACrBC,qBAAAA;IACAC,2BAAuB;IACvBC,uBAAsB;IACtBC,sBAAsB;IACtB,sBAAA;EAEF;;cAEO,SADsBC;AAG3BC,UAAMC,GAAAA,KAAAA,UAAW;WACfC,WAAI;MACJC,IAAAA;MACAC,MAAAA;aACE,MAAOC;eACL,MAAO,KAAA,KAAA,QAAA,EAAA,IAAA,CAAA,UAAA;iBACLC;YACAC,OAAMC,KAAKC,UAAUH,MAAMI,SAASH,KAAI;YACxCP,MAAAA,KAAOQ,UAAc,MAACF,SAAc,IAACN;YACvC,OAAA,KAAA,UAAA,MAAA,SAAA,KAAA;UACF;QACF,CAAA;MACF;IAEAA,CAAAA;WACEE,WAAI;MACJC,IAAAA;MACAC,MAAAA;0BAA8B;QAAO,GAAA,KAAA;MACvC;IACF,CAAA;EAEA;QACE,QAAKb;AACP,SAAA,iBAAA,IAAAoB,cAAA,KAAA,MAAA,MAAA,KAAA,gBAAA,KAAA,IAAA,CAAA;EAEA;QAEE,SAAWpB;AACX,UAAMqB,KAAAA,eAAkBC,KAAK;AAC/B,UAAA,QAAA,IAAA,MAAA,KAAA,KAAA,QAAA,EAAA,IAAA,CAAA,UAAA,MAAA,MAAA,CAAA,CAAA;EAEA;;;;EAIE,MAAA,YAAA;EAGF;;;;QAIE,UAAA;AAEF,IAAAC,MAAA,KAAA,wDAAA,QAAA,EAAA,YAAA,YAAA,GAAAxB,gBAAA,GAAA,IAAA,GAAA,KAAA,CAAA;EAEAyB;YACE,SAAWC;WACT,IAAMC,QAAAA,CAAAA,EAAAA,MAAiB,OAACC,IAAAA,MAAaC;AACrCC,YAAAA,aAAkBD,KAAK,aAAA,KAAA,SAAA,MAAA,OAAA,KAAA;wBACfF,KAAWP,YAASW;AAC1BJ,cAAAA,WAAe,SAAG,KAAA;AAClB,mBAAK1B,OAAAA;AACP,aAAA,eAAA,SAAA;MACA,CAAA;AACF,aAAA,WAAA;IACF,CAAA;EAEA;;;;;oBAKcC,MAAAA;AACZ,SAAK8B,OAAM;QACT,CAAA,MAAK;AACL,WAAK,eAAO7B;AACd,WAAO,OAAA;WACL;AACA,WAAI,OAAK;UACP,KAAK,iBAAe,OAAK;AAC3B,aAAA,eAAA,KAAA,eAAA,WAAA,KAAA,cAAA,IAAA,IAAA;MACF;IACA;AACF,SAAA,eAAA,SAAA;EAEQyB;eAOAK,KAAAA,SAAcC,WAAc,SAAMC,SAAOC;AAC/C,UAAMT,cAA0BO,UAAA,MAAA,KAAA,wBAAA,EAAA,KAAA,MAAA,QAAA,KAAA,CAAA;UAC9Bd,aAAciB;gBACZC,IAAAA,cAAkB7B;QAClB8B,aAAa,KAAC9B,QAAQ8B;QACtBC,SAAAA,KAAAA,QAAoB/B;QACpBgC,eAASC,KAAQD,QAAWE;QAC5B3B,SAAOiB,QAAAA,WAAAA,MAAAA,IAAAA,MAAAA,mBAAAA,CAAAA;QACPW,OAAAA;QACAC,YAAAA,QAAmB;QACrB,mBAAA,KAAA,QAAA;MACAC,CAAAA;MACAf,OAAM;MACNgB,MAAAA;MACAC,aAAa;mBACHC,CAAAA,YAAU;YAChB,IAAA,UAAA;AACF;QACAC;kBAAYT;UAA0BU,SAAAA,QAAAA;UAAQ;QAChD,CAAA;MACAC;MACAC;aACEC,YAAAA;AACA,gBAAM3B;AACN,cAAK4B,WAASC,SAAO7B,MAAAA;AACvB,aAAA,SAAA,OAAA,UAAA;MACF;IACA;AACA,SAAA,SAAOA,IAAAA,UAAAA;AACT,WAAA;EAEA;QAEE,gBAAkB,MAAA;AAClB,UAAK,OAAA,KAAY;AAEjB,SAAA,eAAA;eAEOX,SAAU,KAAE,UAAA;UACf,CAAA,MAAA,MAAA;AACF;MACA;UACE,MAAA,aAAA;AAEA,cAAA,QAAA;AACF;MACA;UACEA,SAAM8B,OAAQ;AACd,cAAA,QAAA;AACF;MACA;UACE9B,QAAM8B,MAAQ,SAAA,YAAA,IAAA,GAAA;AAChB,cAAA,QAAA;MACF;IAEA;AACA,UAAIW,QAAAA,YAAa,IAAA;AACjB,QAAA,aAAMC;AACN,UAAMpC,cACJP,KAAMQ,SAAUgC;UACd,QAAKvC,IAAM8B,MAAS,KAAC9B,KAAMe,QAAM,EAAA,IAAA,OAAA,UAAA;UAC/B,CAAA,MAAA,SAAA,CAAA,MAAA,MAAA;AACF;MACA0B;AAEA;UACE;AACAzC,cAAM8B,EAAAA,QAAQ,IAAA,MAAA,MAAA,SAAA,UAAA;AACd,cAAIa,QAAAA;YACF3C,WAAM+B,MAAW,aAAG;AACpB/B,gBAAMgC,cAAYhC;AACpB,gBAAA,YAAA,MAAA,SAAA,WAAA,CAAA;QACA;eACI4C,KAAMC;cACRpB,MAAAA,KAASzB;UACTA,SAAOE,MAAKC,SAAUH;UACxB,OAAA,KAAA,UAAA,MAAA,SAAA,KAAA;QACAA,GAAAA,EAAAA,YAAc6C,YAAAA,GAAAA,gBAAAA,GAAAA,KAAAA,GAAAA,KAAAA,CAAAA;AAChB,cAAA,QAAA,GAAA;MACF;IAGF,CAAA,CAAA;AACA,SAAK,OAAOxD;AACZ,SAAK,OAAOE,6BAA4B;AACxC,SAAK,OAAOC,uBACT,KAAI,OAAO,4BAAyB,KAAK,OAAOF;AAGnDkB,SAAIsC,OAAQ,wBAAoB,KAAA,OAAA,wBAAA,KAAA,OAAA,wBAAA,KAAA,eAAA,KAAA,OAAA;UAAEhB,QAAOW,oBAAAA;MAAYM,OAAAA;MAAqBC,QAAAA;MAAoC,UAAA,YAAA,IAAA,IAAA;IAChH,GAAA,EAAA,YAAA,YAAA,GAAAhE,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;EACF;;;;;cA5DSiE;SAAOC,KAAAA;IAA6BC,uBAAqB;;;;mBA3I3DC,cAAAA;;;;;AK5DP,YAAYC,aAAY;AAGxB,SAASC,iBAAAA,sBAAqB;AAE9B,SAASC,mBAAAA,wBAAuB;AAGhC,SAASC,uBAAuB;AAEhC,SAASC,OAAAA,aAAW;AACpB,SAASC,gBAAAA,qBAAoB;AAiB7B,IAAAC,iBAAaC;AAGX,IAAA,kBAAA,MAAA;;;;;EAKiBC;EACAC;EAEjB;;cAEOD,SAAWE;AAChB,SAAKD,aAAY,QAAGC;AACpB,SAAKC,WAAAA,QAAkBD;SACrBL,eAAaO,QAAAA;SACbP,kBAAaO,QAAAA,kBAAyB;MACvCP,cAAA,oBAAA;MACHA,cAAA,oBAAA;IAEAQ;;oBAME,MAAgB,SAAA,MAAA;WAQRC,YAAAA,MAAAA,aAAuC;AAE7C,YAAA,UAAA,CAAA;AACA,YAAIC,iBAAmB,CAAA;UAAaC,mBAAgBC;QACpD,GAAK;eACE,CAAA,MAAA,EAAMC,eAAAA,IAAiB;iBAC1B,WAAKH,KAAAA,aAA6BI,GAAEC;mBAClC,iBAAA,KAAA,iBAAA;cACA,CAAA,iBAAA,KAAA,CAAA,MAAA,EAAA,YAAA,WAAoD,EAAA,eAAA,aAAA,GAAA;6BAGtCF,KAAAA;cACZG;cACF,YAAA;cACF,QAAA;YACF,CAAA;UACF;QAEA;MACA;UAIE,iBAAIC,MAAkB,SAAG;iBACvB,UAAA,kBAAA;YACAR,kBAAeS,GAAKF;AAEtB,yBAAA,KAAA,MAAA;AACI;;YAEFP,CAAAA,OAAAA,SAAeS;AAEjB,yBAAA,KAAA,MAAA;AAEElB;;YAIAD,cAAS,oBAAA,SAAA,OAAA,cAAkDC,cAAA,oBAAA,UAAA,OAAA,YAAA;AAA+B,UAAAD,MAAA,KAAA,kDAAA;YAC1F,WAAA,OAAA;UACAU,GAAAA,EAAAA,YAAAA,YAAoBO,GAAAA,gBAAAA,GAAAA,IAAAA,GAAAA,KAAAA,CAAAA;AAEtB,yBAAA,KAAA,MAAA;AAEA;QACA;cAME,gBAAe,OAAO,OAAKG,WAAgB,YAAC,OAAA,WAAA,KAAAnB,cAAA,WAAA,KAAA,OAAA,MAAA,IAAA;;gBAE1Ca,SAAAA,OAAeG,KAAOJ,WAAU,MAAA;YAChCI,SAAQI,OAAAA;YACRC,eAAOJ,OAAAA;YACT,QAAA;YAEA,OAAA;UACA,CAAA;qBAEI,SAAMK,OAAO1B,QAAAA;gBAEb2B;oBACER,OAASC,eAAc,OAAA,MAAA,IAAA;sBACvBQ,KAASC;gBACTC,SAAAA,OAAgBV;gBAChBW,SAAAA,MAAY,UAAA,gBAAA;gBACZC,gBAAU,OAAA;gBACVN,YAAAA;gBACAO,UAAAA;gBACF;gBACA,WAAY,MAAA;cACZ9B,CAAAA;qBAAsDgB,KAAAA;oBAAyBe,KAAAA,2CAAAA;gBAAI,SAAA,OAAA;gBACrF;cACF,GAAA,EAAA,YAAA,YAAA,GAAA7B,gBAAA,GAAA,IAAA,GAAA,KAAA,CAAA;YAEAgB;UACAR;4BACWO,OAAOD,OAAO;yBACvBH,KAAYI;YACZA,SAAQe,OAAOC;YACjB,YAAA,OAAA;YACA,QAAc,OAAA;UACdjC,CAAAA;iBAAiDgB,OAAAA;gBAAyBkB,MAAAA,qCAAAA;YAAM,SAAA,OAAA;YAClF;UACF,GAAA,EAAA,YAAA,YAAA,GAAAhC,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;QAEA;;aAAkBiC;QAAwB;QACpCrC,SAAAA;MACV;IACF,CAAA,EAAA,KAAAA,iBAAA,QAAA,KAAA,QAAA,GAAA,iBAAA,mCAAA,GAAA,aAAA;;;;;AC3JA,SAA8CsC,yBAAAA,8BAA6B;AAC3E,OAAOC,aAAa;AAEpB,SAASC,SAAAA,QAAOC,mBAAAA,wBAAuB;AACvC,SAASC,WAAAA,UAASC,kBAAAA,iBAAgBC,YAAAA,iBAAgB;AAElD,SAASC,aAAAA,mBAAiB;;;ACL1B,SAKEC,yBAAAA,8BACK;AAEP,SAASC,qBAAAA,oBAAmBC,mBAAAA,wBAAuB;AACnD,SAASC,aAAAA,mBAAiB;;;ACV1B,YAAYC,QAAO;AAEnB,SAASC,OAAAA,aAAW;AAQpB,IAAAC,iBAAA;AAMQC,IAAAA,oBAAgB,CAAA,QAAA;AACtB,QAAMC,WAAa,QAACC,GAAAA;AACpB,QAAMC,QAAMC,KAAKC,IAAG;AACpBR,QAAM,OAACI,QAAAA,QAAAA;AAEP,QAAMK,MAAAA,KAAAA,IAAAA;AACN,EAAA,QAAMC,IAAAA;AACN,QAAMC,qBAAmBJ,KAAKC,IAAG;AAEjC,QAAIG,gBAAmBF,iBAAAA,GAAAA,EAAAA;QACrBR,mBAAS,KAAA,IAAA;yBAA0CU,qBAAmBF,KAAAA;AAAmB,IAAAR,MAAA,KAAA,+BAAA;MAC3F,SAAA,mBAAA;IAEA,GAAA,EAAO,YAAA,YAAA,GAAAC,gBAAA,GAAA,IAAA,GAAA,OAAA,CAAA;;SAELU;IACAF,oBAAAA,SAAAA;IACF,UAAA,MAAA;IACA;;;;;ADpBF,IAAAG,iBAAaC;AACX,IAAOC,eAAP,MAAmDC;;kBAExCC,KAAK,SAAE;eACZ,CAAA,MAAA;AACF,UAAA,CAAA,EAAA,OAAA;AACA;;iBAEMD,CAAAA,KAAQE,KAAAA,KAAW,OAAE,QAAA,EAAA,KAAA,GAAA;cACrBD,aAAaE,uBAAqBD,MAAAA,SAAa,CAAA;AACnD,YAAA,QAAA,UAAA,GAAA;AACF,YAAA,MAAA,GAAA,IAAA,aAAA,QAAA,UAAA,CAAA;QACF;MACF;IAEA,CAAA;;;;;;;;EAMwE,YAAA,QAAA;AAEpEA,SAAAA,SAAyB;;EAE7B,IAAA,aAAA;AAEIE,WAAM,KAAA,OAAA;;EAEV,IAAA,MAAA;AAEIC,WAAAA,KAAoB,OAAA,OAAA;;EAExB,IAAA,WAAA;AAEIC,WAAAA,KAAuC,OAAA,KAAA,EAAA,UAAA;;EAE3C,IAAA,SAAA;AAEAC,WAAuC,KAAA,OAAA;;EAEvC,MAAA;AAEAC,WAAAA,KAAqC,WAAA,KAAA,OAAA,OAAA,IAAA,IAAA;;eAE9BD;UACH,MAAO,KAAA,IAAA;AACT,QAAA,CAAA,KAAA;AAEA,aAAWE;IACb;AAEAC,WAAAA,IAA6B,WAAAC,iBAAA;;gBAEjB;UACR,MAAO,KAAA,IAAA;AACT,QAAA,CAAA,KAAA;AAEA,aAAOC;IACT;AAEAC,WAAAA,mBAAsC,YAAA,GAAA;;yBAE1B;UACR,MAAO,KAAA,IAAA;AACT,QAAA,CAAA,KAAA;AAEA,aAAOC;IACT;AAEAC,WAAAA,OAAAA,KAAsC,IAAA,WAAA,CAAA,CAAA,EAAA;;yBAE1B;UACR,MAAO,KAAA,IAAA;AACT,QAAA,CAAA,KAAA;AAEA,aAAOD;IACT;AAEAE,WAAAA,OAAAA,KAAAA,IAAwC,SAAA,CAAA,CAAA,EAAA;;0BAE5BT;AAEV,UAAA,MAAA,KAAA,IAAA;AACA,IAAAU,YAAOH,KAAOI,QAAOX,EAAAA,YAAS,YAAaY,GAAAA,gBAAgB,GAAA,IAAA,GAAA,MAAA,GAAA,CAAA,OAAA,EAAA,EAAA,CAAA;AAG7DC,WAAAA,OAAoC,OAAA,IAAA,SAAA,CAAA,CAAA,EAAA,IAAA,CAAA,MAAA,EAAA,SAAA,CAAA;;mBAExB;UACR,MAAO,KAAA,IAAA;AACT,QAAA,CAAA,KAAA;AACA,aAAOC;IACT;AACF,WAAA,kBAAA,GAAA;;;;;ADjGA,IAAAC,iBAAaC;AAEMC,IAAAA,oBAAAA,cAA8CC,UAAA;EAC9CC,SAAAA,oBAAAA,IAAAA;EACAC,eAAAA,oBAAAA,IAAAA;EAEDC,kBAAAA,oBAAAA,IAAAA;EAEhB,yBAA6D,oBAAA,IAAA;6BACpC,IAAIC,OAAKH;eAC9B,KAAMI;AACR,eAAA,CAAA,GAAA,OAAA,KAAA,KAAA,iBAAA;AACI,YAACC,QAAY,QAAA;IACnB;AAEIC,SAAAA,OAA+C,MAAA;;EAEnD,IAAA,QAAA;AAEIC,WAAAA,KAAsB;;EAE1B,IAAA,WAAA;AAEAC,WAAAA,MAAAA,KAAoBC,KAAAA,aAAkD,KAAA,CAAA;;EAEtE,oBAAA,YAAA;AAEAC,WAAAA,KAAAA,OAAuBC,IAAAA,UAA0C;;EAEjE,uBAAA,SAAA;AAEAC,WAAAA,KAAAA,aAA6D,IAAA,OAAA;;mBAErDH,SAAa;AACnB,IAAAI,YAAKJ,KAAAA,oBAAYK,gBAAA,MAAA,QAAA,EAAA,YAAA,YAAA,GAAAlB,gBAAA,GAAA,IAAA,GAAA,MAAA,GAAA,CAAA,gDAAA,EAAA,EAAA,CAAA;UACf,aAAOmB,KAAAA,aAAAA,IAAAA,OAAAA;AACT,QAAA,CAAA,YAAA;AACA,aAAW;IACb;AAEA,WAAMC,KAAAA,OAAAA,IAAkBL,UAAkBM;;QAExC,kBAAoBA,SAAMR,OAAU;QAClCS;AACF,QAAA,KAAO,OAAA,IAAA,MAAA,UAAA,GAAA;AACLA,aAAO,KAAIC,OAAAA,IAAAA,MAAaF,UAAAA;WACxB;AACF,aAAA,IAAA,aAAA,KAAA;AAEI,WAAKnB,OAAAA,IAAAA,MAAiBa,YAAAA,IAAaO;;AAEvC,QAAA,KAAA,aAAA,IAAA,OAAA,MAAA,KAAA,OAAA,YAAA;AAEA,aAAME;IACN;UACE,aAAUpB,KAAAA,aAAoBoB,IAAAA,OAAaC;QAC3C,YAAKrB;AACP,WAAA,KAAA,gBAAA,IAAA,UAAA,GAAA,QAAA;AAEI,WAACF,gBAAiBa,OAASO,UAAW;IAC1C;AAEA,SAAKlB,aAAAA,IAAgBsB,SAASC,KAAM,OAACd,UAAYe;AAEjD,UAAMC,MAAAA,IAAAA,SAAAA,QAAAA,EAAAA,YAAiCC,YAAAA,GACrCF,gBACA,GAAA,GAAA,CAAA;SACE,gBAAMG,IAAc,KAAA,OAAA,YAAA,GAAA;uCAAgB,IAAAD,iBAAA,KAAA,YAAA;0BAAUE;QAAiE,KAAA;QAC3G,GAACC,KAAAA,sBAA0B5B,EAAAA,IAAAA,CAAAA,QAAAA,uBAAsC,GAAA,CAAA;;UAEnE,CAAA,QAAKC,aAAAA,KAAAA,uBACC4B,IAAAA,OAAAA,CAAAA,GAAAA;AAER,aAAA,uBAAA,IAAA,SAAA,WAAA;AAEF,aAAA,yBAAA,KAAA,IAAA,8BAAA,SAAA,KAAA,YAAA,YAAA,WAAA,CAAA;MAAEC;IAAiB,GAAA;MAErB,cAAMC;IACNd,CAAAA;AACAM,UAAIS,uBAA2B,MAACC,2BAAyBF,QAAAA;AAEzDP,SAAAA,OAAAA,YAAAA,UAAkC,oBAAA;AAElC,QAAA,UAAOP,MAAAA,KAAAA,OAAAA,eAAAA,UAAAA,oBAAAA,CAAAA;AACT,+BAAA,QAAA;AACF,WAAA;EAEA;;;;;EACE;;cAEkBiB,SAAAA,aAAAA,gBAAAA,aAAAA;SACAC,UAAAA;SACAT,cAAAA;AACf,SAAA,iBAAA;AACL,SAAA,cAAA;;;;;ATjEA,IAAAU,iBAAA;;AAyCmBC,IAAAA,WAAAA,cAAgCC,UAAA;EAChCC;EACAC;EACAC;EAEAC,qBAA0C,IAAA,kBAAA;EAC1CC;EACAC;EACAC;EACAC;EAETC;EAEAC;EAEAC;EAER;qBASO;cAEAR,EAAAA,IAAAA,gBAAuBS,6BAAAA,SAAAA,uBAAAA,OAAAA,WAAAA,cAAAA,GAAAA;AAC5B,UAAKC;SACHC,mBAAIC,IAAAA,gBAAAA;SACJC,iBAAkBb,IAAAA,cAAgB;MAClCc,IAAAA;MACAC,aAAAA,KAAAA;MACAC;MACF;MAEI;IACJ,CAAA;AAEA,SAAKZ,WAAU;SAAmBa,uBAAiBC,IAAAA,oBAAAA,KAAAA,cAAAA;SAAsBC,aAAcC,IAAAA,UAAOC;MAAa,iBAAA;MACvG,cAAChB,OAAmB,WAAIiB;;SAE1BC,mBAAcpB,IAAQ,gBAAA;MACtBqB,WAAAA,KAAa;MACf,SAAA,KAAA;MACI,aAACjB,MAAc,KAAOkB,mBAAAA;IAE1B,CAAA;AACA,SAAKvB,iBAAe,IAAIwB,sBAAAA,SAAAA,KAAAA,YAAAA,SAAAA;SAGtBC,eAAe,IAAKjB,YAAAA;SACpBkB,gBAAiB,IAAC1B,iBAAY;MAC9BqB,eAAcpB,KAAAA;MACd0B,aAAAA,KAAAA;MACF,SAAA,KAAA;MAEI,mBAAgB,KAAIC;;SAEtBD,eAAAA,IAAmB,gBAAK9B;MACxBgC,eAAe,KAAA;yBACV,KAAA;qBACK,YAAKzB;AACb,WAAA;AACF,gBAAA,KAAA,eAAA,YAAA;QACF,SAAA,CAAA,KAAA;MAEA0B;;WAEEC,WAAM;MACNC,IAAAA;YACE;yBACEC;eACAC;UACF,WAAA,KAAA,iBAAA,aAAA;UACF,iBAAA,KAAA,eAAA;QACF;MAEAJ;;WAEEC,WAAM;MACNC,IAAAA;YACE;yBACOG;qBACLC,KAAUD,KAAKC,mBAAQ,MAAA,OAAA,CAAA,EAAA,IAAA,CAAA,UAAA;UACvBC,KAAAA,KAAUF;UACVG,UAAAA,KAAeH;UACfI,UAAAA,KAAeJ,YAAKK;UACtB,eAAA,KAAA,qBAAA;UACF,eAAA,KAAA,qBAAA;QACF,EAAA;MAEAV;;WAEEC,WAAM;MACNC,IAAAA;YACE;yBACOG;qBACLC,KAAUD,KAAKC,mBAAQ,MAAA,OAAA,CAAA,EAAA,IAAA,CAAA,UAAA;UACvBC,KAAAA,KAAUF;UACVG,UAAAA,KAAeH;UACfI,UAAAA,KAAeJ,YAAKK;UACpB,eAASC,KAAAA,qBAAsB;UACjC,eAAA,KAAA,qBAAA;UACF,GAAA,KAAA,eAAA,KAAA,CAAA;QACF,EAAA;MACF;IAEIC,CAAAA;;EAEJ,IAAA,WAAA;AAEIC,WAAAA,KAAAA,mBAAiC;;EAErC,IAAA,eAAA;AAEIC,WAAAA,KAAAA;;EAEJ,IAAA,cAAA;AAEIC,WAAAA,KAAAA;;EAEJ,IAAA,gBAAA;AAEIC,WAAAA,KAA+C;;EAEnD,IAAA,QAAA;AAEIC,WAAAA,KAAuB,mBAAA;;EAE3B,IAAA,YAAA;AAEA,WAAA,KAAA;;;;;EAKA,IAAA,cAAA;AAEA,WAAyBC,KAAkB;;QAEzC,MAAM,KAAKxC;AACXyC,IAAAA,MAAI,wCAAA,QAAA,EAAA,YAAA,YAAA,GAAAxD,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AAEJwD,UAAI,KAAA,eAAA,KAAA,GAAA;AACJ,IAAAA,MAAA,oCAA8BC,QAAAA,EAAAA,YAAAA,YAAAA,GAAAA,gBAAAA,GAAAA,KAAAA,GAAAA,KAAAA,CAAAA;AAC9BD,IAAAA,MAAI,uCAAA,QAAA,EAAA,YAAA,YAAA,GAAAxD,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AAEJwD,UAAI,KAAA,cAAA,KAAA,GAAA;AACJ,IAAAA,MAAA,mCAAmCC,QAAAA,EAAAA,YAAAA,YAAAA,GAAAA,gBAAAA,GAAAA,KAAAA,GAAAA,KAAAA,CAAAA;AACnCD,IAAAA,MAAI,6CAAA,QAAA,EAAA,YAAA,YAAA,GAAAxD,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AAEJ,UAAA,KAAA,mBAAA,KAAA,GAAA;AACA,IAAAwD,MAAA,yCACkBE,QAAgBlD,EAAAA,YAAUmD,YAAAA,GAC1C3D,gBACI4D,GAAAA,KAAM,GAAA,KAAA,CAAA;AAIZ,UAAMC,cAAAA,iBAA2B,WAAa,KAAE,QAAKtD,EAAAA,WAAauD,CAAO,GAAA,MAAA,IAAA,MAAA,8BAAA,CAAA;AACzEN,IAAAA,MAAI,gDAAA,QAAA,EAAA,YAAA,YAAA,GAAAxD,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AACJ,UAAKW,iBAAiB,WAAIoD,KAAAA,QAAkBC,EAAI,KAAE,aAAKC,QAAiB,CAAA;AAExET,IAAAA,MAAI,0CAAA,QAAA,EAAA,YAAA,YAAA,GAAAxD,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AACJ,SAAA,iBAAsB0D,IAAAA,cAAgBlD,KAAAA,MAAU,KAAKC,iBAAkB;AACvE+C,IAAAA,MAAI,8CAAA,QAAA,EAAA,YAAA,YAAA,GAAAxD,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AACJ,UAAKS,iBAAWyD,WAAe,KAAKF,QAAM,EAAA,KAAA,WAAA,QAAA,CAAA;UACxC,wCAA4B,QAAA,EAAA,YAAA,YAAA,GAAAhE,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AAC9B,SAAA,WAAA,YAAA,GAAA,KAAA,MAAA,MAAA;AAEI,WAACI,eAAmB+D,SAAAA;;4BAEVpD,yBAAeqD,GAAAA,KAAAA,MAA0BC,CAAAA,MAAAA;AACrD,UAAA,EAAA,gBAAA;AACA,aAAS,KAACtD,eAAeuD,0BACvBD,8BAAgCE,EAAAA,SAAWC,EAAAA,cACzCC,CAAAA;MAEN;AACI,WAAC1D,KAAAA,eAAe2D,2BAA6B,8BAAA,EAAA,SAAA,EAAA,WAAA,GAAA,EAAA,WAAA;;AAEjD,SAAA,eAAA,eAAA,GAAA,KAAA,MAAA,MAAA;AACI,WAAC/D,eAAegE,SAAQ;IAC5BnB,CAAAA;AACF,SAAA,eAAA,SAAA;AAEA,IAAAA,MAAyBoB,4BAAoC,QAAA,EAAA,YAAA,YAAA,GAAA5E,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;;QAE3D,OAAM,KAAKI;AACX,UAAM,KAAKW,cAAc,MAAM,GAAA;AACjC,UAAA,KAAA,mBAAA,MAAA,GAAA;AAEA,UAAA,KAAA,eAAA,MAAA;;;;;EAKA,MAAA,MAAA,KAAA;AAEA,UAAA,KAAA,eAAA,MAAA,GAAA;;;;;QAKI,gBAAWJ;AACb,OAAA;AACF,YAAA,KAAA,eAAA,YAAA;IAEA,SAAA,CAAA,KAAA;;;;;EAKA,MAAA,QAAA,KAAA,YAAA,MAAA;AAEA,WAAMkE,MAAUC,KAAwC,eAAA,QAAA,KAAA,YAAA,IAAA;;EAExD,MAAA,UAAA,IAAA;AAEA,WAAA,MAAA,KAAA,eAAA,UAAA,EAAA;;;;;EAKA,MAAA,UAAA,cAAA,MAAA;AAEA,WAAA,KAAA,eAAA,UAAA,cAAA,IAAA;;;;;QAKE,gBAAgB,KAAMC,UAAAA;AAEtB,IAAAC,YAAMC,KAAAA,oBAA2BlE,gBAAemE,MAAAA,QAA6B,EAAA,YAAA,YAAA,GAAAlF,gBAAA,GAAA,KAAA,GAAA,MAAA,GAAA,CAAA,gDAAA,EAAA,EAAA,CAAA;UAC3EmF,UAASC,MAAAA,sBAAuB,QAAA;UAChCC,gBAAQ,MAAA,KAAA,eAAA,UAAA;eAAEzC,iBAAmB0C;MAAQ,QAAA;QAErC,UAAA,SAAA,MAAA;MACAC;;MAEF,SAAA,CAAA;MAEA,OAAWxE,CAAAA;;eAA0CkE,eAAcO,MAAU,KAAA;mBAAC;QAAC,cAAA;MAE/E;IACF,CAAA;AAEA,WAAA,MAAA,KAAA,cAAA,KAAA,SAA2C,cAAA,GAAA;EAC3C;;QAEE,cAAe,KAAM,SAAKzE,cAAe0E;gBACvCC,KAAAA,oBAAkBC,gBAAA,MAAA,QAAA,EAAA,YAAA,YAAA,GAAA3F,gBAAA,GAAA,KAAA,GAAA,MAAA,GAAA,CAAA,gDAAA,EAAA,EAAA,CAAA;AACpB,UAAA,SAAA,MAAA,KAAA,eAAA,QAAA,KAAA,cAAA;MACA,kBAAmBe;IAEnB,CAAA;AACF,UAAA,QAAA,KAAA,eAAA,iBAAA,OAAA,UAAA;AAEA,WAAA,KAAA,mBAAA,kBAA2C,SAAA,KAAA;EAC3C;;EAEA,MAAA,eAAA,eAAA;AAEA,SAAA;;;;;EAKA,MAAA,cAAA,KAAA,YAAA;AAEA,UAAA,KAAA,eAAA,cAAA,KAAA,UAAA;;;;;EAKA,MAAA,iBAAA,YAAA;AAEA,UAAA,KAAA,eAAA,iBAAA,UAAA;;;;;;QAMM,kBAAO,SAAA;UACT,OAAM,KAAI6C,mBAAO,iBAA4B,OAAA;AAC/C,QAAA,CAAA,MAAA;AACI,YAAC7C,IAAAA,MAAe6E,oBAAkBvB,OAAAA,EAAAA;IACxC;AAEA,SAAA,eAAA,kBAAA,8BAAA,SAAA,KAAA,UAAA,CAAA;;;;;;QAOyFE,oBAAAA,SAAAA;AAAQ,WAAAV,iBAAA,WAAA,KAAA,QAAA,EAAA,KAAA,WAAA,oBAAA;MACjG;IAEQI,CAAAA,CAAAA;;sBAEJ,YAAA;AACF,QAAA,KAAA,KAAA,YAAA,CAAA,KAAA,QAAA;AAEI;;QAGF;YACE4B,iBAAiB,uBAAA;;oBAEiCtB,KAAS,oCAAA;cAAMuB,SAAO,MAAA,KAAA,aAAA,OAAA,KAAA,MAAA,KAAA,sBAAA;UACrEC,SAAKlC;UACRmC,OAAWC;QACXJ,CAAAA,EAAAA,KAAAA,iBAAoB,WAAA,KAAmB,QAAA,CAAA;mBAC9B,gBAAA,MAAA;oBACC,QAAA,mBAAA;iBACNK;kBACEC;sBACAC;cACAC,UAAAA;cACAC,OAAO;cACPC,YAAY;qBAAC;0BAAC;;kBAAwB;kBAAC,OAAA;gBACzC;cACF;YACF;UACF;QACI,CAAA;;AAEJ,UAAA,KAAA,KAAA,YAAA,CAAA,KAAA,QAAA;AAEA;;;oBAGgDhC,KAAS,gCAAA;cAAMuB,SAAO,MAAA,KAAA,aAAA,OAAA,KAAA,MAAA,KAAA,kBAAA;UACjEC,SAAKlC;UACRmC,OAAWC;QACXJ,CAAAA,EAAAA,KAAAA,iBAAoB,WAAA,KAAgB,QAAA,CAAA;mBAC3B,gBAAA,MAAA;oBACC,QAAA,gBAAA;iBACNK;kBACEC;sBACAC;cACAC,UAAAA;cACAC,OAAO;cACPC,YAAY;qBAAC;0BAAC;;kBAAwB;kBAAC,OAAA;gBACzC;cACF;YACF;UACF;QAEIC,CAAAA;;YAEFC,QAAMR,gCAAmB;QACzBS,SAAQT,eAAeS;QACvBC,MAAAA,eAAQV;QACRW,QAAAA,eAAWX,OAAeW;QAC1BC,QAAOZ,eAAeY,OAAMC;QAC5BvB,WAASU,eAAeV,UAAY;QACtC,OAAA,eAAA,MAAA;QACA,SAAY,eAAA,QAAA;MACZ,GAAA,EAAA,YAAKU,YAAmB,GAAEjG,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;YACxB,MAAKa,CAAAA;UACL,CAAA,eAAKF,MAAgBgE;AACvB,aAAO,mBAAA;AACL,aAAK9D,eAAAA,SAAmB;MAC1B,OAAA;AAEA,aAAA,mBAAA;MACA;YAEE,OAAKZ,uBAAc8G,cAAkBC;AACvC,UAAA,MAAA;AACA,aAAOC,cAAK,kBAAA,IAAA;MACZ;aACE,KAAA;AACF,UAAA,KAAA,KAAA,YAAA,CAAA,KAAA,QAAA;AACIC;MACJ;AACA,MAAA1D,MAAI,MAACvD,KAAAA,QAAc8G,EAAAA,YAAAA,YAAiB,GAAA/G,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AAEtC,WAAA,cAAA,kBAAA;AACA,YAAA;IACJ;EAcA;;6BAEQ,OAAA;EACN0G,SAAQ;EACRC,MAAAA;EACAC,QAAAA,oBAAW,IAAIO;EACfN,QAAO,oBAAIM,IAAAA;EACX5B,WAAS,oBAAI4B,IAAAA;EACf,OAAA,oBAAA,IAAA;EAEMnB,SAAAA,oBAAcoB,IAAiCC;AACnDD;IACAA,aAAeX,CAAAA,KAAI,MAAMA;AACzB,MAAA,WAAWa,EAAKD;MACdD,OAAIV,IAAOa,QAAID,EAAAA;AACjB,aAAA,KAAA,EAAA,QAAA;AACA,QAAK,OAAME,IAAOb,CAAAA;;AAElB,aAAA,KAAA,EAAA,QAAA;AACA,QAAK,OAAMc,IAAOb,CAAAA;;AAElB,aAAA,KAAA,EAAA,WAAA;AACA,QAAK,UAAaC,IAAAA,CAAK;;AAEvB,aAAA,KAAA,EAAA,OAAA;AACA,QAAK,MAAMa,IAAOnC,CAAAA;;AAElB,aAAA,KAAA,EAAA,SAAA;AACF,QAAA,QAAA,IAAA,CAAA;EAOA;;IAaI,aAAY,MAAOoC,YAAUA,aAAS;AACtC,EAAAnE,MAAA,6BAA0E,QAAA,EAAA,YAAqB,YAAA,GAAAxD,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AAC/FwD,QAAI,MAAA,OAAoB;QAAEoE,YAAAA,OAAAA;AAAU,EAAApE,MAAA,oBAAA;IAEpC;EACA,GAAA,EAAA,YAAA,YAAA,GAAAxD,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AAIAwD,QAAI,CAAA,aAAA,IAAA,OAAA;QACFqE,CAAAA,WAAAA,IAAeA,OAAAA;QACfC,8BAA0B;IAC5B,eAAA,cAAA;IAEIC,aAAAA,YAAAA;mBACF,YAAA,GAAA/H,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;MACAwD,mCAAI;AAEJ,IAAAA,MAAIwE,+BAA6B,QAAA,EAAA,YAAA,YAAA,GAAAhI,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;UAC/B,CAAA,MAAM,IAAI4D,OAAM;AAClB,QAAA,OAAA,gBAAA,MAAA;AACI,YAAA,IAAA,MAAA,2BAAA;IACN;AACEJ,IAAAA,MAAI,6BAAA,QAAA,EAAA,YAAA,YAAA,GAAAxD,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;EACN,OAAA;AACI,IAAAwD,MAAA,8BAAA,QAAA,EAAA,YAAA,YAAA,GAAAxD,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;EACN;;;;;AYxiBF,YAAsCiI,QAAI;AAE1C,SAASC,QAAAA,aAAOC;AAChB,SAAkBC,OAAAA,qBAAAA,oBAAgB,gBAAAC,qBAAgB;AAClD,SAASC,YAAAA,kBAAU;AAGnB,SAASC,kBAAiB;AAE1B,SAASC,aAAAA,mBAAW;AACpB,SAEEC,OAAAA,aAAAA;AAOF,SAASC,eAAW,mBAAsB;AAC1C,SAEEC,WAAAA;AAEF,SAASC,iBAAa,2BAAgB;AACtC,SAASC,SAAAA,cAAa;AAEtB,SAMEC,iBAAAA,gBAAAA,gBAAAA,eAA0B,eACrB;;;ACnCP,SAASC,WAAAA,gBAAe;AACxB,SAASC,YAAAA,kBAAgB;AACzB,SAASC,OAAAA,aAAW;AAQpB,IAAAC,iBAAaC;AACX,IAAA,yBAAA,cAAAH,WAAA;;;;;;;EAOQI,0BAAiD;EAEzD,kBAA6BC,IAAuCN,SAAA;;EAEpE,YAAA,SAAA;AAEA,UAAyBO,GAAAA,KAAuB,UAAA;;QAE9C,QAAKC;AACL,SAAKA,0BAAoB;AAC3B,SAAA,gBAAA,MAAA;AAEA,SAAyBC,gBAAwB,KAAA;;QAE/C,SAAKD;AACLE,SAAAA,0BAAkBL;AACpB,SAAA,gBAAA,MAAA,IAAA,MAAA,sBAAA,CAAA;AAEA,iBAAuBM,KAAAA,oBAAkD;;kBAErE,SAAA;AACF,QAAA,QAAA,SAAA,QAAA;AACA;;AAEA,WAAA,KAAA,2BAAA,KAAA,QAAA,qBAAA;AACI,YAACC,KAAAA,gBAAuB,KAAA;IAC5B;SACE;QACA,KAAKP,4BAAuBQ,KAAAA,QAAW,qBAAA;WACrCX,gBAAS,MAAA;WACT,uBAAKU,WAA0B,MAAA;AAC/B,QAAAV,MAAI,KAACM,wFAAoB,QAAA,EAAA,YAAA,YAAA,GAAAL,gBAAA,GAAA,IAAA,GAAA,KAAA,CAAA;AACxB,aAAKG,0BAAQQ;AAClB,aAAA,gBAAA,KAAA;MACF,GAAA,KAAA,QAAA,qBAAA;IAEOC;;iBAEH,SAAA;AACF,QAAA,QAAA,SAAA,QAAA;AACI;IACJ;SACE;QACAC,KAAAA,0BAAmBX,MAAAA,KAAoB,QAAA,qBAAA;AACzC,WAAA,gBAAA,KAAA;AACF,oBAAA,KAAA,oBAAA;IACF;;;;;ADpEA,IAAEY,iBAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAIF;AA0CA,IAAMC,wBAAuB;AAC7B,IAAMC,uBAAoB;AAS1B,IAAA,oBAAaC;AACMC,IAAAA,qBAAAA,MAAgC;EAChCC;EACAC;EAETC,SAAiBC,IAAAA,MAAU;EAC3BC,OAAAA;EACAC,WAAAA;EACAC,mBAAmBC,oBAAAA,IAAyC;EAC5DC,eAAAA,oBAAAA,IAAsB;EAE9B,sBAAcC;cACPV,EAAAA,gBAAkBU,gBAAAA,mBAAAA,GAAAA;AACvB,SAAKT,kBAAkBU;AACvB,SAAKF,kBAAAA;AACP,SAAA,sBAAA,CAAA;EAEA;QACEG,QAAI,KAAA,SAAiB;UAAEC,iBAAgBA;MAAQC,QAAAA,QAAAA;MAA4C,iBAAA,KAAA,iBAAA;IAC3F,GAAA,EAAA,YAAa,YAAGC,GAAAA,gBAAAA,GAAAA,KAAAA,GAAAA,KAAAA,CAAAA;AAChB,SAAKZ,WAAWa;AAChB,SAAKb,OAAKc,IAAAA,OACR;SACE,KAAKd,UAAQe,KAAAA,gBAAuBf,cAAiBgB,MAAAA;AACvD,WAAA,QAAAD,mBAAA,KAAA,MAAA,MAAA,KAAA,iBAAA,CAAA;IAEJ,CAAA,CAAA;EAEA;;;;;;;;AAGE,YAAME,SAAS,4BAAA,KAAA,MAAA,KAAA,OAAA,QAAA,GAAA,KAAA;qBAASd;QAAiB,GAAA,KAAA;MACzC;iBACQe,cAAWC,KAAK,aAAA,OAAA,GAAA;AACxB,cAAA,WAAA,MAAA;MACA;AAEA,WAAI,aAAa,MAAK;UACpB,KAAK,aAAMC,MAAWH;mBACd,WAAKI,QAAAA;AACb,gBAAA,KAAA,gBAAA,KAAA,MAAA,OAAA;QACF;;;;;;;IACF;EAEA;;;;;;;;AAEE,YAAM,SAAS,4BAAEC,KAAAA,MAAAA,KAAAA,OAAAA,QAAAA,GAAAA,KAAAA;AAEjB,YAAK,KAAMJ,MAAAA,QAAc;iBACjBA,cAAWC,KAAK,aAAA,OAAA,GAAA;AACxB,cAAA,WAAA,MAAA;MACA;;;;;;;IACF;EAEA;;;;;;;QAEEV;YAAwBW,kBAAAA;QAAQ;uBAC1BG,YAAAA,GAAAA,gBAAAA,GAAAA,KAAAA,GAAS,KAAA,CAAA;AAEf,YAAI,SAAKpB,4BAA+B,KAAA,MAAA,KAAA,OAAA,QAAA,GAAA,KAAA;UACtC,KAAA,iBAAA,IAAA,OAAA,GAAA;AACF;MACA;AAEA,WAAI,iBAAkB,IAAA,OAAM;UAC1B,KAAA,aAAWkB,MAAAA;AACb,cAAA,KAAA,gBAAA,KAAA,OAAA;;;;;;;IACF;EAEA;;;;;;;;AAGE,YAAKlB,SAAAA,4BAAwBiB,KAAAA,MAAAA,KAAAA,OAAAA,QAAAA,GAAAA,KAAAA;AAE7B,WAAA,iBAAmB,OAAKhB,OAAY;AACpC,YAAIc,aAAY,KAAA,aAAA,IAAA,OAAA;UACd,YAAMA;AACN,cAAKd,WAAY,MAACoB;AACpB,aAAA,aAAA,OAAA,OAAA;;;;;;;IACF;EAEA;QAEEC,gBAAevB,KAAQ,SAAA,aAAA,GAAA;AACvBuB,IAAAA,YAAU,KAAK,UAACrB,QAAasB,EAAG,YAACN,YAAAA,GAAAA,gBAAAA,GAAAA,KAAAA,GAAAA,MAAAA,GAAAA,CAAAA,iBAAAA,EAAAA,EAAAA,CAAAA;AAEjC,IAAAK,YAAIE,CAAAA,KAAAA,aAAmB,IAAA,OAAA,GAAA,QAAA,EAAA,YAAA,YAAA,GAAAlC,gBAAA,GAAA,KAAA,GAAA,MAAA,GAAA,CAAA,mCAAA,EAAA,EAAA,CAAA;AAEvB,QAAA,mBAAuBmC;UACrBpB,aAAAA,IAAgB,yBAAoB;MACpCD,gBAAgB,KAAKV;MACrBuB,gBAAAA,KAAAA;MACAR;MACAiB,SAAAA,KAAAA;MACAC,qBAAmB,KAAA;yBACP,YAAA;cAAiDV,MAAAA,+CAAAA;UAAQ;QACnE,GAAA,EAAA,YAAa,YAAEW,GAAAA,gBAAiBb,GAAAA,KAAAA,GAAAA,KAAAA,CAAAA;AAClC,aAAA,UAAA,iBAAA,UAAA;MACAc;4BACY,YAAA;cAAoDZ,MAAAA,kDAAAA;UAAQ;QACtE,GAAA,EAAA,YAAa,YAAEa,GAAAA,gBAAmBf,GAAAA,KAAAA,GAAAA,KAAAA,CAAAA;AACpC,aAAA,UAAA,mBAAA,UAAA;MACAgB;0BACgB,YAAIP;YAChB,CAAA,KAAA,QAAA,kBAAA;AACF;QAEA;AAGAlB,cAAI,eAAA,KAAA,IAAA,mBAAgC,wBAAA,UAAA,IAAA,KAAA,OAAA,IAAA;cAAEW,gCAAAA;UAASe;UAAYC;UAAa;QAExET,GAAAA,EAAAA,YAAAA,YAAmB,GAAAlC,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AACnB4C,2BACOrC;;;;;;;;AAGH,kBAAI,SAAKI,4BAA8Bc,KAAAA,MAAY,KAAA,OAAA,QAAA,GAAA,KAAA;gBACjD,KAAA,aAAA,IAAA,OAAA,MAAA,YAAA;AACF;YAEA;AACA,kBAAMA,gBAAgB,KAAA;AACtB,kBAAKd,WAAY,MAACoB;AAClB,iBAAIc,aAAAA,OAAeC,OAAU;gBAC3B,eAAA,UAAA;AACF;YACA9B;kBAAiDW,MAAAA,qCAAAA;cAASe;cAAYC;cAAa;YACnF,GAAA,EAAA,YAAWf,YAAAA,GAAgBiB,gBAAAA,GAAgBlB,KAAAA,GAAAA,KAASe,CAAAA;;;;;;;UAEtDC;QAEJ,GAAA,YAAA;MACF;IACA,CAAA;AAEA,SAAA,aAAiBI,IAAKC,SAAAA,UAAAA;AACxB,UAAA,WAAA,KAAA,GAAA;EACF;;cApFSC;SAAOC,KAAAA;IAA6BC,uBAAI;;;;cA2BxCF;SAAOC,KAAAA;IAA6BC,uBAAI;;;;qBAlF1CC,cAAAA;;AAwJP,GAAA,kBAAMC;AACN,IAAMC,wBAAAA;AAEN,IAAMnB,8BAAAA;IACaoB,yCAA6BC,WAAA;EAC7BpD,gBAAgC,WAAA;EAChCC;EACAoD;EACAC,gBAAAA;EACAC;EACAlD;EACAmD;EACAC;EACAC;EACAC;EACTC;EAEAC,YAAAA;oBACNC,IAAAA,uBAAqBb;IACrBc,qBAAAA;IACC,uBAAA;EAEKC,CAAAA;EAEDC;EACAC;EAEP;cAUO,EAAA,gBAAA,gBAAA,SAAA,SAAA,qBAAA,mBAAA,sBAAA,mBAAA,GAAA;AACL,UAAKlE;AACL,SAAKC,kBAAkBU;AACvB,SAAK4C,kBAAWhC;AAChB,SAAKlB,WAAWU;AAChB,SAAA,WAAA;AAKA,SAAA,mBAAAoD,cAAA,YAAsC,sBAAA,OAAA;AAEtC,SAAKX,gBAAAA,GAAAA,KAAuBxB,gBAAAA,IAAAA,KAAAA,aAAAA;AAC5B,SAAKyB,uBAAqBxB;AAC1B,SAAKyB,qBAAqB;AAC1B,SAAKC,wBAAsBtB;AAE3B,SAAK4B,sBAAeG;SAClBC,WAAQC,IAAAA,eAAAA;aACN,CAAI,eAACN;AACP,aAAA,4BAAA;MACF;IAEA,CAAA;SACEO,WAAO,IAAOC,eAAmCF;aAC/C,OAAU,SAACT,eAAgBY;AAE3B,cAAM,KAAKC,gBAAa,UAAWF,OAAAA;AACrC,cAAA,KAAA,aAAA,KAAA,MAAA,OAAA;MACF;IACF,CAAA;EAEA;QACE5D,MAAI,KAAA;AAEJ,IAAAA,MAAA,cAAWiD,QAAAA,EAAAA,YAAoB,YAAA,GAAAjE,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AAE/B,UAAKO,KAAKc,gBACHjB,KAAAA;SACH,KAAK2E,UAAWC,KAAAA,gBAAAA,UAAAA,CAAAA,QAAAA;AAClB,WAAA,WAAA,GAAA;IAGF,CAAA,CAAA;AACA,QAAI,iBACF;AACA,SAAK5E,KAAAA;;WACH,gBAAI6E,cAAgB,YAAA;YAClBjE,gBAAY;AACZiE,UAAAA,MAAAA,QAAAA,2BAAiB,QAAA,EAAA,YAAA,YAAA,GAAAjF,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AACjB,2BAAA;AACF;QAEA;AACF,aAAA,oBAAA;MAGF,CAAA;IAAA;AACF,UAAA,KAAA,mBAAA;EAEA;QACEgB,OAAI,KAAA;AACJ,IAAAA,MAAI,cAACoD,QAAAA,EAAAA,YAA+B,YAAA,GAAApE,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AAEpC,SAAA,0BAA2B0B,MAAK;AAEhC,UAAM,KAAKoC,gBAAAA,MAAqB;AAClC,UAAA,KAAA,sBAAA;EAEA;MACE9B,SAAAA;AACA,IAAAA,YAAO,KAAKyB,eAAa,iBAAA,EAAA,YAAA,YAAA,GAAAzD,gBAAA,GAAA,KAAA,GAAA,MAAA,GAAA,CAAA,sBAAA,iBAAA,EAAA,CAAA;AAC3B,WAAA,KAAA;EAEA;QACE,gBAAU4D,QAAAA;QACR,CAAA,KAAA,sBAAO;AACT,aAAA;IACA;AACA,UAAKjC,UAAS,MAAA,KAAA,SAAA,gCAAA,OAAA,UAAA;QACZ,CAAA,SAAMuD;YACJC,uBAAmBA,MAAU,KAAA,SAAA,6BAAA;QAC7BlE,YAAY,OAACwC;QACf,QAAA,KAAA;MAEAzC,CAAAA;YACEmE,QAAAA,qDAA6B;QAC7BC,YAAAA,OAAgBF;QAChBG,gBAAe5B;QACjB,UAAA,KAAA;MAEA,GAAA,EAAA,YAAA,YAAA,GAAAzD,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AAIF,aAAA;IACA;AACF,WAAA,YAAA,KAAA;EAEAsF;uBACY1B,QAAAA;QACR,CAAA,KAAA,sBAAO;AACT,aAAA;IACA;AACA,UAAA,UAAA,2BAAA,OAAA,YAAA;AAEF,WAAA,YAAA,KAAA,YAAA,OAAA,aAAA,MAAA,GAAA,EAAA,WAAA;EAEQmB;aACFH,SAAQW;QACV,QAAA,cAAA,KAAA,kBAAA;AACF;IAEA;AACAvE,UAAIwE,UAAQC,MAAA,OAAY,QAAA,QAAA,KAAA;UACtB,QAAGC,YAAeC;MAClBN,GAAAA,eAAe5B,OAAAA;MACjB,UAAA,KAAA;IAEA,GAAA,EAAA,YAAA,YAAmB,GAAAzD,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AAEnB,YAAK4F,WAAAA,KAAgBD;AACvB,SAAA,gBAAA,OAAA;EAEA;MACE,oBAAO;AACT,WAAA;EAEA;QACE,WAAME,KAA+B,QAAA;UACnCC,UAAQA;cACNX,OAAAA,IAAAA,CAAAA,EAAAA,YAAAA,MAAAA,MAAAA,OAAAA;QACAY;QACAC,UAAAA,cAAAA,OAAAA,IAAAA;QACF;MACF,EAAA;IACA;AACF,UAAA,KAAA,gBAAA,aAAA,KAAA,KAAA,UAAA,OAAA;EAEA;QACE,WAAMH,KAA+B,UAAA;UAAEI,UAAAA;MAAS;IAChD;AACA,UAAA,WAAcC,MAAAA,KAAYC,gBAAgBC,aAAa,KAAA,KAAA,UAAA,OAAA;kBAAKjB,YAAU,SAAA,OAAA,IAAA,CAAA,QAAA;MAAEkB,IAAAA;MAAmC,cAAA,OAAA,IAAA,QAAA;IAC7G,CAAA,CAAA;EAEQT;kBACN,SAAA;QAIE5E,eAAY,OAAA,GAAA;YAAkBsF,QAAQ1B,gBAAwC;QAAC,OAAA,QAAA;MAC/E,GAAA,EAAA,YAAKb,YAAmB,GAAA/D,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AACxB,WAAA,oBAAA;AACF;IAEA;AAEA,SAAKoE,gBAAAA,eAA0BmC,OAAQ3B;AACzC,SAAA,0BAAA,QAAA,OAAA;EAEA;QACE,aAAA,KAAmB,SAAA;AAGnB,YAAA,WAAA,KAAA;YACkB,SAAA;MAAY;MAAkB;IAChD4B,GAAAA,KAAQ5B,aAAS,CAAA;YAAC,SAAA;MAAY;MAAsB;IAEpD5D,GAAAA,KAAIwE,aAAQ;UACV,QAAGE,cAAed;MAClBS,GAAAA,eAAe5B,OAAAA;MACjB,UAAA,KAAA;IAEA,GAAA,EAAA,YAAMgD,YAAeC,GAAM1G,gBAAC4E,GAAAA,KAAAA,GAAAA,KAAAA,CAAAA;AAE5B,UAAI,UAAAa,MAAA,OAAA,OAAA;QACF;YAGIF,KAAAA,gBAAgB7B,KAAAA,KAAgB,IAAA,OAAA,qBAAA;QAChCiD,WAAQ,KAAA;gBACNC;UACAC,aAAa,KAACzG,gBAAgByG;UAChC,SAAA,KAAA,gBAAA;QACAlB;iBAAWmB;UAA8B,OAAAC,eAAA,OAAA;QAC3C;MAEF,CAAA,CAAA;aACIT,KAAM;YAA4BU,MAAAA,0BAAAA;QAAI;MAC5C,GAAA,EAAA,YAAA,YAAA,GAAAhH,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;IACF;EAEQiH;iBACK;AACb,WAAA,KAAA;EACF;AAEA;AAKA,IAAMvB,iBAAkBV,CAAAA,YAAAA,QAAAA,SAAAA;IACtB,iBAAmB,CAAA,QAAM;AACzB,QAAA,EAAO,MAAA,OAAA,MAAA,QAAA,IAAA,IAAA,SAAA,SAAA,qBAAA,IAAA,IAAA,IAAA,CAAA;SACLkC;IACA/B,MAAAA,IAAAA;IACAgC,YAAAA,gBAAc,MAAkBnC,IAAMA,aAAImC;IAC1CC,cAAAA,kBAAAA,MAAAA,IAAAA,eAAAA;IACApB;IACAqB;IACAC;IACAC,SAAAA,SAAcC;IAChB,UAAA,IAAA,UAAA;EACF;;;;AEpcA,SAASC,QAAAA,aAAOC;AAChB,SAAkBC,SAAAA,QAAAA,qBAAAA,oBAAgB,gBAAAC,qBAAgB;AAClD,SAASC,YAAAA,kBAAU;AAGnB,SAASC,cAAAA,mBAAiB;AAE1B,SAASC,aAAAA,mBAAW;AACpB,SAAwCC,OAAAA,aAAW;AACnD,SAASC,eAAAA,oBAAW;AACpB,SAEEC,OAAAA,YAAAA;AAEF,SAASC,iBAAaC,4BAAgB;AACtC,SAASC,SAAAA,cAAa;AAEtB,SAMEC,iBAAAA,gBAAAA,gBAAAA,qBACK;AA9BP,IAAEC,iBAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAIF;AAgCA,IAAMC,yBAAuB;AAC7B,IAAMC,wBAAoB;AAqB1B,IAAAA,qBAAaC;AACMC,IAAAA,+BAAAA,MAAgC;EAChCC;EACAC;EACAC,SAAAA,IAAAA,OAAAA;EAETC;EACAC,OAAAA;EACAC,WAAAA;EACAC,mBAAmBC,oBAAAA,IAAmD;EAE9E,eAAcC,oBAAAA,IAAAA;cACPT,EAAAA,gBAAkBS,gBAAAA,mBAAAA,GAAAA;AACvB,SAAKR,kBAAkBS;AACvB,SAAKP,kBAAAA;AACP,SAAA,sBAAA,sBAAA;EAEA;QACEQ,QAAI,KAAA,SAAiB;UAAEC,iBAAgBA;MAAQC,QAAAA,QAAAA;MAA4C,iBAAA,KAAA,iBAAA;IAC3F,GAAA,EAAA,YAAa,YAAGC,GAAAA,gBAAAA,GAAAA,KAAAA,GAAAA,KAAAA,CAAAA;AAChB,SAAKV,WAAWW;AAChB,SAAKX,OAAKY,IAAAA,OACR;SACE,KAAKZ,UAAQa,KAAAA,gBAAuBb,cAAiBc,MAAAA;AACvD,WAAA,QAAAD,mBAAA,KAAA,MAAA,MAAA,KAAA,iBAAA,CAAA;IAEJ,CAAA,CAAA;EAEA;;;;;;;;AAGE,YAAME,SAASC,6BAAA,KAAA,MAAA,KAAA,OAAA,QAAA,GAAA,KAAA;qBAASd;QAAiB,GAAA,KAAA;MACzC;iBACQe,cAAWC,KAAK,aAAA,OAAA,GAAA;AACxB,cAAA,WAAA,MAAA;MACA;AAEA,WAAI,aAAa,MAAK;UACpB,KAAK,aAAMC,MAAWJ;mBACd,WAAKK,QAAAA;AACb,gBAAA,KAAA,gBAAA,OAAA;QACF;;;;;;;IACF;EAEA;;;;;;;;AAEE,YAAM,SAASJ,6BAAEK,KAAAA,MAAAA,KAAAA,OAAAA,QAAAA,GAAAA,KAAAA;AAEjB,YAAK,KAAMJ,MAAAA,QAAc;iBACjBA,cAAWC,KAAK,aAAA,OAAA,GAAA;AACxB,cAAA,WAAA,MAAA;MACA;;;;;;;IACF;EAEA;;;;;;;QAEEX;YAAwBY,kBAAAA;QAAQ;uBAC1BG,YAAAA,GAAAA,gBAAAA,GAAAA,KAAAA,GAAS,KAAA,CAAA;AAEf,YAAI,SAAKpB,6BAA+B,KAAA,MAAA,KAAA,OAAA,QAAA,GAAA,KAAA;UACtC,KAAA,iBAAA,IAAA,OAAA,GAAA;AACF;MACA;AAEA,WAAI,iBAAkB,IAAA,OAAM;UAC1B,KAAA,aAAWkB,MAAAA;AACb,cAAA,KAAA,gBAAA,OAAA;;;;;;;IACF;EAEA;;;;;;;;AAGE,YAAKlB,SAAAA,6BAAwBiB,KAAAA,MAAAA,KAAAA,OAAAA,QAAAA,GAAAA,KAAAA;AAE7B,WAAA,iBAAmB,OAAKhB,OAAY;AACpC,YAAIc,aAAY,KAAA,aAAA,IAAA,OAAA;UACd,YAAMA;AACN,cAAKd,WAAY,MAACoB;AACpB,aAAA,aAAA,OAAA,OAAA;;;;;;;IACF;EAEA;QACEC,gBAAevB,SAAQ,aAAA,GAAA;AACvBuB,IAAAA,YAAU,KAAK,UAACrB,QAAasB,EAAG,YAACN,YAAAA,GAAAA,gBAAAA,GAAAA,KAAAA,GAAAA,MAAAA,GAAAA,CAAAA,iBAAAA,EAAAA,EAAAA,CAAAA;AAEjC,IAAAK,YAAIE,CAAAA,KAAAA,aAAmB,IAAA,OAAA,GAAA,QAAA,EAAA,YAAA,YAAA,GAAAlC,gBAAA,GAAA,KAAA,GAAA,MAAA,GAAA,CAAA,mCAAA,EAAA,EAAA,CAAA;AAEvB,QAAA,mBAAuBmC;UACrBtB,aAAAA,IAAgB,mCAAoB;MACpCc,gBAAAA,KAAAA;MACAT;MACAkB,SAAAA,KAAAA;MACAC,qBAAmB,CAAA,KAAA;yBACP,YAAA;cAA4DV,MAAAA,0DAAAA;UAAQ;QAC9E,GAAA,EAAA,YAAa,YAAEW,GAAAA,gBAAiBb,GAAAA,KAAAA,GAAAA,KAAAA,CAAAA;AAClC,aAAA,UAAA,iBAAA,UAAA;MACAc;4BACY,YAAA;cAA+DZ,MAAAA,6DAAAA;UAAQ;QACjF,GAAA,EAAA,YAAa,YAAEa,GAAAA,gBAAmBf,GAAAA,KAAAA,GAAAA,KAAAA,CAAAA;AACpC,aAAA,UAAA,mBAAA,UAAA;MACAgB;0BACgB,YAAIP;YAChB,CAAA,KAAA,QAAA,kBAAA;AACF;QAEA;AAGAnB,cAAI,eAAA,KAAA,IAAAb,oBAAgCwC,yBAAA,UAAA,IAAA,KAAA,OAAA,IAAAzC;cAAE0B,gCAAAA;UAASgB;UAAYC;UAAa;QAExEV,GAAAA,EAAAA,YAAAA,YAAmB,GAAAlC,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AACnB6C,2BACOrC;;;;;;;;AAGH,kBAAI,SAAKG,6BAA8Bc,KAAAA,MAAY,KAAA,OAAA,QAAA,GAAA,KAAA;gBACjD,KAAA,aAAA,IAAA,OAAA,MAAA,YAAA;AACF;YAEA;AACA,kBAAMA,MAAAA,KAAWC;AACjB,kBAAKf,WAAY,MAACoB;AAClB,iBAAIe,aAAKC,OAAU,OAAA;gBACjB,KAAA,UAAA;AACF;YACAhC;kBAA4DY,MAAAA,gDAAAA;cAASgB;cAAYC;cAAa;YAC9F,GAAA,EAAA,YAAWhB,YAAAA,GAAgBD,gBAASgB,GAAAA,KAAAA,GAAAA,KAAa,CAAA;;;;;;;UAEnDC;QAEJ,GAAA,YAAA;MACF;IACA,CAAA;AAEA,SAAA,aAAiBI,IAAI,SAAA,UAAA;AACvB,UAAA,WAAA,KAAA;EACF;;cAlFSC;SAAOC,KAAAA;;;;+BAvDTC,cAAAA;;AAqJP,GAAA,4BAAMhB;IACaiB,mDAA6BC,WAAA;EAC7BjD,gBAAgCkD,YAAA;EAChCC;EACAC;EACAC;EACAhD;EACAiD;EACAC;EACAC;EACAC;EAETC;EAEDC;EACAC;EAEP;cASO,EAAA,gBAAA,SAAA,SAAA,qBAAA,mBAAA,sBAAA,mBAAA,GAAA;AACL,UAAK5D;AACL,SAAKqD,kBAAW9B;AAChB,SAAKlB,WAAWS;AAChB,SAAKwC,WAAAA;AACL,SAAA,uBAAA;AAEA,SAAKH,uBAAuBU,cAACT,aAAwB,uBAAoB,OAAA;AACzE,SAAKG,gBAAAA,GAAkB,KAAGtB,oBAAAA,IAAAA,KAAAA,aAAAA;AAC1B,SAAKuB,qBAAqB;AAC1B,SAAKC,wBAAsBpB;AAE3B,SAAKsB,sBAAeG;SAClBC,WAAQC,IAAAA,eAAAA;aACN,CAAI,eAACN;AACP,aAAA,4BAAA;MACF;IAEA,CAAA;SACEO,WAAO,IAAOC,eAAAA;aACZ,OAAU,YAACC;AACb,cAAA,KAAA,aAAA,KAAA,MAAA,OAAA;MACF;IACF,CAAA;EAEA;QACExD,MAAI,KAAA;AAEJ,IAAAA,MAAI,cAAMK,QACJ,EAAChB,YAAAA,YAAgBoE,GAAAA,gBAAWC,GAAAA,KAAAA,GAAAA,KAAAA,CAAAA;SAC9B,KAAKC,UAAWD,KAAAA,gBAAAA,UAAAA,CAAAA,QAAAA;AAClB,WAAA,WAAA,GAAA;IAGF,CAAA,CAAA;AACA,QAAI,iBACF;SACE,KAAIE,UAAAA,KAAgB,gBAAA,cAAA,YAAA;UAClB5D,gBAAY;AACZ4D,QAAAA,MAAAA,QAAAA,2BAAiB,QAAA,EAAA,YAAA,YAAA,GAAA3E,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AACjB,yBAAA;AACF;MAEA;AACF,WAAA,oBAAA;IAGF,CAAA,CAAA;AACF,UAAA,KAAA,mBAAA;EAEA;QACEe,OAAI,KAAA;AACJ,IAAAA,MAAI,cAAC+C,QAAAA,EAAAA,YAA+B,YAAA,GAAA9D,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AACpC,SAAA,0BAAW4D,MAAqB;AAClC,UAAA,KAAA,sBAAA;EAEA;MACE,SAAO;AACT,WAAA,KAAA;EAEA;MACE,oBAAO;AACT,WAAA;EAEA;QACE,gBAAUF,QAAAA;QACR,CAAA,KAAA,sBAAO;AACT,aAAA;IACA;AACA,UAAK/B,UAAS,MAAA,KAAA,SAAA,gCAAA,OAAA,UAAA;QACZ,CAAA,SAAMiD;YACJC,uBAAmBA,MAAU,KAAA,SAAA,6BAAA;QAC7B7D,YAAY,OAACuC;QACf,QAAA,KAAA;MACAxC,CAAAA;YACE8D,QAAAA,qDAA6B;QAC7BC,YAAAA,OAAgBF;QAChBG,gBAAexB;QACjB,UAAA,KAAA;MACA,GAAA,EAAA,YAAA,YAAA,GAAAvD,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AAEF,aAAA;IACA;AACF,WAAA,YAAA,KAAA;EAEAgF;uBACYtB,QAAAA;QACR,CAAA,KAAA,sBAAO;AACT,aAAA;IACA;AACA,UAAA,UAAA,2BAAA,OAAA,YAAA;AAEF,WAAA,YAAA,KAAA,YAAA,OAAA,aAAA,MAAA,GAAA,EAAA,WAAA;EAEQgB;aACFJ,SAAQW;QACV,QAAA,cAAA,KAAA,sBAAA;AACF;IAEA;AAEA,UAAA,UAAAC,MAAA,OAAA,QAAA,QAAA,KAAA;QAEEnE,SAAS,SAAA,wBAAA;AACT,MAAAA,MAAI,KAAC8C,wCAAmB,QAAA,EAAA,YAAA,YAAA,GAAA7D,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AACxB,WAAA,oBAAA;AACF;IAEAe;UAA2CgE,QAAAA,6BAA4B;MAAC,UAAA,KAAA;IAExE,GAAA,EAAA,YAAA,YAAA,GAAA/E,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;AAEAyE,UAAIU,MAAQ;AACZ,QAAI,WAACrB,KAAAA;AACP,SAAA,0BAAA,QAAA,GAAA;EAEA;QACE,aAAA,KAAA,SAAA;AAGA/C,YAAIqE,WAAQ,KAAA;UACVC,QAAMf,cAAY;MAClBW,MAAAA,QAAW;MACXF,WAAU,KAAKxB;MACjB,UAAA,KAAA;IAEA,GAAA,EAAA,YAAM+B,YAAeC,GAAMvF,gBAACsE,GAAAA,KAAAA,GAAAA,KAAAA,CAAAA;AAE5B,UAAI,UAAAY,MAAA,OAAA,OAAA;QACF;YAGID,KAAAA,gBAAgBzB,KAAAA,KAAAA,KAAoB,OAAAgC,sBAAA;QACpCC,WAAQ,KAAA;gBACNC;UACAC,aAAa,KAACvF,gBAAgBuF;UAChC,SAAA,KAAA,gBAAA;QACAC;iBAAWC;UAA8B,OAAAC,eAAA,OAAA;QAC3C;MAEF,CAAA,CAAA;aACIC,KAAM;YAA4BC,MAAAA,0BAAAA;QAAI;MAC5C,GAAA,EAAA,YAAA,YAAA,GAAAhG,gBAAA,GAAA,KAAA,GAAA,KAAA,CAAA;IACF;EACF;;;;ACpXA,SAAiCiG,oBAAAA,mBAAkBC,mBAAAA,wBAAuB;AAKnE,IAAMC,yBAAyB,CACpCC,UACAC,aAAAA;AAEA,aAAWC,MAAMF,SAASG,WAAW,CAAC,GAAG;AACvC,UAAMC,MAAMJ,SAASG,QAASD,EAAAA;AAC9B,UAAMG,UAAUP,iBAAgBQ,iBAAiBF,GAAAA;AACjD,QAAIC,SAAS;AACX,YAAME,UAAUV,kBAAiBW,MAAMH,OAAAA;AACvC,YAAMI,cAAcF,QAAQG,UAAS;AACrC,UAAID,aAAaE,SAASV,UAAU;AAClC,eAAO;UAACC;UAAIE;;MACd;IACF;EACF;AAEA,SAAOQ;AACT;",
+  "names": ["A", "Effect", "DatabaseDirectory", "SpaceDocVersion", "objectStructureToJson", "PublicKey", "log", "HEADS_DELIMITER", "cursor", "automergeHost", "getChangedObjects", "cursors", "cursorMap", "Map", "resourceId", "limit", "Infinity", "existingCursor", "hasChanged", "heads", "result", "documentId", "Effect", "promise", "doc", "get", "changedObjectIds", "updatedAt", "inspectDocChanges", "docObjects", "objects", "structure", "Object", "queueId", "queueNamespace", "recordId", "data", "objectStructureToJson", "updatedCursors", "log", "error", "Set", "patch", "patches", "change", "maxTime", "UpdateScheduler", "Stream", "Context", "invariant", "SpaceId", "log", "Repo", "interpretAsDocumentId", "initSubduction", "DeferredTask", "asyncTimeout", "Resource", "cancelWithContext", "DatabaseDirectory", "invariant", "PublicKey", "log", "trace", "ComplexSet", "bufferToArray", "CollectionSynchronizer", "diffCollectionState", "Array", "Record", "Event", "asyncReturn", "Resource", "log", "trace", "defaultMap", "MIN_QUERY_INTERVAL", "__dxlog_file", "POLL_INTERVAL", "CollectionSynchronizer", "_sendCollectionState", "_queryCollectionState", "_shouldSyncCollection", "_activeCollections", "Set", "_connectedPeers", "remoteStateUpdated", "params", "shouldSyncCollection", "scheduleTaskInterval", "collectionId", "_perCollectionStates", "has", "refreshCollection", "getRegisteredCollectionIds", "getLocalCollectionState", "get", "setLocalCollectionState", "state", "perCollectionState", "_getOrCreatePerCollectionState", "localState", "peerId", "_diffCollectionState", "queueMicrotask", "_refreshInterestedPeers", "_broadcastLocalState", "clearLocalCollectionState", "delete", "getRemoteCollectionStates", "scheduleAnotherRefresh", "interestedPeers", "lastQueried", "Date", "scheduleTask", "spanId", "id", "methodName", "instance", "parentCtx", "showInBrowserTimeline", "attributes", "_ctx", "disposed", "add", "remoteStates", "validateCollectionState", "set", "remoteState", "documents", "diff", "different", "missingOnLocal", "missingOnRemote", "length", "newDocsAppeared", "undefined", "Map", "lastBroadcast", "resource", "lifecycle", "diffCollectionState", "localDocuments", "filter", "local", "remoteDocuments", "remote", "heads", "keys", "documentId", "push", "Object", "forEach", "isValidDocumentId", "Error", "getSpanId", "Event", "synchronized", "LifecycleState", "invariant", "log", "isNonNullable", "createIdFromSpaceKey", "MESSAGE_TYPE_COLLECTION_QUERY", "MESSAGE_TYPE_COLLECTION_STATE", "isCollectionQueryMessage", "message", "type", "isCollectionStateMessage", "__dxlog_file", "_replicators", "_lifecycleState", "LifecycleState", "_connected", "Trigger", "_ready", "documentRequested", "Event", "_params", "isReady", "whenReady", "connect", "peerId", "peerMetadata", "send", "disconnect", "replicator", "timeout", "onConnectionAuthScopeChanged", "_connections", "entry", "_onConnectionAuthScopeChanged", "invariant", "has", "onConnectionOpen", "onConnectionClosed", "_onConnectionClosed", "bind", "isDocumentInRemoteCollection", "getContainingSpaceForDocument", "getContainingSpaceIdForDocument", "documentId", "key", "createIdFromSpaceKey", "connection", "shouldSyncCollection", "queryCollectionState", "type", "senderId", "targetId", "collectionId", "sendCollectionState", "state", "values", "filter", "isNonNullable", "bundleSyncEnabledForPeer", "Error", "_send", "connectionEntry", "writer", "write", "monitor", "recordMessageSent", "message", "catch", "err", "log", "_onConnectionOpen", "isOpen", "reader", "writable", "getWriter", "requestedDocuments", "Set", "done", "_emitPeerCandidate", "recordPeerConnected", "_onMessage", "amMessage", "onCollectionStateQueried", "isCollectionStateMessage", "onCollectionStateReceived", "emit", "abort", "cancel", "delete", "createEchoPeerMetadata", "getHandleState", "repo", "documentId", "handles", "undefined", "findWithProgress", "peek", "state", "log", "schema", "__dxlog_file", "headsCodec", "encode", "getHeadsCodec", "value", "encodedValue", "warn", "heads", "concatenatedHeads", "length", "format", "setHeads", "documentId", "sublevel", "keyEncoding", "valueEncoding", "headsEncoding", "Resource", "LevelDBStorageAdapter", "_params", "load", "keyArray", "isOpen", "undefined", "startMs", "Date", "now", "chunk", "db", "get", "encodingOptions", "monitor", "recordBytesLoaded", "byteLength", "recordLoadDuration", "err", "isLevelDbNotFoundError", "save", "binary", "batch", "callbacks", "beforeSave", "path", "put", "Buffer", "from", "write", "recordBytesStored", "afterSave", "recordStoreDuration", "saveBatch", "entries", "length", "bytesStored", "remove", "del", "loadRange", "keyPrefix", "result", "key", "value", "iterator", "gte", "lte", "push", "data", "removeRange", "keyEncoder", "encode", "map", "k", "replaceAll", "join", "decode", "toString", "split", "format", "keyEncoding", "valueEncoding", "code", "__dxlog_file", "Resource", "_db", "_echoNetworkAdapter", "_collectionSynchronizer", "bind", "sendCollectionState", "_sendCollectionState", "shouldSyncCollection", "_shouldSyncCollection", "_repo", "_storage", "_headsStore", "_syncTask", "_peerId", "_peerIdProvider", "_getSpaceKeyByRootDocumentId", "collectionStateUpdated", "Event", "_headsUpdates", "Map", "_onHeadsChangedTask", "_sharePolicyChangedTask", "_signer", "_useSubduction", "LevelDBStorageAdapter", "db", "sublevel", "callbacks", "beforeSave", "afterSave", "key", "_afterSave", "monitor", "getContainingSpaceForDocument", "_getContainingSpaceForDocument", "isDocumentInRemoteCollection", "_isDocumentInRemoteCollection", "onCollectionStateQueried", "_onCollectionStateQueried", "onCollectionStateReceived", "_onCollectionStateReceived", "dataMonitor", "defaultMap", "_documentsRequested", "peerId", "Set", "documentId", "_ctx", "from", "entries", "clear", "_onHeadsChanged", "docHeads", "MemorySigner", "generate", "Repo", "shareConfig", "subductionPolicy", "storage", "network", "signer", "subductionAdapters", "serviceName", "SUBDUCTION_SERVICE_NAME", "wrap", "on", "e", "updatingAuthScope", "_onPeerDisconnected", "remoteStateUpdated", "collectionId", "newDocsAppeared", "_onRemoteCollectionStateUpdated", "collectionToSync", "Array", "_collectionsToSync", "length", "err", "error", "log", "shareConfigChanged", "open", "whenConnected", "warn", "shutdown", "catch", "undefined", "invariant", "isOpen", "replicator", "state", "progress", "handle", "_documentsToRequest", "schedule", "timeout", "cancelWithContext", "findWithProgress", "interpretAsDocumentId", "id", "chunks", "loadRange", "preserveHistory", "initialValue", "docId", "opts", "TypeError", "_createdDocuments", "documentHeads", "getHeads", "documentIds", "headsToWait", "filter", "entry", "index", "targetHeads", "currentHeads", "Promise", "loadDoc", "ctx", "waitForHeads", "heads", "setHeads", "isEchoPeerMetadata", "peerMetadata", "shouldAdvertise", "authorizeFetch", "_sedimentreeId", "authorizePut", "_requestor", "filterAuthorizedFetch", "sedimentreeIds", "handles", "getHandleState", "doc", "document", "documentsSaved", "remoteCollections", "getRemoteCollectionStates", "remotePeerDocs", "documents", "params", "spaceKeyHex", "DatabaseDirectory", "PublicKey", "rootDocSpaceKey", "loadedDocuments", "result", "storeRequestIds", "storeResultIndices", "push", "storedHeads", "i", "refreshCollection", "peers", "remoteState", "localState", "diff", "diffCollectionState", "missingOnRemote", "missingOnLocal", "differentDocuments", "localDocumentCount", "Object", "remoteDocumentCount", "_", "totalDocumentCount", "keys", "size", "unsyncedDocumentCount", "different", "fromEntries", "map", "interestedPeers", "clearLocalCollectionState", "onRemoteStateReceived", "_queryCollectionState", "queryCollectionState", "_onPeerConnected", "getLocalCollectionState", "bundleSyncEnabled", "BUNDLE_SYNC_THRESHOLD", "amount", "syncInteractively", "_pushInBundles", "toReplicateWithoutBatching", "_pullInBundles", "count", "_documentsToSync", "documentsToPush", "range", "BUNDLE_SYNC_CONCURRENCY", "bundle", "BUNDLE_SIZE", "disposed", "data", "isNonNullable", "documentsToPull", "docsToImport", "assign", "collectionsChanged", "newState", "structuredClone", "info", "span", "showInBrowserTimeline", "showInRemoteTracing", "resource", "lifecycle", "unavailableHeads", "changeIsPresentInDoc", "changeHash", "delete", "checkPresentHeads", "getChangeByHash", "invariant", "PublicKey", "log", "ComplexSet", "defaultMap", "A", "cbor", "Resource", "invariant", "log", "AutomergeReplicator", "__dxlog_file", "DEFAULT_FACTORY", "readable", "writable", "remoteDeviceKey", "replicatorExtension", "_remotePeerId", "_isEnabled", "_params", "readableStreamController", "ReadableStream", "start", "controller", "onDispose", "logSendSync", "message", "payload", "encode", "_disconnectIfEnabled", "info", "id", "thisPeerId", "peerId", "remotePeerId", "onRemoteConnected", "onSyncMessage", "enqueue", "onClose", "onRemoteDisconnected", "isEnabled", "bundleSyncEnabled", "shouldAdvertise", "shouldSyncCollection", "params", "decodedSyncMessage", "sync", "requesting", "sendingChanges", "changes", "type", "from", "to", "targetId", "invariant", "SpaceId", "__dxlog_file", "deriveCollectionIdFromSpaceId", "spaceId", "__dxlog_file", "context", "_context", "disconnect", "connection", "onConnectionClosed", "_connections", "clear", "createExtension", "extensionFactory", "MeshReplicatorConnection", "ownPeerId", "peerId", "replicatorFactory", "onRemoteConnected", "log", "invariant", "existingConnections", "_connectionsPerPeer", "length", "enabledConnection", "onConnectionAuthScopeChanged", "set", "onRemoteDisconnected", "delete", "indexOf", "index", "disable", "shouldAdvertise", "documentId", "spaceKey", "getContainingSpaceForDocument", "params", "remoteDocumentExists", "isDocumentInRemoteCollection", "acceptDocument", "spaceId", "remoteDeviceKey", "isAuthorized", "localPeer", "remotePeer", "deviceKey", "catch", "shouldSyncCollection", "authorizedDevices", "_authorizedDevices", "collectionId", "authorizeDevice", "defaultMap", "ComplexSet", "equals", "trace", "CircularBuffer", "SlidingWindowSummary", "mapValues", "PER_SECOND_RATE_AVG_WINDOW_SIZE", "DEFAULT_AVG_WINDOW_SIZE", "EchoDataMonitor", "_lastTick", "_activeCounters", "createLocalCounters", "_lastCompleteCounters", "_localTimeSeries", "createLocalTimeSeries", "_storageAverages", "createStorageAverages", "_replicationAverages", "createNetworkAverages", "_sizeByMessage", "_lastReceivedMessages", "CircularBuffer", "_lastSentMessages", "_connectionsCount", "_params", "timeSeriesLength", "tick", "timeMs", "_advanceTimeWindow", "computeStats", "meta", "rateAverageOverSeconds", "storage", "reads", "payloadSize", "loadedChunkSize", "average", "opDuration", "loadDuration", "countPerSecond", "loadsPerSecond", "writes", "storedChunkSize", "storeDuration", "storesPerSecond", "replicator", "connections", "receivedMessages", "receivedMessageSize", "receivedPerSecond", "sentMessages", "sentMessageSize", "sendDuration", "sentPerSecond", "failedPerSecond", "sendsFailedPerSecond", "countByMessage", "_computeMessageHistogram", "avgSizeByMessage", "mapValues", "summary", "connectionsCount", "lastPerSecondStats", "timeSeries", "replication", "messagesByPeerId", "millisPassed", "oldMetrics", "Object", "freeze", "peerId", "keys", "byPeerId", "createMessageCounter", "_addToTimeSeries", "Math", "abs", "_reportPerSecondRate", "values", "key", "value", "entries", "push", "length", "shift", "metrics", "toReport", "loadedChunks", "storedChunks", "received", "sent", "metricName", "metric", "record", "trace", "distribution", "increment", "tags", "status", "failed", "recordPeerConnected", "recordPeerDisconnected", "recordBytesStored", "count", "storedBytes", "unit", "recordLoadDuration", "durationMs", "recordStoreDuration", "recordBytesLoaded", "loadedBytes", "recordMessageSent", "message", "duration", "metricsGroupName", "bytes", "getByteCount", "type", "isAutomergeProtocolMessage", "success", "messageSize", "messageCounts", "_getStatsForType", "targetId", "recordMessageReceived", "senderId", "recordMessageSendingFailed", "createSlidingWindow", "byType", "groupKey", "result", "receivedMessage", "counters", "resource", "isCollectionQueryMessage", "isCollectionStateMessage", "overrides", "SlidingWindowSummary", "dataPoints", "precision", "data", "byteLength", "documentId", "next", "A", "UpdateScheduler", "LifecycleState", "Resource", "invariant", "log", "retry", "__dxlog_file", "MAX_UPDATE_FREQ", "WRAP_AROUND_RETRY_INITIAL_DELAY", "_syncStates", "_params", "addDocuments", "documentIds", "delayMs", "exponent", "_startSync", "docQuery", "_pendingUpdates", "add", "_sendUpdatesJob", "trigger", "err", "warn", "removeDocuments", "documentId", "delete", "maxFrequency", "update", "updates", "_writeMutation", "syncState", "_subscribeForChanges", "_checkAndSendUpdates", "docsWithPendingUpdates", "_getPendingChanges", "push", "mutation", "handle", "headsBefore", "getHeads", "automergeHost", "createDoc", "preserveHistory", "__dxlog_file", "_spaceStateManager", "_updateIndexes", "params", "updateIndexes", "subscribe", "synchronizer", "automergeHost", "_automergeHost", "sendUpdates", "updates", "ready", "catch", "err", "log", "invariant", "request", "length", "addDocuments", "addIds", "documentId", "handle", "update", "options", "ctx", "Context", "default", "flush", "getDocumentHeads", "heads", "reIndexHeads", "_options", "subscribeSpaceSyncState", "spaceId", "SpaceId", "isValid", "rootDocumentId", "collectionId", "deriveCollectionIdFromSpaceId", "spaceDocumentListUpdated", "event", "spaceRootId", "newId", "scheduler", "trigger", "UpdateScheduler", "next", "SqlClient", "Effect", "asyncTimeout", "DeferredTask", "sleep", "LifecycleState", "Resource", "todo", "SpaceDocVersion", "createIdFromSpaceKey", "RuntimeProvider", "FeedStore", "IndexEngine", "invariant", "log", "trace", "hintFromIndexingResult", "r", "updated", "undefined", "spaceIds", "spaces", "size", "queueIds", "queues", "typenames", "types", "objectIds", "objects", "mergeHints", "a", "b", "unionOrUndefined", "Set", "Effect", "Function", "Context", "EchoFeedCodec", "RuntimeProvider", "assertArgument", "invariant", "FeedProtocol", "__dxlog_file", "feedStore", "queryQueue", "query", "spaceId", "queueIds", "cursor", "after", "requestId", "crypto", "randomUUID", "feedNamespace", "request", "queuesNamespace", "position", "limit", "objects", "result", "nextCursor", "lastBlock", "identity", "insertIntoQueue", "isWellKnownNamespace", "messages", "encoded", "queueId", "data", "appendLocal", "deleteFromQueue", "objectIds", "syncQueue", "DeferredTask", "scheduleMicroTask", "Stream", "synchronized", "Resource", "raise", "QueryAST", "log", "trace", "QueryExecutor", "Runtime", "ContextDisposedError", "LifecycleState", "Resource", "Query", "DatabaseDirectory", "EncodedReference", "ObjectStructure", "isEncodedReference", "ATTR_PARENT", "ATTR_RELATION_SOURCE", "ATTR_RELATION_TARGET", "runAndForwardErrors", "unwrapExit", "EscapedPropPath", "invariant", "DXN", "log", "compositeKey", "getDeep", "isNonNullable", "BaseError", "QueryError", "extend", "InvalidQueryError", "Order", "Query", "QueryAST", "invariant", "QueryPlan", "Plan", "Object", "freeze", "make", "steps", "FilterStep", "isNoop", "step", "filter", "type", "typename", "id", "undefined", "length", "props", "keys", "foreignKeys", "__dxlog_file", "message", "context", "query", "prettyQuery", "DEFAULT_OPTIONS", "createPlan", "plan", "originalQuery", "_optimizeEmptyFilters", "_ensureOrderStep", "_optimizeLimits", "_generate", "_generateSelectClause", "_generateFilterClause", "_generateIncomingReferencesClause", "_generateRelationClause", "_generateRelationTraversalClause", "_generateReferenceTraversalClause", "_generateHierarchyTraversalClause", "_generateUnionClause", "_generateSetDifferenceClause", "_generateOrderClause", "_generateLimitClause", "_generateFromClause", "QueryError", "_generateOptionsClause", "newContext", "scope", "selection", "subquery", "filter", "node", "QueryPlan", "_generateDeletedHandlingSteps", "selector", "_tag", "objectIds", "undefined", "typename", "inverted", "searchKind", "queryTooComplexError", "selectionInverted", "childOfFilters", "flatFilters", "f", "otherFilters", "type", "timestampFilters", "length", "innerPlan", "innerFilter", "_generateSelectionFromFilter", "selectIdx", "findIndex", "s", "newSteps", "steps", "filters", "_mergeTimestampSelectors", "remainingFilters", "childOfSteps", "invariant", "Plan", "exclude", "anchor", "direction", "property", "props", "createRelationTraversalStep", "_validateQueryScoped", "hasScope", "FilterStep", "isNoop", "step", "plans", "processedSteps", "source", "processedPlan", "OBJECT_SET_CHANGERS", "insertIndex", "i", "order", "Order", "limitStepIndex", "limitValue", "selectStepIndex", "BLOCKERS", "limit", "orderStepIndex", "deletedHandling", "id", "result", "push", "_flattenAnd", "_timestampFilterToSelector", "key", "merged", "updatedAfter", "updatedBefore", "createdAfter", "createdBefore", "isTrivialTypenameFilter", "__dxlog_file", "QueryItem", "ObjectStructure", "item", "Error", "getProperty", "getDeep", "data", "property", "getParent", "ATTR_PARENT", "getRelationSource", "ATTR_RELATION_SOURCE", "getRelationTarget", "ATTR_RELATION_TARGET", "name", "details", "objectCount", "documentsLoaded", "indexHits", "beginTs", "endTs", "indexQueryTime", "documentLoadTime", "executionTime", "children", "markEnd", "trace", "putOnPerformanceTimeline", "detail", "devtools", "dataType", "track", "trackGroup", "color", "properties", "tooltipText", "format", "repeat", "indent", "map", "child", "join", "MAX_DEPTH_FOR_CHILD_OF_TRACING", "extractScopes", "plan", "spaceIds", "queueIds", "typenames", "objectIds", "step", "scopes", "Set", "spaceId", "scope", "derivedQueueIds", "derivedSpaceIds", "queueDxnStr", "DXN", "parse", "add", "queueDxn", "queueId", "parseFailed", "id", "isSimple", "typename", "selector", "setsOverlap", "a", "b", "overlapsOrUnconstrained", "_runtime", "Resource", "_automergeHost", "_spaceStateManager", "_reactivity", "_trace", "_lastResultSet", "_indexEngine", "options", "_id", "queryId", "_query", "query", "queryPlanner", "_plan", "createPlan", "getResults", "documentId", "undefined", "queueNamespace", "rank", "documentJson", "execQuery", "log", "LifecycleState", "pretty", "prevResultSet", "Query", "workingSet", "_execPlan", "stringify", "fromAst", "console", "ExecutionTrace", "_ctx", "ContextDisposedError", "result", "push", "length", "newWorkingSet", "begin", "spaces", "allQueuesFromSpaces", "makeEmpty", "metas", "_queryAllFromSqlIndex", "performance", "beginIndexQuery", "disposed", "results", "documentLoadStart", "isNonNullable", "asQueueDXN", "_loadFromDXN", "sourceSpaceId", "_queryTypesFromSqlIndex", "_runInRuntime", "updatedAfter", "updatedBefore", "createdAfter", "createdBefore", "includeAllQueues", "warn", "extractQueueIds", "queues", "invariant", "textResults", "queueResults", "filter", "r", "rankMap", "Map", "queueItems", "snapshots", "snapshotMap", "snapshot", "doc", "items", "spaceItems", "_execChildOfFilterStep", "timestampParams", "extractTimestampParams", "_execTimestampFilterStep", "filterContainsTimestamp", "context", "filterMatchObject", "queryByTimeRange", "matchingIds", "params", "Promise", "index", "deletedState", "expected", "parentDxnStr", "echoDxn", "asEchoDXN", "parentObjectIds", "_item", "parents", "transitive", "parentRefs", "directParent", "dxnStr", "objectId", "fromSpaceAndObjectId", "parentItem", "refs", "flatMap", "isArray", "ref", "isEncodedReference", "_loadDocumentsAfterSqlQuery", "dxn", "existing", "bySpace", "set", "parentIds", "allMetas", "resultSets", "all", "compositeKey", "resultSet", "sourceResult", "excludeResult", "sort", "_compareMultiOrder", "limit", "sortedWorkingSet", "order", "limitedWorkingSet", "orders", "comparison", "_compareByOrder", "_compareByProperty", "effect", "runtimeProvider", "runtime", "runAndForwardErrors", "runPromiseExit", "typeDxns", "inverted", "_queryIncomingReferencesFromSqlIndex", "anchorDxns", "targetDxn", "flat", "recordIds", "queryPath", "QueryExecutor", "_matchesReferencePropertyPath", "rowPath", "row", "recordId", "uniqueRecordIds", "Array", "i", "j", "_queryRelationsFromSqlIndex", "queryRelations", "endpoint", "_loadQueueSnapshotMap", "meta", "handle", "object", "DatabaseDirectory", "kind", "ECHO", "spaceRoot", "dbDirectory", "inlineObject", "x", "strongDeps", "remainingDepth", "strongDepStates", "f", "timestamps", "field", "operator", "ts", "value", "type", "__dxlog_file", "_updateQueries", "totalInvalidations", "catchAllInvalidations", "hintedInvalidations", "totalDirtyQueriesExecuted", "totalExecutionBatches", "averageDirtyPerBatch", "averageQueriesActive", "_params", "trace", "diagnostic", "id", "name", "fetch", "Array", "query", "plan", "JSON", "stringify", "executor", "DeferredTask", "Promise", "from", "log", "execQuery", "Stream", "queryEntry", "_createQuery", "ctx", "scheduleMicroTask", "open", "hint", "parsedQuery", "QueryAST", "Schema", "decodeUnknownSync", "QueryExecutor", "indexEngine", "runtime", "automergeHost", "queryId", "request", "raise", "reactivity", "spaceStateManager", "dirty", "firstResult", "sendResults", "disposed", "onResults", "results", "onError", "close", "onClose", "_queries", "delete", "dirtyCount", "activeCount", "changed", "catch", "err", "verbose", "active", "duration", "span", "showInBrowserTimeline", "showInRemoteTracing", "resource", "Effect", "EchoFeedCodec", "RuntimeProvider", "failedInvariant", "log", "FeedProtocol", "__dxlog_file", "QueueDataSource", "_runtime", "_getSpaceIds", "options", "_feedNamespaces", "WellKnownNamespaces", "getChangedObjects", "updatedCursors", "augmentedCursors", "filter", "resourceId", "feedNamespace", "c", "spaceId", "cursor", "remainingLimit", "push", "_feedStore", "currentCursor", "limit", "data", "objects", "queueId", "block", "queueNamespace", "documentId", "recordId", "updatedAt", "err", "result", "nextCursor", "error", "cursors", "interpretAsDocumentId", "isEqual", "Event", "UpdateScheduler", "Context", "LifecycleState", "Resource", "invariant", "interpretAsDocumentId", "DatabaseDirectory", "SpaceDocVersion", "invariant", "A", "log", "__dxlog_file", "start", "temp", "snapshot", "end", "Date", "now", "getAllChangesStart", "mutationCount", "getAllChangesEnd", "loadTime", "__dxlog_file", "DatabaseRoot", "mapLinks", "mapping", "links", "documentId", "interpretAsDocumentId", "url", "isLoaded", "handle", "doc", "getVersion", "version", "getSpaceKey", "SpaceDocVersion", "DatabaseDirectory", "getInlineObjectCount", "Object", "getLinkedObjectCount", "getAllLinkedDocuments", "invariant", "values", "s", "measureMetrics", "measureDocMetrics", "__dxlog_file", "SpaceStateManager", "_rootBySpace", "Resource", "_perRootContext", "_lastSpaceDocumentList", "spaceDocumentListUpdated", "Event", "rootCtx", "_roots", "roots", "spaceIds", "getRootByDocumentId", "documentId", "getSpaceRootDocumentId", "spaceId", "getRootBySpaceId", "invariant", "LifecycleState", "undefined", "assignRootToSpace", "query", "root", "DatabaseRoot", "prevRootId", "dispose", "set", "handle", "ctx", "documentListCheckScheduler", "UpdateScheduler", "documentIds", "getAllLinkedDocuments", "isEqual", "SpaceDocumentListUpdatedEvent", "maxFrequency", "triggerCheckOnChange", "onDispose", "removeListener", "spaceRootId", "previousRootId", "__dxlog_file", "_queryService", "Resource", "_dataService", "_spaceStateManager", "_echoDataMonitor", "_automergeDataSource", "_indexEngine", "_runtime", "_feedStore", "_queueDataSource", "_updateIndexes", "_queuesService", "_indexesUpToDate", "EchoDataMonitor", "_automergeHost", "db", "kv", "dataMonitor", "peerIdProvider", "getSpaceKeyByRootDocumentId", "useSubduction", "assignPositions", "assignQueuePositions", "localActorId", "crypto", "randomUUID", "QueueDataSource", "runtime", "getSpaceIds", "LocalQueueServiceImpl", "IndexEngine", "automergeHost", "indexEngine", "spaceStateManager", "DataServiceImpl", "updateIndexes", "trace", "name", "fetch", "dataStats", "loadedDocsCount", "root", "isLoaded", "spaceKey", "inlineObjects", "linkedObjects", "getLinkedObjectCount", "measureMetrics", "spaceIds", "queryService", "dataService", "queuesService", "roots", "feedStore", "_open", "log", "ctx", "runPromise", "testSqlite", "Error", "RuntimeProvider", "migrate", "DeferredTask", "_ctx", "_runUpdateIndexes", "onNewBlocks", "spaceDocumentListUpdated", "clearLocalCollectionState", "deriveCollectionIdFromSpaceId", "updateLocalCollectionState", "spaceId", "spaceRootId", "documentIds", "documentsSaved", "schedule", "_close", "exportDoc", "id", "createIdFromSpaceKey", "invariant", "automergeRoot", "createDoc", "version", "SpaceDocVersion", "access", "toHex", "objects", "documentId", "loadDoc", "fetchFromNetwork", "LifecycleState", "refreshCollection", "performance", "limit", "pipe", "_mergeInto", "combinedResult", "devtools", "dataType", "track", "trackGroup", "color", "properties", "verbose", "done", "spaces", "queues", "documents", "types", "size", "invalidateQueries", "hint", "err", "catch", "Set", "acc", "r", "s", "add", "q", "d", "o", "SqlClient", "databases", "schemaVersion", "objectCount", "RUN_SQLITE_QUICK_CHECK_ON_STARTUP", "result", "cbor", "Mutex", "scheduleMicroTask", "Resource", "scheduleTask", "randomUUID", "invariant", "log", "DocumentCodec", "buf", "MessageSchema", "trace", "bufferToArray", "getSpaceIdFromCollectionId", "Trigger", "Resource", "log", "__dxlog_file", "InflightRequestLimiter", "_resetBalanceTimeout", "_config", "_open", "_requestBarrier", "_close", "clearTimeout", "message", "_inflightRequestBalance", "setTimeout", "resetBalanceTimeoutMs", "handleResponse", "clearInterval", "__dxlog_file", "RESTART_DELAY_JITTER", "MAX_RESTART_DELAY", "EchoEdgeReplicator", "_edgeConnection", "_edgeHttpClient", "_mutex", "_ctx", "undefined", "_context", "_connectedSpaces", "_connections", "Map", "_sharePolicyEnabled", "edgeConnection", "edgeHttpClient", "log", "peerId", "connectedSpaces", "context", "derive", "onDispose", "scheduleMicroTask", "_handleReconnect", "spaces", "connection", "close", "spaceId", "_openConnection", "dispose", "_guard", "delete", "invariant", "has", "restartScheduled", "EdgeReplicatorConnection", "sharedPolicyEnabled", "onRemoteConnected", "onConnectionOpen", "onRemoteDisconnected", "onConnectionClosed", "onRestartRequested", "reconnects", "restartDelay", "scheduleTask", "replicatorCtx", "disposed", "open", "ctx", "span", "showInBrowserTimeline", "op", "resource", "MAX_INFLIGHT_REQUESTS", "MAX_RATE_LIMIT_WAIT_TIME_MS", "_connectionId", "Resource", "_remotePeerId", "_targetServiceId", "_spaceId", "_sharedPolicyEnabled", "_onRemoteConnected", "_onRemoteDisconnected", "_onRestartRequested", "_sequence", "_requestLimiter", "maxInflightRequests", "resetBalanceTimeoutMs", "_readableStreamController", "readable", "writable", "compositeKey", "ReadableStream", "start", "controller", "write", "message", "rateLimit", "_sendMessage", "_onMessage", "msg", "firstReconnect", "remoteDocumentExists", "documentId", "acceptDocument", "remoteId", "shouldSyncCollection", "serviceId", "verbose", "cbor", "getMessageInfo", "payload", "_processMessage", "request", "bundle", "mutation", "heads", "docHeads", "fromEntries", "response", "map", "DocumentCodec", "error", "enqueue", "setDeep", "encoded", "encode", "source", "identityKey", "peerKey", "value", "bufferToArray", "err", "_getSequence", "type", "collectionId", "have", "need", "changes", "sequence", "metadata", "Mutex", "scheduleMicroTask", "Resource", "scheduleTask", "randomUUID", "invariant", "log", "EdgeService", "buf", "MessageSchema", "trace", "RouterMessageSchema", "bufferToArray", "getSpaceIdFromCollectionId", "__dxlog_file", "RESTART_DELAY_JITTER", "MAX_RESTART_DELAY", "EchoEdgeSubductionReplicator", "_edgeConnection", "_edgeHttpClient", "_mutex", "_disableSharePolicy", "_ctx", "_context", "_connectedSpaces", "_connections", "Map", "edgeConnection", "edgeHttpClient", "log", "peerId", "connectedSpaces", "context", "derive", "onDispose", "scheduleMicroTask", "_handleReconnect", "spaces", "_ts_add_disposable_resource", "connection", "close", "spaceId", "_openConnection", "dispose", "_guard", "delete", "invariant", "has", "restartScheduled", "EdgeSubductionReplicatorConnection", "sharedPolicyEnabled", "onRemoteConnected", "onConnectionOpen", "onRemoteDisconnected", "onConnectionClosed", "onRestartRequested", "INITIAL_RESTART_DELAY", "reconnects", "restartDelay", "scheduleTask", "ctx", "disposed", "open", "span", "showInBrowserTimeline", "resource", "_connectionId", "Resource", "randomUUID", "_remotePeerId", "_subductionServiceId", "_spaceId", "_sharedPolicyEnabled", "_onRemoteConnected", "_onRemoteDisconnected", "_onRestartRequested", "_readableStreamController", "readable", "writable", "compositeKey", "ReadableStream", "start", "controller", "write", "message", "_sendMessage", "onMessage", "msg", "_onMessage", "firstReconnect", "remoteDocumentExists", "documentId", "acceptDocument", "remoteId", "shouldSyncCollection", "serviceId", "cbor", "senderId", "verbose", "type", "encoded", "encode", "RouterMessageSchema", "source", "identityKey", "peerKey", "payload", "value", "bufferToArray", "error", "err", "EncodedReference", "ObjectStructure", "findInlineObjectOfType", "spaceDoc", "typename", "id", "objects", "obj", "objType", "getTypeReference", "typeDXN", "toDXN", "typeDXNInfo", "asTypeDXN", "type", "undefined"]
+}