@portqueue/core 1.2.0 → 1.2.2

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 (53) hide show
  1. package/dist/conformance/index.cjs +82 -2
  2. package/dist/conformance/index.cjs.map +1 -1
  3. package/dist/conformance/index.mjs +83 -3
  4. package/dist/conformance/index.mjs.map +1 -1
  5. package/dist/consumer/completion-batcher.d.ts +29 -0
  6. package/dist/consumer/completion.service.d.ts +5 -3
  7. package/dist/consumer/execution.service.d.ts +7 -2
  8. package/dist/consumer/worker.d.ts +16 -0
  9. package/dist/drivers/driver.interface.d.ts +26 -2
  10. package/dist/drivers/mysql/index.cjs +50 -3
  11. package/dist/drivers/mysql/index.cjs.map +1 -1
  12. package/dist/drivers/mysql/index.mjs +50 -3
  13. package/dist/drivers/mysql/index.mjs.map +1 -1
  14. package/dist/drivers/mysql/mysql-driver.d.ts +16 -3
  15. package/dist/drivers/oracle/index.cjs +50 -3
  16. package/dist/drivers/oracle/index.cjs.map +1 -1
  17. package/dist/drivers/oracle/index.mjs +50 -3
  18. package/dist/drivers/oracle/index.mjs.map +1 -1
  19. package/dist/drivers/oracle/oracle-driver.d.ts +14 -3
  20. package/dist/drivers/pglite/index.cjs +6 -3
  21. package/dist/drivers/pglite/index.cjs.map +1 -1
  22. package/dist/drivers/pglite/index.mjs +6 -3
  23. package/dist/drivers/pglite/index.mjs.map +1 -1
  24. package/dist/drivers/pglite/migrations.d.ts +2 -3
  25. package/dist/drivers/postgresql/index.cjs +1 -1
  26. package/dist/drivers/postgresql/index.mjs +1 -1
  27. package/dist/drivers/postgresql/migrations.d.ts +21 -0
  28. package/dist/drivers/postgresql/postgresql-driver.d.ts +28 -3
  29. package/dist/drivers/shared/base-driver.d.ts +28 -2
  30. package/dist/drivers/sqlite/index.cjs +36 -4
  31. package/dist/drivers/sqlite/index.cjs.map +1 -1
  32. package/dist/drivers/sqlite/index.mjs +36 -4
  33. package/dist/drivers/sqlite/index.mjs.map +1 -1
  34. package/dist/drivers/sqlite/sqlite-driver.d.ts +14 -3
  35. package/dist/index.cjs +107 -10
  36. package/dist/index.cjs.map +1 -1
  37. package/dist/index.d.ts +2 -2
  38. package/dist/index.mjs +108 -11
  39. package/dist/index.mjs.map +1 -1
  40. package/dist/jobs/job-record.d.ts +8 -0
  41. package/dist/{migration-Dx8eUthW.cjs → migration-CX7j4wVB.cjs} +59 -1
  42. package/dist/migration-CX7j4wVB.cjs.map +1 -0
  43. package/dist/{migration-D0IRP2oq.js → migration-VkNQT3a_.js} +60 -2
  44. package/dist/migration-VkNQT3a_.js.map +1 -0
  45. package/dist/{postgresql-driver-CPHv5SUT.js → postgresql-driver-DQRzg2NA.js} +179 -57
  46. package/dist/postgresql-driver-DQRzg2NA.js.map +1 -0
  47. package/dist/{postgresql-driver-DRT68TKb.cjs → postgresql-driver-xfqy9mi8.cjs} +179 -57
  48. package/dist/postgresql-driver-xfqy9mi8.cjs.map +1 -0
  49. package/package.json +1 -1
  50. package/dist/migration-D0IRP2oq.js.map +0 -1
  51. package/dist/migration-Dx8eUthW.cjs.map +0 -1
  52. package/dist/postgresql-driver-CPHv5SUT.js.map +0 -1
  53. package/dist/postgresql-driver-DRT68TKb.cjs.map +0 -1
@@ -1,6 +1,6 @@
1
1
  import { createHash } from "node:crypto";
2
2
  import { a as DatabaseEngine, c as capabilities, D as DriverCapability, b as DeduplicationReason, A as ACTIVE_STATUSES, J as JobStatus, F as FINISHED_STATUSES } from "./storage.constants-DYEQUmc8.js";
3
- import { T as TableName, B as BaseDriver, t as toMigrationSteps, M as MissingPeerDependencyError, D as DriverConnectionError, a as MigrationColumn, b as DriverQueryError, J as JOB_COLUMNS, c as JobColumn, Q as QueueColumn, S as ScheduleColumn, d as SCHEDULE_INSERT_COLUMNS, I as InstanceColumn, r as retentionStatusBit, e as MS_PER_SECOND } from "./migration-D0IRP2oq.js";
3
+ import { T as TableName, B as BaseDriver, t as toMigrationSteps, M as MissingPeerDependencyError, D as DriverConnectionError, a as MigrationColumn, b as DriverQueryError, J as JOB_COLUMNS, Q as QueueColumn, c as JobColumn, S as ScheduleColumn, d as SCHEDULE_INSERT_COLUMNS, C as CLAIM_COLUMNS, I as InstanceColumn, r as retentionStatusBit, e as MS_PER_SECOND } from "./migration-VkNQT3a_.js";
4
4
  function v1(names) {
5
5
  const t = names.name;
6
6
  const idx = names.derived;
@@ -114,7 +114,59 @@ function v1(names) {
114
114
  );
115
115
  return statements;
116
116
  }
117
- const POSTGRESQL_MIGRATIONS = [{ version: 1, statements: v1 }];
117
+ function v2(names) {
118
+ const t = names.name;
119
+ const idx = names.derived;
120
+ const drop = (suffix) => `DROP INDEX IF EXISTS ${names.schema ? `${names.schema}.` : ""}${idx(TableName.JOB, suffix)}`;
121
+ return [
122
+ drop("claim_idx"),
123
+ `CREATE INDEX IF NOT EXISTS ${idx(TableName.JOB, "claim_idx")} ON ${t(TableName.JOB)} (queue_name, priority DESC, start_after ASC) WHERE status IN ('PENDING', 'RETRY')`,
124
+ drop("stalled_idx"),
125
+ `CREATE INDEX IF NOT EXISTS ${idx(TableName.JOB, "stalled_idx")} ON ${t(TableName.JOB)} (locked_until) WHERE status = 'ACTIVE'`,
126
+ drop("expiry_idx"),
127
+ `CREATE INDEX IF NOT EXISTS ${idx(TableName.JOB, "expiry_idx")} ON ${t(TableName.JOB)} (status, expire_at) WHERE expire_at IS NOT NULL`
128
+ ];
129
+ }
130
+ const POSTGRESQL_MIGRATIONS = [
131
+ { version: 1, statements: v1 },
132
+ { version: 2, statements: v2 }
133
+ ];
134
+ const JOB_COLUMN_TYPES = {
135
+ [JobColumn.ID]: "text",
136
+ [JobColumn.QUEUE_NAME]: "text",
137
+ [JobColumn.STATUS]: "text",
138
+ [JobColumn.PRIORITY]: "integer",
139
+ [JobColumn.DATA]: "text",
140
+ [JobColumn.RETURN_VALUE]: "text",
141
+ [JobColumn.CREATED_AT]: "bigint",
142
+ [JobColumn.UPDATED_AT]: "bigint",
143
+ [JobColumn.START_AFTER]: "bigint",
144
+ [JobColumn.EXPIRE_AT]: "bigint",
145
+ [JobColumn.STARTED_AT]: "bigint",
146
+ [JobColumn.COMPLETED_AT]: "bigint",
147
+ [JobColumn.FAILED_AT]: "bigint",
148
+ [JobColumn.RETRIED_AT]: "bigint",
149
+ [JobColumn.STALLED_AT]: "bigint",
150
+ [JobColumn.CANCELLED_AT]: "bigint",
151
+ [JobColumn.EXPIRED_AT]: "bigint",
152
+ [JobColumn.LOCKED_UNTIL]: "bigint",
153
+ [JobColumn.LOCK_TOKEN]: "text",
154
+ [JobColumn.PREFERRED_INSTANCE_KEY_PATTERN]: "text",
155
+ [JobColumn.PROCESSED_ON_INSTANCE_KEY]: "text",
156
+ [JobColumn.RETRY_ATTEMPT]: "integer",
157
+ [JobColumn.RETRY_MAX_ATTEMPTS]: "integer",
158
+ [JobColumn.RETRY_DELAY_SECONDS]: "bigint",
159
+ [JobColumn.RETRY_BACKOFF]: "text",
160
+ [JobColumn.RETRY_BACKOFF_FACTOR]: "real",
161
+ [JobColumn.RETRY_MAX_DELAY_SECONDS]: "bigint",
162
+ [JobColumn.RETRY_JITTER]: "smallint",
163
+ [JobColumn.FAILURE_MESSAGE]: "text",
164
+ [JobColumn.RETENTION_TTL_SECONDS]: "bigint",
165
+ [JobColumn.RETENTION_STATUSES]: "integer",
166
+ [JobColumn.IDEMPOTENCY_KEY]: "text",
167
+ [JobColumn.SCHEDULE_ID]: "text",
168
+ [JobColumn.SINGLETON_KEY]: "text"
169
+ };
118
170
  const PG_UNDEFINED_TABLE = "42P01";
119
171
  const PG_UNDEFINED_SCHEMA = "3F000";
120
172
  class PostgresqlDriver extends BaseDriver {
@@ -285,6 +337,18 @@ class PostgresqlDriver extends BaseDriver {
285
337
  async insertJobs(options) {
286
338
  const { jobs, tx } = options;
287
339
  if (!jobs.length) return [];
340
+ const keyed = jobs.some((job) => job.idempotencyKey != null || job.singletonKey != null);
341
+ if (!keyed && this.chunkIds(jobs).length === 1) {
342
+ const results = new Array(jobs.length);
343
+ const fresh = jobs.map((job, index) => ({ index, ...this.jobInsertValues(job) }));
344
+ await this.insertFresh(
345
+ (sql, params) => this.runMaybeTx(sql, params, tx),
346
+ jobs,
347
+ fresh,
348
+ results
349
+ );
350
+ return results;
351
+ }
288
352
  return this.inTx(tx, async (run) => {
289
353
  await this.lockQueuesForDedup(run, jobs);
290
354
  const deduped = await this.findDeduplicated(jobs, run);
@@ -299,41 +363,62 @@ class PostgresqlDriver extends BaseDriver {
299
363
  const { id, values } = this.jobInsertValues(job);
300
364
  fresh.push({ index, id, values });
301
365
  }
302
- for (const chunk of this.chunkForBind(fresh, JOB_COLUMNS.length)) {
303
- if (!chunk.length) continue;
304
- const params = [];
305
- const tuples = chunk.map(({ values }) => {
306
- const placeholders = this.phList(values.length, params.length);
307
- params.push(...values);
308
- return `(${placeholders})`;
309
- });
310
- try {
311
- const inserted = await run(
312
- `INSERT INTO ${this.t(TableName.JOB)} (${JOB_COLUMNS.join(", ")}) VALUES ${tuples.join(", ")} RETURNING ${JobColumn.ID}, ${JobColumn.STATUS}, ${JobColumn.START_AFTER}`,
313
- params
314
- );
315
- const byId = new Map(inserted.rows.map((row) => [String(row[JobColumn.ID]), row]));
316
- for (const { index, id } of chunk) {
317
- const row = byId.get(id);
318
- if (!row) throw new DriverQueryError(`Insert did not return job '${id}'.`);
319
- results[index] = {
320
- id,
321
- status: row[JobColumn.STATUS],
322
- startAfter: Number(row[JobColumn.START_AFTER]),
323
- deduplicated: false
324
- };
325
- }
326
- } catch (err) {
327
- if (err instanceof DriverQueryError) throw err;
328
- throw new DriverQueryError(
329
- `Failed to insert ${chunk.length} job(s) on queue '${jobs[chunk[0].index].queueName}'.`,
330
- err
331
- );
332
- }
333
- }
366
+ await this.insertFresh(run, jobs, fresh, results);
334
367
  return results;
335
368
  });
336
369
  }
370
+ /**
371
+ * Insert rows that passed dedup, filling `results` at each row's input index. The whole chunk
372
+ * travels as **one** JSON parameter that `json_to_recordset` unpacks into rows, rather than a
373
+ * multi-row VALUES binding every column of every row: 34 columns × 1000 rows was 34 000 bound
374
+ * parameters, split across statements by the parameter limit, and parsing that many binds cost
375
+ * more than the insert itself — one JSON value inserts about twice as fast. No RETURNING either:
376
+ * the id, status and start time of every row are the values just sent, so the row count is the
377
+ * only thing worth checking.
378
+ */
379
+ async insertFresh(run, jobs, fresh, results) {
380
+ const cols = JOB_COLUMNS.join(", ");
381
+ const recordset = JOB_COLUMNS.map((col) => `${col} ${JOB_COLUMN_TYPES[col]}`).join(", ");
382
+ for (const chunk of this.chunkIds(fresh)) {
383
+ if (!chunk.length) continue;
384
+ const payload = JSON.stringify(
385
+ chunk.map(({ values }) => {
386
+ const row = {};
387
+ for (let i = 0; i < JOB_COLUMNS.length; i += 1) {
388
+ const value = values[i];
389
+ if (value != null) row[JOB_COLUMNS[i]] = value;
390
+ }
391
+ return row;
392
+ })
393
+ );
394
+ let inserted;
395
+ try {
396
+ inserted = await run(
397
+ `INSERT INTO ${this.t(TableName.JOB)} (${cols}) SELECT ${cols} FROM json_to_recordset(${this.ph(0)}::json) AS x(${recordset})`,
398
+ [payload]
399
+ );
400
+ } catch (err) {
401
+ throw new DriverQueryError(
402
+ `Failed to insert ${chunk.length} job(s) on queue '${jobs[chunk[0].index].queueName}'.`,
403
+ err
404
+ );
405
+ }
406
+ if (inserted.rowCount !== chunk.length) {
407
+ throw new DriverQueryError(
408
+ `Inserted ${inserted.rowCount} of ${chunk.length} job(s) on queue '${jobs[chunk[0].index].queueName}'.`
409
+ );
410
+ }
411
+ for (const { index, id } of chunk) {
412
+ const job = jobs[index];
413
+ results[index] = {
414
+ id,
415
+ status: job.status,
416
+ startAfter: job.startAfter,
417
+ deduplicated: false
418
+ };
419
+ }
420
+ }
421
+ }
337
422
  /**
338
423
  * Serialize the dedup-lookup-then-insert pair against another producer's, per queue.
339
424
  *
@@ -485,28 +570,25 @@ class PostgresqlDriver extends BaseDriver {
485
570
  const { queueName, limit, lockDurationSeconds, now, instanceKey } = options;
486
571
  const lockedUntil = this.lockDeadline(now, lockDurationSeconds);
487
572
  const lockToken = this.newId();
488
- const cols = JOB_COLUMNS.join(", ");
573
+ const cols = CLAIM_COLUMNS.join(", ");
489
574
  if (!instanceKey) {
490
- return this.transaction(async (session) => {
491
- const res = await this.execute(
492
- `UPDATE ${this.t(TableName.JOB)} SET ${JobColumn.STATUS} = ${this.ph(0)}, ${JobColumn.STARTED_AT} = ${this.ph(1)}, ${JobColumn.LOCKED_UNTIL} = ${this.ph(2)}, ${JobColumn.LOCK_TOKEN} = ${this.ph(3)}, ${JobColumn.UPDATED_AT} = ${this.ph(4)} WHERE ${JobColumn.ID} IN (SELECT ${JobColumn.ID} FROM ${this.t(TableName.JOB)} WHERE ${JobColumn.QUEUE_NAME} = ${this.ph(5)} AND ${JobColumn.STATUS} IN (${this.ph(6)}, ${this.ph(7)}) AND ${JobColumn.START_AFTER} <= ${this.ph(8)} AND (${JobColumn.EXPIRE_AT} IS NULL OR ${JobColumn.EXPIRE_AT} > ${this.ph(9)}) ORDER BY ${JobColumn.PRIORITY} DESC, ${JobColumn.START_AFTER} ASC LIMIT ${this.ph(10)} FOR UPDATE SKIP LOCKED) RETURNING ${cols}`,
493
- [
494
- JobStatus.ACTIVE,
495
- now,
496
- lockedUntil,
497
- lockToken,
498
- now,
499
- queueName,
500
- JobStatus.PENDING,
501
- JobStatus.RETRY,
502
- now,
503
- now,
504
- limit
505
- ],
506
- session
507
- );
508
- return this.sortClaimed(res.rows.map((r) => this.mapJob(r)));
509
- });
575
+ const res = await this.execute(
576
+ `UPDATE ${this.t(TableName.JOB)} SET ${JobColumn.STATUS} = ${this.ph(0)}, ${JobColumn.STARTED_AT} = ${this.ph(1)}, ${JobColumn.LOCKED_UNTIL} = ${this.ph(2)}, ${JobColumn.LOCK_TOKEN} = ${this.ph(3)}, ${JobColumn.UPDATED_AT} = ${this.ph(4)} WHERE ${JobColumn.ID} IN (SELECT ${JobColumn.ID} FROM ${this.t(TableName.JOB)} WHERE ${JobColumn.QUEUE_NAME} = ${this.ph(5)} AND ${JobColumn.STATUS} IN (${this.ph(6)}, ${this.ph(7)}) AND ${JobColumn.START_AFTER} <= ${this.ph(8)} AND (${JobColumn.EXPIRE_AT} IS NULL OR ${JobColumn.EXPIRE_AT} > ${this.ph(9)}) ORDER BY ${JobColumn.PRIORITY} DESC, ${JobColumn.START_AFTER} ASC LIMIT ${this.ph(10)} FOR UPDATE SKIP LOCKED) RETURNING ${cols}`,
577
+ [
578
+ JobStatus.ACTIVE,
579
+ now,
580
+ lockedUntil,
581
+ lockToken,
582
+ now,
583
+ queueName,
584
+ JobStatus.PENDING,
585
+ JobStatus.RETRY,
586
+ now,
587
+ now,
588
+ limit
589
+ ]
590
+ );
591
+ return this.sortClaimed(res.rows.map((r) => this.mapClaimedJob(r, { queueName, lockToken })));
510
592
  }
511
593
  const { pageSize, maxScan } = this.affinityPlan(limit);
512
594
  return this.transaction(async (session) => {
@@ -529,7 +611,7 @@ class PostgresqlDriver extends BaseDriver {
529
611
  [...head, ...idList, JobStatus.PENDING, JobStatus.RETRY],
530
612
  session
531
613
  );
532
- return this.sortClaimed(upd.rows.map((r) => this.mapJob(r)));
614
+ return this.sortClaimed(upd.rows.map((r) => this.mapClaimedJob(r, { queueName, lockToken })));
533
615
  });
534
616
  }
535
617
  /**
@@ -577,6 +659,45 @@ class PostgresqlDriver extends BaseDriver {
577
659
  );
578
660
  return res.rowCount > 0;
579
661
  }
662
+ /**
663
+ * One guarded `UPDATE … RETURNING id` per claim token (and per id chunk): every row in the group is
664
+ * fenced on that token and on `ACTIVE`, exactly like {@link completeJob}, and `RETURNING` names the
665
+ * rows that were settled. A lone statement per group, so no explicit transaction.
666
+ */
667
+ async completeJobs(options) {
668
+ const settled = [];
669
+ for (const group of this.groupByLockToken(options.jobs)) {
670
+ const ids = await this.overIdChunks(group.items, async (chunk) => {
671
+ const params = [JobStatus.COMPLETED, options.now, options.now];
672
+ const returnValue = this.returnValueExpression(chunk, params);
673
+ const idList = chunk.map((job) => {
674
+ params.push(job.jobId);
675
+ return this.ph(params.length - 1);
676
+ });
677
+ const res = await this.runMaybeTx(
678
+ `UPDATE ${this.t(TableName.JOB)} SET ${JobColumn.STATUS} = ${this.ph(0)}, ${JobColumn.RETURN_VALUE} = ${returnValue}, ${JobColumn.COMPLETED_AT} = ${this.ph(1)}, ${JobColumn.UPDATED_AT} = ${this.ph(2)}, ${JobColumn.LOCKED_UNTIL} = NULL, ${JobColumn.LOCK_TOKEN} = NULL WHERE ${JobColumn.ID} IN (${idList.join(", ")})${this.claimFence(params, group.lockToken)} RETURNING ${JobColumn.ID}`,
679
+ params,
680
+ options.tx
681
+ );
682
+ return res.rows.map((row) => String(row[JobColumn.ID]));
683
+ });
684
+ settled.push(...ids);
685
+ }
686
+ return settled;
687
+ }
688
+ /**
689
+ * The `return_value` a batch settle writes: `NULL` when no job in the chunk returned anything (the
690
+ * common case — a handler that returns nothing), otherwise a `CASE` on the id.
691
+ */
692
+ returnValueExpression(chunk, params) {
693
+ const values = chunk.map((job) => this.toJson(job.returnValue));
694
+ if (values.every((value) => value === null)) return "NULL";
695
+ const arms = chunk.map((job, i) => {
696
+ params.push(job.jobId, values[i]);
697
+ return `WHEN ${this.ph(params.length - 2)} THEN ${this.ph(params.length - 1)}`;
698
+ });
699
+ return `CASE ${JobColumn.ID} ${arms.join(" ")} ELSE NULL END`;
700
+ }
580
701
  async retryJob(options) {
581
702
  const params = [
582
703
  JobStatus.RETRY,
@@ -1277,6 +1398,7 @@ function advisoryKey(key) {
1277
1398
  const ADVISORY_KEY_BYTES = 6;
1278
1399
  export {
1279
1400
  PostgresqlDriver as P,
1401
+ v2 as a,
1280
1402
  v1 as v
1281
1403
  };
1282
- //# sourceMappingURL=postgresql-driver-CPHv5SUT.js.map
1404
+ //# sourceMappingURL=postgresql-driver-DQRzg2NA.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"postgresql-driver-DQRzg2NA.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\n/**\n * Version 2 — partial indexes for the three hot predicates.\n *\n * - **The claim.** v1's `claim_idx` keyed on `status`, so the claim's `status IN ('PENDING','RETRY')`\n * matched two ranges of the index and PostgreSQL had to read and sort *every* waiting row before\n * it could apply the `LIMIT` — a claim got slower with every job in the backlog (10 ms at 10 000\n * waiting rows). Moving the status test into the index predicate leaves `(queue_name, priority\n * DESC, start_after)` as the key, which is exactly the claim's `ORDER BY`, so the scan stops after\n * `LIMIT` rows (0.2 ms at the same backlog). The claim binds its statuses as parameters; an\n * unnamed statement is planned with their values, which is what lets the planner prove the\n * predicate.\n * - **The stalled sweep** only ever looks at `ACTIVE` rows, and **the expiry sweep** only at rows\n * that carry an `expire_at`, so both become partial too.\n *\n * Fewer rows in each index is also fewer index writes: every claim and settle changes `status`, which\n * PostgreSQL cannot do as a HOT update, so each status change writes an entry into every index whose\n * predicate the row satisfies. A finished row now sits in none of these three.\n *\n * Column names are literals, never the `*Column` enums: this is a frozen record of applied DDL.\n */\nexport function v2(names: MigrationNames): string[] {\n const t = names.name;\n const idx = names.derived;\n // `DROP INDEX` names the index itself, which lives in its table's schema; `CREATE INDEX` names it\n // bare (see v1).\n const drop = (suffix: string): string =>\n `DROP INDEX IF EXISTS ${names.schema ? `${names.schema}.` : ''}${idx(TableName.JOB, suffix)}`;\n return [\n drop('claim_idx'),\n `CREATE INDEX IF NOT EXISTS ${idx(TableName.JOB, 'claim_idx')} ` +\n `ON ${t(TableName.JOB)} (queue_name, priority DESC, start_after ASC) ` +\n `WHERE status IN ('PENDING', 'RETRY')`,\n drop('stalled_idx'),\n `CREATE INDEX IF NOT EXISTS ${idx(TableName.JOB, 'stalled_idx')} ` +\n `ON ${t(TableName.JOB)} (locked_until) WHERE status = 'ACTIVE'`,\n drop('expiry_idx'),\n `CREATE INDEX IF NOT EXISTS ${idx(TableName.JOB, 'expiry_idx')} ` +\n `ON ${t(TableName.JOB)} (status, expire_at) WHERE expire_at IS NOT NULL`,\n ];\n}\n\nexport const POSTGRESQL_MIGRATIONS: FlavourMigration[] = [\n { version: 1, statements: v1 },\n { version: 2, statements: v2 },\n];\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 CLAIM_COLUMNS,\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 CompletedJobInput,\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 ClaimedJob,\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\n/**\n * The PostgreSQL type of every `job` column, for unpacking a JSON batch with `json_to_recordset`\n * (see `insertJobs`). It mirrors the table's own DDL; a column added to the schema must be added\n * here too, which the `Record<JobColumn, …>` type enforces.\n */\nconst JOB_COLUMN_TYPES: Record<JobColumn, string> = {\n [JobColumn.ID]: 'text',\n [JobColumn.QUEUE_NAME]: 'text',\n [JobColumn.STATUS]: 'text',\n [JobColumn.PRIORITY]: 'integer',\n [JobColumn.DATA]: 'text',\n [JobColumn.RETURN_VALUE]: 'text',\n [JobColumn.CREATED_AT]: 'bigint',\n [JobColumn.UPDATED_AT]: 'bigint',\n [JobColumn.START_AFTER]: 'bigint',\n [JobColumn.EXPIRE_AT]: 'bigint',\n [JobColumn.STARTED_AT]: 'bigint',\n [JobColumn.COMPLETED_AT]: 'bigint',\n [JobColumn.FAILED_AT]: 'bigint',\n [JobColumn.RETRIED_AT]: 'bigint',\n [JobColumn.STALLED_AT]: 'bigint',\n [JobColumn.CANCELLED_AT]: 'bigint',\n [JobColumn.EXPIRED_AT]: 'bigint',\n [JobColumn.LOCKED_UNTIL]: 'bigint',\n [JobColumn.LOCK_TOKEN]: 'text',\n [JobColumn.PREFERRED_INSTANCE_KEY_PATTERN]: 'text',\n [JobColumn.PROCESSED_ON_INSTANCE_KEY]: 'text',\n [JobColumn.RETRY_ATTEMPT]: 'integer',\n [JobColumn.RETRY_MAX_ATTEMPTS]: 'integer',\n [JobColumn.RETRY_DELAY_SECONDS]: 'bigint',\n [JobColumn.RETRY_BACKOFF]: 'text',\n [JobColumn.RETRY_BACKOFF_FACTOR]: 'real',\n [JobColumn.RETRY_MAX_DELAY_SECONDS]: 'bigint',\n [JobColumn.RETRY_JITTER]: 'smallint',\n [JobColumn.FAILURE_MESSAGE]: 'text',\n [JobColumn.RETENTION_TTL_SECONDS]: 'bigint',\n [JobColumn.RETENTION_STATUSES]: 'integer',\n [JobColumn.IDEMPOTENCY_KEY]: 'text',\n [JobColumn.SCHEDULE_ID]: 'text',\n [JobColumn.SINGLETON_KEY]: 'text',\n};\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\n // A batch carrying no dedup key reads nothing before it writes, and one that fits a single chunk\n // is a single INSERT — a lone statement, atomic on its own, so it skips the BEGIN/COMMIT that\n // were two extra round trips on every add.\n const keyed = jobs.some((job) => job.idempotencyKey != null || job.singletonKey != null);\n if (!keyed && this.chunkIds(jobs).length === 1) {\n const results = new Array<InsertedJobRow | undefined>(jobs.length);\n const fresh = jobs.map((job, index) => ({ index, ...this.jobInsertValues(job) }));\n await this.insertFresh(\n (sql, params) => this.runMaybeTx(sql, params, tx),\n jobs,\n fresh,\n results,\n );\n return results as InsertedJobRow[];\n }\n\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 await this.insertFresh(run, jobs, fresh, results);\n return results as InsertedJobRow[];\n });\n }\n\n /**\n * Insert rows that passed dedup, filling `results` at each row's input index. The whole chunk\n * travels as **one** JSON parameter that `json_to_recordset` unpacks into rows, rather than a\n * multi-row VALUES binding every column of every row: 34 columns × 1000 rows was 34 000 bound\n * parameters, split across statements by the parameter limit, and parsing that many binds cost\n * more than the insert itself — one JSON value inserts about twice as fast. No RETURNING either:\n * the id, status and start time of every row are the values just sent, so the row count is the\n * only thing worth checking.\n */\n private async insertFresh(\n run: (sql: string, params: readonly unknown[]) => Promise<RawResult>,\n jobs: NewJobRecord[],\n fresh: Array<{ index: number; id: string; values: unknown[] }>,\n results: Array<InsertedJobRow | undefined>,\n ): Promise<void> {\n const cols = JOB_COLUMNS.join(', ');\n const recordset = JOB_COLUMNS.map((col) => `${col} ${JOB_COLUMN_TYPES[col]}`).join(', ');\n for (const chunk of this.chunkIds(fresh)) {\n if (!chunk.length) continue;\n // A key left out reads as NULL in `json_to_recordset`, and most columns of a new job are NULL,\n // so only set values are sent: a much smaller payload to build, transfer and parse.\n const payload = JSON.stringify(\n chunk.map(({ values }) => {\n const row: Record<string, unknown> = {};\n for (let i = 0; i < JOB_COLUMNS.length; i += 1) {\n const value = values[i];\n if (value != null) row[JOB_COLUMNS[i]!] = value;\n }\n return row;\n }),\n );\n let inserted: RawResult;\n try {\n inserted = await run(\n `INSERT INTO ${this.t(TableName.JOB)} (${cols}) ` +\n `SELECT ${cols} FROM json_to_recordset(${this.ph(0)}::json) AS x(${recordset})`,\n [payload],\n );\n } catch (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 if (inserted.rowCount !== chunk.length) {\n throw new DriverQueryError(\n `Inserted ${inserted.rowCount} of ${chunk.length} job(s) on queue '${jobs[chunk[0]!.index]!.queueName}'.`,\n );\n }\n for (const { index, id } of chunk) {\n const job = jobs[index]!;\n results[index] = {\n id,\n status: job.status,\n startAfter: job.startAfter,\n deduplicated: false,\n };\n }\n }\n }\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 // Chunked like every other key list; a batch rarely spans more than a handful of queues, so this\n // is one statement in practice, and the sorted order holds across chunks too.\n await this.overIdChunks(names, async (chunk) => {\n const res = await run(\n `SELECT ${QueueColumn.NAME} FROM ${this.t(TableName.QUEUE)} ` +\n `WHERE ${QueueColumn.NAME} IN (${this.phList(chunk.length)}) FOR UPDATE`,\n chunk,\n );\n return res.rows;\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 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 // Chunked: `addJobs` is not id-capped, so a large keyed batch can carry more keys than the\n // engine takes in one `IN (...)` (1000 on Oracle). Every chunk runs inside this transaction.\n const rows = await this.overIdChunks(idemKeys, async (chunk) => {\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(chunk.length, 1)})`,\n [queueName, ...chunk],\n );\n return res.rows;\n });\n const found = new Map(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 rows = await this.overIdChunks(singletonKeys, async (chunk) => {\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(chunk.length, 1)}) ` +\n `AND ${JobColumn.STATUS} IN (${this.phList(ACTIVE_STATUSES.length, 1 + chunk.length)})`,\n [queueName, ...chunk, ...ACTIVE_STATUSES],\n );\n return res.rows;\n });\n const found = new Map(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<ClaimedJob[]> {\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 = CLAIM_COLUMNS.join(', ');\n\n // Single-instance mode: one guarded UPDATE ... RETURNING. `SKIP LOCKED` makes the inner select\n // skip rows another claimer already holds, and the outer UPDATE is what actually takes them — so\n // no two workers can ever return the same row. It is a lone statement, so it is atomic on its own\n // and runs without an explicit BEGIN/COMMIT: on the hot path those were two extra round trips per\n // claim and bought nothing.\n if (!instanceKey) {\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 );\n return this.sortClaimed(res.rows.map((r) => this.mapClaimedJob(r, { queueName, lockToken })));\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.mapClaimedJob(r, { queueName, lockToken })));\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 /**\n * One guarded `UPDATE … RETURNING id` per claim token (and per id chunk): every row in the group is\n * fenced on that token and on `ACTIVE`, exactly like {@link completeJob}, and `RETURNING` names the\n * rows that were settled. A lone statement per group, so no explicit transaction.\n */\n async completeJobs(options: {\n jobs: CompletedJobInput[];\n now: number;\n tx?: TransactionHandle;\n }): Promise<string[]> {\n const settled: string[] = [];\n for (const group of this.groupByLockToken(options.jobs)) {\n const ids = await this.overIdChunks(group.items, async (chunk) => {\n const params: unknown[] = [JobStatus.COMPLETED, options.now, options.now];\n const returnValue = this.returnValueExpression(chunk, params);\n const idList = chunk.map((job) => {\n params.push(job.jobId);\n return this.ph(params.length - 1);\n });\n const res = await this.runMaybeTx(\n `UPDATE ${this.t(TableName.JOB)} SET ${JobColumn.STATUS} = ${this.ph(0)}, ${JobColumn.RETURN_VALUE} = ${returnValue}, ` +\n `${JobColumn.COMPLETED_AT} = ${this.ph(1)}, ${JobColumn.UPDATED_AT} = ${this.ph(2)}, ${JobColumn.LOCKED_UNTIL} = NULL, ${JobColumn.LOCK_TOKEN} = NULL ` +\n `WHERE ${JobColumn.ID} IN (${idList.join(', ')})${this.claimFence(params, group.lockToken)} ` +\n `RETURNING ${JobColumn.ID}`,\n params,\n options.tx,\n );\n return res.rows.map((row) => String(row[JobColumn.ID]));\n });\n settled.push(...ids);\n }\n return settled;\n }\n\n /**\n * The `return_value` a batch settle writes: `NULL` when no job in the chunk returned anything (the\n * common case — a handler that returns nothing), otherwise a `CASE` on the id.\n */\n private returnValueExpression(chunk: CompletedJobInput[], params: unknown[]): string {\n const values = chunk.map((job) => this.toJson(job.returnValue));\n if (values.every((value) => value === null)) return 'NULL';\n const arms = chunk.map((job, i) => {\n params.push(job.jobId, values[i]);\n return `WHEN ${this.ph(params.length - 2)} THEN ${this.ph(params.length - 1)}`;\n });\n return `CASE ${JobColumn.ID} ${arms.join(' ')} ELSE NULL END`;\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 async findJobRefs(options: { jobIds: string[]; tx?: TransactionHandle }): Promise<JobRef[]> {\n if (!options.jobIds.length) return [];\n return this.overIdChunks(options.jobIds, async (jobIds) => {\n const res = await this.runMaybeTx(\n `SELECT ${JobColumn.ID}, ${JobColumn.QUEUE_NAME} FROM ${this.t(TableName.JOB)} ` +\n `WHERE ${JobColumn.ID} IN (${this.phList(jobIds.length)})`,\n jobIds,\n options.tx,\n );\n return res.rows.map((r) => this.mapJobRef(r));\n });\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 // An exact name list, matched in SQL — the registry's refresh reads only the queues it declared\n // rather than the whole table. An empty list matches nothing rather than everything.\n if (options.names !== undefined) {\n clauses.push(\n options.names.length\n ? `${QueueColumn.NAME} IN (${this.phList(options.names.length, params.length)})`\n : '1 = 0',\n );\n params.push(...options.names);\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 { queueName, ...rest } = options;\n const [row] = await this.setQueuesPaused({ ...rest, queueNames: [queueName] });\n return row ?? null;\n }\n\n async setQueuesPaused(options: {\n queueNames: string[];\n processingPaused?: boolean;\n acceptingPaused?: boolean;\n now: number;\n tx?: TransactionHandle;\n }): Promise<QueueRow[]> {\n if (!options.queueNames.length) return [];\n // Chunked so one statement can never carry more names 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.queueNames, async (queueNames) => {\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 namesPh = this.phList(queueNames.length, params.length);\n // RETURNING the rows means the caller refreshes its cached pause flags from this one\n // statement 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} IN (${namesPh}) RETURNING *`,\n [...params, ...queueNames],\n options.tx,\n );\n return res.rows.map((r) => this.mapQueue(r));\n });\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 getInstancesByKeys(options: {\n instanceKeys: string[];\n tx?: TransactionHandle;\n }): Promise<InstanceRow[]> {\n if (!options.instanceKeys.length) return [];\n return this.overIdChunks(options.instanceKeys, async (instanceKeys) => {\n const res = await this.runMaybeTx(\n `SELECT * FROM ${this.t(TableName.INSTANCE)} WHERE ${InstanceColumn.INSTANCE_KEY} IN (${this.phList(instanceKeys.length)})`,\n instanceKeys,\n options.tx,\n );\n return res.rows.map((r) => this.mapInstance(r));\n });\n }\n\n async setInstancePaused(options: {\n instanceKey: string;\n processingPaused: boolean;\n now: number;\n }): Promise<void> {\n await this.setInstancesPaused({\n instanceKeys: [options.instanceKey],\n processingPaused: options.processingPaused,\n now: options.now,\n });\n }\n\n async setInstancesPaused(options: {\n instanceKeys: string[];\n processingPaused: boolean;\n now: number;\n tx?: TransactionHandle;\n }): Promise<string[]> {\n if (!options.instanceKeys.length) return [];\n return this.overIdChunks(options.instanceKeys, async (instanceKeys) => {\n const sets = `${InstanceColumn.PROCESSING_PAUSED} = ${this.ph(0)}, ${InstanceColumn.UPDATED_AT} = ${this.ph(1)}`;\n const params = [this.boolIn(options.processingPaused), options.now, ...instanceKeys];\n const res = await this.runMaybeTx(\n `UPDATE ${this.t(TableName.INSTANCE)} SET ${sets} ` +\n `WHERE ${InstanceColumn.INSTANCE_KEY} IN (${this.phList(instanceKeys.length, 2)}) ` +\n `RETURNING ${InstanceColumn.INSTANCE_KEY}`,\n params,\n options.tx,\n );\n return res.rows.map((r) => this.mapInstanceKey(r));\n });\n }\n\n async deleteInstance(options: { instanceKey: string; tx?: TransactionHandle }): Promise<boolean> {\n const removed = await this.deleteInstances({\n instanceKeys: [options.instanceKey],\n ...(options.tx ? { tx: options.tx } : {}),\n });\n return removed.length > 0;\n }\n\n async deleteInstances(options: {\n instanceKeys: string[];\n seenBefore?: number;\n tx?: TransactionHandle;\n }): Promise<string[]> {\n if (!options.instanceKeys.length) return [];\n return this.overIdChunks(options.instanceKeys, async (instanceKeys) => {\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 params: unknown[] = [...instanceKeys];\n let guard = '';\n if (options.seenBefore !== undefined) {\n guard = ` AND ${InstanceColumn.LAST_SEEN_AT} < ${this.ph(params.length)}`;\n params.push(options.seenBefore);\n }\n const res = await this.runMaybeTx(\n `DELETE FROM ${this.t(TableName.INSTANCE)} ` +\n `WHERE ${InstanceColumn.INSTANCE_KEY} IN (${this.phList(instanceKeys.length)})${guard} ` +\n `RETURNING ${InstanceColumn.INSTANCE_KEY}`,\n params,\n options.tx,\n );\n return res.rows.map((r) => this.mapInstanceKey(r));\n });\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, tested as a bit of the `retention_statuses` bitmask\n * (see `shared/retention-statuses.ts`).\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.\n *\n * **Keys in use:** exactly one — the `MigrationRunner`'s `[<schema>.]<tablePrefix>migrate`. Advisory\n * locks are database-wide, so the space shared is every key any PortQueue deployment (any prefix,\n * any schema) and any other application takes in that database. The chance two of `k` distinct keys\n * collide is about `k² / 2^49` — one in ~10^14 for a pair, still under one in a million at ~16,000\n * keys. A collision is not a correctness failure either: it only makes two unrelated migrations\n * serialize. Anyone adding a second key should keep that arithmetic in mind and list it here.\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;AAsBO,SAAS,GAAG,OAAiC;AAClD,QAAM,IAAI,MAAM;AAChB,QAAM,MAAM,MAAM;AAGlB,QAAM,OAAO,CAAC,WACZ,wBAAwB,MAAM,SAAS,GAAG,MAAM,MAAM,MAAM,EAAE,GAAG,IAAI,UAAU,KAAK,MAAM,CAAC;AAC7F,SAAO;AAAA,IACL,KAAK,WAAW;AAAA,IAChB,8BAA8B,IAAI,UAAU,KAAK,WAAW,CAAC,OACrD,EAAE,UAAU,GAAG,CAAC;AAAA,IAExB,KAAK,aAAa;AAAA,IAClB,8BAA8B,IAAI,UAAU,KAAK,aAAa,CAAC,OACvD,EAAE,UAAU,GAAG,CAAC;AAAA,IACxB,KAAK,YAAY;AAAA,IACjB,8BAA8B,IAAI,UAAU,KAAK,YAAY,CAAC,OACtD,EAAE,UAAU,GAAG,CAAC;AAAA,EAAA;AAE5B;AAEO,MAAM,wBAA4C;AAAA,EACvD,EAAE,SAAS,GAAG,YAAY,GAAA;AAAA,EAC1B,EAAE,SAAS,GAAG,YAAY,GAAA;AAC5B;AClJA,MAAM,mBAA8C;AAAA,EAClD,CAAC,UAAU,EAAE,GAAG;AAAA,EAChB,CAAC,UAAU,UAAU,GAAG;AAAA,EACxB,CAAC,UAAU,MAAM,GAAG;AAAA,EACpB,CAAC,UAAU,QAAQ,GAAG;AAAA,EACtB,CAAC,UAAU,IAAI,GAAG;AAAA,EAClB,CAAC,UAAU,YAAY,GAAG;AAAA,EAC1B,CAAC,UAAU,UAAU,GAAG;AAAA,EACxB,CAAC,UAAU,UAAU,GAAG;AAAA,EACxB,CAAC,UAAU,WAAW,GAAG;AAAA,EACzB,CAAC,UAAU,SAAS,GAAG;AAAA,EACvB,CAAC,UAAU,UAAU,GAAG;AAAA,EACxB,CAAC,UAAU,YAAY,GAAG;AAAA,EAC1B,CAAC,UAAU,SAAS,GAAG;AAAA,EACvB,CAAC,UAAU,UAAU,GAAG;AAAA,EACxB,CAAC,UAAU,UAAU,GAAG;AAAA,EACxB,CAAC,UAAU,YAAY,GAAG;AAAA,EAC1B,CAAC,UAAU,UAAU,GAAG;AAAA,EACxB,CAAC,UAAU,YAAY,GAAG;AAAA,EAC1B,CAAC,UAAU,UAAU,GAAG;AAAA,EACxB,CAAC,UAAU,8BAA8B,GAAG;AAAA,EAC5C,CAAC,UAAU,yBAAyB,GAAG;AAAA,EACvC,CAAC,UAAU,aAAa,GAAG;AAAA,EAC3B,CAAC,UAAU,kBAAkB,GAAG;AAAA,EAChC,CAAC,UAAU,mBAAmB,GAAG;AAAA,EACjC,CAAC,UAAU,aAAa,GAAG;AAAA,EAC3B,CAAC,UAAU,oBAAoB,GAAG;AAAA,EAClC,CAAC,UAAU,uBAAuB,GAAG;AAAA,EACrC,CAAC,UAAU,YAAY,GAAG;AAAA,EAC1B,CAAC,UAAU,eAAe,GAAG;AAAA,EAC7B,CAAC,UAAU,qBAAqB,GAAG;AAAA,EACnC,CAAC,UAAU,kBAAkB,GAAG;AAAA,EAChC,CAAC,UAAU,eAAe,GAAG;AAAA,EAC7B,CAAC,UAAU,WAAW,GAAG;AAAA,EACzB,CAAC,UAAU,aAAa,GAAG;AAC7B;AAqCA,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;AAKzB,UAAM,QAAQ,KAAK,KAAK,CAAC,QAAQ,IAAI,kBAAkB,QAAQ,IAAI,gBAAgB,IAAI;AACvF,QAAI,CAAC,SAAS,KAAK,SAAS,IAAI,EAAE,WAAW,GAAG;AAC9C,YAAM,UAAU,IAAI,MAAkC,KAAK,MAAM;AACjE,YAAM,QAAQ,KAAK,IAAI,CAAC,KAAK,WAAW,EAAE,OAAO,GAAG,KAAK,gBAAgB,GAAG,IAAI;AAChF,YAAM,KAAK;AAAA,QACT,CAAC,KAAK,WAAW,KAAK,WAAW,KAAK,QAAQ,EAAE;AAAA,QAChD;AAAA,QACA;AAAA,QACA;AAAA,MAAA;AAEF,aAAO;AAAA,IACT;AAEA,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;AAEA,YAAM,KAAK,YAAY,KAAK,MAAM,OAAO,OAAO;AAChD,aAAO;AAAA,IACT,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,MAAc,YACZ,KACA,MACA,OACA,SACe;AACf,UAAM,OAAO,YAAY,KAAK,IAAI;AAClC,UAAM,YAAY,YAAY,IAAI,CAAC,QAAQ,GAAG,GAAG,IAAI,iBAAiB,GAAG,CAAC,EAAE,EAAE,KAAK,IAAI;AACvF,eAAW,SAAS,KAAK,SAAS,KAAK,GAAG;AACxC,UAAI,CAAC,MAAM,OAAQ;AAGnB,YAAM,UAAU,KAAK;AAAA,QACnB,MAAM,IAAI,CAAC,EAAE,aAAa;AACxB,gBAAM,MAA+B,CAAA;AACrC,mBAAS,IAAI,GAAG,IAAI,YAAY,QAAQ,KAAK,GAAG;AAC9C,kBAAM,QAAQ,OAAO,CAAC;AACtB,gBAAI,SAAS,KAAM,KAAI,YAAY,CAAC,CAAE,IAAI;AAAA,UAC5C;AACA,iBAAO;AAAA,QACT,CAAC;AAAA,MAAA;AAEH,UAAI;AACJ,UAAI;AACF,mBAAW,MAAM;AAAA,UACf,eAAe,KAAK,EAAE,UAAU,GAAG,CAAC,KAAK,IAAI,YACjC,IAAI,2BAA2B,KAAK,GAAG,CAAC,CAAC,gBAAgB,SAAS;AAAA,UAC9E,CAAC,OAAO;AAAA,QAAA;AAAA,MAEZ,SAAS,KAAK;AACZ,cAAM,IAAI;AAAA,UACR,oBAAoB,MAAM,MAAM,qBAAqB,KAAK,MAAM,CAAC,EAAG,KAAK,EAAG,SAAS;AAAA,UACrF;AAAA,QAAA;AAAA,MAEJ;AACA,UAAI,SAAS,aAAa,MAAM,QAAQ;AACtC,cAAM,IAAI;AAAA,UACR,YAAY,SAAS,QAAQ,OAAO,MAAM,MAAM,qBAAqB,KAAK,MAAM,CAAC,EAAG,KAAK,EAAG,SAAS;AAAA,QAAA;AAAA,MAEzG;AACA,iBAAW,EAAE,OAAO,GAAA,KAAQ,OAAO;AACjC,cAAM,MAAM,KAAK,KAAK;AACtB,gBAAQ,KAAK,IAAI;AAAA,UACf;AAAA,UACA,QAAQ,IAAI;AAAA,UACZ,YAAY,IAAI;AAAA,UAChB,cAAc;AAAA,QAAA;AAAA,MAElB;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,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;AAGnB,UAAM,KAAK,aAAa,OAAO,OAAO,UAAU;AAC9C,YAAM,MAAM,MAAM;AAAA,QAChB,UAAU,YAAY,IAAI,SAAS,KAAK,EAAE,UAAU,KAAK,CAAC,UAC/C,YAAY,IAAI,QAAQ,KAAK,OAAO,MAAM,MAAM,CAAC;AAAA,QAC5D;AAAA,MAAA;AAEF,aAAO,IAAI;AAAA,IACb,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,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;AAGnB,cAAM,OAAO,MAAM,KAAK,aAAa,UAAU,OAAO,UAAU;AAC9D,gBAAM,MAAM,MAAM;AAAA,YAChB,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,MAAM,QAAQ,CAAC,CAAC;AAAA,YACpH,CAAC,WAAW,GAAG,KAAK;AAAA,UAAA;AAEtB,iBAAO,IAAI;AAAA,QACb,CAAC;AACD,cAAM,QAAQ,IAAI,IAAI,KAAK,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,UAAU,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC;AAChF,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,OAAO,MAAM,KAAK,aAAa,eAAe,OAAO,UAAU;AACnE,gBAAM,MAAM,MAAM;AAAA,YAChB,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,MAAM,QAAQ,CAAC,CAAC,SACzG,UAAU,MAAM,QAAQ,KAAK,OAAO,gBAAgB,QAAQ,IAAI,MAAM,MAAM,CAAC;AAAA,YACtF,CAAC,WAAW,GAAG,OAAO,GAAG,eAAe;AAAA,UAAA;AAE1C,iBAAO,IAAI;AAAA,QACb,CAAC;AACD,cAAM,QAAQ,IAAI,IAAI,KAAK,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,UAAU,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC;AAC9E,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,SAMU;AACxB,UAAM,EAAE,WAAW,OAAO,qBAAqB,KAAK,gBAAgB;AACpE,UAAM,cAAc,KAAK,aAAa,KAAK,mBAAmB;AAG9D,UAAM,YAAY,KAAK,MAAA;AACvB,UAAM,OAAO,cAAc,KAAK,IAAI;AAOpC,QAAI,CAAC,aAAa;AAChB,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,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,QACnB;AAAA,UACE,UAAU;AAAA,UACV;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA,UAAU;AAAA,UACV,UAAU;AAAA,UACV;AAAA,UACA;AAAA,UACA;AAAA,QAAA;AAAA,MACF;AAEF,aAAO,KAAK,YAAY,IAAI,KAAK,IAAI,CAAC,MAAM,KAAK,cAAc,GAAG,EAAE,WAAW,UAAA,CAAW,CAAC,CAAC;AAAA,IAC9F;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,cAAc,GAAG,EAAE,WAAW,UAAA,CAAW,CAAC,CAAC;AAAA,IAC9F,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;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,aAAa,SAIG;AACpB,UAAM,UAAoB,CAAA;AAC1B,eAAW,SAAS,KAAK,iBAAiB,QAAQ,IAAI,GAAG;AACvD,YAAM,MAAM,MAAM,KAAK,aAAa,MAAM,OAAO,OAAO,UAAU;AAChE,cAAM,SAAoB,CAAC,UAAU,WAAW,QAAQ,KAAK,QAAQ,GAAG;AACxE,cAAM,cAAc,KAAK,sBAAsB,OAAO,MAAM;AAC5D,cAAM,SAAS,MAAM,IAAI,CAAC,QAAQ;AAChC,iBAAO,KAAK,IAAI,KAAK;AACrB,iBAAO,KAAK,GAAG,OAAO,SAAS,CAAC;AAAA,QAClC,CAAC;AACD,cAAM,MAAM,MAAM,KAAK;AAAA,UACrB,UAAU,KAAK,EAAE,UAAU,GAAG,CAAC,QAAQ,UAAU,MAAM,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,UAAU,YAAY,MAAM,WAAW,KAC9G,UAAU,YAAY,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,UAAU,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,UAAU,YAAY,YAAY,UAAU,UAAU,iBACpI,UAAU,EAAE,QAAQ,OAAO,KAAK,IAAI,CAAC,IAAI,KAAK,WAAW,QAAQ,MAAM,SAAS,CAAC,cAC7E,UAAU,EAAE;AAAA,UAC3B;AAAA,UACA,QAAQ;AAAA,QAAA;AAEV,eAAO,IAAI,KAAK,IAAI,CAAC,QAAQ,OAAO,IAAI,UAAU,EAAE,CAAC,CAAC;AAAA,MACxD,CAAC;AACD,cAAQ,KAAK,GAAG,GAAG;AAAA,IACrB;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,sBAAsB,OAA4B,QAA2B;AACnF,UAAM,SAAS,MAAM,IAAI,CAAC,QAAQ,KAAK,OAAO,IAAI,WAAW,CAAC;AAC9D,QAAI,OAAO,MAAM,CAAC,UAAU,UAAU,IAAI,EAAG,QAAO;AACpD,UAAM,OAAO,MAAM,IAAI,CAAC,KAAK,MAAM;AACjC,aAAO,KAAK,IAAI,OAAO,OAAO,CAAC,CAAC;AAChC,aAAO,QAAQ,KAAK,GAAG,OAAO,SAAS,CAAC,CAAC,SAAS,KAAK,GAAG,OAAO,SAAS,CAAC,CAAC;AAAA,IAC9E,CAAC;AACD,WAAO,QAAQ,UAAU,EAAE,IAAI,KAAK,KAAK,GAAG,CAAC;AAAA,EAC/C;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,EAEA,MAAM,YAAY,SAA0E;AAC1F,QAAI,CAAC,QAAQ,OAAO,eAAe,CAAA;AACnC,WAAO,KAAK,aAAa,QAAQ,QAAQ,OAAO,WAAW;AACzD,YAAM,MAAM,MAAM,KAAK;AAAA,QACrB,UAAU,UAAU,EAAE,KAAK,UAAU,UAAU,SAAS,KAAK,EAAE,UAAU,GAAG,CAAC,UAClE,UAAU,EAAE,QAAQ,KAAK,OAAO,OAAO,MAAM,CAAC;AAAA,QACzD;AAAA,QACA,QAAQ;AAAA,MAAA;AAEV,aAAO,IAAI,KAAK,IAAI,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC;AAAA,IAC9C,CAAC;AAAA,EACH;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;AAGA,QAAI,QAAQ,UAAU,QAAW;AAC/B,cAAQ;AAAA,QACN,QAAQ,MAAM,SACV,GAAG,YAAY,IAAI,QAAQ,KAAK,OAAO,QAAQ,MAAM,QAAQ,OAAO,MAAM,CAAC,MAC3E;AAAA,MAAA;AAEN,aAAO,KAAK,GAAG,QAAQ,KAAK;AAAA,IAC9B;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,EAAE,WAAW,GAAG,KAAA,IAAS;AAC/B,UAAM,CAAC,GAAG,IAAI,MAAM,KAAK,gBAAgB,EAAE,GAAG,MAAM,YAAY,CAAC,SAAS,GAAG;AAC7E,WAAO,OAAO;AAAA,EAChB;AAAA,EAEA,MAAM,gBAAgB,SAME;AACtB,QAAI,CAAC,QAAQ,WAAW,eAAe,CAAA;AAGvC,WAAO,KAAK,aAAa,QAAQ,YAAY,OAAO,eAAe;AACjE,YAAM,OAAiB,CAAA;AACvB,YAAM,SAAoB,CAAA;AAC1B,UAAI,QAAQ,qBAAqB,QAAW;AAC1C,aAAK,KAAK,GAAG,YAAY,iBAAiB,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC,EAAE;AACxE,eAAO,KAAK,KAAK,OAAO,QAAQ,gBAAgB,CAAC;AAAA,MACnD;AACA,UAAI,QAAQ,oBAAoB,QAAW;AACzC,aAAK,KAAK,GAAG,YAAY,gBAAgB,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC,EAAE;AACvE,eAAO,KAAK,KAAK,OAAO,QAAQ,eAAe,CAAC;AAAA,MAClD;AACA,WAAK,KAAK,GAAG,YAAY,UAAU,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC,EAAE;AACjE,aAAO,KAAK,QAAQ,GAAG;AACvB,YAAM,UAAU,KAAK,OAAO,WAAW,QAAQ,OAAO,MAAM;AAG5D,YAAM,MAAM,MAAM,KAAK;AAAA,QACrB,UAAU,KAAK,EAAE,UAAU,KAAK,CAAC,QAAQ,KAAK,KAAK,IAAI,CAAC,UAAU,YAAY,IAAI,QAAQ,OAAO;AAAA,QACjG,CAAC,GAAG,QAAQ,GAAG,UAAU;AAAA,QACzB,QAAQ;AAAA,MAAA;AAEV,aAAO,IAAI,KAAK,IAAI,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC;AAAA,IAC7C,CAAC;AAAA,EACH;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,mBAAmB,SAGE;AACzB,QAAI,CAAC,QAAQ,aAAa,eAAe,CAAA;AACzC,WAAO,KAAK,aAAa,QAAQ,cAAc,OAAO,iBAAiB;AACrE,YAAM,MAAM,MAAM,KAAK;AAAA,QACrB,iBAAiB,KAAK,EAAE,UAAU,QAAQ,CAAC,UAAU,eAAe,YAAY,QAAQ,KAAK,OAAO,aAAa,MAAM,CAAC;AAAA,QACxH;AAAA,QACA,QAAQ;AAAA,MAAA;AAEV,aAAO,IAAI,KAAK,IAAI,CAAC,MAAM,KAAK,YAAY,CAAC,CAAC;AAAA,IAChD,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,kBAAkB,SAIN;AAChB,UAAM,KAAK,mBAAmB;AAAA,MAC5B,cAAc,CAAC,QAAQ,WAAW;AAAA,MAClC,kBAAkB,QAAQ;AAAA,MAC1B,KAAK,QAAQ;AAAA,IAAA,CACd;AAAA,EACH;AAAA,EAEA,MAAM,mBAAmB,SAKH;AACpB,QAAI,CAAC,QAAQ,aAAa,eAAe,CAAA;AACzC,WAAO,KAAK,aAAa,QAAQ,cAAc,OAAO,iBAAiB;AACrE,YAAM,OAAO,GAAG,eAAe,iBAAiB,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,eAAe,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC;AAC9G,YAAM,SAAS,CAAC,KAAK,OAAO,QAAQ,gBAAgB,GAAG,QAAQ,KAAK,GAAG,YAAY;AACnF,YAAM,MAAM,MAAM,KAAK;AAAA,QACrB,UAAU,KAAK,EAAE,UAAU,QAAQ,CAAC,QAAQ,IAAI,UACrC,eAAe,YAAY,QAAQ,KAAK,OAAO,aAAa,QAAQ,CAAC,CAAC,eAClE,eAAe,YAAY;AAAA,QAC1C;AAAA,QACA,QAAQ;AAAA,MAAA;AAEV,aAAO,IAAI,KAAK,IAAI,CAAC,MAAM,KAAK,eAAe,CAAC,CAAC;AAAA,IACnD,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,eAAe,SAA4E;AAC/F,UAAM,UAAU,MAAM,KAAK,gBAAgB;AAAA,MACzC,cAAc,CAAC,QAAQ,WAAW;AAAA,MAClC,GAAI,QAAQ,KAAK,EAAE,IAAI,QAAQ,GAAA,IAAO,CAAA;AAAA,IAAC,CACxC;AACD,WAAO,QAAQ,SAAS;AAAA,EAC1B;AAAA,EAEA,MAAM,gBAAgB,SAIA;AACpB,QAAI,CAAC,QAAQ,aAAa,eAAe,CAAA;AACzC,WAAO,KAAK,aAAa,QAAQ,cAAc,OAAO,iBAAiB;AAGrE,YAAM,SAAoB,CAAC,GAAG,YAAY;AAC1C,UAAI,QAAQ;AACZ,UAAI,QAAQ,eAAe,QAAW;AACpC,gBAAQ,QAAQ,eAAe,YAAY,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC;AACvE,eAAO,KAAK,QAAQ,UAAU;AAAA,MAChC;AACA,YAAM,MAAM,MAAM,KAAK;AAAA,QACrB,eAAe,KAAK,EAAE,UAAU,QAAQ,CAAC,UAC9B,eAAe,YAAY,QAAQ,KAAK,OAAO,aAAa,MAAM,CAAC,IAAI,KAAK,cACxE,eAAe,YAAY;AAAA,QAC1C;AAAA,QACA,QAAQ;AAAA,MAAA;AAEV,aAAO,IAAI,KAAK,IAAI,CAAC,MAAM,KAAK,eAAe,CAAC,CAAC;AAAA,IACnD,CAAC;AAAA,EACH;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;AAgBA,SAAS,YAAY,KAAqB;AACxC,QAAM,OAAO,WAAW,MAAM,EAAE,OAAO,GAAG,EAAE,OAAA;AAC5C,SAAO,KAAK,WAAW,GAAG,kBAAkB;AAC9C;AAMA,MAAM,qBAAqB;"}