@portqueue/core 1.0.2 → 1.1.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (64) hide show
  1. package/dist/conformance/index.cjs +70 -1
  2. package/dist/conformance/index.cjs.map +1 -1
  3. package/dist/conformance/index.d.ts +4 -2
  4. package/dist/conformance/index.mjs +70 -1
  5. package/dist/conformance/index.mjs.map +1 -1
  6. package/dist/constants/job.constants.d.ts +3 -1
  7. package/dist/constants/storage.constants.d.ts +8 -0
  8. package/dist/constants/time.constants.d.ts +13 -0
  9. package/dist/constants/worker.constants.d.ts +5 -0
  10. package/dist/drivers/driver.interface.d.ts +47 -0
  11. package/dist/drivers/mysql/index.cjs +169 -76
  12. package/dist/drivers/mysql/index.cjs.map +1 -1
  13. package/dist/drivers/mysql/index.mjs +169 -76
  14. package/dist/drivers/mysql/index.mjs.map +1 -1
  15. package/dist/drivers/mysql/mysql-driver.d.ts +42 -19
  16. package/dist/drivers/oracle/index.cjs +144 -65
  17. package/dist/drivers/oracle/index.cjs.map +1 -1
  18. package/dist/drivers/oracle/index.mjs +144 -65
  19. package/dist/drivers/oracle/index.mjs.map +1 -1
  20. package/dist/drivers/oracle/oracle-driver.d.ts +34 -15
  21. package/dist/drivers/pglite/index.cjs +3 -3
  22. package/dist/drivers/pglite/index.mjs +3 -3
  23. package/dist/drivers/postgresql/index.cjs +1 -1
  24. package/dist/drivers/postgresql/index.mjs +1 -1
  25. package/dist/drivers/postgresql/postgresql-driver.d.ts +33 -7
  26. package/dist/drivers/shared/base-driver.d.ts +2 -0
  27. package/dist/drivers/shared/migration-runner.service.d.ts +19 -4
  28. package/dist/drivers/shared/migration.d.ts +5 -3
  29. package/dist/drivers/sqlite/index.cjs +113 -42
  30. package/dist/drivers/sqlite/index.cjs.map +1 -1
  31. package/dist/drivers/sqlite/index.mjs +113 -42
  32. package/dist/drivers/sqlite/index.mjs.map +1 -1
  33. package/dist/drivers/sqlite/sqlite-driver.d.ts +26 -0
  34. package/dist/drivers/table-names.d.ts +3 -2
  35. package/dist/index.cjs +519 -316
  36. package/dist/index.cjs.map +1 -1
  37. package/dist/index.d.ts +2 -2
  38. package/dist/index.mjs +521 -318
  39. package/dist/index.mjs.map +1 -1
  40. package/dist/{migration-D73ANkYV.js → migration-D0IRP2oq.js} +6 -2
  41. package/dist/migration-D0IRP2oq.js.map +1 -0
  42. package/dist/{migration-CoTjpgBl.cjs → migration-Dx8eUthW.cjs} +6 -2
  43. package/dist/migration-Dx8eUthW.cjs.map +1 -0
  44. package/dist/monitoring/system-monitor.service.d.ts +6 -5
  45. package/dist/options/enums.d.ts +22 -0
  46. package/dist/options/job-options.d.ts +2 -1
  47. package/dist/port-queue.d.ts +76 -4
  48. package/dist/{postgresql-driver-BUHuyRYj.js → postgresql-driver-CPHv5SUT.js} +128 -55
  49. package/dist/postgresql-driver-CPHv5SUT.js.map +1 -0
  50. package/dist/{postgresql-driver-CIk94XCq.cjs → postgresql-driver-DRT68TKb.cjs} +128 -55
  51. package/dist/postgresql-driver-DRT68TKb.cjs.map +1 -0
  52. package/dist/producer/producer.service.d.ts +12 -0
  53. package/dist/producer/results.d.ts +35 -1
  54. package/dist/{storage.constants-B5oQjxp5.cjs → storage.constants-BKeXcSQe.cjs} +13 -1
  55. package/dist/storage.constants-BKeXcSQe.cjs.map +1 -0
  56. package/dist/{storage.constants-DwSzjjMZ.js → storage.constants-DYEQUmc8.js} +14 -2
  57. package/dist/storage.constants-DYEQUmc8.js.map +1 -0
  58. package/package.json +1 -1
  59. package/dist/migration-CoTjpgBl.cjs.map +0 -1
  60. package/dist/migration-D73ANkYV.js.map +0 -1
  61. package/dist/postgresql-driver-BUHuyRYj.js.map +0 -1
  62. package/dist/postgresql-driver-CIk94XCq.cjs.map +0 -1
  63. package/dist/storage.constants-B5oQjxp5.cjs.map +0 -1
  64. package/dist/storage.constants-DwSzjjMZ.js.map +0 -1
@@ -1 +0,0 @@
1
- {"version":3,"file":"postgresql-driver-BUHuyRYj.js","sources":["../src/drivers/postgresql/migrations.ts","../src/drivers/postgresql/postgresql-driver.ts"],"sourcesContent":["import { TableName } from '../table-names';\nimport type { FlavourMigration, MigrationNames } from '../shared/migration';\n// NOTE: column names, statuses and enum values here are intentionally raw string literals, NOT the\n// `*Column`/`JobStatus` enums the drivers use. A migration is a frozen record of a\n// schema that has already been applied; renaming an enum member must never retroactively rewrite a\n// past migration's DDL.\n\n/**\n * Predefined PostgreSQL DDL, version by version. Authored by hand for this engine; not generated at\n * runtime. There is a single version so far — the base schema — but the array is the extension\n * point: a future change appends `{ version: 2, ... }` with its own statement builder rather than\n * editing `v1`, which is a frozen record of what has already been applied.\n *\n * The statement builders are exported because PGLite is PostgreSQL compiled to WASM and reuses them\n * verbatim (see `../pglite/migrations.ts`) — every other engine authors its own copy under its own\n * folder, so a change here reaches PostgreSQL and PGLite and no one else.\n *\n * **Keys and indexes.** PostgreSQL is a capable engine, so the schema uses them: a primary key per\n * table (which is also what makes `INSERT … ON CONFLICT DO NOTHING` a legal get-or-create for the\n * queue and instance rows), plus one index per hot access path — the claim query, the two\n * maintenance sweeps, the retention sweep, both dedup lookups, the newest-first job page and the\n * due-schedule scan. Nothing beyond the primary keys is a *uniqueness* constraint: idempotency and\n * singleton dedup stay enforced in driver code, so behaviour is identical on an engine that cannot\n * honour such a constraint — and so a dedup never surfaces as a constraint violation.\n */\n\n/** Version 1 — the full base schema, its keys and its indexes. */\nexport function v1(names: MigrationNames): string[] {\n const t = names.name;\n const idx = names.derived;\n const statements: string[] = [];\n\n // The schema must exist before anything can be created in it. Only emitted when one was asked\n // for; without a `schema` option every object lands in the connection's search path as before.\n if (names.schema) statements.push(`CREATE SCHEMA IF NOT EXISTS ${names.schema}`);\n\n statements.push(\n `CREATE TABLE IF NOT EXISTS ${t(TableName.QUEUE)} (\n name TEXT NOT NULL PRIMARY KEY,\n processing_paused SMALLINT NOT NULL DEFAULT 0,\n accepting_paused SMALLINT NOT NULL DEFAULT 0,\n created_at BIGINT NOT NULL,\n updated_at BIGINT NOT NULL\n )`,\n `CREATE TABLE IF NOT EXISTS ${t(TableName.JOB)} (\n id TEXT NOT NULL PRIMARY KEY,\n queue_name TEXT NOT NULL,\n status TEXT NOT NULL,\n priority INTEGER NOT NULL DEFAULT 0,\n data TEXT,\n return_value TEXT,\n created_at BIGINT NOT NULL,\n updated_at BIGINT NOT NULL,\n start_after BIGINT NOT NULL,\n expire_at BIGINT,\n started_at BIGINT,\n completed_at BIGINT,\n failed_at BIGINT,\n retried_at BIGINT,\n stalled_at BIGINT,\n cancelled_at BIGINT,\n expired_at BIGINT,\n locked_until BIGINT,\n lock_token TEXT,\n preferred_instance_key_pattern TEXT,\n processed_on_instance_key TEXT,\n retry_attempt INTEGER NOT NULL DEFAULT 0,\n retry_max_attempts INTEGER NOT NULL DEFAULT 1,\n retry_delay_seconds BIGINT NOT NULL DEFAULT 0,\n retry_backoff TEXT NOT NULL DEFAULT 'FIXED',\n retry_backoff_factor REAL,\n retry_max_delay_seconds BIGINT,\n retry_jitter SMALLINT NOT NULL DEFAULT 0,\n failure_message TEXT,\n retention_ttl_seconds BIGINT,\n retention_statuses INTEGER,\n idempotency_key TEXT,\n schedule_id TEXT,\n singleton_key TEXT\n )`,\n `CREATE TABLE IF NOT EXISTS ${t(TableName.SCHEDULE)} (\n id TEXT NOT NULL PRIMARY KEY,\n queue_name TEXT NOT NULL,\n cron TEXT,\n every_seconds BIGINT,\n timezone TEXT,\n data TEXT,\n job_options TEXT,\n priority INTEGER,\n retry_max_attempts INTEGER,\n retry_delay_seconds BIGINT,\n next_run_at BIGINT,\n last_run_at BIGINT,\n enabled SMALLINT NOT NULL DEFAULT 1,\n created_at BIGINT NOT NULL,\n updated_at BIGINT NOT NULL,\n idempotency_key TEXT\n )`,\n `CREATE TABLE IF NOT EXISTS ${t(TableName.INSTANCE)} (\n instance_key TEXT NOT NULL PRIMARY KEY,\n processing_paused SMALLINT NOT NULL DEFAULT 0,\n created_at BIGINT NOT NULL,\n updated_at BIGINT NOT NULL,\n last_seen_at BIGINT NOT NULL,\n cpu_percent REAL,\n memory_percent REAL\n )`,\n `CREATE TABLE IF NOT EXISTS ${t(TableName.MIGRATION)} (\n version INTEGER NOT NULL PRIMARY KEY,\n created_at BIGINT NOT NULL,\n updated_at BIGINT NOT NULL\n )`,\n );\n\n // Index names stay unqualified: PostgreSQL files an index in its table's own schema, and naming\n // the schema on both sides of `CREATE INDEX … ON …` is an error.\n statements.push(\n // The claim query, in its exact order: narrow by queue and claimable status, then take the\n // highest priority and oldest due row.\n `CREATE INDEX IF NOT EXISTS ${idx(TableName.JOB, 'claim_idx')} ` +\n `ON ${t(TableName.JOB)} (queue_name, status, priority DESC, start_after ASC)`,\n // reclaimStalledJobs: ACTIVE rows whose lock has lapsed.\n `CREATE INDEX IF NOT EXISTS ${idx(TableName.JOB, 'stalled_idx')} ` +\n `ON ${t(TableName.JOB)} (status, locked_until)`,\n // expireDueJobs: due-but-unstarted rows past their deadline.\n `CREATE INDEX IF NOT EXISTS ${idx(TableName.JOB, 'expiry_idx')} ` +\n `ON ${t(TableName.JOB)} (status, expire_at)`,\n // The retention sweep, which only ever looks at rows that carry a TTL and are finished.\n `CREATE INDEX IF NOT EXISTS ${idx(TableName.JOB, 'retention_idx')} ` +\n `ON ${t(TableName.JOB)} (status, retention_ttl_seconds) ` +\n `WHERE retention_ttl_seconds IS NOT NULL`,\n // Idempotency dedup.\n `CREATE INDEX IF NOT EXISTS ${idx(TableName.JOB, 'idempotency_idx')} ` +\n `ON ${t(TableName.JOB)} (queue_name, idempotency_key) ` +\n `WHERE idempotency_key IS NOT NULL`,\n // Singleton dedup, which also filters on the \"holds a slot\" statuses.\n `CREATE INDEX IF NOT EXISTS ${idx(TableName.JOB, 'singleton_idx')} ` +\n `ON ${t(TableName.JOB)} (queue_name, singleton_key, status) ` +\n `WHERE singleton_key IS NOT NULL`,\n // The newest-first job page every list read uses.\n `CREATE INDEX IF NOT EXISTS ${idx(TableName.JOB, 'created_idx')} ` +\n `ON ${t(TableName.JOB)} (created_at DESC)`,\n // Jobs a schedule produced (the schedule detail view).\n `CREATE INDEX IF NOT EXISTS ${idx(TableName.JOB, 'schedule_idx')} ` +\n `ON ${t(TableName.JOB)} (schedule_id) WHERE schedule_id IS NOT NULL`,\n // Per-instance attribution: the instance detail view and its grouped counts.\n `CREATE INDEX IF NOT EXISTS ${idx(TableName.JOB, 'instance_idx')} ` +\n `ON ${t(TableName.JOB)} (processed_on_instance_key, status) ` +\n `WHERE processed_on_instance_key IS NOT NULL`,\n // getDueSchedules: armed schedules whose next run has arrived.\n `CREATE INDEX IF NOT EXISTS ${idx(TableName.SCHEDULE, 'due_idx')} ` +\n `ON ${t(TableName.SCHEDULE)} (enabled, next_run_at)`,\n // Schedules of one queue, in the list's own order.\n `CREATE INDEX IF NOT EXISTS ${idx(TableName.SCHEDULE, 'queue_idx')} ` +\n `ON ${t(TableName.SCHEDULE)} (queue_name, created_at)`,\n // The schedule dedup lookup.\n `CREATE INDEX IF NOT EXISTS ${idx(TableName.SCHEDULE, 'idempotency_idx')} ` +\n `ON ${t(TableName.SCHEDULE)} (queue_name, idempotency_key) ` +\n `WHERE idempotency_key IS NOT NULL`,\n // The instance list's liveness filter.\n `CREATE INDEX IF NOT EXISTS ${idx(TableName.INSTANCE, 'seen_idx')} ` +\n `ON ${t(TableName.INSTANCE)} (last_seen_at)`,\n );\n\n return statements;\n}\n\nexport const POSTGRESQL_MIGRATIONS: FlavourMigration[] = [{ version: 1, statements: v1 }];\n","import { createHash } from 'node:crypto';\nimport { DatabaseEngine, DeduplicationReason } from '../../options/enums';\nimport { ACTIVE_STATUSES, FINISHED_STATUSES, JobStatus } from '../../jobs/job-state.enum';\nimport { capabilities, DriverCapability, type DriverCapabilitySet } from '../driver-capabilities';\nimport {\n DriverConnectionError,\n DriverQueryError,\n MissingPeerDependencyError,\n} from '../../errors/errors';\nimport {\n TableName,\n QueueColumn,\n JobColumn,\n ScheduleColumn,\n InstanceColumn,\n MigrationColumn,\n} from '../table-names';\nimport {\n BaseDriver,\n JOB_COLUMNS,\n SCHEDULE_INSERT_COLUMNS,\n type RawResult,\n type Row,\n type Session,\n} from '../shared/base-driver';\nimport { retentionStatusBit } from '../shared/retention-statuses';\nimport { MS_PER_SECOND } from '../../util/seconds';\nimport { toMigrationSteps } from '../shared/migration';\nimport { POSTGRESQL_MIGRATIONS } from './migrations';\nimport type {\n Driver,\n DriverProbe,\n InstanceListFilter,\n JobListFilter,\n JobRef,\n MigrationStep,\n PageWindow,\n QueueListFilter,\n RequeuedJobRef,\n ScheduleListFilter,\n ScheduleRef,\n StalledJobRef,\n Subscription,\n} from '../driver.interface';\nimport type {\n InsertedJobRow,\n InstanceMetrics,\n InstanceRow,\n JobRecord,\n NewJobRecord,\n NewScheduleRow,\n QueueRow,\n ScheduleRow,\n} from '../../jobs/job-record';\nimport type { QueueOptions } from '../../options/queue-options';\nimport type { TransactionHandle } from '../../tx/transaction-handle';\n\nexport interface PostgresqlDriverOptions {\n connectionString?: string;\n /** An existing `pg.Pool` to share with the app. */\n pool?: unknown;\n /** Any `pg.PoolConfig` (host/user/password/database/…). */\n config?: Record<string, unknown>;\n /**\n * DB schema for all objects. Every table name is qualified with it and the migration creates it\n * (`CREATE SCHEMA IF NOT EXISTS`), so this is honoured rather than merely accepted.\n */\n schema?: string;\n /** Prefix for all created tables (default 'pq_'). */\n tablePrefix?: string;\n /** Logical prefix for pub/sub channels when multiple PortQueues share one DB. */\n namespace?: string;\n}\n\ninterface PgQueryResult {\n rows: Array<Record<string, unknown>>;\n rowCount: number | null;\n}\ninterface PgClient {\n query(sql: string, params?: readonly unknown[]): Promise<PgQueryResult>;\n release(): void;\n on(event: string, cb: (msg: { channel: string; payload?: string }) => void): void;\n}\ninterface PgPool {\n query(sql: string, params?: readonly unknown[]): Promise<PgQueryResult>;\n connect(): Promise<PgClient>;\n end(): Promise<void>;\n}\n\nexport type { RawResult, Session };\n\n/** `undefined_table` — the only error `getSchemaVersion` may read as \"never migrated\". */\nconst PG_UNDEFINED_TABLE = '42P01';\n/** `invalid_schema_name` — the schema itself is absent, which is the same \"not migrated\" state. */\nconst PG_UNDEFINED_SCHEMA = '3F000';\n\n/**\n * PostgreSQL driver — the full-feature reference driver and the sole owner of the PG-wire SQL\n * surface: `$1`-style placeholders, LISTEN/NOTIFY on a dedicated connection, advisory locks for\n * leader-only tasks, SKIP LOCKED claiming, RETURNING everywhere, real keys and indexes. No method\n * emits a relational JOIN — relationships resolve by name/key lookups — and idempotency/singleton\n * dedup is enforced here in code rather than by a constraint, so behaviour matches an engine that\n * could not honour one. The `pg` package is an optional peer, imported lazily inside `connect()`.\n *\n * Row mapping, value conversion, insert value lists and the affinity scan arithmetic come from\n * {@link BaseDriver} — mechanism, not SQL. Every statement string in this file is PostgreSQL'.\n *\n * PG-wire subclassing: `PgliteDriver` extends this class and overrides only the connection\n * mechanism (`connect`/`disconnect`/`execute`/`transaction`/`probe`) plus the features PGLite\n * lacks. Every query method below is therefore shared with PGLite — treat a change here as a\n * change to both engines, and if a tweak is genuinely PostgreSQL-only, override it in `PgliteDriver`\n * rather than branching on the engine here. No other engine shares this code.\n */\nexport class PostgresqlDriver extends BaseDriver implements Driver {\n readonly engine: DatabaseEngine = DatabaseEngine.POSTGRESQL;\n readonly capabilities: DriverCapabilitySet = capabilities({\n [DriverCapability.SKIP_LOCKED]: true,\n [DriverCapability.RETURNING]: true,\n [DriverCapability.TRANSACTIONS]: true,\n [DriverCapability.LISTEN_NOTIFY]: true,\n [DriverCapability.ADVISORY_LOCK]: true,\n });\n readonly migrations: MigrationStep[] = toMigrationSteps(POSTGRESQL_MIGRATIONS);\n\n private pool: PgPool | null = null;\n private listenClient: PgClient | null = null;\n /**\n * Connections held for the advisory locks this driver has taken, keyed by lock name. An advisory\n * lock is session-scoped, so the connection that took it is the only one that can release it.\n */\n private readonly lockClients = new Map<string, PgClient>();\n private readonly listeners = new Map<string, Set<(payload: string) => void>>();\n private readonly options: PostgresqlDriverOptions;\n\n constructor(options: PostgresqlDriverOptions = {}) {\n super({\n ...(options.tablePrefix !== undefined ? { tablePrefix: options.tablePrefix } : {}),\n ...(options.schema !== undefined ? { schema: options.schema } : {}),\n ...(options.namespace !== undefined ? { namespace: options.namespace } : {}),\n });\n this.options = options;\n }\n\n // --- Connection management ---\n async connect(): Promise<void> {\n if (this.options.pool) {\n this.pool = this.options.pool as PgPool;\n return;\n }\n let pg: { Pool: new (config?: Record<string, unknown>) => PgPool };\n try {\n // Dynamic specifier so TS doesn't require the optional peer's types at build time.\n const mod = (await import('pg' as string)) as { default?: { Pool: PgPool }; Pool?: PgPool };\n pg = (mod.default ?? mod) as unknown as {\n Pool: new (config?: Record<string, unknown>) => PgPool;\n };\n } catch {\n throw new MissingPeerDependencyError('pg', 'PostgreSQL');\n }\n try {\n const config: Record<string, unknown> = { ...this.options.config };\n if (this.options.connectionString) config.connectionString = this.options.connectionString;\n this.pool = new pg.Pool(config);\n await this.pool.query('SELECT 1');\n } catch (err) {\n throw new DriverConnectionError('Failed to connect to PostgreSQL.', err);\n }\n }\n\n async disconnect(): Promise<void> {\n this.listenClient?.release();\n this.listenClient = null;\n // Releasing the connection drops the session, and with it any advisory lock still held on it —\n // which is the backstop for a process that dies mid-migration.\n for (const client of this.lockClients.values()) client.release();\n this.lockClients.clear();\n if (this.pool && !this.options.pool) await this.pool.end();\n this.pool = null;\n }\n\n /** Run one statement. `protected` so a PG-wire subclass can swap in its own client. */\n protected async execute(\n sql: string,\n params: readonly unknown[],\n session?: Session,\n ): Promise<RawResult> {\n const target = (session as PgClient | undefined) ?? this.pool;\n if (!target) throw new DriverConnectionError('PostgreSQL driver is not connected.');\n const res = await target.query(sql, params);\n return { rows: res.rows ?? [], rowCount: res.rowCount ?? res.rows?.length ?? 0 };\n }\n\n /** Wrap `fn` in a transaction. `protected` so a PG-wire subclass can swap in its own client. */\n protected async transaction<T>(fn: (session: Session) => Promise<T>): Promise<T> {\n if (!this.pool) throw new DriverConnectionError('PostgreSQL driver is not connected.');\n const client = await this.pool.connect();\n try {\n await client.query('BEGIN');\n const result = await fn(client);\n await client.query('COMMIT');\n return result;\n } catch (err) {\n await client.query('ROLLBACK').catch(() => undefined);\n throw err;\n } finally {\n client.release();\n }\n }\n\n /** PostgreSQL uses `$1`-style positional placeholders. */\n protected ph(index0: number): string {\n return `$${index0 + 1}`;\n }\n\n /**\n * The trailing `LIMIT`/`OFFSET` for a list read, appending each bound value to `params`.\n * Returns an empty string when the caller asked for no window, so core's unpaged reads emit\n * exactly the SQL they always did.\n */\n protected window(page: PageWindow, params: unknown[]): string {\n let sql = '';\n if (page.limit !== undefined) {\n sql += ` LIMIT ${this.ph(params.length)}`;\n params.push(Math.max(Math.trunc(page.limit), 0));\n }\n if (page.offset !== undefined) {\n sql += ` OFFSET ${this.ph(params.length)}`;\n params.push(Math.max(Math.trunc(page.offset), 0));\n }\n return sql;\n }\n\n // --- Probe / migration ---\n async probe(): Promise<DriverProbe> {\n let serverVersion = 'unknown';\n if (this.pool) {\n const res = await this.pool.query('SHOW server_version');\n serverVersion = String(res.rows[0]?.server_version ?? 'unknown');\n }\n return { serverVersion, verifiedCapabilities: this.enabledCapabilities() };\n }\n\n /**\n * The applied schema version, or null when the migration table (or its schema) does not exist yet.\n * Only those two error codes read as \"not migrated\": a dropped connection or a permissions error\n * has to surface, because reading it as version 0 would start a full migration run against a\n * database that may already be fully migrated.\n */\n async getSchemaVersion(): Promise<number | null> {\n try {\n const res = await this.execute(\n `SELECT MAX(${MigrationColumn.VERSION}) AS v FROM ${this.t(TableName.MIGRATION)}`,\n [],\n );\n const v = res.rows[0]?.v;\n return v == null ? null : Number(v);\n } catch (err) {\n if (this.isMissingSchemaObject(err)) return null;\n throw new DriverQueryError('Failed to read the applied schema version.', err);\n }\n }\n\n /** Whether an error means \"the object isn't there yet\" rather than \"the query failed\". */\n protected isMissingSchemaObject(err: unknown): boolean {\n const code = (err as { code?: unknown } | null)?.code;\n return code === PG_UNDEFINED_TABLE || code === PG_UNDEFINED_SCHEMA;\n }\n\n /**\n * Apply one migration's DDL and record its version in the **same** transaction, so a crash\n * between the two can never leave an applied-but-unrecorded migration.\n */\n async applyMigration(options: { migration: MigrationStep }): Promise<void> {\n const { migration } = options;\n const statements = migration.statements(this.context);\n await this.transaction(async (session) => {\n for (const sql of statements) await this.execute(sql, [], session);\n const now = Date.now();\n await this.execute(\n `INSERT INTO ${this.t(TableName.MIGRATION)} (${MigrationColumn.VERSION}, ${MigrationColumn.CREATED_AT}, ${MigrationColumn.UPDATED_AT}) ` +\n `VALUES (${this.phList(3)}) ON CONFLICT (${MigrationColumn.VERSION}) DO NOTHING`,\n [migration.version, now, now],\n session,\n );\n });\n }\n\n // --- Producing ---\n async insertJob(options: { job: NewJobRecord; tx?: TransactionHandle }): Promise<InsertedJobRow> {\n const [result] = await this.insertJobs({\n jobs: [options.job],\n ...(options.tx ? { tx: options.tx } : {}),\n });\n return result!;\n }\n\n /**\n * A real batch insert: one grouped dedup lookup per distinct queue, then a single multi-row\n * `INSERT … RETURNING`. The dedup pre-check and the insert share one transaction, which is both\n * the \"read-then-write runs in a transaction\" invariant and what narrows the dedup race to the\n * width of a single statement pair.\n */\n async insertJobs(options: {\n jobs: NewJobRecord[];\n tx?: TransactionHandle;\n }): Promise<InsertedJobRow[]> {\n const { jobs, tx } = options;\n if (!jobs.length) return [];\n return this.inTx(tx, async (run) => {\n await this.lockQueuesForDedup(run, jobs);\n const deduped = await this.findDeduplicated(jobs, run);\n const results = new Array<InsertedJobRow | undefined>(jobs.length);\n const fresh: Array<{ index: number; id: string; values: unknown[] }> = [];\n\n for (const [index, job] of jobs.entries()) {\n const hit = deduped.get(job);\n if (hit) {\n results[index] = hit;\n continue;\n }\n const { id, values } = this.jobInsertValues(job);\n fresh.push({ index, id, values });\n }\n\n // Chunked so one statement never exceeds the engine's bound-parameter limit; each chunk is\n // still a single multi-row insert.\n for (const chunk of this.chunkForBind(fresh, JOB_COLUMNS.length)) {\n if (!chunk.length) continue;\n const params: unknown[] = [];\n const tuples = chunk.map(({ values }) => {\n const placeholders = this.phList(values.length, params.length);\n params.push(...values);\n return `(${placeholders})`;\n });\n try {\n const inserted = await run(\n `INSERT INTO ${this.t(TableName.JOB)} (${JOB_COLUMNS.join(', ')}) VALUES ${tuples.join(', ')} ` +\n `RETURNING ${JobColumn.ID}, ${JobColumn.STATUS}, ${JobColumn.START_AFTER}`,\n params,\n );\n // Paired back by id rather than by position, so nothing depends on RETURNING preserving\n // the VALUES order.\n const byId = new Map(inserted.rows.map((row) => [String(row[JobColumn.ID]), row]));\n for (const { index, id } of chunk) {\n const row = byId.get(id);\n if (!row) throw new DriverQueryError(`Insert did not return job '${id}'.`);\n results[index] = {\n id,\n status: row[JobColumn.STATUS] as JobStatus,\n startAfter: Number(row[JobColumn.START_AFTER]),\n deduplicated: false,\n };\n }\n } catch (err) {\n if (err instanceof DriverQueryError) throw err;\n throw new DriverQueryError(\n `Failed to insert ${chunk.length} job(s) on queue '${jobs[chunk[0]!.index]!.queueName}'.`,\n err,\n );\n }\n }\n return results as InsertedJobRow[];\n });\n }\n\n /**\n * Locate the existing jobs that dedup this batch, in one lookup per distinct queue and key kind\n * rather than two per job. No unique index enforces either key — dedup lives in code so every\n * engine behaves identically and a duplicate returns the existing job instead of raising.\n */\n /**\n * Serialize the dedup-lookup-then-insert pair against another producer's, per queue.\n *\n * Only called when a batch actually carries an idempotency or singleton key. Without it the pair is\n * a read-then-write under `READ COMMITTED`: two concurrent `addJob`s with the same key both see no\n * row and both insert, and the dedup silently fails. Locking the **queue row** — which every keyed\n * insert on that queue must take — closes it with no schema change and no uniqueness constraint\n * that a singleton's status predicate could not express anyway. A queue with no keyed jobs never\n * pays for it, and a queue whose row does not exist yet locks nothing, which is no worse than\n * before.\n */\n private async lockQueuesForDedup(\n run: (sql: string, params: readonly unknown[]) => Promise<RawResult>,\n jobs: NewJobRecord[],\n ): Promise<void> {\n const names = [\n ...new Set(\n jobs.flatMap((j) =>\n j.idempotencyKey != null || j.singletonKey != null ? [j.queueName] : [],\n ),\n ),\n ].sort(); // a stable order, so two batches over the same queues cannot deadlock each other\n if (!names.length) return;\n await run(\n `SELECT ${QueueColumn.NAME} FROM ${this.t(TableName.QUEUE)} ` +\n `WHERE ${QueueColumn.NAME} IN (${this.phList(names.length)}) FOR UPDATE`,\n names,\n );\n }\n\n private async findDeduplicated(\n jobs: NewJobRecord[],\n run: (sql: string, params: readonly unknown[]) => Promise<RawResult>,\n ): Promise<Map<NewJobRecord, InsertedJobRow>> {\n const out = new Map<NewJobRecord, InsertedJobRow>();\n const cols = `${JobColumn.ID}, ${JobColumn.STATUS}, ${JobColumn.START_AFTER}`;\n\n const byQueue = new Map<string, NewJobRecord[]>();\n for (const job of jobs) {\n if (job.idempotencyKey == null && job.singletonKey == null) continue;\n const list = byQueue.get(job.queueName);\n if (list) list.push(job);\n else byQueue.set(job.queueName, [job]);\n }\n\n for (const [queueName, queueJobs] of byQueue) {\n const idemKeys = [\n ...new Set(queueJobs.flatMap((j) => (j.idempotencyKey ? [j.idempotencyKey] : []))),\n ];\n if (idemKeys.length) {\n const res = await run(\n `SELECT ${cols}, ${JobColumn.IDEMPOTENCY_KEY} FROM ${this.t(TableName.JOB)} ` +\n `WHERE ${JobColumn.QUEUE_NAME} = ${this.ph(0)} AND ${JobColumn.IDEMPOTENCY_KEY} IN (${this.phList(idemKeys.length, 1)})`,\n [queueName, ...idemKeys],\n );\n const found = new Map(res.rows.map((r) => [String(r[JobColumn.IDEMPOTENCY_KEY]), r]));\n for (const job of queueJobs) {\n if (job.idempotencyKey == null) continue;\n const row = found.get(job.idempotencyKey);\n if (row) out.set(job, this.dedupResult(row, DeduplicationReason.IDEMPOTENCY));\n }\n }\n\n const singletonKeys = [\n ...new Set(\n queueJobs.flatMap((j) => (!out.has(j) && j.singletonKey ? [j.singletonKey] : [])),\n ),\n ];\n if (singletonKeys.length) {\n const statusPh = this.phList(ACTIVE_STATUSES.length, 1 + singletonKeys.length);\n const res = await run(\n `SELECT ${cols}, ${JobColumn.SINGLETON_KEY} FROM ${this.t(TableName.JOB)} ` +\n `WHERE ${JobColumn.QUEUE_NAME} = ${this.ph(0)} AND ${JobColumn.SINGLETON_KEY} IN (${this.phList(singletonKeys.length, 1)}) ` +\n `AND ${JobColumn.STATUS} IN (${statusPh})`,\n [queueName, ...singletonKeys, ...ACTIVE_STATUSES],\n );\n const found = new Map(res.rows.map((r) => [String(r[JobColumn.SINGLETON_KEY]), r]));\n for (const job of queueJobs) {\n if (out.has(job) || job.singletonKey == null) continue;\n const row = found.get(job.singletonKey);\n if (row) out.set(job, this.dedupResult(row, DeduplicationReason.SINGLETON));\n }\n }\n }\n return out;\n }\n\n /** Shape a dedup hit the way `insertJob`'s caller reports it. */\n protected dedupResult(row: Row, reason: DeduplicationReason): InsertedJobRow {\n return {\n id: String(row[JobColumn.ID]),\n status: row[JobColumn.STATUS] as JobStatus,\n startAfter: Number(row[JobColumn.START_AFTER]),\n deduplicated: true,\n deduplicationReason: reason,\n };\n }\n\n async findJobByIdempotencyKey(options: {\n queueName: string;\n idempotencyKey: string;\n tx?: TransactionHandle;\n }): Promise<InsertedJobRow | null> {\n const res = await this.runMaybeTx(\n `SELECT ${JobColumn.ID}, ${JobColumn.STATUS}, ${JobColumn.START_AFTER} FROM ${this.t(TableName.JOB)} ` +\n `WHERE ${JobColumn.QUEUE_NAME} = ${this.ph(0)} AND ${JobColumn.IDEMPOTENCY_KEY} = ${this.ph(1)}`,\n [options.queueName, options.idempotencyKey],\n options.tx,\n );\n return res.rows[0] ? this.dedupResult(res.rows[0], DeduplicationReason.IDEMPOTENCY) : null;\n }\n\n async findScheduleByIdempotencyKey(options: {\n queueName: string;\n idempotencyKey: string;\n tx?: TransactionHandle;\n }): Promise<ScheduleRow | null> {\n const res = await this.runMaybeTx(\n `SELECT * FROM ${this.t(TableName.SCHEDULE)} WHERE ${ScheduleColumn.QUEUE_NAME} = ${this.ph(0)} AND ${ScheduleColumn.IDEMPOTENCY_KEY} = ${this.ph(1)}`,\n [options.queueName, options.idempotencyKey],\n options.tx,\n );\n return res.rows[0] ? this.mapSchedule(res.rows[0]) : null;\n }\n\n async insertSchedule(options: {\n schedule: NewScheduleRow;\n tx?: TransactionHandle;\n }): Promise<ScheduleRow> {\n // Plain INSERT — NOT an UPSERT and no pattern-based dedup. Identical recurrences on a queue are\n // allowed to coexist by design; the caller enforces idempotency-key dedup ahead of this call\n // (see ProducerService), so nothing here needs a conflict target.\n const { values } = this.scheduleInsertValues(options.schedule, Date.now());\n const res = await this.runMaybeTx(\n `INSERT INTO ${this.t(TableName.SCHEDULE)} (${SCHEDULE_INSERT_COLUMNS.join(', ')}) ` +\n `VALUES (${this.phList(values.length)}) RETURNING *`,\n values,\n options.tx,\n );\n return this.mapSchedule(res.rows[0]!);\n }\n\n async deleteSchedule(options: {\n scheduleId: string;\n tx?: TransactionHandle;\n }): Promise<ScheduleRef | null> {\n const [ref] = await this.deleteSchedules({\n scheduleIds: [options.scheduleId],\n ...(options.tx ? { tx: options.tx } : {}),\n });\n return ref ?? null;\n }\n\n async deleteSchedules(options: {\n scheduleIds: string[];\n tx?: TransactionHandle;\n }): Promise<ScheduleRef[]> {\n if (!options.scheduleIds.length) return [];\n // Chunked so one statement can never carry more ids than the engine allows in an\n // `IN (...)` list. A capped batch is a single chunk, and so a single statement.\n return this.overIdChunks(options.scheduleIds, async (scheduleIds) => {\n // One statement for the whole set, returning each removed row's queue so the caller can emit\n // its event without a read-back per id.\n const res = await this.runMaybeTx(\n `DELETE FROM ${this.t(TableName.SCHEDULE)} WHERE ${ScheduleColumn.ID} IN (${this.phList(scheduleIds.length)}) ` +\n `RETURNING ${ScheduleColumn.ID}, ${ScheduleColumn.QUEUE_NAME}`,\n scheduleIds,\n options.tx,\n );\n return res.rows.map((r) => this.mapScheduleRef(r));\n });\n }\n\n async setScheduleEnabled(options: {\n scheduleId: string;\n enabled: boolean;\n now: number;\n tx?: TransactionHandle;\n }): Promise<ScheduleRef | null> {\n const res = await this.runMaybeTx(\n `UPDATE ${this.t(TableName.SCHEDULE)} SET ${ScheduleColumn.ENABLED} = ${this.ph(0)}, ${ScheduleColumn.UPDATED_AT} = ${this.ph(1)} ` +\n `WHERE ${ScheduleColumn.ID} = ${this.ph(2)} RETURNING ${ScheduleColumn.ID}, ${ScheduleColumn.QUEUE_NAME}`,\n [this.boolIn(options.enabled), options.now, options.scheduleId],\n options.tx,\n );\n return res.rows[0] ? this.mapScheduleRef(res.rows[0]) : null;\n }\n\n // --- Claiming (hot path) ---\n async claimJobs(options: {\n queueName: string;\n limit: number;\n lockDurationSeconds: number;\n now: number;\n instanceKey?: string | null;\n }): Promise<JobRecord[]> {\n const { queueName, limit, lockDurationSeconds, now, instanceKey } = options;\n const lockedUntil = this.lockDeadline(now, lockDurationSeconds);\n // One token per claim call: every row this claim takes carries it, and every completion is\n // fenced on it (see `claimFence`). A later claim of the same row writes a different one.\n const lockToken = this.newId();\n const cols = JOB_COLUMNS.join(', ');\n\n // Single-instance mode: one guarded UPDATE ... RETURNING inside a transaction. `SKIP LOCKED`\n // makes the inner select skip rows another claimer already holds, and the outer UPDATE is what\n // actually takes them — so no two workers can ever return the same row.\n if (!instanceKey) {\n return this.transaction(async (session) => {\n const res = await this.execute(\n `UPDATE ${this.t(TableName.JOB)} SET ${JobColumn.STATUS} = ${this.ph(0)}, ${JobColumn.STARTED_AT} = ${this.ph(1)}, ` +\n `${JobColumn.LOCKED_UNTIL} = ${this.ph(2)}, ${JobColumn.LOCK_TOKEN} = ${this.ph(3)}, ${JobColumn.UPDATED_AT} = ${this.ph(4)} ` +\n `WHERE ${JobColumn.ID} IN (SELECT ${JobColumn.ID} FROM ${this.t(TableName.JOB)} ` +\n `WHERE ${JobColumn.QUEUE_NAME} = ${this.ph(5)} AND ${JobColumn.STATUS} IN (${this.ph(6)}, ${this.ph(7)}) ` +\n `AND ${JobColumn.START_AFTER} <= ${this.ph(8)} AND (${JobColumn.EXPIRE_AT} IS NULL OR ${JobColumn.EXPIRE_AT} > ${this.ph(9)}) ` +\n `ORDER BY ${JobColumn.PRIORITY} DESC, ${JobColumn.START_AFTER} ASC LIMIT ${this.ph(10)} FOR UPDATE SKIP LOCKED) ` +\n `RETURNING ${cols}`,\n [\n JobStatus.ACTIVE,\n now,\n lockedUntil,\n lockToken,\n now,\n queueName,\n JobStatus.PENDING,\n JobStatus.RETRY,\n now,\n now,\n limit,\n ],\n session,\n );\n return this.sortClaimed(res.rows.map((r) => this.mapJob(r)));\n });\n }\n\n // Multi-instance mode: affinity is a regex, which portable SQL cannot evaluate, so page through\n // candidates highest-priority-first and filter here. The scan takes `FOR UPDATE SKIP LOCKED`\n // and the guarded UPDATE runs in the same transaction, so a candidate this instance picks\n // cannot be claimed by another between the two statements.\n const { pageSize, maxScan } = this.affinityPlan(limit);\n return this.transaction(async (session) => {\n const ids = new Set<string>();\n for (let offset = 0; ids.size < limit && offset < maxScan; offset += pageSize) {\n const sel = await this.execute(\n `SELECT ${JobColumn.ID}, ${JobColumn.PREFERRED_INSTANCE_KEY_PATTERN} FROM ${this.t(TableName.JOB)} ` +\n `WHERE ${JobColumn.QUEUE_NAME} = ${this.ph(0)} AND ${JobColumn.STATUS} IN (${this.ph(1)}, ${this.ph(2)}) ` +\n `AND ${JobColumn.START_AFTER} <= ${this.ph(3)} AND (${JobColumn.EXPIRE_AT} IS NULL OR ${JobColumn.EXPIRE_AT} > ${this.ph(4)}) ` +\n `ORDER BY ${JobColumn.PRIORITY} DESC, ${JobColumn.START_AFTER} ASC ` +\n `LIMIT ${this.ph(5)} OFFSET ${this.ph(6)} FOR UPDATE SKIP LOCKED`,\n [queueName, JobStatus.PENDING, JobStatus.RETRY, now, now, pageSize, offset],\n session,\n );\n if (sel.rows.length === 0) break; // exhausted — nothing more to scan\n this.collectAffinityMatches(sel.rows, instanceKey, limit, ids);\n if (sel.rows.length < pageSize) break; // last (partial) page\n }\n if (ids.size === 0) return [];\n const idList = [...ids];\n const head = [JobStatus.ACTIVE, now, lockedUntil, lockToken, instanceKey, now];\n const upd = await this.execute(\n `UPDATE ${this.t(TableName.JOB)} SET ${JobColumn.STATUS} = ${this.ph(0)}, ${JobColumn.STARTED_AT} = ${this.ph(1)}, ` +\n `${JobColumn.LOCKED_UNTIL} = ${this.ph(2)}, ${JobColumn.LOCK_TOKEN} = ${this.ph(3)}, ` +\n `${JobColumn.PROCESSED_ON_INSTANCE_KEY} = ${this.ph(4)}, ${JobColumn.UPDATED_AT} = ${this.ph(5)} ` +\n `WHERE ${JobColumn.ID} IN (${this.phList(idList.length, head.length)}) ` +\n `AND ${JobColumn.STATUS} IN (${this.ph(head.length + idList.length)}, ${this.ph(head.length + idList.length + 1)}) ` +\n `RETURNING ${cols}`,\n [...head, ...idList, JobStatus.PENDING, JobStatus.RETRY],\n session,\n );\n return this.sortClaimed(upd.rows.map((r) => this.mapJob(r)));\n });\n }\n\n /**\n * The fence a completion is guarded on: the row must still be `ACTIVE` and, when the caller names\n * the claim it is settling, still carry that claim's token.\n *\n * Status alone is not enough. A lapsed lock is reclaimed and the row claimed again, so it reads\n * `ACTIVE` once more — and a handler from the first run that ignored its abort signal would write\n * its outcome over the second run's. The token identifies the claim itself, so a stale completion\n * matches nothing and reports \"not settled\" instead.\n */\n private claimFence(params: unknown[], lockToken: string | null | undefined): string {\n let sql = ` AND ${JobColumn.STATUS} = ${this.ph(params.length)}`;\n params.push(JobStatus.ACTIVE);\n if (lockToken != null) {\n sql += ` AND ${JobColumn.LOCK_TOKEN} = ${this.ph(params.length)}`;\n params.push(lockToken);\n }\n return sql;\n }\n\n async extendLock(options: {\n jobId: string;\n lockDurationSeconds: number;\n now: number;\n lockToken?: string | null;\n }): Promise<boolean> {\n const params: unknown[] = [\n this.lockDeadline(options.now, options.lockDurationSeconds),\n options.now,\n options.jobId,\n ];\n const res = await this.runMaybeTx(\n `UPDATE ${this.t(TableName.JOB)} SET ${JobColumn.LOCKED_UNTIL} = ${this.ph(0)}, ${JobColumn.UPDATED_AT} = ${this.ph(1)} ` +\n `WHERE ${JobColumn.ID} = ${this.ph(2)}${this.claimFence(params, options.lockToken)}`,\n params,\n );\n return res.rowCount > 0;\n }\n\n async completeJob(options: {\n jobId: string;\n returnValue?: unknown;\n now: number;\n lockToken?: string | null;\n tx?: TransactionHandle;\n }): Promise<boolean> {\n const params: unknown[] = [\n JobStatus.COMPLETED,\n this.toJson(options.returnValue),\n options.now,\n options.now,\n options.jobId,\n ];\n const res = await this.runMaybeTx(\n `UPDATE ${this.t(TableName.JOB)} SET ${JobColumn.STATUS} = ${this.ph(0)}, ${JobColumn.RETURN_VALUE} = ${this.ph(1)}, ` +\n `${JobColumn.COMPLETED_AT} = ${this.ph(2)}, ${JobColumn.UPDATED_AT} = ${this.ph(3)}, ${JobColumn.LOCKED_UNTIL} = NULL, ${JobColumn.LOCK_TOKEN} = NULL ` +\n `WHERE ${JobColumn.ID} = ${this.ph(4)}${this.claimFence(params, options.lockToken)}`,\n params,\n options.tx,\n );\n return res.rowCount > 0;\n }\n\n async retryJob(options: {\n jobId: string;\n nextRunAt: number;\n retryAttempt: number;\n lastError: string;\n now: number;\n lockToken?: string | null;\n }): Promise<boolean> {\n const params: unknown[] = [\n JobStatus.RETRY,\n options.retryAttempt,\n options.nextRunAt,\n options.now,\n options.lastError,\n options.now,\n options.jobId,\n ];\n const res = await this.runMaybeTx(\n `UPDATE ${this.t(TableName.JOB)} SET ${JobColumn.STATUS} = ${this.ph(0)}, ${JobColumn.RETRY_ATTEMPT} = ${this.ph(1)}, ` +\n `${JobColumn.START_AFTER} = ${this.ph(2)}, ${JobColumn.RETRIED_AT} = ${this.ph(3)}, ${JobColumn.FAILURE_MESSAGE} = ${this.ph(4)}, ` +\n `${JobColumn.UPDATED_AT} = ${this.ph(5)}, ${JobColumn.LOCKED_UNTIL} = NULL, ${JobColumn.LOCK_TOKEN} = NULL ` +\n `WHERE ${JobColumn.ID} = ${this.ph(6)}${this.claimFence(params, options.lockToken)}`,\n params,\n );\n return res.rowCount > 0;\n }\n\n async failJob(options: {\n jobId: string;\n lastError: string;\n now: number;\n lockToken?: string | null;\n }): Promise<boolean> {\n const params: unknown[] = [\n JobStatus.FAILED,\n options.now,\n options.lastError,\n options.now,\n options.jobId,\n ];\n const res = await this.runMaybeTx(\n `UPDATE ${this.t(TableName.JOB)} SET ${JobColumn.STATUS} = ${this.ph(0)}, ${JobColumn.FAILED_AT} = ${this.ph(1)}, ` +\n `${JobColumn.FAILURE_MESSAGE} = ${this.ph(2)}, ${JobColumn.UPDATED_AT} = ${this.ph(3)}, ${JobColumn.LOCKED_UNTIL} = NULL, ${JobColumn.LOCK_TOKEN} = NULL ` +\n `WHERE ${JobColumn.ID} = ${this.ph(4)}${this.claimFence(params, options.lockToken)}`,\n params,\n );\n return res.rowCount > 0;\n }\n\n async reclaimStalledJobs(options: {\n queueName?: string;\n limit: number;\n now: number;\n }): Promise<StalledJobRef[]> {\n // Bounded, and returning three columns rather than all 34: the caller only needs the id, the\n // queue to wake, and who was holding the job. Return stalled jobs to PENDING (RETRY handling\n // happens in the completion path on the next failure).\n const params: unknown[] = [JobStatus.PENDING, options.now, JobStatus.ACTIVE, options.now];\n let where =\n `${JobColumn.STATUS} = ${this.ph(2)} AND ${JobColumn.LOCKED_UNTIL} IS NOT NULL ` +\n `AND ${JobColumn.LOCKED_UNTIL} < ${this.ph(3)}`;\n if (options.queueName) {\n where += ` AND ${JobColumn.QUEUE_NAME} = ${this.ph(params.length)}`;\n params.push(options.queueName);\n }\n const limitPh = this.ph(params.length);\n params.push(options.limit);\n const res = await this.runMaybeTx(\n `UPDATE ${this.t(TableName.JOB)} SET ${JobColumn.STATUS} = ${this.ph(0)}, ${JobColumn.STALLED_AT} = ${this.ph(1)}, ` +\n `${JobColumn.LOCKED_UNTIL} = NULL, ${JobColumn.LOCK_TOKEN} = NULL ` +\n `WHERE ${JobColumn.ID} IN (SELECT ${JobColumn.ID} FROM ${this.t(TableName.JOB)} WHERE ${where} LIMIT ${limitPh}) ` +\n `RETURNING ${JobColumn.ID}, ${JobColumn.QUEUE_NAME}, ${JobColumn.PROCESSED_ON_INSTANCE_KEY}`,\n params,\n );\n return res.rows.map((r) => ({\n ...this.mapJobRef(r),\n previousInstanceKey: this.strOrNull(r[JobColumn.PROCESSED_ON_INSTANCE_KEY]),\n }));\n }\n\n async expireDueJobs(options: {\n queueName?: string;\n limit: number;\n now: number;\n }): Promise<JobRef[]> {\n const params: unknown[] = [\n JobStatus.EXPIRED,\n options.now,\n options.now,\n JobStatus.PENDING,\n JobStatus.RETRY,\n options.now,\n ];\n let where =\n `${JobColumn.STATUS} IN (${this.ph(3)}, ${this.ph(4)}) AND ${JobColumn.EXPIRE_AT} IS NOT NULL ` +\n `AND ${JobColumn.EXPIRE_AT} <= ${this.ph(5)}`;\n if (options.queueName) {\n where += ` AND ${JobColumn.QUEUE_NAME} = ${this.ph(params.length)}`;\n params.push(options.queueName);\n }\n const limitPh = this.ph(params.length);\n params.push(options.limit);\n const res = await this.runMaybeTx(\n `UPDATE ${this.t(TableName.JOB)} SET ${JobColumn.STATUS} = ${this.ph(0)}, ${JobColumn.EXPIRED_AT} = ${this.ph(1)}, ` +\n `${JobColumn.UPDATED_AT} = ${this.ph(2)}, ${JobColumn.LOCKED_UNTIL} = NULL, ${JobColumn.LOCK_TOKEN} = NULL ` +\n `WHERE ${JobColumn.ID} IN (SELECT ${JobColumn.ID} FROM ${this.t(TableName.JOB)} WHERE ${where} LIMIT ${limitPh}) ` +\n `RETURNING ${JobColumn.ID}, ${JobColumn.QUEUE_NAME}`,\n params,\n );\n return res.rows.map((r) => this.mapJobRef(r));\n }\n\n async requeueJob(options: {\n jobId: string;\n now: number;\n tx?: TransactionHandle;\n }): Promise<RequeuedJobRef | null> {\n const [ref] = await this.requeueJobs({\n jobIds: [options.jobId],\n now: options.now,\n ...(options.tx ? { tx: options.tx } : {}),\n });\n return ref ?? null;\n }\n\n async requeueJobs(options: {\n jobIds: string[];\n now: number;\n tx?: TransactionHandle;\n }): Promise<RequeuedJobRef[]> {\n if (!options.jobIds.length) return [];\n // Chunked so one statement can never carry more ids than the engine allows in an\n // `IN (...)` list. A capped batch is a single chunk, and so a single statement.\n return this.overIdChunks(options.jobIds, async (jobIds) => {\n // Guarded on `status != ACTIVE`. Re-arming a running job would clear its lock and let a second\n // worker claim it while the first handler is still going — the same job running twice at once.\n // An ACTIVE or missing id is simply not re-armed, so a batch never fails on one stale id.\n const head: unknown[] = [JobStatus.PENDING, options.now, options.now];\n const res = await this.runMaybeTx(\n `UPDATE ${this.t(TableName.JOB)} SET ${JobColumn.STATUS} = ${this.ph(0)}, ${JobColumn.RETRY_ATTEMPT} = 0, ` +\n `${JobColumn.START_AFTER} = ${this.ph(1)}, ${JobColumn.FAILED_AT} = NULL, ${JobColumn.FAILURE_MESSAGE} = NULL, ` +\n `${JobColumn.COMPLETED_AT} = NULL, ${JobColumn.STARTED_AT} = NULL, ${JobColumn.CANCELLED_AT} = NULL, ` +\n `${JobColumn.EXPIRED_AT} = NULL, ${JobColumn.RETURN_VALUE} = NULL, ${JobColumn.RETRIED_AT} = NULL, ${JobColumn.STALLED_AT} = NULL, ${JobColumn.LOCKED_UNTIL} = NULL, ${JobColumn.LOCK_TOKEN} = NULL, ` +\n `${JobColumn.UPDATED_AT} = ${this.ph(2)} ` +\n `WHERE ${JobColumn.ID} IN (${this.phList(jobIds.length, head.length)}) ` +\n `AND ${JobColumn.STATUS} <> ${this.ph(head.length + jobIds.length)} ` +\n `RETURNING ${JobColumn.ID}, ${JobColumn.QUEUE_NAME}, ${JobColumn.STATUS}, ${JobColumn.START_AFTER}`,\n [...head, ...jobIds, JobStatus.ACTIVE],\n options.tx,\n );\n return res.rows.map((r) => ({\n ...this.mapJobRef(r),\n status: r[JobColumn.STATUS] as JobStatus,\n startAfter: Number(r[JobColumn.START_AFTER]),\n }));\n });\n }\n\n // --- Reading ---\n async getJob(options: { jobId: string; tx?: TransactionHandle }): Promise<JobRecord | null> {\n const res = await this.runMaybeTx(\n `SELECT ${JOB_COLUMNS.join(', ')} FROM ${this.t(TableName.JOB)} WHERE ${JobColumn.ID} = ${this.ph(0)}`,\n [options.jobId],\n options.tx,\n );\n return res.rows[0] ? this.mapJob(res.rows[0]) : null;\n }\n\n /**\n * WHERE clauses for a job filter, appending each value to `params`. Shared by `getJobs` and\n * `countJobs` so a page and its total can never disagree about what they select. `search` is\n * matched in SQL across the five fields an operator triages by, so a text query pages in the\n * database instead of streaming the table into the process.\n */\n private jobFilterClauses(options: JobListFilter, params: unknown[]): string {\n const clauses: string[] = [];\n if (options.queueName) {\n clauses.push(`${JobColumn.QUEUE_NAME} = ${this.ph(params.length)}`);\n params.push(options.queueName);\n }\n if (options.statuses && options.statuses.length) {\n clauses.push(\n `${JobColumn.STATUS} IN (${this.phList(options.statuses.length, params.length)})`,\n );\n params.push(...options.statuses);\n }\n if (options.scheduleId) {\n clauses.push(`${JobColumn.SCHEDULE_ID} = ${this.ph(params.length)}`);\n params.push(options.scheduleId);\n }\n if (options.processedOnInstanceKey) {\n clauses.push(`${JobColumn.PROCESSED_ON_INSTANCE_KEY} = ${this.ph(params.length)}`);\n params.push(options.processedOnInstanceKey);\n }\n if (options.search) {\n const pattern = this.likePattern(options.search);\n const cols = [\n JobColumn.ID,\n JobColumn.STATUS,\n JobColumn.IDEMPOTENCY_KEY,\n JobColumn.FAILURE_MESSAGE,\n JobColumn.DATA,\n ];\n const ors = cols.map((col) => {\n const clause = `${col} ILIKE ${this.ph(params.length)} ESCAPE '!'`;\n params.push(pattern);\n return clause;\n });\n clauses.push(`(${ors.join(' OR ')})`);\n }\n return clauses.length ? `WHERE ${clauses.join(' AND ')}` : '';\n }\n\n async getJobs(options: JobListFilter & { limit: number; offset: number }): Promise<JobRecord[]> {\n const params: unknown[] = [];\n const where = this.jobFilterClauses(options, params);\n const res = await this.runMaybeTx(\n `SELECT ${JOB_COLUMNS.join(', ')} FROM ${this.t(TableName.JOB)} ${where} ` +\n `ORDER BY ${JobColumn.CREATED_AT} DESC` +\n this.window(options, params),\n params,\n );\n return res.rows.map((r) => this.mapJob(r));\n }\n\n async countJobs(options: JobListFilter): Promise<number> {\n const params: unknown[] = [];\n const where = this.jobFilterClauses(options, params);\n const res = await this.runMaybeTx(\n `SELECT COUNT(*) AS c FROM ${this.t(TableName.JOB)} ${where}`,\n params,\n );\n return Number(res.rows[0]?.c ?? 0);\n }\n\n async countJobsByStatus(options: {\n queueName?: string;\n processedOnInstanceKey?: string;\n }): Promise<Record<JobStatus, number>> {\n const params: unknown[] = [];\n const where = this.jobFilterClauses(options, params);\n const res = await this.runMaybeTx(\n `SELECT ${JobColumn.STATUS}, COUNT(*) AS c FROM ${this.t(TableName.JOB)} ${where} GROUP BY ${JobColumn.STATUS}`,\n params,\n );\n const counts = this.emptyStatusCounts();\n for (const row of res.rows) counts[row[JobColumn.STATUS] as JobStatus] = Number(row.c);\n return counts;\n }\n\n /**\n * Per-status counts for many queues in one grouped pass. One query replaces the\n * `countJobsByStatus`-per-row storm a queue list page would otherwise issue.\n */\n async countJobsByStatusPerQueue(options: {\n queueNames: string[];\n }): Promise<Record<string, Record<JobStatus, number>>> {\n return this.countByStatusGrouped(JobColumn.QUEUE_NAME, options.queueNames);\n }\n\n async countJobsByStatusPerInstance(options: {\n instanceKeys: string[];\n }): Promise<Record<string, Record<JobStatus, number>>> {\n return this.countByStatusGrouped(JobColumn.PROCESSED_ON_INSTANCE_KEY, options.instanceKeys);\n }\n\n /** The shared `GROUP BY <key>, status` read behind both per-key count breakdowns. */\n private async countByStatusGrouped(\n keyColumn: JobColumn,\n keys: string[],\n ): Promise<Record<string, Record<JobStatus, number>>> {\n const out: Record<string, Record<JobStatus, number>> = {};\n for (const key of keys) out[key] = this.emptyStatusCounts();\n if (!keys.length) return out;\n // Chunked like every other key list: the instances page can ask about more keys than an engine\n // will take in one `IN (...)`, and each chunk fills its own share of the same result.\n await this.overIdChunks(keys, async (chunk) => {\n const res = await this.runMaybeTx(\n `SELECT ${keyColumn}, ${JobColumn.STATUS}, COUNT(*) AS c FROM ${this.t(TableName.JOB)} ` +\n `WHERE ${keyColumn} IN (${this.phList(chunk.length)}) GROUP BY ${keyColumn}, ${JobColumn.STATUS}`,\n chunk,\n );\n for (const row of res.rows) {\n const bucket = out[String(row[keyColumn])];\n if (bucket) bucket[row[JobColumn.STATUS] as JobStatus] = Number(row.c);\n }\n return res.rows;\n });\n return out;\n }\n\n /** WHERE clauses for a queue-list filter, appending each value to `params`. */\n private queueFilterClauses(options: QueueListFilter, params: unknown[]): string {\n const clauses: string[] = [];\n if (options.search) {\n clauses.push(`${QueueColumn.NAME} ILIKE ${this.ph(params.length)} ESCAPE '!'`);\n params.push(this.likePattern(options.search));\n }\n if (options.processingPaused !== undefined) {\n clauses.push(`${QueueColumn.PROCESSING_PAUSED} = ${this.ph(params.length)}`);\n params.push(this.boolIn(options.processingPaused));\n }\n return clauses.length ? `WHERE ${clauses.join(' AND ')}` : '';\n }\n\n async listQueues(options: QueueListFilter & PageWindow = {}): Promise<QueueRow[]> {\n const params: unknown[] = [];\n const where = this.queueFilterClauses(options, params);\n // `name` is the primary key, so a page can no longer contain the same queue twice and there is\n // nothing to dedupe after the window — `items.length` and `total` always agree.\n const res = await this.runMaybeTx(\n `SELECT * FROM ${this.t(TableName.QUEUE)} ${where} ORDER BY ${QueueColumn.NAME} ASC` +\n this.window(options, params),\n params,\n );\n return res.rows.map((r) => this.mapQueue(r));\n }\n\n async countQueues(options: QueueListFilter = {}): Promise<number> {\n const params: unknown[] = [];\n const where = this.queueFilterClauses(options, params);\n const res = await this.runMaybeTx(\n `SELECT COUNT(*) AS c FROM ${this.t(TableName.QUEUE)} ${where}`,\n params,\n );\n return Number(res.rows[0]?.c ?? 0);\n }\n\n /** WHERE clauses for a schedule-list filter, appending each value to `params`. */\n private scheduleFilterClauses(options: ScheduleListFilter, params: unknown[]): string {\n const clauses: string[] = [];\n if (options.queueName) {\n clauses.push(`${ScheduleColumn.QUEUE_NAME} = ${this.ph(params.length)}`);\n params.push(options.queueName);\n }\n if (options.enabled !== undefined) {\n clauses.push(`${ScheduleColumn.ENABLED} = ${this.ph(params.length)}`);\n params.push(this.boolIn(options.enabled));\n }\n if (options.search) {\n // A schedule is searchable by any of the three things the table actually shows.\n const pattern = this.likePattern(options.search);\n const cols = [ScheduleColumn.ID, ScheduleColumn.QUEUE_NAME, ScheduleColumn.CRON];\n const ors = cols.map((col) => {\n const clause = `${col} ILIKE ${this.ph(params.length)} ESCAPE '!'`;\n params.push(pattern);\n return clause;\n });\n clauses.push(`(${ors.join(' OR ')})`);\n }\n return clauses.length ? `WHERE ${clauses.join(' AND ')}` : '';\n }\n\n async listSchedules(options: ScheduleListFilter & PageWindow = {}): Promise<ScheduleRow[]> {\n const params: unknown[] = [];\n const where = this.scheduleFilterClauses(options, params);\n const res = await this.runMaybeTx(\n `SELECT * FROM ${this.t(TableName.SCHEDULE)} ${where} ` +\n `ORDER BY ${ScheduleColumn.CREATED_AT} ASC, ${ScheduleColumn.ID} ASC` +\n this.window(options, params),\n params,\n );\n return res.rows.map((r) => this.mapSchedule(r));\n }\n\n async countSchedules(options: ScheduleListFilter = {}): Promise<number> {\n const params: unknown[] = [];\n const where = this.scheduleFilterClauses(options, params);\n const res = await this.runMaybeTx(\n `SELECT COUNT(*) AS c FROM ${this.t(TableName.SCHEDULE)} ${where}`,\n params,\n );\n return Number(res.rows[0]?.c ?? 0);\n }\n\n async getSchedule(options: { scheduleId: string }): Promise<ScheduleRow | null> {\n const res = await this.runMaybeTx(\n `SELECT * FROM ${this.t(TableName.SCHEDULE)} WHERE ${ScheduleColumn.ID} = ${this.ph(0)}`,\n [options.scheduleId],\n );\n return res.rows[0] ? this.mapSchedule(res.rows[0]) : null;\n }\n\n async getDueSchedules(options: { now: number; limit: number }): Promise<ScheduleRow[]> {\n const res = await this.runMaybeTx(\n `SELECT * FROM ${this.t(TableName.SCHEDULE)} WHERE ${ScheduleColumn.ENABLED} = ${this.ph(0)} ` +\n `AND ${ScheduleColumn.NEXT_RUN_AT} IS NOT NULL AND ${ScheduleColumn.NEXT_RUN_AT} <= ${this.ph(1)} ` +\n `ORDER BY ${ScheduleColumn.NEXT_RUN_AT} ASC LIMIT ${this.ph(2)}`,\n [this.boolIn(true), options.now, options.limit],\n );\n return res.rows.map((r) => this.mapSchedule(r));\n }\n\n async advanceSchedule(options: {\n scheduleId: string;\n nextRunAt: number | null;\n lastRunAt: number;\n fromNextRunAt: number;\n }): Promise<boolean> {\n // Guarded on the previous next_run_at: only one instance claims each tick.\n const res = await this.runMaybeTx(\n `UPDATE ${this.t(TableName.SCHEDULE)} SET ${ScheduleColumn.NEXT_RUN_AT} = ${this.ph(0)}, ` +\n `${ScheduleColumn.LAST_RUN_AT} = ${this.ph(1)}, ${ScheduleColumn.UPDATED_AT} = ${this.ph(2)} ` +\n `WHERE ${ScheduleColumn.ID} = ${this.ph(3)} AND ${ScheduleColumn.NEXT_RUN_AT} = ${this.ph(4)}`,\n [\n options.nextRunAt,\n options.lastRunAt,\n options.lastRunAt,\n options.scheduleId,\n options.fromNextRunAt,\n ],\n );\n return res.rowCount > 0;\n }\n\n // --- Job control ---\n async cancelJob(options: {\n jobId: string;\n now: number;\n tx?: TransactionHandle;\n }): Promise<JobRef | null> {\n const [ref] = await this.cancelJobs({\n jobIds: [options.jobId],\n now: options.now,\n ...(options.tx ? { tx: options.tx } : {}),\n });\n return ref ?? null;\n }\n\n async cancelJobs(options: {\n jobIds: string[];\n now: number;\n tx?: TransactionHandle;\n }): Promise<JobRef[]> {\n if (!options.jobIds.length) return [];\n // Chunked so one statement can never carry more ids than the engine allows in an\n // `IN (...)` list. A capped batch is a single chunk, and so a single statement.\n return this.overIdChunks(options.jobIds, async (jobIds) => {\n const head: unknown[] = [JobStatus.CANCELLED, options.now, options.now];\n const tail = [JobStatus.PENDING, JobStatus.RETRY];\n const res = await this.runMaybeTx(\n `UPDATE ${this.t(TableName.JOB)} SET ${JobColumn.STATUS} = ${this.ph(0)}, ${JobColumn.CANCELLED_AT} = ${this.ph(1)}, ` +\n `${JobColumn.UPDATED_AT} = ${this.ph(2)}, ${JobColumn.LOCKED_UNTIL} = NULL, ${JobColumn.LOCK_TOKEN} = NULL ` +\n `WHERE ${JobColumn.ID} IN (${this.phList(jobIds.length, head.length)}) ` +\n `AND ${JobColumn.STATUS} IN (${this.phList(tail.length, head.length + jobIds.length)}) ` +\n `RETURNING ${JobColumn.ID}, ${JobColumn.QUEUE_NAME}`,\n [...head, ...jobIds, ...tail],\n options.tx,\n );\n return res.rows.map((r) => this.mapJobRef(r));\n });\n }\n\n async removeJob(options: { jobId: string; tx?: TransactionHandle }): Promise<JobRef | null> {\n const [ref] = await this.removeJobs({\n jobIds: [options.jobId],\n ...(options.tx ? { tx: options.tx } : {}),\n });\n return ref ?? null;\n }\n\n async removeJobs(options: { jobIds: string[]; tx?: TransactionHandle }): Promise<JobRef[]> {\n if (!options.jobIds.length) return [];\n // Chunked so one statement can never carry more ids than the engine allows in an\n // `IN (...)` list. A capped batch is a single chunk, and so a single statement.\n return this.overIdChunks(options.jobIds, async (jobIds) => {\n // Never delete a running job — an ACTIVE row belongs to a live handler, so it is skipped and\n // simply absent from the result; cancel it first.\n const res = await this.runMaybeTx(\n `DELETE FROM ${this.t(TableName.JOB)} WHERE ${JobColumn.ID} IN (${this.phList(jobIds.length)}) ` +\n `AND ${JobColumn.STATUS} <> ${this.ph(jobIds.length)} ` +\n `RETURNING ${JobColumn.ID}, ${JobColumn.QUEUE_NAME}`,\n [...jobIds, JobStatus.ACTIVE],\n options.tx,\n );\n return res.rows.map((r) => this.mapJobRef(r));\n });\n }\n\n async removeJobsByStatus(options: {\n queueName: string;\n statuses: JobStatus[];\n tx?: TransactionHandle;\n }): Promise<number> {\n if (!options.statuses.length) return 0;\n const res = await this.runMaybeTx(\n `DELETE FROM ${this.t(TableName.JOB)} WHERE ${JobColumn.STATUS} IN (${this.phList(options.statuses.length)}) ` +\n `AND ${JobColumn.QUEUE_NAME} = ${this.ph(options.statuses.length)}`,\n [...options.statuses, options.queueName],\n options.tx,\n );\n return res.rowCount;\n }\n\n // --- Queue control ---\n async setQueuePaused(options: {\n queueName: string;\n processingPaused?: boolean;\n acceptingPaused?: boolean;\n now: number;\n tx?: TransactionHandle;\n }): Promise<QueueRow | null> {\n const sets: string[] = [];\n const params: unknown[] = [];\n if (options.processingPaused !== undefined) {\n sets.push(`${QueueColumn.PROCESSING_PAUSED} = ${this.ph(params.length)}`);\n params.push(this.boolIn(options.processingPaused));\n }\n if (options.acceptingPaused !== undefined) {\n sets.push(`${QueueColumn.ACCEPTING_PAUSED} = ${this.ph(params.length)}`);\n params.push(this.boolIn(options.acceptingPaused));\n }\n sets.push(`${QueueColumn.UPDATED_AT} = ${this.ph(params.length)}`);\n params.push(options.now);\n const namePh = this.ph(params.length);\n params.push(options.queueName);\n // RETURNING the row means the caller refreshes its cached pause flags from this one statement\n // rather than following it with a read.\n const res = await this.runMaybeTx(\n `UPDATE ${this.t(TableName.QUEUE)} SET ${sets.join(', ')} WHERE ${QueueColumn.NAME} = ${namePh} RETURNING *`,\n params,\n options.tx,\n );\n return res.rows[0] ? this.mapQueue(res.rows[0]) : null;\n }\n\n async ensureQueue(options: {\n name: string;\n options?: QueueOptions;\n now: number;\n tx?: TransactionHandle;\n }): Promise<QueueRow> {\n // Get-or-create in one statement pair, on the caller's transaction when there is one: outside\n // it the read-back would not see the row just inserted, and on a single-connection engine it\n // would deadlock behind the in-flight transaction.\n //\n // `name` is the primary key, so `ON CONFLICT DO NOTHING` makes a concurrent create a no-op\n // instead of an error — the conflict target *is* the key, which is the one case the\n // sharded-engine caveat allows. Queue options are process-local (see QueueOptions); only the\n // pause flags are ever persisted, so an existing row is never rewritten from here.\n return this.inTx(options.tx, async (run) => {\n await run(\n `INSERT INTO ${this.t(TableName.QUEUE)} (${QueueColumn.NAME}, ${QueueColumn.PROCESSING_PAUSED}, ` +\n `${QueueColumn.ACCEPTING_PAUSED}, ${QueueColumn.CREATED_AT}, ${QueueColumn.UPDATED_AT}) ` +\n `VALUES (${this.ph(0)}, ${this.ph(1)}, ${this.ph(2)}, ${this.ph(3)}, ${this.ph(4)}) ` +\n `ON CONFLICT (${QueueColumn.NAME}) DO NOTHING`,\n [options.name, this.boolIn(false), this.boolIn(false), options.now, options.now],\n );\n const res = await run(\n `SELECT * FROM ${this.t(TableName.QUEUE)} WHERE ${QueueColumn.NAME} = ${this.ph(0)}`,\n [options.name],\n );\n if (!res.rows[0]) throw new DriverQueryError(`Failed to ensure queue '${options.name}'.`);\n return this.mapQueue(res.rows[0]);\n });\n }\n\n async getQueueByName(options: {\n name: string;\n tx?: TransactionHandle;\n }): Promise<QueueRow | null> {\n const res = await this.runMaybeTx(\n `SELECT * FROM ${this.t(TableName.QUEUE)} WHERE ${QueueColumn.NAME} = ${this.ph(0)}`,\n [options.name],\n options.tx,\n );\n return res.rows[0] ? this.mapQueue(res.rows[0]) : null;\n }\n\n async deleteQueue(options: { name: string; tx?: TransactionHandle }): Promise<boolean> {\n // Only removes the queue row. Jobs link by queue_name (no FK), so this never cascades —\n // any leftover job rows keep their name and are unaffected; the caller guards \"not in use\".\n const res = await this.runMaybeTx(\n `DELETE FROM ${this.t(TableName.QUEUE)} WHERE ${QueueColumn.NAME} = ${this.ph(0)}`,\n [options.name],\n options.tx,\n );\n return res.rowCount > 0;\n }\n\n // --- Instance liveness & per-instance pause ---\n async upsertInstance(options: {\n instanceKey: string;\n now: number;\n metrics?: InstanceMetrics;\n }): Promise<InstanceRow> {\n // Update-first, then insert if absent. The heartbeat's common case is \"row exists\", so the\n // guarded UPDATE ... RETURNING resolves it in one round trip and never touches the\n // (independently controlled) pause flag; only the first beat falls through to the INSERT, whose\n // `ON CONFLICT DO NOTHING` makes two simultaneous first beats harmless. The returned row is\n // what the caller reads `processingPaused` from — there is no follow-up read.\n const m = options.metrics;\n return this.inTx(undefined, async (run) => {\n const updated = await run(\n `UPDATE ${this.t(TableName.INSTANCE)} SET ${InstanceColumn.LAST_SEEN_AT} = ${this.ph(0)}, ` +\n `${InstanceColumn.UPDATED_AT} = ${this.ph(1)}, ` +\n `${InstanceColumn.CPU_PERCENT} = COALESCE(${this.ph(2)}, ${InstanceColumn.CPU_PERCENT}), ` +\n `${InstanceColumn.MEMORY_PERCENT} = COALESCE(${this.ph(3)}, ${InstanceColumn.MEMORY_PERCENT}) ` +\n `WHERE ${InstanceColumn.INSTANCE_KEY} = ${this.ph(4)} RETURNING *`,\n [\n options.now,\n options.now,\n m?.cpuPercent ?? null,\n m?.memoryPercent ?? null,\n options.instanceKey,\n ],\n );\n if (updated.rows[0]) return this.mapInstance(updated.rows[0]);\n await run(\n `INSERT INTO ${this.t(TableName.INSTANCE)} (${InstanceColumn.INSTANCE_KEY}, ${InstanceColumn.PROCESSING_PAUSED}, ` +\n `${InstanceColumn.CREATED_AT}, ${InstanceColumn.UPDATED_AT}, ${InstanceColumn.LAST_SEEN_AT}, ` +\n `${InstanceColumn.CPU_PERCENT}, ${InstanceColumn.MEMORY_PERCENT}) ` +\n `VALUES (${this.phList(7)}) ON CONFLICT (${InstanceColumn.INSTANCE_KEY}) DO NOTHING`,\n [\n options.instanceKey,\n this.boolIn(false),\n options.now,\n options.now,\n options.now,\n m?.cpuPercent ?? null,\n m?.memoryPercent ?? null,\n ],\n );\n const read = await run(\n `SELECT * FROM ${this.t(TableName.INSTANCE)} WHERE ${InstanceColumn.INSTANCE_KEY} = ${this.ph(0)}`,\n [options.instanceKey],\n );\n if (!read.rows[0]) {\n throw new DriverQueryError(`Failed to register instance '${options.instanceKey}'.`);\n }\n return this.mapInstance(read.rows[0]);\n });\n }\n\n /** WHERE clauses for an instance-list filter, appending each value to `params`. */\n private instanceFilterClauses(options: InstanceListFilter, params: unknown[]): string {\n const clauses: string[] = [];\n if (options.search) {\n clauses.push(`${InstanceColumn.INSTANCE_KEY} ILIKE ${this.ph(params.length)} ESCAPE '!'`);\n params.push(this.likePattern(options.search));\n }\n if (options.processingPaused !== undefined) {\n clauses.push(`${InstanceColumn.PROCESSING_PAUSED} = ${this.ph(params.length)}`);\n params.push(this.boolIn(options.processingPaused));\n }\n // Liveness is a cutoff the caller computed; the driver only compares against it.\n if (options.alive !== undefined && options.seenSince !== undefined) {\n clauses.push(\n `${InstanceColumn.LAST_SEEN_AT} ${options.alive ? '>=' : '<'} ${this.ph(params.length)}`,\n );\n params.push(options.seenSince);\n }\n return clauses.length ? `WHERE ${clauses.join(' AND ')}` : '';\n }\n\n async listInstances(options: InstanceListFilter & PageWindow = {}): Promise<InstanceRow[]> {\n const params: unknown[] = [];\n const where = this.instanceFilterClauses(options, params);\n // `instance_key` is the primary key, so no post-window dedupe is needed.\n const res = await this.runMaybeTx(\n `SELECT * FROM ${this.t(TableName.INSTANCE)} ${where} ORDER BY ${InstanceColumn.INSTANCE_KEY} ASC` +\n this.window(options, params),\n params,\n );\n return res.rows.map((r) => this.mapInstance(r));\n }\n\n async countInstances(options: InstanceListFilter = {}): Promise<number> {\n const params: unknown[] = [];\n const where = this.instanceFilterClauses(options, params);\n const res = await this.runMaybeTx(\n `SELECT COUNT(*) AS c FROM ${this.t(TableName.INSTANCE)} ${where}`,\n params,\n );\n return Number(res.rows[0]?.c ?? 0);\n }\n\n async getInstance(options: { instanceKey: string }): Promise<InstanceRow | null> {\n const res = await this.runMaybeTx(\n `SELECT * FROM ${this.t(TableName.INSTANCE)} WHERE ${InstanceColumn.INSTANCE_KEY} = ${this.ph(0)}`,\n [options.instanceKey],\n );\n return res.rows[0] ? this.mapInstance(res.rows[0]) : null;\n }\n\n async setInstancePaused(options: {\n instanceKey: string;\n processingPaused: boolean;\n now: number;\n }): Promise<void> {\n await this.runMaybeTx(\n `UPDATE ${this.t(TableName.INSTANCE)} SET ${InstanceColumn.PROCESSING_PAUSED} = ${this.ph(0)}, ` +\n `${InstanceColumn.UPDATED_AT} = ${this.ph(1)} WHERE ${InstanceColumn.INSTANCE_KEY} = ${this.ph(2)}`,\n [this.boolIn(options.processingPaused), options.now, options.instanceKey],\n );\n }\n\n async deleteInstance(options: { instanceKey: string; tx?: TransactionHandle }): Promise<boolean> {\n // Only removes the instance (monitoring) row. Jobs record processed_on_instance_key as a plain\n // string (no FK), so removing an instance never touches or orphans any job rows.\n const res = await this.runMaybeTx(\n `DELETE FROM ${this.t(TableName.INSTANCE)} WHERE ${InstanceColumn.INSTANCE_KEY} = ${this.ph(0)}`,\n [options.instanceKey],\n options.tx,\n );\n return res.rowCount > 0;\n }\n\n // --- Retention ---\n async deleteFinishedJobs(options: { olderThan: number; limit: number }): Promise<number> {\n const params: unknown[] = [];\n const where = this.retentionWhere(options.olderThan, params);\n const limitPh = this.ph(params.length);\n params.push(options.limit);\n // Bounded batch: delete finished rows whose retention window has elapsed.\n const res = await this.runMaybeTx(\n `DELETE FROM ${this.t(TableName.JOB)} WHERE ${JobColumn.ID} IN ` +\n `(SELECT ${JobColumn.ID} FROM ${this.t(TableName.JOB)} WHERE ${where} LIMIT ${limitPh})`,\n params,\n );\n return res.rowCount;\n }\n\n /**\n * The retention predicate: a row that carries a TTL, in a status **its own policy** covers, whose\n * TTL has elapsed since it finished. A NULL `retention_ttl_seconds` is a job with no retention\n * policy at all and is never deleted — that is the whole of \"keep forever\".\n *\n * The per-status term is what makes `retention.statuses` real. A row with a NULL\n * `retention_statuses` is eligible in every finished status (the default); a row that named a\n * subset is eligible only in one of those, matched against the delimited encoding so `,FAILED,`\n * can never be matched by a search for a different token.\n */\n private retentionWhere(olderThan: number, params: unknown[]): string {\n const statusPh = this.phList(FINISHED_STATUSES.length, params.length);\n params.push(...FINISHED_STATUSES);\n // One integer test per status rather than a leading-wildcard `LIKE`: the old encoding could not\n // use an index and cost four pattern matches per candidate row.\n const scoped = FINISHED_STATUSES.map((status) => {\n const clause =\n `(${JobColumn.STATUS} = ${this.ph(params.length)} AND ` +\n `${JobColumn.RETENTION_STATUSES} & ${this.ph(params.length + 1)} <> 0)`;\n params.push(status, retentionStatusBit(status));\n return clause;\n });\n const cutoffPh = this.ph(params.length);\n params.push(olderThan);\n return (\n `${JobColumn.RETENTION_TTL_SECONDS} IS NOT NULL ` +\n `AND ${JobColumn.STATUS} IN (${statusPh}) ` +\n `AND (${JobColumn.RETENTION_STATUSES} IS NULL OR ${scoped.join(' OR ')}) ` +\n `AND (COALESCE(${JobColumn.COMPLETED_AT}, ${JobColumn.FAILED_AT}, ${JobColumn.CANCELLED_AT}, ` +\n `${JobColumn.EXPIRED_AT}, ${JobColumn.UPDATED_AT}) + ${JobColumn.RETENTION_TTL_SECONDS} * ${MS_PER_SECOND}) <= ${cutoffPh}`\n );\n }\n\n // --- Pub/sub (LISTEN/NOTIFY on a dedicated connection) ---\n private channel(name: string): string {\n // Sanitize to a safe channel token — hash arbitrary names.\n const token = createHash('sha1')\n .update(`${this.context.namespace}:${name}`)\n .digest('hex')\n .slice(0, 40);\n return `pq_${token}`;\n }\n\n async notify(options: { channel: string; payload: string }): Promise<void> {\n if (!this.pool) return;\n await this.pool.query('SELECT pg_notify($1, $2)', [\n this.channel(options.channel),\n options.payload.slice(0, 7000),\n ]);\n }\n\n async subscribe(options: {\n channel: string;\n onNotification: (payload: string) => void;\n }): Promise<Subscription> {\n if (!this.pool) throw new DriverConnectionError('PostgreSQL driver is not connected.');\n const ch = this.channel(options.channel);\n if (!this.listenClient) {\n this.listenClient = await this.pool.connect();\n this.listenClient.on('notification', (msg) => {\n const set = this.listeners.get(msg.channel);\n if (set) for (const cb of set) cb(msg.payload ?? '');\n });\n }\n let set = this.listeners.get(ch);\n if (!set) {\n set = new Set();\n this.listeners.set(ch, set);\n await this.listenClient.query(`LISTEN \"${ch}\"`);\n }\n set.add(options.onNotification);\n return {\n unsubscribe: async () => {\n set!.delete(options.onNotification);\n if (set!.size === 0) {\n this.listeners.delete(ch);\n await this.listenClient?.query(`UNLISTEN \"${ch}\"`).catch(() => undefined);\n }\n },\n };\n }\n\n // --- Advisory locks ---\n /**\n * Take a session-scoped advisory lock, on a connection held for as long as the lock is.\n *\n * `pg_try_advisory_lock` belongs to the **session** that took it, so this cannot run on a pooled\n * connection that goes back to the pool afterwards: the release would land on whichever connection\n * the pool handed out next (a no-op, with a warning), and the lock would stay held for the life of\n * the original connection — so the next process to try would wait it out and time out. One client\n * is checked out here and released with the lock.\n */\n async tryAdvisoryLock(options: { key: string }): Promise<boolean> {\n if (!this.pool) return false;\n const existing = this.lockClients.get(options.key);\n if (existing) return true; // already held by this driver\n const client = await this.pool.connect();\n try {\n const res = await client.query('SELECT pg_try_advisory_lock($1) AS locked', [\n advisoryKey(options.key),\n ]);\n if (res.rows[0]?.locked !== true) {\n client.release();\n return false;\n }\n this.lockClients.set(options.key, client);\n return true;\n } catch (err) {\n client.release();\n throw err;\n }\n }\n\n async releaseAdvisoryLock(options: { key: string }): Promise<void> {\n const client = this.lockClients.get(options.key);\n if (!client) return;\n this.lockClients.delete(options.key);\n try {\n await client.query('SELECT pg_advisory_unlock($1)', [advisoryKey(options.key)]);\n } finally {\n client.release();\n }\n }\n\n // --- Transactions (internal) ---\n async runInTransaction<T>(options: { fn: (tx: TransactionHandle) => Promise<T> }): Promise<T> {\n return this.transaction(async (session) => {\n const handle: TransactionHandle = {\n __portqueueTx: true,\n engine: this.engine,\n execute: async (sql, params) => {\n const res = await this.execute(sql, params, session);\n return { rows: res.rows, rowCount: res.rowCount };\n },\n };\n return options.fn(handle);\n });\n }\n}\n\n/**\n * Map a string key to the `bigint` PostgreSQL advisory locks are keyed by.\n *\n * Six bytes of the digest, which is 48 bits — deliberately short of the 64 PostgreSQL accepts, because\n * the value crosses through a JS `number` and beyond `Number.MAX_SAFE_INTEGER` it would not survive\n * the trip. 48 bits is ample for the handful of named locks the tool takes (one, today: the migration\n * lock), and the collision arithmetic is what the caller needs to know if it ever takes more — see\n * {@link PostgresqlDriver.tryAdvisoryLock}, whose doc names the keys in use.\n */\nfunction advisoryKey(key: string): number {\n const hash = createHash('sha1').update(key).digest();\n return hash.readUIntBE(0, ADVISORY_KEY_BYTES);\n}\n\n/**\n * Digest bytes folded into an advisory-lock key. Six — 48 bits — is the widest that stays inside\n * `Number.MAX_SAFE_INTEGER` (2^53-1), so the key is exact in JS on the way to the `bigint` parameter.\n */\nconst ADVISORY_KEY_BYTES = 6;\n"],"names":["set"],"mappings":";;;AA2BO,SAAS,GAAG,OAAiC;AAClD,QAAM,IAAI,MAAM;AAChB,QAAM,MAAM,MAAM;AAClB,QAAM,aAAuB,CAAA;AAI7B,MAAI,MAAM,OAAQ,YAAW,KAAK,+BAA+B,MAAM,MAAM,EAAE;AAE/E,aAAW;AAAA,IACT,8BAA8B,EAAE,UAAU,KAAK,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOhD,8BAA8B,EAAE,UAAU,GAAG,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAoC9C,8BAA8B,EAAE,UAAU,QAAQ,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAkBnD,8BAA8B,EAAE,UAAU,QAAQ,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IASnD,8BAA8B,EAAE,UAAU,SAAS,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA,EAAA;AAStD,aAAW;AAAA;AAAA;AAAA,IAGT,8BAA8B,IAAI,UAAU,KAAK,WAAW,CAAC,OACrD,EAAE,UAAU,GAAG,CAAC;AAAA;AAAA,IAExB,8BAA8B,IAAI,UAAU,KAAK,aAAa,CAAC,OACvD,EAAE,UAAU,GAAG,CAAC;AAAA;AAAA,IAExB,8BAA8B,IAAI,UAAU,KAAK,YAAY,CAAC,OACtD,EAAE,UAAU,GAAG,CAAC;AAAA;AAAA,IAExB,8BAA8B,IAAI,UAAU,KAAK,eAAe,CAAC,OACzD,EAAE,UAAU,GAAG,CAAC;AAAA;AAAA,IAGxB,8BAA8B,IAAI,UAAU,KAAK,iBAAiB,CAAC,OAC3D,EAAE,UAAU,GAAG,CAAC;AAAA;AAAA,IAGxB,8BAA8B,IAAI,UAAU,KAAK,eAAe,CAAC,OACzD,EAAE,UAAU,GAAG,CAAC;AAAA;AAAA,IAGxB,8BAA8B,IAAI,UAAU,KAAK,aAAa,CAAC,OACvD,EAAE,UAAU,GAAG,CAAC;AAAA;AAAA,IAExB,8BAA8B,IAAI,UAAU,KAAK,cAAc,CAAC,OACxD,EAAE,UAAU,GAAG,CAAC;AAAA;AAAA,IAExB,8BAA8B,IAAI,UAAU,KAAK,cAAc,CAAC,OACxD,EAAE,UAAU,GAAG,CAAC;AAAA;AAAA,IAGxB,8BAA8B,IAAI,UAAU,UAAU,SAAS,CAAC,OACxD,EAAE,UAAU,QAAQ,CAAC;AAAA;AAAA,IAE7B,8BAA8B,IAAI,UAAU,UAAU,WAAW,CAAC,OAC1D,EAAE,UAAU,QAAQ,CAAC;AAAA;AAAA,IAE7B,8BAA8B,IAAI,UAAU,UAAU,iBAAiB,CAAC,OAChE,EAAE,UAAU,QAAQ,CAAC;AAAA;AAAA,IAG7B,8BAA8B,IAAI,UAAU,UAAU,UAAU,CAAC,OACzD,EAAE,UAAU,QAAQ,CAAC;AAAA,EAAA;AAG/B,SAAO;AACT;AAEO,MAAM,wBAA4C,CAAC,EAAE,SAAS,GAAG,YAAY,IAAI;AC3ExF,MAAM,qBAAqB;AAE3B,MAAM,sBAAsB;AAmBrB,MAAM,yBAAyB,WAA6B;AAAA,EACxD,SAAyB,eAAe;AAAA,EACxC,eAAoC,aAAa;AAAA,IACxD,CAAC,iBAAiB,WAAW,GAAG;AAAA,IAChC,CAAC,iBAAiB,SAAS,GAAG;AAAA,IAC9B,CAAC,iBAAiB,YAAY,GAAG;AAAA,IACjC,CAAC,iBAAiB,aAAa,GAAG;AAAA,IAClC,CAAC,iBAAiB,aAAa,GAAG;AAAA,EAAA,CACnC;AAAA,EACQ,aAA8B,iBAAiB,qBAAqB;AAAA,EAErE,OAAsB;AAAA,EACtB,eAAgC;AAAA;AAAA;AAAA;AAAA;AAAA,EAKvB,kCAAkB,IAAA;AAAA,EAClB,gCAAgB,IAAA;AAAA,EAChB;AAAA,EAEjB,YAAY,UAAmC,IAAI;AACjD,UAAM;AAAA,MACJ,GAAI,QAAQ,gBAAgB,SAAY,EAAE,aAAa,QAAQ,YAAA,IAAgB,CAAA;AAAA,MAC/E,GAAI,QAAQ,WAAW,SAAY,EAAE,QAAQ,QAAQ,OAAA,IAAW,CAAA;AAAA,MAChE,GAAI,QAAQ,cAAc,SAAY,EAAE,WAAW,QAAQ,cAAc,CAAA;AAAA,IAAC,CAC3E;AACD,SAAK,UAAU;AAAA,EACjB;AAAA;AAAA,EAGA,MAAM,UAAyB;AAC7B,QAAI,KAAK,QAAQ,MAAM;AACrB,WAAK,OAAO,KAAK,QAAQ;AACzB;AAAA,IACF;AACA,QAAI;AACJ,QAAI;AAEF,YAAM,MAAO,MAAM,OAAO,IAAc;AACxC,WAAM,IAAI,WAAW;AAAA,IAGvB,QAAQ;AACN,YAAM,IAAI,2BAA2B,MAAM,YAAY;AAAA,IACzD;AACA,QAAI;AACF,YAAM,SAAkC,EAAE,GAAG,KAAK,QAAQ,OAAA;AAC1D,UAAI,KAAK,QAAQ,iBAAkB,QAAO,mBAAmB,KAAK,QAAQ;AAC1E,WAAK,OAAO,IAAI,GAAG,KAAK,MAAM;AAC9B,YAAM,KAAK,KAAK,MAAM,UAAU;AAAA,IAClC,SAAS,KAAK;AACZ,YAAM,IAAI,sBAAsB,oCAAoC,GAAG;AAAA,IACzE;AAAA,EACF;AAAA,EAEA,MAAM,aAA4B;AAChC,SAAK,cAAc,QAAA;AACnB,SAAK,eAAe;AAGpB,eAAW,UAAU,KAAK,YAAY,OAAA,UAAiB,QAAA;AACvD,SAAK,YAAY,MAAA;AACjB,QAAI,KAAK,QAAQ,CAAC,KAAK,QAAQ,KAAM,OAAM,KAAK,KAAK,IAAA;AACrD,SAAK,OAAO;AAAA,EACd;AAAA;AAAA,EAGA,MAAgB,QACd,KACA,QACA,SACoB;AACpB,UAAM,SAAU,WAAoC,KAAK;AACzD,QAAI,CAAC,OAAQ,OAAM,IAAI,sBAAsB,qCAAqC;AAClF,UAAM,MAAM,MAAM,OAAO,MAAM,KAAK,MAAM;AAC1C,WAAO,EAAE,MAAM,IAAI,QAAQ,CAAA,GAAI,UAAU,IAAI,YAAY,IAAI,MAAM,UAAU,EAAA;AAAA,EAC/E;AAAA;AAAA,EAGA,MAAgB,YAAe,IAAkD;AAC/E,QAAI,CAAC,KAAK,KAAM,OAAM,IAAI,sBAAsB,qCAAqC;AACrF,UAAM,SAAS,MAAM,KAAK,KAAK,QAAA;AAC/B,QAAI;AACF,YAAM,OAAO,MAAM,OAAO;AAC1B,YAAM,SAAS,MAAM,GAAG,MAAM;AAC9B,YAAM,OAAO,MAAM,QAAQ;AAC3B,aAAO;AAAA,IACT,SAAS,KAAK;AACZ,YAAM,OAAO,MAAM,UAAU,EAAE,MAAM,MAAM,MAAS;AACpD,YAAM;AAAA,IACR,UAAA;AACE,aAAO,QAAA;AAAA,IACT;AAAA,EACF;AAAA;AAAA,EAGU,GAAG,QAAwB;AACnC,WAAO,IAAI,SAAS,CAAC;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOU,OAAO,MAAkB,QAA2B;AAC5D,QAAI,MAAM;AACV,QAAI,KAAK,UAAU,QAAW;AAC5B,aAAO,UAAU,KAAK,GAAG,OAAO,MAAM,CAAC;AACvC,aAAO,KAAK,KAAK,IAAI,KAAK,MAAM,KAAK,KAAK,GAAG,CAAC,CAAC;AAAA,IACjD;AACA,QAAI,KAAK,WAAW,QAAW;AAC7B,aAAO,WAAW,KAAK,GAAG,OAAO,MAAM,CAAC;AACxC,aAAO,KAAK,KAAK,IAAI,KAAK,MAAM,KAAK,MAAM,GAAG,CAAC,CAAC;AAAA,IAClD;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,MAAM,QAA8B;AAClC,QAAI,gBAAgB;AACpB,QAAI,KAAK,MAAM;AACb,YAAM,MAAM,MAAM,KAAK,KAAK,MAAM,qBAAqB;AACvD,sBAAgB,OAAO,IAAI,KAAK,CAAC,GAAG,kBAAkB,SAAS;AAAA,IACjE;AACA,WAAO,EAAE,eAAe,sBAAsB,KAAK,sBAAoB;AAAA,EACzE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,mBAA2C;AAC/C,QAAI;AACF,YAAM,MAAM,MAAM,KAAK;AAAA,QACrB,cAAc,gBAAgB,OAAO,eAAe,KAAK,EAAE,UAAU,SAAS,CAAC;AAAA,QAC/E,CAAA;AAAA,MAAC;AAEH,YAAM,IAAI,IAAI,KAAK,CAAC,GAAG;AACvB,aAAO,KAAK,OAAO,OAAO,OAAO,CAAC;AAAA,IACpC,SAAS,KAAK;AACZ,UAAI,KAAK,sBAAsB,GAAG,EAAG,QAAO;AAC5C,YAAM,IAAI,iBAAiB,8CAA8C,GAAG;AAAA,IAC9E;AAAA,EACF;AAAA;AAAA,EAGU,sBAAsB,KAAuB;AACrD,UAAM,OAAQ,KAAmC;AACjD,WAAO,SAAS,sBAAsB,SAAS;AAAA,EACjD;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,eAAe,SAAsD;AACzE,UAAM,EAAE,cAAc;AACtB,UAAM,aAAa,UAAU,WAAW,KAAK,OAAO;AACpD,UAAM,KAAK,YAAY,OAAO,YAAY;AACxC,iBAAW,OAAO,WAAY,OAAM,KAAK,QAAQ,KAAK,CAAA,GAAI,OAAO;AACjE,YAAM,MAAM,KAAK,IAAA;AACjB,YAAM,KAAK;AAAA,QACT,eAAe,KAAK,EAAE,UAAU,SAAS,CAAC,KAAK,gBAAgB,OAAO,KAAK,gBAAgB,UAAU,KAAK,gBAAgB,UAAU,aACvH,KAAK,OAAO,CAAC,CAAC,kBAAkB,gBAAgB,OAAO;AAAA,QACpE,CAAC,UAAU,SAAS,KAAK,GAAG;AAAA,QAC5B;AAAA,MAAA;AAAA,IAEJ,CAAC;AAAA,EACH;AAAA;AAAA,EAGA,MAAM,UAAU,SAAiF;AAC/F,UAAM,CAAC,MAAM,IAAI,MAAM,KAAK,WAAW;AAAA,MACrC,MAAM,CAAC,QAAQ,GAAG;AAAA,MAClB,GAAI,QAAQ,KAAK,EAAE,IAAI,QAAQ,GAAA,IAAO,CAAA;AAAA,IAAC,CACxC;AACD,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,WAAW,SAGa;AAC5B,UAAM,EAAE,MAAM,GAAA,IAAO;AACrB,QAAI,CAAC,KAAK,OAAQ,QAAO,CAAA;AACzB,WAAO,KAAK,KAAK,IAAI,OAAO,QAAQ;AAClC,YAAM,KAAK,mBAAmB,KAAK,IAAI;AACvC,YAAM,UAAU,MAAM,KAAK,iBAAiB,MAAM,GAAG;AACrD,YAAM,UAAU,IAAI,MAAkC,KAAK,MAAM;AACjE,YAAM,QAAiE,CAAA;AAEvE,iBAAW,CAAC,OAAO,GAAG,KAAK,KAAK,WAAW;AACzC,cAAM,MAAM,QAAQ,IAAI,GAAG;AAC3B,YAAI,KAAK;AACP,kBAAQ,KAAK,IAAI;AACjB;AAAA,QACF;AACA,cAAM,EAAE,IAAI,OAAA,IAAW,KAAK,gBAAgB,GAAG;AAC/C,cAAM,KAAK,EAAE,OAAO,IAAI,QAAQ;AAAA,MAClC;AAIA,iBAAW,SAAS,KAAK,aAAa,OAAO,YAAY,MAAM,GAAG;AAChE,YAAI,CAAC,MAAM,OAAQ;AACnB,cAAM,SAAoB,CAAA;AAC1B,cAAM,SAAS,MAAM,IAAI,CAAC,EAAE,aAAa;AACvC,gBAAM,eAAe,KAAK,OAAO,OAAO,QAAQ,OAAO,MAAM;AAC7D,iBAAO,KAAK,GAAG,MAAM;AACrB,iBAAO,IAAI,YAAY;AAAA,QACzB,CAAC;AACD,YAAI;AACF,gBAAM,WAAW,MAAM;AAAA,YACrB,eAAe,KAAK,EAAE,UAAU,GAAG,CAAC,KAAK,YAAY,KAAK,IAAI,CAAC,YAAY,OAAO,KAAK,IAAI,CAAC,cAC7E,UAAU,EAAE,KAAK,UAAU,MAAM,KAAK,UAAU,WAAW;AAAA,YAC1E;AAAA,UAAA;AAIF,gBAAM,OAAO,IAAI,IAAI,SAAS,KAAK,IAAI,CAAC,QAAQ,CAAC,OAAO,IAAI,UAAU,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC;AACjF,qBAAW,EAAE,OAAO,GAAA,KAAQ,OAAO;AACjC,kBAAM,MAAM,KAAK,IAAI,EAAE;AACvB,gBAAI,CAAC,IAAK,OAAM,IAAI,iBAAiB,8BAA8B,EAAE,IAAI;AACzE,oBAAQ,KAAK,IAAI;AAAA,cACf;AAAA,cACA,QAAQ,IAAI,UAAU,MAAM;AAAA,cAC5B,YAAY,OAAO,IAAI,UAAU,WAAW,CAAC;AAAA,cAC7C,cAAc;AAAA,YAAA;AAAA,UAElB;AAAA,QACF,SAAS,KAAK;AACZ,cAAI,eAAe,iBAAkB,OAAM;AAC3C,gBAAM,IAAI;AAAA,YACR,oBAAoB,MAAM,MAAM,qBAAqB,KAAK,MAAM,CAAC,EAAG,KAAK,EAAG,SAAS;AAAA,YACrF;AAAA,UAAA;AAAA,QAEJ;AAAA,MACF;AACA,aAAO;AAAA,IACT,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAkBA,MAAc,mBACZ,KACA,MACe;AACf,UAAM,QAAQ;AAAA,MACZ,GAAG,IAAI;AAAA,QACL,KAAK;AAAA,UAAQ,CAAC,MACZ,EAAE,kBAAkB,QAAQ,EAAE,gBAAgB,OAAO,CAAC,EAAE,SAAS,IAAI,CAAA;AAAA,QAAC;AAAA,MACxE;AAAA,IACF,EACA,KAAA;AACF,QAAI,CAAC,MAAM,OAAQ;AACnB,UAAM;AAAA,MACJ,UAAU,YAAY,IAAI,SAAS,KAAK,EAAE,UAAU,KAAK,CAAC,UAC/C,YAAY,IAAI,QAAQ,KAAK,OAAO,MAAM,MAAM,CAAC;AAAA,MAC5D;AAAA,IAAA;AAAA,EAEJ;AAAA,EAEA,MAAc,iBACZ,MACA,KAC4C;AAC5C,UAAM,0BAAU,IAAA;AAChB,UAAM,OAAO,GAAG,UAAU,EAAE,KAAK,UAAU,MAAM,KAAK,UAAU,WAAW;AAE3E,UAAM,8BAAc,IAAA;AACpB,eAAW,OAAO,MAAM;AACtB,UAAI,IAAI,kBAAkB,QAAQ,IAAI,gBAAgB,KAAM;AAC5D,YAAM,OAAO,QAAQ,IAAI,IAAI,SAAS;AACtC,UAAI,KAAM,MAAK,KAAK,GAAG;AAAA,mBACV,IAAI,IAAI,WAAW,CAAC,GAAG,CAAC;AAAA,IACvC;AAEA,eAAW,CAAC,WAAW,SAAS,KAAK,SAAS;AAC5C,YAAM,WAAW;AAAA,QACf,GAAG,IAAI,IAAI,UAAU,QAAQ,CAAC,MAAO,EAAE,iBAAiB,CAAC,EAAE,cAAc,IAAI,CAAA,CAAG,CAAC;AAAA,MAAA;AAEnF,UAAI,SAAS,QAAQ;AACnB,cAAM,MAAM,MAAM;AAAA,UAChB,UAAU,IAAI,KAAK,UAAU,eAAe,SAAS,KAAK,EAAE,UAAU,GAAG,CAAC,UAC/D,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,QAAQ,UAAU,eAAe,QAAQ,KAAK,OAAO,SAAS,QAAQ,CAAC,CAAC;AAAA,UACvH,CAAC,WAAW,GAAG,QAAQ;AAAA,QAAA;AAEzB,cAAM,QAAQ,IAAI,IAAI,IAAI,KAAK,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,UAAU,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC;AACpF,mBAAW,OAAO,WAAW;AAC3B,cAAI,IAAI,kBAAkB,KAAM;AAChC,gBAAM,MAAM,MAAM,IAAI,IAAI,cAAc;AACxC,cAAI,SAAS,IAAI,KAAK,KAAK,YAAY,KAAK,oBAAoB,WAAW,CAAC;AAAA,QAC9E;AAAA,MACF;AAEA,YAAM,gBAAgB;AAAA,QACpB,GAAG,IAAI;AAAA,UACL,UAAU,QAAQ,CAAC,MAAO,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,eAAe,CAAC,EAAE,YAAY,IAAI,CAAA,CAAG;AAAA,QAAA;AAAA,MAClF;AAEF,UAAI,cAAc,QAAQ;AACxB,cAAM,WAAW,KAAK,OAAO,gBAAgB,QAAQ,IAAI,cAAc,MAAM;AAC7E,cAAM,MAAM,MAAM;AAAA,UAChB,UAAU,IAAI,KAAK,UAAU,aAAa,SAAS,KAAK,EAAE,UAAU,GAAG,CAAC,UAC7D,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,QAAQ,UAAU,aAAa,QAAQ,KAAK,OAAO,cAAc,QAAQ,CAAC,CAAC,SACjH,UAAU,MAAM,QAAQ,QAAQ;AAAA,UACzC,CAAC,WAAW,GAAG,eAAe,GAAG,eAAe;AAAA,QAAA;AAElD,cAAM,QAAQ,IAAI,IAAI,IAAI,KAAK,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,UAAU,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC;AAClF,mBAAW,OAAO,WAAW;AAC3B,cAAI,IAAI,IAAI,GAAG,KAAK,IAAI,gBAAgB,KAAM;AAC9C,gBAAM,MAAM,MAAM,IAAI,IAAI,YAAY;AACtC,cAAI,SAAS,IAAI,KAAK,KAAK,YAAY,KAAK,oBAAoB,SAAS,CAAC;AAAA,QAC5E;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAGU,YAAY,KAAU,QAA6C;AAC3E,WAAO;AAAA,MACL,IAAI,OAAO,IAAI,UAAU,EAAE,CAAC;AAAA,MAC5B,QAAQ,IAAI,UAAU,MAAM;AAAA,MAC5B,YAAY,OAAO,IAAI,UAAU,WAAW,CAAC;AAAA,MAC7C,cAAc;AAAA,MACd,qBAAqB;AAAA,IAAA;AAAA,EAEzB;AAAA,EAEA,MAAM,wBAAwB,SAIK;AACjC,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,UAAU,UAAU,EAAE,KAAK,UAAU,MAAM,KAAK,UAAU,WAAW,SAAS,KAAK,EAAE,UAAU,GAAG,CAAC,UACxF,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,QAAQ,UAAU,eAAe,MAAM,KAAK,GAAG,CAAC,CAAC;AAAA,MAChG,CAAC,QAAQ,WAAW,QAAQ,cAAc;AAAA,MAC1C,QAAQ;AAAA,IAAA;AAEV,WAAO,IAAI,KAAK,CAAC,IAAI,KAAK,YAAY,IAAI,KAAK,CAAC,GAAG,oBAAoB,WAAW,IAAI;AAAA,EACxF;AAAA,EAEA,MAAM,6BAA6B,SAIH;AAC9B,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,iBAAiB,KAAK,EAAE,UAAU,QAAQ,CAAC,UAAU,eAAe,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,QAAQ,eAAe,eAAe,MAAM,KAAK,GAAG,CAAC,CAAC;AAAA,MACpJ,CAAC,QAAQ,WAAW,QAAQ,cAAc;AAAA,MAC1C,QAAQ;AAAA,IAAA;AAEV,WAAO,IAAI,KAAK,CAAC,IAAI,KAAK,YAAY,IAAI,KAAK,CAAC,CAAC,IAAI;AAAA,EACvD;AAAA,EAEA,MAAM,eAAe,SAGI;AAIvB,UAAM,EAAE,WAAW,KAAK,qBAAqB,QAAQ,UAAU,KAAK,KAAK;AACzE,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,eAAe,KAAK,EAAE,UAAU,QAAQ,CAAC,KAAK,wBAAwB,KAAK,IAAI,CAAC,aACnE,KAAK,OAAO,OAAO,MAAM,CAAC;AAAA,MACvC;AAAA,MACA,QAAQ;AAAA,IAAA;AAEV,WAAO,KAAK,YAAY,IAAI,KAAK,CAAC,CAAE;AAAA,EACtC;AAAA,EAEA,MAAM,eAAe,SAGW;AAC9B,UAAM,CAAC,GAAG,IAAI,MAAM,KAAK,gBAAgB;AAAA,MACvC,aAAa,CAAC,QAAQ,UAAU;AAAA,MAChC,GAAI,QAAQ,KAAK,EAAE,IAAI,QAAQ,GAAA,IAAO,CAAA;AAAA,IAAC,CACxC;AACD,WAAO,OAAO;AAAA,EAChB;AAAA,EAEA,MAAM,gBAAgB,SAGK;AACzB,QAAI,CAAC,QAAQ,YAAY,eAAe,CAAA;AAGxC,WAAO,KAAK,aAAa,QAAQ,aAAa,OAAO,gBAAgB;AAGnE,YAAM,MAAM,MAAM,KAAK;AAAA,QACrB,eAAe,KAAK,EAAE,UAAU,QAAQ,CAAC,UAAU,eAAe,EAAE,QAAQ,KAAK,OAAO,YAAY,MAAM,CAAC,eAC5F,eAAe,EAAE,KAAK,eAAe,UAAU;AAAA,QAC9D;AAAA,QACA,QAAQ;AAAA,MAAA;AAEV,aAAO,IAAI,KAAK,IAAI,CAAC,MAAM,KAAK,eAAe,CAAC,CAAC;AAAA,IACnD,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,mBAAmB,SAKO;AAC9B,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,UAAU,KAAK,EAAE,UAAU,QAAQ,CAAC,QAAQ,eAAe,OAAO,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,eAAe,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,UACrH,eAAe,EAAE,MAAM,KAAK,GAAG,CAAC,CAAC,cAAc,eAAe,EAAE,KAAK,eAAe,UAAU;AAAA,MACzG,CAAC,KAAK,OAAO,QAAQ,OAAO,GAAG,QAAQ,KAAK,QAAQ,UAAU;AAAA,MAC9D,QAAQ;AAAA,IAAA;AAEV,WAAO,IAAI,KAAK,CAAC,IAAI,KAAK,eAAe,IAAI,KAAK,CAAC,CAAC,IAAI;AAAA,EAC1D;AAAA;AAAA,EAGA,MAAM,UAAU,SAMS;AACvB,UAAM,EAAE,WAAW,OAAO,qBAAqB,KAAK,gBAAgB;AACpE,UAAM,cAAc,KAAK,aAAa,KAAK,mBAAmB;AAG9D,UAAM,YAAY,KAAK,MAAA;AACvB,UAAM,OAAO,YAAY,KAAK,IAAI;AAKlC,QAAI,CAAC,aAAa;AAChB,aAAO,KAAK,YAAY,OAAO,YAAY;AACzC,cAAM,MAAM,MAAM,KAAK;AAAA,UACrB,UAAU,KAAK,EAAE,UAAU,GAAG,CAAC,QAAQ,UAAU,MAAM,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,KAC3G,UAAU,YAAY,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,UAClH,UAAU,EAAE,eAAe,UAAU,EAAE,SAAS,KAAK,EAAE,UAAU,GAAG,CAAC,UACrE,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,QAAQ,UAAU,MAAM,QAAQ,KAAK,GAAG,CAAC,CAAC,KAAK,KAAK,GAAG,CAAC,CAAC,SAC/F,UAAU,WAAW,OAAO,KAAK,GAAG,CAAC,CAAC,SAAS,UAAU,SAAS,eAAe,UAAU,SAAS,MAAM,KAAK,GAAG,CAAC,CAAC,cAC/G,UAAU,QAAQ,UAAU,UAAU,WAAW,cAAc,KAAK,GAAG,EAAE,CAAC,sCACzE,IAAI;AAAA,UACnB;AAAA,YACE,UAAU;AAAA,YACV;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA,UAAU;AAAA,YACV,UAAU;AAAA,YACV;AAAA,YACA;AAAA,YACA;AAAA,UAAA;AAAA,UAEF;AAAA,QAAA;AAEF,eAAO,KAAK,YAAY,IAAI,KAAK,IAAI,CAAC,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC;AAAA,MAC7D,CAAC;AAAA,IACH;AAMA,UAAM,EAAE,UAAU,QAAA,IAAY,KAAK,aAAa,KAAK;AACrD,WAAO,KAAK,YAAY,OAAO,YAAY;AACzC,YAAM,0BAAU,IAAA;AAChB,eAAS,SAAS,GAAG,IAAI,OAAO,SAAS,SAAS,SAAS,UAAU,UAAU;AAC7E,cAAM,MAAM,MAAM,KAAK;AAAA,UACrB,UAAU,UAAU,EAAE,KAAK,UAAU,8BAA8B,SAAS,KAAK,EAAE,UAAU,GAAG,CAAC,UACtF,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,QAAQ,UAAU,MAAM,QAAQ,KAAK,GAAG,CAAC,CAAC,KAAK,KAAK,GAAG,CAAC,CAAC,SAC/F,UAAU,WAAW,OAAO,KAAK,GAAG,CAAC,CAAC,SAAS,UAAU,SAAS,eAAe,UAAU,SAAS,MAAM,KAAK,GAAG,CAAC,CAAC,cAC/G,UAAU,QAAQ,UAAU,UAAU,WAAW,cACpD,KAAK,GAAG,CAAC,CAAC,WAAW,KAAK,GAAG,CAAC,CAAC;AAAA,UAC1C,CAAC,WAAW,UAAU,SAAS,UAAU,OAAO,KAAK,KAAK,UAAU,MAAM;AAAA,UAC1E;AAAA,QAAA;AAEF,YAAI,IAAI,KAAK,WAAW,EAAG;AAC3B,aAAK,uBAAuB,IAAI,MAAM,aAAa,OAAO,GAAG;AAC7D,YAAI,IAAI,KAAK,SAAS,SAAU;AAAA,MAClC;AACA,UAAI,IAAI,SAAS,EAAG,QAAO,CAAA;AAC3B,YAAM,SAAS,CAAC,GAAG,GAAG;AACtB,YAAM,OAAO,CAAC,UAAU,QAAQ,KAAK,aAAa,WAAW,aAAa,GAAG;AAC7E,YAAM,MAAM,MAAM,KAAK;AAAA,QACrB,UAAU,KAAK,EAAE,UAAU,GAAG,CAAC,QAAQ,UAAU,MAAM,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,KAC3G,UAAU,YAAY,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,KAC/E,UAAU,yBAAyB,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,UACtF,UAAU,EAAE,QAAQ,KAAK,OAAO,OAAO,QAAQ,KAAK,MAAM,CAAC,SAC7D,UAAU,MAAM,QAAQ,KAAK,GAAG,KAAK,SAAS,OAAO,MAAM,CAAC,KAAK,KAAK,GAAG,KAAK,SAAS,OAAO,SAAS,CAAC,CAAC,eACnG,IAAI;AAAA,QACnB,CAAC,GAAG,MAAM,GAAG,QAAQ,UAAU,SAAS,UAAU,KAAK;AAAA,QACvD;AAAA,MAAA;AAEF,aAAO,KAAK,YAAY,IAAI,KAAK,IAAI,CAAC,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC;AAAA,IAC7D,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWQ,WAAW,QAAmB,WAA8C;AAClF,QAAI,MAAM,QAAQ,UAAU,MAAM,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC;AAC9D,WAAO,KAAK,UAAU,MAAM;AAC5B,QAAI,aAAa,MAAM;AACrB,aAAO,QAAQ,UAAU,UAAU,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC;AAC/D,aAAO,KAAK,SAAS;AAAA,IACvB;AACA,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,WAAW,SAKI;AACnB,UAAM,SAAoB;AAAA,MACxB,KAAK,aAAa,QAAQ,KAAK,QAAQ,mBAAmB;AAAA,MAC1D,QAAQ;AAAA,MACR,QAAQ;AAAA,IAAA;AAEV,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,UAAU,KAAK,EAAE,UAAU,GAAG,CAAC,QAAQ,UAAU,YAAY,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,UAC3G,UAAU,EAAE,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK,WAAW,QAAQ,QAAQ,SAAS,CAAC;AAAA,MACpF;AAAA,IAAA;AAEF,WAAO,IAAI,WAAW;AAAA,EACxB;AAAA,EAEA,MAAM,YAAY,SAMG;AACnB,UAAM,SAAoB;AAAA,MACxB,UAAU;AAAA,MACV,KAAK,OAAO,QAAQ,WAAW;AAAA,MAC/B,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,IAAA;AAEV,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,UAAU,KAAK,EAAE,UAAU,GAAG,CAAC,QAAQ,UAAU,MAAM,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,UAAU,YAAY,MAAM,KAAK,GAAG,CAAC,CAAC,KAC7G,UAAU,YAAY,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,UAAU,YAAY,YAAY,UAAU,UAAU,iBACpI,UAAU,EAAE,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK,WAAW,QAAQ,QAAQ,SAAS,CAAC;AAAA,MACpF;AAAA,MACA,QAAQ;AAAA,IAAA;AAEV,WAAO,IAAI,WAAW;AAAA,EACxB;AAAA,EAEA,MAAM,SAAS,SAOM;AACnB,UAAM,SAAoB;AAAA,MACxB,UAAU;AAAA,MACV,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,IAAA;AAEV,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,UAAU,KAAK,EAAE,UAAU,GAAG,CAAC,QAAQ,UAAU,MAAM,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,UAAU,aAAa,MAAM,KAAK,GAAG,CAAC,CAAC,KAC9G,UAAU,WAAW,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,UAAU,eAAe,MAAM,KAAK,GAAG,CAAC,CAAC,KAC5H,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,UAAU,YAAY,YAAY,UAAU,UAAU,iBACzF,UAAU,EAAE,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK,WAAW,QAAQ,QAAQ,SAAS,CAAC;AAAA,MACpF;AAAA,IAAA;AAEF,WAAO,IAAI,WAAW;AAAA,EACxB;AAAA,EAEA,MAAM,QAAQ,SAKO;AACnB,UAAM,SAAoB;AAAA,MACxB,UAAU;AAAA,MACV,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,IAAA;AAEV,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,UAAU,KAAK,EAAE,UAAU,GAAG,CAAC,QAAQ,UAAU,MAAM,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,UAAU,SAAS,MAAM,KAAK,GAAG,CAAC,CAAC,KAC1G,UAAU,eAAe,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,UAAU,YAAY,YAAY,UAAU,UAAU,iBACvI,UAAU,EAAE,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK,WAAW,QAAQ,QAAQ,SAAS,CAAC;AAAA,MACpF;AAAA,IAAA;AAEF,WAAO,IAAI,WAAW;AAAA,EACxB;AAAA,EAEA,MAAM,mBAAmB,SAII;AAI3B,UAAM,SAAoB,CAAC,UAAU,SAAS,QAAQ,KAAK,UAAU,QAAQ,QAAQ,GAAG;AACxF,QAAI,QACF,GAAG,UAAU,MAAM,MAAM,KAAK,GAAG,CAAC,CAAC,QAAQ,UAAU,YAAY,oBAC1D,UAAU,YAAY,MAAM,KAAK,GAAG,CAAC,CAAC;AAC/C,QAAI,QAAQ,WAAW;AACrB,eAAS,QAAQ,UAAU,UAAU,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC;AACjE,aAAO,KAAK,QAAQ,SAAS;AAAA,IAC/B;AACA,UAAM,UAAU,KAAK,GAAG,OAAO,MAAM;AACrC,WAAO,KAAK,QAAQ,KAAK;AACzB,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,UAAU,KAAK,EAAE,UAAU,GAAG,CAAC,QAAQ,UAAU,MAAM,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,KAC3G,UAAU,YAAY,YAAY,UAAU,UAAU,iBAChD,UAAU,EAAE,eAAe,UAAU,EAAE,SAAS,KAAK,EAAE,UAAU,GAAG,CAAC,UAAU,KAAK,UAAU,OAAO,eACjG,UAAU,EAAE,KAAK,UAAU,UAAU,KAAK,UAAU,yBAAyB;AAAA,MAC5F;AAAA,IAAA;AAEF,WAAO,IAAI,KAAK,IAAI,CAAC,OAAO;AAAA,MAC1B,GAAG,KAAK,UAAU,CAAC;AAAA,MACnB,qBAAqB,KAAK,UAAU,EAAE,UAAU,yBAAyB,CAAC;AAAA,IAAA,EAC1E;AAAA,EACJ;AAAA,EAEA,MAAM,cAAc,SAIE;AACpB,UAAM,SAAoB;AAAA,MACxB,UAAU;AAAA,MACV,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,UAAU;AAAA,MACV,UAAU;AAAA,MACV,QAAQ;AAAA,IAAA;AAEV,QAAI,QACF,GAAG,UAAU,MAAM,QAAQ,KAAK,GAAG,CAAC,CAAC,KAAK,KAAK,GAAG,CAAC,CAAC,SAAS,UAAU,SAAS,oBACzE,UAAU,SAAS,OAAO,KAAK,GAAG,CAAC,CAAC;AAC7C,QAAI,QAAQ,WAAW;AACrB,eAAS,QAAQ,UAAU,UAAU,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC;AACjE,aAAO,KAAK,QAAQ,SAAS;AAAA,IAC/B;AACA,UAAM,UAAU,KAAK,GAAG,OAAO,MAAM;AACrC,WAAO,KAAK,QAAQ,KAAK;AACzB,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,UAAU,KAAK,EAAE,UAAU,GAAG,CAAC,QAAQ,UAAU,MAAM,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,KAC3G,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,UAAU,YAAY,YAAY,UAAU,UAAU,iBACzF,UAAU,EAAE,eAAe,UAAU,EAAE,SAAS,KAAK,EAAE,UAAU,GAAG,CAAC,UAAU,KAAK,UAAU,OAAO,eACjG,UAAU,EAAE,KAAK,UAAU,UAAU;AAAA,MACpD;AAAA,IAAA;AAEF,WAAO,IAAI,KAAK,IAAI,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC;AAAA,EAC9C;AAAA,EAEA,MAAM,WAAW,SAIkB;AACjC,UAAM,CAAC,GAAG,IAAI,MAAM,KAAK,YAAY;AAAA,MACnC,QAAQ,CAAC,QAAQ,KAAK;AAAA,MACtB,KAAK,QAAQ;AAAA,MACb,GAAI,QAAQ,KAAK,EAAE,IAAI,QAAQ,GAAA,IAAO,CAAA;AAAA,IAAC,CACxC;AACD,WAAO,OAAO;AAAA,EAChB;AAAA,EAEA,MAAM,YAAY,SAIY;AAC5B,QAAI,CAAC,QAAQ,OAAO,eAAe,CAAA;AAGnC,WAAO,KAAK,aAAa,QAAQ,QAAQ,OAAO,WAAW;AAIzD,YAAM,OAAkB,CAAC,UAAU,SAAS,QAAQ,KAAK,QAAQ,GAAG;AACpE,YAAM,MAAM,MAAM,KAAK;AAAA,QACrB,UAAU,KAAK,EAAE,UAAU,GAAG,CAAC,QAAQ,UAAU,MAAM,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,UAAU,aAAa,SAC9F,UAAU,WAAW,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,UAAU,SAAS,YAAY,UAAU,eAAe,YAClG,UAAU,YAAY,YAAY,UAAU,UAAU,YAAY,UAAU,YAAY,YACxF,UAAU,UAAU,YAAY,UAAU,YAAY,YAAY,UAAU,UAAU,YAAY,UAAU,UAAU,YAAY,UAAU,YAAY,YAAY,UAAU,UAAU,YACxL,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,UAC9B,UAAU,EAAE,QAAQ,KAAK,OAAO,OAAO,QAAQ,KAAK,MAAM,CAAC,SAC7D,UAAU,MAAM,OAAO,KAAK,GAAG,KAAK,SAAS,OAAO,MAAM,CAAC,cACrD,UAAU,EAAE,KAAK,UAAU,UAAU,KAAK,UAAU,MAAM,KAAK,UAAU,WAAW;AAAA,QACnG,CAAC,GAAG,MAAM,GAAG,QAAQ,UAAU,MAAM;AAAA,QACrC,QAAQ;AAAA,MAAA;AAEV,aAAO,IAAI,KAAK,IAAI,CAAC,OAAO;AAAA,QAC1B,GAAG,KAAK,UAAU,CAAC;AAAA,QACnB,QAAQ,EAAE,UAAU,MAAM;AAAA,QAC1B,YAAY,OAAO,EAAE,UAAU,WAAW,CAAC;AAAA,MAAA,EAC3C;AAAA,IACJ,CAAC;AAAA,EACH;AAAA;AAAA,EAGA,MAAM,OAAO,SAA+E;AAC1F,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,UAAU,YAAY,KAAK,IAAI,CAAC,SAAS,KAAK,EAAE,UAAU,GAAG,CAAC,UAAU,UAAU,EAAE,MAAM,KAAK,GAAG,CAAC,CAAC;AAAA,MACpG,CAAC,QAAQ,KAAK;AAAA,MACd,QAAQ;AAAA,IAAA;AAEV,WAAO,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,IAAI,KAAK,CAAC,CAAC,IAAI;AAAA,EAClD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,iBAAiB,SAAwB,QAA2B;AAC1E,UAAM,UAAoB,CAAA;AAC1B,QAAI,QAAQ,WAAW;AACrB,cAAQ,KAAK,GAAG,UAAU,UAAU,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC,EAAE;AAClE,aAAO,KAAK,QAAQ,SAAS;AAAA,IAC/B;AACA,QAAI,QAAQ,YAAY,QAAQ,SAAS,QAAQ;AAC/C,cAAQ;AAAA,QACN,GAAG,UAAU,MAAM,QAAQ,KAAK,OAAO,QAAQ,SAAS,QAAQ,OAAO,MAAM,CAAC;AAAA,MAAA;AAEhF,aAAO,KAAK,GAAG,QAAQ,QAAQ;AAAA,IACjC;AACA,QAAI,QAAQ,YAAY;AACtB,cAAQ,KAAK,GAAG,UAAU,WAAW,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC,EAAE;AACnE,aAAO,KAAK,QAAQ,UAAU;AAAA,IAChC;AACA,QAAI,QAAQ,wBAAwB;AAClC,cAAQ,KAAK,GAAG,UAAU,yBAAyB,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC,EAAE;AACjF,aAAO,KAAK,QAAQ,sBAAsB;AAAA,IAC5C;AACA,QAAI,QAAQ,QAAQ;AAClB,YAAM,UAAU,KAAK,YAAY,QAAQ,MAAM;AAC/C,YAAM,OAAO;AAAA,QACX,UAAU;AAAA,QACV,UAAU;AAAA,QACV,UAAU;AAAA,QACV,UAAU;AAAA,QACV,UAAU;AAAA,MAAA;AAEZ,YAAM,MAAM,KAAK,IAAI,CAAC,QAAQ;AAC5B,cAAM,SAAS,GAAG,GAAG,UAAU,KAAK,GAAG,OAAO,MAAM,CAAC;AACrD,eAAO,KAAK,OAAO;AACnB,eAAO;AAAA,MACT,CAAC;AACD,cAAQ,KAAK,IAAI,IAAI,KAAK,MAAM,CAAC,GAAG;AAAA,IACtC;AACA,WAAO,QAAQ,SAAS,SAAS,QAAQ,KAAK,OAAO,CAAC,KAAK;AAAA,EAC7D;AAAA,EAEA,MAAM,QAAQ,SAAkF;AAC9F,UAAM,SAAoB,CAAA;AAC1B,UAAM,QAAQ,KAAK,iBAAiB,SAAS,MAAM;AACnD,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,UAAU,YAAY,KAAK,IAAI,CAAC,SAAS,KAAK,EAAE,UAAU,GAAG,CAAC,IAAI,KAAK,aACzD,UAAU,UAAU,UAChC,KAAK,OAAO,SAAS,MAAM;AAAA,MAC7B;AAAA,IAAA;AAEF,WAAO,IAAI,KAAK,IAAI,CAAC,MAAM,KAAK,OAAO,CAAC,CAAC;AAAA,EAC3C;AAAA,EAEA,MAAM,UAAU,SAAyC;AACvD,UAAM,SAAoB,CAAA;AAC1B,UAAM,QAAQ,KAAK,iBAAiB,SAAS,MAAM;AACnD,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,6BAA6B,KAAK,EAAE,UAAU,GAAG,CAAC,IAAI,KAAK;AAAA,MAC3D;AAAA,IAAA;AAEF,WAAO,OAAO,IAAI,KAAK,CAAC,GAAG,KAAK,CAAC;AAAA,EACnC;AAAA,EAEA,MAAM,kBAAkB,SAGe;AACrC,UAAM,SAAoB,CAAA;AAC1B,UAAM,QAAQ,KAAK,iBAAiB,SAAS,MAAM;AACnD,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,UAAU,UAAU,MAAM,wBAAwB,KAAK,EAAE,UAAU,GAAG,CAAC,IAAI,KAAK,aAAa,UAAU,MAAM;AAAA,MAC7G;AAAA,IAAA;AAEF,UAAM,SAAS,KAAK,kBAAA;AACpB,eAAW,OAAO,IAAI,KAAM,QAAO,IAAI,UAAU,MAAM,CAAc,IAAI,OAAO,IAAI,CAAC;AACrF,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,0BAA0B,SAEuB;AACrD,WAAO,KAAK,qBAAqB,UAAU,YAAY,QAAQ,UAAU;AAAA,EAC3E;AAAA,EAEA,MAAM,6BAA6B,SAEoB;AACrD,WAAO,KAAK,qBAAqB,UAAU,2BAA2B,QAAQ,YAAY;AAAA,EAC5F;AAAA;AAAA,EAGA,MAAc,qBACZ,WACA,MACoD;AACpD,UAAM,MAAiD,CAAA;AACvD,eAAW,OAAO,KAAM,KAAI,GAAG,IAAI,KAAK,kBAAA;AACxC,QAAI,CAAC,KAAK,OAAQ,QAAO;AAGzB,UAAM,KAAK,aAAa,MAAM,OAAO,UAAU;AAC7C,YAAM,MAAM,MAAM,KAAK;AAAA,QACrB,UAAU,SAAS,KAAK,UAAU,MAAM,wBAAwB,KAAK,EAAE,UAAU,GAAG,CAAC,UAC1E,SAAS,QAAQ,KAAK,OAAO,MAAM,MAAM,CAAC,cAAc,SAAS,KAAK,UAAU,MAAM;AAAA,QACjG;AAAA,MAAA;AAEF,iBAAW,OAAO,IAAI,MAAM;AAC1B,cAAM,SAAS,IAAI,OAAO,IAAI,SAAS,CAAC,CAAC;AACzC,YAAI,eAAe,IAAI,UAAU,MAAM,CAAc,IAAI,OAAO,IAAI,CAAC;AAAA,MACvE;AACA,aAAO,IAAI;AAAA,IACb,CAAC;AACD,WAAO;AAAA,EACT;AAAA;AAAA,EAGQ,mBAAmB,SAA0B,QAA2B;AAC9E,UAAM,UAAoB,CAAA;AAC1B,QAAI,QAAQ,QAAQ;AAClB,cAAQ,KAAK,GAAG,YAAY,IAAI,UAAU,KAAK,GAAG,OAAO,MAAM,CAAC,aAAa;AAC7E,aAAO,KAAK,KAAK,YAAY,QAAQ,MAAM,CAAC;AAAA,IAC9C;AACA,QAAI,QAAQ,qBAAqB,QAAW;AAC1C,cAAQ,KAAK,GAAG,YAAY,iBAAiB,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC,EAAE;AAC3E,aAAO,KAAK,KAAK,OAAO,QAAQ,gBAAgB,CAAC;AAAA,IACnD;AACA,WAAO,QAAQ,SAAS,SAAS,QAAQ,KAAK,OAAO,CAAC,KAAK;AAAA,EAC7D;AAAA,EAEA,MAAM,WAAW,UAAwC,IAAyB;AAChF,UAAM,SAAoB,CAAA;AAC1B,UAAM,QAAQ,KAAK,mBAAmB,SAAS,MAAM;AAGrD,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,iBAAiB,KAAK,EAAE,UAAU,KAAK,CAAC,IAAI,KAAK,aAAa,YAAY,IAAI,SAC5E,KAAK,OAAO,SAAS,MAAM;AAAA,MAC7B;AAAA,IAAA;AAEF,WAAO,IAAI,KAAK,IAAI,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC;AAAA,EAC7C;AAAA,EAEA,MAAM,YAAY,UAA2B,IAAqB;AAChE,UAAM,SAAoB,CAAA;AAC1B,UAAM,QAAQ,KAAK,mBAAmB,SAAS,MAAM;AACrD,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,6BAA6B,KAAK,EAAE,UAAU,KAAK,CAAC,IAAI,KAAK;AAAA,MAC7D;AAAA,IAAA;AAEF,WAAO,OAAO,IAAI,KAAK,CAAC,GAAG,KAAK,CAAC;AAAA,EACnC;AAAA;AAAA,EAGQ,sBAAsB,SAA6B,QAA2B;AACpF,UAAM,UAAoB,CAAA;AAC1B,QAAI,QAAQ,WAAW;AACrB,cAAQ,KAAK,GAAG,eAAe,UAAU,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC,EAAE;AACvE,aAAO,KAAK,QAAQ,SAAS;AAAA,IAC/B;AACA,QAAI,QAAQ,YAAY,QAAW;AACjC,cAAQ,KAAK,GAAG,eAAe,OAAO,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC,EAAE;AACpE,aAAO,KAAK,KAAK,OAAO,QAAQ,OAAO,CAAC;AAAA,IAC1C;AACA,QAAI,QAAQ,QAAQ;AAElB,YAAM,UAAU,KAAK,YAAY,QAAQ,MAAM;AAC/C,YAAM,OAAO,CAAC,eAAe,IAAI,eAAe,YAAY,eAAe,IAAI;AAC/E,YAAM,MAAM,KAAK,IAAI,CAAC,QAAQ;AAC5B,cAAM,SAAS,GAAG,GAAG,UAAU,KAAK,GAAG,OAAO,MAAM,CAAC;AACrD,eAAO,KAAK,OAAO;AACnB,eAAO;AAAA,MACT,CAAC;AACD,cAAQ,KAAK,IAAI,IAAI,KAAK,MAAM,CAAC,GAAG;AAAA,IACtC;AACA,WAAO,QAAQ,SAAS,SAAS,QAAQ,KAAK,OAAO,CAAC,KAAK;AAAA,EAC7D;AAAA,EAEA,MAAM,cAAc,UAA2C,IAA4B;AACzF,UAAM,SAAoB,CAAA;AAC1B,UAAM,QAAQ,KAAK,sBAAsB,SAAS,MAAM;AACxD,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,iBAAiB,KAAK,EAAE,UAAU,QAAQ,CAAC,IAAI,KAAK,aACtC,eAAe,UAAU,SAAS,eAAe,EAAE,SAC/D,KAAK,OAAO,SAAS,MAAM;AAAA,MAC7B;AAAA,IAAA;AAEF,WAAO,IAAI,KAAK,IAAI,CAAC,MAAM,KAAK,YAAY,CAAC,CAAC;AAAA,EAChD;AAAA,EAEA,MAAM,eAAe,UAA8B,IAAqB;AACtE,UAAM,SAAoB,CAAA;AAC1B,UAAM,QAAQ,KAAK,sBAAsB,SAAS,MAAM;AACxD,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,6BAA6B,KAAK,EAAE,UAAU,QAAQ,CAAC,IAAI,KAAK;AAAA,MAChE;AAAA,IAAA;AAEF,WAAO,OAAO,IAAI,KAAK,CAAC,GAAG,KAAK,CAAC;AAAA,EACnC;AAAA,EAEA,MAAM,YAAY,SAA8D;AAC9E,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,iBAAiB,KAAK,EAAE,UAAU,QAAQ,CAAC,UAAU,eAAe,EAAE,MAAM,KAAK,GAAG,CAAC,CAAC;AAAA,MACtF,CAAC,QAAQ,UAAU;AAAA,IAAA;AAErB,WAAO,IAAI,KAAK,CAAC,IAAI,KAAK,YAAY,IAAI,KAAK,CAAC,CAAC,IAAI;AAAA,EACvD;AAAA,EAEA,MAAM,gBAAgB,SAAiE;AACrF,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,iBAAiB,KAAK,EAAE,UAAU,QAAQ,CAAC,UAAU,eAAe,OAAO,MAAM,KAAK,GAAG,CAAC,CAAC,QAClF,eAAe,WAAW,oBAAoB,eAAe,WAAW,OAAO,KAAK,GAAG,CAAC,CAAC,aACpF,eAAe,WAAW,cAAc,KAAK,GAAG,CAAC,CAAC;AAAA,MAChE,CAAC,KAAK,OAAO,IAAI,GAAG,QAAQ,KAAK,QAAQ,KAAK;AAAA,IAAA;AAEhD,WAAO,IAAI,KAAK,IAAI,CAAC,MAAM,KAAK,YAAY,CAAC,CAAC;AAAA,EAChD;AAAA,EAEA,MAAM,gBAAgB,SAKD;AAEnB,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,UAAU,KAAK,EAAE,UAAU,QAAQ,CAAC,QAAQ,eAAe,WAAW,MAAM,KAAK,GAAG,CAAC,CAAC,KACjF,eAAe,WAAW,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,eAAe,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,UAClF,eAAe,EAAE,MAAM,KAAK,GAAG,CAAC,CAAC,QAAQ,eAAe,WAAW,MAAM,KAAK,GAAG,CAAC,CAAC;AAAA,MAC9F;AAAA,QACE,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,QAAQ;AAAA,MAAA;AAAA,IACV;AAEF,WAAO,IAAI,WAAW;AAAA,EACxB;AAAA;AAAA,EAGA,MAAM,UAAU,SAIW;AACzB,UAAM,CAAC,GAAG,IAAI,MAAM,KAAK,WAAW;AAAA,MAClC,QAAQ,CAAC,QAAQ,KAAK;AAAA,MACtB,KAAK,QAAQ;AAAA,MACb,GAAI,QAAQ,KAAK,EAAE,IAAI,QAAQ,GAAA,IAAO,CAAA;AAAA,IAAC,CACxC;AACD,WAAO,OAAO;AAAA,EAChB;AAAA,EAEA,MAAM,WAAW,SAIK;AACpB,QAAI,CAAC,QAAQ,OAAO,eAAe,CAAA;AAGnC,WAAO,KAAK,aAAa,QAAQ,QAAQ,OAAO,WAAW;AACzD,YAAM,OAAkB,CAAC,UAAU,WAAW,QAAQ,KAAK,QAAQ,GAAG;AACtE,YAAM,OAAO,CAAC,UAAU,SAAS,UAAU,KAAK;AAChD,YAAM,MAAM,MAAM,KAAK;AAAA,QACrB,UAAU,KAAK,EAAE,UAAU,GAAG,CAAC,QAAQ,UAAU,MAAM,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,UAAU,YAAY,MAAM,KAAK,GAAG,CAAC,CAAC,KAC7G,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,UAAU,YAAY,YAAY,UAAU,UAAU,iBACzF,UAAU,EAAE,QAAQ,KAAK,OAAO,OAAO,QAAQ,KAAK,MAAM,CAAC,SAC7D,UAAU,MAAM,QAAQ,KAAK,OAAO,KAAK,QAAQ,KAAK,SAAS,OAAO,MAAM,CAAC,eACvE,UAAU,EAAE,KAAK,UAAU,UAAU;AAAA,QACpD,CAAC,GAAG,MAAM,GAAG,QAAQ,GAAG,IAAI;AAAA,QAC5B,QAAQ;AAAA,MAAA;AAEV,aAAO,IAAI,KAAK,IAAI,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC;AAAA,IAC9C,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,UAAU,SAA4E;AAC1F,UAAM,CAAC,GAAG,IAAI,MAAM,KAAK,WAAW;AAAA,MAClC,QAAQ,CAAC,QAAQ,KAAK;AAAA,MACtB,GAAI,QAAQ,KAAK,EAAE,IAAI,QAAQ,GAAA,IAAO,CAAA;AAAA,IAAC,CACxC;AACD,WAAO,OAAO;AAAA,EAChB;AAAA,EAEA,MAAM,WAAW,SAA0E;AACzF,QAAI,CAAC,QAAQ,OAAO,eAAe,CAAA;AAGnC,WAAO,KAAK,aAAa,QAAQ,QAAQ,OAAO,WAAW;AAGzD,YAAM,MAAM,MAAM,KAAK;AAAA,QACrB,eAAe,KAAK,EAAE,UAAU,GAAG,CAAC,UAAU,UAAU,EAAE,QAAQ,KAAK,OAAO,OAAO,MAAM,CAAC,SACnF,UAAU,MAAM,OAAO,KAAK,GAAG,OAAO,MAAM,CAAC,cACvC,UAAU,EAAE,KAAK,UAAU,UAAU;AAAA,QACpD,CAAC,GAAG,QAAQ,UAAU,MAAM;AAAA,QAC5B,QAAQ;AAAA,MAAA;AAEV,aAAO,IAAI,KAAK,IAAI,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC;AAAA,IAC9C,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,mBAAmB,SAIL;AAClB,QAAI,CAAC,QAAQ,SAAS,OAAQ,QAAO;AACrC,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,eAAe,KAAK,EAAE,UAAU,GAAG,CAAC,UAAU,UAAU,MAAM,QAAQ,KAAK,OAAO,QAAQ,SAAS,MAAM,CAAC,SACjG,UAAU,UAAU,MAAM,KAAK,GAAG,QAAQ,SAAS,MAAM,CAAC;AAAA,MACnE,CAAC,GAAG,QAAQ,UAAU,QAAQ,SAAS;AAAA,MACvC,QAAQ;AAAA,IAAA;AAEV,WAAO,IAAI;AAAA,EACb;AAAA;AAAA,EAGA,MAAM,eAAe,SAMQ;AAC3B,UAAM,OAAiB,CAAA;AACvB,UAAM,SAAoB,CAAA;AAC1B,QAAI,QAAQ,qBAAqB,QAAW;AAC1C,WAAK,KAAK,GAAG,YAAY,iBAAiB,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC,EAAE;AACxE,aAAO,KAAK,KAAK,OAAO,QAAQ,gBAAgB,CAAC;AAAA,IACnD;AACA,QAAI,QAAQ,oBAAoB,QAAW;AACzC,WAAK,KAAK,GAAG,YAAY,gBAAgB,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC,EAAE;AACvE,aAAO,KAAK,KAAK,OAAO,QAAQ,eAAe,CAAC;AAAA,IAClD;AACA,SAAK,KAAK,GAAG,YAAY,UAAU,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC,EAAE;AACjE,WAAO,KAAK,QAAQ,GAAG;AACvB,UAAM,SAAS,KAAK,GAAG,OAAO,MAAM;AACpC,WAAO,KAAK,QAAQ,SAAS;AAG7B,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,UAAU,KAAK,EAAE,UAAU,KAAK,CAAC,QAAQ,KAAK,KAAK,IAAI,CAAC,UAAU,YAAY,IAAI,MAAM,MAAM;AAAA,MAC9F;AAAA,MACA,QAAQ;AAAA,IAAA;AAEV,WAAO,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,IAAI,KAAK,CAAC,CAAC,IAAI;AAAA,EACpD;AAAA,EAEA,MAAM,YAAY,SAKI;AASpB,WAAO,KAAK,KAAK,QAAQ,IAAI,OAAO,QAAQ;AAC1C,YAAM;AAAA,QACJ,eAAe,KAAK,EAAE,UAAU,KAAK,CAAC,KAAK,YAAY,IAAI,KAAK,YAAY,iBAAiB,KACxF,YAAY,gBAAgB,KAAK,YAAY,UAAU,KAAK,YAAY,UAAU,aAC1E,KAAK,GAAG,CAAC,CAAC,KAAK,KAAK,GAAG,CAAC,CAAC,KAAK,KAAK,GAAG,CAAC,CAAC,KAAK,KAAK,GAAG,CAAC,CAAC,KAAK,KAAK,GAAG,CAAC,CAAC,kBACjE,YAAY,IAAI;AAAA,QAClC,CAAC,QAAQ,MAAM,KAAK,OAAO,KAAK,GAAG,KAAK,OAAO,KAAK,GAAG,QAAQ,KAAK,QAAQ,GAAG;AAAA,MAAA;AAEjF,YAAM,MAAM,MAAM;AAAA,QAChB,iBAAiB,KAAK,EAAE,UAAU,KAAK,CAAC,UAAU,YAAY,IAAI,MAAM,KAAK,GAAG,CAAC,CAAC;AAAA,QAClF,CAAC,QAAQ,IAAI;AAAA,MAAA;AAEf,UAAI,CAAC,IAAI,KAAK,CAAC,EAAG,OAAM,IAAI,iBAAiB,2BAA2B,QAAQ,IAAI,IAAI;AACxF,aAAO,KAAK,SAAS,IAAI,KAAK,CAAC,CAAC;AAAA,IAClC,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,eAAe,SAGQ;AAC3B,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,iBAAiB,KAAK,EAAE,UAAU,KAAK,CAAC,UAAU,YAAY,IAAI,MAAM,KAAK,GAAG,CAAC,CAAC;AAAA,MAClF,CAAC,QAAQ,IAAI;AAAA,MACb,QAAQ;AAAA,IAAA;AAEV,WAAO,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,IAAI,KAAK,CAAC,CAAC,IAAI;AAAA,EACpD;AAAA,EAEA,MAAM,YAAY,SAAqE;AAGrF,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,eAAe,KAAK,EAAE,UAAU,KAAK,CAAC,UAAU,YAAY,IAAI,MAAM,KAAK,GAAG,CAAC,CAAC;AAAA,MAChF,CAAC,QAAQ,IAAI;AAAA,MACb,QAAQ;AAAA,IAAA;AAEV,WAAO,IAAI,WAAW;AAAA,EACxB;AAAA;AAAA,EAGA,MAAM,eAAe,SAII;AAMvB,UAAM,IAAI,QAAQ;AAClB,WAAO,KAAK,KAAK,QAAW,OAAO,QAAQ;AACzC,YAAM,UAAU,MAAM;AAAA,QACpB,UAAU,KAAK,EAAE,UAAU,QAAQ,CAAC,QAAQ,eAAe,YAAY,MAAM,KAAK,GAAG,CAAC,CAAC,KAClF,eAAe,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,KACzC,eAAe,WAAW,eAAe,KAAK,GAAG,CAAC,CAAC,KAAK,eAAe,WAAW,MAClF,eAAe,cAAc,eAAe,KAAK,GAAG,CAAC,CAAC,KAAK,eAAe,cAAc,WAClF,eAAe,YAAY,MAAM,KAAK,GAAG,CAAC,CAAC;AAAA,QACtD;AAAA,UACE,QAAQ;AAAA,UACR,QAAQ;AAAA,UACR,GAAG,cAAc;AAAA,UACjB,GAAG,iBAAiB;AAAA,UACpB,QAAQ;AAAA,QAAA;AAAA,MACV;AAEF,UAAI,QAAQ,KAAK,CAAC,EAAG,QAAO,KAAK,YAAY,QAAQ,KAAK,CAAC,CAAC;AAC5D,YAAM;AAAA,QACJ,eAAe,KAAK,EAAE,UAAU,QAAQ,CAAC,KAAK,eAAe,YAAY,KAAK,eAAe,iBAAiB,KACzG,eAAe,UAAU,KAAK,eAAe,UAAU,KAAK,eAAe,YAAY,KACvF,eAAe,WAAW,KAAK,eAAe,cAAc,aACpD,KAAK,OAAO,CAAC,CAAC,kBAAkB,eAAe,YAAY;AAAA,QACxE;AAAA,UACE,QAAQ;AAAA,UACR,KAAK,OAAO,KAAK;AAAA,UACjB,QAAQ;AAAA,UACR,QAAQ;AAAA,UACR,QAAQ;AAAA,UACR,GAAG,cAAc;AAAA,UACjB,GAAG,iBAAiB;AAAA,QAAA;AAAA,MACtB;AAEF,YAAM,OAAO,MAAM;AAAA,QACjB,iBAAiB,KAAK,EAAE,UAAU,QAAQ,CAAC,UAAU,eAAe,YAAY,MAAM,KAAK,GAAG,CAAC,CAAC;AAAA,QAChG,CAAC,QAAQ,WAAW;AAAA,MAAA;AAEtB,UAAI,CAAC,KAAK,KAAK,CAAC,GAAG;AACjB,cAAM,IAAI,iBAAiB,gCAAgC,QAAQ,WAAW,IAAI;AAAA,MACpF;AACA,aAAO,KAAK,YAAY,KAAK,KAAK,CAAC,CAAC;AAAA,IACtC,CAAC;AAAA,EACH;AAAA;AAAA,EAGQ,sBAAsB,SAA6B,QAA2B;AACpF,UAAM,UAAoB,CAAA;AAC1B,QAAI,QAAQ,QAAQ;AAClB,cAAQ,KAAK,GAAG,eAAe,YAAY,UAAU,KAAK,GAAG,OAAO,MAAM,CAAC,aAAa;AACxF,aAAO,KAAK,KAAK,YAAY,QAAQ,MAAM,CAAC;AAAA,IAC9C;AACA,QAAI,QAAQ,qBAAqB,QAAW;AAC1C,cAAQ,KAAK,GAAG,eAAe,iBAAiB,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC,EAAE;AAC9E,aAAO,KAAK,KAAK,OAAO,QAAQ,gBAAgB,CAAC;AAAA,IACnD;AAEA,QAAI,QAAQ,UAAU,UAAa,QAAQ,cAAc,QAAW;AAClE,cAAQ;AAAA,QACN,GAAG,eAAe,YAAY,IAAI,QAAQ,QAAQ,OAAO,GAAG,IAAI,KAAK,GAAG,OAAO,MAAM,CAAC;AAAA,MAAA;AAExF,aAAO,KAAK,QAAQ,SAAS;AAAA,IAC/B;AACA,WAAO,QAAQ,SAAS,SAAS,QAAQ,KAAK,OAAO,CAAC,KAAK;AAAA,EAC7D;AAAA,EAEA,MAAM,cAAc,UAA2C,IAA4B;AACzF,UAAM,SAAoB,CAAA;AAC1B,UAAM,QAAQ,KAAK,sBAAsB,SAAS,MAAM;AAExD,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,iBAAiB,KAAK,EAAE,UAAU,QAAQ,CAAC,IAAI,KAAK,aAAa,eAAe,YAAY,SAC1F,KAAK,OAAO,SAAS,MAAM;AAAA,MAC7B;AAAA,IAAA;AAEF,WAAO,IAAI,KAAK,IAAI,CAAC,MAAM,KAAK,YAAY,CAAC,CAAC;AAAA,EAChD;AAAA,EAEA,MAAM,eAAe,UAA8B,IAAqB;AACtE,UAAM,SAAoB,CAAA;AAC1B,UAAM,QAAQ,KAAK,sBAAsB,SAAS,MAAM;AACxD,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,6BAA6B,KAAK,EAAE,UAAU,QAAQ,CAAC,IAAI,KAAK;AAAA,MAChE;AAAA,IAAA;AAEF,WAAO,OAAO,IAAI,KAAK,CAAC,GAAG,KAAK,CAAC;AAAA,EACnC;AAAA,EAEA,MAAM,YAAY,SAA+D;AAC/E,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,iBAAiB,KAAK,EAAE,UAAU,QAAQ,CAAC,UAAU,eAAe,YAAY,MAAM,KAAK,GAAG,CAAC,CAAC;AAAA,MAChG,CAAC,QAAQ,WAAW;AAAA,IAAA;AAEtB,WAAO,IAAI,KAAK,CAAC,IAAI,KAAK,YAAY,IAAI,KAAK,CAAC,CAAC,IAAI;AAAA,EACvD;AAAA,EAEA,MAAM,kBAAkB,SAIN;AAChB,UAAM,KAAK;AAAA,MACT,UAAU,KAAK,EAAE,UAAU,QAAQ,CAAC,QAAQ,eAAe,iBAAiB,MAAM,KAAK,GAAG,CAAC,CAAC,KACvF,eAAe,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,UAAU,eAAe,YAAY,MAAM,KAAK,GAAG,CAAC,CAAC;AAAA,MACnG,CAAC,KAAK,OAAO,QAAQ,gBAAgB,GAAG,QAAQ,KAAK,QAAQ,WAAW;AAAA,IAAA;AAAA,EAE5E;AAAA,EAEA,MAAM,eAAe,SAA4E;AAG/F,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,eAAe,KAAK,EAAE,UAAU,QAAQ,CAAC,UAAU,eAAe,YAAY,MAAM,KAAK,GAAG,CAAC,CAAC;AAAA,MAC9F,CAAC,QAAQ,WAAW;AAAA,MACpB,QAAQ;AAAA,IAAA;AAEV,WAAO,IAAI,WAAW;AAAA,EACxB;AAAA;AAAA,EAGA,MAAM,mBAAmB,SAAgE;AACvF,UAAM,SAAoB,CAAA;AAC1B,UAAM,QAAQ,KAAK,eAAe,QAAQ,WAAW,MAAM;AAC3D,UAAM,UAAU,KAAK,GAAG,OAAO,MAAM;AACrC,WAAO,KAAK,QAAQ,KAAK;AAEzB,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,eAAe,KAAK,EAAE,UAAU,GAAG,CAAC,UAAU,UAAU,EAAE,eAC7C,UAAU,EAAE,SAAS,KAAK,EAAE,UAAU,GAAG,CAAC,UAAU,KAAK,UAAU,OAAO;AAAA,MACvF;AAAA,IAAA;AAEF,WAAO,IAAI;AAAA,EACb;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYQ,eAAe,WAAmB,QAA2B;AACnE,UAAM,WAAW,KAAK,OAAO,kBAAkB,QAAQ,OAAO,MAAM;AACpE,WAAO,KAAK,GAAG,iBAAiB;AAGhC,UAAM,SAAS,kBAAkB,IAAI,CAAC,WAAW;AAC/C,YAAM,SACJ,IAAI,UAAU,MAAM,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC,QAC7C,UAAU,kBAAkB,MAAM,KAAK,GAAG,OAAO,SAAS,CAAC,CAAC;AACjE,aAAO,KAAK,QAAQ,mBAAmB,MAAM,CAAC;AAC9C,aAAO;AAAA,IACT,CAAC;AACD,UAAM,WAAW,KAAK,GAAG,OAAO,MAAM;AACtC,WAAO,KAAK,SAAS;AACrB,WACE,GAAG,UAAU,qBAAqB,oBAC3B,UAAU,MAAM,QAAQ,QAAQ,UAC/B,UAAU,kBAAkB,eAAe,OAAO,KAAK,MAAM,CAAC,mBACrD,UAAU,YAAY,KAAK,UAAU,SAAS,KAAK,UAAU,YAAY,KACvF,UAAU,UAAU,KAAK,UAAU,UAAU,OAAO,UAAU,qBAAqB,MAAM,aAAa,QAAQ,QAAQ;AAAA,EAE7H;AAAA;AAAA,EAGQ,QAAQ,MAAsB;AAEpC,UAAM,QAAQ,WAAW,MAAM,EAC5B,OAAO,GAAG,KAAK,QAAQ,SAAS,IAAI,IAAI,EAAE,EAC1C,OAAO,KAAK,EACZ,MAAM,GAAG,EAAE;AACd,WAAO,MAAM,KAAK;AAAA,EACpB;AAAA,EAEA,MAAM,OAAO,SAA8D;AACzE,QAAI,CAAC,KAAK,KAAM;AAChB,UAAM,KAAK,KAAK,MAAM,4BAA4B;AAAA,MAChD,KAAK,QAAQ,QAAQ,OAAO;AAAA,MAC5B,QAAQ,QAAQ,MAAM,GAAG,GAAI;AAAA,IAAA,CAC9B;AAAA,EACH;AAAA,EAEA,MAAM,UAAU,SAGU;AACxB,QAAI,CAAC,KAAK,KAAM,OAAM,IAAI,sBAAsB,qCAAqC;AACrF,UAAM,KAAK,KAAK,QAAQ,QAAQ,OAAO;AACvC,QAAI,CAAC,KAAK,cAAc;AACtB,WAAK,eAAe,MAAM,KAAK,KAAK,QAAA;AACpC,WAAK,aAAa,GAAG,gBAAgB,CAAC,QAAQ;AAC5C,cAAMA,OAAM,KAAK,UAAU,IAAI,IAAI,OAAO;AAC1C,YAAIA,KAAK,YAAW,MAAMA,KAAK,IAAG,IAAI,WAAW,EAAE;AAAA,MACrD,CAAC;AAAA,IACH;AACA,QAAI,MAAM,KAAK,UAAU,IAAI,EAAE;AAC/B,QAAI,CAAC,KAAK;AACR,gCAAU,IAAA;AACV,WAAK,UAAU,IAAI,IAAI,GAAG;AAC1B,YAAM,KAAK,aAAa,MAAM,WAAW,EAAE,GAAG;AAAA,IAChD;AACA,QAAI,IAAI,QAAQ,cAAc;AAC9B,WAAO;AAAA,MACL,aAAa,YAAY;AACvB,YAAK,OAAO,QAAQ,cAAc;AAClC,YAAI,IAAK,SAAS,GAAG;AACnB,eAAK,UAAU,OAAO,EAAE;AACxB,gBAAM,KAAK,cAAc,MAAM,aAAa,EAAE,GAAG,EAAE,MAAM,MAAM,MAAS;AAAA,QAC1E;AAAA,MACF;AAAA,IAAA;AAAA,EAEJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,MAAM,gBAAgB,SAA4C;AAChE,QAAI,CAAC,KAAK,KAAM,QAAO;AACvB,UAAM,WAAW,KAAK,YAAY,IAAI,QAAQ,GAAG;AACjD,QAAI,SAAU,QAAO;AACrB,UAAM,SAAS,MAAM,KAAK,KAAK,QAAA;AAC/B,QAAI;AACF,YAAM,MAAM,MAAM,OAAO,MAAM,6CAA6C;AAAA,QAC1E,YAAY,QAAQ,GAAG;AAAA,MAAA,CACxB;AACD,UAAI,IAAI,KAAK,CAAC,GAAG,WAAW,MAAM;AAChC,eAAO,QAAA;AACP,eAAO;AAAA,MACT;AACA,WAAK,YAAY,IAAI,QAAQ,KAAK,MAAM;AACxC,aAAO;AAAA,IACT,SAAS,KAAK;AACZ,aAAO,QAAA;AACP,YAAM;AAAA,IACR;AAAA,EACF;AAAA,EAEA,MAAM,oBAAoB,SAAyC;AACjE,UAAM,SAAS,KAAK,YAAY,IAAI,QAAQ,GAAG;AAC/C,QAAI,CAAC,OAAQ;AACb,SAAK,YAAY,OAAO,QAAQ,GAAG;AACnC,QAAI;AACF,YAAM,OAAO,MAAM,iCAAiC,CAAC,YAAY,QAAQ,GAAG,CAAC,CAAC;AAAA,IAChF,UAAA;AACE,aAAO,QAAA;AAAA,IACT;AAAA,EACF;AAAA;AAAA,EAGA,MAAM,iBAAoB,SAAoE;AAC5F,WAAO,KAAK,YAAY,OAAO,YAAY;AACzC,YAAM,SAA4B;AAAA,QAChC,eAAe;AAAA,QACf,QAAQ,KAAK;AAAA,QACb,SAAS,OAAO,KAAK,WAAW;AAC9B,gBAAM,MAAM,MAAM,KAAK,QAAQ,KAAK,QAAQ,OAAO;AACnD,iBAAO,EAAE,MAAM,IAAI,MAAM,UAAU,IAAI,SAAA;AAAA,QACzC;AAAA,MAAA;AAEF,aAAO,QAAQ,GAAG,MAAM;AAAA,IAC1B,CAAC;AAAA,EACH;AACF;AAWA,SAAS,YAAY,KAAqB;AACxC,QAAM,OAAO,WAAW,MAAM,EAAE,OAAO,GAAG,EAAE,OAAA;AAC5C,SAAO,KAAK,WAAW,GAAG,kBAAkB;AAC9C;AAMA,MAAM,qBAAqB;"}
@@ -1 +0,0 @@
1
- {"version":3,"file":"postgresql-driver-CIk94XCq.cjs","sources":["../src/drivers/postgresql/migrations.ts","../src/drivers/postgresql/postgresql-driver.ts"],"sourcesContent":["import { TableName } from '../table-names';\nimport type { FlavourMigration, MigrationNames } from '../shared/migration';\n// NOTE: column names, statuses and enum values here are intentionally raw string literals, NOT the\n// `*Column`/`JobStatus` enums the drivers use. A migration is a frozen record of a\n// schema that has already been applied; renaming an enum member must never retroactively rewrite a\n// past migration's DDL.\n\n/**\n * Predefined PostgreSQL DDL, version by version. Authored by hand for this engine; not generated at\n * runtime. There is a single version so far — the base schema — but the array is the extension\n * point: a future change appends `{ version: 2, ... }` with its own statement builder rather than\n * editing `v1`, which is a frozen record of what has already been applied.\n *\n * The statement builders are exported because PGLite is PostgreSQL compiled to WASM and reuses them\n * verbatim (see `../pglite/migrations.ts`) — every other engine authors its own copy under its own\n * folder, so a change here reaches PostgreSQL and PGLite and no one else.\n *\n * **Keys and indexes.** PostgreSQL is a capable engine, so the schema uses them: a primary key per\n * table (which is also what makes `INSERT … ON CONFLICT DO NOTHING` a legal get-or-create for the\n * queue and instance rows), plus one index per hot access path — the claim query, the two\n * maintenance sweeps, the retention sweep, both dedup lookups, the newest-first job page and the\n * due-schedule scan. Nothing beyond the primary keys is a *uniqueness* constraint: idempotency and\n * singleton dedup stay enforced in driver code, so behaviour is identical on an engine that cannot\n * honour such a constraint — and so a dedup never surfaces as a constraint violation.\n */\n\n/** Version 1 — the full base schema, its keys and its indexes. */\nexport function v1(names: MigrationNames): string[] {\n const t = names.name;\n const idx = names.derived;\n const statements: string[] = [];\n\n // The schema must exist before anything can be created in it. Only emitted when one was asked\n // for; without a `schema` option every object lands in the connection's search path as before.\n if (names.schema) statements.push(`CREATE SCHEMA IF NOT EXISTS ${names.schema}`);\n\n statements.push(\n `CREATE TABLE IF NOT EXISTS ${t(TableName.QUEUE)} (\n name TEXT NOT NULL PRIMARY KEY,\n processing_paused SMALLINT NOT NULL DEFAULT 0,\n accepting_paused SMALLINT NOT NULL DEFAULT 0,\n created_at BIGINT NOT NULL,\n updated_at BIGINT NOT NULL\n )`,\n `CREATE TABLE IF NOT EXISTS ${t(TableName.JOB)} (\n id TEXT NOT NULL PRIMARY KEY,\n queue_name TEXT NOT NULL,\n status TEXT NOT NULL,\n priority INTEGER NOT NULL DEFAULT 0,\n data TEXT,\n return_value TEXT,\n created_at BIGINT NOT NULL,\n updated_at BIGINT NOT NULL,\n start_after BIGINT NOT NULL,\n expire_at BIGINT,\n started_at BIGINT,\n completed_at BIGINT,\n failed_at BIGINT,\n retried_at BIGINT,\n stalled_at BIGINT,\n cancelled_at BIGINT,\n expired_at BIGINT,\n locked_until BIGINT,\n lock_token TEXT,\n preferred_instance_key_pattern TEXT,\n processed_on_instance_key TEXT,\n retry_attempt INTEGER NOT NULL DEFAULT 0,\n retry_max_attempts INTEGER NOT NULL DEFAULT 1,\n retry_delay_seconds BIGINT NOT NULL DEFAULT 0,\n retry_backoff TEXT NOT NULL DEFAULT 'FIXED',\n retry_backoff_factor REAL,\n retry_max_delay_seconds BIGINT,\n retry_jitter SMALLINT NOT NULL DEFAULT 0,\n failure_message TEXT,\n retention_ttl_seconds BIGINT,\n retention_statuses INTEGER,\n idempotency_key TEXT,\n schedule_id TEXT,\n singleton_key TEXT\n )`,\n `CREATE TABLE IF NOT EXISTS ${t(TableName.SCHEDULE)} (\n id TEXT NOT NULL PRIMARY KEY,\n queue_name TEXT NOT NULL,\n cron TEXT,\n every_seconds BIGINT,\n timezone TEXT,\n data TEXT,\n job_options TEXT,\n priority INTEGER,\n retry_max_attempts INTEGER,\n retry_delay_seconds BIGINT,\n next_run_at BIGINT,\n last_run_at BIGINT,\n enabled SMALLINT NOT NULL DEFAULT 1,\n created_at BIGINT NOT NULL,\n updated_at BIGINT NOT NULL,\n idempotency_key TEXT\n )`,\n `CREATE TABLE IF NOT EXISTS ${t(TableName.INSTANCE)} (\n instance_key TEXT NOT NULL PRIMARY KEY,\n processing_paused SMALLINT NOT NULL DEFAULT 0,\n created_at BIGINT NOT NULL,\n updated_at BIGINT NOT NULL,\n last_seen_at BIGINT NOT NULL,\n cpu_percent REAL,\n memory_percent REAL\n )`,\n `CREATE TABLE IF NOT EXISTS ${t(TableName.MIGRATION)} (\n version INTEGER NOT NULL PRIMARY KEY,\n created_at BIGINT NOT NULL,\n updated_at BIGINT NOT NULL\n )`,\n );\n\n // Index names stay unqualified: PostgreSQL files an index in its table's own schema, and naming\n // the schema on both sides of `CREATE INDEX … ON …` is an error.\n statements.push(\n // The claim query, in its exact order: narrow by queue and claimable status, then take the\n // highest priority and oldest due row.\n `CREATE INDEX IF NOT EXISTS ${idx(TableName.JOB, 'claim_idx')} ` +\n `ON ${t(TableName.JOB)} (queue_name, status, priority DESC, start_after ASC)`,\n // reclaimStalledJobs: ACTIVE rows whose lock has lapsed.\n `CREATE INDEX IF NOT EXISTS ${idx(TableName.JOB, 'stalled_idx')} ` +\n `ON ${t(TableName.JOB)} (status, locked_until)`,\n // expireDueJobs: due-but-unstarted rows past their deadline.\n `CREATE INDEX IF NOT EXISTS ${idx(TableName.JOB, 'expiry_idx')} ` +\n `ON ${t(TableName.JOB)} (status, expire_at)`,\n // The retention sweep, which only ever looks at rows that carry a TTL and are finished.\n `CREATE INDEX IF NOT EXISTS ${idx(TableName.JOB, 'retention_idx')} ` +\n `ON ${t(TableName.JOB)} (status, retention_ttl_seconds) ` +\n `WHERE retention_ttl_seconds IS NOT NULL`,\n // Idempotency dedup.\n `CREATE INDEX IF NOT EXISTS ${idx(TableName.JOB, 'idempotency_idx')} ` +\n `ON ${t(TableName.JOB)} (queue_name, idempotency_key) ` +\n `WHERE idempotency_key IS NOT NULL`,\n // Singleton dedup, which also filters on the \"holds a slot\" statuses.\n `CREATE INDEX IF NOT EXISTS ${idx(TableName.JOB, 'singleton_idx')} ` +\n `ON ${t(TableName.JOB)} (queue_name, singleton_key, status) ` +\n `WHERE singleton_key IS NOT NULL`,\n // The newest-first job page every list read uses.\n `CREATE INDEX IF NOT EXISTS ${idx(TableName.JOB, 'created_idx')} ` +\n `ON ${t(TableName.JOB)} (created_at DESC)`,\n // Jobs a schedule produced (the schedule detail view).\n `CREATE INDEX IF NOT EXISTS ${idx(TableName.JOB, 'schedule_idx')} ` +\n `ON ${t(TableName.JOB)} (schedule_id) WHERE schedule_id IS NOT NULL`,\n // Per-instance attribution: the instance detail view and its grouped counts.\n `CREATE INDEX IF NOT EXISTS ${idx(TableName.JOB, 'instance_idx')} ` +\n `ON ${t(TableName.JOB)} (processed_on_instance_key, status) ` +\n `WHERE processed_on_instance_key IS NOT NULL`,\n // getDueSchedules: armed schedules whose next run has arrived.\n `CREATE INDEX IF NOT EXISTS ${idx(TableName.SCHEDULE, 'due_idx')} ` +\n `ON ${t(TableName.SCHEDULE)} (enabled, next_run_at)`,\n // Schedules of one queue, in the list's own order.\n `CREATE INDEX IF NOT EXISTS ${idx(TableName.SCHEDULE, 'queue_idx')} ` +\n `ON ${t(TableName.SCHEDULE)} (queue_name, created_at)`,\n // The schedule dedup lookup.\n `CREATE INDEX IF NOT EXISTS ${idx(TableName.SCHEDULE, 'idempotency_idx')} ` +\n `ON ${t(TableName.SCHEDULE)} (queue_name, idempotency_key) ` +\n `WHERE idempotency_key IS NOT NULL`,\n // The instance list's liveness filter.\n `CREATE INDEX IF NOT EXISTS ${idx(TableName.INSTANCE, 'seen_idx')} ` +\n `ON ${t(TableName.INSTANCE)} (last_seen_at)`,\n );\n\n return statements;\n}\n\nexport const POSTGRESQL_MIGRATIONS: FlavourMigration[] = [{ version: 1, statements: v1 }];\n","import { createHash } from 'node:crypto';\nimport { DatabaseEngine, DeduplicationReason } from '../../options/enums';\nimport { ACTIVE_STATUSES, FINISHED_STATUSES, JobStatus } from '../../jobs/job-state.enum';\nimport { capabilities, DriverCapability, type DriverCapabilitySet } from '../driver-capabilities';\nimport {\n DriverConnectionError,\n DriverQueryError,\n MissingPeerDependencyError,\n} from '../../errors/errors';\nimport {\n TableName,\n QueueColumn,\n JobColumn,\n ScheduleColumn,\n InstanceColumn,\n MigrationColumn,\n} from '../table-names';\nimport {\n BaseDriver,\n JOB_COLUMNS,\n SCHEDULE_INSERT_COLUMNS,\n type RawResult,\n type Row,\n type Session,\n} from '../shared/base-driver';\nimport { retentionStatusBit } from '../shared/retention-statuses';\nimport { MS_PER_SECOND } from '../../util/seconds';\nimport { toMigrationSteps } from '../shared/migration';\nimport { POSTGRESQL_MIGRATIONS } from './migrations';\nimport type {\n Driver,\n DriverProbe,\n InstanceListFilter,\n JobListFilter,\n JobRef,\n MigrationStep,\n PageWindow,\n QueueListFilter,\n RequeuedJobRef,\n ScheduleListFilter,\n ScheduleRef,\n StalledJobRef,\n Subscription,\n} from '../driver.interface';\nimport type {\n InsertedJobRow,\n InstanceMetrics,\n InstanceRow,\n JobRecord,\n NewJobRecord,\n NewScheduleRow,\n QueueRow,\n ScheduleRow,\n} from '../../jobs/job-record';\nimport type { QueueOptions } from '../../options/queue-options';\nimport type { TransactionHandle } from '../../tx/transaction-handle';\n\nexport interface PostgresqlDriverOptions {\n connectionString?: string;\n /** An existing `pg.Pool` to share with the app. */\n pool?: unknown;\n /** Any `pg.PoolConfig` (host/user/password/database/…). */\n config?: Record<string, unknown>;\n /**\n * DB schema for all objects. Every table name is qualified with it and the migration creates it\n * (`CREATE SCHEMA IF NOT EXISTS`), so this is honoured rather than merely accepted.\n */\n schema?: string;\n /** Prefix for all created tables (default 'pq_'). */\n tablePrefix?: string;\n /** Logical prefix for pub/sub channels when multiple PortQueues share one DB. */\n namespace?: string;\n}\n\ninterface PgQueryResult {\n rows: Array<Record<string, unknown>>;\n rowCount: number | null;\n}\ninterface PgClient {\n query(sql: string, params?: readonly unknown[]): Promise<PgQueryResult>;\n release(): void;\n on(event: string, cb: (msg: { channel: string; payload?: string }) => void): void;\n}\ninterface PgPool {\n query(sql: string, params?: readonly unknown[]): Promise<PgQueryResult>;\n connect(): Promise<PgClient>;\n end(): Promise<void>;\n}\n\nexport type { RawResult, Session };\n\n/** `undefined_table` — the only error `getSchemaVersion` may read as \"never migrated\". */\nconst PG_UNDEFINED_TABLE = '42P01';\n/** `invalid_schema_name` — the schema itself is absent, which is the same \"not migrated\" state. */\nconst PG_UNDEFINED_SCHEMA = '3F000';\n\n/**\n * PostgreSQL driver — the full-feature reference driver and the sole owner of the PG-wire SQL\n * surface: `$1`-style placeholders, LISTEN/NOTIFY on a dedicated connection, advisory locks for\n * leader-only tasks, SKIP LOCKED claiming, RETURNING everywhere, real keys and indexes. No method\n * emits a relational JOIN — relationships resolve by name/key lookups — and idempotency/singleton\n * dedup is enforced here in code rather than by a constraint, so behaviour matches an engine that\n * could not honour one. The `pg` package is an optional peer, imported lazily inside `connect()`.\n *\n * Row mapping, value conversion, insert value lists and the affinity scan arithmetic come from\n * {@link BaseDriver} — mechanism, not SQL. Every statement string in this file is PostgreSQL'.\n *\n * PG-wire subclassing: `PgliteDriver` extends this class and overrides only the connection\n * mechanism (`connect`/`disconnect`/`execute`/`transaction`/`probe`) plus the features PGLite\n * lacks. Every query method below is therefore shared with PGLite — treat a change here as a\n * change to both engines, and if a tweak is genuinely PostgreSQL-only, override it in `PgliteDriver`\n * rather than branching on the engine here. No other engine shares this code.\n */\nexport class PostgresqlDriver extends BaseDriver implements Driver {\n readonly engine: DatabaseEngine = DatabaseEngine.POSTGRESQL;\n readonly capabilities: DriverCapabilitySet = capabilities({\n [DriverCapability.SKIP_LOCKED]: true,\n [DriverCapability.RETURNING]: true,\n [DriverCapability.TRANSACTIONS]: true,\n [DriverCapability.LISTEN_NOTIFY]: true,\n [DriverCapability.ADVISORY_LOCK]: true,\n });\n readonly migrations: MigrationStep[] = toMigrationSteps(POSTGRESQL_MIGRATIONS);\n\n private pool: PgPool | null = null;\n private listenClient: PgClient | null = null;\n /**\n * Connections held for the advisory locks this driver has taken, keyed by lock name. An advisory\n * lock is session-scoped, so the connection that took it is the only one that can release it.\n */\n private readonly lockClients = new Map<string, PgClient>();\n private readonly listeners = new Map<string, Set<(payload: string) => void>>();\n private readonly options: PostgresqlDriverOptions;\n\n constructor(options: PostgresqlDriverOptions = {}) {\n super({\n ...(options.tablePrefix !== undefined ? { tablePrefix: options.tablePrefix } : {}),\n ...(options.schema !== undefined ? { schema: options.schema } : {}),\n ...(options.namespace !== undefined ? { namespace: options.namespace } : {}),\n });\n this.options = options;\n }\n\n // --- Connection management ---\n async connect(): Promise<void> {\n if (this.options.pool) {\n this.pool = this.options.pool as PgPool;\n return;\n }\n let pg: { Pool: new (config?: Record<string, unknown>) => PgPool };\n try {\n // Dynamic specifier so TS doesn't require the optional peer's types at build time.\n const mod = (await import('pg' as string)) as { default?: { Pool: PgPool }; Pool?: PgPool };\n pg = (mod.default ?? mod) as unknown as {\n Pool: new (config?: Record<string, unknown>) => PgPool;\n };\n } catch {\n throw new MissingPeerDependencyError('pg', 'PostgreSQL');\n }\n try {\n const config: Record<string, unknown> = { ...this.options.config };\n if (this.options.connectionString) config.connectionString = this.options.connectionString;\n this.pool = new pg.Pool(config);\n await this.pool.query('SELECT 1');\n } catch (err) {\n throw new DriverConnectionError('Failed to connect to PostgreSQL.', err);\n }\n }\n\n async disconnect(): Promise<void> {\n this.listenClient?.release();\n this.listenClient = null;\n // Releasing the connection drops the session, and with it any advisory lock still held on it —\n // which is the backstop for a process that dies mid-migration.\n for (const client of this.lockClients.values()) client.release();\n this.lockClients.clear();\n if (this.pool && !this.options.pool) await this.pool.end();\n this.pool = null;\n }\n\n /** Run one statement. `protected` so a PG-wire subclass can swap in its own client. */\n protected async execute(\n sql: string,\n params: readonly unknown[],\n session?: Session,\n ): Promise<RawResult> {\n const target = (session as PgClient | undefined) ?? this.pool;\n if (!target) throw new DriverConnectionError('PostgreSQL driver is not connected.');\n const res = await target.query(sql, params);\n return { rows: res.rows ?? [], rowCount: res.rowCount ?? res.rows?.length ?? 0 };\n }\n\n /** Wrap `fn` in a transaction. `protected` so a PG-wire subclass can swap in its own client. */\n protected async transaction<T>(fn: (session: Session) => Promise<T>): Promise<T> {\n if (!this.pool) throw new DriverConnectionError('PostgreSQL driver is not connected.');\n const client = await this.pool.connect();\n try {\n await client.query('BEGIN');\n const result = await fn(client);\n await client.query('COMMIT');\n return result;\n } catch (err) {\n await client.query('ROLLBACK').catch(() => undefined);\n throw err;\n } finally {\n client.release();\n }\n }\n\n /** PostgreSQL uses `$1`-style positional placeholders. */\n protected ph(index0: number): string {\n return `$${index0 + 1}`;\n }\n\n /**\n * The trailing `LIMIT`/`OFFSET` for a list read, appending each bound value to `params`.\n * Returns an empty string when the caller asked for no window, so core's unpaged reads emit\n * exactly the SQL they always did.\n */\n protected window(page: PageWindow, params: unknown[]): string {\n let sql = '';\n if (page.limit !== undefined) {\n sql += ` LIMIT ${this.ph(params.length)}`;\n params.push(Math.max(Math.trunc(page.limit), 0));\n }\n if (page.offset !== undefined) {\n sql += ` OFFSET ${this.ph(params.length)}`;\n params.push(Math.max(Math.trunc(page.offset), 0));\n }\n return sql;\n }\n\n // --- Probe / migration ---\n async probe(): Promise<DriverProbe> {\n let serverVersion = 'unknown';\n if (this.pool) {\n const res = await this.pool.query('SHOW server_version');\n serverVersion = String(res.rows[0]?.server_version ?? 'unknown');\n }\n return { serverVersion, verifiedCapabilities: this.enabledCapabilities() };\n }\n\n /**\n * The applied schema version, or null when the migration table (or its schema) does not exist yet.\n * Only those two error codes read as \"not migrated\": a dropped connection or a permissions error\n * has to surface, because reading it as version 0 would start a full migration run against a\n * database that may already be fully migrated.\n */\n async getSchemaVersion(): Promise<number | null> {\n try {\n const res = await this.execute(\n `SELECT MAX(${MigrationColumn.VERSION}) AS v FROM ${this.t(TableName.MIGRATION)}`,\n [],\n );\n const v = res.rows[0]?.v;\n return v == null ? null : Number(v);\n } catch (err) {\n if (this.isMissingSchemaObject(err)) return null;\n throw new DriverQueryError('Failed to read the applied schema version.', err);\n }\n }\n\n /** Whether an error means \"the object isn't there yet\" rather than \"the query failed\". */\n protected isMissingSchemaObject(err: unknown): boolean {\n const code = (err as { code?: unknown } | null)?.code;\n return code === PG_UNDEFINED_TABLE || code === PG_UNDEFINED_SCHEMA;\n }\n\n /**\n * Apply one migration's DDL and record its version in the **same** transaction, so a crash\n * between the two can never leave an applied-but-unrecorded migration.\n */\n async applyMigration(options: { migration: MigrationStep }): Promise<void> {\n const { migration } = options;\n const statements = migration.statements(this.context);\n await this.transaction(async (session) => {\n for (const sql of statements) await this.execute(sql, [], session);\n const now = Date.now();\n await this.execute(\n `INSERT INTO ${this.t(TableName.MIGRATION)} (${MigrationColumn.VERSION}, ${MigrationColumn.CREATED_AT}, ${MigrationColumn.UPDATED_AT}) ` +\n `VALUES (${this.phList(3)}) ON CONFLICT (${MigrationColumn.VERSION}) DO NOTHING`,\n [migration.version, now, now],\n session,\n );\n });\n }\n\n // --- Producing ---\n async insertJob(options: { job: NewJobRecord; tx?: TransactionHandle }): Promise<InsertedJobRow> {\n const [result] = await this.insertJobs({\n jobs: [options.job],\n ...(options.tx ? { tx: options.tx } : {}),\n });\n return result!;\n }\n\n /**\n * A real batch insert: one grouped dedup lookup per distinct queue, then a single multi-row\n * `INSERT … RETURNING`. The dedup pre-check and the insert share one transaction, which is both\n * the \"read-then-write runs in a transaction\" invariant and what narrows the dedup race to the\n * width of a single statement pair.\n */\n async insertJobs(options: {\n jobs: NewJobRecord[];\n tx?: TransactionHandle;\n }): Promise<InsertedJobRow[]> {\n const { jobs, tx } = options;\n if (!jobs.length) return [];\n return this.inTx(tx, async (run) => {\n await this.lockQueuesForDedup(run, jobs);\n const deduped = await this.findDeduplicated(jobs, run);\n const results = new Array<InsertedJobRow | undefined>(jobs.length);\n const fresh: Array<{ index: number; id: string; values: unknown[] }> = [];\n\n for (const [index, job] of jobs.entries()) {\n const hit = deduped.get(job);\n if (hit) {\n results[index] = hit;\n continue;\n }\n const { id, values } = this.jobInsertValues(job);\n fresh.push({ index, id, values });\n }\n\n // Chunked so one statement never exceeds the engine's bound-parameter limit; each chunk is\n // still a single multi-row insert.\n for (const chunk of this.chunkForBind(fresh, JOB_COLUMNS.length)) {\n if (!chunk.length) continue;\n const params: unknown[] = [];\n const tuples = chunk.map(({ values }) => {\n const placeholders = this.phList(values.length, params.length);\n params.push(...values);\n return `(${placeholders})`;\n });\n try {\n const inserted = await run(\n `INSERT INTO ${this.t(TableName.JOB)} (${JOB_COLUMNS.join(', ')}) VALUES ${tuples.join(', ')} ` +\n `RETURNING ${JobColumn.ID}, ${JobColumn.STATUS}, ${JobColumn.START_AFTER}`,\n params,\n );\n // Paired back by id rather than by position, so nothing depends on RETURNING preserving\n // the VALUES order.\n const byId = new Map(inserted.rows.map((row) => [String(row[JobColumn.ID]), row]));\n for (const { index, id } of chunk) {\n const row = byId.get(id);\n if (!row) throw new DriverQueryError(`Insert did not return job '${id}'.`);\n results[index] = {\n id,\n status: row[JobColumn.STATUS] as JobStatus,\n startAfter: Number(row[JobColumn.START_AFTER]),\n deduplicated: false,\n };\n }\n } catch (err) {\n if (err instanceof DriverQueryError) throw err;\n throw new DriverQueryError(\n `Failed to insert ${chunk.length} job(s) on queue '${jobs[chunk[0]!.index]!.queueName}'.`,\n err,\n );\n }\n }\n return results as InsertedJobRow[];\n });\n }\n\n /**\n * Locate the existing jobs that dedup this batch, in one lookup per distinct queue and key kind\n * rather than two per job. No unique index enforces either key — dedup lives in code so every\n * engine behaves identically and a duplicate returns the existing job instead of raising.\n */\n /**\n * Serialize the dedup-lookup-then-insert pair against another producer's, per queue.\n *\n * Only called when a batch actually carries an idempotency or singleton key. Without it the pair is\n * a read-then-write under `READ COMMITTED`: two concurrent `addJob`s with the same key both see no\n * row and both insert, and the dedup silently fails. Locking the **queue row** — which every keyed\n * insert on that queue must take — closes it with no schema change and no uniqueness constraint\n * that a singleton's status predicate could not express anyway. A queue with no keyed jobs never\n * pays for it, and a queue whose row does not exist yet locks nothing, which is no worse than\n * before.\n */\n private async lockQueuesForDedup(\n run: (sql: string, params: readonly unknown[]) => Promise<RawResult>,\n jobs: NewJobRecord[],\n ): Promise<void> {\n const names = [\n ...new Set(\n jobs.flatMap((j) =>\n j.idempotencyKey != null || j.singletonKey != null ? [j.queueName] : [],\n ),\n ),\n ].sort(); // a stable order, so two batches over the same queues cannot deadlock each other\n if (!names.length) return;\n await run(\n `SELECT ${QueueColumn.NAME} FROM ${this.t(TableName.QUEUE)} ` +\n `WHERE ${QueueColumn.NAME} IN (${this.phList(names.length)}) FOR UPDATE`,\n names,\n );\n }\n\n private async findDeduplicated(\n jobs: NewJobRecord[],\n run: (sql: string, params: readonly unknown[]) => Promise<RawResult>,\n ): Promise<Map<NewJobRecord, InsertedJobRow>> {\n const out = new Map<NewJobRecord, InsertedJobRow>();\n const cols = `${JobColumn.ID}, ${JobColumn.STATUS}, ${JobColumn.START_AFTER}`;\n\n const byQueue = new Map<string, NewJobRecord[]>();\n for (const job of jobs) {\n if (job.idempotencyKey == null && job.singletonKey == null) continue;\n const list = byQueue.get(job.queueName);\n if (list) list.push(job);\n else byQueue.set(job.queueName, [job]);\n }\n\n for (const [queueName, queueJobs] of byQueue) {\n const idemKeys = [\n ...new Set(queueJobs.flatMap((j) => (j.idempotencyKey ? [j.idempotencyKey] : []))),\n ];\n if (idemKeys.length) {\n const res = await run(\n `SELECT ${cols}, ${JobColumn.IDEMPOTENCY_KEY} FROM ${this.t(TableName.JOB)} ` +\n `WHERE ${JobColumn.QUEUE_NAME} = ${this.ph(0)} AND ${JobColumn.IDEMPOTENCY_KEY} IN (${this.phList(idemKeys.length, 1)})`,\n [queueName, ...idemKeys],\n );\n const found = new Map(res.rows.map((r) => [String(r[JobColumn.IDEMPOTENCY_KEY]), r]));\n for (const job of queueJobs) {\n if (job.idempotencyKey == null) continue;\n const row = found.get(job.idempotencyKey);\n if (row) out.set(job, this.dedupResult(row, DeduplicationReason.IDEMPOTENCY));\n }\n }\n\n const singletonKeys = [\n ...new Set(\n queueJobs.flatMap((j) => (!out.has(j) && j.singletonKey ? [j.singletonKey] : [])),\n ),\n ];\n if (singletonKeys.length) {\n const statusPh = this.phList(ACTIVE_STATUSES.length, 1 + singletonKeys.length);\n const res = await run(\n `SELECT ${cols}, ${JobColumn.SINGLETON_KEY} FROM ${this.t(TableName.JOB)} ` +\n `WHERE ${JobColumn.QUEUE_NAME} = ${this.ph(0)} AND ${JobColumn.SINGLETON_KEY} IN (${this.phList(singletonKeys.length, 1)}) ` +\n `AND ${JobColumn.STATUS} IN (${statusPh})`,\n [queueName, ...singletonKeys, ...ACTIVE_STATUSES],\n );\n const found = new Map(res.rows.map((r) => [String(r[JobColumn.SINGLETON_KEY]), r]));\n for (const job of queueJobs) {\n if (out.has(job) || job.singletonKey == null) continue;\n const row = found.get(job.singletonKey);\n if (row) out.set(job, this.dedupResult(row, DeduplicationReason.SINGLETON));\n }\n }\n }\n return out;\n }\n\n /** Shape a dedup hit the way `insertJob`'s caller reports it. */\n protected dedupResult(row: Row, reason: DeduplicationReason): InsertedJobRow {\n return {\n id: String(row[JobColumn.ID]),\n status: row[JobColumn.STATUS] as JobStatus,\n startAfter: Number(row[JobColumn.START_AFTER]),\n deduplicated: true,\n deduplicationReason: reason,\n };\n }\n\n async findJobByIdempotencyKey(options: {\n queueName: string;\n idempotencyKey: string;\n tx?: TransactionHandle;\n }): Promise<InsertedJobRow | null> {\n const res = await this.runMaybeTx(\n `SELECT ${JobColumn.ID}, ${JobColumn.STATUS}, ${JobColumn.START_AFTER} FROM ${this.t(TableName.JOB)} ` +\n `WHERE ${JobColumn.QUEUE_NAME} = ${this.ph(0)} AND ${JobColumn.IDEMPOTENCY_KEY} = ${this.ph(1)}`,\n [options.queueName, options.idempotencyKey],\n options.tx,\n );\n return res.rows[0] ? this.dedupResult(res.rows[0], DeduplicationReason.IDEMPOTENCY) : null;\n }\n\n async findScheduleByIdempotencyKey(options: {\n queueName: string;\n idempotencyKey: string;\n tx?: TransactionHandle;\n }): Promise<ScheduleRow | null> {\n const res = await this.runMaybeTx(\n `SELECT * FROM ${this.t(TableName.SCHEDULE)} WHERE ${ScheduleColumn.QUEUE_NAME} = ${this.ph(0)} AND ${ScheduleColumn.IDEMPOTENCY_KEY} = ${this.ph(1)}`,\n [options.queueName, options.idempotencyKey],\n options.tx,\n );\n return res.rows[0] ? this.mapSchedule(res.rows[0]) : null;\n }\n\n async insertSchedule(options: {\n schedule: NewScheduleRow;\n tx?: TransactionHandle;\n }): Promise<ScheduleRow> {\n // Plain INSERT — NOT an UPSERT and no pattern-based dedup. Identical recurrences on a queue are\n // allowed to coexist by design; the caller enforces idempotency-key dedup ahead of this call\n // (see ProducerService), so nothing here needs a conflict target.\n const { values } = this.scheduleInsertValues(options.schedule, Date.now());\n const res = await this.runMaybeTx(\n `INSERT INTO ${this.t(TableName.SCHEDULE)} (${SCHEDULE_INSERT_COLUMNS.join(', ')}) ` +\n `VALUES (${this.phList(values.length)}) RETURNING *`,\n values,\n options.tx,\n );\n return this.mapSchedule(res.rows[0]!);\n }\n\n async deleteSchedule(options: {\n scheduleId: string;\n tx?: TransactionHandle;\n }): Promise<ScheduleRef | null> {\n const [ref] = await this.deleteSchedules({\n scheduleIds: [options.scheduleId],\n ...(options.tx ? { tx: options.tx } : {}),\n });\n return ref ?? null;\n }\n\n async deleteSchedules(options: {\n scheduleIds: string[];\n tx?: TransactionHandle;\n }): Promise<ScheduleRef[]> {\n if (!options.scheduleIds.length) return [];\n // Chunked so one statement can never carry more ids than the engine allows in an\n // `IN (...)` list. A capped batch is a single chunk, and so a single statement.\n return this.overIdChunks(options.scheduleIds, async (scheduleIds) => {\n // One statement for the whole set, returning each removed row's queue so the caller can emit\n // its event without a read-back per id.\n const res = await this.runMaybeTx(\n `DELETE FROM ${this.t(TableName.SCHEDULE)} WHERE ${ScheduleColumn.ID} IN (${this.phList(scheduleIds.length)}) ` +\n `RETURNING ${ScheduleColumn.ID}, ${ScheduleColumn.QUEUE_NAME}`,\n scheduleIds,\n options.tx,\n );\n return res.rows.map((r) => this.mapScheduleRef(r));\n });\n }\n\n async setScheduleEnabled(options: {\n scheduleId: string;\n enabled: boolean;\n now: number;\n tx?: TransactionHandle;\n }): Promise<ScheduleRef | null> {\n const res = await this.runMaybeTx(\n `UPDATE ${this.t(TableName.SCHEDULE)} SET ${ScheduleColumn.ENABLED} = ${this.ph(0)}, ${ScheduleColumn.UPDATED_AT} = ${this.ph(1)} ` +\n `WHERE ${ScheduleColumn.ID} = ${this.ph(2)} RETURNING ${ScheduleColumn.ID}, ${ScheduleColumn.QUEUE_NAME}`,\n [this.boolIn(options.enabled), options.now, options.scheduleId],\n options.tx,\n );\n return res.rows[0] ? this.mapScheduleRef(res.rows[0]) : null;\n }\n\n // --- Claiming (hot path) ---\n async claimJobs(options: {\n queueName: string;\n limit: number;\n lockDurationSeconds: number;\n now: number;\n instanceKey?: string | null;\n }): Promise<JobRecord[]> {\n const { queueName, limit, lockDurationSeconds, now, instanceKey } = options;\n const lockedUntil = this.lockDeadline(now, lockDurationSeconds);\n // One token per claim call: every row this claim takes carries it, and every completion is\n // fenced on it (see `claimFence`). A later claim of the same row writes a different one.\n const lockToken = this.newId();\n const cols = JOB_COLUMNS.join(', ');\n\n // Single-instance mode: one guarded UPDATE ... RETURNING inside a transaction. `SKIP LOCKED`\n // makes the inner select skip rows another claimer already holds, and the outer UPDATE is what\n // actually takes them — so no two workers can ever return the same row.\n if (!instanceKey) {\n return this.transaction(async (session) => {\n const res = await this.execute(\n `UPDATE ${this.t(TableName.JOB)} SET ${JobColumn.STATUS} = ${this.ph(0)}, ${JobColumn.STARTED_AT} = ${this.ph(1)}, ` +\n `${JobColumn.LOCKED_UNTIL} = ${this.ph(2)}, ${JobColumn.LOCK_TOKEN} = ${this.ph(3)}, ${JobColumn.UPDATED_AT} = ${this.ph(4)} ` +\n `WHERE ${JobColumn.ID} IN (SELECT ${JobColumn.ID} FROM ${this.t(TableName.JOB)} ` +\n `WHERE ${JobColumn.QUEUE_NAME} = ${this.ph(5)} AND ${JobColumn.STATUS} IN (${this.ph(6)}, ${this.ph(7)}) ` +\n `AND ${JobColumn.START_AFTER} <= ${this.ph(8)} AND (${JobColumn.EXPIRE_AT} IS NULL OR ${JobColumn.EXPIRE_AT} > ${this.ph(9)}) ` +\n `ORDER BY ${JobColumn.PRIORITY} DESC, ${JobColumn.START_AFTER} ASC LIMIT ${this.ph(10)} FOR UPDATE SKIP LOCKED) ` +\n `RETURNING ${cols}`,\n [\n JobStatus.ACTIVE,\n now,\n lockedUntil,\n lockToken,\n now,\n queueName,\n JobStatus.PENDING,\n JobStatus.RETRY,\n now,\n now,\n limit,\n ],\n session,\n );\n return this.sortClaimed(res.rows.map((r) => this.mapJob(r)));\n });\n }\n\n // Multi-instance mode: affinity is a regex, which portable SQL cannot evaluate, so page through\n // candidates highest-priority-first and filter here. The scan takes `FOR UPDATE SKIP LOCKED`\n // and the guarded UPDATE runs in the same transaction, so a candidate this instance picks\n // cannot be claimed by another between the two statements.\n const { pageSize, maxScan } = this.affinityPlan(limit);\n return this.transaction(async (session) => {\n const ids = new Set<string>();\n for (let offset = 0; ids.size < limit && offset < maxScan; offset += pageSize) {\n const sel = await this.execute(\n `SELECT ${JobColumn.ID}, ${JobColumn.PREFERRED_INSTANCE_KEY_PATTERN} FROM ${this.t(TableName.JOB)} ` +\n `WHERE ${JobColumn.QUEUE_NAME} = ${this.ph(0)} AND ${JobColumn.STATUS} IN (${this.ph(1)}, ${this.ph(2)}) ` +\n `AND ${JobColumn.START_AFTER} <= ${this.ph(3)} AND (${JobColumn.EXPIRE_AT} IS NULL OR ${JobColumn.EXPIRE_AT} > ${this.ph(4)}) ` +\n `ORDER BY ${JobColumn.PRIORITY} DESC, ${JobColumn.START_AFTER} ASC ` +\n `LIMIT ${this.ph(5)} OFFSET ${this.ph(6)} FOR UPDATE SKIP LOCKED`,\n [queueName, JobStatus.PENDING, JobStatus.RETRY, now, now, pageSize, offset],\n session,\n );\n if (sel.rows.length === 0) break; // exhausted — nothing more to scan\n this.collectAffinityMatches(sel.rows, instanceKey, limit, ids);\n if (sel.rows.length < pageSize) break; // last (partial) page\n }\n if (ids.size === 0) return [];\n const idList = [...ids];\n const head = [JobStatus.ACTIVE, now, lockedUntil, lockToken, instanceKey, now];\n const upd = await this.execute(\n `UPDATE ${this.t(TableName.JOB)} SET ${JobColumn.STATUS} = ${this.ph(0)}, ${JobColumn.STARTED_AT} = ${this.ph(1)}, ` +\n `${JobColumn.LOCKED_UNTIL} = ${this.ph(2)}, ${JobColumn.LOCK_TOKEN} = ${this.ph(3)}, ` +\n `${JobColumn.PROCESSED_ON_INSTANCE_KEY} = ${this.ph(4)}, ${JobColumn.UPDATED_AT} = ${this.ph(5)} ` +\n `WHERE ${JobColumn.ID} IN (${this.phList(idList.length, head.length)}) ` +\n `AND ${JobColumn.STATUS} IN (${this.ph(head.length + idList.length)}, ${this.ph(head.length + idList.length + 1)}) ` +\n `RETURNING ${cols}`,\n [...head, ...idList, JobStatus.PENDING, JobStatus.RETRY],\n session,\n );\n return this.sortClaimed(upd.rows.map((r) => this.mapJob(r)));\n });\n }\n\n /**\n * The fence a completion is guarded on: the row must still be `ACTIVE` and, when the caller names\n * the claim it is settling, still carry that claim's token.\n *\n * Status alone is not enough. A lapsed lock is reclaimed and the row claimed again, so it reads\n * `ACTIVE` once more — and a handler from the first run that ignored its abort signal would write\n * its outcome over the second run's. The token identifies the claim itself, so a stale completion\n * matches nothing and reports \"not settled\" instead.\n */\n private claimFence(params: unknown[], lockToken: string | null | undefined): string {\n let sql = ` AND ${JobColumn.STATUS} = ${this.ph(params.length)}`;\n params.push(JobStatus.ACTIVE);\n if (lockToken != null) {\n sql += ` AND ${JobColumn.LOCK_TOKEN} = ${this.ph(params.length)}`;\n params.push(lockToken);\n }\n return sql;\n }\n\n async extendLock(options: {\n jobId: string;\n lockDurationSeconds: number;\n now: number;\n lockToken?: string | null;\n }): Promise<boolean> {\n const params: unknown[] = [\n this.lockDeadline(options.now, options.lockDurationSeconds),\n options.now,\n options.jobId,\n ];\n const res = await this.runMaybeTx(\n `UPDATE ${this.t(TableName.JOB)} SET ${JobColumn.LOCKED_UNTIL} = ${this.ph(0)}, ${JobColumn.UPDATED_AT} = ${this.ph(1)} ` +\n `WHERE ${JobColumn.ID} = ${this.ph(2)}${this.claimFence(params, options.lockToken)}`,\n params,\n );\n return res.rowCount > 0;\n }\n\n async completeJob(options: {\n jobId: string;\n returnValue?: unknown;\n now: number;\n lockToken?: string | null;\n tx?: TransactionHandle;\n }): Promise<boolean> {\n const params: unknown[] = [\n JobStatus.COMPLETED,\n this.toJson(options.returnValue),\n options.now,\n options.now,\n options.jobId,\n ];\n const res = await this.runMaybeTx(\n `UPDATE ${this.t(TableName.JOB)} SET ${JobColumn.STATUS} = ${this.ph(0)}, ${JobColumn.RETURN_VALUE} = ${this.ph(1)}, ` +\n `${JobColumn.COMPLETED_AT} = ${this.ph(2)}, ${JobColumn.UPDATED_AT} = ${this.ph(3)}, ${JobColumn.LOCKED_UNTIL} = NULL, ${JobColumn.LOCK_TOKEN} = NULL ` +\n `WHERE ${JobColumn.ID} = ${this.ph(4)}${this.claimFence(params, options.lockToken)}`,\n params,\n options.tx,\n );\n return res.rowCount > 0;\n }\n\n async retryJob(options: {\n jobId: string;\n nextRunAt: number;\n retryAttempt: number;\n lastError: string;\n now: number;\n lockToken?: string | null;\n }): Promise<boolean> {\n const params: unknown[] = [\n JobStatus.RETRY,\n options.retryAttempt,\n options.nextRunAt,\n options.now,\n options.lastError,\n options.now,\n options.jobId,\n ];\n const res = await this.runMaybeTx(\n `UPDATE ${this.t(TableName.JOB)} SET ${JobColumn.STATUS} = ${this.ph(0)}, ${JobColumn.RETRY_ATTEMPT} = ${this.ph(1)}, ` +\n `${JobColumn.START_AFTER} = ${this.ph(2)}, ${JobColumn.RETRIED_AT} = ${this.ph(3)}, ${JobColumn.FAILURE_MESSAGE} = ${this.ph(4)}, ` +\n `${JobColumn.UPDATED_AT} = ${this.ph(5)}, ${JobColumn.LOCKED_UNTIL} = NULL, ${JobColumn.LOCK_TOKEN} = NULL ` +\n `WHERE ${JobColumn.ID} = ${this.ph(6)}${this.claimFence(params, options.lockToken)}`,\n params,\n );\n return res.rowCount > 0;\n }\n\n async failJob(options: {\n jobId: string;\n lastError: string;\n now: number;\n lockToken?: string | null;\n }): Promise<boolean> {\n const params: unknown[] = [\n JobStatus.FAILED,\n options.now,\n options.lastError,\n options.now,\n options.jobId,\n ];\n const res = await this.runMaybeTx(\n `UPDATE ${this.t(TableName.JOB)} SET ${JobColumn.STATUS} = ${this.ph(0)}, ${JobColumn.FAILED_AT} = ${this.ph(1)}, ` +\n `${JobColumn.FAILURE_MESSAGE} = ${this.ph(2)}, ${JobColumn.UPDATED_AT} = ${this.ph(3)}, ${JobColumn.LOCKED_UNTIL} = NULL, ${JobColumn.LOCK_TOKEN} = NULL ` +\n `WHERE ${JobColumn.ID} = ${this.ph(4)}${this.claimFence(params, options.lockToken)}`,\n params,\n );\n return res.rowCount > 0;\n }\n\n async reclaimStalledJobs(options: {\n queueName?: string;\n limit: number;\n now: number;\n }): Promise<StalledJobRef[]> {\n // Bounded, and returning three columns rather than all 34: the caller only needs the id, the\n // queue to wake, and who was holding the job. Return stalled jobs to PENDING (RETRY handling\n // happens in the completion path on the next failure).\n const params: unknown[] = [JobStatus.PENDING, options.now, JobStatus.ACTIVE, options.now];\n let where =\n `${JobColumn.STATUS} = ${this.ph(2)} AND ${JobColumn.LOCKED_UNTIL} IS NOT NULL ` +\n `AND ${JobColumn.LOCKED_UNTIL} < ${this.ph(3)}`;\n if (options.queueName) {\n where += ` AND ${JobColumn.QUEUE_NAME} = ${this.ph(params.length)}`;\n params.push(options.queueName);\n }\n const limitPh = this.ph(params.length);\n params.push(options.limit);\n const res = await this.runMaybeTx(\n `UPDATE ${this.t(TableName.JOB)} SET ${JobColumn.STATUS} = ${this.ph(0)}, ${JobColumn.STALLED_AT} = ${this.ph(1)}, ` +\n `${JobColumn.LOCKED_UNTIL} = NULL, ${JobColumn.LOCK_TOKEN} = NULL ` +\n `WHERE ${JobColumn.ID} IN (SELECT ${JobColumn.ID} FROM ${this.t(TableName.JOB)} WHERE ${where} LIMIT ${limitPh}) ` +\n `RETURNING ${JobColumn.ID}, ${JobColumn.QUEUE_NAME}, ${JobColumn.PROCESSED_ON_INSTANCE_KEY}`,\n params,\n );\n return res.rows.map((r) => ({\n ...this.mapJobRef(r),\n previousInstanceKey: this.strOrNull(r[JobColumn.PROCESSED_ON_INSTANCE_KEY]),\n }));\n }\n\n async expireDueJobs(options: {\n queueName?: string;\n limit: number;\n now: number;\n }): Promise<JobRef[]> {\n const params: unknown[] = [\n JobStatus.EXPIRED,\n options.now,\n options.now,\n JobStatus.PENDING,\n JobStatus.RETRY,\n options.now,\n ];\n let where =\n `${JobColumn.STATUS} IN (${this.ph(3)}, ${this.ph(4)}) AND ${JobColumn.EXPIRE_AT} IS NOT NULL ` +\n `AND ${JobColumn.EXPIRE_AT} <= ${this.ph(5)}`;\n if (options.queueName) {\n where += ` AND ${JobColumn.QUEUE_NAME} = ${this.ph(params.length)}`;\n params.push(options.queueName);\n }\n const limitPh = this.ph(params.length);\n params.push(options.limit);\n const res = await this.runMaybeTx(\n `UPDATE ${this.t(TableName.JOB)} SET ${JobColumn.STATUS} = ${this.ph(0)}, ${JobColumn.EXPIRED_AT} = ${this.ph(1)}, ` +\n `${JobColumn.UPDATED_AT} = ${this.ph(2)}, ${JobColumn.LOCKED_UNTIL} = NULL, ${JobColumn.LOCK_TOKEN} = NULL ` +\n `WHERE ${JobColumn.ID} IN (SELECT ${JobColumn.ID} FROM ${this.t(TableName.JOB)} WHERE ${where} LIMIT ${limitPh}) ` +\n `RETURNING ${JobColumn.ID}, ${JobColumn.QUEUE_NAME}`,\n params,\n );\n return res.rows.map((r) => this.mapJobRef(r));\n }\n\n async requeueJob(options: {\n jobId: string;\n now: number;\n tx?: TransactionHandle;\n }): Promise<RequeuedJobRef | null> {\n const [ref] = await this.requeueJobs({\n jobIds: [options.jobId],\n now: options.now,\n ...(options.tx ? { tx: options.tx } : {}),\n });\n return ref ?? null;\n }\n\n async requeueJobs(options: {\n jobIds: string[];\n now: number;\n tx?: TransactionHandle;\n }): Promise<RequeuedJobRef[]> {\n if (!options.jobIds.length) return [];\n // Chunked so one statement can never carry more ids than the engine allows in an\n // `IN (...)` list. A capped batch is a single chunk, and so a single statement.\n return this.overIdChunks(options.jobIds, async (jobIds) => {\n // Guarded on `status != ACTIVE`. Re-arming a running job would clear its lock and let a second\n // worker claim it while the first handler is still going — the same job running twice at once.\n // An ACTIVE or missing id is simply not re-armed, so a batch never fails on one stale id.\n const head: unknown[] = [JobStatus.PENDING, options.now, options.now];\n const res = await this.runMaybeTx(\n `UPDATE ${this.t(TableName.JOB)} SET ${JobColumn.STATUS} = ${this.ph(0)}, ${JobColumn.RETRY_ATTEMPT} = 0, ` +\n `${JobColumn.START_AFTER} = ${this.ph(1)}, ${JobColumn.FAILED_AT} = NULL, ${JobColumn.FAILURE_MESSAGE} = NULL, ` +\n `${JobColumn.COMPLETED_AT} = NULL, ${JobColumn.STARTED_AT} = NULL, ${JobColumn.CANCELLED_AT} = NULL, ` +\n `${JobColumn.EXPIRED_AT} = NULL, ${JobColumn.RETURN_VALUE} = NULL, ${JobColumn.RETRIED_AT} = NULL, ${JobColumn.STALLED_AT} = NULL, ${JobColumn.LOCKED_UNTIL} = NULL, ${JobColumn.LOCK_TOKEN} = NULL, ` +\n `${JobColumn.UPDATED_AT} = ${this.ph(2)} ` +\n `WHERE ${JobColumn.ID} IN (${this.phList(jobIds.length, head.length)}) ` +\n `AND ${JobColumn.STATUS} <> ${this.ph(head.length + jobIds.length)} ` +\n `RETURNING ${JobColumn.ID}, ${JobColumn.QUEUE_NAME}, ${JobColumn.STATUS}, ${JobColumn.START_AFTER}`,\n [...head, ...jobIds, JobStatus.ACTIVE],\n options.tx,\n );\n return res.rows.map((r) => ({\n ...this.mapJobRef(r),\n status: r[JobColumn.STATUS] as JobStatus,\n startAfter: Number(r[JobColumn.START_AFTER]),\n }));\n });\n }\n\n // --- Reading ---\n async getJob(options: { jobId: string; tx?: TransactionHandle }): Promise<JobRecord | null> {\n const res = await this.runMaybeTx(\n `SELECT ${JOB_COLUMNS.join(', ')} FROM ${this.t(TableName.JOB)} WHERE ${JobColumn.ID} = ${this.ph(0)}`,\n [options.jobId],\n options.tx,\n );\n return res.rows[0] ? this.mapJob(res.rows[0]) : null;\n }\n\n /**\n * WHERE clauses for a job filter, appending each value to `params`. Shared by `getJobs` and\n * `countJobs` so a page and its total can never disagree about what they select. `search` is\n * matched in SQL across the five fields an operator triages by, so a text query pages in the\n * database instead of streaming the table into the process.\n */\n private jobFilterClauses(options: JobListFilter, params: unknown[]): string {\n const clauses: string[] = [];\n if (options.queueName) {\n clauses.push(`${JobColumn.QUEUE_NAME} = ${this.ph(params.length)}`);\n params.push(options.queueName);\n }\n if (options.statuses && options.statuses.length) {\n clauses.push(\n `${JobColumn.STATUS} IN (${this.phList(options.statuses.length, params.length)})`,\n );\n params.push(...options.statuses);\n }\n if (options.scheduleId) {\n clauses.push(`${JobColumn.SCHEDULE_ID} = ${this.ph(params.length)}`);\n params.push(options.scheduleId);\n }\n if (options.processedOnInstanceKey) {\n clauses.push(`${JobColumn.PROCESSED_ON_INSTANCE_KEY} = ${this.ph(params.length)}`);\n params.push(options.processedOnInstanceKey);\n }\n if (options.search) {\n const pattern = this.likePattern(options.search);\n const cols = [\n JobColumn.ID,\n JobColumn.STATUS,\n JobColumn.IDEMPOTENCY_KEY,\n JobColumn.FAILURE_MESSAGE,\n JobColumn.DATA,\n ];\n const ors = cols.map((col) => {\n const clause = `${col} ILIKE ${this.ph(params.length)} ESCAPE '!'`;\n params.push(pattern);\n return clause;\n });\n clauses.push(`(${ors.join(' OR ')})`);\n }\n return clauses.length ? `WHERE ${clauses.join(' AND ')}` : '';\n }\n\n async getJobs(options: JobListFilter & { limit: number; offset: number }): Promise<JobRecord[]> {\n const params: unknown[] = [];\n const where = this.jobFilterClauses(options, params);\n const res = await this.runMaybeTx(\n `SELECT ${JOB_COLUMNS.join(', ')} FROM ${this.t(TableName.JOB)} ${where} ` +\n `ORDER BY ${JobColumn.CREATED_AT} DESC` +\n this.window(options, params),\n params,\n );\n return res.rows.map((r) => this.mapJob(r));\n }\n\n async countJobs(options: JobListFilter): Promise<number> {\n const params: unknown[] = [];\n const where = this.jobFilterClauses(options, params);\n const res = await this.runMaybeTx(\n `SELECT COUNT(*) AS c FROM ${this.t(TableName.JOB)} ${where}`,\n params,\n );\n return Number(res.rows[0]?.c ?? 0);\n }\n\n async countJobsByStatus(options: {\n queueName?: string;\n processedOnInstanceKey?: string;\n }): Promise<Record<JobStatus, number>> {\n const params: unknown[] = [];\n const where = this.jobFilterClauses(options, params);\n const res = await this.runMaybeTx(\n `SELECT ${JobColumn.STATUS}, COUNT(*) AS c FROM ${this.t(TableName.JOB)} ${where} GROUP BY ${JobColumn.STATUS}`,\n params,\n );\n const counts = this.emptyStatusCounts();\n for (const row of res.rows) counts[row[JobColumn.STATUS] as JobStatus] = Number(row.c);\n return counts;\n }\n\n /**\n * Per-status counts for many queues in one grouped pass. One query replaces the\n * `countJobsByStatus`-per-row storm a queue list page would otherwise issue.\n */\n async countJobsByStatusPerQueue(options: {\n queueNames: string[];\n }): Promise<Record<string, Record<JobStatus, number>>> {\n return this.countByStatusGrouped(JobColumn.QUEUE_NAME, options.queueNames);\n }\n\n async countJobsByStatusPerInstance(options: {\n instanceKeys: string[];\n }): Promise<Record<string, Record<JobStatus, number>>> {\n return this.countByStatusGrouped(JobColumn.PROCESSED_ON_INSTANCE_KEY, options.instanceKeys);\n }\n\n /** The shared `GROUP BY <key>, status` read behind both per-key count breakdowns. */\n private async countByStatusGrouped(\n keyColumn: JobColumn,\n keys: string[],\n ): Promise<Record<string, Record<JobStatus, number>>> {\n const out: Record<string, Record<JobStatus, number>> = {};\n for (const key of keys) out[key] = this.emptyStatusCounts();\n if (!keys.length) return out;\n // Chunked like every other key list: the instances page can ask about more keys than an engine\n // will take in one `IN (...)`, and each chunk fills its own share of the same result.\n await this.overIdChunks(keys, async (chunk) => {\n const res = await this.runMaybeTx(\n `SELECT ${keyColumn}, ${JobColumn.STATUS}, COUNT(*) AS c FROM ${this.t(TableName.JOB)} ` +\n `WHERE ${keyColumn} IN (${this.phList(chunk.length)}) GROUP BY ${keyColumn}, ${JobColumn.STATUS}`,\n chunk,\n );\n for (const row of res.rows) {\n const bucket = out[String(row[keyColumn])];\n if (bucket) bucket[row[JobColumn.STATUS] as JobStatus] = Number(row.c);\n }\n return res.rows;\n });\n return out;\n }\n\n /** WHERE clauses for a queue-list filter, appending each value to `params`. */\n private queueFilterClauses(options: QueueListFilter, params: unknown[]): string {\n const clauses: string[] = [];\n if (options.search) {\n clauses.push(`${QueueColumn.NAME} ILIKE ${this.ph(params.length)} ESCAPE '!'`);\n params.push(this.likePattern(options.search));\n }\n if (options.processingPaused !== undefined) {\n clauses.push(`${QueueColumn.PROCESSING_PAUSED} = ${this.ph(params.length)}`);\n params.push(this.boolIn(options.processingPaused));\n }\n return clauses.length ? `WHERE ${clauses.join(' AND ')}` : '';\n }\n\n async listQueues(options: QueueListFilter & PageWindow = {}): Promise<QueueRow[]> {\n const params: unknown[] = [];\n const where = this.queueFilterClauses(options, params);\n // `name` is the primary key, so a page can no longer contain the same queue twice and there is\n // nothing to dedupe after the window — `items.length` and `total` always agree.\n const res = await this.runMaybeTx(\n `SELECT * FROM ${this.t(TableName.QUEUE)} ${where} ORDER BY ${QueueColumn.NAME} ASC` +\n this.window(options, params),\n params,\n );\n return res.rows.map((r) => this.mapQueue(r));\n }\n\n async countQueues(options: QueueListFilter = {}): Promise<number> {\n const params: unknown[] = [];\n const where = this.queueFilterClauses(options, params);\n const res = await this.runMaybeTx(\n `SELECT COUNT(*) AS c FROM ${this.t(TableName.QUEUE)} ${where}`,\n params,\n );\n return Number(res.rows[0]?.c ?? 0);\n }\n\n /** WHERE clauses for a schedule-list filter, appending each value to `params`. */\n private scheduleFilterClauses(options: ScheduleListFilter, params: unknown[]): string {\n const clauses: string[] = [];\n if (options.queueName) {\n clauses.push(`${ScheduleColumn.QUEUE_NAME} = ${this.ph(params.length)}`);\n params.push(options.queueName);\n }\n if (options.enabled !== undefined) {\n clauses.push(`${ScheduleColumn.ENABLED} = ${this.ph(params.length)}`);\n params.push(this.boolIn(options.enabled));\n }\n if (options.search) {\n // A schedule is searchable by any of the three things the table actually shows.\n const pattern = this.likePattern(options.search);\n const cols = [ScheduleColumn.ID, ScheduleColumn.QUEUE_NAME, ScheduleColumn.CRON];\n const ors = cols.map((col) => {\n const clause = `${col} ILIKE ${this.ph(params.length)} ESCAPE '!'`;\n params.push(pattern);\n return clause;\n });\n clauses.push(`(${ors.join(' OR ')})`);\n }\n return clauses.length ? `WHERE ${clauses.join(' AND ')}` : '';\n }\n\n async listSchedules(options: ScheduleListFilter & PageWindow = {}): Promise<ScheduleRow[]> {\n const params: unknown[] = [];\n const where = this.scheduleFilterClauses(options, params);\n const res = await this.runMaybeTx(\n `SELECT * FROM ${this.t(TableName.SCHEDULE)} ${where} ` +\n `ORDER BY ${ScheduleColumn.CREATED_AT} ASC, ${ScheduleColumn.ID} ASC` +\n this.window(options, params),\n params,\n );\n return res.rows.map((r) => this.mapSchedule(r));\n }\n\n async countSchedules(options: ScheduleListFilter = {}): Promise<number> {\n const params: unknown[] = [];\n const where = this.scheduleFilterClauses(options, params);\n const res = await this.runMaybeTx(\n `SELECT COUNT(*) AS c FROM ${this.t(TableName.SCHEDULE)} ${where}`,\n params,\n );\n return Number(res.rows[0]?.c ?? 0);\n }\n\n async getSchedule(options: { scheduleId: string }): Promise<ScheduleRow | null> {\n const res = await this.runMaybeTx(\n `SELECT * FROM ${this.t(TableName.SCHEDULE)} WHERE ${ScheduleColumn.ID} = ${this.ph(0)}`,\n [options.scheduleId],\n );\n return res.rows[0] ? this.mapSchedule(res.rows[0]) : null;\n }\n\n async getDueSchedules(options: { now: number; limit: number }): Promise<ScheduleRow[]> {\n const res = await this.runMaybeTx(\n `SELECT * FROM ${this.t(TableName.SCHEDULE)} WHERE ${ScheduleColumn.ENABLED} = ${this.ph(0)} ` +\n `AND ${ScheduleColumn.NEXT_RUN_AT} IS NOT NULL AND ${ScheduleColumn.NEXT_RUN_AT} <= ${this.ph(1)} ` +\n `ORDER BY ${ScheduleColumn.NEXT_RUN_AT} ASC LIMIT ${this.ph(2)}`,\n [this.boolIn(true), options.now, options.limit],\n );\n return res.rows.map((r) => this.mapSchedule(r));\n }\n\n async advanceSchedule(options: {\n scheduleId: string;\n nextRunAt: number | null;\n lastRunAt: number;\n fromNextRunAt: number;\n }): Promise<boolean> {\n // Guarded on the previous next_run_at: only one instance claims each tick.\n const res = await this.runMaybeTx(\n `UPDATE ${this.t(TableName.SCHEDULE)} SET ${ScheduleColumn.NEXT_RUN_AT} = ${this.ph(0)}, ` +\n `${ScheduleColumn.LAST_RUN_AT} = ${this.ph(1)}, ${ScheduleColumn.UPDATED_AT} = ${this.ph(2)} ` +\n `WHERE ${ScheduleColumn.ID} = ${this.ph(3)} AND ${ScheduleColumn.NEXT_RUN_AT} = ${this.ph(4)}`,\n [\n options.nextRunAt,\n options.lastRunAt,\n options.lastRunAt,\n options.scheduleId,\n options.fromNextRunAt,\n ],\n );\n return res.rowCount > 0;\n }\n\n // --- Job control ---\n async cancelJob(options: {\n jobId: string;\n now: number;\n tx?: TransactionHandle;\n }): Promise<JobRef | null> {\n const [ref] = await this.cancelJobs({\n jobIds: [options.jobId],\n now: options.now,\n ...(options.tx ? { tx: options.tx } : {}),\n });\n return ref ?? null;\n }\n\n async cancelJobs(options: {\n jobIds: string[];\n now: number;\n tx?: TransactionHandle;\n }): Promise<JobRef[]> {\n if (!options.jobIds.length) return [];\n // Chunked so one statement can never carry more ids than the engine allows in an\n // `IN (...)` list. A capped batch is a single chunk, and so a single statement.\n return this.overIdChunks(options.jobIds, async (jobIds) => {\n const head: unknown[] = [JobStatus.CANCELLED, options.now, options.now];\n const tail = [JobStatus.PENDING, JobStatus.RETRY];\n const res = await this.runMaybeTx(\n `UPDATE ${this.t(TableName.JOB)} SET ${JobColumn.STATUS} = ${this.ph(0)}, ${JobColumn.CANCELLED_AT} = ${this.ph(1)}, ` +\n `${JobColumn.UPDATED_AT} = ${this.ph(2)}, ${JobColumn.LOCKED_UNTIL} = NULL, ${JobColumn.LOCK_TOKEN} = NULL ` +\n `WHERE ${JobColumn.ID} IN (${this.phList(jobIds.length, head.length)}) ` +\n `AND ${JobColumn.STATUS} IN (${this.phList(tail.length, head.length + jobIds.length)}) ` +\n `RETURNING ${JobColumn.ID}, ${JobColumn.QUEUE_NAME}`,\n [...head, ...jobIds, ...tail],\n options.tx,\n );\n return res.rows.map((r) => this.mapJobRef(r));\n });\n }\n\n async removeJob(options: { jobId: string; tx?: TransactionHandle }): Promise<JobRef | null> {\n const [ref] = await this.removeJobs({\n jobIds: [options.jobId],\n ...(options.tx ? { tx: options.tx } : {}),\n });\n return ref ?? null;\n }\n\n async removeJobs(options: { jobIds: string[]; tx?: TransactionHandle }): Promise<JobRef[]> {\n if (!options.jobIds.length) return [];\n // Chunked so one statement can never carry more ids than the engine allows in an\n // `IN (...)` list. A capped batch is a single chunk, and so a single statement.\n return this.overIdChunks(options.jobIds, async (jobIds) => {\n // Never delete a running job — an ACTIVE row belongs to a live handler, so it is skipped and\n // simply absent from the result; cancel it first.\n const res = await this.runMaybeTx(\n `DELETE FROM ${this.t(TableName.JOB)} WHERE ${JobColumn.ID} IN (${this.phList(jobIds.length)}) ` +\n `AND ${JobColumn.STATUS} <> ${this.ph(jobIds.length)} ` +\n `RETURNING ${JobColumn.ID}, ${JobColumn.QUEUE_NAME}`,\n [...jobIds, JobStatus.ACTIVE],\n options.tx,\n );\n return res.rows.map((r) => this.mapJobRef(r));\n });\n }\n\n async removeJobsByStatus(options: {\n queueName: string;\n statuses: JobStatus[];\n tx?: TransactionHandle;\n }): Promise<number> {\n if (!options.statuses.length) return 0;\n const res = await this.runMaybeTx(\n `DELETE FROM ${this.t(TableName.JOB)} WHERE ${JobColumn.STATUS} IN (${this.phList(options.statuses.length)}) ` +\n `AND ${JobColumn.QUEUE_NAME} = ${this.ph(options.statuses.length)}`,\n [...options.statuses, options.queueName],\n options.tx,\n );\n return res.rowCount;\n }\n\n // --- Queue control ---\n async setQueuePaused(options: {\n queueName: string;\n processingPaused?: boolean;\n acceptingPaused?: boolean;\n now: number;\n tx?: TransactionHandle;\n }): Promise<QueueRow | null> {\n const sets: string[] = [];\n const params: unknown[] = [];\n if (options.processingPaused !== undefined) {\n sets.push(`${QueueColumn.PROCESSING_PAUSED} = ${this.ph(params.length)}`);\n params.push(this.boolIn(options.processingPaused));\n }\n if (options.acceptingPaused !== undefined) {\n sets.push(`${QueueColumn.ACCEPTING_PAUSED} = ${this.ph(params.length)}`);\n params.push(this.boolIn(options.acceptingPaused));\n }\n sets.push(`${QueueColumn.UPDATED_AT} = ${this.ph(params.length)}`);\n params.push(options.now);\n const namePh = this.ph(params.length);\n params.push(options.queueName);\n // RETURNING the row means the caller refreshes its cached pause flags from this one statement\n // rather than following it with a read.\n const res = await this.runMaybeTx(\n `UPDATE ${this.t(TableName.QUEUE)} SET ${sets.join(', ')} WHERE ${QueueColumn.NAME} = ${namePh} RETURNING *`,\n params,\n options.tx,\n );\n return res.rows[0] ? this.mapQueue(res.rows[0]) : null;\n }\n\n async ensureQueue(options: {\n name: string;\n options?: QueueOptions;\n now: number;\n tx?: TransactionHandle;\n }): Promise<QueueRow> {\n // Get-or-create in one statement pair, on the caller's transaction when there is one: outside\n // it the read-back would not see the row just inserted, and on a single-connection engine it\n // would deadlock behind the in-flight transaction.\n //\n // `name` is the primary key, so `ON CONFLICT DO NOTHING` makes a concurrent create a no-op\n // instead of an error — the conflict target *is* the key, which is the one case the\n // sharded-engine caveat allows. Queue options are process-local (see QueueOptions); only the\n // pause flags are ever persisted, so an existing row is never rewritten from here.\n return this.inTx(options.tx, async (run) => {\n await run(\n `INSERT INTO ${this.t(TableName.QUEUE)} (${QueueColumn.NAME}, ${QueueColumn.PROCESSING_PAUSED}, ` +\n `${QueueColumn.ACCEPTING_PAUSED}, ${QueueColumn.CREATED_AT}, ${QueueColumn.UPDATED_AT}) ` +\n `VALUES (${this.ph(0)}, ${this.ph(1)}, ${this.ph(2)}, ${this.ph(3)}, ${this.ph(4)}) ` +\n `ON CONFLICT (${QueueColumn.NAME}) DO NOTHING`,\n [options.name, this.boolIn(false), this.boolIn(false), options.now, options.now],\n );\n const res = await run(\n `SELECT * FROM ${this.t(TableName.QUEUE)} WHERE ${QueueColumn.NAME} = ${this.ph(0)}`,\n [options.name],\n );\n if (!res.rows[0]) throw new DriverQueryError(`Failed to ensure queue '${options.name}'.`);\n return this.mapQueue(res.rows[0]);\n });\n }\n\n async getQueueByName(options: {\n name: string;\n tx?: TransactionHandle;\n }): Promise<QueueRow | null> {\n const res = await this.runMaybeTx(\n `SELECT * FROM ${this.t(TableName.QUEUE)} WHERE ${QueueColumn.NAME} = ${this.ph(0)}`,\n [options.name],\n options.tx,\n );\n return res.rows[0] ? this.mapQueue(res.rows[0]) : null;\n }\n\n async deleteQueue(options: { name: string; tx?: TransactionHandle }): Promise<boolean> {\n // Only removes the queue row. Jobs link by queue_name (no FK), so this never cascades —\n // any leftover job rows keep their name and are unaffected; the caller guards \"not in use\".\n const res = await this.runMaybeTx(\n `DELETE FROM ${this.t(TableName.QUEUE)} WHERE ${QueueColumn.NAME} = ${this.ph(0)}`,\n [options.name],\n options.tx,\n );\n return res.rowCount > 0;\n }\n\n // --- Instance liveness & per-instance pause ---\n async upsertInstance(options: {\n instanceKey: string;\n now: number;\n metrics?: InstanceMetrics;\n }): Promise<InstanceRow> {\n // Update-first, then insert if absent. The heartbeat's common case is \"row exists\", so the\n // guarded UPDATE ... RETURNING resolves it in one round trip and never touches the\n // (independently controlled) pause flag; only the first beat falls through to the INSERT, whose\n // `ON CONFLICT DO NOTHING` makes two simultaneous first beats harmless. The returned row is\n // what the caller reads `processingPaused` from — there is no follow-up read.\n const m = options.metrics;\n return this.inTx(undefined, async (run) => {\n const updated = await run(\n `UPDATE ${this.t(TableName.INSTANCE)} SET ${InstanceColumn.LAST_SEEN_AT} = ${this.ph(0)}, ` +\n `${InstanceColumn.UPDATED_AT} = ${this.ph(1)}, ` +\n `${InstanceColumn.CPU_PERCENT} = COALESCE(${this.ph(2)}, ${InstanceColumn.CPU_PERCENT}), ` +\n `${InstanceColumn.MEMORY_PERCENT} = COALESCE(${this.ph(3)}, ${InstanceColumn.MEMORY_PERCENT}) ` +\n `WHERE ${InstanceColumn.INSTANCE_KEY} = ${this.ph(4)} RETURNING *`,\n [\n options.now,\n options.now,\n m?.cpuPercent ?? null,\n m?.memoryPercent ?? null,\n options.instanceKey,\n ],\n );\n if (updated.rows[0]) return this.mapInstance(updated.rows[0]);\n await run(\n `INSERT INTO ${this.t(TableName.INSTANCE)} (${InstanceColumn.INSTANCE_KEY}, ${InstanceColumn.PROCESSING_PAUSED}, ` +\n `${InstanceColumn.CREATED_AT}, ${InstanceColumn.UPDATED_AT}, ${InstanceColumn.LAST_SEEN_AT}, ` +\n `${InstanceColumn.CPU_PERCENT}, ${InstanceColumn.MEMORY_PERCENT}) ` +\n `VALUES (${this.phList(7)}) ON CONFLICT (${InstanceColumn.INSTANCE_KEY}) DO NOTHING`,\n [\n options.instanceKey,\n this.boolIn(false),\n options.now,\n options.now,\n options.now,\n m?.cpuPercent ?? null,\n m?.memoryPercent ?? null,\n ],\n );\n const read = await run(\n `SELECT * FROM ${this.t(TableName.INSTANCE)} WHERE ${InstanceColumn.INSTANCE_KEY} = ${this.ph(0)}`,\n [options.instanceKey],\n );\n if (!read.rows[0]) {\n throw new DriverQueryError(`Failed to register instance '${options.instanceKey}'.`);\n }\n return this.mapInstance(read.rows[0]);\n });\n }\n\n /** WHERE clauses for an instance-list filter, appending each value to `params`. */\n private instanceFilterClauses(options: InstanceListFilter, params: unknown[]): string {\n const clauses: string[] = [];\n if (options.search) {\n clauses.push(`${InstanceColumn.INSTANCE_KEY} ILIKE ${this.ph(params.length)} ESCAPE '!'`);\n params.push(this.likePattern(options.search));\n }\n if (options.processingPaused !== undefined) {\n clauses.push(`${InstanceColumn.PROCESSING_PAUSED} = ${this.ph(params.length)}`);\n params.push(this.boolIn(options.processingPaused));\n }\n // Liveness is a cutoff the caller computed; the driver only compares against it.\n if (options.alive !== undefined && options.seenSince !== undefined) {\n clauses.push(\n `${InstanceColumn.LAST_SEEN_AT} ${options.alive ? '>=' : '<'} ${this.ph(params.length)}`,\n );\n params.push(options.seenSince);\n }\n return clauses.length ? `WHERE ${clauses.join(' AND ')}` : '';\n }\n\n async listInstances(options: InstanceListFilter & PageWindow = {}): Promise<InstanceRow[]> {\n const params: unknown[] = [];\n const where = this.instanceFilterClauses(options, params);\n // `instance_key` is the primary key, so no post-window dedupe is needed.\n const res = await this.runMaybeTx(\n `SELECT * FROM ${this.t(TableName.INSTANCE)} ${where} ORDER BY ${InstanceColumn.INSTANCE_KEY} ASC` +\n this.window(options, params),\n params,\n );\n return res.rows.map((r) => this.mapInstance(r));\n }\n\n async countInstances(options: InstanceListFilter = {}): Promise<number> {\n const params: unknown[] = [];\n const where = this.instanceFilterClauses(options, params);\n const res = await this.runMaybeTx(\n `SELECT COUNT(*) AS c FROM ${this.t(TableName.INSTANCE)} ${where}`,\n params,\n );\n return Number(res.rows[0]?.c ?? 0);\n }\n\n async getInstance(options: { instanceKey: string }): Promise<InstanceRow | null> {\n const res = await this.runMaybeTx(\n `SELECT * FROM ${this.t(TableName.INSTANCE)} WHERE ${InstanceColumn.INSTANCE_KEY} = ${this.ph(0)}`,\n [options.instanceKey],\n );\n return res.rows[0] ? this.mapInstance(res.rows[0]) : null;\n }\n\n async setInstancePaused(options: {\n instanceKey: string;\n processingPaused: boolean;\n now: number;\n }): Promise<void> {\n await this.runMaybeTx(\n `UPDATE ${this.t(TableName.INSTANCE)} SET ${InstanceColumn.PROCESSING_PAUSED} = ${this.ph(0)}, ` +\n `${InstanceColumn.UPDATED_AT} = ${this.ph(1)} WHERE ${InstanceColumn.INSTANCE_KEY} = ${this.ph(2)}`,\n [this.boolIn(options.processingPaused), options.now, options.instanceKey],\n );\n }\n\n async deleteInstance(options: { instanceKey: string; tx?: TransactionHandle }): Promise<boolean> {\n // Only removes the instance (monitoring) row. Jobs record processed_on_instance_key as a plain\n // string (no FK), so removing an instance never touches or orphans any job rows.\n const res = await this.runMaybeTx(\n `DELETE FROM ${this.t(TableName.INSTANCE)} WHERE ${InstanceColumn.INSTANCE_KEY} = ${this.ph(0)}`,\n [options.instanceKey],\n options.tx,\n );\n return res.rowCount > 0;\n }\n\n // --- Retention ---\n async deleteFinishedJobs(options: { olderThan: number; limit: number }): Promise<number> {\n const params: unknown[] = [];\n const where = this.retentionWhere(options.olderThan, params);\n const limitPh = this.ph(params.length);\n params.push(options.limit);\n // Bounded batch: delete finished rows whose retention window has elapsed.\n const res = await this.runMaybeTx(\n `DELETE FROM ${this.t(TableName.JOB)} WHERE ${JobColumn.ID} IN ` +\n `(SELECT ${JobColumn.ID} FROM ${this.t(TableName.JOB)} WHERE ${where} LIMIT ${limitPh})`,\n params,\n );\n return res.rowCount;\n }\n\n /**\n * The retention predicate: a row that carries a TTL, in a status **its own policy** covers, whose\n * TTL has elapsed since it finished. A NULL `retention_ttl_seconds` is a job with no retention\n * policy at all and is never deleted — that is the whole of \"keep forever\".\n *\n * The per-status term is what makes `retention.statuses` real. A row with a NULL\n * `retention_statuses` is eligible in every finished status (the default); a row that named a\n * subset is eligible only in one of those, matched against the delimited encoding so `,FAILED,`\n * can never be matched by a search for a different token.\n */\n private retentionWhere(olderThan: number, params: unknown[]): string {\n const statusPh = this.phList(FINISHED_STATUSES.length, params.length);\n params.push(...FINISHED_STATUSES);\n // One integer test per status rather than a leading-wildcard `LIKE`: the old encoding could not\n // use an index and cost four pattern matches per candidate row.\n const scoped = FINISHED_STATUSES.map((status) => {\n const clause =\n `(${JobColumn.STATUS} = ${this.ph(params.length)} AND ` +\n `${JobColumn.RETENTION_STATUSES} & ${this.ph(params.length + 1)} <> 0)`;\n params.push(status, retentionStatusBit(status));\n return clause;\n });\n const cutoffPh = this.ph(params.length);\n params.push(olderThan);\n return (\n `${JobColumn.RETENTION_TTL_SECONDS} IS NOT NULL ` +\n `AND ${JobColumn.STATUS} IN (${statusPh}) ` +\n `AND (${JobColumn.RETENTION_STATUSES} IS NULL OR ${scoped.join(' OR ')}) ` +\n `AND (COALESCE(${JobColumn.COMPLETED_AT}, ${JobColumn.FAILED_AT}, ${JobColumn.CANCELLED_AT}, ` +\n `${JobColumn.EXPIRED_AT}, ${JobColumn.UPDATED_AT}) + ${JobColumn.RETENTION_TTL_SECONDS} * ${MS_PER_SECOND}) <= ${cutoffPh}`\n );\n }\n\n // --- Pub/sub (LISTEN/NOTIFY on a dedicated connection) ---\n private channel(name: string): string {\n // Sanitize to a safe channel token — hash arbitrary names.\n const token = createHash('sha1')\n .update(`${this.context.namespace}:${name}`)\n .digest('hex')\n .slice(0, 40);\n return `pq_${token}`;\n }\n\n async notify(options: { channel: string; payload: string }): Promise<void> {\n if (!this.pool) return;\n await this.pool.query('SELECT pg_notify($1, $2)', [\n this.channel(options.channel),\n options.payload.slice(0, 7000),\n ]);\n }\n\n async subscribe(options: {\n channel: string;\n onNotification: (payload: string) => void;\n }): Promise<Subscription> {\n if (!this.pool) throw new DriverConnectionError('PostgreSQL driver is not connected.');\n const ch = this.channel(options.channel);\n if (!this.listenClient) {\n this.listenClient = await this.pool.connect();\n this.listenClient.on('notification', (msg) => {\n const set = this.listeners.get(msg.channel);\n if (set) for (const cb of set) cb(msg.payload ?? '');\n });\n }\n let set = this.listeners.get(ch);\n if (!set) {\n set = new Set();\n this.listeners.set(ch, set);\n await this.listenClient.query(`LISTEN \"${ch}\"`);\n }\n set.add(options.onNotification);\n return {\n unsubscribe: async () => {\n set!.delete(options.onNotification);\n if (set!.size === 0) {\n this.listeners.delete(ch);\n await this.listenClient?.query(`UNLISTEN \"${ch}\"`).catch(() => undefined);\n }\n },\n };\n }\n\n // --- Advisory locks ---\n /**\n * Take a session-scoped advisory lock, on a connection held for as long as the lock is.\n *\n * `pg_try_advisory_lock` belongs to the **session** that took it, so this cannot run on a pooled\n * connection that goes back to the pool afterwards: the release would land on whichever connection\n * the pool handed out next (a no-op, with a warning), and the lock would stay held for the life of\n * the original connection — so the next process to try would wait it out and time out. One client\n * is checked out here and released with the lock.\n */\n async tryAdvisoryLock(options: { key: string }): Promise<boolean> {\n if (!this.pool) return false;\n const existing = this.lockClients.get(options.key);\n if (existing) return true; // already held by this driver\n const client = await this.pool.connect();\n try {\n const res = await client.query('SELECT pg_try_advisory_lock($1) AS locked', [\n advisoryKey(options.key),\n ]);\n if (res.rows[0]?.locked !== true) {\n client.release();\n return false;\n }\n this.lockClients.set(options.key, client);\n return true;\n } catch (err) {\n client.release();\n throw err;\n }\n }\n\n async releaseAdvisoryLock(options: { key: string }): Promise<void> {\n const client = this.lockClients.get(options.key);\n if (!client) return;\n this.lockClients.delete(options.key);\n try {\n await client.query('SELECT pg_advisory_unlock($1)', [advisoryKey(options.key)]);\n } finally {\n client.release();\n }\n }\n\n // --- Transactions (internal) ---\n async runInTransaction<T>(options: { fn: (tx: TransactionHandle) => Promise<T> }): Promise<T> {\n return this.transaction(async (session) => {\n const handle: TransactionHandle = {\n __portqueueTx: true,\n engine: this.engine,\n execute: async (sql, params) => {\n const res = await this.execute(sql, params, session);\n return { rows: res.rows, rowCount: res.rowCount };\n },\n };\n return options.fn(handle);\n });\n }\n}\n\n/**\n * Map a string key to the `bigint` PostgreSQL advisory locks are keyed by.\n *\n * Six bytes of the digest, which is 48 bits — deliberately short of the 64 PostgreSQL accepts, because\n * the value crosses through a JS `number` and beyond `Number.MAX_SAFE_INTEGER` it would not survive\n * the trip. 48 bits is ample for the handful of named locks the tool takes (one, today: the migration\n * lock), and the collision arithmetic is what the caller needs to know if it ever takes more — see\n * {@link PostgresqlDriver.tryAdvisoryLock}, whose doc names the keys in use.\n */\nfunction advisoryKey(key: string): number {\n const hash = createHash('sha1').update(key).digest();\n return hash.readUIntBE(0, ADVISORY_KEY_BYTES);\n}\n\n/**\n * Digest bytes folded into an advisory-lock key. Six — 48 bits — is the widest that stays inside\n * `Number.MAX_SAFE_INTEGER` (2^53-1), so the key is exact in JS on the way to the `bigint` parameter.\n */\nconst ADVISORY_KEY_BYTES = 6;\n"],"names":["TableName","BaseDriver","DatabaseEngine","capabilities","DriverCapability","toMigrationSteps","MissingPeerDependencyError","DriverConnectionError","MigrationColumn","DriverQueryError","migration","JOB_COLUMNS","JobColumn","QueueColumn","DeduplicationReason","ACTIVE_STATUSES","ScheduleColumn","SCHEDULE_INSERT_COLUMNS","JobStatus","InstanceColumn","FINISHED_STATUSES","retentionStatusBit","MS_PER_SECOND","createHash","set"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;AA2BO,SAAS,GAAG,OAAiC;AAClD,QAAM,IAAI,MAAM;AAChB,QAAM,MAAM,MAAM;AAClB,QAAM,aAAuB,CAAA;AAI7B,MAAI,MAAM,OAAQ,YAAW,KAAK,+BAA+B,MAAM,MAAM,EAAE;AAE/E,aAAW;AAAA,IACT,8BAA8B,EAAEA,UAAAA,UAAU,KAAK,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOhD,8BAA8B,EAAEA,UAAAA,UAAU,GAAG,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAoC9C,8BAA8B,EAAEA,UAAAA,UAAU,QAAQ,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAkBnD,8BAA8B,EAAEA,UAAAA,UAAU,QAAQ,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IASnD,8BAA8B,EAAEA,UAAAA,UAAU,SAAS,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA,EAAA;AAStD,aAAW;AAAA;AAAA;AAAA,IAGT,8BAA8B,IAAIA,UAAAA,UAAU,KAAK,WAAW,CAAC,OACrD,EAAEA,UAAAA,UAAU,GAAG,CAAC;AAAA;AAAA,IAExB,8BAA8B,IAAIA,UAAAA,UAAU,KAAK,aAAa,CAAC,OACvD,EAAEA,UAAAA,UAAU,GAAG,CAAC;AAAA;AAAA,IAExB,8BAA8B,IAAIA,UAAAA,UAAU,KAAK,YAAY,CAAC,OACtD,EAAEA,UAAAA,UAAU,GAAG,CAAC;AAAA;AAAA,IAExB,8BAA8B,IAAIA,UAAAA,UAAU,KAAK,eAAe,CAAC,OACzD,EAAEA,UAAAA,UAAU,GAAG,CAAC;AAAA;AAAA,IAGxB,8BAA8B,IAAIA,UAAAA,UAAU,KAAK,iBAAiB,CAAC,OAC3D,EAAEA,UAAAA,UAAU,GAAG,CAAC;AAAA;AAAA,IAGxB,8BAA8B,IAAIA,UAAAA,UAAU,KAAK,eAAe,CAAC,OACzD,EAAEA,UAAAA,UAAU,GAAG,CAAC;AAAA;AAAA,IAGxB,8BAA8B,IAAIA,UAAAA,UAAU,KAAK,aAAa,CAAC,OACvD,EAAEA,UAAAA,UAAU,GAAG,CAAC;AAAA;AAAA,IAExB,8BAA8B,IAAIA,UAAAA,UAAU,KAAK,cAAc,CAAC,OACxD,EAAEA,UAAAA,UAAU,GAAG,CAAC;AAAA;AAAA,IAExB,8BAA8B,IAAIA,UAAAA,UAAU,KAAK,cAAc,CAAC,OACxD,EAAEA,UAAAA,UAAU,GAAG,CAAC;AAAA;AAAA,IAGxB,8BAA8B,IAAIA,UAAAA,UAAU,UAAU,SAAS,CAAC,OACxD,EAAEA,UAAAA,UAAU,QAAQ,CAAC;AAAA;AAAA,IAE7B,8BAA8B,IAAIA,UAAAA,UAAU,UAAU,WAAW,CAAC,OAC1D,EAAEA,UAAAA,UAAU,QAAQ,CAAC;AAAA;AAAA,IAE7B,8BAA8B,IAAIA,UAAAA,UAAU,UAAU,iBAAiB,CAAC,OAChE,EAAEA,UAAAA,UAAU,QAAQ,CAAC;AAAA;AAAA,IAG7B,8BAA8B,IAAIA,UAAAA,UAAU,UAAU,UAAU,CAAC,OACzD,EAAEA,oBAAU,QAAQ,CAAC;AAAA,EAAA;AAG/B,SAAO;AACT;AAEO,MAAM,wBAA4C,CAAC,EAAE,SAAS,GAAG,YAAY,IAAI;AC3ExF,MAAM,qBAAqB;AAE3B,MAAM,sBAAsB;AAmBrB,MAAM,yBAAyBC,UAAAA,WAA6B;AAAA,EACxD,SAAyBC,kBAAAA,eAAe;AAAA,EACxC,eAAoCC,kBAAAA,aAAa;AAAA,IACxD,CAACC,kBAAAA,iBAAiB,WAAW,GAAG;AAAA,IAChC,CAACA,kBAAAA,iBAAiB,SAAS,GAAG;AAAA,IAC9B,CAACA,kBAAAA,iBAAiB,YAAY,GAAG;AAAA,IACjC,CAACA,kBAAAA,iBAAiB,aAAa,GAAG;AAAA,IAClC,CAACA,kBAAAA,iBAAiB,aAAa,GAAG;AAAA,EAAA,CACnC;AAAA,EACQ,aAA8BC,UAAAA,iBAAiB,qBAAqB;AAAA,EAErE,OAAsB;AAAA,EACtB,eAAgC;AAAA;AAAA;AAAA;AAAA;AAAA,EAKvB,kCAAkB,IAAA;AAAA,EAClB,gCAAgB,IAAA;AAAA,EAChB;AAAA,EAEjB,YAAY,UAAmC,IAAI;AACjD,UAAM;AAAA,MACJ,GAAI,QAAQ,gBAAgB,SAAY,EAAE,aAAa,QAAQ,YAAA,IAAgB,CAAA;AAAA,MAC/E,GAAI,QAAQ,WAAW,SAAY,EAAE,QAAQ,QAAQ,OAAA,IAAW,CAAA;AAAA,MAChE,GAAI,QAAQ,cAAc,SAAY,EAAE,WAAW,QAAQ,cAAc,CAAA;AAAA,IAAC,CAC3E;AACD,SAAK,UAAU;AAAA,EACjB;AAAA;AAAA,EAGA,MAAM,UAAyB;AAC7B,QAAI,KAAK,QAAQ,MAAM;AACrB,WAAK,OAAO,KAAK,QAAQ;AACzB;AAAA,IACF;AACA,QAAI;AACJ,QAAI;AAEF,YAAM,MAAO,MAAM,OAAO,IAAc;AACxC,WAAM,IAAI,WAAW;AAAA,IAGvB,QAAQ;AACN,YAAM,IAAIC,UAAAA,2BAA2B,MAAM,YAAY;AAAA,IACzD;AACA,QAAI;AACF,YAAM,SAAkC,EAAE,GAAG,KAAK,QAAQ,OAAA;AAC1D,UAAI,KAAK,QAAQ,iBAAkB,QAAO,mBAAmB,KAAK,QAAQ;AAC1E,WAAK,OAAO,IAAI,GAAG,KAAK,MAAM;AAC9B,YAAM,KAAK,KAAK,MAAM,UAAU;AAAA,IAClC,SAAS,KAAK;AACZ,YAAM,IAAIC,UAAAA,sBAAsB,oCAAoC,GAAG;AAAA,IACzE;AAAA,EACF;AAAA,EAEA,MAAM,aAA4B;AAChC,SAAK,cAAc,QAAA;AACnB,SAAK,eAAe;AAGpB,eAAW,UAAU,KAAK,YAAY,OAAA,UAAiB,QAAA;AACvD,SAAK,YAAY,MAAA;AACjB,QAAI,KAAK,QAAQ,CAAC,KAAK,QAAQ,KAAM,OAAM,KAAK,KAAK,IAAA;AACrD,SAAK,OAAO;AAAA,EACd;AAAA;AAAA,EAGA,MAAgB,QACd,KACA,QACA,SACoB;AACpB,UAAM,SAAU,WAAoC,KAAK;AACzD,QAAI,CAAC,OAAQ,OAAM,IAAIA,UAAAA,sBAAsB,qCAAqC;AAClF,UAAM,MAAM,MAAM,OAAO,MAAM,KAAK,MAAM;AAC1C,WAAO,EAAE,MAAM,IAAI,QAAQ,CAAA,GAAI,UAAU,IAAI,YAAY,IAAI,MAAM,UAAU,EAAA;AAAA,EAC/E;AAAA;AAAA,EAGA,MAAgB,YAAe,IAAkD;AAC/E,QAAI,CAAC,KAAK,KAAM,OAAM,IAAIA,UAAAA,sBAAsB,qCAAqC;AACrF,UAAM,SAAS,MAAM,KAAK,KAAK,QAAA;AAC/B,QAAI;AACF,YAAM,OAAO,MAAM,OAAO;AAC1B,YAAM,SAAS,MAAM,GAAG,MAAM;AAC9B,YAAM,OAAO,MAAM,QAAQ;AAC3B,aAAO;AAAA,IACT,SAAS,KAAK;AACZ,YAAM,OAAO,MAAM,UAAU,EAAE,MAAM,MAAM,MAAS;AACpD,YAAM;AAAA,IACR,UAAA;AACE,aAAO,QAAA;AAAA,IACT;AAAA,EACF;AAAA;AAAA,EAGU,GAAG,QAAwB;AACnC,WAAO,IAAI,SAAS,CAAC;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOU,OAAO,MAAkB,QAA2B;AAC5D,QAAI,MAAM;AACV,QAAI,KAAK,UAAU,QAAW;AAC5B,aAAO,UAAU,KAAK,GAAG,OAAO,MAAM,CAAC;AACvC,aAAO,KAAK,KAAK,IAAI,KAAK,MAAM,KAAK,KAAK,GAAG,CAAC,CAAC;AAAA,IACjD;AACA,QAAI,KAAK,WAAW,QAAW;AAC7B,aAAO,WAAW,KAAK,GAAG,OAAO,MAAM,CAAC;AACxC,aAAO,KAAK,KAAK,IAAI,KAAK,MAAM,KAAK,MAAM,GAAG,CAAC,CAAC;AAAA,IAClD;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,MAAM,QAA8B;AAClC,QAAI,gBAAgB;AACpB,QAAI,KAAK,MAAM;AACb,YAAM,MAAM,MAAM,KAAK,KAAK,MAAM,qBAAqB;AACvD,sBAAgB,OAAO,IAAI,KAAK,CAAC,GAAG,kBAAkB,SAAS;AAAA,IACjE;AACA,WAAO,EAAE,eAAe,sBAAsB,KAAK,sBAAoB;AAAA,EACzE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,mBAA2C;AAC/C,QAAI;AACF,YAAM,MAAM,MAAM,KAAK;AAAA,QACrB,cAAcC,0BAAgB,OAAO,eAAe,KAAK,EAAER,UAAAA,UAAU,SAAS,CAAC;AAAA,QAC/E,CAAA;AAAA,MAAC;AAEH,YAAM,IAAI,IAAI,KAAK,CAAC,GAAG;AACvB,aAAO,KAAK,OAAO,OAAO,OAAO,CAAC;AAAA,IACpC,SAAS,KAAK;AACZ,UAAI,KAAK,sBAAsB,GAAG,EAAG,QAAO;AAC5C,YAAM,IAAIS,UAAAA,iBAAiB,8CAA8C,GAAG;AAAA,IAC9E;AAAA,EACF;AAAA;AAAA,EAGU,sBAAsB,KAAuB;AACrD,UAAM,OAAQ,KAAmC;AACjD,WAAO,SAAS,sBAAsB,SAAS;AAAA,EACjD;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,eAAe,SAAsD;AACzE,UAAM,EAAA,WAAEC,gBAAc;AACtB,UAAM,aAAaA,YAAU,WAAW,KAAK,OAAO;AACpD,UAAM,KAAK,YAAY,OAAO,YAAY;AACxC,iBAAW,OAAO,WAAY,OAAM,KAAK,QAAQ,KAAK,CAAA,GAAI,OAAO;AACjE,YAAM,MAAM,KAAK,IAAA;AACjB,YAAM,KAAK;AAAA,QACT,eAAe,KAAK,EAAEV,oBAAU,SAAS,CAAC,KAAKQ,UAAAA,gBAAgB,OAAO,KAAKA,UAAAA,gBAAgB,UAAU,KAAKA,0BAAgB,UAAU,aACvH,KAAK,OAAO,CAAC,CAAC,kBAAkBA,0BAAgB,OAAO;AAAA,QACpE,CAACE,YAAU,SAAS,KAAK,GAAG;AAAA,QAC5B;AAAA,MAAA;AAAA,IAEJ,CAAC;AAAA,EACH;AAAA;AAAA,EAGA,MAAM,UAAU,SAAiF;AAC/F,UAAM,CAAC,MAAM,IAAI,MAAM,KAAK,WAAW;AAAA,MACrC,MAAM,CAAC,QAAQ,GAAG;AAAA,MAClB,GAAI,QAAQ,KAAK,EAAE,IAAI,QAAQ,GAAA,IAAO,CAAA;AAAA,IAAC,CACxC;AACD,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,WAAW,SAGa;AAC5B,UAAM,EAAE,MAAM,GAAA,IAAO;AACrB,QAAI,CAAC,KAAK,OAAQ,QAAO,CAAA;AACzB,WAAO,KAAK,KAAK,IAAI,OAAO,QAAQ;AAClC,YAAM,KAAK,mBAAmB,KAAK,IAAI;AACvC,YAAM,UAAU,MAAM,KAAK,iBAAiB,MAAM,GAAG;AACrD,YAAM,UAAU,IAAI,MAAkC,KAAK,MAAM;AACjE,YAAM,QAAiE,CAAA;AAEvE,iBAAW,CAAC,OAAO,GAAG,KAAK,KAAK,WAAW;AACzC,cAAM,MAAM,QAAQ,IAAI,GAAG;AAC3B,YAAI,KAAK;AACP,kBAAQ,KAAK,IAAI;AACjB;AAAA,QACF;AACA,cAAM,EAAE,IAAI,OAAA,IAAW,KAAK,gBAAgB,GAAG;AAC/C,cAAM,KAAK,EAAE,OAAO,IAAI,QAAQ;AAAA,MAClC;AAIA,iBAAW,SAAS,KAAK,aAAa,OAAOC,UAAAA,YAAY,MAAM,GAAG;AAChE,YAAI,CAAC,MAAM,OAAQ;AACnB,cAAM,SAAoB,CAAA;AAC1B,cAAM,SAAS,MAAM,IAAI,CAAC,EAAE,aAAa;AACvC,gBAAM,eAAe,KAAK,OAAO,OAAO,QAAQ,OAAO,MAAM;AAC7D,iBAAO,KAAK,GAAG,MAAM;AACrB,iBAAO,IAAI,YAAY;AAAA,QACzB,CAAC;AACD,YAAI;AACF,gBAAM,WAAW,MAAM;AAAA,YACrB,eAAe,KAAK,EAAEX,UAAAA,UAAU,GAAG,CAAC,KAAKW,sBAAY,KAAK,IAAI,CAAC,YAAY,OAAO,KAAK,IAAI,CAAC,cAC7EC,UAAAA,UAAU,EAAE,KAAKA,UAAAA,UAAU,MAAM,KAAKA,UAAAA,UAAU,WAAW;AAAA,YAC1E;AAAA,UAAA;AAIF,gBAAM,OAAO,IAAI,IAAI,SAAS,KAAK,IAAI,CAAC,QAAQ,CAAC,OAAO,IAAIA,UAAAA,UAAU,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC;AACjF,qBAAW,EAAE,OAAO,GAAA,KAAQ,OAAO;AACjC,kBAAM,MAAM,KAAK,IAAI,EAAE;AACvB,gBAAI,CAAC,IAAK,OAAM,IAAIH,UAAAA,iBAAiB,8BAA8B,EAAE,IAAI;AACzE,oBAAQ,KAAK,IAAI;AAAA,cACf;AAAA,cACA,QAAQ,IAAIG,UAAAA,UAAU,MAAM;AAAA,cAC5B,YAAY,OAAO,IAAIA,UAAAA,UAAU,WAAW,CAAC;AAAA,cAC7C,cAAc;AAAA,YAAA;AAAA,UAElB;AAAA,QACF,SAAS,KAAK;AACZ,cAAI,eAAeH,UAAAA,iBAAkB,OAAM;AAC3C,gBAAM,IAAIA,UAAAA;AAAAA,YACR,oBAAoB,MAAM,MAAM,qBAAqB,KAAK,MAAM,CAAC,EAAG,KAAK,EAAG,SAAS;AAAA,YACrF;AAAA,UAAA;AAAA,QAEJ;AAAA,MACF;AACA,aAAO;AAAA,IACT,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAkBA,MAAc,mBACZ,KACA,MACe;AACf,UAAM,QAAQ;AAAA,MACZ,GAAG,IAAI;AAAA,QACL,KAAK;AAAA,UAAQ,CAAC,MACZ,EAAE,kBAAkB,QAAQ,EAAE,gBAAgB,OAAO,CAAC,EAAE,SAAS,IAAI,CAAA;AAAA,QAAC;AAAA,MACxE;AAAA,IACF,EACA,KAAA;AACF,QAAI,CAAC,MAAM,OAAQ;AACnB,UAAM;AAAA,MACJ,UAAUI,UAAAA,YAAY,IAAI,SAAS,KAAK,EAAEb,UAAAA,UAAU,KAAK,CAAC,UAC/Ca,sBAAY,IAAI,QAAQ,KAAK,OAAO,MAAM,MAAM,CAAC;AAAA,MAC5D;AAAA,IAAA;AAAA,EAEJ;AAAA,EAEA,MAAc,iBACZ,MACA,KAC4C;AAC5C,UAAM,0BAAU,IAAA;AAChB,UAAM,OAAO,GAAGD,UAAAA,UAAU,EAAE,KAAKA,UAAAA,UAAU,MAAM,KAAKA,UAAAA,UAAU,WAAW;AAE3E,UAAM,8BAAc,IAAA;AACpB,eAAW,OAAO,MAAM;AACtB,UAAI,IAAI,kBAAkB,QAAQ,IAAI,gBAAgB,KAAM;AAC5D,YAAM,OAAO,QAAQ,IAAI,IAAI,SAAS;AACtC,UAAI,KAAM,MAAK,KAAK,GAAG;AAAA,mBACV,IAAI,IAAI,WAAW,CAAC,GAAG,CAAC;AAAA,IACvC;AAEA,eAAW,CAAC,WAAW,SAAS,KAAK,SAAS;AAC5C,YAAM,WAAW;AAAA,QACf,GAAG,IAAI,IAAI,UAAU,QAAQ,CAAC,MAAO,EAAE,iBAAiB,CAAC,EAAE,cAAc,IAAI,CAAA,CAAG,CAAC;AAAA,MAAA;AAEnF,UAAI,SAAS,QAAQ;AACnB,cAAM,MAAM,MAAM;AAAA,UAChB,UAAU,IAAI,KAAKA,UAAAA,UAAU,eAAe,SAAS,KAAK,EAAEZ,UAAAA,UAAU,GAAG,CAAC,UAC/DY,UAAAA,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,QAAQA,UAAAA,UAAU,eAAe,QAAQ,KAAK,OAAO,SAAS,QAAQ,CAAC,CAAC;AAAA,UACvH,CAAC,WAAW,GAAG,QAAQ;AAAA,QAAA;AAEzB,cAAM,QAAQ,IAAI,IAAI,IAAI,KAAK,IAAI,CAAC,MAAM,CAAC,OAAO,EAAEA,UAAAA,UAAU,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC;AACpF,mBAAW,OAAO,WAAW;AAC3B,cAAI,IAAI,kBAAkB,KAAM;AAChC,gBAAM,MAAM,MAAM,IAAI,IAAI,cAAc;AACxC,cAAI,SAAS,IAAI,KAAK,KAAK,YAAY,KAAKE,sCAAoB,WAAW,CAAC;AAAA,QAC9E;AAAA,MACF;AAEA,YAAM,gBAAgB;AAAA,QACpB,GAAG,IAAI;AAAA,UACL,UAAU,QAAQ,CAAC,MAAO,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,eAAe,CAAC,EAAE,YAAY,IAAI,CAAA,CAAG;AAAA,QAAA;AAAA,MAClF;AAEF,UAAI,cAAc,QAAQ;AACxB,cAAM,WAAW,KAAK,OAAOC,kBAAAA,gBAAgB,QAAQ,IAAI,cAAc,MAAM;AAC7E,cAAM,MAAM,MAAM;AAAA,UAChB,UAAU,IAAI,KAAKH,UAAAA,UAAU,aAAa,SAAS,KAAK,EAAEZ,UAAAA,UAAU,GAAG,CAAC,UAC7DY,UAAAA,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,QAAQA,oBAAU,aAAa,QAAQ,KAAK,OAAO,cAAc,QAAQ,CAAC,CAAC,SACjHA,UAAAA,UAAU,MAAM,QAAQ,QAAQ;AAAA,UACzC,CAAC,WAAW,GAAG,eAAe,GAAGG,kBAAAA,eAAe;AAAA,QAAA;AAElD,cAAM,QAAQ,IAAI,IAAI,IAAI,KAAK,IAAI,CAAC,MAAM,CAAC,OAAO,EAAEH,UAAAA,UAAU,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC;AAClF,mBAAW,OAAO,WAAW;AAC3B,cAAI,IAAI,IAAI,GAAG,KAAK,IAAI,gBAAgB,KAAM;AAC9C,gBAAM,MAAM,MAAM,IAAI,IAAI,YAAY;AACtC,cAAI,SAAS,IAAI,KAAK,KAAK,YAAY,KAAKE,sCAAoB,SAAS,CAAC;AAAA,QAC5E;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAGU,YAAY,KAAU,QAA6C;AAC3E,WAAO;AAAA,MACL,IAAI,OAAO,IAAIF,UAAAA,UAAU,EAAE,CAAC;AAAA,MAC5B,QAAQ,IAAIA,UAAAA,UAAU,MAAM;AAAA,MAC5B,YAAY,OAAO,IAAIA,UAAAA,UAAU,WAAW,CAAC;AAAA,MAC7C,cAAc;AAAA,MACd,qBAAqB;AAAA,IAAA;AAAA,EAEzB;AAAA,EAEA,MAAM,wBAAwB,SAIK;AACjC,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,UAAUA,UAAAA,UAAU,EAAE,KAAKA,UAAAA,UAAU,MAAM,KAAKA,UAAAA,UAAU,WAAW,SAAS,KAAK,EAAEZ,UAAAA,UAAU,GAAG,CAAC,UACxFY,UAAAA,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,QAAQA,UAAAA,UAAU,eAAe,MAAM,KAAK,GAAG,CAAC,CAAC;AAAA,MAChG,CAAC,QAAQ,WAAW,QAAQ,cAAc;AAAA,MAC1C,QAAQ;AAAA,IAAA;AAEV,WAAO,IAAI,KAAK,CAAC,IAAI,KAAK,YAAY,IAAI,KAAK,CAAC,GAAGE,sCAAoB,WAAW,IAAI;AAAA,EACxF;AAAA,EAEA,MAAM,6BAA6B,SAIH;AAC9B,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,iBAAiB,KAAK,EAAEd,UAAAA,UAAU,QAAQ,CAAC,UAAUgB,UAAAA,eAAe,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,QAAQA,yBAAe,eAAe,MAAM,KAAK,GAAG,CAAC,CAAC;AAAA,MACpJ,CAAC,QAAQ,WAAW,QAAQ,cAAc;AAAA,MAC1C,QAAQ;AAAA,IAAA;AAEV,WAAO,IAAI,KAAK,CAAC,IAAI,KAAK,YAAY,IAAI,KAAK,CAAC,CAAC,IAAI;AAAA,EACvD;AAAA,EAEA,MAAM,eAAe,SAGI;AAIvB,UAAM,EAAE,WAAW,KAAK,qBAAqB,QAAQ,UAAU,KAAK,KAAK;AACzE,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,eAAe,KAAK,EAAEhB,UAAAA,UAAU,QAAQ,CAAC,KAAKiB,UAAAA,wBAAwB,KAAK,IAAI,CAAC,aACnE,KAAK,OAAO,OAAO,MAAM,CAAC;AAAA,MACvC;AAAA,MACA,QAAQ;AAAA,IAAA;AAEV,WAAO,KAAK,YAAY,IAAI,KAAK,CAAC,CAAE;AAAA,EACtC;AAAA,EAEA,MAAM,eAAe,SAGW;AAC9B,UAAM,CAAC,GAAG,IAAI,MAAM,KAAK,gBAAgB;AAAA,MACvC,aAAa,CAAC,QAAQ,UAAU;AAAA,MAChC,GAAI,QAAQ,KAAK,EAAE,IAAI,QAAQ,GAAA,IAAO,CAAA;AAAA,IAAC,CACxC;AACD,WAAO,OAAO;AAAA,EAChB;AAAA,EAEA,MAAM,gBAAgB,SAGK;AACzB,QAAI,CAAC,QAAQ,YAAY,eAAe,CAAA;AAGxC,WAAO,KAAK,aAAa,QAAQ,aAAa,OAAO,gBAAgB;AAGnE,YAAM,MAAM,MAAM,KAAK;AAAA,QACrB,eAAe,KAAK,EAAEjB,UAAAA,UAAU,QAAQ,CAAC,UAAUgB,yBAAe,EAAE,QAAQ,KAAK,OAAO,YAAY,MAAM,CAAC,eAC5FA,yBAAe,EAAE,KAAKA,yBAAe,UAAU;AAAA,QAC9D;AAAA,QACA,QAAQ;AAAA,MAAA;AAEV,aAAO,IAAI,KAAK,IAAI,CAAC,MAAM,KAAK,eAAe,CAAC,CAAC;AAAA,IACnD,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,mBAAmB,SAKO;AAC9B,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,UAAU,KAAK,EAAEhB,UAAAA,UAAU,QAAQ,CAAC,QAAQgB,UAAAA,eAAe,OAAO,MAAM,KAAK,GAAG,CAAC,CAAC,KAAKA,UAAAA,eAAe,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,UACrHA,UAAAA,eAAe,EAAE,MAAM,KAAK,GAAG,CAAC,CAAC,cAAcA,UAAAA,eAAe,EAAE,KAAKA,UAAAA,eAAe,UAAU;AAAA,MACzG,CAAC,KAAK,OAAO,QAAQ,OAAO,GAAG,QAAQ,KAAK,QAAQ,UAAU;AAAA,MAC9D,QAAQ;AAAA,IAAA;AAEV,WAAO,IAAI,KAAK,CAAC,IAAI,KAAK,eAAe,IAAI,KAAK,CAAC,CAAC,IAAI;AAAA,EAC1D;AAAA;AAAA,EAGA,MAAM,UAAU,SAMS;AACvB,UAAM,EAAE,WAAW,OAAO,qBAAqB,KAAK,gBAAgB;AACpE,UAAM,cAAc,KAAK,aAAa,KAAK,mBAAmB;AAG9D,UAAM,YAAY,KAAK,MAAA;AACvB,UAAM,OAAOL,UAAAA,YAAY,KAAK,IAAI;AAKlC,QAAI,CAAC,aAAa;AAChB,aAAO,KAAK,YAAY,OAAO,YAAY;AACzC,cAAM,MAAM,MAAM,KAAK;AAAA,UACrB,UAAU,KAAK,EAAEX,UAAAA,UAAU,GAAG,CAAC,QAAQY,oBAAU,MAAM,MAAM,KAAK,GAAG,CAAC,CAAC,KAAKA,UAAAA,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,KAC3GA,oBAAU,YAAY,MAAM,KAAK,GAAG,CAAC,CAAC,KAAKA,UAAAA,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,KAAKA,UAAAA,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,UAClHA,UAAAA,UAAU,EAAE,eAAeA,UAAAA,UAAU,EAAE,SAAS,KAAK,EAAEZ,oBAAU,GAAG,CAAC,UACrEY,UAAAA,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,QAAQA,UAAAA,UAAU,MAAM,QAAQ,KAAK,GAAG,CAAC,CAAC,KAAK,KAAK,GAAG,CAAC,CAAC,SAC/FA,oBAAU,WAAW,OAAO,KAAK,GAAG,CAAC,CAAC,SAASA,UAAAA,UAAU,SAAS,eAAeA,UAAAA,UAAU,SAAS,MAAM,KAAK,GAAG,CAAC,CAAC,cAC/GA,UAAAA,UAAU,QAAQ,UAAUA,UAAAA,UAAU,WAAW,cAAc,KAAK,GAAG,EAAE,CAAC,sCACzE,IAAI;AAAA,UACnB;AAAA,YACEM,kBAAAA,UAAU;AAAA,YACV;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACAA,kBAAAA,UAAU;AAAA,YACVA,kBAAAA,UAAU;AAAA,YACV;AAAA,YACA;AAAA,YACA;AAAA,UAAA;AAAA,UAEF;AAAA,QAAA;AAEF,eAAO,KAAK,YAAY,IAAI,KAAK,IAAI,CAAC,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC;AAAA,MAC7D,CAAC;AAAA,IACH;AAMA,UAAM,EAAE,UAAU,QAAA,IAAY,KAAK,aAAa,KAAK;AACrD,WAAO,KAAK,YAAY,OAAO,YAAY;AACzC,YAAM,0BAAU,IAAA;AAChB,eAAS,SAAS,GAAG,IAAI,OAAO,SAAS,SAAS,SAAS,UAAU,UAAU;AAC7E,cAAM,MAAM,MAAM,KAAK;AAAA,UACrB,UAAUN,UAAAA,UAAU,EAAE,KAAKA,UAAAA,UAAU,8BAA8B,SAAS,KAAK,EAAEZ,UAAAA,UAAU,GAAG,CAAC,UACtFY,UAAAA,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,QAAQA,UAAAA,UAAU,MAAM,QAAQ,KAAK,GAAG,CAAC,CAAC,KAAK,KAAK,GAAG,CAAC,CAAC,SAC/FA,UAAAA,UAAU,WAAW,OAAO,KAAK,GAAG,CAAC,CAAC,SAASA,UAAAA,UAAU,SAAS,eAAeA,UAAAA,UAAU,SAAS,MAAM,KAAK,GAAG,CAAC,CAAC,cAC/GA,UAAAA,UAAU,QAAQ,UAAUA,UAAAA,UAAU,WAAW,cACpD,KAAK,GAAG,CAAC,CAAC,WAAW,KAAK,GAAG,CAAC,CAAC;AAAA,UAC1C,CAAC,WAAWM,4BAAU,SAASA,kBAAAA,UAAU,OAAO,KAAK,KAAK,UAAU,MAAM;AAAA,UAC1E;AAAA,QAAA;AAEF,YAAI,IAAI,KAAK,WAAW,EAAG;AAC3B,aAAK,uBAAuB,IAAI,MAAM,aAAa,OAAO,GAAG;AAC7D,YAAI,IAAI,KAAK,SAAS,SAAU;AAAA,MAClC;AACA,UAAI,IAAI,SAAS,EAAG,QAAO,CAAA;AAC3B,YAAM,SAAS,CAAC,GAAG,GAAG;AACtB,YAAM,OAAO,CAACA,kBAAAA,UAAU,QAAQ,KAAK,aAAa,WAAW,aAAa,GAAG;AAC7E,YAAM,MAAM,MAAM,KAAK;AAAA,QACrB,UAAU,KAAK,EAAElB,UAAAA,UAAU,GAAG,CAAC,QAAQY,UAAAA,UAAU,MAAM,MAAM,KAAK,GAAG,CAAC,CAAC,KAAKA,UAAAA,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,KAC3GA,UAAAA,UAAU,YAAY,MAAM,KAAK,GAAG,CAAC,CAAC,KAAKA,UAAAA,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,KAC/EA,UAAAA,UAAU,yBAAyB,MAAM,KAAK,GAAG,CAAC,CAAC,KAAKA,oBAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,UACtFA,UAAAA,UAAU,EAAE,QAAQ,KAAK,OAAO,OAAO,QAAQ,KAAK,MAAM,CAAC,SAC7DA,UAAAA,UAAU,MAAM,QAAQ,KAAK,GAAG,KAAK,SAAS,OAAO,MAAM,CAAC,KAAK,KAAK,GAAG,KAAK,SAAS,OAAO,SAAS,CAAC,CAAC,eACnG,IAAI;AAAA,QACnB,CAAC,GAAG,MAAM,GAAG,QAAQM,kBAAAA,UAAU,SAASA,kBAAAA,UAAU,KAAK;AAAA,QACvD;AAAA,MAAA;AAEF,aAAO,KAAK,YAAY,IAAI,KAAK,IAAI,CAAC,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC;AAAA,IAC7D,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWQ,WAAW,QAAmB,WAA8C;AAClF,QAAI,MAAM,QAAQN,UAAAA,UAAU,MAAM,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC;AAC9D,WAAO,KAAKM,kBAAAA,UAAU,MAAM;AAC5B,QAAI,aAAa,MAAM;AACrB,aAAO,QAAQN,UAAAA,UAAU,UAAU,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC;AAC/D,aAAO,KAAK,SAAS;AAAA,IACvB;AACA,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,WAAW,SAKI;AACnB,UAAM,SAAoB;AAAA,MACxB,KAAK,aAAa,QAAQ,KAAK,QAAQ,mBAAmB;AAAA,MAC1D,QAAQ;AAAA,MACR,QAAQ;AAAA,IAAA;AAEV,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,UAAU,KAAK,EAAEZ,UAAAA,UAAU,GAAG,CAAC,QAAQY,UAAAA,UAAU,YAAY,MAAM,KAAK,GAAG,CAAC,CAAC,KAAKA,UAAAA,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,UAC3GA,UAAAA,UAAU,EAAE,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK,WAAW,QAAQ,QAAQ,SAAS,CAAC;AAAA,MACpF;AAAA,IAAA;AAEF,WAAO,IAAI,WAAW;AAAA,EACxB;AAAA,EAEA,MAAM,YAAY,SAMG;AACnB,UAAM,SAAoB;AAAA,MACxBM,kBAAAA,UAAU;AAAA,MACV,KAAK,OAAO,QAAQ,WAAW;AAAA,MAC/B,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,IAAA;AAEV,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,UAAU,KAAK,EAAElB,UAAAA,UAAU,GAAG,CAAC,QAAQY,UAAAA,UAAU,MAAM,MAAM,KAAK,GAAG,CAAC,CAAC,KAAKA,UAAAA,UAAU,YAAY,MAAM,KAAK,GAAG,CAAC,CAAC,KAC7GA,UAAAA,UAAU,YAAY,MAAM,KAAK,GAAG,CAAC,CAAC,KAAKA,UAAAA,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,KAAKA,UAAAA,UAAU,YAAY,YAAYA,UAAAA,UAAU,UAAU,iBACpIA,UAAAA,UAAU,EAAE,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK,WAAW,QAAQ,QAAQ,SAAS,CAAC;AAAA,MACpF;AAAA,MACA,QAAQ;AAAA,IAAA;AAEV,WAAO,IAAI,WAAW;AAAA,EACxB;AAAA,EAEA,MAAM,SAAS,SAOM;AACnB,UAAM,SAAoB;AAAA,MACxBM,kBAAAA,UAAU;AAAA,MACV,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,IAAA;AAEV,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,UAAU,KAAK,EAAElB,UAAAA,UAAU,GAAG,CAAC,QAAQY,UAAAA,UAAU,MAAM,MAAM,KAAK,GAAG,CAAC,CAAC,KAAKA,UAAAA,UAAU,aAAa,MAAM,KAAK,GAAG,CAAC,CAAC,KAC9GA,UAAAA,UAAU,WAAW,MAAM,KAAK,GAAG,CAAC,CAAC,KAAKA,UAAAA,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,KAAKA,UAAAA,UAAU,eAAe,MAAM,KAAK,GAAG,CAAC,CAAC,KAC5HA,UAAAA,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,KAAKA,UAAAA,UAAU,YAAY,YAAYA,UAAAA,UAAU,UAAU,iBACzFA,UAAAA,UAAU,EAAE,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK,WAAW,QAAQ,QAAQ,SAAS,CAAC;AAAA,MACpF;AAAA,IAAA;AAEF,WAAO,IAAI,WAAW;AAAA,EACxB;AAAA,EAEA,MAAM,QAAQ,SAKO;AACnB,UAAM,SAAoB;AAAA,MACxBM,kBAAAA,UAAU;AAAA,MACV,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,IAAA;AAEV,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,UAAU,KAAK,EAAElB,UAAAA,UAAU,GAAG,CAAC,QAAQY,UAAAA,UAAU,MAAM,MAAM,KAAK,GAAG,CAAC,CAAC,KAAKA,UAAAA,UAAU,SAAS,MAAM,KAAK,GAAG,CAAC,CAAC,KAC1GA,UAAAA,UAAU,eAAe,MAAM,KAAK,GAAG,CAAC,CAAC,KAAKA,UAAAA,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,KAAKA,UAAAA,UAAU,YAAY,YAAYA,UAAAA,UAAU,UAAU,iBACvIA,UAAAA,UAAU,EAAE,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK,WAAW,QAAQ,QAAQ,SAAS,CAAC;AAAA,MACpF;AAAA,IAAA;AAEF,WAAO,IAAI,WAAW;AAAA,EACxB;AAAA,EAEA,MAAM,mBAAmB,SAII;AAI3B,UAAM,SAAoB,CAACM,kBAAAA,UAAU,SAAS,QAAQ,KAAKA,4BAAU,QAAQ,QAAQ,GAAG;AACxF,QAAI,QACF,GAAGN,oBAAU,MAAM,MAAM,KAAK,GAAG,CAAC,CAAC,QAAQA,UAAAA,UAAU,YAAY,oBAC1DA,UAAAA,UAAU,YAAY,MAAM,KAAK,GAAG,CAAC,CAAC;AAC/C,QAAI,QAAQ,WAAW;AACrB,eAAS,QAAQA,UAAAA,UAAU,UAAU,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC;AACjE,aAAO,KAAK,QAAQ,SAAS;AAAA,IAC/B;AACA,UAAM,UAAU,KAAK,GAAG,OAAO,MAAM;AACrC,WAAO,KAAK,QAAQ,KAAK;AACzB,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,UAAU,KAAK,EAAEZ,UAAAA,UAAU,GAAG,CAAC,QAAQY,oBAAU,MAAM,MAAM,KAAK,GAAG,CAAC,CAAC,KAAKA,UAAAA,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,KAC3GA,oBAAU,YAAY,YAAYA,UAAAA,UAAU,UAAU,iBAChDA,UAAAA,UAAU,EAAE,eAAeA,UAAAA,UAAU,EAAE,SAAS,KAAK,EAAEZ,UAAAA,UAAU,GAAG,CAAC,UAAU,KAAK,UAAU,OAAO,eACjGY,UAAAA,UAAU,EAAE,KAAKA,UAAAA,UAAU,UAAU,KAAKA,UAAAA,UAAU,yBAAyB;AAAA,MAC5F;AAAA,IAAA;AAEF,WAAO,IAAI,KAAK,IAAI,CAAC,OAAO;AAAA,MAC1B,GAAG,KAAK,UAAU,CAAC;AAAA,MACnB,qBAAqB,KAAK,UAAU,EAAEA,UAAAA,UAAU,yBAAyB,CAAC;AAAA,IAAA,EAC1E;AAAA,EACJ;AAAA,EAEA,MAAM,cAAc,SAIE;AACpB,UAAM,SAAoB;AAAA,MACxBM,kBAAAA,UAAU;AAAA,MACV,QAAQ;AAAA,MACR,QAAQ;AAAA,MACRA,kBAAAA,UAAU;AAAA,MACVA,kBAAAA,UAAU;AAAA,MACV,QAAQ;AAAA,IAAA;AAEV,QAAI,QACF,GAAGN,UAAAA,UAAU,MAAM,QAAQ,KAAK,GAAG,CAAC,CAAC,KAAK,KAAK,GAAG,CAAC,CAAC,SAASA,UAAAA,UAAU,SAAS,oBACzEA,UAAAA,UAAU,SAAS,OAAO,KAAK,GAAG,CAAC,CAAC;AAC7C,QAAI,QAAQ,WAAW;AACrB,eAAS,QAAQA,UAAAA,UAAU,UAAU,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC;AACjE,aAAO,KAAK,QAAQ,SAAS;AAAA,IAC/B;AACA,UAAM,UAAU,KAAK,GAAG,OAAO,MAAM;AACrC,WAAO,KAAK,QAAQ,KAAK;AACzB,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,UAAU,KAAK,EAAEZ,UAAAA,UAAU,GAAG,CAAC,QAAQY,UAAAA,UAAU,MAAM,MAAM,KAAK,GAAG,CAAC,CAAC,KAAKA,UAAAA,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,KAC3GA,UAAAA,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,KAAKA,UAAAA,UAAU,YAAY,YAAYA,UAAAA,UAAU,UAAU,iBACzFA,UAAAA,UAAU,EAAE,eAAeA,UAAAA,UAAU,EAAE,SAAS,KAAK,EAAEZ,UAAAA,UAAU,GAAG,CAAC,UAAU,KAAK,UAAU,OAAO,eACjGY,UAAAA,UAAU,EAAE,KAAKA,UAAAA,UAAU,UAAU;AAAA,MACpD;AAAA,IAAA;AAEF,WAAO,IAAI,KAAK,IAAI,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC;AAAA,EAC9C;AAAA,EAEA,MAAM,WAAW,SAIkB;AACjC,UAAM,CAAC,GAAG,IAAI,MAAM,KAAK,YAAY;AAAA,MACnC,QAAQ,CAAC,QAAQ,KAAK;AAAA,MACtB,KAAK,QAAQ;AAAA,MACb,GAAI,QAAQ,KAAK,EAAE,IAAI,QAAQ,GAAA,IAAO,CAAA;AAAA,IAAC,CACxC;AACD,WAAO,OAAO;AAAA,EAChB;AAAA,EAEA,MAAM,YAAY,SAIY;AAC5B,QAAI,CAAC,QAAQ,OAAO,eAAe,CAAA;AAGnC,WAAO,KAAK,aAAa,QAAQ,QAAQ,OAAO,WAAW;AAIzD,YAAM,OAAkB,CAACM,4BAAU,SAAS,QAAQ,KAAK,QAAQ,GAAG;AACpE,YAAM,MAAM,MAAM,KAAK;AAAA,QACrB,UAAU,KAAK,EAAElB,oBAAU,GAAG,CAAC,QAAQY,UAAAA,UAAU,MAAM,MAAM,KAAK,GAAG,CAAC,CAAC,KAAKA,UAAAA,UAAU,aAAa,SAC9FA,UAAAA,UAAU,WAAW,MAAM,KAAK,GAAG,CAAC,CAAC,KAAKA,oBAAU,SAAS,YAAYA,oBAAU,eAAe,YAClGA,oBAAU,YAAY,YAAYA,UAAAA,UAAU,UAAU,YAAYA,UAAAA,UAAU,YAAY,YACxFA,UAAAA,UAAU,UAAU,YAAYA,UAAAA,UAAU,YAAY,YAAYA,UAAAA,UAAU,UAAU,YAAYA,UAAAA,UAAU,UAAU,YAAYA,UAAAA,UAAU,YAAY,YAAYA,UAAAA,UAAU,UAAU,YACxLA,UAAAA,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,UAC9BA,oBAAU,EAAE,QAAQ,KAAK,OAAO,OAAO,QAAQ,KAAK,MAAM,CAAC,SAC7DA,UAAAA,UAAU,MAAM,OAAO,KAAK,GAAG,KAAK,SAAS,OAAO,MAAM,CAAC,cACrDA,UAAAA,UAAU,EAAE,KAAKA,UAAAA,UAAU,UAAU,KAAKA,UAAAA,UAAU,MAAM,KAAKA,UAAAA,UAAU,WAAW;AAAA,QACnG,CAAC,GAAG,MAAM,GAAG,QAAQM,kBAAAA,UAAU,MAAM;AAAA,QACrC,QAAQ;AAAA,MAAA;AAEV,aAAO,IAAI,KAAK,IAAI,CAAC,OAAO;AAAA,QAC1B,GAAG,KAAK,UAAU,CAAC;AAAA,QACnB,QAAQ,EAAEN,UAAAA,UAAU,MAAM;AAAA,QAC1B,YAAY,OAAO,EAAEA,UAAAA,UAAU,WAAW,CAAC;AAAA,MAAA,EAC3C;AAAA,IACJ,CAAC;AAAA,EACH;AAAA;AAAA,EAGA,MAAM,OAAO,SAA+E;AAC1F,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,UAAUD,UAAAA,YAAY,KAAK,IAAI,CAAC,SAAS,KAAK,EAAEX,UAAAA,UAAU,GAAG,CAAC,UAAUY,UAAAA,UAAU,EAAE,MAAM,KAAK,GAAG,CAAC,CAAC;AAAA,MACpG,CAAC,QAAQ,KAAK;AAAA,MACd,QAAQ;AAAA,IAAA;AAEV,WAAO,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,IAAI,KAAK,CAAC,CAAC,IAAI;AAAA,EAClD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,iBAAiB,SAAwB,QAA2B;AAC1E,UAAM,UAAoB,CAAA;AAC1B,QAAI,QAAQ,WAAW;AACrB,cAAQ,KAAK,GAAGA,UAAAA,UAAU,UAAU,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC,EAAE;AAClE,aAAO,KAAK,QAAQ,SAAS;AAAA,IAC/B;AACA,QAAI,QAAQ,YAAY,QAAQ,SAAS,QAAQ;AAC/C,cAAQ;AAAA,QACN,GAAGA,UAAAA,UAAU,MAAM,QAAQ,KAAK,OAAO,QAAQ,SAAS,QAAQ,OAAO,MAAM,CAAC;AAAA,MAAA;AAEhF,aAAO,KAAK,GAAG,QAAQ,QAAQ;AAAA,IACjC;AACA,QAAI,QAAQ,YAAY;AACtB,cAAQ,KAAK,GAAGA,UAAAA,UAAU,WAAW,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC,EAAE;AACnE,aAAO,KAAK,QAAQ,UAAU;AAAA,IAChC;AACA,QAAI,QAAQ,wBAAwB;AAClC,cAAQ,KAAK,GAAGA,UAAAA,UAAU,yBAAyB,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC,EAAE;AACjF,aAAO,KAAK,QAAQ,sBAAsB;AAAA,IAC5C;AACA,QAAI,QAAQ,QAAQ;AAClB,YAAM,UAAU,KAAK,YAAY,QAAQ,MAAM;AAC/C,YAAM,OAAO;AAAA,QACXA,UAAAA,UAAU;AAAA,QACVA,UAAAA,UAAU;AAAA,QACVA,UAAAA,UAAU;AAAA,QACVA,UAAAA,UAAU;AAAA,QACVA,oBAAU;AAAA,MAAA;AAEZ,YAAM,MAAM,KAAK,IAAI,CAAC,QAAQ;AAC5B,cAAM,SAAS,GAAG,GAAG,UAAU,KAAK,GAAG,OAAO,MAAM,CAAC;AACrD,eAAO,KAAK,OAAO;AACnB,eAAO;AAAA,MACT,CAAC;AACD,cAAQ,KAAK,IAAI,IAAI,KAAK,MAAM,CAAC,GAAG;AAAA,IACtC;AACA,WAAO,QAAQ,SAAS,SAAS,QAAQ,KAAK,OAAO,CAAC,KAAK;AAAA,EAC7D;AAAA,EAEA,MAAM,QAAQ,SAAkF;AAC9F,UAAM,SAAoB,CAAA;AAC1B,UAAM,QAAQ,KAAK,iBAAiB,SAAS,MAAM;AACnD,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,UAAUD,sBAAY,KAAK,IAAI,CAAC,SAAS,KAAK,EAAEX,UAAAA,UAAU,GAAG,CAAC,IAAI,KAAK,aACzDY,UAAAA,UAAU,UAAU,UAChC,KAAK,OAAO,SAAS,MAAM;AAAA,MAC7B;AAAA,IAAA;AAEF,WAAO,IAAI,KAAK,IAAI,CAAC,MAAM,KAAK,OAAO,CAAC,CAAC;AAAA,EAC3C;AAAA,EAEA,MAAM,UAAU,SAAyC;AACvD,UAAM,SAAoB,CAAA;AAC1B,UAAM,QAAQ,KAAK,iBAAiB,SAAS,MAAM;AACnD,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,6BAA6B,KAAK,EAAEZ,UAAAA,UAAU,GAAG,CAAC,IAAI,KAAK;AAAA,MAC3D;AAAA,IAAA;AAEF,WAAO,OAAO,IAAI,KAAK,CAAC,GAAG,KAAK,CAAC;AAAA,EACnC;AAAA,EAEA,MAAM,kBAAkB,SAGe;AACrC,UAAM,SAAoB,CAAA;AAC1B,UAAM,QAAQ,KAAK,iBAAiB,SAAS,MAAM;AACnD,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,UAAUY,UAAAA,UAAU,MAAM,wBAAwB,KAAK,EAAEZ,UAAAA,UAAU,GAAG,CAAC,IAAI,KAAK,aAAaY,UAAAA,UAAU,MAAM;AAAA,MAC7G;AAAA,IAAA;AAEF,UAAM,SAAS,KAAK,kBAAA;AACpB,eAAW,OAAO,IAAI,KAAM,QAAO,IAAIA,UAAAA,UAAU,MAAM,CAAc,IAAI,OAAO,IAAI,CAAC;AACrF,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,0BAA0B,SAEuB;AACrD,WAAO,KAAK,qBAAqBA,UAAAA,UAAU,YAAY,QAAQ,UAAU;AAAA,EAC3E;AAAA,EAEA,MAAM,6BAA6B,SAEoB;AACrD,WAAO,KAAK,qBAAqBA,UAAAA,UAAU,2BAA2B,QAAQ,YAAY;AAAA,EAC5F;AAAA;AAAA,EAGA,MAAc,qBACZ,WACA,MACoD;AACpD,UAAM,MAAiD,CAAA;AACvD,eAAW,OAAO,KAAM,KAAI,GAAG,IAAI,KAAK,kBAAA;AACxC,QAAI,CAAC,KAAK,OAAQ,QAAO;AAGzB,UAAM,KAAK,aAAa,MAAM,OAAO,UAAU;AAC7C,YAAM,MAAM,MAAM,KAAK;AAAA,QACrB,UAAU,SAAS,KAAKA,oBAAU,MAAM,wBAAwB,KAAK,EAAEZ,UAAAA,UAAU,GAAG,CAAC,UAC1E,SAAS,QAAQ,KAAK,OAAO,MAAM,MAAM,CAAC,cAAc,SAAS,KAAKY,UAAAA,UAAU,MAAM;AAAA,QACjG;AAAA,MAAA;AAEF,iBAAW,OAAO,IAAI,MAAM;AAC1B,cAAM,SAAS,IAAI,OAAO,IAAI,SAAS,CAAC,CAAC;AACzC,YAAI,eAAe,IAAIA,UAAAA,UAAU,MAAM,CAAc,IAAI,OAAO,IAAI,CAAC;AAAA,MACvE;AACA,aAAO,IAAI;AAAA,IACb,CAAC;AACD,WAAO;AAAA,EACT;AAAA;AAAA,EAGQ,mBAAmB,SAA0B,QAA2B;AAC9E,UAAM,UAAoB,CAAA;AAC1B,QAAI,QAAQ,QAAQ;AAClB,cAAQ,KAAK,GAAGC,UAAAA,YAAY,IAAI,UAAU,KAAK,GAAG,OAAO,MAAM,CAAC,aAAa;AAC7E,aAAO,KAAK,KAAK,YAAY,QAAQ,MAAM,CAAC;AAAA,IAC9C;AACA,QAAI,QAAQ,qBAAqB,QAAW;AAC1C,cAAQ,KAAK,GAAGA,UAAAA,YAAY,iBAAiB,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC,EAAE;AAC3E,aAAO,KAAK,KAAK,OAAO,QAAQ,gBAAgB,CAAC;AAAA,IACnD;AACA,WAAO,QAAQ,SAAS,SAAS,QAAQ,KAAK,OAAO,CAAC,KAAK;AAAA,EAC7D;AAAA,EAEA,MAAM,WAAW,UAAwC,IAAyB;AAChF,UAAM,SAAoB,CAAA;AAC1B,UAAM,QAAQ,KAAK,mBAAmB,SAAS,MAAM;AAGrD,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,iBAAiB,KAAK,EAAEb,UAAAA,UAAU,KAAK,CAAC,IAAI,KAAK,aAAaa,UAAAA,YAAY,IAAI,SAC5E,KAAK,OAAO,SAAS,MAAM;AAAA,MAC7B;AAAA,IAAA;AAEF,WAAO,IAAI,KAAK,IAAI,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC;AAAA,EAC7C;AAAA,EAEA,MAAM,YAAY,UAA2B,IAAqB;AAChE,UAAM,SAAoB,CAAA;AAC1B,UAAM,QAAQ,KAAK,mBAAmB,SAAS,MAAM;AACrD,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,6BAA6B,KAAK,EAAEb,UAAAA,UAAU,KAAK,CAAC,IAAI,KAAK;AAAA,MAC7D;AAAA,IAAA;AAEF,WAAO,OAAO,IAAI,KAAK,CAAC,GAAG,KAAK,CAAC;AAAA,EACnC;AAAA;AAAA,EAGQ,sBAAsB,SAA6B,QAA2B;AACpF,UAAM,UAAoB,CAAA;AAC1B,QAAI,QAAQ,WAAW;AACrB,cAAQ,KAAK,GAAGgB,UAAAA,eAAe,UAAU,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC,EAAE;AACvE,aAAO,KAAK,QAAQ,SAAS;AAAA,IAC/B;AACA,QAAI,QAAQ,YAAY,QAAW;AACjC,cAAQ,KAAK,GAAGA,UAAAA,eAAe,OAAO,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC,EAAE;AACpE,aAAO,KAAK,KAAK,OAAO,QAAQ,OAAO,CAAC;AAAA,IAC1C;AACA,QAAI,QAAQ,QAAQ;AAElB,YAAM,UAAU,KAAK,YAAY,QAAQ,MAAM;AAC/C,YAAM,OAAO,CAACA,yBAAe,IAAIA,UAAAA,eAAe,YAAYA,UAAAA,eAAe,IAAI;AAC/E,YAAM,MAAM,KAAK,IAAI,CAAC,QAAQ;AAC5B,cAAM,SAAS,GAAG,GAAG,UAAU,KAAK,GAAG,OAAO,MAAM,CAAC;AACrD,eAAO,KAAK,OAAO;AACnB,eAAO;AAAA,MACT,CAAC;AACD,cAAQ,KAAK,IAAI,IAAI,KAAK,MAAM,CAAC,GAAG;AAAA,IACtC;AACA,WAAO,QAAQ,SAAS,SAAS,QAAQ,KAAK,OAAO,CAAC,KAAK;AAAA,EAC7D;AAAA,EAEA,MAAM,cAAc,UAA2C,IAA4B;AACzF,UAAM,SAAoB,CAAA;AAC1B,UAAM,QAAQ,KAAK,sBAAsB,SAAS,MAAM;AACxD,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,iBAAiB,KAAK,EAAEhB,UAAAA,UAAU,QAAQ,CAAC,IAAI,KAAK,aACtCgB,UAAAA,eAAe,UAAU,SAASA,UAAAA,eAAe,EAAE,SAC/D,KAAK,OAAO,SAAS,MAAM;AAAA,MAC7B;AAAA,IAAA;AAEF,WAAO,IAAI,KAAK,IAAI,CAAC,MAAM,KAAK,YAAY,CAAC,CAAC;AAAA,EAChD;AAAA,EAEA,MAAM,eAAe,UAA8B,IAAqB;AACtE,UAAM,SAAoB,CAAA;AAC1B,UAAM,QAAQ,KAAK,sBAAsB,SAAS,MAAM;AACxD,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,6BAA6B,KAAK,EAAEhB,UAAAA,UAAU,QAAQ,CAAC,IAAI,KAAK;AAAA,MAChE;AAAA,IAAA;AAEF,WAAO,OAAO,IAAI,KAAK,CAAC,GAAG,KAAK,CAAC;AAAA,EACnC;AAAA,EAEA,MAAM,YAAY,SAA8D;AAC9E,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,iBAAiB,KAAK,EAAEA,UAAAA,UAAU,QAAQ,CAAC,UAAUgB,UAAAA,eAAe,EAAE,MAAM,KAAK,GAAG,CAAC,CAAC;AAAA,MACtF,CAAC,QAAQ,UAAU;AAAA,IAAA;AAErB,WAAO,IAAI,KAAK,CAAC,IAAI,KAAK,YAAY,IAAI,KAAK,CAAC,CAAC,IAAI;AAAA,EACvD;AAAA,EAEA,MAAM,gBAAgB,SAAiE;AACrF,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,iBAAiB,KAAK,EAAEhB,UAAAA,UAAU,QAAQ,CAAC,UAAUgB,UAAAA,eAAe,OAAO,MAAM,KAAK,GAAG,CAAC,CAAC,QAClFA,UAAAA,eAAe,WAAW,oBAAoBA,UAAAA,eAAe,WAAW,OAAO,KAAK,GAAG,CAAC,CAAC,aACpFA,UAAAA,eAAe,WAAW,cAAc,KAAK,GAAG,CAAC,CAAC;AAAA,MAChE,CAAC,KAAK,OAAO,IAAI,GAAG,QAAQ,KAAK,QAAQ,KAAK;AAAA,IAAA;AAEhD,WAAO,IAAI,KAAK,IAAI,CAAC,MAAM,KAAK,YAAY,CAAC,CAAC;AAAA,EAChD;AAAA,EAEA,MAAM,gBAAgB,SAKD;AAEnB,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,UAAU,KAAK,EAAEhB,UAAAA,UAAU,QAAQ,CAAC,QAAQgB,yBAAe,WAAW,MAAM,KAAK,GAAG,CAAC,CAAC,KACjFA,UAAAA,eAAe,WAAW,MAAM,KAAK,GAAG,CAAC,CAAC,KAAKA,UAAAA,eAAe,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,UAClFA,UAAAA,eAAe,EAAE,MAAM,KAAK,GAAG,CAAC,CAAC,QAAQA,yBAAe,WAAW,MAAM,KAAK,GAAG,CAAC,CAAC;AAAA,MAC9F;AAAA,QACE,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,QAAQ;AAAA,MAAA;AAAA,IACV;AAEF,WAAO,IAAI,WAAW;AAAA,EACxB;AAAA;AAAA,EAGA,MAAM,UAAU,SAIW;AACzB,UAAM,CAAC,GAAG,IAAI,MAAM,KAAK,WAAW;AAAA,MAClC,QAAQ,CAAC,QAAQ,KAAK;AAAA,MACtB,KAAK,QAAQ;AAAA,MACb,GAAI,QAAQ,KAAK,EAAE,IAAI,QAAQ,GAAA,IAAO,CAAA;AAAA,IAAC,CACxC;AACD,WAAO,OAAO;AAAA,EAChB;AAAA,EAEA,MAAM,WAAW,SAIK;AACpB,QAAI,CAAC,QAAQ,OAAO,eAAe,CAAA;AAGnC,WAAO,KAAK,aAAa,QAAQ,QAAQ,OAAO,WAAW;AACzD,YAAM,OAAkB,CAACE,4BAAU,WAAW,QAAQ,KAAK,QAAQ,GAAG;AACtE,YAAM,OAAO,CAACA,kBAAAA,UAAU,SAASA,kBAAAA,UAAU,KAAK;AAChD,YAAM,MAAM,MAAM,KAAK;AAAA,QACrB,UAAU,KAAK,EAAElB,UAAAA,UAAU,GAAG,CAAC,QAAQY,UAAAA,UAAU,MAAM,MAAM,KAAK,GAAG,CAAC,CAAC,KAAKA,UAAAA,UAAU,YAAY,MAAM,KAAK,GAAG,CAAC,CAAC,KAC7GA,UAAAA,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,KAAKA,UAAAA,UAAU,YAAY,YAAYA,UAAAA,UAAU,UAAU,iBACzFA,UAAAA,UAAU,EAAE,QAAQ,KAAK,OAAO,OAAO,QAAQ,KAAK,MAAM,CAAC,SAC7DA,UAAAA,UAAU,MAAM,QAAQ,KAAK,OAAO,KAAK,QAAQ,KAAK,SAAS,OAAO,MAAM,CAAC,eACvEA,UAAAA,UAAU,EAAE,KAAKA,UAAAA,UAAU,UAAU;AAAA,QACpD,CAAC,GAAG,MAAM,GAAG,QAAQ,GAAG,IAAI;AAAA,QAC5B,QAAQ;AAAA,MAAA;AAEV,aAAO,IAAI,KAAK,IAAI,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC;AAAA,IAC9C,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,UAAU,SAA4E;AAC1F,UAAM,CAAC,GAAG,IAAI,MAAM,KAAK,WAAW;AAAA,MAClC,QAAQ,CAAC,QAAQ,KAAK;AAAA,MACtB,GAAI,QAAQ,KAAK,EAAE,IAAI,QAAQ,GAAA,IAAO,CAAA;AAAA,IAAC,CACxC;AACD,WAAO,OAAO;AAAA,EAChB;AAAA,EAEA,MAAM,WAAW,SAA0E;AACzF,QAAI,CAAC,QAAQ,OAAO,eAAe,CAAA;AAGnC,WAAO,KAAK,aAAa,QAAQ,QAAQ,OAAO,WAAW;AAGzD,YAAM,MAAM,MAAM,KAAK;AAAA,QACrB,eAAe,KAAK,EAAEZ,UAAAA,UAAU,GAAG,CAAC,UAAUY,UAAAA,UAAU,EAAE,QAAQ,KAAK,OAAO,OAAO,MAAM,CAAC,SACnFA,UAAAA,UAAU,MAAM,OAAO,KAAK,GAAG,OAAO,MAAM,CAAC,cACvCA,UAAAA,UAAU,EAAE,KAAKA,UAAAA,UAAU,UAAU;AAAA,QACpD,CAAC,GAAG,QAAQM,kBAAAA,UAAU,MAAM;AAAA,QAC5B,QAAQ;AAAA,MAAA;AAEV,aAAO,IAAI,KAAK,IAAI,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC;AAAA,IAC9C,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,mBAAmB,SAIL;AAClB,QAAI,CAAC,QAAQ,SAAS,OAAQ,QAAO;AACrC,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,eAAe,KAAK,EAAElB,UAAAA,UAAU,GAAG,CAAC,UAAUY,UAAAA,UAAU,MAAM,QAAQ,KAAK,OAAO,QAAQ,SAAS,MAAM,CAAC,SACjGA,UAAAA,UAAU,UAAU,MAAM,KAAK,GAAG,QAAQ,SAAS,MAAM,CAAC;AAAA,MACnE,CAAC,GAAG,QAAQ,UAAU,QAAQ,SAAS;AAAA,MACvC,QAAQ;AAAA,IAAA;AAEV,WAAO,IAAI;AAAA,EACb;AAAA;AAAA,EAGA,MAAM,eAAe,SAMQ;AAC3B,UAAM,OAAiB,CAAA;AACvB,UAAM,SAAoB,CAAA;AAC1B,QAAI,QAAQ,qBAAqB,QAAW;AAC1C,WAAK,KAAK,GAAGC,UAAAA,YAAY,iBAAiB,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC,EAAE;AACxE,aAAO,KAAK,KAAK,OAAO,QAAQ,gBAAgB,CAAC;AAAA,IACnD;AACA,QAAI,QAAQ,oBAAoB,QAAW;AACzC,WAAK,KAAK,GAAGA,UAAAA,YAAY,gBAAgB,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC,EAAE;AACvE,aAAO,KAAK,KAAK,OAAO,QAAQ,eAAe,CAAC;AAAA,IAClD;AACA,SAAK,KAAK,GAAGA,UAAAA,YAAY,UAAU,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC,EAAE;AACjE,WAAO,KAAK,QAAQ,GAAG;AACvB,UAAM,SAAS,KAAK,GAAG,OAAO,MAAM;AACpC,WAAO,KAAK,QAAQ,SAAS;AAG7B,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,UAAU,KAAK,EAAEb,UAAAA,UAAU,KAAK,CAAC,QAAQ,KAAK,KAAK,IAAI,CAAC,UAAUa,UAAAA,YAAY,IAAI,MAAM,MAAM;AAAA,MAC9F;AAAA,MACA,QAAQ;AAAA,IAAA;AAEV,WAAO,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,IAAI,KAAK,CAAC,CAAC,IAAI;AAAA,EACpD;AAAA,EAEA,MAAM,YAAY,SAKI;AASpB,WAAO,KAAK,KAAK,QAAQ,IAAI,OAAO,QAAQ;AAC1C,YAAM;AAAA,QACJ,eAAe,KAAK,EAAEb,oBAAU,KAAK,CAAC,KAAKa,UAAAA,YAAY,IAAI,KAAKA,UAAAA,YAAY,iBAAiB,KACxFA,UAAAA,YAAY,gBAAgB,KAAKA,UAAAA,YAAY,UAAU,KAAKA,UAAAA,YAAY,UAAU,aAC1E,KAAK,GAAG,CAAC,CAAC,KAAK,KAAK,GAAG,CAAC,CAAC,KAAK,KAAK,GAAG,CAAC,CAAC,KAAK,KAAK,GAAG,CAAC,CAAC,KAAK,KAAK,GAAG,CAAC,CAAC,kBACjEA,sBAAY,IAAI;AAAA,QAClC,CAAC,QAAQ,MAAM,KAAK,OAAO,KAAK,GAAG,KAAK,OAAO,KAAK,GAAG,QAAQ,KAAK,QAAQ,GAAG;AAAA,MAAA;AAEjF,YAAM,MAAM,MAAM;AAAA,QAChB,iBAAiB,KAAK,EAAEb,UAAAA,UAAU,KAAK,CAAC,UAAUa,UAAAA,YAAY,IAAI,MAAM,KAAK,GAAG,CAAC,CAAC;AAAA,QAClF,CAAC,QAAQ,IAAI;AAAA,MAAA;AAEf,UAAI,CAAC,IAAI,KAAK,CAAC,EAAG,OAAM,IAAIJ,2BAAiB,2BAA2B,QAAQ,IAAI,IAAI;AACxF,aAAO,KAAK,SAAS,IAAI,KAAK,CAAC,CAAC;AAAA,IAClC,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,eAAe,SAGQ;AAC3B,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,iBAAiB,KAAK,EAAET,UAAAA,UAAU,KAAK,CAAC,UAAUa,UAAAA,YAAY,IAAI,MAAM,KAAK,GAAG,CAAC,CAAC;AAAA,MAClF,CAAC,QAAQ,IAAI;AAAA,MACb,QAAQ;AAAA,IAAA;AAEV,WAAO,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,IAAI,KAAK,CAAC,CAAC,IAAI;AAAA,EACpD;AAAA,EAEA,MAAM,YAAY,SAAqE;AAGrF,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,eAAe,KAAK,EAAEb,UAAAA,UAAU,KAAK,CAAC,UAAUa,UAAAA,YAAY,IAAI,MAAM,KAAK,GAAG,CAAC,CAAC;AAAA,MAChF,CAAC,QAAQ,IAAI;AAAA,MACb,QAAQ;AAAA,IAAA;AAEV,WAAO,IAAI,WAAW;AAAA,EACxB;AAAA;AAAA,EAGA,MAAM,eAAe,SAII;AAMvB,UAAM,IAAI,QAAQ;AAClB,WAAO,KAAK,KAAK,QAAW,OAAO,QAAQ;AACzC,YAAM,UAAU,MAAM;AAAA,QACpB,UAAU,KAAK,EAAEb,UAAAA,UAAU,QAAQ,CAAC,QAAQmB,yBAAe,YAAY,MAAM,KAAK,GAAG,CAAC,CAAC,KAClFA,UAAAA,eAAe,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,KACzCA,UAAAA,eAAe,WAAW,eAAe,KAAK,GAAG,CAAC,CAAC,KAAKA,UAAAA,eAAe,WAAW,MAClFA,UAAAA,eAAe,cAAc,eAAe,KAAK,GAAG,CAAC,CAAC,KAAKA,UAAAA,eAAe,cAAc,WAClFA,UAAAA,eAAe,YAAY,MAAM,KAAK,GAAG,CAAC,CAAC;AAAA,QACtD;AAAA,UACE,QAAQ;AAAA,UACR,QAAQ;AAAA,UACR,GAAG,cAAc;AAAA,UACjB,GAAG,iBAAiB;AAAA,UACpB,QAAQ;AAAA,QAAA;AAAA,MACV;AAEF,UAAI,QAAQ,KAAK,CAAC,EAAG,QAAO,KAAK,YAAY,QAAQ,KAAK,CAAC,CAAC;AAC5D,YAAM;AAAA,QACJ,eAAe,KAAK,EAAEnB,UAAAA,UAAU,QAAQ,CAAC,KAAKmB,UAAAA,eAAe,YAAY,KAAKA,UAAAA,eAAe,iBAAiB,KACzGA,UAAAA,eAAe,UAAU,KAAKA,yBAAe,UAAU,KAAKA,UAAAA,eAAe,YAAY,KACvFA,UAAAA,eAAe,WAAW,KAAKA,yBAAe,cAAc,aACpD,KAAK,OAAO,CAAC,CAAC,kBAAkBA,UAAAA,eAAe,YAAY;AAAA,QACxE;AAAA,UACE,QAAQ;AAAA,UACR,KAAK,OAAO,KAAK;AAAA,UACjB,QAAQ;AAAA,UACR,QAAQ;AAAA,UACR,QAAQ;AAAA,UACR,GAAG,cAAc;AAAA,UACjB,GAAG,iBAAiB;AAAA,QAAA;AAAA,MACtB;AAEF,YAAM,OAAO,MAAM;AAAA,QACjB,iBAAiB,KAAK,EAAEnB,UAAAA,UAAU,QAAQ,CAAC,UAAUmB,UAAAA,eAAe,YAAY,MAAM,KAAK,GAAG,CAAC,CAAC;AAAA,QAChG,CAAC,QAAQ,WAAW;AAAA,MAAA;AAEtB,UAAI,CAAC,KAAK,KAAK,CAAC,GAAG;AACjB,cAAM,IAAIV,UAAAA,iBAAiB,gCAAgC,QAAQ,WAAW,IAAI;AAAA,MACpF;AACA,aAAO,KAAK,YAAY,KAAK,KAAK,CAAC,CAAC;AAAA,IACtC,CAAC;AAAA,EACH;AAAA;AAAA,EAGQ,sBAAsB,SAA6B,QAA2B;AACpF,UAAM,UAAoB,CAAA;AAC1B,QAAI,QAAQ,QAAQ;AAClB,cAAQ,KAAK,GAAGU,UAAAA,eAAe,YAAY,UAAU,KAAK,GAAG,OAAO,MAAM,CAAC,aAAa;AACxF,aAAO,KAAK,KAAK,YAAY,QAAQ,MAAM,CAAC;AAAA,IAC9C;AACA,QAAI,QAAQ,qBAAqB,QAAW;AAC1C,cAAQ,KAAK,GAAGA,UAAAA,eAAe,iBAAiB,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC,EAAE;AAC9E,aAAO,KAAK,KAAK,OAAO,QAAQ,gBAAgB,CAAC;AAAA,IACnD;AAEA,QAAI,QAAQ,UAAU,UAAa,QAAQ,cAAc,QAAW;AAClE,cAAQ;AAAA,QACN,GAAGA,UAAAA,eAAe,YAAY,IAAI,QAAQ,QAAQ,OAAO,GAAG,IAAI,KAAK,GAAG,OAAO,MAAM,CAAC;AAAA,MAAA;AAExF,aAAO,KAAK,QAAQ,SAAS;AAAA,IAC/B;AACA,WAAO,QAAQ,SAAS,SAAS,QAAQ,KAAK,OAAO,CAAC,KAAK;AAAA,EAC7D;AAAA,EAEA,MAAM,cAAc,UAA2C,IAA4B;AACzF,UAAM,SAAoB,CAAA;AAC1B,UAAM,QAAQ,KAAK,sBAAsB,SAAS,MAAM;AAExD,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,iBAAiB,KAAK,EAAEnB,UAAAA,UAAU,QAAQ,CAAC,IAAI,KAAK,aAAamB,UAAAA,eAAe,YAAY,SAC1F,KAAK,OAAO,SAAS,MAAM;AAAA,MAC7B;AAAA,IAAA;AAEF,WAAO,IAAI,KAAK,IAAI,CAAC,MAAM,KAAK,YAAY,CAAC,CAAC;AAAA,EAChD;AAAA,EAEA,MAAM,eAAe,UAA8B,IAAqB;AACtE,UAAM,SAAoB,CAAA;AAC1B,UAAM,QAAQ,KAAK,sBAAsB,SAAS,MAAM;AACxD,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,6BAA6B,KAAK,EAAEnB,UAAAA,UAAU,QAAQ,CAAC,IAAI,KAAK;AAAA,MAChE;AAAA,IAAA;AAEF,WAAO,OAAO,IAAI,KAAK,CAAC,GAAG,KAAK,CAAC;AAAA,EACnC;AAAA,EAEA,MAAM,YAAY,SAA+D;AAC/E,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,iBAAiB,KAAK,EAAEA,UAAAA,UAAU,QAAQ,CAAC,UAAUmB,UAAAA,eAAe,YAAY,MAAM,KAAK,GAAG,CAAC,CAAC;AAAA,MAChG,CAAC,QAAQ,WAAW;AAAA,IAAA;AAEtB,WAAO,IAAI,KAAK,CAAC,IAAI,KAAK,YAAY,IAAI,KAAK,CAAC,CAAC,IAAI;AAAA,EACvD;AAAA,EAEA,MAAM,kBAAkB,SAIN;AAChB,UAAM,KAAK;AAAA,MACT,UAAU,KAAK,EAAEnB,UAAAA,UAAU,QAAQ,CAAC,QAAQmB,UAAAA,eAAe,iBAAiB,MAAM,KAAK,GAAG,CAAC,CAAC,KACvFA,UAAAA,eAAe,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,UAAUA,UAAAA,eAAe,YAAY,MAAM,KAAK,GAAG,CAAC,CAAC;AAAA,MACnG,CAAC,KAAK,OAAO,QAAQ,gBAAgB,GAAG,QAAQ,KAAK,QAAQ,WAAW;AAAA,IAAA;AAAA,EAE5E;AAAA,EAEA,MAAM,eAAe,SAA4E;AAG/F,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,eAAe,KAAK,EAAEnB,UAAAA,UAAU,QAAQ,CAAC,UAAUmB,UAAAA,eAAe,YAAY,MAAM,KAAK,GAAG,CAAC,CAAC;AAAA,MAC9F,CAAC,QAAQ,WAAW;AAAA,MACpB,QAAQ;AAAA,IAAA;AAEV,WAAO,IAAI,WAAW;AAAA,EACxB;AAAA;AAAA,EAGA,MAAM,mBAAmB,SAAgE;AACvF,UAAM,SAAoB,CAAA;AAC1B,UAAM,QAAQ,KAAK,eAAe,QAAQ,WAAW,MAAM;AAC3D,UAAM,UAAU,KAAK,GAAG,OAAO,MAAM;AACrC,WAAO,KAAK,QAAQ,KAAK;AAEzB,UAAM,MAAM,MAAM,KAAK;AAAA,MACrB,eAAe,KAAK,EAAEnB,oBAAU,GAAG,CAAC,UAAUY,UAAAA,UAAU,EAAE,eAC7CA,UAAAA,UAAU,EAAE,SAAS,KAAK,EAAEZ,UAAAA,UAAU,GAAG,CAAC,UAAU,KAAK,UAAU,OAAO;AAAA,MACvF;AAAA,IAAA;AAEF,WAAO,IAAI;AAAA,EACb;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYQ,eAAe,WAAmB,QAA2B;AACnE,UAAM,WAAW,KAAK,OAAOoB,kBAAAA,kBAAkB,QAAQ,OAAO,MAAM;AACpE,WAAO,KAAK,GAAGA,mCAAiB;AAGhC,UAAM,SAASA,kBAAAA,kBAAkB,IAAI,CAAC,WAAW;AAC/C,YAAM,SACJ,IAAIR,oBAAU,MAAM,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC,QAC7CA,UAAAA,UAAU,kBAAkB,MAAM,KAAK,GAAG,OAAO,SAAS,CAAC,CAAC;AACjE,aAAO,KAAK,QAAQS,UAAAA,mBAAmB,MAAM,CAAC;AAC9C,aAAO;AAAA,IACT,CAAC;AACD,UAAM,WAAW,KAAK,GAAG,OAAO,MAAM;AACtC,WAAO,KAAK,SAAS;AACrB,WACE,GAAGT,UAAAA,UAAU,qBAAqB,oBAC3BA,UAAAA,UAAU,MAAM,QAAQ,QAAQ,UAC/BA,UAAAA,UAAU,kBAAkB,eAAe,OAAO,KAAK,MAAM,CAAC,mBACrDA,UAAAA,UAAU,YAAY,KAAKA,oBAAU,SAAS,KAAKA,UAAAA,UAAU,YAAY,KACvFA,UAAAA,UAAU,UAAU,KAAKA,UAAAA,UAAU,UAAU,OAAOA,UAAAA,UAAU,qBAAqB,MAAMU,uBAAa,QAAQ,QAAQ;AAAA,EAE7H;AAAA;AAAA,EAGQ,QAAQ,MAAsB;AAEpC,UAAM,QAAQC,YAAAA,WAAW,MAAM,EAC5B,OAAO,GAAG,KAAK,QAAQ,SAAS,IAAI,IAAI,EAAE,EAC1C,OAAO,KAAK,EACZ,MAAM,GAAG,EAAE;AACd,WAAO,MAAM,KAAK;AAAA,EACpB;AAAA,EAEA,MAAM,OAAO,SAA8D;AACzE,QAAI,CAAC,KAAK,KAAM;AAChB,UAAM,KAAK,KAAK,MAAM,4BAA4B;AAAA,MAChD,KAAK,QAAQ,QAAQ,OAAO;AAAA,MAC5B,QAAQ,QAAQ,MAAM,GAAG,GAAI;AAAA,IAAA,CAC9B;AAAA,EACH;AAAA,EAEA,MAAM,UAAU,SAGU;AACxB,QAAI,CAAC,KAAK,KAAM,OAAM,IAAIhB,UAAAA,sBAAsB,qCAAqC;AACrF,UAAM,KAAK,KAAK,QAAQ,QAAQ,OAAO;AACvC,QAAI,CAAC,KAAK,cAAc;AACtB,WAAK,eAAe,MAAM,KAAK,KAAK,QAAA;AACpC,WAAK,aAAa,GAAG,gBAAgB,CAAC,QAAQ;AAC5C,cAAMiB,OAAM,KAAK,UAAU,IAAI,IAAI,OAAO;AAC1C,YAAIA,KAAK,YAAW,MAAMA,KAAK,IAAG,IAAI,WAAW,EAAE;AAAA,MACrD,CAAC;AAAA,IACH;AACA,QAAI,MAAM,KAAK,UAAU,IAAI,EAAE;AAC/B,QAAI,CAAC,KAAK;AACR,gCAAU,IAAA;AACV,WAAK,UAAU,IAAI,IAAI,GAAG;AAC1B,YAAM,KAAK,aAAa,MAAM,WAAW,EAAE,GAAG;AAAA,IAChD;AACA,QAAI,IAAI,QAAQ,cAAc;AAC9B,WAAO;AAAA,MACL,aAAa,YAAY;AACvB,YAAK,OAAO,QAAQ,cAAc;AAClC,YAAI,IAAK,SAAS,GAAG;AACnB,eAAK,UAAU,OAAO,EAAE;AACxB,gBAAM,KAAK,cAAc,MAAM,aAAa,EAAE,GAAG,EAAE,MAAM,MAAM,MAAS;AAAA,QAC1E;AAAA,MACF;AAAA,IAAA;AAAA,EAEJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,MAAM,gBAAgB,SAA4C;AAChE,QAAI,CAAC,KAAK,KAAM,QAAO;AACvB,UAAM,WAAW,KAAK,YAAY,IAAI,QAAQ,GAAG;AACjD,QAAI,SAAU,QAAO;AACrB,UAAM,SAAS,MAAM,KAAK,KAAK,QAAA;AAC/B,QAAI;AACF,YAAM,MAAM,MAAM,OAAO,MAAM,6CAA6C;AAAA,QAC1E,YAAY,QAAQ,GAAG;AAAA,MAAA,CACxB;AACD,UAAI,IAAI,KAAK,CAAC,GAAG,WAAW,MAAM;AAChC,eAAO,QAAA;AACP,eAAO;AAAA,MACT;AACA,WAAK,YAAY,IAAI,QAAQ,KAAK,MAAM;AACxC,aAAO;AAAA,IACT,SAAS,KAAK;AACZ,aAAO,QAAA;AACP,YAAM;AAAA,IACR;AAAA,EACF;AAAA,EAEA,MAAM,oBAAoB,SAAyC;AACjE,UAAM,SAAS,KAAK,YAAY,IAAI,QAAQ,GAAG;AAC/C,QAAI,CAAC,OAAQ;AACb,SAAK,YAAY,OAAO,QAAQ,GAAG;AACnC,QAAI;AACF,YAAM,OAAO,MAAM,iCAAiC,CAAC,YAAY,QAAQ,GAAG,CAAC,CAAC;AAAA,IAChF,UAAA;AACE,aAAO,QAAA;AAAA,IACT;AAAA,EACF;AAAA;AAAA,EAGA,MAAM,iBAAoB,SAAoE;AAC5F,WAAO,KAAK,YAAY,OAAO,YAAY;AACzC,YAAM,SAA4B;AAAA,QAChC,eAAe;AAAA,QACf,QAAQ,KAAK;AAAA,QACb,SAAS,OAAO,KAAK,WAAW;AAC9B,gBAAM,MAAM,MAAM,KAAK,QAAQ,KAAK,QAAQ,OAAO;AACnD,iBAAO,EAAE,MAAM,IAAI,MAAM,UAAU,IAAI,SAAA;AAAA,QACzC;AAAA,MAAA;AAEF,aAAO,QAAQ,GAAG,MAAM;AAAA,IAC1B,CAAC;AAAA,EACH;AACF;AAWA,SAAS,YAAY,KAAqB;AACxC,QAAM,OAAOD,YAAAA,WAAW,MAAM,EAAE,OAAO,GAAG,EAAE,OAAA;AAC5C,SAAO,KAAK,WAAW,GAAG,kBAAkB;AAC9C;AAMA,MAAM,qBAAqB;;;"}
@@ -1 +0,0 @@
1
- {"version":3,"file":"storage.constants-B5oQjxp5.cjs","sources":["../src/jobs/job-state.enum.ts","../src/options/enums.ts","../src/drivers/driver-capabilities.ts","../src/constants/storage.constants.ts"],"sourcesContent":["/**\n * Job lifecycle states. Exported so consumers never use magic strings.\n *\n * There is no `STALLED` state: an `ACTIVE` row past its lock deadline is *derived*, and it is\n * derived in exactly one place — {@link import('./snapshot').toSnapshot} sets `JobSnapshot.stalled`.\n * A second spelling of the same idea (an exported `'STALLED'` constant nothing compared against) is\n * a state consumers could branch on and never see.\n */\nexport enum JobStatus {\n PENDING = 'PENDING',\n ACTIVE = 'ACTIVE',\n COMPLETED = 'COMPLETED',\n FAILED = 'FAILED',\n RETRY = 'RETRY',\n CANCELLED = 'CANCELLED',\n EXPIRED = 'EXPIRED',\n}\n\n/**\n * The terminal statuses retention may act on, and the default scope of a retention policy that\n * names none.\n */\nexport const FINISHED_STATUSES: readonly JobStatus[] = [\n JobStatus.COMPLETED,\n JobStatus.FAILED,\n JobStatus.CANCELLED,\n JobStatus.EXPIRED,\n];\n\n/**\n * Statuses in which a job holds a claim / occupies an \"active-ish\" slot for singleton uniqueness.\n * Every driver's singleton dedup binds this list rather than inlining the three names.\n */\nexport const ACTIVE_STATUSES: readonly JobStatus[] = [\n JobStatus.PENDING,\n JobStatus.ACTIVE,\n JobStatus.RETRY,\n];\n\n/**\n * A zeroed count per status — the shape every \"jobs by status\" answer takes.\n *\n * Defined beside the enum because it *is* the enum's shape: a new status has to appear here, and one\n * definition is what makes that automatic for the drivers' grouped counts and the read service alike\n * (they used to hold identical copies of this literal).\n */\nexport function emptyStatusCounts(): Record<JobStatus, number> {\n return {\n [JobStatus.PENDING]: 0,\n [JobStatus.ACTIVE]: 0,\n [JobStatus.COMPLETED]: 0,\n [JobStatus.FAILED]: 0,\n [JobStatus.RETRY]: 0,\n [JobStatus.CANCELLED]: 0,\n [JobStatus.EXPIRED]: 0,\n };\n}\n","/** Retry backoff strategies. */\nexport enum BackoffStrategy {\n FIXED = 'FIXED',\n EXPONENTIAL = 'EXPONENTIAL',\n}\n\n/** How a queue is paused. */\nexport enum PauseMode {\n /** Workers stop claiming/running jobs, but the queue still accepts new adds. */\n PROCESSING = 'PROCESSING',\n /** Also refuse new jobs (drain/incident control). */\n ALL = 'ALL',\n}\n\n/** Why an add was deduplicated. */\nexport enum DeduplicationReason {\n IDEMPOTENCY = 'IDEMPOTENCY',\n SINGLETON = 'SINGLETON',\n}\n\n/**\n * What a `cancelJob` actually did. Three states rather than a boolean, because \"asked to stop\" and\n * \"stopped\" are not the same claim and a caller acting on the difference (reporting it, waiting for\n * it) needs to know which it got.\n */\nexport enum CancelOutcome {\n /** The row is now `CANCELLED`; the job will never run. */\n CANCELLED = 'CANCELLED',\n /**\n * The job is running in **this** process, so its handler's `AbortSignal` was fired. Cancellation\n * is cooperative: a handler that ignores `job.signal` runs to completion and the row ends\n * `COMPLETED`, so nothing has been cancelled yet.\n */\n SIGNALLED = 'SIGNALLED',\n /**\n * The job exists but was not cancellable: it has already finished, or it is `ACTIVE` in another\n * process — which only that process can signal.\n */\n NOT_CANCELLABLE = 'NOT_CANCELLABLE',\n}\n\n/** Auto-migration behavior on init. */\nexport enum MigrationMode {\n AUTO = 'AUTO',\n MANUAL = 'MANUAL',\n VALIDATE_ONLY = 'VALIDATE_ONLY',\n}\n\n/** Database engines a driver can advertise. */\nexport enum DatabaseEngine {\n POSTGRESQL = 'POSTGRESQL',\n PGLITE = 'PGLITE',\n SQLITE = 'SQLITE',\n ORACLE = 'ORACLE',\n MYSQL = 'MYSQL',\n CUSTOM = 'CUSTOM',\n}\n\n/**\n * How much of a handler's failure is kept on the job row (`createQueue({ failureDetail })`).\n *\n * Not a boolean, because \"store the stack\" and \"store the message\" are two named policies an\n * operator chooses between, and a `storeStack: false` reads as a workaround rather than a decision.\n */\nexport enum FailureDetail {\n /** `error.stack` — the throw site and the frames around it, truncated. The default. */\n STACK = 'STACK',\n /** `Error: message` only. For a queue that fails often, where the frames are noise and bytes. */\n MESSAGE = 'MESSAGE',\n}\n","/**\n * Capability flags a driver advertises. Core branches on these, never identity — and every flag\n * here is read somewhere. A flag nothing branches on is a promise nothing keeps, so it does not\n * exist.\n */\nexport enum DriverCapability {\n /** The engine can push notifications, so a producer wakes a consumer without waiting on a poll. */\n LISTEN_NOTIFY = 'LISTEN_NOTIFY',\n /** `FOR UPDATE SKIP LOCKED`, so concurrent claimers never contend on the same rows. */\n SKIP_LOCKED = 'SKIP_LOCKED',\n /** DML can return the rows it changed, so a mutate-and-read is one statement rather than two. */\n RETURNING = 'RETURNING',\n /** Statements can be grouped in a transaction (a driver without this no-ops the wrapper). */\n TRANSACTIONS = 'TRANSACTIONS',\n /** Cross-connection advisory locks, used to elect a single migrator. */\n ADVISORY_LOCK = 'ADVISORY_LOCK',\n}\n\n/** A frozen set of capability → boolean. */\nexport type DriverCapabilitySet = Readonly<Record<DriverCapability, boolean>>;\n\n/** Build a full capability set from a partial (missing flags default to false). */\nexport function capabilities(\n partial: Partial<Record<DriverCapability, boolean>>,\n): DriverCapabilitySet {\n const full = {} as Record<DriverCapability, boolean>;\n for (const cap of Object.values(DriverCapability)) {\n full[cap] = partial[cap] ?? false;\n }\n return Object.freeze(full);\n}\n","/** Storage-layout defaults every driver shares. */\n\n/** Prefix on every physical table name. `<driver>Options.tablePrefix`. */\nexport const DEFAULT_TABLE_PREFIX = 'pq_';\n\n/** Logical prefix for pub/sub channels when several PortQueues share one database. */\nexport const DEFAULT_NAMESPACE = 'portqueue';\n\n/** Identifier length ceiling a driver assumes when it declares none (PostgreSQL' limit). */\nexport const DEFAULT_MAX_IDENTIFIER_LEN = 63;\n\n/**\n * The most ids one batch call may carry — `addJobs`, `requeueJobs`, `cancelJobs`, `removeJobs`,\n * `deleteSchedules`, and the dashboard's bulk actions.\n *\n * Oracle caps the expressions in an `IN` list at 1000 and is the lowest of the engines here, so its\n * limit is everyone's: a 1001-id batch that works on PostgreSQL and raises ORA-01795 on Oracle is a\n * portability bug the tool refuses up front rather than one a caller discovers in production. It is\n * a cap on what a single *call* may ask for — a set that still needs several statements (an insert\n * binds ~25 values per job) is chunked by `BaseDriver.chunkForBind` underneath.\n */\nexport const MAX_BATCH_IDS = 1000;\n\n/**\n * How far the multi-instance claim path scans for affinity-matching candidates in one pass, as a\n * multiple of the requested batch (clamped by {@link AFFINITY_PAGE_MIN_HEADROOM} and\n * {@link AFFINITY_PAGE_MAX}). Affinity is a regex, which portable SQL cannot evaluate, so\n * candidates are paged and filtered in the tool.\n */\nexport const AFFINITY_PAGE_FACTOR = 5;\n/** Extra rows added to a small batch so a single page is worth the round trip. */\nexport const AFFINITY_PAGE_MIN_HEADROOM = 20;\n/** The largest affinity candidate page. */\nexport const AFFINITY_PAGE_MAX = 500;\n/** Pages one claim will scan before giving up and letting the next tick resume from the top. */\nexport const AFFINITY_MAX_PAGES = 20;\n/** The floor on total rows scanned, so a tiny batch still makes progress through a backlog. */\nexport const AFFINITY_MIN_SCAN = 2000;\n"],"names":["JobStatus","BackoffStrategy","PauseMode","DeduplicationReason","CancelOutcome","MigrationMode","DatabaseEngine","FailureDetail","DriverCapability"],"mappings":";AAQO,IAAK,8BAAAA,eAAL;AACLA,aAAA,SAAA,IAAU;AACVA,aAAA,QAAA,IAAS;AACTA,aAAA,WAAA,IAAY;AACZA,aAAA,QAAA,IAAS;AACTA,aAAA,OAAA,IAAQ;AACRA,aAAA,WAAA,IAAY;AACZA,aAAA,SAAA,IAAU;AAPA,SAAAA;AAAA,GAAA,aAAA,CAAA,CAAA;AAcL,MAAM,oBAA0C;AAAA,EACrD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AACF;AAMO,MAAM,kBAAwC;AAAA,EACnD;AAAA,EACA;AAAA,EACA;AAAA;AACF;AASO,SAAS,oBAA+C;AAC7D,SAAO;AAAA,IACL;AAAA,MAAC;AAAA;AAAA,OAAoB;AAAA,IACrB;AAAA,MAAC;AAAA;AAAA,OAAmB;AAAA,IACpB;AAAA,MAAC;AAAA;AAAA,OAAsB;AAAA,IACvB;AAAA,MAAC;AAAA;AAAA,OAAmB;AAAA,IACpB;AAAA,MAAC;AAAA;AAAA,OAAkB;AAAA,IACnB;AAAA,MAAC;AAAA;AAAA,OAAsB;AAAA,IACvB;AAAA,MAAC;AAAA;AAAA,OAAoB;AAAA,EAAA;AAEzB;ACvDO,IAAK,oCAAAC,qBAAL;AACLA,mBAAA,OAAA,IAAQ;AACRA,mBAAA,aAAA,IAAc;AAFJ,SAAAA;AAAA,GAAA,mBAAA,CAAA,CAAA;AAML,IAAK,8BAAAC,eAAL;AAELA,aAAA,YAAA,IAAa;AAEbA,aAAA,KAAA,IAAM;AAJI,SAAAA;AAAA,GAAA,aAAA,CAAA,CAAA;AAQL,IAAK,wCAAAC,yBAAL;AACLA,uBAAA,aAAA,IAAc;AACdA,uBAAA,WAAA,IAAY;AAFF,SAAAA;AAAA,GAAA,uBAAA,CAAA,CAAA;AAUL,IAAK,kCAAAC,mBAAL;AAELA,iBAAA,WAAA,IAAY;AAMZA,iBAAA,WAAA,IAAY;AAKZA,iBAAA,iBAAA,IAAkB;AAbR,SAAAA;AAAA,GAAA,iBAAA,CAAA,CAAA;AAiBL,IAAK,kCAAAC,mBAAL;AACLA,iBAAA,MAAA,IAAO;AACPA,iBAAA,QAAA,IAAS;AACTA,iBAAA,eAAA,IAAgB;AAHN,SAAAA;AAAA,GAAA,iBAAA,CAAA,CAAA;AAOL,IAAK,mCAAAC,oBAAL;AACLA,kBAAA,YAAA,IAAa;AACbA,kBAAA,QAAA,IAAS;AACTA,kBAAA,QAAA,IAAS;AACTA,kBAAA,QAAA,IAAS;AACTA,kBAAA,OAAA,IAAQ;AACRA,kBAAA,QAAA,IAAS;AANC,SAAAA;AAAA,GAAA,kBAAA,CAAA,CAAA;AAeL,IAAK,kCAAAC,mBAAL;AAELA,iBAAA,OAAA,IAAQ;AAERA,iBAAA,SAAA,IAAU;AAJA,SAAAA;AAAA,GAAA,iBAAA,CAAA,CAAA;AC3DL,IAAK,qCAAAC,sBAAL;AAELA,oBAAA,eAAA,IAAgB;AAEhBA,oBAAA,aAAA,IAAc;AAEdA,oBAAA,WAAA,IAAY;AAEZA,oBAAA,cAAA,IAAe;AAEfA,oBAAA,eAAA,IAAgB;AAVN,SAAAA;AAAA,GAAA,oBAAA,CAAA,CAAA;AAiBL,SAAS,aACd,SACqB;AACrB,QAAM,OAAO,CAAA;AACb,aAAW,OAAO,OAAO,OAAO,gBAAgB,GAAG;AACjD,SAAK,GAAG,IAAI,QAAQ,GAAG,KAAK;AAAA,EAC9B;AACA,SAAO,OAAO,OAAO,IAAI;AAC3B;AC3BO,MAAM,uBAAuB;AAG7B,MAAM,oBAAoB;AAG1B,MAAM,6BAA6B;AAYnC,MAAM,gBAAgB;AAQtB,MAAM,uBAAuB;AAE7B,MAAM,6BAA6B;AAEnC,MAAM,oBAAoB;AAE1B,MAAM,qBAAqB;AAE3B,MAAM,oBAAoB;;;;;;;;;;;;;;;;;;;;;;;"}