@lotiai/composer 0.2.0 → 0.2.2

package/dist/internal/workflow-planning.js

@@ -0,0 +1,216 @@
+"use strict";
+/**
+ * Workflow Planning Logic for DAG Execution
+ *
+ * This module extracts the topological sort and batch planning logic from the
+ * synchronous workflow engine, making it reusable for both sync and async (Temporal)
+ * execution strategies.
+ *
+ * ## Execution Model
+ *
+ * The planner performs dependency analysis to determine which steps can run in parallel:
+ *
+ * 1. **Dependency Analysis**: Build a directed acyclic graph (DAG) of step dependencies
+ * 2. **Topological Sort**: Use Kahn's algorithm to find valid execution order
+ * 3. **Batch Formation**: Group steps with no dependencies into parallel "batches"
+ * 4. **Validation**: Detect cycles, missing dependencies, and conflicts
+ *
+ * ## Example
+ *
+ * Given workflow:
+ * - stepA: needs [] → provides ["x"]
+ * - stepB: needs ["x"] → provides ["y"]
+ * - stepC: needs ["x"] → provides ["z"]
+ * - stepD: needs ["y", "z"] → provides ["result"]
+ *
+ * Planning output:
+ * ```
+ * [
+ *   [stepA],           // Batch 0: No dependencies
+ *   [stepB, stepC],    // Batch 1: Both need "x" (parallel)
+ *   [stepD]            // Batch 2: Needs both "y" and "z"
+ * ]
+ * ```
+ *
+ * ## Usage
+ *
+ * For Temporal workflows:
+ * ```ts
+ * const plan = planWorkflowBatches(workflow.steps, initialFields);
+ * // Convert each batch to Temporal activities that can run in parallel
+ * ```
+ *
+ * For synchronous workflows:
+ * ```ts
+ * const plan = planWorkflowBatches(workflow.steps, initialFields);
+ * for (const batch of plan.batches) {
+ *   await Promise.all(batch.map(step => step.run(ctx, bag)));
+ * }
+ * ```
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.planWorkflowBatches = planWorkflowBatches;
+exports.validateWorkflowPlan = validateWorkflowPlan;
+/**
+ * Plans the execution of a workflow by performing topological sort with batch grouping.
+ *
+ * This function:
+ * 1. Validates that all dependencies can be satisfied
+ * 2. Detects duplicate providers and cycles
+ * 3. Groups steps into parallel execution batches using Kahn's algorithm
+ * 4. Returns an execution plan optimized for maximum parallelism
+ *
+ * @param steps - Array of steps in the workflow
+ * @param initialFields - Fields provided as initial data (satisfy dependencies without producers)
+ * @returns Workflow execution plan with steps organized into parallel batches
+ * @throws Error if dependencies cannot be satisfied, cycles exist, or duplicate providers found
+ *
+ * @example
+ * ```ts
+ * const plan = planWorkflowBatches(
+ *   [stepA, stepB, stepC, stepD],
+ *   new Set(["userId"])
+ * );
+ *
+ * // Execute each batch in sequence, steps within a batch in parallel
+ * for (const batch of plan.batches) {
+ *   await Promise.all(batch.map(step => executeStep(step)));
+ * }
+ * ```
+ */
+function planWorkflowBatches(steps, initialFields = new Set()) {
+    // Build a map of which step produces each field (detect duplicates)
+    const producers = new Map();
+    for (const step of steps) {
+        for (const fieldKey of step.provides) {
+            if (producers.has(fieldKey)) {
+                throw new Error(`Duplicate producer for field "${String(fieldKey)}": ` +
+                    `${producers.get(fieldKey)} and ${step.name}. ` +
+                    `Each field can only be produced by one step.`);
+            }
+            producers.set(fieldKey, step.name);
+        }
+    }
+    // Validate that steps don't try to overwrite initial fields
+    for (const step of steps) {
+        for (const fieldKey of step.provides) {
+            if (initialFields.has(fieldKey)) {
+                throw new Error(`Step "${step.name}" cannot overwrite initial field "${String(fieldKey)}". ` +
+                    `Initial data is protected from modification.`);
+            }
+        }
+    }
+    // Validate that all dependencies can be satisfied
+    const allProvidedFields = new Set(initialFields);
+    for (const step of steps) {
+        for (const fieldKey of step.provides) {
+            allProvidedFields.add(fieldKey);
+        }
+    }
+    for (const step of steps) {
+        for (const neededField of step.needs) {
+            if (!allProvidedFields.has(neededField)) {
+                throw new Error(`Step "${step.name}" requires field "${String(neededField)}" but no previous step provides it. ` +
+                    `Available fields: [${Array.from(allProvidedFields).map(String).join(", ")}]. ` +
+                    `Make sure a previous step provides "${String(neededField)}" or include it in initial data.`);
+            }
+        }
+    }
+    // Build dependency graph using adjacency lists
+    const stepsByName = new Map(steps.map((step) => [step.name, step]));
+    // children[stepName] = list of steps that depend on this step's outputs
+    const children = new Map();
+    // indegree[stepName] = number of unmet dependencies
+    const indegree = new Map(steps.map((step) => [step.name, 0]));
+    // Build the graph by connecting producers to consumers
+    for (const step of steps) {
+        let unmetDependencies = 0;
+        for (const neededField of step.needs) {
+            // Skip fields provided in initial data
+            if (initialFields.has(neededField))
+                continue;
+            const providerStep = producers.get(neededField);
+            if (!providerStep) {
+                throw new Error(`No producer for required field "${String(neededField)}" used by step "${step.name}"`);
+            }
+            // Add this step as a dependent of the provider
+            children.set(providerStep, [...(children.get(providerStep) ?? []), step.name]);
+            unmetDependencies++;
+        }
+        indegree.set(step.name, unmetDependencies);
+    }
+    // Perform topological sort with batch grouping (Kahn's algorithm)
+    // Each iteration processes one "batch" of steps that can run in parallel
+    const batches = [];
+    let readySteps = steps
+        .filter((step) => (indegree.get(step.name) ?? 0) === 0)
+        .map((step) => step.name);
+    while (readySteps.length > 0) {
+        // Validate that no two steps in the same batch produce the same field
+        // This prevents race conditions in parallel execution
+        const fieldsProducedInBatch = new Set();
+        for (const stepName of readySteps) {
+            const step = stepsByName.get(stepName);
+            for (const fieldKey of step.provides) {
+                const fieldName = String(fieldKey);
+                if (fieldsProducedInBatch.has(fieldName)) {
+                    throw new Error(`Conflict: Multiple steps in the same execution batch produce field "${fieldName}". ` +
+                        `This would cause non-deterministic behavior. ` +
+                        `Steps in batch: [${readySteps.join(", ")}]`);
+                }
+                fieldsProducedInBatch.add(fieldName);
+            }
+        }
+        // Add this batch to the plan
+        const batchSteps = readySteps.map((stepName) => stepsByName.get(stepName));
+        batches.push(batchSteps);
+        // Update dependency graph: reduce indegree for dependent steps
+        const nextReadySteps = [];
+        for (const completedStepName of readySteps) {
+            for (const dependentStepName of children.get(completedStepName) ?? []) {
+                const newIndegree = (indegree.get(dependentStepName) ?? 0) - 1;
+                indegree.set(dependentStepName, newIndegree);
+                // If this step now has no unmet dependencies, it's ready for the next batch
+                if (newIndegree === 0) {
+                    nextReadySteps.push(dependentStepName);
+                }
+            }
+        }
+        readySteps = nextReadySteps;
+    }
+    // Validate that all steps were processed (detect cycles)
+    const unfinishedSteps = [...indegree.entries()].filter(([, degree]) => (degree ?? 0) > 0);
+    if (unfinishedSteps.length > 0) {
+        const unfinishedNames = unfinishedSteps.map(([stepName]) => stepName);
+        throw new Error(`Unable to resolve dependencies for steps: [${unfinishedNames.join(", ")}]. ` +
+            `This indicates a circular dependency in the workflow.`);
+    }
+    return {
+        batches,
+        producers,
+        providedFields: allProvidedFields,
+    };
+}
+/**
+ * Validates a workflow plan for common issues.
+ *
+ * This is a convenience function that runs the planner and returns
+ * validation errors without throwing.
+ *
+ * @param steps - Array of steps in the workflow
+ * @param initialFields - Fields provided as initial data
+ * @returns Validation result with success flag and optional error message
+ */
+function validateWorkflowPlan(steps, initialFields = new Set()) {
+    try {
+        const plan = planWorkflowBatches(steps, initialFields);
+        return { success: true, plan };
+    }
+    catch (error) {
+        return {
+            success: false,
+            error: error instanceof Error ? error.message : String(error),
+        };
+    }
+}
+//# sourceMappingURL=workflow-planning.js.map

package/dist/internal/workflow-planning.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"workflow-planning.js","sourceRoot":"","sources":["../../src/internal/workflow-planning.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgDG;;AA6CH,kDA6IC;AAYD,oDAaC;AAjMD;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,SAAgB,mBAAmB,CACjC,KAAsC,EACtC,gBAAgC,IAAI,GAAG,EAAE;IAEzC,oEAAoE;IACpE,MAAM,SAAS,GAAG,IAAI,GAAG,EAAqB,CAAC;IAC/C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACrC,IAAI,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC5B,MAAM,IAAI,KAAK,CACb,iCAAiC,MAAM,CAAC,QAAQ,CAAC,KAAK;oBACpD,GAAG,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,IAAI,CAAC,IAAI,IAAI;oBAC/C,8CAA8C,CACjD,CAAC;YACJ,CAAC;YACD,SAAS,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QACrC,CAAC;IACH,CAAC;IAED,4DAA4D;IAC5D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACrC,IAAI,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAChC,MAAM,IAAI,KAAK,CACb,SAAS,IAAI,CAAC,IAAI,qCAAqC,MAAM,CAAC,QAAQ,CAAC,KAAK;oBAC1E,8CAA8C,CACjD,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAED,kDAAkD;IAClD,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAAY,aAAa,CAAC,CAAC;IAC5D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACrC,iBAAiB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,MAAM,WAAW,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACrC,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;gBACxC,MAAM,IAAI,KAAK,CACb,SAAS,IAAI,CAAC,IAAI,qBAAqB,MAAM,CAAC,WAAW,CAAC,sCAAsC;oBAC9F,sBAAsB,KAAK,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;oBAC/E,uCAAuC,MAAM,CAAC,WAAW,CAAC,kCAAkC,CAC/F,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAED,+CAA+C;IAC/C,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IACpE,wEAAwE;IACxE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC7C,oDAAoD;IACpD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAiB,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAE9E,uDAAuD;IACvD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,iBAAiB,GAAG,CAAC,CAAC;QAC1B,KAAK,MAAM,WAAW,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACrC,uCAAuC;YACvC,IAAI,aAAa,CAAC,GAAG,CAAC,WAAW,CAAC;gBAAE,SAAS;YAE7C,MAAM,YAAY,GAAG,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;YAChD,IAAI,CAAC,YAAY,EAAE,CAAC;gBAClB,MAAM,IAAI,KAAK,CACb,mCAAmC,MAAM,CAAC,WAAW,CAAC,mBAAmB,IAAI,CAAC,IAAI,GAAG,CACtF,CAAC;YACJ,CAAC;YAED,+CAA+C;YAC/C,QAAQ,CAAC,GAAG,CAAC,YAAY,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YAC/E,iBAAiB,EAAE,CAAC;QACtB,CAAC;QACD,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,iBAAiB,CAAC,CAAC;IAC7C,CAAC;IAED,kEAAkE;IAClE,yEAAyE;IACzE,MAAM,OAAO,GAAsC,EAAE,CAAC;IACtD,IAAI,UAAU,GAAG,KAAK;SACnB,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC;SACtD,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAE5B,OAAO,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7B,sEAAsE;QACtE,sDAAsD;QACtD,MAAM,qBAAqB,GAAG,IAAI,GAAG,EAAU,CAAC;QAChD,KAAK,MAAM,QAAQ,IAAI,UAAU,EAAE,CAAC;YAClC,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;YACxC,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACrC,MAAM,SAAS,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;gBACnC,IAAI,qBAAqB,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;oBACzC,MAAM,IAAI,KAAK,CACb,uEAAuE,SAAS,KAAK;wBACnF,+CAA+C;wBAC/C,oBAAoB,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAC/C,CAAC;gBACJ,CAAC;gBACD,qBAAqB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACvC,CAAC;QACH,CAAC;QAED,6BAA6B;QAC7B,MAAM,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,CAAC;QAC5E,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAEzB,+DAA+D;QAC/D,MAAM,cAAc,GAAa,EAAE,CAAC;QACpC,KAAK,MAAM,iBAAiB,IAAI,UAAU,EAAE,CAAC;YAC3C,KAAK,MAAM,iBAAiB,IAAI,QAAQ,CAAC,GAAG,CAAC,iBAAiB,CAAC,IAAI,EAAE,EAAE,CAAC;gBACtE,MAAM,WAAW,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBAC/D,QAAQ,CAAC,GAAG,CAAC,iBAAiB,EAAE,WAAW,CAAC,CAAC;gBAE7C,4EAA4E;gBAC5E,IAAI,WAAW,KAAK,CAAC,EAAE,CAAC;oBACtB,cAAc,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;gBACzC,CAAC;YACH,CAAC;QACH,CAAC;QAED,UAAU,GAAG,cAAc,CAAC;IAC9B,CAAC;IAED,yDAAyD;IACzD,MAAM,eAAe,GAAG,CAAC,GAAG,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1F,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC/B,MAAM,eAAe,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC;QACtE,MAAM,IAAI,KAAK,CACb,8CAA8C,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;YAC3E,uDAAuD,CAC1D,CAAC;IACJ,CAAC;IAED,OAAO;QACL,OAAO;QACP,SAAS;QACT,cAAc,EAAE,iBAAiB;KAClC,CAAC;AACJ,CAAC;AAED;;;;;;;;;GASG;AACH,SAAgB,oBAAoB,CAClC,KAAsC,EACtC,gBAAgC,IAAI,GAAG,EAAE;IAEzC,IAAI,CAAC;QACH,MAAM,IAAI,GAAG,mBAAmB,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;QACvD,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;IACjC,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO;YACL,OAAO,EAAE,KAAK;YACd,KAAK,EAAE,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC;SAC9D,CAAC;IACJ,CAAC;AACH,CAAC"}

package/dist/schedule-sync.d.ts

@@ -0,0 +1,17 @@
+/**
+ * Schedule sync entry point.
+ *
+ * Exposed as a dedicated subpath export (@lotiai/composer/schedule-sync) so
+ * infrastructure Lambdas can import the reconciler and its payload schema
+ * without pulling in the full Composer framework surface (worker runtime,
+ * webpack, swc native bindings, chokidar, jiti, etc.) that the root barrel
+ * and ./internal both drag in via create-composer + register helpers.
+ *
+ * We import directly from leaf modules here -- NOT via ./internal -- so
+ * esbuild never traces through create-composer.ts and its worker imports.
+ * Keep this module narrowly focused on server-side reconciliation.
+ */
+export type { ScheduleDefinition } from "./internal/async/schedule/define-schedule";
+export { scheduleDefinitionSchema, scheduleOverlapPolicySchema, } from "./internal/async/schedule/schedule-definition-schema";
+export { type SyncSchedulesResult, syncSchedules, } from "./internal/async/schedule/sync-schedules";
+//# sourceMappingURL=schedule-sync.d.ts.map

package/dist/schedule-sync.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"schedule-sync.d.ts","sourceRoot":"","sources":["../src/schedule-sync.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,YAAY,EAAE,kBAAkB,EAAE,MAAM,2CAA2C,CAAC;AACpF,OAAO,EACL,wBAAwB,EACxB,2BAA2B,GAC5B,MAAM,sDAAsD,CAAC;AAC9D,OAAO,EACL,KAAK,mBAAmB,EACxB,aAAa,GACd,MAAM,0CAA0C,CAAC"}

package/dist/schedule-sync.js

@@ -0,0 +1,22 @@
+"use strict";
+/**
+ * Schedule sync entry point.
+ *
+ * Exposed as a dedicated subpath export (@lotiai/composer/schedule-sync) so
+ * infrastructure Lambdas can import the reconciler and its payload schema
+ * without pulling in the full Composer framework surface (worker runtime,
+ * webpack, swc native bindings, chokidar, jiti, etc.) that the root barrel
+ * and ./internal both drag in via create-composer + register helpers.
+ *
+ * We import directly from leaf modules here -- NOT via ./internal -- so
+ * esbuild never traces through create-composer.ts and its worker imports.
+ * Keep this module narrowly focused on server-side reconciliation.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.syncSchedules = exports.scheduleOverlapPolicySchema = exports.scheduleDefinitionSchema = void 0;
+var schedule_definition_schema_1 = require("./internal/async/schedule/schedule-definition-schema");
+Object.defineProperty(exports, "scheduleDefinitionSchema", { enumerable: true, get: function () { return schedule_definition_schema_1.scheduleDefinitionSchema; } });
+Object.defineProperty(exports, "scheduleOverlapPolicySchema", { enumerable: true, get: function () { return schedule_definition_schema_1.scheduleOverlapPolicySchema; } });
+var sync_schedules_1 = require("./internal/async/schedule/sync-schedules");
+Object.defineProperty(exports, "syncSchedules", { enumerable: true, get: function () { return sync_schedules_1.syncSchedules; } });
+//# sourceMappingURL=schedule-sync.js.map

package/dist/schedule-sync.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"schedule-sync.js","sourceRoot":"","sources":["../src/schedule-sync.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;GAYG;;;AAGH,mGAG8D;AAF5D,sIAAA,wBAAwB,OAAA;AACxB,yIAAA,2BAA2B,OAAA;AAE7B,2EAGkD;AADhD,+GAAA,aAAa,OAAA"}

package/dist/temporal-naming.d.ts

@@ -0,0 +1,27 @@
+/**
+ * Temporal Worker Versioning deployment series naming conventions.
+ *
+ * Exposed as a dedicated subpath export (@lotiai/composer/temporal-naming) so
+ * infrastructure Lambdas can import these lightweight constants without pulling
+ * in the full Composer framework or Temporal SDK.
+ */
+export declare const WORKER_DEPLOYMENT_SUFFIXES: {
+    readonly ACTIVITIES: "activities";
+    readonly WORKFLOWS: "workflows";
+};
+/**
+ * Derives the Temporal Worker Versioning deployment series names from a service name.
+ *
+ * Each service runs two worker types (activity and workflow), each with its own
+ * deployment series for independent versioning. CI uses these same names when
+ * calling setCurrentDeployment after a deploy.
+ *
+ * @example
+ * getDeploymentSeriesNames("orders-service")
+ * // => { activities: "orders-service-activities", workflows: "orders-service-workflows" }
+ */
+export declare function getDeploymentSeriesNames(serviceName: string): {
+    activities: string;
+    workflows: string;
+};
+//# sourceMappingURL=temporal-naming.d.ts.map

package/dist/temporal-naming.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"temporal-naming.d.ts","sourceRoot":"","sources":["../src/temporal-naming.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,eAAO,MAAM,0BAA0B;;;CAG7B,CAAC;AAEX;;;;;;;;;;GAUG;AACH,wBAAgB,wBAAwB,CAAC,WAAW,EAAE,MAAM;;;EAK3D"}

package/dist/temporal-naming.js

@@ -0,0 +1,33 @@
+"use strict";
+/**
+ * Temporal Worker Versioning deployment series naming conventions.
+ *
+ * Exposed as a dedicated subpath export (@lotiai/composer/temporal-naming) so
+ * infrastructure Lambdas can import these lightweight constants without pulling
+ * in the full Composer framework or Temporal SDK.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.WORKER_DEPLOYMENT_SUFFIXES = void 0;
+exports.getDeploymentSeriesNames = getDeploymentSeriesNames;
+exports.WORKER_DEPLOYMENT_SUFFIXES = {
+    ACTIVITIES: "activities",
+    WORKFLOWS: "workflows",
+};
+/**
+ * Derives the Temporal Worker Versioning deployment series names from a service name.
+ *
+ * Each service runs two worker types (activity and workflow), each with its own
+ * deployment series for independent versioning. CI uses these same names when
+ * calling setCurrentDeployment after a deploy.
+ *
+ * @example
+ * getDeploymentSeriesNames("orders-service")
+ * // => { activities: "orders-service-activities", workflows: "orders-service-workflows" }
+ */
+function getDeploymentSeriesNames(serviceName) {
+    return {
+        activities: `${serviceName}-${exports.WORKER_DEPLOYMENT_SUFFIXES.ACTIVITIES}`,
+        workflows: `${serviceName}-${exports.WORKER_DEPLOYMENT_SUFFIXES.WORKFLOWS}`,
+    };
+}
+//# sourceMappingURL=temporal-naming.js.map

package/dist/temporal-naming.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"temporal-naming.js","sourceRoot":"","sources":["../src/temporal-naming.ts"],"names":[],"mappings":";AAAA;;;;;;GAMG;;;AAkBH,4DAKC;AArBY,QAAA,0BAA0B,GAAG;IACxC,UAAU,EAAE,YAAY;IACxB,SAAS,EAAE,WAAW;CACd,CAAC;AAEX;;;;;;;;;;GAUG;AACH,SAAgB,wBAAwB,CAAC,WAAmB;IAC1D,OAAO;QACL,UAAU,EAAE,GAAG,WAAW,IAAI,kCAA0B,CAAC,UAAU,EAAE;QACrE,SAAS,EAAE,GAAG,WAAW,IAAI,kCAA0B,CAAC,SAAS,EAAE;KACpE,CAAC;AACJ,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@lotiai/composer",
-  "version": "0.2.0",
+  "version": "0.2.2",
   "description": "A framework for building type-safe, DAG-based workflows with optional Temporal integration.",
   "license": "MIT",
   "keywords": [
@@ -21,6 +21,19 @@
   },
   "main": "dist/index.js",
   "types": "dist/index.d.ts",
+  "typesVersions": {
+    "*": {
+      "build-config": [
+        "dist/build-config/index.d.ts"
+      ],
+      "temporal-naming": [
+        "dist/temporal-naming.d.ts"
+      ],
+      "schedule-sync": [
+        "dist/schedule-sync.d.ts"
+      ]
+    }
+  },
   "bin": {
     "composer": "bin/composer.js"
   },
@@ -53,20 +66,6 @@
     "access": "public",
     "registry": "https://registry.npmjs.org"
   },
-  "scripts": {
-    "compile": "tsc --build",
-    "clean": "rm -rf dist *.tsbuildinfo",
-    "test": "pnpm test:vitest",
-    "test:vitest": "vitest run --config vitest.config.mts --typecheck",
-    "test:vitest:watch": "vitest --config vitest.config.mts",
-    "test:watch": "pnpm test:vitest:watch",
-    "test:coverage": "vitest run --config vitest.config.mts --coverage",
-    "dev:temporal:up": "docker-compose -f docker-compose.temporal.yml up -d",
-    "dev:temporal:down": "docker-compose -f docker-compose.temporal.yml down",
-    "dev:temporal:logs": "docker-compose -f docker-compose.temporal.yml logs -f",
-    "cli": "node dist/cli/index.js",
-    "cli:dev": "node dist/cli/index.js dev"
-  },
   "dependencies": {
     "@aws-sdk/client-cloudwatch": "^3.946.0",
     "@aws-sdk/client-lambda": "^3.658.1",
@@ -95,5 +94,18 @@
   "engines": {
     "node": ">=22"
   },
-  "packageManager": "pnpm@10.28.2"
-}
+  "scripts": {
+    "compile": "tsc --build",
+    "clean": "rm -rf dist *.tsbuildinfo",
+    "test": "pnpm test:vitest",
+    "test:vitest": "vitest run --config vitest.config.mts --typecheck",
+    "test:vitest:watch": "vitest --config vitest.config.mts",
+    "test:watch": "pnpm test:vitest:watch",
+    "test:coverage": "vitest run --config vitest.config.mts --coverage",
+    "dev:temporal:up": "docker-compose -f docker-compose.temporal.yml up -d",
+    "dev:temporal:down": "docker-compose -f docker-compose.temporal.yml down",
+    "dev:temporal:logs": "docker-compose -f docker-compose.temporal.yml logs -f",
+    "cli": "node dist/cli/index.js",
+    "cli:dev": "node dist/cli/index.js dev"
+  }
+}