@sixb/core 0.1.16 → 0.1.17

package/dist/{chunk-hgqpcmyr.js → chunk-1hqwggsn.js}

@@ -132,6 +132,7 @@ function leaseExpiresAtMs(record) {
 function eligibleAt(record) {
   return Math.max(record.availableAtMs, record.leaseExpiryMs ?? -Infinity);
 }
+var MAX_TIMER_DELAY_MS = 2147483647;
 function toClaimedQueueJob(record) {
   if (!record.leaseId || !record.claimedAt || !record.leaseExpiresAt) {
     throw new QueueError2(`[Sixb] Queue job '${record.job.id}' is not currently leased`);
@@ -180,6 +181,24 @@ class InMemoryQueueStore {
       lane.ready.delete(record);
       lane.waiting.set(record);
     }
+    for (const wake of lane.waiters)
+      wake();
+  }
+  waitForWork(projectId, queueId, signal) {
+    const lane = this.lane(projectId, queueId);
+    const next = lane.waiting.peek();
+    const dueInMs = next ? eligibleAt(next) - Date.now() : MAX_TIMER_DELAY_MS;
+    return new Promise((resolve) => {
+      const timer = setTimeout(wake, Math.min(dueInMs, MAX_TIMER_DELAY_MS));
+      function wake() {
+        clearTimeout(timer);
+        lane.waiters.delete(wake);
+        signal.removeEventListener("abort", wake);
+        resolve();
+      }
+      lane.waiters.add(wake);
+      signal.addEventListener("abort", wake, { once: true });
+    });
   }
   takeReady(projectId, queueId, now, limit) {
     const lane = this.projects.get(projectId)?.get(queueId);
@@ -212,7 +231,8 @@ class InMemoryQueueStore {
       lane = {
         records: new Map,
         ready: new IndexedHeap(compareQueueRecords),
-        waiting: new IndexedHeap((left, right) => eligibleAt(left) - eligibleAt(right) || left.sequence - right.sequence)
+        waiting: new IndexedHeap((left, right) => eligibleAt(left) - eligibleAt(right) || left.sequence - right.sequence),
+        waiters: new Set
       };
       queues.set(queueId, lane);
     }
@@ -254,23 +274,31 @@ class InMemoryQueue {
     }
     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);
-    });
+    for (;; ) {
+      if (params.signal?.aborted)
+        return [];
+      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);
+      if (claimable.length === 0 && params.signal) {
+        await this.store.waitForWork(params.projectId, this.queueId, params.signal);
+        continue;
+      }
+      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);
@@ -356,4 +384,4 @@ class InMemoryQueues2 {
 }
 export { QueueError2, InMemoryQueues2 };
 
-//# debugId=50CDF8905DC39EBB64756E2164756E21
+//# debugId=5617F92D0BE33D5564756E2164756E21

package/dist/chunk-1hqwggsn.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  VectorIndexingQueueJob,\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\n// Largest delay `setTimeout` accepts; a waiting claim that wakes early just waits again.\nconst MAX_TIMER_DELAY_MS = 2_147_483_647\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  /** Wakes claims waiting on this lane. */\n  readonly waiters: Set<() => void>\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    // Any change can make a job claimable or move the next due time; waiters look again.\n    for (const wake of lane.waiters) wake()\n  }\n\n  /** Resolves when the lane changes, its next delayed job or lease comes due, or `signal` aborts. */\n  waitForWork(projectId: string, queueId: string, signal: AbortSignal): Promise<void> {\n    const lane = this.lane(projectId, queueId)\n    const next = lane.waiting.peek()\n    const dueInMs = next ? eligibleAt(next) - Date.now() : MAX_TIMER_DELAY_MS\n    return new Promise((resolve) => {\n      // Always armed: like a blocking read on a socket, a waiting claim keeps its process alive.\n      const timer = setTimeout(wake, Math.min(dueInMs, MAX_TIMER_DELAY_MS))\n      function wake(): void {\n        clearTimeout(timer)\n        lane.waiters.delete(wake)\n        signal.removeEventListener(\"abort\", wake)\n        resolve()\n      }\n      lane.waiters.add(wake)\n      signal.addEventListener(\"abort\", wake, { once: true })\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        waiters: new Set(),\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    signal?: AbortSignal\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    for (;;) {\n      if (params.signal?.aborted) return []\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      if (claimable.length === 0 && params.signal) {\n        await this.store.waitForWork(params.projectId, this.queueId, params.signal)\n        continue\n      }\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\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 vectorIndexing = new InMemoryQueue<\n    VectorIndexingQueueJob,\n    \"internal.unexpected\" | \"runtime.cancelled\"\n  >(this.store, \"vector.indexing\")\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;;;AD7BA,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;AAIzE,IAAM,qBAAqB;AAW3B,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,IAGzB,WAAW,QAAQ,KAAK;AAAA,MAAS,KAAK;AAAA;AAAA,EAIxC,WAAW,CAAC,WAAmB,SAAiB,QAAoC;AAAA,IAClF,MAAM,OAAO,KAAK,KAAK,WAAW,OAAO;AAAA,IACzC,MAAM,OAAO,KAAK,QAAQ,KAAK;AAAA,IAC/B,MAAM,UAAU,OAAO,WAAW,IAAI,IAAI,KAAK,IAAI,IAAI;AAAA,IACvD,OAAO,IAAI,QAAQ,CAAC,YAAY;AAAA,MAE9B,MAAM,QAAQ,WAAW,MAAM,KAAK,IAAI,SAAS,kBAAkB,CAAC;AAAA,MACpE,SAAS,IAAI,GAAS;AAAA,QACpB,aAAa,KAAK;AAAA,QAClB,KAAK,QAAQ,OAAO,IAAI;AAAA,QACxB,OAAO,oBAAoB,SAAS,IAAI;AAAA,QACxC,QAAQ;AAAA;AAAA,MAEV,KAAK,QAAQ,IAAI,IAAI;AAAA,MACrB,OAAO,iBAAiB,SAAS,MAAM,EAAE,MAAM,KAAK,CAAC;AAAA,KACtD;AAAA;AAAA,EAGH,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,QACA,SAAS,IAAI;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,QAMuC;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,UAAS;AAAA,MACP,IAAI,OAAO,QAAQ;AAAA,QAAS,OAAO,CAAC;AAAA,MACpC,MAAM,MAAM,KAAK,IAAI;AAAA,MACrB,MAAM,YAAY,IAAI,KAAK,GAAG,EAAE,YAAY;AAAA,MAE5C,MAAM,cAAc,IAAI,KAAK,MAAM,OAAO;AAAA,MAC1C,MAAM,iBAAiB,YAAY,YAAY;AAAA,MAC/C,MAAM,YAAY,KAAK,MAAM,UAAqB,OAAO,WAAW,KAAK,SAAS,KAAK,KAAK;AAAA,MAC5F,IAAI,UAAU,WAAW,KAAK,OAAO,QAAQ;AAAA,QAC3C,MAAM,KAAK,MAAM,YAAY,OAAO,WAAW,KAAK,SAAS,OAAO,MAAM;AAAA,QAC1E;AAAA,MACF;AAAA,MAEA,OAAO,UAAU,IAAI,CAAC,WAAW;AAAA,QAE/B,OAAO,MAAM;AAAA,aACR,OAAO;AAAA,UACV,SAAS,OAAO,IAAI,UAAU;AAAA,QAChC;AAAA,QACA,OAAO,UAAU,WAAW;AAAA,QAC5B,OAAO,YAAY;AAAA,QACnB,OAAO,iBAAiB;AAAA,QACxB,OAAO,gBAAgB,YAAY,QAAQ;AAAA,QAC3C,KAAK,MAAM,SAAS,OAAO,WAAW,QAAQ,GAAG;AAAA,QAEjD,OAAO,kBAAkB,MAAM;AAAA,OAChC;AAAA,IACH;AAAA;AAAA,OAGI,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,iBAAiB,IAAI,cAG5B,KAAK,OAAO,iBAAiB;AAAA,EACtB,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": "5617F92D0BE33D5564756E2164756E21",
+  "names": []
+}

package/dist/{chunk-zb47r1c8.js → chunk-23xs4qp9.js}

@@ -7,13 +7,13 @@ import {
   ConnectorError2,
   createConnectorCodedError,
   getConnectorExecutionSourceResolver
-} from "./chunk-nvymebc1.js";
+} from "./chunk-jnfxmr3f.js";
 import {
   isDatasetDefinition2
 } from "./chunk-cd234ba4.js";
 import {
   SyncValidationError2
-} from "./chunk-nkbev3tr.js";
+} from "./chunk-k4g51s47.js";
 import {
   isOAuthConnectorAdapter,
   isConnectorDefinition

package/dist/{chunk-gmdvns8f.js → chunk-2am3db31.js}

@@ -1,11 +1,11 @@
 // @bun
 import {
   assertValidSchema
-} from "./chunk-nj0020ay.js";
+} from "./chunk-jjrn5v0p.js";
 import {
   normalizeParams,
   coerceParamsToTyped
-} from "./chunk-qnd7ehe5.js";
+} from "./chunk-5thzcb8g.js";
 import {
   isPlainRecord
 } from "./chunk-wy0qdqfm.js";

package/dist/{chunk-fj1dvp37.js → chunk-2vhg6ysa.js}

@@ -4,7 +4,7 @@ import {
 } from "./chunk-6fsr7y93.js";
 import {
   aiLimitSubjectKey2
-} from "./chunk-jgwb25gc.js";
+} from "./chunk-4as3wt1c.js";
 
 // src/storage/ai-limits/enforcement.ts
 function aiLimitSubjectsFromAttribution2(requestedBy, requesterGroupIds) {

package/dist/{chunk-dp7yk20b.js → chunk-33saed7g.js}

@@ -1,7 +1,7 @@
 // @bun
 import {
   principalsEqual2
-} from "./chunk-2xvgy3x5.js";
+} from "./chunk-svabwqdq.js";
 import {
   createFileUploadId2,
   isFileUploadSessionExpired,

package/dist/{chunk-mdnw7nj8.js → chunk-3rrezgyc.js}

@@ -281,6 +281,15 @@ function cloneDatasetVersion(version) {
     createdAt: new Date(version.createdAt)
   };
 }
+function latestVersionSummary(version) {
+  return {
+    datasetId: version.datasetId,
+    versionId: version.versionId,
+    mode: version.mode,
+    createdAt: version.createdAt,
+    ...version.rowCount !== undefined ? { rowCount: version.rowCount } : {}
+  };
+}
 function cloneRow(row) {
   return structuredClone(row);
 }
@@ -420,6 +429,8 @@ class InMemoryLakeStorage2 {
   sequencesByVersionId = new Map;
   latestVersionIdByDataset = new Map;
   commitLocks = new Map;
+  commitPosition = 0;
+  commitPositionByDataset = new Map;
   async createDataset(definition) {
     assertDatasetId(definition.id);
     const existing = this.datasets.get(definition.id);
@@ -470,13 +481,7 @@ ${details}`);
       return {
         datasetId,
         materialized: true,
-        latestVersion: latest ? {
-          datasetId: latest.datasetId,
-          versionId: latest.versionId,
-          mode: latest.mode,
-          createdAt: latest.createdAt,
-          ...latest.rowCount !== undefined ? { rowCount: latest.rowCount } : {}
-        } : null
+        latestVersion: latest ? latestVersionSummary(latest) : null
       };
     }));
   }
@@ -520,6 +525,24 @@ ${details}`);
     }
     return this.getVersion(datasetId, latestVersionId);
   }
+  async listLatestVersionsSince(input) {
+    const cursor = String(this.commitPosition);
+    if (input.cursor === null)
+      return { cursor, versions: [] };
+    if (!/^\d+$/.test(input.cursor) || Number(input.cursor) > this.commitPosition)
+      return null;
+    const after = Number(input.cursor);
+    const datasetIds = input.datasetIds ? new Set(input.datasetIds) : null;
+    const versions = [];
+    for (const [datasetId, position] of this.commitPositionByDataset) {
+      if (position <= after || datasetIds && !datasetIds.has(datasetId))
+        continue;
+      const latest = await this.getLatestVersion(datasetId);
+      if (latest)
+        versions.push(latestVersionSummary(latest));
+    }
+    return { cursor, versions };
+  }
   async getVersion(datasetId, versionId) {
     const versions = this.versionsByDataset.get(datasetId) ?? [];
     const version = versions.find((candidate) => candidate.versionId === versionId);
@@ -673,6 +696,7 @@ ${details}`);
       this.versionsByDataset.set(options.merge.dataset.id, versions);
       this.rowsByVersionId.set(versionId, visibleRows.map((row) => cloneRow(row)));
       this.latestVersionIdByDataset.set(options.merge.dataset.id, versionId);
+      this.commitPositionByDataset.set(options.merge.dataset.id, ++this.commitPosition);
       if (ordered)
         this.sequencesByVersionId.set(versionId, ordered.states);
       return { outcome: "created", version: cloneDatasetVersion(version) };
@@ -717,6 +741,7 @@ ${details}`);
     this.versionsByDataset.set(options.write.dataset.id, versions);
     this.rowsByVersionId.set(versionId, visibleRows.map((row) => cloneRow(row)));
     this.latestVersionIdByDataset.set(options.write.dataset.id, versionId);
+    this.commitPositionByDataset.set(options.write.dataset.id, ++this.commitPosition);
     return { ...cloneDatasetVersion(version), outcome: "created" };
   }
   isUnchangedWrite(mode, latestVersion, rows, schema) {
@@ -787,4 +812,4 @@ ${details}`);
 }
 export { resolveDatasetChangeColumns2, planDatasetDefinitionUpdate2, mergeStrictDatasetDefinition2, assertLakeDatasetDefinitionsCompatible2, retryDatasetMergeCommit2, datasetSequenceChange2, reconcileDatasetSequences2, assertUnsequencedDatasetWrite2, hasDatasetInputChanges2, InMemoryLakeStorage2 };
 
-//# debugId=50E77B9D51AA9AC164756E2164756E21
+//# debugId=504A6D0F5F95C2B164756E2164756E21

package/dist/chunk-3rrezgyc.js.map

@@ -0,0 +1,15 @@
+{
+  "version": 3,
+  "sources": ["../src/lake-storage/changes.ts", "../src/lake-storage/definition-updates.ts", "../src/lake-storage/in-memory.ts", "../src/lake-storage/merge.ts", "../src/lake-storage/source-ordering.ts", "../src/lake-storage/version-inputs.ts"],
+  "sourcesContent": [
+    "import type { DatasetColumnDefinition } from \"../datasets\"\nimport { LakeStorageError } from \"./errors\"\nimport type { DatasetVersion, ReadDatasetChangesInput } from \"./types\"\n\n/** Shared eligibility checks for providers comparing pinned row images. */\nexport function resolveDatasetChangeColumns(\n  input: ReadDatasetChangesInput,\n  before: DatasetVersion | null,\n  after: DatasetVersion | null\n): readonly DatasetColumnDefinition[] | null {\n  for (const value of [input.datasetId, input.fromVersionId, input.toVersionId]) {\n    if (typeof value !== \"string\" || value.trim().length === 0) {\n      throw new LakeStorageError(\n        \"[LakeStorage] Change reads require explicit dataset and version ids.\"\n      )\n    }\n  }\n  if (\n    input.keyColumns.length === 0 ||\n    new Set(input.keyColumns).size !== input.keyColumns.length ||\n    input.columns.length === 0 ||\n    new Set(input.columns).size !== input.columns.length ||\n    input.columns.some((column) => typeof column !== \"string\" || column.length === 0) ||\n    input.keyColumns.some((column) => !input.columns.includes(column))\n  ) {\n    throw new LakeStorageError(\n      \"[LakeStorage] Change reads require distinct columns including every key column.\"\n    )\n  }\n  if (!before || !after) return null\n  const oldColumns = new Map(before.schema.columns.map((column) => [column.name, column]))\n  const newColumns = new Map(after.schema.columns.map((column) => [column.name, column]))\n  const columns: DatasetColumnDefinition[] = []\n  for (const name of input.columns) {\n    const previous = oldColumns.get(name)\n    const next = newColumns.get(name)\n    if (!previous || !next || previous.type !== next.type) return null\n    // Projection identities are nonblank strings. Other key types keep the full-read path.\n    if (input.keyColumns.includes(name) && next.type !== \"string\") return null\n    columns.push(next)\n  }\n  return columns\n}\n",
+    "import type { DatasetColumnDefinition, DatasetDefinition } from \"../datasets\"\nimport { assertDatasetDefinition } from \"../datasets/validation\"\nimport { LakeStorageError } from \"./errors\"\nimport type { LakeStorage } from \"./types\"\n\nexport type DatasetSchemaUpdatePlan =\n  | { readonly kind: \"none\" }\n  | {\n      readonly kind: \"addNullableColumns\"\n      readonly columns: readonly DatasetColumnDefinition[]\n    }\n\nexport interface DatasetMetadataUpdatePlan {\n  readonly descriptionChanged: boolean\n  readonly partitionByChanged: boolean\n}\n\nexport interface DatasetDefinitionUpdatePlan {\n  readonly existing: DatasetDefinition\n  readonly requested: DatasetDefinition\n  readonly definition: DatasetDefinition\n  readonly schema: DatasetSchemaUpdatePlan\n  readonly metadata: DatasetMetadataUpdatePlan\n  readonly changed: boolean\n}\n\nconst SCHEMA_UPDATE_V1_POLICY =\n  \"Dataset definition updates V1 support only adding nullable columns.\"\n\n/**\n * Build a provider-neutral update plan for two versions of the same dataset\n * definition. Core owns the definition diff; storage providers own how much of\n * the plan they can apply.\n */\nexport function planDatasetDefinitionUpdate(\n  existing: DatasetDefinition,\n  requested: DatasetDefinition\n): DatasetDefinitionUpdatePlan {\n  assertSameDataset(existing, requested)\n  assertDatasetDefinition(requested, (message) => new LakeStorageError(`[SixbLake] ${message}`))\n  if (existing.sequenceBy !== requested.sequenceBy) {\n    throw new LakeStorageError(\n      `[SixbLake] Dataset '${requested.id}' sequenceBy is immutable. Create a new dataset and backfill to adopt or change source ordering.`\n    )\n  }\n  assertPrimaryKeyUnchanged(existing, requested)\n\n  const addedColumns = getAddedColumnsAfterValidatingExistingColumns(existing, requested)\n  assertAddedColumnsAreNullable(requested.id, addedColumns)\n\n  const schema = toSchemaUpdatePlan(addedColumns)\n  const definition = mergeDatasetDefinition(existing, requested, addedColumns)\n  const metadata: DatasetMetadataUpdatePlan = {\n    descriptionChanged: existing.description !== definition.description,\n    partitionByChanged: !areStringArraysEqual(existing.partitionBy, definition.partitionBy),\n  }\n\n  return {\n    existing: structuredClone(existing),\n    requested: structuredClone(requested),\n    definition,\n    schema,\n    metadata,\n    changed: schema.kind !== \"none\" || metadata.descriptionChanged || metadata.partitionByChanged,\n  }\n}\n\n/**\n * Strict providers can use this helper when they do not support schema\n * evolution. Metadata-only compatible additions are still merged.\n */\nexport function mergeStrictDatasetDefinition(options: {\n  readonly existing?: DatasetDefinition | null\n  readonly next: DatasetDefinition\n}): DatasetDefinition {\n  assertDatasetDefinition(options.next, (message) => new LakeStorageError(`[SixbLake] ${message}`))\n  if (!options.existing) {\n    return structuredClone(options.next)\n  }\n\n  const plan = planDatasetDefinitionUpdate(options.existing, options.next)\n  if (plan.schema.kind !== \"none\") {\n    throw new LakeStorageError(\n      `[SixbLake] Dataset '${options.next.id}' cannot be redefined with an incompatible schema.`\n    )\n  }\n\n  return structuredClone(plan.definition)\n}\n\nexport interface AssertLakeDatasetDefinitionsCompatibleOptions {\n  readonly lakeStorage: LakeStorage\n  readonly definitions: readonly DatasetDefinition[]\n}\n\nexport async function assertLakeDatasetDefinitionsCompatible(\n  options: AssertLakeDatasetDefinitionsCompatibleOptions\n): Promise<void> {\n  await options.lakeStorage.assertDatasetDefinitionsCompatible(options.definitions)\n}\n\nfunction assertSameDataset(existing: DatasetDefinition, requested: DatasetDefinition): void {\n  if (existing.id !== requested.id) {\n    throw new LakeStorageError(\n      `[SixbLake] Cannot update dataset '${existing.id}' with definition for '${requested.id}'.`\n    )\n  }\n}\n\nfunction assertPrimaryKeyUnchanged(\n  existing: DatasetDefinition,\n  requested: DatasetDefinition\n): void {\n  const existingPrimaryKey = existing.primaryKey\n  const requestedPrimaryKey = requested.primaryKey\n  const unchanged =\n    existingPrimaryKey === undefined || requestedPrimaryKey === undefined\n      ? existingPrimaryKey === requestedPrimaryKey\n      : areDefinitionValuesEqual(existingPrimaryKey, requestedPrimaryKey)\n\n  if (!unchanged) {\n    throw new LakeStorageError(\n      `[SixbLake] Dataset '${requested.id}' cannot be redefined with an incompatible primaryKey. Primary keys are immutable.`\n    )\n  }\n}\n\nfunction getAddedColumnsAfterValidatingExistingColumns(\n  existing: DatasetDefinition,\n  requested: DatasetDefinition\n): readonly DatasetColumnDefinition[] {\n  const existingColumns = existing.schema.columns\n  const requestedColumnsByName = new Map(\n    requested.schema.columns.map((column) => [column.name, column])\n  )\n\n  // Existing columns are matched by name, not position. Developers can reorder\n  // declarations for readability without implying a storage-level schema change.\n  for (const existingColumn of existingColumns) {\n    const requestedColumn = requestedColumnsByName.get(existingColumn.name)\n    if (requestedColumn === undefined) {\n      throwUnsupportedSchemaUpdate(\n        requested.id,\n        `dropping column '${existingColumn.name}' is not supported`\n      )\n    }\n\n    assertExistingColumnUnchanged(requested.id, existingColumn, requestedColumn)\n  }\n\n  const existingColumnNames = new Set(existingColumns.map((column) => column.name))\n  return requested.schema.columns.filter((column) => !existingColumnNames.has(column.name))\n}\n\nfunction assertAddedColumnsAreNullable(\n  datasetId: string,\n  addedColumns: readonly DatasetColumnDefinition[]\n): void {\n  for (const column of addedColumns) {\n    // Existing rows have no value for a new column. Until DatasetDefinition\n    // supports defaults or backfills, only nullable columns are safe to add.\n    if (!isNullable(column)) {\n      throwUnsupportedSchemaUpdate(\n        datasetId,\n        `adding required column '${column.name}' is not supported`\n      )\n    }\n  }\n}\n\nfunction assertExistingColumnUnchanged(\n  datasetId: string,\n  existing: DatasetColumnDefinition,\n  requested: DatasetColumnDefinition\n): void {\n  if (existing.type !== requested.type) {\n    throwUnsupportedSchemaUpdate(\n      datasetId,\n      `changing column '${existing.name}' type from '${existing.type}' to '${requested.type}' is not supported`\n    )\n  }\n\n  if (isNullable(existing) !== isNullable(requested)) {\n    throwUnsupportedSchemaUpdate(\n      datasetId,\n      `changing column '${existing.name}' nullability is not supported`\n    )\n  }\n}\n\nfunction toSchemaUpdatePlan(\n  addedColumns: readonly DatasetColumnDefinition[]\n): DatasetSchemaUpdatePlan {\n  if (addedColumns.length === 0) {\n    return { kind: \"none\" }\n  }\n\n  return {\n    kind: \"addNullableColumns\",\n    columns: cloneColumns(addedColumns),\n  }\n}\n\nfunction mergeDatasetDefinition(\n  existing: DatasetDefinition,\n  requested: DatasetDefinition,\n  addedColumns: readonly DatasetColumnDefinition[]\n): DatasetDefinition {\n  assertCompatibleMetadataField(\n    requested.id,\n    \"description\",\n    existing.description,\n    requested.description\n  )\n  assertCompatibleMetadataField(\n    requested.id,\n    \"partitionBy\",\n    existing.partitionBy,\n    requested.partitionBy\n  )\n\n  const columns = [...cloneColumns(existing.schema.columns), ...cloneColumns(addedColumns)]\n  const primaryKey = existing.primaryKey\n  const partitionBy = requested.partitionBy ?? existing.partitionBy\n  const description = requested.description ?? existing.description\n\n  return {\n    kind: \"dataset\",\n    id: requested.id,\n    schema: { columns },\n    ...(primaryKey !== undefined ? { primaryKey: structuredClone(primaryKey) } : {}),\n    ...(existing.sequenceBy !== undefined ? { sequenceBy: existing.sequenceBy } : {}),\n    ...(partitionBy !== undefined ? { partitionBy: [...partitionBy] } : {}),\n    ...(description !== undefined ? { description } : {}),\n  }\n}\n\nfunction assertCompatibleMetadataField(\n  datasetId: string,\n  field: \"description\" | \"partitionBy\",\n  existing: string | readonly string[] | undefined,\n  requested: string | readonly string[] | undefined\n): void {\n  if (\n    existing === undefined ||\n    requested === undefined ||\n    areDefinitionValuesEqual(existing, requested)\n  ) {\n    return\n  }\n\n  throw new LakeStorageError(\n    `[SixbLake] Dataset '${datasetId}' cannot be redefined with an incompatible ${field}.`\n  )\n}\n\nfunction areStringArraysEqual(\n  left: readonly string[] | undefined,\n  right: readonly string[] | undefined\n): boolean {\n  if (left === undefined || right === undefined) {\n    return left === right\n  }\n\n  return left.length === right.length && left.every((value, index) => value === right[index])\n}\n\nfunction areDefinitionValuesEqual(\n  left: string | readonly string[],\n  right: string | readonly string[]\n): boolean {\n  if (typeof left === \"string\" || typeof right === \"string\") {\n    return left === right\n  }\n\n  return areStringArraysEqual(left, right)\n}\n\nfunction isNullable(column: DatasetColumnDefinition): boolean {\n  return column.nullable === true\n}\n\nfunction cloneColumns(\n  columns: readonly DatasetColumnDefinition[]\n): readonly DatasetColumnDefinition[] {\n  return columns.map((column) => ({ ...column }))\n}\n\nfunction throwUnsupportedSchemaUpdate(datasetId: string, detail: string): never {\n  throw new LakeStorageError(\n    `[SixbLake] Dataset '${datasetId}' cannot apply schema update because ${detail}. ${SCHEMA_UPDATE_V1_POLICY}`\n  )\n}\n",
+    "import { randomUUID } from \"node:crypto\"\nimport { isDeepStrictEqual } from \"node:util\"\nimport type { DatasetDefinition, DatasetSchema, MergeChange } from \"../datasets\"\nimport { getDatasetRowValidationFailure } from \"../datasets/validation\"\nimport { resolveDatasetChangeColumns } from \"./changes\"\nimport { mergeStrictDatasetDefinition } from \"./definition-updates\"\nimport { LakeConcurrencyError, LakeStorageError } from \"./errors\"\nimport type {\n  BeginDatasetMergeInput,\n  CommitDatasetMergeInput,\n  DatasetMergeCommitResult,\n  LakeMergeSession,\n} from \"./merge\"\nimport { retryDatasetMergeCommit } from \"./merge\"\nimport {\n  cloneDatasetMergeChange,\n  encodeDatasetPrimaryKey,\n  getDatasetMergeChangeValidationError,\n  getDatasetPrimaryKeyColumns,\n} from \"./merge-validation\"\nimport {\n  assertUnsequencedDatasetWrite,\n  type DatasetSequenceState,\n  datasetSequenceChange,\n  reconcileDatasetSequences,\n} from \"./source-ordering\"\nimport type {\n  BeginDatasetWriteInput,\n  CommitDatasetWriteInput,\n  DatasetCatalogState,\n  DatasetChanges,\n  DatasetLatestVersionSummary,\n  DatasetRow,\n  DatasetRowChange,\n  DatasetVersion,\n  DatasetWriteCommitResult,\n  DatasetWriteMode,\n  LakeStorage,\n  LakeWriteSession,\n  LatestVersionsSince,\n  ListLatestVersionsSinceInput,\n  ReadDatasetChangesInput,\n  ReadDatasetRowsInput,\n} from \"./types\"\nimport { hasDatasetInputChanges } from \"./version-inputs\"\n\nfunction cloneDatasetDefinition(definition: DatasetDefinition): DatasetDefinition {\n  return structuredClone(definition)\n}\n\nfunction cloneDatasetVersion(version: DatasetVersion): DatasetVersion {\n  return {\n    ...structuredClone(version),\n    createdAt: new Date(version.createdAt),\n  }\n}\n\nfunction latestVersionSummary(version: DatasetVersion): DatasetLatestVersionSummary {\n  return {\n    datasetId: version.datasetId,\n    versionId: version.versionId,\n    mode: version.mode,\n    createdAt: version.createdAt,\n    ...(version.rowCount !== undefined ? { rowCount: version.rowCount } : {}),\n  }\n}\n\nfunction cloneRow(row: DatasetRow): DatasetRow {\n  return structuredClone(row)\n}\n\nfunction selectColumns(row: DatasetRow, columns?: readonly string[]): DatasetRow {\n  if (!columns || columns.length === 0) {\n    return cloneRow(row)\n  }\n\n  const selected: Record<string, unknown> = {}\n  for (const column of columns) {\n    selected[column] = row[column]\n  }\n  return selected\n}\n\n// Canonical content key for unchanged-write detection. JSON.stringify\n// serializes Date values via toJSON, matching how rows persist as JSON;\n// missing and undefined nullable values normalize to null. The unchanged-write\n// semantics are pinned by the shared lake-storage contract suite.\nfunction rowContentKey(row: DatasetRow, schema: DatasetSchema): string {\n  return JSON.stringify(schema.columns.map((column) => row[column.name] ?? null))\n}\n\n// Order-insensitive multiset equality over canonical row keys.\nfunction sameRowContent(left: readonly string[], right: readonly string[]): boolean {\n  if (left.length !== right.length) {\n    return false\n  }\n\n  const sortedLeft = [...left].sort()\n  const sortedRight = [...right].sort()\n  return sortedLeft.every((key, index) => key === sortedRight[index])\n}\n\nfunction assertDatasetId(datasetId: string): void {\n  if (datasetId.trim().length === 0) {\n    throw new LakeStorageError(\"[LakeStorage] Dataset id must not be empty\")\n  }\n}\n\nfunction errorMessage(error: unknown): string {\n  return error instanceof Error ? error.message : String(error)\n}\n\nclass InMemoryLakeWriteSession implements LakeWriteSession {\n  private readonly rows: DatasetRow[] = []\n  private readonly primaryKeys = new Set<string>()\n  private closed = false\n\n  constructor(\n    private readonly storage: InMemoryLakeStorage,\n    private readonly input: BeginDatasetWriteInput\n  ) {}\n\n  async writeRows(rows: Iterable<DatasetRow> | AsyncIterable<DatasetRow>): Promise<void> {\n    this.assertOpen()\n\n    const stagedRows: DatasetRow[] = []\n    const stagedPrimaryKeys = new Set<string>()\n    for await (const row of rows) {\n      const validationError = getDatasetRowValidationFailure(row, this.input.dataset)\n      if (validationError) {\n        throw new LakeStorageError(`[LakeStorage] ${validationError.message}`, {\n          cause: validationError,\n        })\n      }\n\n      if (getDatasetPrimaryKeyColumns(this.input.dataset) !== null) {\n        const primaryKey = encodeDatasetPrimaryKey(this.input.dataset, row)\n        if (this.primaryKeys.has(primaryKey) || stagedPrimaryKeys.has(primaryKey)) {\n          throw new LakeStorageError(\n            `[LakeStorage] Dataset '${this.input.dataset.id}' write contains duplicate primary key ${primaryKey}.`\n          )\n        }\n        stagedPrimaryKeys.add(primaryKey)\n      }\n\n      stagedRows.push(cloneRow(row))\n    }\n\n    this.rows.push(...stagedRows)\n    for (const primaryKey of stagedPrimaryKeys) {\n      this.primaryKeys.add(primaryKey)\n    }\n  }\n\n  async commit(input?: CommitDatasetWriteInput): Promise<DatasetWriteCommitResult> {\n    this.assertOpen()\n    this.closed = true\n    return this.storage.commitWrite({\n      write: this.input,\n      rows: this.rows,\n      commit: input,\n    })\n  }\n\n  async abort(): Promise<void> {\n    this.closed = true\n    this.rows.length = 0\n  }\n\n  private assertOpen(): void {\n    if (this.closed) {\n      throw new LakeStorageError(\"[LakeStorage] Write session is already closed\")\n    }\n  }\n}\n\nclass InMemoryLakeMergeSession implements LakeMergeSession {\n  private readonly changes: MergeChange<DatasetRow, DatasetRow>[] = []\n  private closed = false\n\n  constructor(\n    private readonly storage: InMemoryLakeStorage,\n    private readonly input: BeginDatasetMergeInput,\n    private readonly baseVersionId: string | null\n  ) {}\n\n  async writeChanges(\n    changes:\n      | Iterable<MergeChange<DatasetRow, DatasetRow>>\n      | AsyncIterable<MergeChange<DatasetRow, DatasetRow>>\n  ): Promise<void> {\n    this.assertOpen()\n\n    const stagedChanges: MergeChange<DatasetRow, DatasetRow>[] = []\n    for await (const change of changes) {\n      const validationError = getDatasetMergeChangeValidationError(change, this.input.dataset)\n      if (validationError) {\n        throw new LakeStorageError(`[LakeStorage] ${validationError}`)\n      }\n      stagedChanges.push(cloneDatasetMergeChange(change))\n    }\n    this.changes.push(...stagedChanges)\n  }\n\n  async commit(input?: CommitDatasetMergeInput): Promise<DatasetMergeCommitResult> {\n    this.assertOpen()\n    this.closed = true\n    return retryDatasetMergeCommit(this.input, input, async (rebase) =>\n      this.storage.commitMerge({\n        merge: this.input,\n        baseVersionId: rebase\n          ? ((await this.storage.getLatestVersion(this.input.dataset.id))?.versionId ?? null)\n          : this.baseVersionId,\n        changes: this.changes,\n        commit: input,\n      })\n    )\n  }\n\n  async abort(): Promise<void> {\n    this.closed = true\n    this.changes.length = 0\n  }\n\n  private assertOpen(): void {\n    if (this.closed) {\n      throw new LakeStorageError(\"[LakeStorage] Merge session is already closed\")\n    }\n  }\n}\n\nexport class InMemoryLakeStorage implements LakeStorage {\n  private readonly datasets = new Map<string, DatasetDefinition>()\n  private readonly versionsByDataset = new Map<string, DatasetVersion[]>()\n  private readonly rowsByVersionId = new Map<string, readonly DatasetRow[]>()\n  private readonly sequencesByVersionId = new Map<string, Map<string, DatasetSequenceState>>()\n  private readonly latestVersionIdByDataset = new Map<string, string>()\n  private readonly commitLocks = new Map<string, Promise<void>>()\n  /** Commit counter for listLatestVersionsSince; each dataset keeps the position of its latest. */\n  private commitPosition = 0\n  private readonly commitPositionByDataset = new Map<string, number>()\n\n  async createDataset(definition: DatasetDefinition): Promise<DatasetDefinition> {\n    assertDatasetId(definition.id)\n    const existing = this.datasets.get(definition.id)\n    const stored = mergeStrictDatasetDefinition({\n      existing,\n      next: definition,\n    })\n    this.datasets.set(definition.id, stored)\n    return cloneDatasetDefinition(stored)\n  }\n\n  async assertDatasetDefinitionsCompatible(\n    definitions: readonly DatasetDefinition[]\n  ): Promise<void> {\n    const failures: string[] = []\n\n    for (const definition of definitions) {\n      try {\n        assertDatasetId(definition.id)\n        const existing = this.datasets.get(definition.id)\n        if (!existing) {\n          continue\n        }\n\n        mergeStrictDatasetDefinition({\n          existing,\n          next: definition,\n        })\n      } catch (error) {\n        failures.push(`- ${definition.id}: ${errorMessage(error)}`)\n      }\n    }\n\n    if (failures.length > 0) {\n      const details = failures.join(\"\\n\")\n      throw new LakeStorageError(\n        `[SixbLake] Lake dataset definition check failed for ${failures.length} dataset(s).\\n${details}`\n      )\n    }\n  }\n\n  async getDataset(datasetId: string): Promise<DatasetDefinition | null> {\n    const definition = this.datasets.get(datasetId)\n    return definition ? cloneDatasetDefinition(definition) : null\n  }\n\n  async listDatasets(): Promise<readonly DatasetDefinition[]> {\n    return [...this.datasets.values()].map((definition) => cloneDatasetDefinition(definition))\n  }\n\n  async listDatasetCatalogState(\n    datasetIds: readonly string[]\n  ): Promise<readonly DatasetCatalogState[]> {\n    return Promise.all(\n      datasetIds.map(async (datasetId) => {\n        if (!this.datasets.has(datasetId)) {\n          return { datasetId, materialized: false, latestVersion: null }\n        }\n\n        const latest = await this.getLatestVersion(datasetId)\n        return {\n          datasetId,\n          materialized: true,\n          latestVersion: latest ? latestVersionSummary(latest) : null,\n        }\n      })\n    )\n  }\n\n  async listVersions(datasetId: string, limit?: number): Promise<readonly DatasetVersion[]> {\n    const versions = [...(this.versionsByDataset.get(datasetId) ?? [])]\n      .sort((left, right) => right.createdAt.getTime() - left.createdAt.getTime())\n      .map((version) => cloneDatasetVersion(version))\n\n    return limit === undefined ? versions : versions.slice(0, Math.max(0, limit))\n  }\n\n  async beginWrite(input: BeginDatasetWriteInput): Promise<LakeWriteSession> {\n    const definition = await this.getDataset(input.dataset.id)\n    if (!definition) {\n      throw new LakeStorageError(`[LakeStorage] Unknown dataset '${input.dataset.id}'`)\n    }\n\n    assertUnsequencedDatasetWrite(definition)\n    return new InMemoryLakeWriteSession(this, {\n      ...input,\n      dataset: definition,\n      mode: input.mode ?? \"snapshot\",\n    })\n  }\n\n  async beginMerge(input: BeginDatasetMergeInput): Promise<LakeMergeSession> {\n    const definition = await this.getDataset(input.dataset.id)\n    if (!definition) {\n      throw new LakeStorageError(`[LakeStorage] Unknown dataset '${input.dataset.id}'`)\n    }\n    if (getDatasetPrimaryKeyColumns(definition) === null) {\n      throw new LakeStorageError(\n        `[LakeStorage] Dataset '${definition.id}' must define a primaryKey before it can be merged.`\n      )\n    }\n\n    const latestVersion = await this.getLatestVersion(definition.id)\n    if (\n      input.expectedLatestVersionId !== undefined &&\n      latestVersion?.versionId !== input.expectedLatestVersionId\n    ) {\n      throw new LakeConcurrencyError(\n        `[LakeStorage] Optimistic merge start failed for dataset '${definition.id}': expected latest version '${input.expectedLatestVersionId}', found '${latestVersion?.versionId ?? \"none\"}'`\n      )\n    }\n    return new InMemoryLakeMergeSession(\n      this,\n      {\n        ...input,\n        dataset: definition,\n      },\n      latestVersion?.versionId ?? null\n    )\n  }\n\n  async getLatestVersion(datasetId: string): Promise<DatasetVersion | null> {\n    const latestVersionId = this.latestVersionIdByDataset.get(datasetId)\n    if (!latestVersionId) {\n      return null\n    }\n\n    return this.getVersion(datasetId, latestVersionId)\n  }\n\n  async listLatestVersionsSince(\n    input: ListLatestVersionsSinceInput\n  ): Promise<LatestVersionsSince | null> {\n    const cursor = String(this.commitPosition)\n    if (input.cursor === null) return { cursor, versions: [] }\n    if (!/^\\d+$/.test(input.cursor) || Number(input.cursor) > this.commitPosition) return null\n\n    const after = Number(input.cursor)\n    const datasetIds = input.datasetIds ? new Set(input.datasetIds) : null\n    const versions: DatasetLatestVersionSummary[] = []\n    for (const [datasetId, position] of this.commitPositionByDataset) {\n      if (position <= after || (datasetIds && !datasetIds.has(datasetId))) continue\n      // This provider never commits schema-only versions, so the latest version carries data.\n      const latest = await this.getLatestVersion(datasetId)\n      if (latest) versions.push(latestVersionSummary(latest))\n    }\n    return { cursor, versions }\n  }\n\n  async getVersion(datasetId: string, versionId: string): Promise<DatasetVersion | null> {\n    const versions = this.versionsByDataset.get(datasetId) ?? []\n    const version = versions.find((candidate) => candidate.versionId === versionId)\n    return version ? cloneDatasetVersion(version) : null\n  }\n\n  async *readRows(input: ReadDatasetRowsInput): AsyncIterable<DatasetRow> {\n    input.signal?.throwIfAborted()\n    const definition = this.datasets.get(input.datasetId)\n    if (!definition) {\n      throw new LakeStorageError(`[LakeStorage] Unknown dataset '${input.datasetId}'`)\n    }\n\n    const version =\n      input.versionId === undefined\n        ? await this.getLatestVersion(input.datasetId)\n        : await this.getVersion(input.datasetId, input.versionId)\n\n    if (!version) {\n      throw new LakeStorageError(\n        `[LakeStorage] No committed version found for dataset '${input.datasetId}'`\n      )\n    }\n\n    const offset = Math.max(0, input.offset ?? 0)\n    const limit = input.limit === undefined ? undefined : Math.max(0, input.limit)\n    const rows = this.rowsByVersionId\n      .get(version.versionId)\n      ?.slice(offset, limit === undefined ? undefined : offset + limit)\n\n    for (const row of rows ?? []) {\n      input.signal?.throwIfAborted()\n      yield selectColumns(row, input.columns)\n    }\n  }\n\n  async readChanges(input: ReadDatasetChangesInput): Promise<DatasetChanges | null> {\n    input.signal?.throwIfAborted()\n    const before = await this.getVersion(input.datasetId, input.fromVersionId)\n    const after = await this.getVersion(input.datasetId, input.toVersionId)\n    if (!resolveDatasetChangeColumns(input, before, after)) return null\n    const previous = this.rowsByVersionId.get(input.fromVersionId)!\n    const next = this.rowsByVersionId.get(input.toVersionId)!\n    const index = (rows: readonly DatasetRow[]) => {\n      const result = new Map<string, DatasetRow>()\n      for (const row of rows) {\n        input.signal?.throwIfAborted()\n        const values = input.keyColumns.map((column) => row[column])\n        if (values.some((value) => typeof value !== \"string\" || value.trim().length === 0))\n          return null\n        const key = JSON.stringify(values)\n        if (result.has(key)) return null\n        result.set(key, row)\n      }\n      return result\n    }\n    const oldRows = index(previous)\n    const newRows = index(next)\n    if (!oldRows || !newRows) return null\n    let pending: DatasetRowChange[] = []\n    for (const [key, row] of oldRows) {\n      const newRow = newRows.get(key)\n      if (\n        !newRow ||\n        input.columns.some(\n          (column) => !isDeepStrictEqual(row[column] ?? null, newRow[column] ?? null)\n        )\n      ) {\n        pending.push({\n          before: selectColumns(row, input.columns),\n          after: newRow ? selectColumns(newRow, input.columns) : null,\n        })\n      }\n    }\n    for (const [key, row] of newRows) {\n      if (!oldRows.has(key))\n        pending.push({ before: null, after: selectColumns(row, input.columns) })\n    }\n    let closed = false\n    const changeCount = pending.length\n    return {\n      fromRowCount: previous.length,\n      toRowCount: next.length,\n      changeCount,\n      changes: (async function* () {\n        if (closed) throw new LakeStorageError(\"[LakeStorage] Change reader is closed.\")\n        try {\n          for (let i = 0; i < changeCount; i++) {\n            input.signal?.throwIfAborted()\n            if (closed) throw new LakeStorageError(\"[LakeStorage] Change reader is closed.\")\n            yield structuredClone(pending[i]!)\n          }\n        } finally {\n          closed = true\n          pending = []\n        }\n      })(),\n      async close() {\n        closed = true\n        pending = []\n      },\n    }\n  }\n\n  async commitWrite(options: {\n    write: BeginDatasetWriteInput\n    rows: readonly DatasetRow[]\n    commit?: CommitDatasetWriteInput\n  }): Promise<DatasetWriteCommitResult> {\n    return this.withDatasetCommitLock(options.write.dataset.id, () =>\n      this.commitWriteUnlocked(options)\n    )\n  }\n\n  async commitMerge(options: {\n    merge: BeginDatasetMergeInput\n    baseVersionId: string | null\n    changes: readonly MergeChange<DatasetRow, DatasetRow>[]\n    commit?: CommitDatasetMergeInput\n  }): Promise<DatasetMergeCommitResult> {\n    return this.withDatasetCommitLock(options.merge.dataset.id, async () => {\n      const definition = this.datasets.get(options.merge.dataset.id)\n      if (!definition) {\n        throw new LakeStorageError(`[LakeStorage] Unknown dataset '${options.merge.dataset.id}'`)\n      }\n\n      const latestVersion = await this.getLatestVersion(options.merge.dataset.id)\n      options.commit?.signal?.throwIfAborted()\n      const actualVersionId = latestVersion?.versionId ?? null\n      if (actualVersionId !== options.baseVersionId) {\n        throw new LakeConcurrencyError(\n          `[LakeStorage] Optimistic merge commit failed for dataset '${options.merge.dataset.id}': expected latest version '${options.baseVersionId ?? \"none\"}', found '${actualVersionId ?? \"none\"}'`\n        )\n      }\n\n      const previousRows = this.rowsByVersionId.get(latestVersion?.versionId ?? \"\") ?? []\n      const previousByKey = this.rowsByPrimaryKey(previousRows, definition)\n      const finalChanges = new Map<string, MergeChange<DatasetRow, DatasetRow>>()\n      const ordered =\n        definition.sequenceBy === undefined\n          ? undefined\n          : reconcileDatasetSequences(\n              definition,\n              this.sequencesByVersionId.get(actualVersionId ?? \"\") ?? new Map(),\n              options.changes.map((change) => datasetSequenceChange(definition, change))\n            )\n      if (ordered) {\n        for (const [key, index] of ordered.accepted) finalChanges.set(key, options.changes[index]!)\n      } else {\n        for (const change of options.changes) {\n          const value = change.kind === \"upsert\" ? change.row : change.key\n          finalChanges.set(encodeDatasetPrimaryKey(definition, value), change)\n        }\n      }\n\n      const nextByKey = new Map(previousByKey)\n      for (const [primaryKey, change] of finalChanges) {\n        if (change.kind === \"upsert\") {\n          nextByKey.set(primaryKey, cloneRow(change.row))\n        } else {\n          nextByKey.delete(primaryKey)\n        }\n      }\n\n      const createInitialVersion = options.commit?.createInitialVersion && latestVersion === null\n      if (\n        !createInitialVersion &&\n        (ordered\n          ? ordered.accepted.size === 0\n          : this.sameKeyedRowContent(previousByKey, nextByKey, definition.schema))\n      ) {\n        return {\n          outcome: \"unchanged\",\n          version: latestVersion ? cloneDatasetVersion(latestVersion) : null,\n        }\n      }\n\n      const visibleRows = [...nextByKey.values()]\n      const versionId = `ver_${randomUUID()}`\n      const version: DatasetVersion = {\n        datasetId: options.merge.dataset.id,\n        versionId,\n        parentVersionId: latestVersion?.versionId,\n        mode: \"merge\",\n        createdAt: new Date(),\n        schema: definition.schema,\n        producer: options.merge.producer ? structuredClone(options.merge.producer) : undefined,\n        inputs: options.merge.inputs ? structuredClone(options.merge.inputs) : undefined,\n        rowCount: visibleRows.length,\n        sizeBytes: new TextEncoder().encode(\n          visibleRows.map((row) => JSON.stringify(row)).join(\"\\n\")\n        ).byteLength,\n      }\n\n      const versions = this.versionsByDataset.get(options.merge.dataset.id) ?? []\n      versions.push(version)\n      this.versionsByDataset.set(options.merge.dataset.id, versions)\n      this.rowsByVersionId.set(\n        versionId,\n        visibleRows.map((row) => cloneRow(row))\n      )\n      this.latestVersionIdByDataset.set(options.merge.dataset.id, versionId)\n      this.commitPositionByDataset.set(options.merge.dataset.id, ++this.commitPosition)\n      if (ordered) this.sequencesByVersionId.set(versionId, ordered.states)\n\n      return { outcome: \"created\", version: cloneDatasetVersion(version) }\n    })\n  }\n\n  private async commitWriteUnlocked(options: {\n    write: BeginDatasetWriteInput\n    rows: readonly DatasetRow[]\n    commit?: CommitDatasetWriteInput\n  }): Promise<DatasetWriteCommitResult> {\n    const definition = this.datasets.get(options.write.dataset.id)\n    if (!definition) {\n      throw new LakeStorageError(`[LakeStorage] Unknown dataset '${options.write.dataset.id}'`)\n    }\n\n    const mode = options.write.mode ?? \"snapshot\"\n    assertUnsequencedDatasetWrite(definition)\n    const latestVersion = await this.getLatestVersion(options.write.dataset.id)\n\n    if (options.commit?.expectedLatestVersionId !== undefined) {\n      const actual = latestVersion?.versionId ?? null\n      if (actual !== options.commit.expectedLatestVersionId) {\n        throw new LakeConcurrencyError(\n          `[LakeStorage] Optimistic commit failed for dataset '${options.write.dataset.id}': expected latest version '${options.commit.expectedLatestVersionId ?? \"none\"}', found '${actual ?? \"none\"}'`\n        )\n      }\n    }\n\n    this.assertKeyedWriteIsUnique(mode, options.rows, latestVersion, definition)\n\n    // Content-identical snapshots and empty appends reuse the latest version\n    // unless explicitly supplied input lineage has changed.\n    if (\n      latestVersion &&\n      !hasDatasetInputChanges(latestVersion.inputs, options.write.inputs) &&\n      this.isUnchangedWrite(mode, latestVersion, options.rows, definition.schema)\n    ) {\n      return { ...latestVersion, outcome: \"unchanged\" }\n    }\n\n    const versionId = `ver_${randomUUID()}`\n    const visibleRows =\n      mode === \"append\"\n        ? [...(this.rowsByVersionId.get(latestVersion?.versionId ?? \"\") ?? []), ...options.rows]\n        : [...options.rows]\n\n    const sizeBytes = new TextEncoder().encode(\n      visibleRows.map((row) => JSON.stringify(row)).join(\"\\n\")\n    ).byteLength\n\n    const version: DatasetVersion = {\n      datasetId: options.write.dataset.id,\n      versionId,\n      parentVersionId: mode === \"append\" ? latestVersion?.versionId : undefined,\n      mode,\n      createdAt: new Date(),\n      schema: definition.schema,\n      producer: options.write.producer ? structuredClone(options.write.producer) : undefined,\n      inputs: options.write.inputs ? structuredClone(options.write.inputs) : undefined,\n      rowCount: visibleRows.length,\n      sizeBytes,\n    }\n\n    const versions = this.versionsByDataset.get(options.write.dataset.id) ?? []\n    versions.push(version)\n    this.versionsByDataset.set(options.write.dataset.id, versions)\n    this.rowsByVersionId.set(\n      versionId,\n      visibleRows.map((row) => cloneRow(row))\n    )\n    this.latestVersionIdByDataset.set(options.write.dataset.id, versionId)\n    this.commitPositionByDataset.set(options.write.dataset.id, ++this.commitPosition)\n\n    return { ...cloneDatasetVersion(version), outcome: \"created\" }\n  }\n\n  private isUnchangedWrite(\n    mode: DatasetWriteMode,\n    latestVersion: DatasetVersion,\n    rows: readonly DatasetRow[],\n    schema: DatasetSchema\n  ): boolean {\n    if (mode === \"append\") {\n      return rows.length === 0\n    }\n\n    const previousRows = this.rowsByVersionId.get(latestVersion.versionId) ?? []\n    return sameRowContent(\n      rows.map((row) => rowContentKey(row, schema)),\n      previousRows.map((row) => rowContentKey(row, schema))\n    )\n  }\n\n  private assertKeyedWriteIsUnique(\n    mode: DatasetWriteMode,\n    rows: readonly DatasetRow[],\n    latestVersion: DatasetVersion | null,\n    definition: DatasetDefinition\n  ): void {\n    if (getDatasetPrimaryKeyColumns(definition) === null) {\n      return\n    }\n\n    const stagedByKey = this.rowsByPrimaryKey(rows, definition)\n    if (mode !== \"append\" || latestVersion === null) {\n      return\n    }\n\n    const previousRows = this.rowsByVersionId.get(latestVersion.versionId) ?? []\n    const previousByKey = this.rowsByPrimaryKey(previousRows, definition)\n    for (const primaryKey of stagedByKey.keys()) {\n      if (previousByKey.has(primaryKey)) {\n        throw new LakeStorageError(\n          `[LakeStorage] Dataset '${definition.id}' append contains duplicate primary key ${primaryKey}.`\n        )\n      }\n    }\n  }\n\n  private rowsByPrimaryKey(\n    rows: readonly DatasetRow[],\n    definition: DatasetDefinition\n  ): Map<string, DatasetRow> {\n    const byKey = new Map<string, DatasetRow>()\n    for (const row of rows) {\n      const primaryKey = encodeDatasetPrimaryKey(definition, row)\n      if (byKey.has(primaryKey)) {\n        throw new LakeStorageError(\n          `[LakeStorage] Dataset '${definition.id}' contains duplicate primary key ${primaryKey}.`\n        )\n      }\n      byKey.set(primaryKey, row)\n    }\n    return byKey\n  }\n\n  private sameKeyedRowContent(\n    left: ReadonlyMap<string, DatasetRow>,\n    right: ReadonlyMap<string, DatasetRow>,\n    schema: DatasetSchema\n  ): boolean {\n    if (left.size !== right.size) {\n      return false\n    }\n    for (const [primaryKey, leftRow] of left) {\n      const rightRow = right.get(primaryKey)\n      if (\n        rightRow === undefined ||\n        rowContentKey(leftRow, schema) !== rowContentKey(rightRow, schema)\n      ) {\n        return false\n      }\n    }\n    return true\n  }\n\n  private async withDatasetCommitLock<T>(datasetId: string, run: () => Promise<T>): Promise<T> {\n    const previous = this.commitLocks.get(datasetId) ?? Promise.resolve()\n    const ready = previous.catch(() => {})\n    let release!: () => void\n    const next = new Promise<void>((resolve) => {\n      release = resolve\n    })\n    const current = ready.then(() => next)\n    this.commitLocks.set(datasetId, current)\n\n    await ready\n    try {\n      return await run()\n    } finally {\n      release()\n      if (this.commitLocks.get(datasetId) === current) {\n        this.commitLocks.delete(datasetId)\n      }\n    }\n  }\n}\n",
+    "import type { DatasetDefinition, MergeChange } from \"../datasets\"\nimport { LakeConcurrencyError } from \"./errors\"\nimport type { DatasetProducer, DatasetRow, DatasetVersion, DatasetVersionRef } from \"./types\"\n\nexport interface BeginDatasetMergeInput {\n  /** Stored definition for the keyed dataset whose latest version is captured by `beginMerge`. */\n  readonly dataset: DatasetDefinition\n  /** Optional caller guard checked against the same latest version captured by the session. */\n  readonly expectedLatestVersionId?: string\n  readonly producer?: DatasetProducer\n  readonly inputs?: readonly DatasetVersionRef[]\n}\n\nexport interface CommitDatasetMergeInput {\n  readonly commitMessage?: string\n  /** Create an addressable first version even without changes; reuse an existing version on no-op. */\n  readonly createInitialVersion?: boolean\n  /** Retry sequenced merges up to three times total; ignored when an explicit version guard is set. */\n  readonly retryOnConflict?: boolean\n  /** Checked before each attempt; a durable commit is never cancelled retroactively. */\n  readonly signal?: AbortSignal\n}\n\n/** Providers retain their staging session throughout this bounded commit loop. */\nexport async function retryDatasetMergeCommit(\n  merge: BeginDatasetMergeInput,\n  commit: CommitDatasetMergeInput | undefined,\n  run: (rebase: boolean) => Promise<DatasetMergeCommitResult>\n): Promise<DatasetMergeCommitResult> {\n  const attempts =\n    commit?.retryOnConflict &&\n    merge.dataset.sequenceBy !== undefined &&\n    merge.expectedLatestVersionId === undefined\n      ? 3\n      : 1\n  for (let attempt = 0; ; attempt += 1) {\n    commit?.signal?.throwIfAborted()\n    try {\n      return await run(attempt > 0)\n    } catch (error) {\n      if (!(error instanceof LakeConcurrencyError) || attempts === 1) throw error\n      if (attempt + 1 === attempts) {\n        throw new LakeConcurrencyError(\n          `[SixbLake] Dataset '${merge.dataset.id}' merge exhausted ${attempts} concurrency attempts. No changes from this operation were committed.`,\n          { cause: error }\n        )\n      }\n    }\n  }\n}\n\n/**\n * A merge can be unchanged before the dataset has a first version, so its result carries the\n * version separately instead of extending `DatasetVersion` like ordinary write commits do.\n */\nexport type DatasetMergeCommitResult =\n  | { readonly outcome: \"created\"; readonly version: DatasetVersion }\n  | { readonly outcome: \"unchanged\"; readonly version: DatasetVersion | null }\n\nexport interface LakeMergeSession {\n  /**\n   * Stage ordered complete-row upserts and exact primary-key deletes. With sequenceBy, deletes\n   * require a sequence, stale changes are ignored, and conflicting ties abort the whole merge.\n   */\n  writeChanges(\n    changes:\n      | Iterable<MergeChange<DatasetRow, DatasetRow>>\n      | AsyncIterable<MergeChange<DatasetRow, DatasetRow>>\n  ): Promise<void>\n  /** Commit against the captured version; opt-in retries rebase sequenced changes on a fresh head. */\n  commit(input?: CommitDatasetMergeInput): Promise<DatasetMergeCommitResult>\n  abort(): Promise<void>\n}\n",
+    "import { createHash } from \"node:crypto\"\nimport type { DatasetDefinition, MergeChange } from \"../datasets\"\nimport { datasetSequenceValue } from \"../datasets/sequence\"\nimport { stableJsonStringify } from \"../json\"\nimport { normalizeDecimalValue } from \"../ontology/decimal\"\nimport { LakeStorageError } from \"./errors\"\nimport { encodeDatasetPrimaryKey } from \"./merge-validation\"\nimport type { DatasetRow } from \"./types\"\n\n/** Current source revision; a null content digest is a deletion tombstone. */\nexport interface DatasetSequenceState {\n  readonly sequence: string\n  readonly content: string | null\n}\n\nexport interface DatasetSequenceChange extends DatasetSequenceState {\n  readonly key: string\n}\n\nexport function datasetSequenceChange(\n  dataset: DatasetDefinition,\n  change: MergeChange<DatasetRow, DatasetRow>\n): DatasetSequenceChange {\n  const value = change.kind === \"upsert\" ? change.row[dataset.sequenceBy ?? \"\"] : change.sequence\n  return {\n    key: encodeDatasetPrimaryKey(dataset, change.kind === \"upsert\" ? change.row : change.key),\n    sequence: datasetSequenceValue(dataset, value).toString(),\n    content: change.kind === \"delete\" ? null : rowDigest(dataset, change.row),\n  }\n}\n\n/** Process in submission order against a private copy; conflicts publish no partial state. */\nexport function reconcileDatasetSequences(\n  dataset: DatasetDefinition,\n  previous: ReadonlyMap<string, DatasetSequenceState>,\n  changes: readonly DatasetSequenceChange[]\n): { states: Map<string, DatasetSequenceState>; accepted: Map<string, number> } {\n  const states = new Map(previous)\n  const accepted = new Map<string, number>()\n  for (const [index, change] of changes.entries()) {\n    const current = states.get(change.key)\n    if (current) {\n      const difference = BigInt(change.sequence) - BigInt(current.sequence)\n      if (difference < 0n) continue\n      if (difference === 0n) {\n        if (current.content !== change.content) {\n          throw new LakeStorageError(\n            `[SixbLake] Dataset '${dataset.id}' has conflicting content at source sequence '${change.sequence}' for key ${change.key}.`\n          )\n        }\n        continue\n      }\n    }\n    states.set(change.key, { sequence: change.sequence, content: change.content })\n    accepted.set(change.key, index)\n  }\n  return { states, accepted }\n}\n\nfunction rowDigest(dataset: DatasetDefinition, row: DatasetRow): string {\n  const content: Record<string, unknown> = Object.create(null)\n  for (const column of dataset.schema.columns) {\n    const value = row[column.name]\n    // Nullable additions and omitted/undefined/null values have identical content.\n    if (value == null) continue\n    switch (column.type) {\n      case \"int64\":\n        content[column.name] = BigInt(value as string | number).toString()\n        break\n      case \"timestamp\":\n        content[column.name] = new Date(value as string | Date).toISOString()\n        break\n      case \"date\":\n        content[column.name] = new Date(value as string | Date).toISOString().slice(0, 10)\n        break\n      case \"decimal\":\n        content[column.name] = normalizeDecimalValue(value as string)\n        break\n      default:\n        content[column.name] = value\n    }\n  }\n  return createHash(\"sha256\")\n    .update(stableJsonStringify(JSON.parse(JSON.stringify(content))))\n    .digest(\"hex\")\n}\n\n/** Until row reconciliation is supported, replacement writes must not erase source history. */\nexport function assertUnsequencedDatasetWrite(dataset: DatasetDefinition): void {\n  if (dataset.sequenceBy !== undefined) {\n    throw new LakeStorageError(\n      `[SixbLake] Dataset '${dataset.id}' declares sequenceBy; use beginMerge with source-ordered changes.`\n    )\n  }\n}\n",
+    "import type { DatasetVersionRef } from \"./types\"\n\n/** Input lineage participates in write identity when the caller supplies it. */\nexport function hasDatasetInputChanges(\n  previous: readonly DatasetVersionRef[] | undefined,\n  next: readonly DatasetVersionRef[] | undefined\n): boolean {\n  if (next === undefined) return false\n  const keys = (refs: readonly DatasetVersionRef[]) =>\n    new Set(refs.map((ref) => JSON.stringify([ref.datasetId, ref.versionId])))\n  const before = keys(previous ?? [])\n  const after = keys(next)\n  return before.size !== after.size || [...after].some((key) => !before.has(key))\n}\n"
+  ],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;AAKO,SAAS,4BAA2B,CACzC,OACA,QACA,OAC2C;AAAA,EAC3C,WAAW,SAAS,CAAC,MAAM,WAAW,MAAM,eAAe,MAAM,WAAW,GAAG;AAAA,IAC7E,IAAI,OAAO,UAAU,YAAY,MAAM,KAAK,EAAE,WAAW,GAAG;AAAA,MAC1D,MAAM,IAAI,kBACR,sEACF;AAAA,IACF;AAAA,EACF;AAAA,EACA,IACE,MAAM,WAAW,WAAW,KAC5B,IAAI,IAAI,MAAM,UAAU,EAAE,SAAS,MAAM,WAAW,UACpD,MAAM,QAAQ,WAAW,KACzB,IAAI,IAAI,MAAM,OAAO,EAAE,SAAS,MAAM,QAAQ,UAC9C,MAAM,QAAQ,KAAK,CAAC,WAAW,OAAO,WAAW,YAAY,OAAO,WAAW,CAAC,KAChF,MAAM,WAAW,KAAK,CAAC,WAAW,CAAC,MAAM,QAAQ,SAAS,MAAM,CAAC,GACjE;AAAA,IACA,MAAM,IAAI,kBACR,iFACF;AAAA,EACF;AAAA,EACA,IAAI,CAAC,UAAU,CAAC;AAAA,IAAO,OAAO;AAAA,EAC9B,MAAM,aAAa,IAAI,IAAI,OAAO,OAAO,QAAQ,IAAI,CAAC,WAAW,CAAC,OAAO,MAAM,MAAM,CAAC,CAAC;AAAA,EACvF,MAAM,aAAa,IAAI,IAAI,MAAM,OAAO,QAAQ,IAAI,CAAC,WAAW,CAAC,OAAO,MAAM,MAAM,CAAC,CAAC;AAAA,EACtF,MAAM,UAAqC,CAAC;AAAA,EAC5C,WAAW,QAAQ,MAAM,SAAS;AAAA,IAChC,MAAM,WAAW,WAAW,IAAI,IAAI;AAAA,IACpC,MAAM,OAAO,WAAW,IAAI,IAAI;AAAA,IAChC,IAAI,CAAC,YAAY,CAAC,QAAQ,SAAS,SAAS,KAAK;AAAA,MAAM,OAAO;AAAA,IAE9D,IAAI,MAAM,WAAW,SAAS,IAAI,KAAK,KAAK,SAAS;AAAA,MAAU,OAAO;AAAA,IACtE,QAAQ,KAAK,IAAI;AAAA,EACnB;AAAA,EACA,OAAO;AAAA;;ACfT,IAAM,0BACJ;AAOK,SAAS,4BAA2B,CACzC,UACA,WAC6B;AAAA,EAC7B,kBAAkB,UAAU,SAAS;AAAA,EACrC,yBAAwB,WAAW,CAAC,YAAY,IAAI,kBAAiB,cAAc,SAAS,CAAC;AAAA,EAC7F,IAAI,SAAS,eAAe,UAAU,YAAY;AAAA,IAChD,MAAM,IAAI,kBACR,uBAAuB,UAAU,oGACnC;AAAA,EACF;AAAA,EACA,0BAA0B,UAAU,SAAS;AAAA,EAE7C,MAAM,eAAe,8CAA8C,UAAU,SAAS;AAAA,EACtF,8BAA8B,UAAU,IAAI,YAAY;AAAA,EAExD,MAAM,SAAS,mBAAmB,YAAY;AAAA,EAC9C,MAAM,aAAa,uBAAuB,UAAU,WAAW,YAAY;AAAA,EAC3E,MAAM,WAAsC;AAAA,IAC1C,oBAAoB,SAAS,gBAAgB,WAAW;AAAA,IACxD,oBAAoB,CAAC,qBAAqB,SAAS,aAAa,WAAW,WAAW;AAAA,EACxF;AAAA,EAEA,OAAO;AAAA,IACL,UAAU,gBAAgB,QAAQ;AAAA,IAClC,WAAW,gBAAgB,SAAS;AAAA,IACpC;AAAA,IACA;AAAA,IACA;AAAA,IACA,SAAS,OAAO,SAAS,UAAU,SAAS,sBAAsB,SAAS;AAAA,EAC7E;AAAA;AAOK,SAAS,6BAA4B,CAAC,SAGvB;AAAA,EACpB,yBAAwB,QAAQ,MAAM,CAAC,YAAY,IAAI,kBAAiB,cAAc,SAAS,CAAC;AAAA,EAChG,IAAI,CAAC,QAAQ,UAAU;AAAA,IACrB,OAAO,gBAAgB,QAAQ,IAAI;AAAA,EACrC;AAAA,EAEA,MAAM,OAAO,6BAA4B,QAAQ,UAAU,QAAQ,IAAI;AAAA,EACvE,IAAI,KAAK,OAAO,SAAS,QAAQ;AAAA,IAC/B,MAAM,IAAI,kBACR,uBAAuB,QAAQ,KAAK,sDACtC;AAAA,EACF;AAAA,EAEA,OAAO,gBAAgB,KAAK,UAAU;AAAA;AAQxC,eAAsB,uCAAsC,CAC1D,SACe;AAAA,EACf,MAAM,QAAQ,YAAY,mCAAmC,QAAQ,WAAW;AAAA;AAGlF,SAAS,iBAAiB,CAAC,UAA6B,WAAoC;AAAA,EAC1F,IAAI,SAAS,OAAO,UAAU,IAAI;AAAA,IAChC,MAAM,IAAI,kBACR,qCAAqC,SAAS,4BAA4B,UAAU,MACtF;AAAA,EACF;AAAA;AAGF,SAAS,yBAAyB,CAChC,UACA,WACM;AAAA,EACN,MAAM,qBAAqB,SAAS;AAAA,EACpC,MAAM,sBAAsB,UAAU;AAAA,EACtC,MAAM,YACJ,uBAAuB,aAAa,wBAAwB,YACxD,uBAAuB,sBACvB,yBAAyB,oBAAoB,mBAAmB;AAAA,EAEtE,IAAI,CAAC,WAAW;AAAA,IACd,MAAM,IAAI,kBACR,uBAAuB,UAAU,sFACnC;AAAA,EACF;AAAA;AAGF,SAAS,6CAA6C,CACpD,UACA,WACoC;AAAA,EACpC,MAAM,kBAAkB,SAAS,OAAO;AAAA,EACxC,MAAM,yBAAyB,IAAI,IACjC,UAAU,OAAO,QAAQ,IAAI,CAAC,WAAW,CAAC,OAAO,MAAM,MAAM,CAAC,CAChE;AAAA,EAIA,WAAW,kBAAkB,iBAAiB;AAAA,IAC5C,MAAM,kBAAkB,uBAAuB,IAAI,eAAe,IAAI;AAAA,IACtE,IAAI,oBAAoB,WAAW;AAAA,MACjC,6BACE,UAAU,IACV,oBAAoB,eAAe,wBACrC;AAAA,IACF;AAAA,IAEA,8BAA8B,UAAU,IAAI,gBAAgB,eAAe;AAAA,EAC7E;AAAA,EAEA,MAAM,sBAAsB,IAAI,IAAI,gBAAgB,IAAI,CAAC,WAAW,OAAO,IAAI,CAAC;AAAA,EAChF,OAAO,UAAU,OAAO,QAAQ,OAAO,CAAC,WAAW,CAAC,oBAAoB,IAAI,OAAO,IAAI,CAAC;AAAA;AAG1F,SAAS,6BAA6B,CACpC,WACA,cACM;AAAA,EACN,WAAW,UAAU,cAAc;AAAA,IAGjC,IAAI,CAAC,WAAW,MAAM,GAAG;AAAA,MACvB,6BACE,WACA,2BAA2B,OAAO,wBACpC;AAAA,IACF;AAAA,EACF;AAAA;AAGF,SAAS,6BAA6B,CACpC,WACA,UACA,WACM;AAAA,EACN,IAAI,SAAS,SAAS,UAAU,MAAM;AAAA,IACpC,6BACE,WACA,oBAAoB,SAAS,oBAAoB,SAAS,aAAa,UAAU,wBACnF;AAAA,EACF;AAAA,EAEA,IAAI,WAAW,QAAQ,MAAM,WAAW,SAAS,GAAG;AAAA,IAClD,6BACE,WACA,oBAAoB,SAAS,oCAC/B;AAAA,EACF;AAAA;AAGF,SAAS,kBAAkB,CACzB,cACyB;AAAA,EACzB,IAAI,aAAa,WAAW,GAAG;AAAA,IAC7B,OAAO,EAAE,MAAM,OAAO;AAAA,EACxB;AAAA,EAEA,OAAO;AAAA,IACL,MAAM;AAAA,IACN,SAAS,aAAa,YAAY;AAAA,EACpC;AAAA;AAGF,SAAS,sBAAsB,CAC7B,UACA,WACA,cACmB;AAAA,EACnB,8BACE,UAAU,IACV,eACA,SAAS,aACT,UAAU,WACZ;AAAA,EACA,8BACE,UAAU,IACV,eACA,SAAS,aACT,UAAU,WACZ;AAAA,EAEA,MAAM,UAAU,CAAC,GAAG,aAAa,SAAS,OAAO,OAAO,GAAG,GAAG,aAAa,YAAY,CAAC;AAAA,EACxF,MAAM,aAAa,SAAS;AAAA,EAC5B,MAAM,cAAc,UAAU,eAAe,SAAS;AAAA,EACtD,MAAM,cAAc,UAAU,eAAe,SAAS;AAAA,EAEtD,OAAO;AAAA,IACL,MAAM;AAAA,IACN,IAAI,UAAU;AAAA,IACd,QAAQ,EAAE,QAAQ;AAAA,OACd,eAAe,YAAY,EAAE,YAAY,gBAAgB,UAAU,EAAE,IAAI,CAAC;AAAA,OAC1E,SAAS,eAAe,YAAY,EAAE,YAAY,SAAS,WAAW,IAAI,CAAC;AAAA,OAC3E,gBAAgB,YAAY,EAAE,aAAa,CAAC,GAAG,WAAW,EAAE,IAAI,CAAC;AAAA,OACjE,gBAAgB,YAAY,EAAE,YAAY,IAAI,CAAC;AAAA,EACrD;AAAA;AAGF,SAAS,6BAA6B,CACpC,WACA,OACA,UACA,WACM;AAAA,EACN,IACE,aAAa,aACb,cAAc,aACd,yBAAyB,UAAU,SAAS,GAC5C;AAAA,IACA;AAAA,EACF;AAAA,EAEA,MAAM,IAAI,kBACR,uBAAuB,uDAAuD,QAChF;AAAA;AAGF,SAAS,oBAAoB,CAC3B,MACA,OACS;AAAA,EACT,IAAI,SAAS,aAAa,UAAU,WAAW;AAAA,IAC7C,OAAO,SAAS;AAAA,EAClB;AAAA,EAEA,OAAO,KAAK,WAAW,MAAM,UAAU,KAAK,MAAM,CAAC,OAAO,UAAU,UAAU,MAAM,MAAM;AAAA;AAG5F,SAAS,wBAAwB,CAC/B,MACA,OACS;AAAA,EACT,IAAI,OAAO,SAAS,YAAY,OAAO,UAAU,UAAU;AAAA,IACzD,OAAO,SAAS;AAAA,EAClB;AAAA,EAEA,OAAO,qBAAqB,MAAM,KAAK;AAAA;AAGzC,SAAS,UAAU,CAAC,QAA0C;AAAA,EAC5D,OAAO,OAAO,aAAa;AAAA;AAG7B,SAAS,YAAY,CACnB,SACoC;AAAA,EACpC,OAAO,QAAQ,IAAI,CAAC,YAAY,KAAK,OAAO,EAAE;AAAA;AAGhD,SAAS,4BAA4B,CAAC,WAAmB,QAAuB;AAAA,EAC9E,MAAM,IAAI,kBACR,uBAAuB,iDAAiD,WAAW,yBACrF;AAAA;;ACnSF;AACA;;;ACuBA,eAAsB,wBAAuB,CAC3C,OACA,QACA,KACmC;AAAA,EACnC,MAAM,WACJ,QAAQ,mBACR,MAAM,QAAQ,eAAe,aAC7B,MAAM,4BAA4B,YAC9B,IACA;AAAA,EACN,SAAS,UAAU,IAAK,WAAW,GAAG;AAAA,IACpC,QAAQ,QAAQ,eAAe;AAAA,IAC/B,IAAI;AAAA,MACF,OAAO,MAAM,IAAI,UAAU,CAAC;AAAA,MAC5B,OAAO,OAAO;AAAA,MACd,IAAI,EAAE,iBAAiB,0BAAyB,aAAa;AAAA,QAAG,MAAM;AAAA,MACtE,IAAI,UAAU,MAAM,UAAU;AAAA,QAC5B,MAAM,IAAI,sBACR,uBAAuB,MAAM,QAAQ,uBAAuB,iFAC5D,EAAE,OAAO,MAAM,CACjB;AAAA,MACF;AAAA;AAAA,EAEJ;AAAA;;;AChDF;AAmBO,SAAS,sBAAqB,CACnC,SACA,QACuB;AAAA,EACvB,MAAM,QAAQ,OAAO,SAAS,WAAW,OAAO,IAAI,QAAQ,cAAc,MAAM,OAAO;AAAA,EACvF,OAAO;AAAA,IACL,KAAK,yBAAwB,SAAS,OAAO,SAAS,WAAW,OAAO,MAAM,OAAO,GAAG;AAAA,IACxF,UAAU,qBAAqB,SAAS,KAAK,EAAE,SAAS;AAAA,IACxD,SAAS,OAAO,SAAS,WAAW,OAAO,UAAU,SAAS,OAAO,GAAG;AAAA,EAC1E;AAAA;AAIK,SAAS,0BAAyB,CACvC,SACA,UACA,SAC8E;AAAA,EAC9E,MAAM,SAAS,IAAI,IAAI,QAAQ;AAAA,EAC/B,MAAM,WAAW,IAAI;AAAA,EACrB,YAAY,OAAO,WAAW,QAAQ,QAAQ,GAAG;AAAA,IAC/C,MAAM,UAAU,OAAO,IAAI,OAAO,GAAG;AAAA,IACrC,IAAI,SAAS;AAAA,MACX,MAAM,aAAa,OAAO,OAAO,QAAQ,IAAI,OAAO,QAAQ,QAAQ;AAAA,MACpE,IAAI,aAAa;AAAA,QAAI;AAAA,MACrB,IAAI,eAAe,IAAI;AAAA,QACrB,IAAI,QAAQ,YAAY,OAAO,SAAS;AAAA,UACtC,MAAM,IAAI,kBACR,uBAAuB,QAAQ,mDAAmD,OAAO,qBAAqB,OAAO,MACvH;AAAA,QACF;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAAA,IACA,OAAO,IAAI,OAAO,KAAK,EAAE,UAAU,OAAO,UAAU,SAAS,OAAO,QAAQ,CAAC;AAAA,IAC7E,SAAS,IAAI,OAAO,KAAK,KAAK;AAAA,EAChC;AAAA,EACA,OAAO,EAAE,QAAQ,SAAS;AAAA;AAG5B,SAAS,SAAS,CAAC,SAA4B,KAAyB;AAAA,EACtE,MAAM,UAAmC,OAAO,OAAO,IAAI;AAAA,EAC3D,WAAW,UAAU,QAAQ,OAAO,SAAS;AAAA,IAC3C,MAAM,QAAQ,IAAI,OAAO;AAAA,IAEzB,IAAI,SAAS;AAAA,MAAM;AAAA,IACnB,QAAQ,OAAO;AAAA,WACR;AAAA,QACH,QAAQ,OAAO,QAAQ,OAAO,KAAwB,EAAE,SAAS;AAAA,QACjE;AAAA,WACG;AAAA,QACH,QAAQ,OAAO,QAAQ,IAAI,KAAK,KAAsB,EAAE,YAAY;AAAA,QACpE;AAAA,WACG;AAAA,QACH,QAAQ,OAAO,QAAQ,IAAI,KAAK,KAAsB,EAAE,YAAY,EAAE,MAAM,GAAG,EAAE;AAAA,QACjF;AAAA,WACG;AAAA,QACH,QAAQ,OAAO,QAAQ,uBAAsB,KAAe;AAAA,QAC5D;AAAA;AAAA,QAEA,QAAQ,OAAO,QAAQ;AAAA;AAAA,EAE7B;AAAA,EACA,OAAO,WAAW,QAAQ,EACvB,OAAO,qBAAoB,KAAK,MAAM,KAAK,UAAU,OAAO,CAAC,CAAC,CAAC,EAC/D,OAAO,KAAK;AAAA;AAIV,SAAS,8BAA6B,CAAC,SAAkC;AAAA,EAC9E,IAAI,QAAQ,eAAe,WAAW;AAAA,IACpC,MAAM,IAAI,kBACR,uBAAuB,QAAQ,sEACjC;AAAA,EACF;AAAA;;;AC1FK,SAAS,uBAAsB,CACpC,UACA,MACS;AAAA,EACT,IAAI,SAAS;AAAA,IAAW,OAAO;AAAA,EAC/B,MAAM,OAAO,CAAC,SACZ,IAAI,IAAI,KAAK,IAAI,CAAC,QAAQ,KAAK,UAAU,CAAC,IAAI,WAAW,IAAI,SAAS,CAAC,CAAC,CAAC;AAAA,EAC3E,MAAM,SAAS,KAAK,YAAY,CAAC,CAAC;AAAA,EAClC,MAAM,QAAQ,KAAK,IAAI;AAAA,EACvB,OAAO,OAAO,SAAS,MAAM,QAAQ,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,QAAQ,CAAC,OAAO,IAAI,GAAG,CAAC;AAAA;;;AHkChF,SAAS,sBAAsB,CAAC,YAAkD;AAAA,EAChF,OAAO,gBAAgB,UAAU;AAAA;AAGnC,SAAS,mBAAmB,CAAC,SAAyC;AAAA,EACpE,OAAO;AAAA,OACF,gBAAgB,OAAO;AAAA,IAC1B,WAAW,IAAI,KAAK,QAAQ,SAAS;AAAA,EACvC;AAAA;AAGF,SAAS,oBAAoB,CAAC,SAAsD;AAAA,EAClF,OAAO;AAAA,IACL,WAAW,QAAQ;AAAA,IACnB,WAAW,QAAQ;AAAA,IACnB,MAAM,QAAQ;AAAA,IACd,WAAW,QAAQ;AAAA,OACf,QAAQ,aAAa,YAAY,EAAE,UAAU,QAAQ,SAAS,IAAI,CAAC;AAAA,EACzE;AAAA;AAGF,SAAS,QAAQ,CAAC,KAA6B;AAAA,EAC7C,OAAO,gBAAgB,GAAG;AAAA;AAG5B,SAAS,aAAa,CAAC,KAAiB,SAAyC;AAAA,EAC/E,IAAI,CAAC,WAAW,QAAQ,WAAW,GAAG;AAAA,IACpC,OAAO,SAAS,GAAG;AAAA,EACrB;AAAA,EAEA,MAAM,WAAoC,CAAC;AAAA,EAC3C,WAAW,UAAU,SAAS;AAAA,IAC5B,SAAS,UAAU,IAAI;AAAA,EACzB;AAAA,EACA,OAAO;AAAA;AAOT,SAAS,aAAa,CAAC,KAAiB,QAA+B;AAAA,EACrE,OAAO,KAAK,UAAU,OAAO,QAAQ,IAAI,CAAC,WAAW,IAAI,OAAO,SAAS,IAAI,CAAC;AAAA;AAIhF,SAAS,cAAc,CAAC,MAAyB,OAAmC;AAAA,EAClF,IAAI,KAAK,WAAW,MAAM,QAAQ;AAAA,IAChC,OAAO;AAAA,EACT;AAAA,EAEA,MAAM,aAAa,CAAC,GAAG,IAAI,EAAE,KAAK;AAAA,EAClC,MAAM,cAAc,CAAC,GAAG,KAAK,EAAE,KAAK;AAAA,EACpC,OAAO,WAAW,MAAM,CAAC,KAAK,UAAU,QAAQ,YAAY,MAAM;AAAA;AAGpE,SAAS,eAAe,CAAC,WAAyB;AAAA,EAChD,IAAI,UAAU,KAAK,EAAE,WAAW,GAAG;AAAA,IACjC,MAAM,IAAI,kBAAiB,4CAA4C;AAAA,EACzE;AAAA;AAGF,SAAS,YAAY,CAAC,OAAwB;AAAA,EAC5C,OAAO,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAAA;AAAA;AAG9D,MAAM,yBAAqD;AAAA,EAMtC;AAAA,EACA;AAAA,EANF,OAAqB,CAAC;AAAA,EACtB,cAAc,IAAI;AAAA,EAC3B,SAAS;AAAA,EAEjB,WAAW,CACQ,SACA,OACjB;AAAA,IAFiB;AAAA,IACA;AAAA;AAAA,OAGb,UAAS,CAAC,MAAuE;AAAA,IACrF,KAAK,WAAW;AAAA,IAEhB,MAAM,aAA2B,CAAC;AAAA,IAClC,MAAM,oBAAoB,IAAI;AAAA,IAC9B,iBAAiB,OAAO,MAAM;AAAA,MAC5B,MAAM,kBAAkB,+BAA+B,KAAK,KAAK,MAAM,OAAO;AAAA,MAC9E,IAAI,iBAAiB;AAAA,QACnB,MAAM,IAAI,kBAAiB,iBAAiB,gBAAgB,WAAW;AAAA,UACrE,OAAO;AAAA,QACT,CAAC;AAAA,MACH;AAAA,MAEA,IAAI,6BAA4B,KAAK,MAAM,OAAO,MAAM,MAAM;AAAA,QAC5D,MAAM,aAAa,yBAAwB,KAAK,MAAM,SAAS,GAAG;AAAA,QAClE,IAAI,KAAK,YAAY,IAAI,UAAU,KAAK,kBAAkB,IAAI,UAAU,GAAG;AAAA,UACzE,MAAM,IAAI,kBACR,0BAA0B,KAAK,MAAM,QAAQ,4CAA4C,aAC3F;AAAA,QACF;AAAA,QACA,kBAAkB,IAAI,UAAU;AAAA,MAClC;AAAA,MAEA,WAAW,KAAK,SAAS,GAAG,CAAC;AAAA,IAC/B;AAAA,IAEA,KAAK,KAAK,KAAK,GAAG,UAAU;AAAA,IAC5B,WAAW,cAAc,mBAAmB;AAAA,MAC1C,KAAK,YAAY,IAAI,UAAU;AAAA,IACjC;AAAA;AAAA,OAGI,OAAM,CAAC,OAAoE;AAAA,IAC/E,KAAK,WAAW;AAAA,IAChB,KAAK,SAAS;AAAA,IACd,OAAO,KAAK,QAAQ,YAAY;AAAA,MAC9B,OAAO,KAAK;AAAA,MACZ,MAAM,KAAK;AAAA,MACX,QAAQ;AAAA,IACV,CAAC;AAAA;AAAA,OAGG,MAAK,GAAkB;AAAA,IAC3B,KAAK,SAAS;AAAA,IACd,KAAK,KAAK,SAAS;AAAA;AAAA,EAGb,UAAU,GAAS;AAAA,IACzB,IAAI,KAAK,QAAQ;AAAA,MACf,MAAM,IAAI,kBAAiB,+CAA+C;AAAA,IAC5E;AAAA;AAEJ;AAAA;AAEA,MAAM,yBAAqD;AAAA,EAKtC;AAAA,EACA;AAAA,EACA;AAAA,EANF,UAAiD,CAAC;AAAA,EAC3D,SAAS;AAAA,EAEjB,WAAW,CACQ,SACA,OACA,eACjB;AAAA,IAHiB;AAAA,IACA;AAAA,IACA;AAAA;AAAA,OAGb,aAAY,CAChB,SAGe;AAAA,IACf,KAAK,WAAW;AAAA,IAEhB,MAAM,gBAAuD,CAAC;AAAA,IAC9D,iBAAiB,UAAU,SAAS;AAAA,MAClC,MAAM,kBAAkB,sCAAqC,QAAQ,KAAK,MAAM,OAAO;AAAA,MACvF,IAAI,iBAAiB;AAAA,QACnB,MAAM,IAAI,kBAAiB,iBAAiB,iBAAiB;AAAA,MAC/D;AAAA,MACA,cAAc,KAAK,yBAAwB,MAAM,CAAC;AAAA,IACpD;AAAA,IACA,KAAK,QAAQ,KAAK,GAAG,aAAa;AAAA;AAAA,OAG9B,OAAM,CAAC,OAAoE;AAAA,IAC/E,KAAK,WAAW;AAAA,IAChB,KAAK,SAAS;AAAA,IACd,OAAO,yBAAwB,KAAK,OAAO,OAAO,OAAO,WACvD,KAAK,QAAQ,YAAY;AAAA,MACvB,OAAO,KAAK;AAAA,MACZ,eAAe,UACT,MAAM,KAAK,QAAQ,iBAAiB,KAAK,MAAM,QAAQ,EAAE,IAAI,aAAa,OAC5E,KAAK;AAAA,MACT,SAAS,KAAK;AAAA,MACd,QAAQ;AAAA,IACV,CAAC,CACH;AAAA;AAAA,OAGI,MAAK,GAAkB;AAAA,IAC3B,KAAK,SAAS;AAAA,IACd,KAAK,QAAQ,SAAS;AAAA;AAAA,EAGhB,UAAU,GAAS;AAAA,IACzB,IAAI,KAAK,QAAQ;AAAA,MACf,MAAM,IAAI,kBAAiB,+CAA+C;AAAA,IAC5E;AAAA;AAEJ;AAAA;AAEO,MAAM,qBAA2C;AAAA,EACrC,WAAW,IAAI;AAAA,EACf,oBAAoB,IAAI;AAAA,EACxB,kBAAkB,IAAI;AAAA,EACtB,uBAAuB,IAAI;AAAA,EAC3B,2BAA2B,IAAI;AAAA,EAC/B,cAAc,IAAI;AAAA,EAE3B,iBAAiB;AAAA,EACR,0BAA0B,IAAI;AAAA,OAEzC,cAAa,CAAC,YAA2D;AAAA,IAC7E,gBAAgB,WAAW,EAAE;AAAA,IAC7B,MAAM,WAAW,KAAK,SAAS,IAAI,WAAW,EAAE;AAAA,IAChD,MAAM,SAAS,8BAA6B;AAAA,MAC1C;AAAA,MACA,MAAM;AAAA,IACR,CAAC;AAAA,IACD,KAAK,SAAS,IAAI,WAAW,IAAI,MAAM;AAAA,IACvC,OAAO,uBAAuB,MAAM;AAAA;AAAA,OAGhC,mCAAkC,CACtC,aACe;AAAA,IACf,MAAM,WAAqB,CAAC;AAAA,IAE5B,WAAW,cAAc,aAAa;AAAA,MACpC,IAAI;AAAA,QACF,gBAAgB,WAAW,EAAE;AAAA,QAC7B,MAAM,WAAW,KAAK,SAAS,IAAI,WAAW,EAAE;AAAA,QAChD,IAAI,CAAC,UAAU;AAAA,UACb;AAAA,QACF;AAAA,QAEA,8BAA6B;AAAA,UAC3B;AAAA,UACA,MAAM;AAAA,QACR,CAAC;AAAA,QACD,OAAO,OAAO;AAAA,QACd,SAAS,KAAK,KAAK,WAAW,OAAO,aAAa,KAAK,GAAG;AAAA;AAAA,IAE9D;AAAA,IAEA,IAAI,SAAS,SAAS,GAAG;AAAA,MACvB,MAAM,UAAU,SAAS,KAAK;AAAA,CAAI;AAAA,MAClC,MAAM,IAAI,kBACR,uDAAuD,SAAS;AAAA,EAAuB,SACzF;AAAA,IACF;AAAA;AAAA,OAGI,WAAU,CAAC,WAAsD;AAAA,IACrE,MAAM,aAAa,KAAK,SAAS,IAAI,SAAS;AAAA,IAC9C,OAAO,aAAa,uBAAuB,UAAU,IAAI;AAAA;AAAA,OAGrD,aAAY,GAA0C;AAAA,IAC1D,OAAO,CAAC,GAAG,KAAK,SAAS,OAAO,CAAC,EAAE,IAAI,CAAC,eAAe,uBAAuB,UAAU,CAAC;AAAA;AAAA,OAGrF,wBAAuB,CAC3B,YACyC;AAAA,IACzC,OAAO,QAAQ,IACb,WAAW,IAAI,OAAO,cAAc;AAAA,MAClC,IAAI,CAAC,KAAK,SAAS,IAAI,SAAS,GAAG;AAAA,QACjC,OAAO,EAAE,WAAW,cAAc,OAAO,eAAe,KAAK;AAAA,MAC/D;AAAA,MAEA,MAAM,SAAS,MAAM,KAAK,iBAAiB,SAAS;AAAA,MACpD,OAAO;AAAA,QACL;AAAA,QACA,cAAc;AAAA,QACd,eAAe,SAAS,qBAAqB,MAAM,IAAI;AAAA,MACzD;AAAA,KACD,CACH;AAAA;AAAA,OAGI,aAAY,CAAC,WAAmB,OAAoD;AAAA,IACxF,MAAM,WAAW,CAAC,GAAI,KAAK,kBAAkB,IAAI,SAAS,KAAK,CAAC,CAAE,EAC/D,KAAK,CAAC,MAAM,UAAU,MAAM,UAAU,QAAQ,IAAI,KAAK,UAAU,QAAQ,CAAC,EAC1E,IAAI,CAAC,YAAY,oBAAoB,OAAO,CAAC;AAAA,IAEhD,OAAO,UAAU,YAAY,WAAW,SAAS,MAAM,GAAG,KAAK,IAAI,GAAG,KAAK,CAAC;AAAA;AAAA,OAGxE,WAAU,CAAC,OAA0D;AAAA,IACzE,MAAM,aAAa,MAAM,KAAK,WAAW,MAAM,QAAQ,EAAE;AAAA,IACzD,IAAI,CAAC,YAAY;AAAA,MACf,MAAM,IAAI,kBAAiB,kCAAkC,MAAM,QAAQ,KAAK;AAAA,IAClF;AAAA,IAEA,+BAA8B,UAAU;AAAA,IACxC,OAAO,IAAI,yBAAyB,MAAM;AAAA,SACrC;AAAA,MACH,SAAS;AAAA,MACT,MAAM,MAAM,QAAQ;AAAA,IACtB,CAAC;AAAA;AAAA,OAGG,WAAU,CAAC,OAA0D;AAAA,IACzE,MAAM,aAAa,MAAM,KAAK,WAAW,MAAM,QAAQ,EAAE;AAAA,IACzD,IAAI,CAAC,YAAY;AAAA,MACf,MAAM,IAAI,kBAAiB,kCAAkC,MAAM,QAAQ,KAAK;AAAA,IAClF;AAAA,IACA,IAAI,6BAA4B,UAAU,MAAM,MAAM;AAAA,MACpD,MAAM,IAAI,kBACR,0BAA0B,WAAW,uDACvC;AAAA,IACF;AAAA,IAEA,MAAM,gBAAgB,MAAM,KAAK,iBAAiB,WAAW,EAAE;AAAA,IAC/D,IACE,MAAM,4BAA4B,aAClC,eAAe,cAAc,MAAM,yBACnC;AAAA,MACA,MAAM,IAAI,sBACR,4DAA4D,WAAW,iCAAiC,MAAM,oCAAoC,eAAe,aAAa,SAChL;AAAA,IACF;AAAA,IACA,OAAO,IAAI,yBACT,MACA;AAAA,SACK;AAAA,MACH,SAAS;AAAA,IACX,GACA,eAAe,aAAa,IAC9B;AAAA;AAAA,OAGI,iBAAgB,CAAC,WAAmD;AAAA,IACxE,MAAM,kBAAkB,KAAK,yBAAyB,IAAI,SAAS;AAAA,IACnE,IAAI,CAAC,iBAAiB;AAAA,MACpB,OAAO;AAAA,IACT;AAAA,IAEA,OAAO,KAAK,WAAW,WAAW,eAAe;AAAA;AAAA,OAG7C,wBAAuB,CAC3B,OACqC;AAAA,IACrC,MAAM,SAAS,OAAO,KAAK,cAAc;AAAA,IACzC,IAAI,MAAM,WAAW;AAAA,MAAM,OAAO,EAAE,QAAQ,UAAU,CAAC,EAAE;AAAA,IACzD,IAAI,CAAC,QAAQ,KAAK,MAAM,MAAM,KAAK,OAAO,MAAM,MAAM,IAAI,KAAK;AAAA,MAAgB,OAAO;AAAA,IAEtF,MAAM,QAAQ,OAAO,MAAM,MAAM;AAAA,IACjC,MAAM,aAAa,MAAM,aAAa,IAAI,IAAI,MAAM,UAAU,IAAI;AAAA,IAClE,MAAM,WAA0C,CAAC;AAAA,IACjD,YAAY,WAAW,aAAa,KAAK,yBAAyB;AAAA,MAChE,IAAI,YAAY,SAAU,cAAc,CAAC,WAAW,IAAI,SAAS;AAAA,QAAI;AAAA,MAErE,MAAM,SAAS,MAAM,KAAK,iBAAiB,SAAS;AAAA,MACpD,IAAI;AAAA,QAAQ,SAAS,KAAK,qBAAqB,MAAM,CAAC;AAAA,IACxD;AAAA,IACA,OAAO,EAAE,QAAQ,SAAS;AAAA;AAAA,OAGtB,WAAU,CAAC,WAAmB,WAAmD;AAAA,IACrF,MAAM,WAAW,KAAK,kBAAkB,IAAI,SAAS,KAAK,CAAC;AAAA,IAC3D,MAAM,UAAU,SAAS,KAAK,CAAC,cAAc,UAAU,cAAc,SAAS;AAAA,IAC9E,OAAO,UAAU,oBAAoB,OAAO,IAAI;AAAA;AAAA,SAG3C,QAAQ,CAAC,OAAwD;AAAA,IACtE,MAAM,QAAQ,eAAe;AAAA,IAC7B,MAAM,aAAa,KAAK,SAAS,IAAI,MAAM,SAAS;AAAA,IACpD,IAAI,CAAC,YAAY;AAAA,MACf,MAAM,IAAI,kBAAiB,kCAAkC,MAAM,YAAY;AAAA,IACjF;AAAA,IAEA,MAAM,UACJ,MAAM,cAAc,YAChB,MAAM,KAAK,iBAAiB,MAAM,SAAS,IAC3C,MAAM,KAAK,WAAW,MAAM,WAAW,MAAM,SAAS;AAAA,IAE5D,IAAI,CAAC,SAAS;AAAA,MACZ,MAAM,IAAI,kBACR,yDAAyD,MAAM,YACjE;AAAA,IACF;AAAA,IAEA,MAAM,SAAS,KAAK,IAAI,GAAG,MAAM,UAAU,CAAC;AAAA,IAC5C,MAAM,QAAQ,MAAM,UAAU,YAAY,YAAY,KAAK,IAAI,GAAG,MAAM,KAAK;AAAA,IAC7E,MAAM,OAAO,KAAK,gBACf,IAAI,QAAQ,SAAS,GACpB,MAAM,QAAQ,UAAU,YAAY,YAAY,SAAS,KAAK;AAAA,IAElE,WAAW,OAAO,QAAQ,CAAC,GAAG;AAAA,MAC5B,MAAM,QAAQ,eAAe;AAAA,MAC7B,MAAM,cAAc,KAAK,MAAM,OAAO;AAAA,IACxC;AAAA;AAAA,OAGI,YAAW,CAAC,OAAgE;AAAA,IAChF,MAAM,QAAQ,eAAe;AAAA,IAC7B,MAAM,SAAS,MAAM,KAAK,WAAW,MAAM,WAAW,MAAM,aAAa;AAAA,IACzE,MAAM,QAAQ,MAAM,KAAK,WAAW,MAAM,WAAW,MAAM,WAAW;AAAA,IACtE,IAAI,CAAC,6BAA4B,OAAO,QAAQ,KAAK;AAAA,MAAG,OAAO;AAAA,IAC/D,MAAM,WAAW,KAAK,gBAAgB,IAAI,MAAM,aAAa;AAAA,IAC7D,MAAM,OAAO,KAAK,gBAAgB,IAAI,MAAM,WAAW;AAAA,IACvD,MAAM,QAAQ,CAAC,SAAgC;AAAA,MAC7C,MAAM,SAAS,IAAI;AAAA,MACnB,WAAW,OAAO,MAAM;AAAA,QACtB,MAAM,QAAQ,eAAe;AAAA,QAC7B,MAAM,SAAS,MAAM,WAAW,IAAI,CAAC,WAAW,IAAI,OAAO;AAAA,QAC3D,IAAI,OAAO,KAAK,CAAC,UAAU,OAAO,UAAU,YAAY,MAAM,KAAK,EAAE,WAAW,CAAC;AAAA,UAC/E,OAAO;AAAA,QACT,MAAM,MAAM,KAAK,UAAU,MAAM;AAAA,QACjC,IAAI,OAAO,IAAI,GAAG;AAAA,UAAG,OAAO;AAAA,QAC5B,OAAO,IAAI,KAAK,GAAG;AAAA,MACrB;AAAA,MACA,OAAO;AAAA;AAAA,IAET,MAAM,UAAU,MAAM,QAAQ;AAAA,IAC9B,MAAM,UAAU,MAAM,IAAI;AAAA,IAC1B,IAAI,CAAC,WAAW,CAAC;AAAA,MAAS,OAAO;AAAA,IACjC,IAAI,UAA8B,CAAC;AAAA,IACnC,YAAY,KAAK,QAAQ,SAAS;AAAA,MAChC,MAAM,SAAS,QAAQ,IAAI,GAAG;AAAA,MAC9B,IACE,CAAC,UACD,MAAM,QAAQ,KACZ,CAAC,WAAW,CAAC,kBAAkB,IAAI,WAAW,MAAM,OAAO,WAAW,IAAI,CAC5E,GACA;AAAA,QACA,QAAQ,KAAK;AAAA,UACX,QAAQ,cAAc,KAAK,MAAM,OAAO;AAAA,UACxC,OAAO,SAAS,cAAc,QAAQ,MAAM,OAAO,IAAI;AAAA,QACzD,CAAC;AAAA,MACH;AAAA,IACF;AAAA,IACA,YAAY,KAAK,QAAQ,SAAS;AAAA,MAChC,IAAI,CAAC,QAAQ,IAAI,GAAG;AAAA,QAClB,QAAQ,KAAK,EAAE,QAAQ,MAAM,OAAO,cAAc,KAAK,MAAM,OAAO,EAAE,CAAC;AAAA,IAC3E;AAAA,IACA,IAAI,SAAS;AAAA,IACb,MAAM,cAAc,QAAQ;AAAA,IAC5B,OAAO;AAAA,MACL,cAAc,SAAS;AAAA,MACvB,YAAY,KAAK;AAAA,MACjB;AAAA,MACA,SAAU,gBAAgB,GAAG;AAAA,QAC3B,IAAI;AAAA,UAAQ,MAAM,IAAI,kBAAiB,wCAAwC;AAAA,QAC/E,IAAI;AAAA,UACF,SAAS,IAAI,EAAG,IAAI,aAAa,KAAK;AAAA,YACpC,MAAM,QAAQ,eAAe;AAAA,YAC7B,IAAI;AAAA,cAAQ,MAAM,IAAI,kBAAiB,wCAAwC;AAAA,YAC/E,MAAM,gBAAgB,QAAQ,EAAG;AAAA,UACnC;AAAA,kBACA;AAAA,UACA,SAAS;AAAA,UACT,UAAU,CAAC;AAAA;AAAA,QAEZ;AAAA,WACG,MAAK,GAAG;AAAA,QACZ,SAAS;AAAA,QACT,UAAU,CAAC;AAAA;AAAA,IAEf;AAAA;AAAA,OAGI,YAAW,CAAC,SAIoB;AAAA,IACpC,OAAO,KAAK,sBAAsB,QAAQ,MAAM,QAAQ,IAAI,MAC1D,KAAK,oBAAoB,OAAO,CAClC;AAAA;AAAA,OAGI,YAAW,CAAC,SAKoB;AAAA,IACpC,OAAO,KAAK,sBAAsB,QAAQ,MAAM,QAAQ,IAAI,YAAY;AAAA,MACtE,MAAM,aAAa,KAAK,SAAS,IAAI,QAAQ,MAAM,QAAQ,EAAE;AAAA,MAC7D,IAAI,CAAC,YAAY;AAAA,QACf,MAAM,IAAI,kBAAiB,kCAAkC,QAAQ,MAAM,QAAQ,KAAK;AAAA,MAC1F;AAAA,MAEA,MAAM,gBAAgB,MAAM,KAAK,iBAAiB,QAAQ,MAAM,QAAQ,EAAE;AAAA,MAC1E,QAAQ,QAAQ,QAAQ,eAAe;AAAA,MACvC,MAAM,kBAAkB,eAAe,aAAa;AAAA,MACpD,IAAI,oBAAoB,QAAQ,eAAe;AAAA,QAC7C,MAAM,IAAI,sBACR,6DAA6D,QAAQ,MAAM,QAAQ,iCAAiC,QAAQ,iBAAiB,mBAAmB,mBAAmB,SACrL;AAAA,MACF;AAAA,MAEA,MAAM,eAAe,KAAK,gBAAgB,IAAI,eAAe,aAAa,EAAE,KAAK,CAAC;AAAA,MAClF,MAAM,gBAAgB,KAAK,iBAAiB,cAAc,UAAU;AAAA,MACpE,MAAM,eAAe,IAAI;AAAA,MACzB,MAAM,UACJ,WAAW,eAAe,YACtB,YACA,2BACE,YACA,KAAK,qBAAqB,IAAI,mBAAmB,EAAE,KAAK,IAAI,KAC5D,QAAQ,QAAQ,IAAI,CAAC,WAAW,uBAAsB,YAAY,MAAM,CAAC,CAC3E;AAAA,MACN,IAAI,SAAS;AAAA,QACX,YAAY,KAAK,UAAU,QAAQ;AAAA,UAAU,aAAa,IAAI,KAAK,QAAQ,QAAQ,MAAO;AAAA,MAC5F,EAAO;AAAA,QACL,WAAW,UAAU,QAAQ,SAAS;AAAA,UACpC,MAAM,QAAQ,OAAO,SAAS,WAAW,OAAO,MAAM,OAAO;AAAA,UAC7D,aAAa,IAAI,yBAAwB,YAAY,KAAK,GAAG,MAAM;AAAA,QACrE;AAAA;AAAA,MAGF,MAAM,YAAY,IAAI,IAAI,aAAa;AAAA,MACvC,YAAY,YAAY,WAAW,cAAc;AAAA,QAC/C,IAAI,OAAO,SAAS,UAAU;AAAA,UAC5B,UAAU,IAAI,YAAY,SAAS,OAAO,GAAG,CAAC;AAAA,QAChD,EAAO;AAAA,UACL,UAAU,OAAO,UAAU;AAAA;AAAA,MAE/B;AAAA,MAEA,MAAM,uBAAuB,QAAQ,QAAQ,wBAAwB,kBAAkB;AAAA,MACvF,IACE,CAAC,yBACA,UACG,QAAQ,SAAS,SAAS,IAC1B,KAAK,oBAAoB,eAAe,WAAW,WAAW,MAAM,IACxE;AAAA,QACA,OAAO;AAAA,UACL,SAAS;AAAA,UACT,SAAS,gBAAgB,oBAAoB,aAAa,IAAI;AAAA,QAChE;AAAA,MACF;AAAA,MAEA,MAAM,cAAc,CAAC,GAAG,UAAU,OAAO,CAAC;AAAA,MAC1C,MAAM,YAAY,OAAO,WAAW;AAAA,MACpC,MAAM,UAA0B;AAAA,QAC9B,WAAW,QAAQ,MAAM,QAAQ;AAAA,QACjC;AAAA,QACA,iBAAiB,eAAe;AAAA,QAChC,MAAM;AAAA,QACN,WAAW,IAAI;AAAA,QACf,QAAQ,WAAW;AAAA,QACnB,UAAU,QAAQ,MAAM,WAAW,gBAAgB,QAAQ,MAAM,QAAQ,IAAI;AAAA,QAC7E,QAAQ,QAAQ,MAAM,SAAS,gBAAgB,QAAQ,MAAM,MAAM,IAAI;AAAA,QACvE,UAAU,YAAY;AAAA,QACtB,WAAW,IAAI,YAAY,EAAE,OAC3B,YAAY,IAAI,CAAC,QAAQ,KAAK,UAAU,GAAG,CAAC,EAAE,KAAK;AAAA,CAAI,CACzD,EAAE;AAAA,MACJ;AAAA,MAEA,MAAM,WAAW,KAAK,kBAAkB,IAAI,QAAQ,MAAM,QAAQ,EAAE,KAAK,CAAC;AAAA,MAC1E,SAAS,KAAK,OAAO;AAAA,MACrB,KAAK,kBAAkB,IAAI,QAAQ,MAAM,QAAQ,IAAI,QAAQ;AAAA,MAC7D,KAAK,gBAAgB,IACnB,WACA,YAAY,IAAI,CAAC,QAAQ,SAAS,GAAG,CAAC,CACxC;AAAA,MACA,KAAK,yBAAyB,IAAI,QAAQ,MAAM,QAAQ,IAAI,SAAS;AAAA,MACrE,KAAK,wBAAwB,IAAI,QAAQ,MAAM,QAAQ,IAAI,EAAE,KAAK,cAAc;AAAA,MAChF,IAAI;AAAA,QAAS,KAAK,qBAAqB,IAAI,WAAW,QAAQ,MAAM;AAAA,MAEpE,OAAO,EAAE,SAAS,WAAW,SAAS,oBAAoB,OAAO,EAAE;AAAA,KACpE;AAAA;AAAA,OAGW,oBAAmB,CAAC,SAII;AAAA,IACpC,MAAM,aAAa,KAAK,SAAS,IAAI,QAAQ,MAAM,QAAQ,EAAE;AAAA,IAC7D,IAAI,CAAC,YAAY;AAAA,MACf,MAAM,IAAI,kBAAiB,kCAAkC,QAAQ,MAAM,QAAQ,KAAK;AAAA,IAC1F;AAAA,IAEA,MAAM,OAAO,QAAQ,MAAM,QAAQ;AAAA,IACnC,+BAA8B,UAAU;AAAA,IACxC,MAAM,gBAAgB,MAAM,KAAK,iBAAiB,QAAQ,MAAM,QAAQ,EAAE;AAAA,IAE1E,IAAI,QAAQ,QAAQ,4BAA4B,WAAW;AAAA,MACzD,MAAM,SAAS,eAAe,aAAa;AAAA,MAC3C,IAAI,WAAW,QAAQ,OAAO,yBAAyB;AAAA,QACrD,MAAM,IAAI,sBACR,uDAAuD,QAAQ,MAAM,QAAQ,iCAAiC,QAAQ,OAAO,2BAA2B,mBAAmB,UAAU,SACvL;AAAA,MACF;AAAA,IACF;AAAA,IAEA,KAAK,yBAAyB,MAAM,QAAQ,MAAM,eAAe,UAAU;AAAA,IAI3E,IACE,iBACA,CAAC,wBAAuB,cAAc,QAAQ,QAAQ,MAAM,MAAM,KAClE,KAAK,iBAAiB,MAAM,eAAe,QAAQ,MAAM,WAAW,MAAM,GAC1E;AAAA,MACA,OAAO,KAAK,eAAe,SAAS,YAAY;AAAA,IAClD;AAAA,IAEA,MAAM,YAAY,OAAO,WAAW;AAAA,IACpC,MAAM,cACJ,SAAS,WACL,CAAC,GAAI,KAAK,gBAAgB,IAAI,eAAe,aAAa,EAAE,KAAK,CAAC,GAAI,GAAG,QAAQ,IAAI,IACrF,CAAC,GAAG,QAAQ,IAAI;AAAA,IAEtB,MAAM,YAAY,IAAI,YAAY,EAAE,OAClC,YAAY,IAAI,CAAC,QAAQ,KAAK,UAAU,GAAG,CAAC,EAAE,KAAK;AAAA,CAAI,CACzD,EAAE;AAAA,IAEF,MAAM,UAA0B;AAAA,MAC9B,WAAW,QAAQ,MAAM,QAAQ;AAAA,MACjC;AAAA,MACA,iBAAiB,SAAS,WAAW,eAAe,YAAY;AAAA,MAChE;AAAA,MACA,WAAW,IAAI;AAAA,MACf,QAAQ,WAAW;AAAA,MACnB,UAAU,QAAQ,MAAM,WAAW,gBAAgB,QAAQ,MAAM,QAAQ,IAAI;AAAA,MAC7E,QAAQ,QAAQ,MAAM,SAAS,gBAAgB,QAAQ,MAAM,MAAM,IAAI;AAAA,MACvE,UAAU,YAAY;AAAA,MACtB;AAAA,IACF;AAAA,IAEA,MAAM,WAAW,KAAK,kBAAkB,IAAI,QAAQ,MAAM,QAAQ,EAAE,KAAK,CAAC;AAAA,IAC1E,SAAS,KAAK,OAAO;AAAA,IACrB,KAAK,kBAAkB,IAAI,QAAQ,MAAM,QAAQ,IAAI,QAAQ;AAAA,IAC7D,KAAK,gBAAgB,IACnB,WACA,YAAY,IAAI,CAAC,QAAQ,SAAS,GAAG,CAAC,CACxC;AAAA,IACA,KAAK,yBAAyB,IAAI,QAAQ,MAAM,QAAQ,IAAI,SAAS;AAAA,IACrE,KAAK,wBAAwB,IAAI,QAAQ,MAAM,QAAQ,IAAI,EAAE,KAAK,cAAc;AAAA,IAEhF,OAAO,KAAK,oBAAoB,OAAO,GAAG,SAAS,UAAU;AAAA;AAAA,EAGvD,gBAAgB,CACtB,MACA,eACA,MACA,QACS;AAAA,IACT,IAAI,SAAS,UAAU;AAAA,MACrB,OAAO,KAAK,WAAW;AAAA,IACzB;AAAA,IAEA,MAAM,eAAe,KAAK,gBAAgB,IAAI,cAAc,SAAS,KAAK,CAAC;AAAA,IAC3E,OAAO,eACL,KAAK,IAAI,CAAC,QAAQ,cAAc,KAAK,MAAM,CAAC,GAC5C,aAAa,IAAI,CAAC,QAAQ,cAAc,KAAK,MAAM,CAAC,CACtD;AAAA;AAAA,EAGM,wBAAwB,CAC9B,MACA,MACA,eACA,YACM;AAAA,IACN,IAAI,6BAA4B,UAAU,MAAM,MAAM;AAAA,MACpD;AAAA,IACF;AAAA,IAEA,MAAM,cAAc,KAAK,iBAAiB,MAAM,UAAU;AAAA,IAC1D,IAAI,SAAS,YAAY,kBAAkB,MAAM;AAAA,MAC/C;AAAA,IACF;AAAA,IAEA,MAAM,eAAe,KAAK,gBAAgB,IAAI,cAAc,SAAS,KAAK,CAAC;AAAA,IAC3E,MAAM,gBAAgB,KAAK,iBAAiB,cAAc,UAAU;AAAA,IACpE,WAAW,cAAc,YAAY,KAAK,GAAG;AAAA,MAC3C,IAAI,cAAc,IAAI,UAAU,GAAG;AAAA,QACjC,MAAM,IAAI,kBACR,0BAA0B,WAAW,6CAA6C,aACpF;AAAA,MACF;AAAA,IACF;AAAA;AAAA,EAGM,gBAAgB,CACtB,MACA,YACyB;AAAA,IACzB,MAAM,QAAQ,IAAI;AAAA,IAClB,WAAW,OAAO,MAAM;AAAA,MACtB,MAAM,aAAa,yBAAwB,YAAY,GAAG;AAAA,MAC1D,IAAI,MAAM,IAAI,UAAU,GAAG;AAAA,QACzB,MAAM,IAAI,kBACR,0BAA0B,WAAW,sCAAsC,aAC7E;AAAA,MACF;AAAA,MACA,MAAM,IAAI,YAAY,GAAG;AAAA,IAC3B;AAAA,IACA,OAAO;AAAA;AAAA,EAGD,mBAAmB,CACzB,MACA,OACA,QACS;AAAA,IACT,IAAI,KAAK,SAAS,MAAM,MAAM;AAAA,MAC5B,OAAO;AAAA,IACT;AAAA,IACA,YAAY,YAAY,YAAY,MAAM;AAAA,MACxC,MAAM,WAAW,MAAM,IAAI,UAAU;AAAA,MACrC,IACE,aAAa,aACb,cAAc,SAAS,MAAM,MAAM,cAAc,UAAU,MAAM,GACjE;AAAA,QACA,OAAO;AAAA,MACT;AAAA,IACF;AAAA,IACA,OAAO;AAAA;AAAA,OAGK,sBAAwB,CAAC,WAAmB,KAAmC;AAAA,IAC3F,MAAM,WAAW,KAAK,YAAY,IAAI,SAAS,KAAK,QAAQ,QAAQ;AAAA,IACpE,MAAM,QAAQ,SAAS,MAAM,MAAM,EAAE;AAAA,IACrC,IAAI;AAAA,IACJ,MAAM,OAAO,IAAI,QAAc,CAAC,YAAY;AAAA,MAC1C,UAAU;AAAA,KACX;AAAA,IACD,MAAM,UAAU,MAAM,KAAK,MAAM,IAAI;AAAA,IACrC,KAAK,YAAY,IAAI,WAAW,OAAO;AAAA,IAEvC,MAAM;AAAA,IACN,IAAI;AAAA,MACF,OAAO,MAAM,IAAI;AAAA,cACjB;AAAA,MACA,QAAQ;AAAA,MACR,IAAI,KAAK,YAAY,IAAI,SAAS,MAAM,SAAS;AAAA,QAC/C,KAAK,YAAY,OAAO,SAAS;AAAA,MACnC;AAAA;AAAA;AAGN;",
+  "debugId": "504A6D0F5F95C2B164756E2164756E21",
+  "names": []
+}

package/dist/{chunk-jgwb25gc.js → chunk-4as3wt1c.js}

@@ -21,6 +21,10 @@ function aiLimitCalendarMonth2(at) {
 
 // src/storage/ai-limits/provider.ts
 var SIGNED_INT64_MAX = 9223372036854775807n;
+var TOKENLESS_MODEL_KINDS = new Set(["transcription", "reranking"]);
+function aiLimitMeterApplies2(meter, modelKind) {
+  return meter !== "tokens.total" || modelKind === undefined || !TOKENLESS_MODEL_KINDS.has(modelKind);
+}
 
 class AiLimitOperationLock2 {
   tail = Promise.resolve();
@@ -169,6 +173,7 @@ function normalizeReserveAiModelCall2(input) {
     identity,
     subjects: normalizeAiLimitSubjects2(input.subjects),
     estimates: normalizeAiLimitQuantities2(input.estimates, "estimates"),
+    ...input.modelKind === undefined ? {} : { modelKind: input.modelKind },
     period: aiLimitCalendarMonth2(reservedAt),
     reservedAt
   };
@@ -214,16 +219,17 @@ function aiLimitReservationRequestKey2(request) {
     request.estimates.map((quantity) => {
       const amount = normalizeAiLimitAmount2(quantity);
       return [amount.meter, amount.currency, amount.amount.toString()];
-    })
+    }),
+    ...request.modelKind === undefined ? [] : [request.modelKind]
   ]);
 }
-function aiLimitReservationBuckets2(policies, subjects, estimates) {
+function aiLimitReservationBuckets2(policies, subjects, estimates, modelKind) {
   const subjectKeys = new Set(subjects.map(aiLimitSubjectKey2));
   const estimatesByDimension = new Map(estimates.map((estimate) => {
     const amount = normalizeAiLimitAmount2(estimate);
     return [aiLimitAmountKey2(amount), estimate];
   }));
-  return policies.filter((policy) => subjectKeys.has(aiLimitSubjectKey2(policy.subject))).flatMap((policy) => {
+  return policies.filter((policy) => subjectKeys.has(aiLimitSubjectKey2(policy.subject)) && aiLimitMeterApplies2(policy.limit.meter, modelKind)).flatMap((policy) => {
     const estimate = estimatesByDimension.get(aiLimitAmountKey2(normalizeAiLimitAmount2(policy.limit)));
     return estimate ? [{ subject: policy.subject, estimate }] : [];
   }).sort((left, right) => {
@@ -251,6 +257,8 @@ function resolveAiLimitActual2(entries, dimension) {
   let accountingStatus = "complete";
   for (const entry of entries) {
     if (dimension.meter === "tokens.total") {
+      if (!aiLimitMeterApplies2(dimension.meter, entry.modelKind))
+        continue;
       if (entry.totalTokens === undefined) {
         accountingStatus = "unavailable";
       } else {
@@ -302,6 +310,6 @@ function cloneValidDate2(value, label) {
   return new Date(value);
 }
 
-export { AiLimitStorageError2, aiLimitCalendarMonth2, AiLimitOperationLock2, normalizeAiLimitSubject2, normalizeAiLimitSubjects2, aiLimitSubjectKey2, aiLimitSubjectParts2, aiLimitSubjectFromParts2, normalizeAiLimitQuantity2, normalizeAiLimitQuantities2, normalizeAiLimitAmount2, aiLimitQuantityFromAmount2, aiLimitAmountKey2, normalizeCreateAiLimitPolicy2, normalizeUpdateAiLimitPolicy2, normalizeReserveAiModelCall2, normalizeAiModelCallReservationIdentity2, aiModelCallReservationKey2, aiLimitPolicyDimensionKey2, aiLimitReservationRequestMatches2, aiLimitReservationRequestKey2, aiLimitReservationBuckets2, aiLimitAccountingEntryAppliesToSubject2, aiLimitSubjectsFromAccountingEntry2, resolveAiLimitActual2, assertAiLimitAccountingMatchesReservation2, cloneAiLimitPolicy2, assertNonBlank2, cloneValidDate2 };
+export { AiLimitStorageError2, aiLimitCalendarMonth2, aiLimitMeterApplies2, AiLimitOperationLock2, normalizeAiLimitSubject2, normalizeAiLimitSubjects2, aiLimitSubjectKey2, aiLimitSubjectParts2, aiLimitSubjectFromParts2, normalizeAiLimitQuantity2, normalizeAiLimitQuantities2, normalizeAiLimitAmount2, aiLimitQuantityFromAmount2, aiLimitAmountKey2, normalizeCreateAiLimitPolicy2, normalizeUpdateAiLimitPolicy2, normalizeReserveAiModelCall2, normalizeAiModelCallReservationIdentity2, aiModelCallReservationKey2, aiLimitPolicyDimensionKey2, aiLimitReservationRequestMatches2, aiLimitReservationRequestKey2, aiLimitReservationBuckets2, aiLimitAccountingEntryAppliesToSubject2, aiLimitSubjectsFromAccountingEntry2, resolveAiLimitActual2, assertAiLimitAccountingMatchesReservation2, cloneAiLimitPolicy2, assertNonBlank2, cloneValidDate2 };
 
-//# debugId=04440D13B01DA23A64756E2164756E21
+//# debugId=DE130C8A66C4C32664756E2164756E21