@sixb/core 0.1.8 → 0.1.10

package/dist/chunk-aa6z4a19.js

@@ -0,0 +1,358 @@
+// @bun
+// src/queues/errors.ts
+class QueueError2 extends Error {
+  name = "QueueError";
+}
+// src/queues/in-memory.ts
+import { randomUUID } from "crypto";
+
+// src/queues/indexed-heap.ts
+class IndexedHeap {
+  compare;
+  items = [];
+  positions = new Map;
+  constructor(compare) {
+    this.compare = compare;
+  }
+  peek() {
+    return this.items[0];
+  }
+  pop() {
+    const first = this.peek();
+    if (first !== undefined)
+      this.delete(first);
+    return first;
+  }
+  set(item) {
+    const index = this.positions.get(item);
+    if (index === undefined) {
+      this.positions.set(item, this.items.length);
+      this.items.push(item);
+      this.up(this.items.length - 1);
+    } else {
+      this.down(this.up(index));
+    }
+  }
+  delete(item) {
+    const index = this.positions.get(item);
+    if (index === undefined)
+      return;
+    const last = this.items.pop();
+    this.positions.delete(item);
+    if (index === this.items.length)
+      return;
+    this.items[index] = last;
+    this.positions.set(last, index);
+    this.down(this.up(index));
+  }
+  up(start) {
+    let index = start;
+    while (index > 0) {
+      const parent = Math.floor((index - 1) / 2);
+      if (this.compare(this.items[parent], this.items[index]) <= 0)
+        break;
+      this.swap(parent, index);
+      index = parent;
+    }
+    return index;
+  }
+  down(start) {
+    let index = start;
+    while (index * 2 + 1 < this.items.length) {
+      const left = index * 2 + 1;
+      const right = left + 1;
+      const child = right < this.items.length && this.compare(this.items[right], this.items[left]) < 0 ? right : left;
+      if (this.compare(this.items[index], this.items[child]) <= 0)
+        break;
+      this.swap(index, child);
+      index = child;
+    }
+  }
+  swap(left, right) {
+    const a = this.items[left];
+    const b = this.items[right];
+    this.items[left] = b;
+    this.items[right] = a;
+    this.positions.set(a, right);
+    this.positions.set(b, left);
+  }
+}
+
+// src/queues/in-memory.ts
+function assertNonEmpty(value, fieldName) {
+  if (value.trim().length === 0) {
+    throw new QueueError2(`[Sixb] Queue ${fieldName} must not be empty`);
+  }
+}
+function parseTimestamp(value, fieldName) {
+  const timestamp = Date.parse(value);
+  if (Number.isNaN(timestamp)) {
+    throw new QueueError2(`[Sixb] Queue ${fieldName} must be a valid timestamp`);
+  }
+  return timestamp;
+}
+function assertPositiveNumber(value, fieldName) {
+  if (!Number.isFinite(value) || value <= 0) {
+    throw new QueueError2(`[Sixb] Queue ${fieldName} must be greater than 0`);
+  }
+}
+function clearLease(record) {
+  record.leaseId = null;
+  record.claimedAt = null;
+  record.leaseExpiresAt = null;
+  record.leaseExpiryMs = null;
+}
+function compareQueueRecords(left, right) {
+  const availableDifference = left.availableAtMs - right.availableAtMs;
+  if (availableDifference !== 0)
+    return availableDifference;
+  const createdDifference = left.createdAtMs - right.createdAtMs;
+  if (createdDifference !== 0)
+    return createdDifference;
+  return left.sequence - right.sequence;
+}
+function createQueueJob(projectId, newJob) {
+  const createdAt = new Date().toISOString();
+  const availableAt = newJob.availableAt ?? createdAt;
+  parseTimestamp(availableAt, "availableAt");
+  return {
+    id: newJob.id ?? randomUUID(),
+    projectId,
+    createdAt,
+    availableAt,
+    attempt: 0,
+    metadata: newJob.metadata ? structuredClone(newJob.metadata) : undefined,
+    type: newJob.type,
+    payload: structuredClone(newJob.payload)
+  };
+}
+function leaseExpiresAtMs(record) {
+  return record.leaseExpiryMs;
+}
+function eligibleAt(record) {
+  return Math.max(record.availableAtMs, record.leaseExpiryMs ?? -Infinity);
+}
+function toClaimedQueueJob(record) {
+  if (!record.leaseId || !record.claimedAt || !record.leaseExpiresAt) {
+    throw new QueueError2(`[Sixb] Queue job '${record.job.id}' is not currently leased`);
+  }
+  return {
+    leaseId: record.leaseId,
+    claimedAt: record.claimedAt,
+    leaseExpiresAt: record.leaseExpiresAt,
+    job: structuredClone(record.job)
+  };
+}
+
+class InMemoryQueueStore {
+  projects = new Map;
+  nextSequence = 1;
+  add(projectId, queueId, job) {
+    const lane = this.lane(projectId, queueId);
+    const record = {
+      sequence: this.nextSequence++,
+      queueId,
+      job,
+      availableAtMs: parseTimestamp(job.availableAt, "job.availableAt"),
+      createdAtMs: parseTimestamp(job.createdAt, "job.createdAt"),
+      leaseExpiryMs: null,
+      state: "queued",
+      failure: null,
+      leaseId: null,
+      claimedAt: null,
+      leaseExpiresAt: null
+    };
+    lane.records.set(job.id, record);
+    this.schedule(projectId, record, Date.now());
+  }
+  find(projectId, queueId, jobId) {
+    return this.projects.get(projectId)?.get(queueId)?.records.get(jobId) ?? null;
+  }
+  schedule(projectId, record, now) {
+    const lane = this.lane(projectId, record.queueId);
+    if (record.state !== "queued") {
+      lane.ready.delete(record);
+      lane.waiting.delete(record);
+    } else if (eligibleAt(record) <= now) {
+      lane.waiting.delete(record);
+      lane.ready.set(record);
+    } else {
+      lane.ready.delete(record);
+      lane.waiting.set(record);
+    }
+  }
+  takeReady(projectId, queueId, now, limit) {
+    const lane = this.projects.get(projectId)?.get(queueId);
+    if (!lane)
+      return [];
+    while (lane.waiting.peek() && eligibleAt(lane.waiting.peek()) <= now) {
+      lane.ready.set(lane.waiting.pop());
+    }
+    const selected = [];
+    while (selected.length < limit) {
+      const record = lane.ready.peek();
+      if (!record || record.availableAtMs > now)
+        break;
+      lane.ready.pop();
+      if (eligibleAt(record) > now)
+        lane.waiting.set(record);
+      else
+        selected.push(record);
+    }
+    return selected;
+  }
+  lane(projectId, queueId) {
+    let queues = this.projects.get(projectId);
+    if (!queues) {
+      queues = new Map;
+      this.projects.set(projectId, queues);
+    }
+    let lane = queues.get(queueId);
+    if (!lane) {
+      lane = {
+        records: new Map,
+        ready: new IndexedHeap(compareQueueRecords),
+        waiting: new IndexedHeap((left, right) => eligibleAt(left) - eligibleAt(right) || left.sequence - right.sequence)
+      };
+      queues.set(queueId, lane);
+    }
+    return lane;
+  }
+}
+
+class InMemoryQueue {
+  store;
+  queueId;
+  constructor(store, queueId) {
+    this.store = store;
+    this.queueId = queueId;
+    assertNonEmpty(queueId, "queueId");
+  }
+  async enqueue(params) {
+    assertNonEmpty(params.projectId, "projectId");
+    if (params.jobs.length === 0) {
+      return [];
+    }
+    const createdJobs = params.jobs.map((job) => {
+      if (job.id !== undefined)
+        assertNonEmpty(job.id, "job.id");
+      const existing = job.id ? this.store.find(params.projectId, this.queueId, job.id) : null;
+      if (existing)
+        return existing.job;
+      const created = createQueueJob(params.projectId, job);
+      this.store.add(params.projectId, this.queueId, created);
+      return created;
+    });
+    return createdJobs.map((job) => structuredClone(job));
+  }
+  async claim(params) {
+    assertNonEmpty(params.projectId, "projectId");
+    assertNonEmpty(params.workerId, "workerId");
+    const limit = Math.trunc(params.limit ?? 1);
+    if (!(limit > 0)) {
+      return [];
+    }
+    const leaseMs = params.leaseMs ?? 30000;
+    assertPositiveNumber(leaseMs, "leaseMs");
+    const now = Date.now();
+    const claimedAt = new Date(now).toISOString();
+    const leaseExpiry = new Date(now + leaseMs);
+    const leaseExpiresAt = leaseExpiry.toISOString();
+    const claimable = this.store.takeReady(params.projectId, this.queueId, now, limit);
+    return claimable.map((record) => {
+      record.job = {
+        ...record.job,
+        attempt: record.job.attempt + 1
+      };
+      record.leaseId = randomUUID();
+      record.claimedAt = claimedAt;
+      record.leaseExpiresAt = leaseExpiresAt;
+      record.leaseExpiryMs = leaseExpiry.getTime();
+      this.store.schedule(params.projectId, record, now);
+      return toClaimedQueueJob(record);
+    });
+  }
+  async complete(params) {
+    const record = this.requireActiveLease(params);
+    record.state = "completed";
+    clearLease(record);
+    this.store.schedule(params.projectId, record, Date.now());
+  }
+  async retry(params) {
+    const record = this.requireActiveLease(params);
+    const availableAt = params.availableAt ?? new Date().toISOString();
+    const availableAtMs = parseTimestamp(availableAt, "availableAt");
+    record.availableAtMs = availableAtMs;
+    record.job = {
+      ...record.job,
+      availableAt
+    };
+    clearLease(record);
+    this.store.schedule(params.projectId, record, Date.now());
+  }
+  async fail(params) {
+    const record = this.requireActiveLease(params);
+    record.state = "failed";
+    record.failure = structuredClone(params.failure);
+    clearLease(record);
+    this.store.schedule(params.projectId, record, Date.now());
+  }
+  async renewLease(params) {
+    assertPositiveNumber(params.leaseMs, "leaseMs");
+    const record = this.store.find(params.projectId, this.queueId, params.jobId);
+    if (!record || record.state !== "queued") {
+      return null;
+    }
+    const now = Date.now();
+    const expiresAt = leaseExpiresAtMs(record);
+    if (record.leaseId !== params.leaseId || expiresAt === null) {
+      return null;
+    }
+    if (expiresAt <= now) {
+      return null;
+    }
+    const leaseExpiry = new Date(now + params.leaseMs);
+    record.leaseExpiresAt = leaseExpiry.toISOString();
+    record.leaseExpiryMs = leaseExpiry.getTime();
+    this.store.schedule(params.projectId, record, now);
+    return toClaimedQueueJob(record);
+  }
+  requireActiveLease(params) {
+    assertNonEmpty(params.projectId, "projectId");
+    assertNonEmpty(params.jobId, "jobId");
+    assertNonEmpty(params.leaseId, "leaseId");
+    const record = this.store.find(params.projectId, this.queueId, params.jobId);
+    if (!record) {
+      throw new QueueError2(`[Sixb] Unknown queue job '${params.jobId}'`);
+    }
+    if (record.state !== "queued") {
+      throw new QueueError2(`[Sixb] Queue job '${params.jobId}' is no longer active`);
+    }
+    if (record.leaseId !== params.leaseId || !record.leaseExpiresAt) {
+      throw new QueueError2(`[Sixb] Lease mismatch for queue job '${params.jobId}'`);
+    }
+    const expiresAt = leaseExpiresAtMs(record);
+    if (expiresAt === null || expiresAt <= Date.now()) {
+      throw new QueueError2(`[Sixb] Lease for queue job '${params.jobId}' has expired`);
+    }
+    return record;
+  }
+}
+
+class InMemoryQueues2 {
+  scope = "process";
+  store = new InMemoryQueueStore;
+  syncRuns = new InMemoryQueue(this.store, "sync.runs");
+  pipelines = new InMemoryQueue(this.store, "pipeline.runs");
+  projections = new InMemoryQueue(this.store, "projection.runs");
+  workflows = new InMemoryQueue(this.store, "workflow.runs");
+  actions = new InMemoryQueue(this.store, "action.runs");
+  agents = new InMemoryQueue(this.store, "agent.runs");
+  agentChildren = new InMemoryQueue(this.store, "agent.children");
+  health() {
+    return Promise.resolve();
+  }
+}
+export { QueueError2, InMemoryQueues2 };
+
+//# debugId=40F6801A008F592764756E2164756E21

package/dist/chunk-aa6z4a19.js.map

@@ -0,0 +1,12 @@
+{
+  "version": 3,
+  "sources": ["../src/queues/errors.ts", "../src/queues/in-memory.ts", "../src/queues/indexed-heap.ts"],
+  "sourcesContent": [
+    "/**\n * Error for queue invariants and invalid queue operations.\n */\nexport class QueueError extends Error {\n  readonly name = \"QueueError\"\n}\n",
+    "import { randomUUID } from \"node:crypto\"\nimport type { SixbErrorCode } from \"../errors/types\"\nimport { QueueError } from \"./errors\"\nimport { IndexedHeap } from \"./indexed-heap\"\nimport type {\n  ActionQueueJobFailureCode,\n  ActionRunRequestedQueueJob,\n  AgentQueueJob,\n  AgentQueueJobFailureCode,\n  ClaimedQueueJob,\n  NewQueueJob,\n  PipelineQueueJobFailureCode,\n  PipelineRunRequestedQueueJob,\n  ProjectionQueueJobFailureCode,\n  ProjectionRunRequestedQueueJob,\n  Queue,\n  QueueJob,\n  QueueJobFailure,\n  Queues,\n  SubagentQueueJob,\n  SyncQueueJobFailureCode,\n  SyncRunRequestedQueueJob,\n  WorkflowQueueJob,\n  WorkflowQueueJobFailureCode,\n} from \"./types\"\n\ntype QueueRecordState = \"queued\" | \"completed\" | \"failed\"\n\ninterface QueueRecord<TQueueJob extends QueueJob = QueueJob> {\n  readonly sequence: number\n  readonly queueId: string\n  job: TQueueJob\n  availableAtMs: number\n  readonly createdAtMs: number\n  leaseExpiryMs: number | null\n  // A leased job stays \"queued\" until a worker completes or fails it.\n  state: QueueRecordState\n  failure: QueueJobFailure | null\n  leaseId: string | null\n  claimedAt: string | null\n  leaseExpiresAt: string | null\n}\n\nfunction assertNonEmpty(value: string, fieldName: string): void {\n  if (value.trim().length === 0) {\n    throw new QueueError(`[Sixb] Queue ${fieldName} must not be empty`)\n  }\n}\n\nfunction parseTimestamp(value: string, fieldName: string): number {\n  const timestamp = Date.parse(value)\n\n  if (Number.isNaN(timestamp)) {\n    throw new QueueError(`[Sixb] Queue ${fieldName} must be a valid timestamp`)\n  }\n\n  return timestamp\n}\n\nfunction assertPositiveNumber(value: number, fieldName: string): void {\n  if (!Number.isFinite(value) || value <= 0) {\n    throw new QueueError(`[Sixb] Queue ${fieldName} must be greater than 0`)\n  }\n}\n\nfunction clearLease(record: QueueRecord): void {\n  record.leaseId = null\n  record.claimedAt = null\n  record.leaseExpiresAt = null\n  record.leaseExpiryMs = null\n}\n\n// Best-effort ordering is part of the contract; this keeps the in-memory provider deterministic.\nfunction compareQueueRecords(left: QueueRecord, right: QueueRecord): number {\n  const availableDifference = left.availableAtMs - right.availableAtMs\n  if (availableDifference !== 0) return availableDifference\n  const createdDifference = left.createdAtMs - right.createdAtMs\n  if (createdDifference !== 0) return createdDifference\n\n  return left.sequence - right.sequence\n}\n\nfunction createQueueJob<TQueueJob extends QueueJob>(\n  projectId: string,\n  newJob: NewQueueJob<TQueueJob>\n): TQueueJob {\n  const createdAt = new Date().toISOString()\n  const availableAt = newJob.availableAt ?? createdAt\n  parseTimestamp(availableAt, \"availableAt\")\n\n  return {\n    id: newJob.id ?? randomUUID(),\n    projectId,\n    createdAt,\n    availableAt,\n    attempt: 0,\n    metadata: newJob.metadata ? structuredClone(newJob.metadata) : undefined,\n    type: newJob.type,\n    payload: structuredClone(newJob.payload),\n  } as TQueueJob\n}\n\nfunction leaseExpiresAtMs(record: QueueRecord): number | null {\n  return record.leaseExpiryMs\n}\n\nfunction eligibleAt(record: QueueRecord): number {\n  return Math.max(record.availableAtMs, record.leaseExpiryMs ?? -Infinity)\n}\n\ninterface QueueLane {\n  // Terminal records remain here for caller-id deduplication, never in the delivery indexes.\n  readonly records: Map<string, QueueRecord>\n  readonly ready: IndexedHeap<QueueRecord>\n  readonly waiting: IndexedHeap<QueueRecord>\n}\n\nfunction toClaimedQueueJob<TQueueJob extends QueueJob>(\n  record: QueueRecord<TQueueJob>\n): ClaimedQueueJob<TQueueJob> {\n  if (!record.leaseId || !record.claimedAt || !record.leaseExpiresAt) {\n    throw new QueueError(`[Sixb] Queue job '${record.job.id}' is not currently leased`)\n  }\n\n  return {\n    leaseId: record.leaseId,\n    claimedAt: record.claimedAt,\n    leaseExpiresAt: record.leaseExpiresAt,\n    job: structuredClone(record.job),\n  }\n}\n\nclass InMemoryQueueStore {\n  private readonly projects = new Map<string, Map<string, QueueLane>>()\n  private nextSequence = 1\n\n  add<TQueueJob extends QueueJob>(projectId: string, queueId: string, job: TQueueJob): void {\n    const lane = this.lane(projectId, queueId)\n    const record: QueueRecord = {\n      sequence: this.nextSequence++,\n      queueId,\n      job,\n      availableAtMs: parseTimestamp(job.availableAt, \"job.availableAt\"),\n      createdAtMs: parseTimestamp(job.createdAt, \"job.createdAt\"),\n      leaseExpiryMs: null,\n      state: \"queued\",\n      failure: null,\n      leaseId: null,\n      claimedAt: null,\n      leaseExpiresAt: null,\n    }\n    lane.records.set(job.id, record)\n    this.schedule(projectId, record, Date.now())\n  }\n\n  find<TQueueJob extends QueueJob>(\n    projectId: string,\n    queueId: string,\n    jobId: string\n  ): QueueRecord<TQueueJob> | null {\n    return (this.projects.get(projectId)?.get(queueId)?.records.get(jobId) ??\n      null) as QueueRecord<TQueueJob> | null\n  }\n\n  schedule(projectId: string, record: QueueRecord, now: number): void {\n    const lane = this.lane(projectId, record.queueId)\n    if (record.state !== \"queued\") {\n      lane.ready.delete(record)\n      lane.waiting.delete(record)\n    } else if (eligibleAt(record) <= now) {\n      lane.waiting.delete(record)\n      lane.ready.set(record)\n    } else {\n      lane.ready.delete(record)\n      lane.waiting.set(record)\n    }\n  }\n\n  takeReady<TQueueJob extends QueueJob>(\n    projectId: string,\n    queueId: string,\n    now: number,\n    limit: number\n  ): QueueRecord<TQueueJob>[] {\n    const lane = this.projects.get(projectId)?.get(queueId)\n    if (!lane) return []\n    // Wake delayed jobs and expired leases, then order all ready jobs by the original contract.\n    // A lease expiry controls eligibility, not the priority of a redelivered job.\n    while (lane.waiting.peek() && eligibleAt(lane.waiting.peek()!) <= now) {\n      lane.ready.set(lane.waiting.pop()!)\n    }\n    const selected: QueueRecord[] = []\n    while (selected.length < limit) {\n      const record = lane.ready.peek()\n      if (!record || record.availableAtMs > now) break\n      lane.ready.pop()\n      // A backwards wall-clock adjustment can make a previously expired lease live again.\n      if (eligibleAt(record) > now) lane.waiting.set(record)\n      else selected.push(record)\n    }\n    return selected as QueueRecord<TQueueJob>[]\n  }\n\n  private lane(projectId: string, queueId: string): QueueLane {\n    let queues = this.projects.get(projectId)\n    if (!queues) {\n      queues = new Map()\n      this.projects.set(projectId, queues)\n    }\n    let lane = queues.get(queueId)\n    if (!lane) {\n      lane = {\n        records: new Map(),\n        ready: new IndexedHeap(compareQueueRecords),\n        waiting: new IndexedHeap(\n          (left, right) => eligibleAt(left) - eligibleAt(right) || left.sequence - right.sequence\n        ),\n      }\n      queues.set(queueId, lane)\n    }\n    return lane\n  }\n}\n\nclass InMemoryQueue<TQueueJob extends QueueJob, TFailureCode extends SixbErrorCode>\n  implements Queue<TQueueJob, TFailureCode>\n{\n  constructor(\n    private readonly store: InMemoryQueueStore,\n    private readonly queueId: string\n  ) {\n    assertNonEmpty(queueId, \"queueId\")\n  }\n\n  async enqueue(params: {\n    projectId: string\n    jobs: readonly NewQueueJob<TQueueJob>[]\n  }): Promise<readonly TQueueJob[]> {\n    assertNonEmpty(params.projectId, \"projectId\")\n\n    if (params.jobs.length === 0) {\n      return []\n    }\n\n    const createdJobs = params.jobs.map((job) => {\n      if (job.id !== undefined) assertNonEmpty(job.id, \"job.id\")\n      const existing = job.id\n        ? this.store.find<TQueueJob>(params.projectId, this.queueId, job.id)\n        : null\n      if (existing) return existing.job\n\n      const created = createQueueJob(params.projectId, job)\n      this.store.add(params.projectId, this.queueId, created)\n      return created\n    })\n\n    return createdJobs.map((job) => structuredClone(job))\n  }\n\n  async claim(params: {\n    projectId: string\n    workerId: string\n    limit?: number\n    leaseMs?: number\n  }): Promise<readonly ClaimedQueueJob<TQueueJob>[]> {\n    assertNonEmpty(params.projectId, \"projectId\")\n    assertNonEmpty(params.workerId, \"workerId\")\n\n    const limit = Math.trunc(params.limit ?? 1)\n    if (!(limit > 0)) {\n      return []\n    }\n\n    const leaseMs = params.leaseMs ?? 30_000\n    assertPositiveNumber(leaseMs, \"leaseMs\")\n\n    const now = Date.now()\n    const claimedAt = new Date(now).toISOString()\n    // Validate before removing candidates, and cache the same millisecond precision we return.\n    const leaseExpiry = new Date(now + leaseMs)\n    const leaseExpiresAt = leaseExpiry.toISOString()\n    const claimable = this.store.takeReady<TQueueJob>(params.projectId, this.queueId, now, limit)\n\n    return claimable.map((record) => {\n      // Attempts count claims so redelivery after lease expiry or retry is visible to workers.\n      record.job = {\n        ...record.job,\n        attempt: record.job.attempt + 1,\n      }\n      record.leaseId = randomUUID()\n      record.claimedAt = claimedAt\n      record.leaseExpiresAt = leaseExpiresAt\n      record.leaseExpiryMs = leaseExpiry.getTime()\n      this.store.schedule(params.projectId, record, now)\n\n      return toClaimedQueueJob(record)\n    })\n  }\n\n  async complete(params: { projectId: string; jobId: string; leaseId: string }): Promise<void> {\n    const record = this.requireActiveLease(params)\n    record.state = \"completed\"\n    clearLease(record)\n    this.store.schedule(params.projectId, record, Date.now())\n  }\n\n  async retry(params: {\n    projectId: string\n    jobId: string\n    leaseId: string\n    availableAt?: string\n  }): Promise<void> {\n    const record = this.requireActiveLease(params)\n    const availableAt = params.availableAt ?? new Date().toISOString()\n    const availableAtMs = parseTimestamp(availableAt, \"availableAt\")\n\n    record.availableAtMs = availableAtMs\n    record.job = {\n      ...record.job,\n      availableAt,\n    }\n    clearLease(record)\n    this.store.schedule(params.projectId, record, Date.now())\n  }\n\n  async fail(params: {\n    projectId: string\n    jobId: string\n    leaseId: string\n    failure: QueueJobFailure<TFailureCode>\n  }): Promise<void> {\n    const record = this.requireActiveLease(params)\n    record.state = \"failed\"\n    record.failure = structuredClone(params.failure)\n    clearLease(record)\n    this.store.schedule(params.projectId, record, Date.now())\n  }\n\n  async renewLease(params: {\n    projectId: string\n    jobId: string\n    leaseId: string\n    leaseMs: number\n  }): Promise<ClaimedQueueJob<TQueueJob> | null> {\n    assertPositiveNumber(params.leaseMs, \"leaseMs\")\n\n    const record = this.store.find<TQueueJob>(params.projectId, this.queueId, params.jobId)\n    if (!record || record.state !== \"queued\") {\n      return null\n    }\n\n    const now = Date.now()\n    const expiresAt = leaseExpiresAtMs(record)\n    if (record.leaseId !== params.leaseId || expiresAt === null) {\n      return null\n    }\n\n    if (expiresAt <= now) {\n      return null\n    }\n\n    const leaseExpiry = new Date(now + params.leaseMs)\n    record.leaseExpiresAt = leaseExpiry.toISOString()\n    record.leaseExpiryMs = leaseExpiry.getTime()\n    this.store.schedule(params.projectId, record, now)\n    return toClaimedQueueJob(record)\n  }\n\n  private requireActiveLease(params: {\n    projectId: string\n    jobId: string\n    leaseId: string\n  }): QueueRecord<TQueueJob> {\n    assertNonEmpty(params.projectId, \"projectId\")\n    assertNonEmpty(params.jobId, \"jobId\")\n    assertNonEmpty(params.leaseId, \"leaseId\")\n\n    const record = this.store.find<TQueueJob>(params.projectId, this.queueId, params.jobId)\n\n    if (!record) {\n      throw new QueueError(`[Sixb] Unknown queue job '${params.jobId}'`)\n    }\n\n    if (record.state !== \"queued\") {\n      throw new QueueError(`[Sixb] Queue job '${params.jobId}' is no longer active`)\n    }\n\n    if (record.leaseId !== params.leaseId || !record.leaseExpiresAt) {\n      throw new QueueError(`[Sixb] Lease mismatch for queue job '${params.jobId}'`)\n    }\n\n    const expiresAt = leaseExpiresAtMs(record)\n    if (expiresAt === null || expiresAt <= Date.now()) {\n      throw new QueueError(`[Sixb] Lease for queue job '${params.jobId}' has expired`)\n    }\n\n    return record\n  }\n}\n\nexport class InMemoryQueues implements Queues {\n  readonly scope = \"process\" as const\n  private readonly store = new InMemoryQueueStore()\n\n  readonly syncRuns = new InMemoryQueue<SyncRunRequestedQueueJob, SyncQueueJobFailureCode>(\n    this.store,\n    \"sync.runs\"\n  )\n  readonly pipelines = new InMemoryQueue<PipelineRunRequestedQueueJob, PipelineQueueJobFailureCode>(\n    this.store,\n    \"pipeline.runs\"\n  )\n  readonly projections = new InMemoryQueue<\n    ProjectionRunRequestedQueueJob,\n    ProjectionQueueJobFailureCode\n  >(this.store, \"projection.runs\")\n  readonly workflows = new InMemoryQueue<WorkflowQueueJob, WorkflowQueueJobFailureCode>(\n    this.store,\n    \"workflow.runs\"\n  )\n  readonly actions = new InMemoryQueue<ActionRunRequestedQueueJob, ActionQueueJobFailureCode>(\n    this.store,\n    \"action.runs\"\n  )\n  readonly agents = new InMemoryQueue<AgentQueueJob, AgentQueueJobFailureCode>(\n    this.store,\n    \"agent.runs\"\n  )\n  readonly agentChildren = new InMemoryQueue<SubagentQueueJob, AgentQueueJobFailureCode>(\n    this.store,\n    \"agent.children\"\n  )\n\n  /** Nothing to reach: the store is a field of this object. */\n  health(): Promise<void> {\n    return Promise.resolve()\n  }\n}\n",
+    "/** Internal mutable priority index. Updating or removing an entry never leaves stale copies. */\nexport class IndexedHeap<T> {\n  private readonly items: T[] = []\n  private readonly positions = new Map<T, number>()\n\n  constructor(private readonly compare: (left: T, right: T) => number) {}\n\n  peek(): T | undefined {\n    return this.items[0]\n  }\n\n  pop(): T | undefined {\n    const first = this.peek()\n    if (first !== undefined) this.delete(first)\n    return first\n  }\n\n  set(item: T): void {\n    const index = this.positions.get(item)\n    if (index === undefined) {\n      this.positions.set(item, this.items.length)\n      this.items.push(item)\n      this.up(this.items.length - 1)\n    } else {\n      this.down(this.up(index))\n    }\n  }\n\n  delete(item: T): void {\n    const index = this.positions.get(item)\n    if (index === undefined) return\n    const last = this.items.pop()!\n    this.positions.delete(item)\n    if (index === this.items.length) return\n    this.items[index] = last\n    this.positions.set(last, index)\n    this.down(this.up(index))\n  }\n\n  private up(start: number): number {\n    let index = start\n    while (index > 0) {\n      const parent = Math.floor((index - 1) / 2)\n      if (this.compare(this.items[parent]!, this.items[index]!) <= 0) break\n      this.swap(parent, index)\n      index = parent\n    }\n    return index\n  }\n\n  private down(start: number): void {\n    let index = start\n    while (index * 2 + 1 < this.items.length) {\n      const left = index * 2 + 1\n      const right = left + 1\n      const child =\n        right < this.items.length && this.compare(this.items[right]!, this.items[left]!) < 0\n          ? right\n          : left\n      if (this.compare(this.items[index]!, this.items[child]!) <= 0) break\n      this.swap(index, child)\n      index = child\n    }\n  }\n\n  private swap(left: number, right: number): void {\n    const a = this.items[left]!\n    const b = this.items[right]!\n    this.items[left] = b\n    this.items[right] = a\n    this.positions.set(a, right)\n    this.positions.set(b, left)\n  }\n}\n"
+  ],
+  "mappings": ";;AAGO,MAAM,oBAAmB,MAAM;AAAA,EAC3B,OAAO;AAClB;;ACLA;;;ACCO,MAAM,YAAe;AAAA,EAIG;AAAA,EAHZ,QAAa,CAAC;AAAA,EACd,YAAY,IAAI;AAAA,EAEjC,WAAW,CAAkB,SAAwC;AAAA,IAAxC;AAAA;AAAA,EAE7B,IAAI,GAAkB;AAAA,IACpB,OAAO,KAAK,MAAM;AAAA;AAAA,EAGpB,GAAG,GAAkB;AAAA,IACnB,MAAM,QAAQ,KAAK,KAAK;AAAA,IACxB,IAAI,UAAU;AAAA,MAAW,KAAK,OAAO,KAAK;AAAA,IAC1C,OAAO;AAAA;AAAA,EAGT,GAAG,CAAC,MAAe;AAAA,IACjB,MAAM,QAAQ,KAAK,UAAU,IAAI,IAAI;AAAA,IACrC,IAAI,UAAU,WAAW;AAAA,MACvB,KAAK,UAAU,IAAI,MAAM,KAAK,MAAM,MAAM;AAAA,MAC1C,KAAK,MAAM,KAAK,IAAI;AAAA,MACpB,KAAK,GAAG,KAAK,MAAM,SAAS,CAAC;AAAA,IAC/B,EAAO;AAAA,MACL,KAAK,KAAK,KAAK,GAAG,KAAK,CAAC;AAAA;AAAA;AAAA,EAI5B,MAAM,CAAC,MAAe;AAAA,IACpB,MAAM,QAAQ,KAAK,UAAU,IAAI,IAAI;AAAA,IACrC,IAAI,UAAU;AAAA,MAAW;AAAA,IACzB,MAAM,OAAO,KAAK,MAAM,IAAI;AAAA,IAC5B,KAAK,UAAU,OAAO,IAAI;AAAA,IAC1B,IAAI,UAAU,KAAK,MAAM;AAAA,MAAQ;AAAA,IACjC,KAAK,MAAM,SAAS;AAAA,IACpB,KAAK,UAAU,IAAI,MAAM,KAAK;AAAA,IAC9B,KAAK,KAAK,KAAK,GAAG,KAAK,CAAC;AAAA;AAAA,EAGlB,EAAE,CAAC,OAAuB;AAAA,IAChC,IAAI,QAAQ;AAAA,IACZ,OAAO,QAAQ,GAAG;AAAA,MAChB,MAAM,SAAS,KAAK,OAAO,QAAQ,KAAK,CAAC;AAAA,MACzC,IAAI,KAAK,QAAQ,KAAK,MAAM,SAAU,KAAK,MAAM,MAAO,KAAK;AAAA,QAAG;AAAA,MAChE,KAAK,KAAK,QAAQ,KAAK;AAAA,MACvB,QAAQ;AAAA,IACV;AAAA,IACA,OAAO;AAAA;AAAA,EAGD,IAAI,CAAC,OAAqB;AAAA,IAChC,IAAI,QAAQ;AAAA,IACZ,OAAO,QAAQ,IAAI,IAAI,KAAK,MAAM,QAAQ;AAAA,MACxC,MAAM,OAAO,QAAQ,IAAI;AAAA,MACzB,MAAM,QAAQ,OAAO;AAAA,MACrB,MAAM,QACJ,QAAQ,KAAK,MAAM,UAAU,KAAK,QAAQ,KAAK,MAAM,QAAS,KAAK,MAAM,KAAM,IAAI,IAC/E,QACA;AAAA,MACN,IAAI,KAAK,QAAQ,KAAK,MAAM,QAAS,KAAK,MAAM,MAAO,KAAK;AAAA,QAAG;AAAA,MAC/D,KAAK,KAAK,OAAO,KAAK;AAAA,MACtB,QAAQ;AAAA,IACV;AAAA;AAAA,EAGM,IAAI,CAAC,MAAc,OAAqB;AAAA,IAC9C,MAAM,IAAI,KAAK,MAAM;AAAA,IACrB,MAAM,IAAI,KAAK,MAAM;AAAA,IACrB,KAAK,MAAM,QAAQ;AAAA,IACnB,KAAK,MAAM,SAAS;AAAA,IACpB,KAAK,UAAU,IAAI,GAAG,KAAK;AAAA,IAC3B,KAAK,UAAU,IAAI,GAAG,IAAI;AAAA;AAE9B;;;AD9BA,SAAS,cAAc,CAAC,OAAe,WAAyB;AAAA,EAC9D,IAAI,MAAM,KAAK,EAAE,WAAW,GAAG;AAAA,IAC7B,MAAM,IAAI,YAAW,gBAAgB,6BAA6B;AAAA,EACpE;AAAA;AAGF,SAAS,cAAc,CAAC,OAAe,WAA2B;AAAA,EAChE,MAAM,YAAY,KAAK,MAAM,KAAK;AAAA,EAElC,IAAI,OAAO,MAAM,SAAS,GAAG;AAAA,IAC3B,MAAM,IAAI,YAAW,gBAAgB,qCAAqC;AAAA,EAC5E;AAAA,EAEA,OAAO;AAAA;AAGT,SAAS,oBAAoB,CAAC,OAAe,WAAyB;AAAA,EACpE,IAAI,CAAC,OAAO,SAAS,KAAK,KAAK,SAAS,GAAG;AAAA,IACzC,MAAM,IAAI,YAAW,gBAAgB,kCAAkC;AAAA,EACzE;AAAA;AAGF,SAAS,UAAU,CAAC,QAA2B;AAAA,EAC7C,OAAO,UAAU;AAAA,EACjB,OAAO,YAAY;AAAA,EACnB,OAAO,iBAAiB;AAAA,EACxB,OAAO,gBAAgB;AAAA;AAIzB,SAAS,mBAAmB,CAAC,MAAmB,OAA4B;AAAA,EAC1E,MAAM,sBAAsB,KAAK,gBAAgB,MAAM;AAAA,EACvD,IAAI,wBAAwB;AAAA,IAAG,OAAO;AAAA,EACtC,MAAM,oBAAoB,KAAK,cAAc,MAAM;AAAA,EACnD,IAAI,sBAAsB;AAAA,IAAG,OAAO;AAAA,EAEpC,OAAO,KAAK,WAAW,MAAM;AAAA;AAG/B,SAAS,cAA0C,CACjD,WACA,QACW;AAAA,EACX,MAAM,YAAY,IAAI,KAAK,EAAE,YAAY;AAAA,EACzC,MAAM,cAAc,OAAO,eAAe;AAAA,EAC1C,eAAe,aAAa,aAAa;AAAA,EAEzC,OAAO;AAAA,IACL,IAAI,OAAO,MAAM,WAAW;AAAA,IAC5B;AAAA,IACA;AAAA,IACA;AAAA,IACA,SAAS;AAAA,IACT,UAAU,OAAO,WAAW,gBAAgB,OAAO,QAAQ,IAAI;AAAA,IAC/D,MAAM,OAAO;AAAA,IACb,SAAS,gBAAgB,OAAO,OAAO;AAAA,EACzC;AAAA;AAGF,SAAS,gBAAgB,CAAC,QAAoC;AAAA,EAC5D,OAAO,OAAO;AAAA;AAGhB,SAAS,UAAU,CAAC,QAA6B;AAAA,EAC/C,OAAO,KAAK,IAAI,OAAO,eAAe,OAAO,iBAAiB,SAAS;AAAA;AAUzE,SAAS,iBAA6C,CACpD,QAC4B;AAAA,EAC5B,IAAI,CAAC,OAAO,WAAW,CAAC,OAAO,aAAa,CAAC,OAAO,gBAAgB;AAAA,IAClE,MAAM,IAAI,YAAW,qBAAqB,OAAO,IAAI,6BAA6B;AAAA,EACpF;AAAA,EAEA,OAAO;AAAA,IACL,SAAS,OAAO;AAAA,IAChB,WAAW,OAAO;AAAA,IAClB,gBAAgB,OAAO;AAAA,IACvB,KAAK,gBAAgB,OAAO,GAAG;AAAA,EACjC;AAAA;AAAA;AAGF,MAAM,mBAAmB;AAAA,EACN,WAAW,IAAI;AAAA,EACxB,eAAe;AAAA,EAEvB,GAA+B,CAAC,WAAmB,SAAiB,KAAsB;AAAA,IACxF,MAAM,OAAO,KAAK,KAAK,WAAW,OAAO;AAAA,IACzC,MAAM,SAAsB;AAAA,MAC1B,UAAU,KAAK;AAAA,MACf;AAAA,MACA;AAAA,MACA,eAAe,eAAe,IAAI,aAAa,iBAAiB;AAAA,MAChE,aAAa,eAAe,IAAI,WAAW,eAAe;AAAA,MAC1D,eAAe;AAAA,MACf,OAAO;AAAA,MACP,SAAS;AAAA,MACT,SAAS;AAAA,MACT,WAAW;AAAA,MACX,gBAAgB;AAAA,IAClB;AAAA,IACA,KAAK,QAAQ,IAAI,IAAI,IAAI,MAAM;AAAA,IAC/B,KAAK,SAAS,WAAW,QAAQ,KAAK,IAAI,CAAC;AAAA;AAAA,EAG7C,IAAgC,CAC9B,WACA,SACA,OAC+B;AAAA,IAC/B,OAAQ,KAAK,SAAS,IAAI,SAAS,GAAG,IAAI,OAAO,GAAG,QAAQ,IAAI,KAAK,KACnE;AAAA;AAAA,EAGJ,QAAQ,CAAC,WAAmB,QAAqB,KAAmB;AAAA,IAClE,MAAM,OAAO,KAAK,KAAK,WAAW,OAAO,OAAO;AAAA,IAChD,IAAI,OAAO,UAAU,UAAU;AAAA,MAC7B,KAAK,MAAM,OAAO,MAAM;AAAA,MACxB,KAAK,QAAQ,OAAO,MAAM;AAAA,IAC5B,EAAO,SAAI,WAAW,MAAM,KAAK,KAAK;AAAA,MACpC,KAAK,QAAQ,OAAO,MAAM;AAAA,MAC1B,KAAK,MAAM,IAAI,MAAM;AAAA,IACvB,EAAO;AAAA,MACL,KAAK,MAAM,OAAO,MAAM;AAAA,MACxB,KAAK,QAAQ,IAAI,MAAM;AAAA;AAAA;AAAA,EAI3B,SAAqC,CACnC,WACA,SACA,KACA,OAC0B;AAAA,IAC1B,MAAM,OAAO,KAAK,SAAS,IAAI,SAAS,GAAG,IAAI,OAAO;AAAA,IACtD,IAAI,CAAC;AAAA,MAAM,OAAO,CAAC;AAAA,IAGnB,OAAO,KAAK,QAAQ,KAAK,KAAK,WAAW,KAAK,QAAQ,KAAK,CAAE,KAAK,KAAK;AAAA,MACrE,KAAK,MAAM,IAAI,KAAK,QAAQ,IAAI,CAAE;AAAA,IACpC;AAAA,IACA,MAAM,WAA0B,CAAC;AAAA,IACjC,OAAO,SAAS,SAAS,OAAO;AAAA,MAC9B,MAAM,SAAS,KAAK,MAAM,KAAK;AAAA,MAC/B,IAAI,CAAC,UAAU,OAAO,gBAAgB;AAAA,QAAK;AAAA,MAC3C,KAAK,MAAM,IAAI;AAAA,MAEf,IAAI,WAAW,MAAM,IAAI;AAAA,QAAK,KAAK,QAAQ,IAAI,MAAM;AAAA,MAChD;AAAA,iBAAS,KAAK,MAAM;AAAA,IAC3B;AAAA,IACA,OAAO;AAAA;AAAA,EAGD,IAAI,CAAC,WAAmB,SAA4B;AAAA,IAC1D,IAAI,SAAS,KAAK,SAAS,IAAI,SAAS;AAAA,IACxC,IAAI,CAAC,QAAQ;AAAA,MACX,SAAS,IAAI;AAAA,MACb,KAAK,SAAS,IAAI,WAAW,MAAM;AAAA,IACrC;AAAA,IACA,IAAI,OAAO,OAAO,IAAI,OAAO;AAAA,IAC7B,IAAI,CAAC,MAAM;AAAA,MACT,OAAO;AAAA,QACL,SAAS,IAAI;AAAA,QACb,OAAO,IAAI,YAAY,mBAAmB;AAAA,QAC1C,SAAS,IAAI,YACX,CAAC,MAAM,UAAU,WAAW,IAAI,IAAI,WAAW,KAAK,KAAK,KAAK,WAAW,MAAM,QACjF;AAAA,MACF;AAAA,MACA,OAAO,IAAI,SAAS,IAAI;AAAA,IAC1B;AAAA,IACA,OAAO;AAAA;AAEX;AAAA;AAEA,MAAM,cAEN;AAAA,EAEqB;AAAA,EACA;AAAA,EAFnB,WAAW,CACQ,OACA,SACjB;AAAA,IAFiB;AAAA,IACA;AAAA,IAEjB,eAAe,SAAS,SAAS;AAAA;AAAA,OAG7B,QAAO,CAAC,QAGoB;AAAA,IAChC,eAAe,OAAO,WAAW,WAAW;AAAA,IAE5C,IAAI,OAAO,KAAK,WAAW,GAAG;AAAA,MAC5B,OAAO,CAAC;AAAA,IACV;AAAA,IAEA,MAAM,cAAc,OAAO,KAAK,IAAI,CAAC,QAAQ;AAAA,MAC3C,IAAI,IAAI,OAAO;AAAA,QAAW,eAAe,IAAI,IAAI,QAAQ;AAAA,MACzD,MAAM,WAAW,IAAI,KACjB,KAAK,MAAM,KAAgB,OAAO,WAAW,KAAK,SAAS,IAAI,EAAE,IACjE;AAAA,MACJ,IAAI;AAAA,QAAU,OAAO,SAAS;AAAA,MAE9B,MAAM,UAAU,eAAe,OAAO,WAAW,GAAG;AAAA,MACpD,KAAK,MAAM,IAAI,OAAO,WAAW,KAAK,SAAS,OAAO;AAAA,MACtD,OAAO;AAAA,KACR;AAAA,IAED,OAAO,YAAY,IAAI,CAAC,QAAQ,gBAAgB,GAAG,CAAC;AAAA;AAAA,OAGhD,MAAK,CAAC,QAKuC;AAAA,IACjD,eAAe,OAAO,WAAW,WAAW;AAAA,IAC5C,eAAe,OAAO,UAAU,UAAU;AAAA,IAE1C,MAAM,QAAQ,KAAK,MAAM,OAAO,SAAS,CAAC;AAAA,IAC1C,IAAI,EAAE,QAAQ,IAAI;AAAA,MAChB,OAAO,CAAC;AAAA,IACV;AAAA,IAEA,MAAM,UAAU,OAAO,WAAW;AAAA,IAClC,qBAAqB,SAAS,SAAS;AAAA,IAEvC,MAAM,MAAM,KAAK,IAAI;AAAA,IACrB,MAAM,YAAY,IAAI,KAAK,GAAG,EAAE,YAAY;AAAA,IAE5C,MAAM,cAAc,IAAI,KAAK,MAAM,OAAO;AAAA,IAC1C,MAAM,iBAAiB,YAAY,YAAY;AAAA,IAC/C,MAAM,YAAY,KAAK,MAAM,UAAqB,OAAO,WAAW,KAAK,SAAS,KAAK,KAAK;AAAA,IAE5F,OAAO,UAAU,IAAI,CAAC,WAAW;AAAA,MAE/B,OAAO,MAAM;AAAA,WACR,OAAO;AAAA,QACV,SAAS,OAAO,IAAI,UAAU;AAAA,MAChC;AAAA,MACA,OAAO,UAAU,WAAW;AAAA,MAC5B,OAAO,YAAY;AAAA,MACnB,OAAO,iBAAiB;AAAA,MACxB,OAAO,gBAAgB,YAAY,QAAQ;AAAA,MAC3C,KAAK,MAAM,SAAS,OAAO,WAAW,QAAQ,GAAG;AAAA,MAEjD,OAAO,kBAAkB,MAAM;AAAA,KAChC;AAAA;AAAA,OAGG,SAAQ,CAAC,QAA8E;AAAA,IAC3F,MAAM,SAAS,KAAK,mBAAmB,MAAM;AAAA,IAC7C,OAAO,QAAQ;AAAA,IACf,WAAW,MAAM;AAAA,IACjB,KAAK,MAAM,SAAS,OAAO,WAAW,QAAQ,KAAK,IAAI,CAAC;AAAA;AAAA,OAGpD,MAAK,CAAC,QAKM;AAAA,IAChB,MAAM,SAAS,KAAK,mBAAmB,MAAM;AAAA,IAC7C,MAAM,cAAc,OAAO,eAAe,IAAI,KAAK,EAAE,YAAY;AAAA,IACjE,MAAM,gBAAgB,eAAe,aAAa,aAAa;AAAA,IAE/D,OAAO,gBAAgB;AAAA,IACvB,OAAO,MAAM;AAAA,SACR,OAAO;AAAA,MACV;AAAA,IACF;AAAA,IACA,WAAW,MAAM;AAAA,IACjB,KAAK,MAAM,SAAS,OAAO,WAAW,QAAQ,KAAK,IAAI,CAAC;AAAA;AAAA,OAGpD,KAAI,CAAC,QAKO;AAAA,IAChB,MAAM,SAAS,KAAK,mBAAmB,MAAM;AAAA,IAC7C,OAAO,QAAQ;AAAA,IACf,OAAO,UAAU,gBAAgB,OAAO,OAAO;AAAA,IAC/C,WAAW,MAAM;AAAA,IACjB,KAAK,MAAM,SAAS,OAAO,WAAW,QAAQ,KAAK,IAAI,CAAC;AAAA;AAAA,OAGpD,WAAU,CAAC,QAK8B;AAAA,IAC7C,qBAAqB,OAAO,SAAS,SAAS;AAAA,IAE9C,MAAM,SAAS,KAAK,MAAM,KAAgB,OAAO,WAAW,KAAK,SAAS,OAAO,KAAK;AAAA,IACtF,IAAI,CAAC,UAAU,OAAO,UAAU,UAAU;AAAA,MACxC,OAAO;AAAA,IACT;AAAA,IAEA,MAAM,MAAM,KAAK,IAAI;AAAA,IACrB,MAAM,YAAY,iBAAiB,MAAM;AAAA,IACzC,IAAI,OAAO,YAAY,OAAO,WAAW,cAAc,MAAM;AAAA,MAC3D,OAAO;AAAA,IACT;AAAA,IAEA,IAAI,aAAa,KAAK;AAAA,MACpB,OAAO;AAAA,IACT;AAAA,IAEA,MAAM,cAAc,IAAI,KAAK,MAAM,OAAO,OAAO;AAAA,IACjD,OAAO,iBAAiB,YAAY,YAAY;AAAA,IAChD,OAAO,gBAAgB,YAAY,QAAQ;AAAA,IAC3C,KAAK,MAAM,SAAS,OAAO,WAAW,QAAQ,GAAG;AAAA,IACjD,OAAO,kBAAkB,MAAM;AAAA;AAAA,EAGzB,kBAAkB,CAAC,QAIA;AAAA,IACzB,eAAe,OAAO,WAAW,WAAW;AAAA,IAC5C,eAAe,OAAO,OAAO,OAAO;AAAA,IACpC,eAAe,OAAO,SAAS,SAAS;AAAA,IAExC,MAAM,SAAS,KAAK,MAAM,KAAgB,OAAO,WAAW,KAAK,SAAS,OAAO,KAAK;AAAA,IAEtF,IAAI,CAAC,QAAQ;AAAA,MACX,MAAM,IAAI,YAAW,6BAA6B,OAAO,QAAQ;AAAA,IACnE;AAAA,IAEA,IAAI,OAAO,UAAU,UAAU;AAAA,MAC7B,MAAM,IAAI,YAAW,qBAAqB,OAAO,4BAA4B;AAAA,IAC/E;AAAA,IAEA,IAAI,OAAO,YAAY,OAAO,WAAW,CAAC,OAAO,gBAAgB;AAAA,MAC/D,MAAM,IAAI,YAAW,wCAAwC,OAAO,QAAQ;AAAA,IAC9E;AAAA,IAEA,MAAM,YAAY,iBAAiB,MAAM;AAAA,IACzC,IAAI,cAAc,QAAQ,aAAa,KAAK,IAAI,GAAG;AAAA,MACjD,MAAM,IAAI,YAAW,+BAA+B,OAAO,oBAAoB;AAAA,IACjF;AAAA,IAEA,OAAO;AAAA;AAEX;AAAA;AAEO,MAAM,gBAAiC;AAAA,EACnC,QAAQ;AAAA,EACA,QAAQ,IAAI;AAAA,EAEpB,WAAW,IAAI,cACtB,KAAK,OACL,WACF;AAAA,EACS,YAAY,IAAI,cACvB,KAAK,OACL,eACF;AAAA,EACS,cAAc,IAAI,cAGzB,KAAK,OAAO,iBAAiB;AAAA,EACtB,YAAY,IAAI,cACvB,KAAK,OACL,eACF;AAAA,EACS,UAAU,IAAI,cACrB,KAAK,OACL,aACF;AAAA,EACS,SAAS,IAAI,cACpB,KAAK,OACL,YACF;AAAA,EACS,gBAAgB,IAAI,cAC3B,KAAK,OACL,gBACF;AAAA,EAGA,MAAM,GAAkB;AAAA,IACtB,OAAO,QAAQ,QAAQ;AAAA;AAE3B;",
+  "debugId": "40F6801A008F592764756E2164756E21",
+  "names": []
+}