@lostgradient/weft 0.14.0 → 0.15.0

package/dist/cli/generated/operation-client.generated.d.ts

@@ -19,8 +19,8 @@ export declare const CLIENT_REST_OPERATION_BINDINGS: {
         };
     };
 };
-type SharedAttributesBulkConcurrenc_f62debcf = {
-    readonly attributes?: ReadonlyArray<SharedGtGteKey_896a0c41>;
+type SharedAttributesBulkConcurrenc_ff397168 = {
+    readonly attributes?: ReadonlyArray<SharedGtGteKey_e658e64c>;
     readonly bulkConcurrency?: number;
     readonly confirmationToken?: string;
     readonly createdAt?: SharedGtGteLt_d9a61361;
@@ -39,8 +39,8 @@ type SharedAttributesBulkConcurrenc_f62debcf = {
     readonly type?: string;
     readonly updatedAt?: SharedGtGteLt_d9a61361;
 };
-type SharedAttributesCreatedAtExecu_2af7f9ff = {
-    readonly attributes?: ReadonlyArray<SharedGtGteKey_896a0c41>;
+type SharedAttributesCreatedAtExecu_0caddefc = {
+    readonly attributes?: ReadonlyArray<SharedGtGteKey_e658e64c>;
     readonly createdAt?: SharedGtGteLt_d9a61361;
     readonly executionDeadline?: SharedGtGteLt_d9a61361;
     readonly failureCategory?: unknown;
@@ -55,10 +55,10 @@ type SharedAttributesCreatedAtExecu_2af7f9ff = {
     readonly type?: string;
     readonly updatedAt?: SharedGtGteLt_d9a61361;
 };
-type SharedGtGteKey_896a0c41 = {
+type SharedGtGteKey_e658e64c = {
     readonly gt?: unknown;
     readonly gte?: unknown;
-    readonly key: string;
+    readonly key: unknown;
     readonly lt?: unknown;
     readonly lte?: unknown;
     readonly value?: unknown;
@@ -411,14 +411,7 @@ export type ClientOperationTypes = {
     };
     'weft.workflows.aggregate': {
         readonly input: {
-            readonly attributes?: ReadonlyArray<{
-                readonly gt?: unknown;
-                readonly gte?: unknown;
-                readonly key: unknown;
-                readonly lt?: unknown;
-                readonly lte?: unknown;
-                readonly value?: unknown;
-            }>;
+            readonly attributes?: ReadonlyArray<SharedGtGteKey_e658e64c>;
             readonly createdAt?: SharedGtGteLt_d9a61361;
             readonly executionDeadline?: SharedGtGteLt_d9a61361;
             readonly failureCategory?: unknown;
@@ -461,23 +454,23 @@ export type ClientOperationTypes = {
         readonly faults: never;
     };
     'weft.workflows.bulk.cancel': {
-        readonly input: SharedAttributesBulkConcurrenc_f62debcf;
+        readonly input: SharedAttributesBulkConcurrenc_ff397168;
         readonly output: unknown;
         readonly faults: never;
     };
     'weft.workflows.bulk.delete': {
-        readonly input: SharedAttributesBulkConcurrenc_f62debcf;
+        readonly input: SharedAttributesBulkConcurrenc_ff397168;
         readonly output: unknown;
         readonly faults: 'Unprocessable';
     };
     'weft.workflows.bulk.retryfailed': {
-        readonly input: SharedAttributesBulkConcurrenc_f62debcf;
+        readonly input: SharedAttributesBulkConcurrenc_ff397168;
         readonly output: unknown;
         readonly faults: never;
     };
     'weft.workflows.bulk.signal': {
         readonly input: {
-            readonly attributes?: ReadonlyArray<SharedGtGteKey_896a0c41>;
+            readonly attributes?: ReadonlyArray<SharedGtGteKey_e658e64c>;
             readonly bulkConcurrency?: number;
             readonly confirmationToken?: string;
             readonly createdAt?: SharedGtGteLt_d9a61361;
@@ -506,7 +499,7 @@ export type ClientOperationTypes = {
             readonly bulkConcurrency?: number;
             readonly confirmationToken?: string;
             readonly dryRun?: boolean;
-            readonly filter?: SharedAttributesCreatedAtExecu_2af7f9ff;
+            readonly filter?: SharedAttributesCreatedAtExecu_0caddefc;
             readonly operation: 'add' | 'remove';
             readonly requestId?: string;
             readonly tags: ReadonlyArray<string>;
@@ -569,7 +562,7 @@ export type ClientOperationTypes = {
     };
     'weft.workflows.list': {
         readonly input: {
-            readonly attributes?: ReadonlyArray<SharedGtGteKey_896a0c41>;
+            readonly attributes?: ReadonlyArray<SharedGtGteKey_e658e64c>;
             readonly createdAt?: SharedGtGteLt_d9a61361;
             readonly executionDeadline?: SharedGtGteLt_d9a61361;
             readonly failureCategory?: unknown;
@@ -589,7 +582,7 @@ export type ClientOperationTypes = {
         readonly faults: 'Unprocessable';
     };
     'weft.workflows.purge': {
-        readonly input: SharedAttributesCreatedAtExecu_2af7f9ff;
+        readonly input: SharedAttributesCreatedAtExecu_0caddefc;
         readonly output: unknown;
         readonly faults: never;
     };

package/dist/core/aggregate-validation.d.ts

@@ -11,6 +11,7 @@
  * @module core/aggregate-validation
  */
 import { z } from 'zod';
+import { type ValidationIssue } from './validation-issues.ts';
 import { WeftError } from './weft-error.ts';
 /**
  * Group-by dimension for `engine.aggregate()`. Either a fixed structural
@@ -54,11 +55,7 @@ export declare const aggregateOptionsObjectSchema: z.ZodObject<{
     limit: z.ZodOptional<z.ZodNumber>;
 }, z.core.$strict>;
 /** A flattened Zod issue suitable for cross-transport serialization. */
-export type AggregateOptionsValidationIssue = {
-    readonly path: ReadonlyArray<string | number>;
-    readonly message: string;
-    readonly code: string;
-};
+export type AggregateOptionsValidationIssue = ValidationIssue;
 /**
  * Thrown by {@link normalizeAggregateOptions} when input fails validation.
  * Carries flattened Zod issues so transport adapters can map directly to

package/dist/core/aggregate-validation.js

@@ -1,4 +1,5 @@
 import { z } from "zod";
+import { flattenZodIssue } from "./validation-issues.js";
 import { WeftError } from "./weft-error.js";
 const attributeDimensionSchema = z.object({ attribute: z.string().min(1) }).strict(), groupBySchema = z.union([
   z.literal("status"),
@@ -10,15 +11,6 @@ export const AGGREGATE_DEFAULT_LIMIT = 1000, AGGREGATE_MAX_LIMIT = 1e4, MAX_AGGR
   groupBy: groupBySchema,
   limit: z.number().int().min(1).max(AGGREGATE_MAX_LIMIT).optional()
 }).strict();
-function flattenIssue(issue) {
-  const path = [];
-  for (const segment of issue.path)
-    if (typeof segment === "string" || typeof segment === "number")
-      path.push(segment);
-    else
-      path.push(String(segment));
-  return { path, message: issue.message, code: issue.code };
-}
 
 export class AggregateOptionsValidationError extends WeftError {
   issues;
@@ -42,7 +34,7 @@ export class AggregateDistinctKeyCapExceededError extends WeftError {
 export function normalizeAggregateOptions(input) {
   const result = aggregateOptionsObjectSchema.safeParse(input ?? {});
   if (!result.success)
-    throw new AggregateOptionsValidationError(result.error.issues.map(flattenIssue));
+    throw new AggregateOptionsValidationError(result.error.issues.map(flattenZodIssue));
   const { groupBy, limit } = result.data;
   return { groupBy, ...limit !== void 0 && { limit } };
 }

package/dist/core/atomic-state.js

@@ -121,35 +121,18 @@ export class AtomicState extends EventTarget {
     return (await this.#read()).value;
   }
   async update(updater) {
-    for (let attempt = 0;attempt < this.#maxRetries; attempt++) {
-      const snapshot = await this.#read(), nextValue = updater(snapshot.value), commit = await commitAtomicStateValue(this.#storage, this.#dataKey, snapshot.version, nextValue);
-      if (commit.applied) {
-        dispatchAtomicStateEvent(this, new AtomicStateChangeEvent(nextValue, snapshot.value, commit.version));
-        return nextValue;
-      }
-      dispatchAtomicStateEvent(this, new AtomicStateConflictEvent(this.#stateKey, attempt + 1));
-      if (attempt < this.#maxRetries - 1)
-        await this.#sleep(retryDelay(attempt));
-    }
-    dispatchAtomicStateEvent(this, new AtomicStateExhaustedEvent(this.#stateKey, this.#maxRetries));
-    throw new AtomicStateConflictError(this.#stateKey, this.#maxRetries);
+    return this.#runOptimisticMutation(async (snapshot) => {
+      const nextValue = updater(snapshot.value);
+      return { commit: await commitAtomicStateValue(this.#storage, this.#dataKey, snapshot.version, nextValue), result: nextValue, eventValue: nextValue };
+    });
   }
   async set(value) {
     return this.update(() => value);
   }
   async delete() {
-    for (let attempt = 0;attempt < this.#maxRetries; attempt++) {
-      const snapshot = await this.#read(), commit = await commitAtomicStateDelete(this.#storage, this.#dataKey, snapshot.version);
-      if (commit.applied) {
-        dispatchAtomicStateEvent(this, new AtomicStateChangeEvent(void 0, snapshot.value, commit.version));
-        return;
-      }
-      dispatchAtomicStateEvent(this, new AtomicStateConflictEvent(this.#stateKey, attempt + 1));
-      if (attempt < this.#maxRetries - 1)
-        await this.#sleep(retryDelay(attempt));
-    }
-    dispatchAtomicStateEvent(this, new AtomicStateExhaustedEvent(this.#stateKey, this.#maxRetries));
-    throw new AtomicStateConflictError(this.#stateKey, this.#maxRetries);
+    await this.#runOptimisticMutation(async (snapshot) => {
+      return { commit: await commitAtomicStateDelete(this.#storage, this.#dataKey, snapshot.version), result: void 0, eventValue: void 0 };
+    });
   }
   increment(amount = 1) {
     return this.update((current) => (current ?? 0) + amount);
@@ -225,6 +208,20 @@ export class AtomicState extends EventTarget {
       this.removeEventListener("exhausted", listener);
     }
   }
+  async#runOptimisticMutation(attemptMutation) {
+    for (let attempt = 0;attempt < this.#maxRetries; attempt++) {
+      const snapshot = await this.#read(), mutation = await attemptMutation(snapshot);
+      if (mutation.commit.applied) {
+        dispatchAtomicStateEvent(this, new AtomicStateChangeEvent(mutation.eventValue, snapshot.value, mutation.commit.version));
+        return mutation.result;
+      }
+      dispatchAtomicStateEvent(this, new AtomicStateConflictEvent(this.#stateKey, attempt + 1));
+      if (attempt < this.#maxRetries - 1)
+        await this.#sleep(retryDelay(attempt));
+    }
+    dispatchAtomicStateEvent(this, new AtomicStateExhaustedEvent(this.#stateKey, this.#maxRetries));
+    throw new AtomicStateConflictError(this.#stateKey, this.#maxRetries);
+  }
   async#read() {
     return readAtomicStateSnapshot(this.#storage, this.#dataKey, this.#options);
   }

package/dist/core/engine/schedules.js

@@ -100,7 +100,10 @@ async function hasCurrentScheduleTimer(internals, state) {
 }
 export function toScheduleSummary(state) {
   const { input: _input, ...summary } = state;
-  return { ...summary, queuedRuns: summary.queuedRuns.map((queuedRun) => ({ ...queuedRun })) };
+  return {
+    ...summary,
+    queuedRuns: summary.queuedRuns.map((queuedRun) => ({ ...queuedRun }))
+  };
 }
 export async function pauseSchedule(internals, scheduleId) {
   const normalizedScheduleId = coerceScheduleId(scheduleId, "scheduleId"), state = await requireScheduleState(internals, normalizedScheduleId);

package/dist/core/inline-execution-strategy.js

@@ -128,11 +128,17 @@ export class InlineExecutionStrategy {
     this[Symbol.dispose]();
   }
   #driveGenerator(workflowId, generator, lastResult) {
+    return this.#advanceGenerator(workflowId, () => generator.next(lastResult), void 0);
+  }
+  #throwIntoGenerator(workflowId, generator, error, operationFailureCategory) {
+    return this.#advanceGenerator(workflowId, () => generator.throw(error), operationFailureCategory);
+  }
+  #advanceGenerator(workflowId, advance, fallbackFailureCategory) {
     return this.#trackWorkflowAdvance(workflowId, (async () => {
       try {
         if (this.#abortControllers.get(workflowId)?.signal.aborted)
           return;
-        const iterationResult = await generator.next(lastResult);
+        const iterationResult = await advance();
         if (iterationResult.done) {
           this.#cleanup(workflowId, {
             preserveTrackedAdvance: !0,
@@ -161,7 +167,7 @@ export class InlineExecutionStrategy {
           type: "failed",
           workflowId,
           error: error instanceof Error ? error.message : String(error),
-          failureCategory: classifyErrorAsFailureCategory(error, {
+          failureCategory: fallbackFailureCategory ?? classifyErrorAsFailureCategory(error, {
             defaultErrorCategory: "application"
           })
         };
@@ -171,50 +177,6 @@ export class InlineExecutionStrategy {
       }
     })());
   }
-  #throwIntoGenerator(workflowId, generator, error, operationFailureCategory) {
-    return this.#trackWorkflowAdvance(workflowId, (async () => {
-      try {
-        if (this.#abortControllers.get(workflowId)?.signal.aborted)
-          return;
-        const iterationResult = await generator.throw(error);
-        if (iterationResult.done) {
-          this.#cleanup(workflowId, {
-            preserveTrackedAdvance: !0,
-            preserveTrackedTurn: !0
-          });
-          this.#emit({
-            type: "completed",
-            workflowId,
-            result: iterationResult.value
-          });
-          return;
-        }
-        const operation = iterationResult.value;
-        this.#emit({
-          type: "checkpoint",
-          workflowId,
-          checkpoint: new ArrayBuffer(0),
-          operationRequest: operation
-        });
-      } catch (innerError) {
-        this.#cleanup(workflowId, {
-          preserveTrackedAdvance: !0,
-          preserveTrackedTurn: !0
-        });
-        const failedMessage = {
-          type: "failed",
-          workflowId,
-          error: innerError instanceof Error ? innerError.message : String(innerError),
-          failureCategory: operationFailureCategory ?? classifyErrorAsFailureCategory(innerError, {
-            defaultErrorCategory: "application"
-          })
-        };
-        if (innerError instanceof Error && innerError.stack !== void 0)
-          failedMessage.errorStack = innerError.stack;
-        this.#emit(failedMessage);
-      }
-    })());
-  }
   #trackWorkflowAdvance(workflowId, pendingAdvance) {
     const trackedAdvance = pendingAdvance.finally(() => {
       if (this.#workflowAdvances.get(workflowId) === trackedAdvance)

package/dist/core/list-filter-validation.d.ts

@@ -12,6 +12,7 @@ import { z } from 'zod';
 import { isFailureCategory } from './failure-categories.ts';
 import type { FailureCategory, WorkflowStatus } from './types/identity.ts';
 import type { ListFilter } from './types/list-options.ts';
+import { type ValidationIssue } from './validation-issues.ts';
 import { WeftError } from './weft-error.ts';
 /**
  * Concrete object schema for {@link ListFilter}. Supports `.omit()` and
@@ -56,11 +57,7 @@ export declare const listFilterObjectSchema: z.ZodObject<{
     failureCategory: z.ZodOptional<z.ZodUnion<readonly [z.ZodType<FailureCategory, unknown, z.core.$ZodTypeInternals<FailureCategory, unknown>>, z.ZodArray<z.ZodType<FailureCategory, unknown, z.core.$ZodTypeInternals<FailureCategory, unknown>>>]>>;
 }, z.core.$strict>;
 /** A flattened Zod issue suitable for cross-transport serialization. */
-export type FilterValidationIssue = {
-    readonly path: ReadonlyArray<string | number>;
-    readonly message: string;
-    readonly code: string;
-};
+export type FilterValidationIssue = ValidationIssue;
 /**
  * Thrown by {@link normalizeListFilter} when the input fails validation.
  * Carries flattened Zod issues so transport adapters can map directly to the

package/dist/core/list-filter-validation.js

@@ -1,5 +1,6 @@
 import { z } from "zod";
 import { FAILURE_CATEGORIES, isFailureCategory } from "./failure-categories.js";
+import { flattenZodIssue } from "./validation-issues.js";
 import { WeftError } from "./weft-error.js";
 const WORKFLOW_STATUSES = [
   "pending",
@@ -48,15 +49,6 @@ export const listFilterObjectSchema = z.object({
   executionDeadline: timeRangeSchema.optional(),
   failureCategory: z.union([failureCategorySchema, z.array(failureCategorySchema).min(1)]).optional()
 }).strict();
-function flattenIssue(issue) {
-  const path = [];
-  for (const segment of issue.path)
-    if (typeof segment === "string" || typeof segment === "number")
-      path.push(segment);
-    else
-      path.push(String(segment));
-  return { path, message: issue.message, code: issue.code };
-}
 
 export class ListFilterValidationError extends WeftError {
   issues;
@@ -72,7 +64,7 @@ export class ListFilterValidationError extends WeftError {
 export function normalizeListFilter(input) {
   const result = listFilterObjectSchema.safeParse(input ?? {});
   if (!result.success)
-    throw new ListFilterValidationError(result.error.issues.map(flattenIssue));
+    throw new ListFilterValidationError(result.error.issues.map(flattenZodIssue));
   if (result.data.parentWorkflowExecutionToken !== void 0 && result.data.parentWorkflowId === void 0)
     throw new ListFilterValidationError([
       {

package/dist/core/types/schedules.d.ts

@@ -181,14 +181,13 @@ export type ScheduleDefinition<TInput = unknown> = ScheduleSpec & {
  */
 export declare function schedule<TInput>(definition: ScheduleDefinition<TInput>): ScheduleDefinition<TInput>;
 /**
- * Full persisted state of a recurring schedule. Returned by `engine.getSchedule(id)`.
- * Use {@link ScheduleSummary} (returned by list operations and `engine.getSchedule()`)
- * for the lightweight variant — it omits `input` to keep payloads small.
+ * Metadata shared by persisted schedule state and lightweight schedule summaries.
+ * Persisted state and summaries extend this contract so metadata cannot drift
+ * between durable records and public lightweight responses.
  */
-export interface ScheduleState {
+export interface ScheduleMetadata {
     id: string;
     workflowType: string;
-    input: unknown;
     /** Human-readable operator description stored with this schedule. */
     description?: string;
     /**
@@ -220,38 +219,21 @@ export interface ScheduleState {
     /** Ordered durable occurrences waiting behind `currentWorkflowId`. */
     queuedRuns: ScheduleQueuedRun[];
 }
+/**
+ * Full persisted state of a recurring schedule. Returned by `engine.getSchedule(id)`.
+ * Use {@link ScheduleSummary} (returned by list operations and `engine.getSchedule()`)
+ * for the lightweight variant — it omits `input` to keep payloads small.
+ */
+export interface ScheduleState extends ScheduleMetadata {
+    input: unknown;
+}
 /**
  * Lightweight summary of a recurring schedule returned by list operations.
  * Contains cron expression, status, timing metadata, and the ID of the
  * currently running workflow (if any). For the full record including the
  * `input`, use {@link ScheduleState}.
  */
-export interface ScheduleSummary {
-    id: string;
-    workflowType: string;
-    /** Human-readable operator description stored with this schedule. */
-    description?: string;
-    /** Cron expression for cron-based schedules; absent for interval schedules. */
-    cronExpression?: string;
-    /** Interval period in milliseconds for interval-based schedules; absent for cron schedules. */
-    intervalMs?: number;
-    status: ScheduleStatus;
-    overlap: ScheduleOverlapPolicy;
-    backfill: boolean;
-    /** Normalized deterministic jitter window in milliseconds. */
-    jitterMs?: number;
-    createdAt: number;
-    updatedAt: number;
-    /** Most recent occurrence that started a scheduled workflow. */
-    lastFireAt?: number;
-    /** Most recent occurrence skipped because a non-backfill timer was late. */
-    lastMissedFireAt?: number;
-    /** Lifetime count of occurrences skipped because a non-backfill timer was late. */
-    missedFireCount: number;
-    nextFireAt: number | null;
-    currentWorkflowId?: string;
-    /** Ordered durable occurrences waiting behind `currentWorkflowId`. */
-    queuedRuns: ScheduleQueuedRun[];
+export interface ScheduleSummary extends ScheduleMetadata {
 }
 /**
  * Filter criteria for `engine.listSchedules`. All fields are optional.

package/dist/core/validation-issues.d.ts

@@ -0,0 +1,13 @@
+import type { ZodIssue } from 'zod';
+/** A flattened Zod issue suitable for cross-transport serialization. */
+export type ValidationIssue = {
+    readonly path: ReadonlyArray<string | number>;
+    readonly message: string;
+    readonly code: string;
+};
+/**
+ * Convert a Zod issue into the stable diagnostic shape used by core validators.
+ * Path segments outside the JSON-friendly string and number forms are rendered
+ * with their string representation, preserving the original issue order.
+ */
+export declare function flattenZodIssue(issue: ZodIssue): ValidationIssue;

package/dist/core/validation-issues.js

@@ -0,0 +1,9 @@
+export function flattenZodIssue(issue) {
+  const path = [];
+  for (const segment of issue.path)
+    if (typeof segment === "string" || typeof segment === "number")
+      path.push(segment);
+    else
+      path.push(String(segment));
+  return { path, message: issue.message, code: issue.code };
+}

package/dist/http.js

@@ -1,2 +1,2 @@
 async function*R(F,G){if(F.body===null)return;let J=F.body.getReader(),Q=new TextDecoder,Z="",$=0,j=!1;try{while(!0){let{done:y,value:z}=await J.read();if(y){j=!0;break}if($+=z.byteLength,$>G.maximumBytes)throw G.sizeLimitError();Z+=Q.decode(z,{stream:!0});let A=Z.split(`
-`);Z=A.pop()??"";for(let g of A)yield g}if(Z+=Q.decode(),Z.length>0)yield Z}finally{if(!j)try{await J.cancel()}catch{}J.releaseLock()}}function N(F){let G=[];for(let J=0;J<F.length;J+=512)G.push(String.fromCharCode(...F.subarray(J,J+512)));return btoa(G.join(""))}function B(F){let G=atob(F),J=new Uint8Array(G.length);for(let Q=0;Q<G.length;Q+=1)J[Q]=G.charCodeAt(Q);return J}function q(F){return typeof F==="object"&&F!==null&&!Array.isArray(F)}async function _(F,G){return await F.get(G)!==null}async function*X(F,G,J){for await(let[Q]of F.scan(G,J))yield Q}async function H(F,G){let J=0;for await(let Q of X(F,G))J++;return J}async function L(F,G){let J=[];for await(let Q of X(F,G))J.push({type:"delete",key:Q});if(J.length===0)return 0;return await F.batch(J),J.length}async function U(F,G,J){let Q=[];for await(let Z of X(F,G,J))Q.push({type:"delete",key:Z});if(Q.length===0)return 0;return await F.batch(Q),Q.length}function C(F,G,J){if(!F.capabilities()[G])throw Error(`Feature "${J}" requires storage capability "${G}", but this storage backend does not provide it.`)}var D=1e4;class T extends Error{code="StorageBatchOperationLimitExceededError";cap=D;count;target;constructor(F,G){super(`${F} count ${G} exceeds MAX_BATCH_OPERATIONS (${D}).`);this.name="StorageBatchOperationLimitExceededError",this.target=F,this.count=G}}function M(F,G){if(G>D)throw new T(F,G)}function S(F){return F.length>0?F.slice(0,-1)+String.fromCharCode(F.charCodeAt(F.length-1)+1):"ÿ"}function e(F,G={}){if(G.gt!==void 0&&F<=G.gt)return!1;if(G.gte!==void 0&&F<G.gte)return!1;if(G.lt!==void 0&&F>=G.lt)return!1;if(G.lte!==void 0&&F>G.lte)return!1;return!0}function FF(F,G){if(F===null||G===null)return F===G;if(F.byteLength!==G.byteLength)return!1;for(let J=0;J<F.byteLength;J++)if(F[J]!==G[J])return!1;return!0}async function K(F,G){if(F.has)return F.has(G);return _(F,G)}function P(F,G,J){if(F.keys)return F.keys(G,J);return X(F,G,J)}async function O(F,G){if(F.count)return F.count(G);return H(F,G)}async function b(F,G){if(F.deletePrefix)return F.deletePrefix(G);return L(F,G)}async function v(F,G,J){if(M("conditionalBatch conditions",G.length),M("conditionalBatch operations",J.length),C(F,"conditionalBatch","storageConditionalBatch"),!F.conditionalBatch)throw Error("This storage backend reports conditionalBatch capability but does not implement the conditionalBatch() method.");return F.conditionalBatch(G,J)}function c(F){if(F===void 0)return;if(typeof F!=="number"||!Number.isInteger(F)||F<0)throw Error("deleteRange limit must be a finite non-negative integer");return F===0?0:F}function V(F){let G={},J=!1;for(let Z of["gt","gte","lt","lte"]){let $=F[Z];if($===void 0)continue;if(typeof $!=="string")throw Error("deleteRange bounds must be strings");G[Z]=$,J=!0}if(!J)throw Error("deleteRange requires at least one of gt/gte/lt/lte; use deletePrefix to delete a whole prefix");let Q=c(F.limit);if(Q!==void 0)G.limit=Q;return G}async function h(F,G,J){let Q=V(J);if(F.deleteRange)return F.deleteRange(G,Q);return U(F,G,Q)}function I(F,G){let J={key:F,open:!1};if(G.gte!==void 0&&G.gte>J.key)J.key=G.gte,J.open=!1;if(G.gt!==void 0&&G.gt>=J.key)J.key=G.gt,J.open=!0;return J}function u(F,G){let J={key:S(F),open:!0};if(G.lt!==void 0&&G.lt<=J.key)J.key=G.lt,J.open=!0;if(G.lte!==void 0&&G.lte<J.key)J.key=G.lte,J.open=!1;return J}function ZF(F,G){let J=I(F,G),Q=u(F,G);if(J.key>Q.key||J.key===Q.key&&(J.open||Q.open))return null;return{lower:J,upper:Q}}function E(F){return F.replaceAll(/:+$/g,"")}function k(F,G){let J=E(F),Q=E(G);if(J.length===0)return Q;if(Q.length===0)return J;return`${J}:${Q}`}class W{#G;#J;constructor(F,G){this.#G=F,this.#J=E(G)}#F(F){if(this.#J.length===0)return F;return F.length===0?`${this.#J}:`:`${this.#J}:${F}`}#Q(F){if(this.#J.length===0)return F;return F.slice(this.#J.length+1)}#Z(F={}){let G={};if(F.limit!==void 0)G.limit=F.limit;if(F.reverse!==void 0)G.reverse=F.reverse;if(F.gt!==void 0)G.gt=this.#F(F.gt);if(F.gte!==void 0)G.gte=this.#F(F.gte);if(F.lt!==void 0)G.lt=this.#F(F.lt);if(F.lte!==void 0)G.lte=this.#F(F.lte);return G}#M(F){let G={};if(F.limit!==void 0)G.limit=F.limit;if(F.gt!==void 0)G.gt=this.#F(F.gt);if(F.gte!==void 0)G.gte=this.#F(F.gte);if(F.lt!==void 0)G.lt=this.#F(F.lt);if(F.lte!==void 0)G.lte=this.#F(F.lte);return G}capabilities(){return this.#G.capabilities()}scoped(F){return new W(this.#G,k(this.#J,F))}async get(F){return this.#G.get(this.#F(F))}async put(F,G){await this.#G.put(this.#F(F),G)}async delete(F){await this.#G.delete(this.#F(F))}async*scan(F,G){for await(let[J,Q]of this.#G.scan(this.#F(F),this.#Z(G)))yield[this.#Q(J),Q]}async batch(F){M("batch operations",F.length),await this.#G.batch(F.map((G)=>{if(G.type==="put")return{type:"put",key:this.#F(G.key),value:G.value};return{type:"delete",key:this.#F(G.key)}}))}async conditionalBatch(F,G){return v(this.#G,F.map((J)=>({key:this.#F(J.key),expectedValue:J.expectedValue})),G.map((J)=>{if(J.type==="put")return{type:"put",key:this.#F(J.key),value:J.value};return{type:"delete",key:this.#F(J.key)}}))}async has(F){return K(this.#G,this.#F(F))}async deletePrefix(F){return b(this.#G,this.#F(F))}async deleteRange(F,G){let J=this.#M(V(G));return h(this.#G,this.#F(F),J)}async*keys(F,G){for await(let J of P(this.#G,this.#F(F),this.#Z(G)))yield this.#Q(J)}async count(F){return O(this.#G,this.#F(F))}[Symbol.dispose](){this.#G[Symbol.dispose]()}}function m(F,G){return new W(F,G)}var w=67108864;function x(F){if(F.type==="put")return{type:"put",key:F.key,value:N(F.value)};return{type:"delete",key:F.key}}function f(F){return{key:F.key,expectedValue:F.expectedValue===null?null:N(F.expectedValue)}}function d(F){if(!q(F)||typeof F.key!=="string"||typeof F.value!=="string")throw Error("HTTPStorage scan response contained an invalid NDJSON entry.");return{key:F.key,value:F.value}}function l(F){if(!q(F)||typeof F.applied!=="boolean")throw Error('HTTPStorage conditional batch response must include a boolean "applied" field.');return F.applied}function Y(F,G,J){if(J!==void 0)F.searchParams.set(G,String(J))}function p(F){if(F.trim().length===0)return null;let G=d(JSON.parse(F));return[G.key,B(G.value)]}class a{#G;#J;#F;constructor(F){this.#G=F.baseUrl instanceof URL?F.baseUrl:new URL(F.baseUrl),this.#J={...F.headers},this.#F=F.remoteConditionalBatch??!1}capabilities(){return{persistence:"remote",readAfterWrite:"eventual",scanConsistency:"best-effort",atomicBatch:!0,conditionalBatch:this.#F,boundedRangeDelete:!1}}#Q(F){let G=this.#G.href.endsWith("/")?this.#G.href:`${this.#G.href}/`;return new URL(F.replace(/^\/+/,""),G)}#Z(F){return this.#Q(`/v1/storage/${encodeURIComponent(F)}`)}#M(F,G){let J=this.#Q("/v1/storage");return J.searchParams.set("prefix",F),Y(J,"limit",G.limit),Y(J,"reverse",G.reverse),Y(J,"gt",G.gt),Y(J,"gte",G.gte),Y(J,"lt",G.lt),Y(J,"lte",G.lte),J}async#$(F,G={},J=[]){let Q=new Headers(this.#J);for(let[$,j]of new Headers(G.headers).entries())Q.set($,j);let Z=await fetch(F,{...G,headers:Q});if(!Z.ok&&!J.includes(Z.status))throw Error(`HTTPStorage request failed: ${G.method??"GET"} ${F.pathname} returned ${String(Z.status)}.`);return Z}async get(F){let G=await this.#$(this.#Z(F),{method:"GET"},[404]);if(G.status===404)return null;return new Uint8Array(await G.arrayBuffer())}async put(F,G){await this.#$(this.#Z(F),{method:"PUT",headers:{"content-type":"application/octet-stream"},body:new Blob([G])})}async delete(F){await this.#$(this.#Z(F),{method:"DELETE"})}async*scan(F,G={}){let J=await this.#$(this.#M(F,G),{method:"GET",headers:{accept:"application/x-ndjson"}});for await(let Q of R(J,{maximumBytes:w,sizeLimitError:()=>Error("HTTPStorage scan response exceeded the maximum allowed size.")})){let Z=p(Q);if(Z!==null)yield Z}}async batch(F){M("batch operations",F.length),await this.#$(this.#Q("/v1/storage/-/batch"),{method:"POST",headers:{"content-type":"application/json"},body:JSON.stringify({operations:F.map(x)})})}async conditionalBatch(F,G){M("conditionalBatch conditions",F.length),M("conditionalBatch operations",G.length);let J=await this.#$(this.#Q("/v1/storage/-/conditional-batch"),{method:"POST",headers:{"content-type":"application/json"},body:JSON.stringify({conditions:F.map(f),operations:G.map(x)})});return l(await J.json())}has(F){return _(this,F)}async*keys(F,G){yield*X(this,F,G)}count(F){return H(this,F)}deletePrefix(F){return L(this,F)}deleteRange(F,G){return U(this,F,V(G))}scoped(F){return m(this,F)}[Symbol.dispose](){}}export{a as HTTPStorage};
+`);Z=A.pop()??"";for(let g of A)yield g}if(Z+=Q.decode(),Z.length>0)yield Z}finally{if(!j)try{await J.cancel()}catch{}J.releaseLock()}}function N(F){let G=[];for(let J=0;J<F.length;J+=512)G.push(String.fromCharCode(...F.subarray(J,J+512)));return btoa(G.join(""))}function B(F){let G=atob(F),J=new Uint8Array(G.length);for(let Q=0;Q<G.length;Q+=1)J[Q]=G.charCodeAt(Q);return J}function q(F){return typeof F==="object"&&F!==null&&!Array.isArray(F)}async function _(F,G){return await F.get(G)!==null}async function*X(F,G,J){for await(let[Q]of F.scan(G,J))yield Q}async function H(F,G){let J=0;for await(let Q of X(F,G))J++;return J}async function L(F,G){let J=[];for await(let Q of X(F,G))J.push({type:"delete",key:Q});if(J.length===0)return 0;return await F.batch(J),J.length}async function U(F,G,J){let Q=[];for await(let Z of X(F,G,J))Q.push({type:"delete",key:Z});if(Q.length===0)return 0;return await F.batch(Q),Q.length}function C(F,G,J){if(!F.capabilities()[G])throw Error(`Feature "${J}" requires storage capability "${G}", but this storage backend does not provide it.`)}var D=1e4;class T extends Error{code="StorageBatchOperationLimitExceededError";cap=D;count;target;constructor(F,G){super(`${F} count ${G} exceeds MAX_BATCH_OPERATIONS (${D}).`);this.name="StorageBatchOperationLimitExceededError",this.target=F,this.count=G}}function M(F,G){if(G>D)throw new T(F,G)}function K(F){return F.length>0?F.slice(0,-1)+String.fromCharCode(F.charCodeAt(F.length-1)+1):"ÿ"}function e(F,G={}){if(G.gt!==void 0&&F<=G.gt)return!1;if(G.gte!==void 0&&F<G.gte)return!1;if(G.lt!==void 0&&F>=G.lt)return!1;if(G.lte!==void 0&&F>G.lte)return!1;return!0}function FF(F,G){if(F===null||G===null)return F===G;if(F.byteLength!==G.byteLength)return!1;for(let J=0;J<F.byteLength;J++)if(F[J]!==G[J])return!1;return!0}async function S(F,G){if(F.has)return F.has(G);return _(F,G)}function P(F,G,J){if(F.keys)return F.keys(G,J);return X(F,G,J)}async function O(F,G){if(F.count)return F.count(G);return H(F,G)}async function b(F,G){if(F.deletePrefix)return F.deletePrefix(G);return L(F,G)}async function v(F,G,J){if(M("conditionalBatch conditions",G.length),M("conditionalBatch operations",J.length),C(F,"conditionalBatch","storageConditionalBatch"),!F.conditionalBatch)throw Error("This storage backend reports conditionalBatch capability but does not implement the conditionalBatch() method.");return F.conditionalBatch(G,J)}function c(F){if(F===void 0)return;if(typeof F!=="number"||!Number.isInteger(F)||F<0)throw Error("deleteRange limit must be a finite non-negative integer");return F===0?0:F}function V(F){let G={},J=!1;for(let Z of["gt","gte","lt","lte"]){let $=F[Z];if($===void 0)continue;if(typeof $!=="string")throw Error("deleteRange bounds must be strings");G[Z]=$,J=!0}if(!J)throw Error("deleteRange requires at least one of gt/gte/lt/lte; use deletePrefix to delete a whole prefix");let Q=c(F.limit);if(Q!==void 0)G.limit=Q;return G}async function h(F,G,J){let Q=V(J);if(F.deleteRange)return F.deleteRange(G,Q);return U(F,G,Q)}function I(F,G){let J={key:F,open:!1};if(G.gte!==void 0&&G.gte>J.key)J.key=G.gte,J.open=!1;if(G.gt!==void 0&&G.gt>=J.key)J.key=G.gt,J.open=!0;return J}function u(F,G){let J={key:K(F),open:!0};if(G.lt!==void 0&&G.lt<=J.key)J.key=G.lt,J.open=!0;if(G.lte!==void 0&&G.lte<J.key)J.key=G.lte,J.open=!1;return J}function ZF(F,G){let J=I(F,G),Q=u(F,G);if(J.key>Q.key||J.key===Q.key&&(J.open||Q.open))return null;return{lower:J,upper:Q}}function E(F){return F.replaceAll(/:+$/g,"")}function k(F,G){let J=E(F),Q=E(G);if(J.length===0)return Q;if(Q.length===0)return J;return`${J}:${Q}`}class W{#G;#J;constructor(F,G){this.#G=F,this.#J=E(G)}#F(F){if(this.#J.length===0)return F;return F.length===0?`${this.#J}:`:`${this.#J}:${F}`}#Z(F){return F.map((G)=>{if(G.type==="put")return{type:"put",key:this.#F(G.key),value:G.value};return{type:"delete",key:this.#F(G.key)}})}#$(F){if(this.#J.length===0)return F;return F.slice(this.#J.length+1)}#M(F={}){let G={};if(F.limit!==void 0)G.limit=F.limit;if(F.reverse!==void 0)G.reverse=F.reverse;if(F.gt!==void 0)G.gt=this.#F(F.gt);if(F.gte!==void 0)G.gte=this.#F(F.gte);if(F.lt!==void 0)G.lt=this.#F(F.lt);if(F.lte!==void 0)G.lte=this.#F(F.lte);return G}#Q(F){let G={};if(F.limit!==void 0)G.limit=F.limit;if(F.gt!==void 0)G.gt=this.#F(F.gt);if(F.gte!==void 0)G.gte=this.#F(F.gte);if(F.lt!==void 0)G.lt=this.#F(F.lt);if(F.lte!==void 0)G.lte=this.#F(F.lte);return G}capabilities(){return this.#G.capabilities()}scoped(F){return new W(this.#G,k(this.#J,F))}async get(F){return this.#G.get(this.#F(F))}async put(F,G){await this.#G.put(this.#F(F),G)}async delete(F){await this.#G.delete(this.#F(F))}async*scan(F,G){for await(let[J,Q]of this.#G.scan(this.#F(F),this.#M(G)))yield[this.#$(J),Q]}async batch(F){M("batch operations",F.length),await this.#G.batch(this.#Z(F))}async conditionalBatch(F,G){return v(this.#G,F.map((J)=>({key:this.#F(J.key),expectedValue:J.expectedValue})),this.#Z(G))}async has(F){return S(this.#G,this.#F(F))}async deletePrefix(F){return b(this.#G,this.#F(F))}async deleteRange(F,G){let J=this.#Q(V(G));return h(this.#G,this.#F(F),J)}async*keys(F,G){for await(let J of P(this.#G,this.#F(F),this.#M(G)))yield this.#$(J)}async count(F){return O(this.#G,this.#F(F))}[Symbol.dispose](){this.#G[Symbol.dispose]()}}function m(F,G){return new W(F,G)}var w=67108864;function x(F){if(F.type==="put")return{type:"put",key:F.key,value:N(F.value)};return{type:"delete",key:F.key}}function f(F){return{key:F.key,expectedValue:F.expectedValue===null?null:N(F.expectedValue)}}function d(F){if(!q(F)||typeof F.key!=="string"||typeof F.value!=="string")throw Error("HTTPStorage scan response contained an invalid NDJSON entry.");return{key:F.key,value:F.value}}function l(F){if(!q(F)||typeof F.applied!=="boolean")throw Error('HTTPStorage conditional batch response must include a boolean "applied" field.');return F.applied}function Y(F,G,J){if(J!==void 0)F.searchParams.set(G,String(J))}function p(F){if(F.trim().length===0)return null;let G=d(JSON.parse(F));return[G.key,B(G.value)]}class a{#G;#J;#F;constructor(F){this.#G=F.baseUrl instanceof URL?F.baseUrl:new URL(F.baseUrl),this.#J={...F.headers},this.#F=F.remoteConditionalBatch??!1}capabilities(){return{persistence:"remote",readAfterWrite:"eventual",scanConsistency:"best-effort",atomicBatch:!0,conditionalBatch:this.#F,boundedRangeDelete:!1}}#Z(F){let G=this.#G.href.endsWith("/")?this.#G.href:`${this.#G.href}/`;return new URL(F.replace(/^\/+/,""),G)}#$(F){return this.#Z(`/v1/storage/${encodeURIComponent(F)}`)}#M(F,G){let J=this.#Z("/v1/storage");return J.searchParams.set("prefix",F),Y(J,"limit",G.limit),Y(J,"reverse",G.reverse),Y(J,"gt",G.gt),Y(J,"gte",G.gte),Y(J,"lt",G.lt),Y(J,"lte",G.lte),J}async#Q(F,G={},J=[]){let Q=new Headers(this.#J);for(let[$,j]of new Headers(G.headers).entries())Q.set($,j);let Z=await fetch(F,{...G,headers:Q});if(!Z.ok&&!J.includes(Z.status))throw Error(`HTTPStorage request failed: ${G.method??"GET"} ${F.pathname} returned ${String(Z.status)}.`);return Z}async get(F){let G=await this.#Q(this.#$(F),{method:"GET"},[404]);if(G.status===404)return null;return new Uint8Array(await G.arrayBuffer())}async put(F,G){await this.#Q(this.#$(F),{method:"PUT",headers:{"content-type":"application/octet-stream"},body:new Blob([G])})}async delete(F){await this.#Q(this.#$(F),{method:"DELETE"})}async*scan(F,G={}){let J=await this.#Q(this.#M(F,G),{method:"GET",headers:{accept:"application/x-ndjson"}});for await(let Q of R(J,{maximumBytes:w,sizeLimitError:()=>Error("HTTPStorage scan response exceeded the maximum allowed size.")})){let Z=p(Q);if(Z!==null)yield Z}}async batch(F){M("batch operations",F.length),await this.#Q(this.#Z("/v1/storage/-/batch"),{method:"POST",headers:{"content-type":"application/json"},body:JSON.stringify({operations:F.map(x)})})}async conditionalBatch(F,G){M("conditionalBatch conditions",F.length),M("conditionalBatch operations",G.length);let J=await this.#Q(this.#Z("/v1/storage/-/conditional-batch"),{method:"POST",headers:{"content-type":"application/json"},body:JSON.stringify({conditions:F.map(f),operations:G.map(x)})});return l(await J.json())}has(F){return _(this,F)}async*keys(F,G){yield*X(this,F,G)}count(F){return H(this,F)}deletePrefix(F){return L(this,F)}deleteRange(F,G){return U(this,F,V(G))}scoped(F){return m(this,F)}[Symbol.dispose](){}}export{a as HTTPStorage};

package/dist/indexeddb.js

@@ -1 +1 @@
-async function q(G,J){return await G.get(J)!==null}async function*N(G,J,Q){for await(let[X]of G.scan(J,Q))yield X}async function O(G,J){let Q=0;for await(let X of N(G,J))Q++;return Q}async function R(G,J){let Q=[];for await(let X of N(G,J))Q.push({type:"delete",key:X});if(Q.length===0)return 0;return await G.batch(Q),Q.length}async function h(G,J,Q){let X=[];for await(let Y of N(G,J,Q))X.push({type:"delete",key:Y});if(X.length===0)return 0;return await G.batch(X),X.length}function v(G,J,Q){if(!G.capabilities()[J])throw Error(`Feature "${Q}" requires storage capability "${J}", but this storage backend does not provide it.`)}var A=1e4;class E extends Error{code="StorageBatchOperationLimitExceededError";cap=A;count;target;constructor(G,J){super(`${G} count ${J} exceeds MAX_BATCH_OPERATIONS (${A}).`);this.name="StorageBatchOperationLimitExceededError",this.target=G,this.count=J}}function M(G,J){if(J>A)throw new E(G,J)}function j(G){return G.length>0?G.slice(0,-1)+String.fromCharCode(G.charCodeAt(G.length-1)+1):"ÿ"}function S(G,J={}){if(J.gt!==void 0&&G<=J.gt)return!1;if(J.gte!==void 0&&G<J.gte)return!1;if(J.lt!==void 0&&G>=J.lt)return!1;if(J.lte!==void 0&&G>J.lte)return!1;return!0}function b(G,J){if(G===null||J===null)return G===J;if(G.byteLength!==J.byteLength)return!1;for(let Q=0;Q<G.byteLength;Q++)if(G[Q]!==J[Q])return!1;return!0}async function m(G,J){if(G.has)return G.has(J);return q(G,J)}function x(G,J,Q){if(G.keys)return G.keys(J,Q);return N(G,J,Q)}async function y(G,J){if(G.count)return G.count(J);return O(G,J)}async function I(G,J){if(G.deletePrefix)return G.deletePrefix(J);return R(G,J)}async function g(G,J,Q){if(M("conditionalBatch conditions",J.length),M("conditionalBatch operations",Q.length),v(G,"conditionalBatch","storageConditionalBatch"),!G.conditionalBatch)throw Error("This storage backend reports conditionalBatch capability but does not implement the conditionalBatch() method.");return G.conditionalBatch(J,Q)}function l(G){if(G===void 0)return;if(typeof G!=="number"||!Number.isInteger(G)||G<0)throw Error("deleteRange limit must be a finite non-negative integer");return G===0?0:G}function T(G){let J={},Q=!1;for(let Y of["gt","gte","lt","lte"]){let $=G[Y];if($===void 0)continue;if(typeof $!=="string")throw Error("deleteRange bounds must be strings");J[Y]=$,Q=!0}if(!Q)throw Error("deleteRange requires at least one of gt/gte/lt/lte; use deletePrefix to delete a whole prefix");let X=l(G.limit);if(X!==void 0)J.limit=X;return J}async function k(G,J,Q){let X=T(Q);if(G.deleteRange)return G.deleteRange(J,X);return h(G,J,X)}function p(G,J){let Q={key:G,open:!1};if(J.gte!==void 0&&J.gte>Q.key)Q.key=J.gte,Q.open=!1;if(J.gt!==void 0&&J.gt>=Q.key)Q.key=J.gt,Q.open=!0;return Q}function d(G,J){let Q={key:j(G),open:!0};if(J.lt!==void 0&&J.lt<=Q.key)Q.key=J.lt,Q.open=!0;if(J.lte!==void 0&&J.lte<Q.key)Q.key=J.lte,Q.open=!1;return Q}function c(G,J){let Q=p(G,J),X=d(G,J);if(Q.key>X.key||Q.key===X.key&&(Q.open||X.open))return null;return{lower:Q,upper:X}}function P(G){return G.replaceAll(/:+$/g,"")}function a(G,J){let Q=P(G),X=P(J);if(Q.length===0)return X;if(X.length===0)return Q;return`${Q}:${X}`}class C{#J;#Q;constructor(G,J){this.#J=G,this.#Q=P(J)}#G(G){if(this.#Q.length===0)return G;return G.length===0?`${this.#Q}:`:`${this.#Q}:${G}`}#X(G){if(this.#Q.length===0)return G;return G.slice(this.#Q.length+1)}#Y(G={}){let J={};if(G.limit!==void 0)J.limit=G.limit;if(G.reverse!==void 0)J.reverse=G.reverse;if(G.gt!==void 0)J.gt=this.#G(G.gt);if(G.gte!==void 0)J.gte=this.#G(G.gte);if(G.lt!==void 0)J.lt=this.#G(G.lt);if(G.lte!==void 0)J.lte=this.#G(G.lte);return J}#Z(G){let J={};if(G.limit!==void 0)J.limit=G.limit;if(G.gt!==void 0)J.gt=this.#G(G.gt);if(G.gte!==void 0)J.gte=this.#G(G.gte);if(G.lt!==void 0)J.lt=this.#G(G.lt);if(G.lte!==void 0)J.lte=this.#G(G.lte);return J}capabilities(){return this.#J.capabilities()}scoped(G){return new C(this.#J,a(this.#Q,G))}async get(G){return this.#J.get(this.#G(G))}async put(G,J){await this.#J.put(this.#G(G),J)}async delete(G){await this.#J.delete(this.#G(G))}async*scan(G,J){for await(let[Q,X]of this.#J.scan(this.#G(G),this.#Y(J)))yield[this.#X(Q),X]}async batch(G){M("batch operations",G.length),await this.#J.batch(G.map((J)=>{if(J.type==="put")return{type:"put",key:this.#G(J.key),value:J.value};return{type:"delete",key:this.#G(J.key)}}))}async conditionalBatch(G,J){return g(this.#J,G.map((Q)=>({key:this.#G(Q.key),expectedValue:Q.expectedValue})),J.map((Q)=>{if(Q.type==="put")return{type:"put",key:this.#G(Q.key),value:Q.value};return{type:"delete",key:this.#G(Q.key)}}))}async has(G){return m(this.#J,this.#G(G))}async deletePrefix(G){return I(this.#J,this.#G(G))}async deleteRange(G,J){let Q=this.#Z(T(J));return k(this.#J,this.#G(G),Q)}async*keys(G,J){for await(let Q of x(this.#J,this.#G(G),this.#Y(J)))yield this.#X(Q)}async count(G){return y(this.#J,this.#G(G))}[Symbol.dispose](){this.#J[Symbol.dispose]()}}function u(G,J){return new C(G,J)}var U="kv";function s(G=globalThis){let{indexedDB:J,IDBKeyRange:Q}=G;if(J===void 0||Q===void 0)throw Error("IndexedDBStorage requires both indexedDB and IDBKeyRange runtime globals.");return{indexedDB:J,IDBKeyRange:Q}}function K(G){return new Promise((J,Q)=>{G.onsuccess=()=>J(G.result),G.onerror=()=>Q(G.error)})}function w(G,J){let Q=null,X=null,Y=null,$=(Z,V)=>{let H=Z??Error(V);if(X){let B=X;Q=null,X=null,B(H);return}Y=H};return G.onsuccess=()=>{if(!Q)return;let Z=Q;Q=null,X=null,Z(G.result)},G.onerror=()=>{$(G.error,"IndexedDB cursor request failed.")},J.onerror=()=>{$(J.error,"IndexedDB transaction failed.")},J.onabort=()=>{$(J.error,"IndexedDB transaction aborted.")},()=>{return new Promise((Z,V)=>{if(Y){let H=Y;Y=null,V(H);return}if(Q=Z,X=V,G.readyState==="done"){let H=Q;Q=null,X=null,H?.(G.result)}})}}class n{#J;#Q=null;#G;#X;constructor(G="weft",J=s()){this.#J=G,this.#X=J,this.#G=this.#Y()}capabilities(){return{persistence:"local",readAfterWrite:"linearizable",scanConsistency:"best-effort",atomicBatch:!0,conditionalBatch:!0,boundedRangeDelete:!0}}#Y(){let G=this.#X.indexedDB.open(this.#J,1);return G.onupgradeneeded=()=>{let J=G.result;if(!J.objectStoreNames.contains(U))J.createObjectStore(U)},K(G).then((J)=>{return this.#Q=J,J})}async get(G){let X=(await this.#G).transaction(U,"readonly").objectStore(U),Y=await K(X.get(G));return Y===void 0?null:new Uint8Array(Y)}async put(G,J){let Y=(await this.#G).transaction(U,"readwrite").objectStore(U);await K(Y.put(J,G))}async delete(G){let X=(await this.#G).transaction(U,"readwrite").objectStore(U);await K(X.delete(G))}async has(G){let X=(await this.#G).transaction(U,"readonly").objectStore(U);return await K(X.count(G))>0}async deletePrefix(G){let J=await this.#G,Q=j(G),X=this.#X.IDBKeyRange.bound(G,Q,!1,!0);return new Promise((Y,$)=>{let Z=J.transaction(U,"readwrite"),V=Z.objectStore(U),H=0,B=V.count(X);B.onsuccess=()=>{H=B.result,V.delete(X)},Z.oncomplete=()=>Y(H),Z.onerror=()=>$(Z.error)})}async deleteRange(G,J){let Q=T(J),X=c(G,Q);if(X===null)return 0;let Y=this.#X.IDBKeyRange.bound(X.lower.key,X.upper.key,X.lower.open,X.upper.open),$=await this.#G,{limit:Z}=Q;return new Promise((V,H)=>{let B=$.transaction(U,"readwrite"),z=B.objectStore(U),D=0;if(Z===void 0){let F=z.count(Y);F.onsuccess=()=>{D=F.result,z.delete(Y)}}else{let F=z.openCursor(Y,"next");F.onsuccess=()=>{let W=F.result;if(W===null||D>=Z)return;if(W.delete(),D++,D<Z)W.continue()}}B.oncomplete=()=>V(D),B.onerror=()=>H(B.error)})}async*scan(G,J={}){let{limit:Q,reverse:X}=J,Y=await this.#G,$=j(G),Z=this.#X.IDBKeyRange.bound(G,$,!1,!0),V=X?"prev":"next",H=Y.transaction(U,"readonly"),z=H.objectStore(U).openCursor(Z,V),D=0,F=w(z,H),W=!1;try{let L=await F();while(L){if(Q!==void 0&&D>=Q)break;let _=L.key;if(S(_,J))yield[_,new Uint8Array(L.value)],D++;L.continue(),L=await F()}W=!0}finally{if(!W)try{H.abort()}catch{}}}async batch(G){if(M("batch operations",G.length),G.length===0)return;let J=await this.#G;return new Promise((Q,X)=>{let Y=J.transaction(U,"readwrite"),$=Y.objectStore(U);for(let Z of G)if(Z.type==="put")$.put(Z.value,Z.key);else $.delete(Z.key);Y.oncomplete=()=>Q(),Y.onerror=()=>X(Y.error)})}async conditionalBatch(G,J){M("conditionalBatch conditions",G.length),M("conditionalBatch operations",J.length);let Q=await this.#G;return new Promise((X,Y)=>{let $=Q.transaction(U,"readwrite"),Z=$.objectStore(U),V=!1,H=!1,B=(F,W)=>{if(V)return;V=!0,Y(F??Error(W))};$.oncomplete=()=>{if(V)return;V=!0,X(!0)},$.onerror=()=>{B($.error,"IndexedDB conditionalBatch transaction failed.")},$.onabort=()=>{if(V)return;if(V=!0,H){X(!1);return}Y($.error??Error("IndexedDB conditionalBatch transaction aborted."))};let z=()=>{for(let F of J)if(F.type==="put")Z.put(F.value,F.key);else Z.delete(F.key)},D=(F)=>{if(F>=G.length){z();return}let W=G[F],L=Z.get(W.key);L.onsuccess=()=>{let _=L.result,f=_===void 0?null:new Uint8Array(_);if(!b(f,W.expectedValue)){H=!0,$.abort();return}D(F+1)},L.onerror=()=>{B(L.error,"IndexedDB conditionalBatch condition check failed.")}};D(0)})}async*keys(G,J={}){let{limit:Q,reverse:X}=J,Y=await this.#G,$=j(G),Z=this.#X.IDBKeyRange.bound(G,$,!1,!0),V=X?"prev":"next",H=Y.transaction(U,"readonly"),z=H.objectStore(U).openKeyCursor(Z,V),D=0,F=w(z,H),W=!1;try{let L=await F();while(L){if(Q!==void 0&&D>=Q)break;let _=L.key;if(S(_,J))yield _,D++;L.continue(),L=await F()}W=!0}finally{if(!W)try{H.abort()}catch{}}}async count(G){let J=await this.#G,Q=j(G),Y=J.transaction(U,"readonly").objectStore(U);return K(Y.count(this.#X.IDBKeyRange.bound(G,Q,!1,!0)))}scoped(G){return u(this,G)}[Symbol.dispose](){if(this.#Q)this.#Q.close(),this.#Q=null}}export{n as IndexedDBStorage};
+async function q(G,J){return await G.get(J)!==null}async function*N(G,J,Q){for await(let[X]of G.scan(J,Q))yield X}async function O(G,J){let Q=0;for await(let X of N(G,J))Q++;return Q}async function R(G,J){let Q=[];for await(let X of N(G,J))Q.push({type:"delete",key:X});if(Q.length===0)return 0;return await G.batch(Q),Q.length}async function h(G,J,Q){let X=[];for await(let Y of N(G,J,Q))X.push({type:"delete",key:Y});if(X.length===0)return 0;return await G.batch(X),X.length}function v(G,J,Q){if(!G.capabilities()[J])throw Error(`Feature "${Q}" requires storage capability "${J}", but this storage backend does not provide it.`)}var A=1e4;class E extends Error{code="StorageBatchOperationLimitExceededError";cap=A;count;target;constructor(G,J){super(`${G} count ${J} exceeds MAX_BATCH_OPERATIONS (${A}).`);this.name="StorageBatchOperationLimitExceededError",this.target=G,this.count=J}}function M(G,J){if(J>A)throw new E(G,J)}function j(G){return G.length>0?G.slice(0,-1)+String.fromCharCode(G.charCodeAt(G.length-1)+1):"ÿ"}function S(G,J={}){if(J.gt!==void 0&&G<=J.gt)return!1;if(J.gte!==void 0&&G<J.gte)return!1;if(J.lt!==void 0&&G>=J.lt)return!1;if(J.lte!==void 0&&G>J.lte)return!1;return!0}function b(G,J){if(G===null||J===null)return G===J;if(G.byteLength!==J.byteLength)return!1;for(let Q=0;Q<G.byteLength;Q++)if(G[Q]!==J[Q])return!1;return!0}async function m(G,J){if(G.has)return G.has(J);return q(G,J)}function x(G,J,Q){if(G.keys)return G.keys(J,Q);return N(G,J,Q)}async function y(G,J){if(G.count)return G.count(J);return O(G,J)}async function I(G,J){if(G.deletePrefix)return G.deletePrefix(J);return R(G,J)}async function g(G,J,Q){if(M("conditionalBatch conditions",J.length),M("conditionalBatch operations",Q.length),v(G,"conditionalBatch","storageConditionalBatch"),!G.conditionalBatch)throw Error("This storage backend reports conditionalBatch capability but does not implement the conditionalBatch() method.");return G.conditionalBatch(J,Q)}function l(G){if(G===void 0)return;if(typeof G!=="number"||!Number.isInteger(G)||G<0)throw Error("deleteRange limit must be a finite non-negative integer");return G===0?0:G}function T(G){let J={},Q=!1;for(let Y of["gt","gte","lt","lte"]){let $=G[Y];if($===void 0)continue;if(typeof $!=="string")throw Error("deleteRange bounds must be strings");J[Y]=$,Q=!0}if(!Q)throw Error("deleteRange requires at least one of gt/gte/lt/lte; use deletePrefix to delete a whole prefix");let X=l(G.limit);if(X!==void 0)J.limit=X;return J}async function k(G,J,Q){let X=T(Q);if(G.deleteRange)return G.deleteRange(J,X);return h(G,J,X)}function p(G,J){let Q={key:G,open:!1};if(J.gte!==void 0&&J.gte>Q.key)Q.key=J.gte,Q.open=!1;if(J.gt!==void 0&&J.gt>=Q.key)Q.key=J.gt,Q.open=!0;return Q}function d(G,J){let Q={key:j(G),open:!0};if(J.lt!==void 0&&J.lt<=Q.key)Q.key=J.lt,Q.open=!0;if(J.lte!==void 0&&J.lte<Q.key)Q.key=J.lte,Q.open=!1;return Q}function c(G,J){let Q=p(G,J),X=d(G,J);if(Q.key>X.key||Q.key===X.key&&(Q.open||X.open))return null;return{lower:Q,upper:X}}function P(G){return G.replaceAll(/:+$/g,"")}function a(G,J){let Q=P(G),X=P(J);if(Q.length===0)return X;if(X.length===0)return Q;return`${Q}:${X}`}class C{#J;#Q;constructor(G,J){this.#J=G,this.#Q=P(J)}#G(G){if(this.#Q.length===0)return G;return G.length===0?`${this.#Q}:`:`${this.#Q}:${G}`}#X(G){return G.map((J)=>{if(J.type==="put")return{type:"put",key:this.#G(J.key),value:J.value};return{type:"delete",key:this.#G(J.key)}})}#Y(G){if(this.#Q.length===0)return G;return G.slice(this.#Q.length+1)}#Z(G={}){let J={};if(G.limit!==void 0)J.limit=G.limit;if(G.reverse!==void 0)J.reverse=G.reverse;if(G.gt!==void 0)J.gt=this.#G(G.gt);if(G.gte!==void 0)J.gte=this.#G(G.gte);if(G.lt!==void 0)J.lt=this.#G(G.lt);if(G.lte!==void 0)J.lte=this.#G(G.lte);return J}#$(G){let J={};if(G.limit!==void 0)J.limit=G.limit;if(G.gt!==void 0)J.gt=this.#G(G.gt);if(G.gte!==void 0)J.gte=this.#G(G.gte);if(G.lt!==void 0)J.lt=this.#G(G.lt);if(G.lte!==void 0)J.lte=this.#G(G.lte);return J}capabilities(){return this.#J.capabilities()}scoped(G){return new C(this.#J,a(this.#Q,G))}async get(G){return this.#J.get(this.#G(G))}async put(G,J){await this.#J.put(this.#G(G),J)}async delete(G){await this.#J.delete(this.#G(G))}async*scan(G,J){for await(let[Q,X]of this.#J.scan(this.#G(G),this.#Z(J)))yield[this.#Y(Q),X]}async batch(G){M("batch operations",G.length),await this.#J.batch(this.#X(G))}async conditionalBatch(G,J){return g(this.#J,G.map((Q)=>({key:this.#G(Q.key),expectedValue:Q.expectedValue})),this.#X(J))}async has(G){return m(this.#J,this.#G(G))}async deletePrefix(G){return I(this.#J,this.#G(G))}async deleteRange(G,J){let Q=this.#$(T(J));return k(this.#J,this.#G(G),Q)}async*keys(G,J){for await(let Q of x(this.#J,this.#G(G),this.#Z(J)))yield this.#Y(Q)}async count(G){return y(this.#J,this.#G(G))}[Symbol.dispose](){this.#J[Symbol.dispose]()}}function u(G,J){return new C(G,J)}var U="kv";function s(G=globalThis){let{indexedDB:J,IDBKeyRange:Q}=G;if(J===void 0||Q===void 0)throw Error("IndexedDBStorage requires both indexedDB and IDBKeyRange runtime globals.");return{indexedDB:J,IDBKeyRange:Q}}function K(G){return new Promise((J,Q)=>{G.onsuccess=()=>J(G.result),G.onerror=()=>Q(G.error)})}function w(G,J){let Q=null,X=null,Y=null,$=(Z,V)=>{let H=Z??Error(V);if(X){let B=X;Q=null,X=null,B(H);return}Y=H};return G.onsuccess=()=>{if(!Q)return;let Z=Q;Q=null,X=null,Z(G.result)},G.onerror=()=>{$(G.error,"IndexedDB cursor request failed.")},J.onerror=()=>{$(J.error,"IndexedDB transaction failed.")},J.onabort=()=>{$(J.error,"IndexedDB transaction aborted.")},()=>{return new Promise((Z,V)=>{if(Y){let H=Y;Y=null,V(H);return}if(Q=Z,X=V,G.readyState==="done"){let H=Q;Q=null,X=null,H?.(G.result)}})}}class n{#J;#Q=null;#G;#X;constructor(G="weft",J=s()){this.#J=G,this.#X=J,this.#G=this.#Y()}capabilities(){return{persistence:"local",readAfterWrite:"linearizable",scanConsistency:"best-effort",atomicBatch:!0,conditionalBatch:!0,boundedRangeDelete:!0}}#Y(){let G=this.#X.indexedDB.open(this.#J,1);return G.onupgradeneeded=()=>{let J=G.result;if(!J.objectStoreNames.contains(U))J.createObjectStore(U)},K(G).then((J)=>{return this.#Q=J,J})}async get(G){let X=(await this.#G).transaction(U,"readonly").objectStore(U),Y=await K(X.get(G));return Y===void 0?null:new Uint8Array(Y)}async put(G,J){let Y=(await this.#G).transaction(U,"readwrite").objectStore(U);await K(Y.put(J,G))}async delete(G){let X=(await this.#G).transaction(U,"readwrite").objectStore(U);await K(X.delete(G))}async has(G){let X=(await this.#G).transaction(U,"readonly").objectStore(U);return await K(X.count(G))>0}async deletePrefix(G){let J=await this.#G,Q=j(G),X=this.#X.IDBKeyRange.bound(G,Q,!1,!0);return new Promise((Y,$)=>{let Z=J.transaction(U,"readwrite"),V=Z.objectStore(U),H=0,B=V.count(X);B.onsuccess=()=>{H=B.result,V.delete(X)},Z.oncomplete=()=>Y(H),Z.onerror=()=>$(Z.error)})}async deleteRange(G,J){let Q=T(J),X=c(G,Q);if(X===null)return 0;let Y=this.#X.IDBKeyRange.bound(X.lower.key,X.upper.key,X.lower.open,X.upper.open),$=await this.#G,{limit:Z}=Q;return new Promise((V,H)=>{let B=$.transaction(U,"readwrite"),z=B.objectStore(U),D=0;if(Z===void 0){let F=z.count(Y);F.onsuccess=()=>{D=F.result,z.delete(Y)}}else{let F=z.openCursor(Y,"next");F.onsuccess=()=>{let W=F.result;if(W===null||D>=Z)return;if(W.delete(),D++,D<Z)W.continue()}}B.oncomplete=()=>V(D),B.onerror=()=>H(B.error)})}async*scan(G,J={}){let{limit:Q,reverse:X}=J,Y=await this.#G,$=j(G),Z=this.#X.IDBKeyRange.bound(G,$,!1,!0),V=X?"prev":"next",H=Y.transaction(U,"readonly"),z=H.objectStore(U).openCursor(Z,V),D=0,F=w(z,H),W=!1;try{let L=await F();while(L){if(Q!==void 0&&D>=Q)break;let _=L.key;if(S(_,J))yield[_,new Uint8Array(L.value)],D++;L.continue(),L=await F()}W=!0}finally{if(!W)try{H.abort()}catch{}}}async batch(G){if(M("batch operations",G.length),G.length===0)return;let J=await this.#G;return new Promise((Q,X)=>{let Y=J.transaction(U,"readwrite"),$=Y.objectStore(U);for(let Z of G)if(Z.type==="put")$.put(Z.value,Z.key);else $.delete(Z.key);Y.oncomplete=()=>Q(),Y.onerror=()=>X(Y.error)})}async conditionalBatch(G,J){M("conditionalBatch conditions",G.length),M("conditionalBatch operations",J.length);let Q=await this.#G;return new Promise((X,Y)=>{let $=Q.transaction(U,"readwrite"),Z=$.objectStore(U),V=!1,H=!1,B=(F,W)=>{if(V)return;V=!0,Y(F??Error(W))};$.oncomplete=()=>{if(V)return;V=!0,X(!0)},$.onerror=()=>{B($.error,"IndexedDB conditionalBatch transaction failed.")},$.onabort=()=>{if(V)return;if(V=!0,H){X(!1);return}Y($.error??Error("IndexedDB conditionalBatch transaction aborted."))};let z=()=>{for(let F of J)if(F.type==="put")Z.put(F.value,F.key);else Z.delete(F.key)},D=(F)=>{if(F>=G.length){z();return}let W=G[F],L=Z.get(W.key);L.onsuccess=()=>{let _=L.result,f=_===void 0?null:new Uint8Array(_);if(!b(f,W.expectedValue)){H=!0,$.abort();return}D(F+1)},L.onerror=()=>{B(L.error,"IndexedDB conditionalBatch condition check failed.")}};D(0)})}async*keys(G,J={}){let{limit:Q,reverse:X}=J,Y=await this.#G,$=j(G),Z=this.#X.IDBKeyRange.bound(G,$,!1,!0),V=X?"prev":"next",H=Y.transaction(U,"readonly"),z=H.objectStore(U).openKeyCursor(Z,V),D=0,F=w(z,H),W=!1;try{let L=await F();while(L){if(Q!==void 0&&D>=Q)break;let _=L.key;if(S(_,J))yield _,D++;L.continue(),L=await F()}W=!0}finally{if(!W)try{H.abort()}catch{}}}async count(G){let J=await this.#G,Q=j(G),Y=J.transaction(U,"readonly").objectStore(U);return K(Y.count(this.#X.IDBKeyRange.bound(G,Q,!1,!0)))}scoped(G){return u(this,G)}[Symbol.dispose](){if(this.#Q)this.#Q.close(),this.#Q=null}}export{n as IndexedDBStorage};

package/dist/mcp/session.js

@@ -3,6 +3,7 @@ import { WeftError } from "../core/weft-error.js";
 import { MCP_TOOLS_LIST_CHANGED_NOTIFICATION, requestIdKey } from "./protocol.js";
 import { isWorkflowSearchResourceUri, workflowResourceUri } from "./resources.js";
 import { listMcpTools } from "./tools.js";
+import { tupleListsEqual } from "./tuple-list-equality.js";
 
 export class McpSessionLimitExceededError extends WeftError {
   constructor() {
@@ -243,16 +244,7 @@ function toolListSignature(engine) {
   ]);
 }
 function toolListSignaturesEqual(left, right) {
-  if (left.length !== right.length)
-    return !1;
-  for (let index = 0;index < left.length; index++) {
-    const leftEntry = left[index], rightEntry = right[index];
-    if (leftEntry === void 0 || rightEntry === void 0)
-      return !1;
-    if (leftEntry[0] !== rightEntry[0] || leftEntry[1] !== rightEntry[1] || leftEntry[2] !== rightEntry[2] || leftEntry[3] !== rightEntry[3])
-      return !1;
-  }
-  return !0;
+  return tupleListsEqual(left, right, (leftEntry, rightEntry) => leftEntry[0] === rightEntry[0] && leftEntry[1] === rightEntry[1] && leftEntry[2] === rightEntry[2] && leftEntry[3] === rightEntry[3]);
 }
 export function createMcpSessionManager(engine, options) {
   return new McpSessionManager(engine, options);

package/dist/mcp/tools.js

@@ -8,6 +8,7 @@ import {
   listVisibleWorkflows
 } from "./access.js";
 import { parseMcpListFilter } from "./list-filter.js";
+import { tupleListsEqual } from "./tuple-list-equality.js";
 const toolRegistryCache = new WeakMap, DEFAULT_WORKFLOW_TOOL_TIMEOUT_MS = 30000, MAX_WORKFLOW_TOOL_TIMEOUT_MS = 2147483647;
 export function listMcpTools(engine) {
   return getToolRegistry(engine).tools.map((tool) => tool.definition);
@@ -44,16 +45,7 @@ function toolRegistrySignature(engine) {
   return engine.listWorkflowDefinitions().toSorted((left, right) => left.type < right.type ? -1 : left.type > right.type ? 1 : 0).map((definition) => [definition.type, definition.description, definition.inputSchema]);
 }
 function toolRegistrySignaturesEqual(left, right) {
-  if (left.length !== right.length)
-    return !1;
-  for (let index = 0;index < left.length; index++) {
-    const leftEntry = left[index], rightEntry = right[index];
-    if (leftEntry === void 0 || rightEntry === void 0)
-      return !1;
-    if (leftEntry[0] !== rightEntry[0] || leftEntry[1] !== rightEntry[1] || leftEntry[2] !== rightEntry[2])
-      return !1;
-  }
-  return !0;
+  return tupleListsEqual(left, right, (leftEntry, rightEntry) => leftEntry[0] === rightEntry[0] && leftEntry[1] === rightEntry[1] && leftEntry[2] === rightEntry[2]);
 }
 function buildToolImplementations(engine) {
   const tools = [...builtInTools()], usedNames = new Set(tools.map((tool) => tool.definition.name));

package/dist/mcp/tuple-list-equality.d.ts

@@ -0,0 +1 @@
+export declare function tupleListsEqual<Tuple extends readonly unknown[]>(left: ReadonlyArray<Tuple>, right: ReadonlyArray<Tuple>, entryEqual: (leftEntry: Tuple, rightEntry: Tuple) => boolean): boolean;

package/dist/mcp/tuple-list-equality.js

@@ -0,0 +1,12 @@
+export function tupleListsEqual(left, right, entryEqual) {
+  if (left.length !== right.length)
+    return !1;
+  for (let index = 0;index < left.length; index++) {
+    const leftEntry = left[index], rightEntry = right[index];
+    if (leftEntry === void 0 || rightEntry === void 0)
+      return !1;
+    if (!entryEqual(leftEntry, rightEntry))
+      return !1;
+  }
+  return !0;
+}

package/dist/server/operation-catalog/types.d.ts

@@ -99,7 +99,7 @@ export type OperationContext<Input> = {
  * Common operation fields shared by unary, stream, and subscription kinds.
  * The discriminated union below adds `kind` and `eventSchema` per kind.
  */
-type OperationDefinitionBase<Input, Output, Element = unknown> = {
+export type OperationDefinitionBase<Input, Output, Element = unknown> = {
     readonly name: string;
     readonly mcpExposable: boolean;
     readonly mcpTool?: McpToolMetadata;