@boboddy/sdk 0.5.0 → 0.5.2

package/dist/defaults/index.js

@@ -338,16 +338,16 @@ async function loadPushDefaults(opts) {
   return { baseUrl, projectId, accessToken };
 }
 export {
-  setTelemetryDisabled,
-  saveAuthProfile,
-  resolveBoboddyBaseUrl,
-  loadPushDefaults,
-  loadProjectConfig,
-  loadAuthProfile,
-  loadAuthFile,
-  isTelemetryDisabled,
-  getOrCreateAnonymousId,
-  getAuthFilePath,
+  PROJECT_CONFIG_RELATIVE_PATH,
   deleteAuthProfile,
-  PROJECT_CONFIG_RELATIVE_PATH
+  getAuthFilePath,
+  getOrCreateAnonymousId,
+  isTelemetryDisabled,
+  loadAuthFile,
+  loadAuthProfile,
+  loadProjectConfig,
+  loadPushDefaults,
+  resolveBoboddyBaseUrl,
+  saveAuthProfile,
+  setTelemetryDisabled
 };

package/dist/definitions/advancement-policies/index.js

@@ -488,16 +488,16 @@ function makeAdvanceAllCtx() {
   };
 }
 export {
-  serializeCondition,
-  serializeCohortAdvancementPolicy,
-  serializeAdvancementPolicy,
-  makeAdvanceEachCtx,
-  makeAdvanceCtx,
-  makeAdvanceAllCtx,
-  extractInlineStepSignalsListDefinitions,
-  extractInlineComputedSignals,
-  cohortAdvancementEventTypeValues,
-  branchOutcomeValues,
+  Computed,
   Rule,
-  Computed
+  branchOutcomeValues,
+  cohortAdvancementEventTypeValues,
+  extractInlineComputedSignals,
+  extractInlineStepSignalsListDefinitions,
+  makeAdvanceAllCtx,
+  makeAdvanceCtx,
+  makeAdvanceEachCtx,
+  serializeAdvancementPolicy,
+  serializeCohortAdvancementPolicy,
+  serializeCondition
 };

package/dist/definitions/pipelines/chain-graph.d.ts

@@ -18,3 +18,32 @@ export declare function tryComputeTopoRanks(nodeDefinitions: readonly Pick<NodeD
  * `tryComputeTopoRanks` does.
  */
 export declare function tryOrderNodeDefinitionsByTopoRank(nodeDefinitions: readonly NodeDefinitionSpec[], dependencyEdges: readonly DependencyEdgeSpec[]): NodeDefinitionSpec[] | null;
+/**
+ * For every node reachable from `entryNodeKey`, the set of nodes that
+ * *dominate* it — every node that appears on *every* path from the entry to
+ * it, including the node itself (`dom(n)` always contains `n`). Standard
+ * iterative dataflow (Cooper/Harvey/Kennedy-style):
+ * `dom(entry) = {entry}`; `dom(n) = {n} ∪ ⋂ dom(p)` for each predecessor `p`
+ * of `n`, iterated to a fixed point.
+ *
+ * Unlike `tryComputeTopoRanks` above — which deliberately treats *every*
+ * in-degree-zero node as its own rank-0 root, so a graph with several
+ * disconnected entry points still ranks (see lines 51-56) — a dominator
+ * relation is only meaningful relative to a single root: "runs on every
+ * path from the entry" has no answer if there could be more than one
+ * entry. Callers must supply that root explicitly as `entryNodeKey`
+ * (`PipelineDefinitionSpec.entryNodeKey`, the node `config.startAt` names)
+ * rather than have it inferred from in-degree.
+ *
+ * Returns `null` (does not throw), same as `tryComputeTopoRanks`, when
+ * `entryNodeKey` does not name a node in `nodeDefinitions`, when
+ * `dependencyEdges` references a node key outside `nodeDefinitions`, or
+ * when the graph contains a cycle — every caller here is a diagnostic
+ * tool, not a build-time assertion (see `tryComputeTopoRanks`'s own doc
+ * comment), so it degrades gracefully rather than crashing validation.
+ *
+ * Nodes unreachable from `entryNodeKey` are simply absent from the
+ * returned map — an unreachable node can never appear on a path from the
+ * entry, so it neither dominates nor is dominated by anything reachable.
+ */
+export declare function tryComputeDominators(nodeDefinitions: readonly Pick<NodeDefinitionSpec, "nodeKey">[], dependencyEdges: readonly DependencyEdgeSpec[], entryNodeKey: string): Map<string, ReadonlySet<string>> | null;

package/dist/definitions/pipelines/compile-node-definitions.d.ts

@@ -17,11 +17,3 @@ export declare function compileFanOutState(stateKey: string, state: FanOutState,
 export declare function compileParallelState(stateKey: string, state: ParallelState, ctx: CompileContext): CompiledState;
 export declare function compileLoopState(stateKey: string, state: LoopState, ctx: CompileContext): CompiledState;
 export declare function compileTerminalState(stateKey: string, kind: "succeed" | "fail"): CompiledState;
-/**
- * The SDK-side mirror of §6's domain invariant: a node may have more than
- * one incoming edge only when every source is a `choice`/`loop` state
- * (never an unconditional `step`/`fanOut`/`parallel`/`cohortGate`
- * successor) — gives authors a fast local error instead of a round-trip to
- * the server.
- */
-export declare function assertNoIllegalConvergentEdges(pipelineKey: string, nodeKindByKey: ReadonlyMap<string, NodeDefinitionSpec["kind"]>, edges: readonly DependencyEdgeSpec[]): void;

package/dist/definitions/pipelines/define-pipeline.d.ts

@@ -117,6 +117,8 @@ export type PipelineDefinitionSpec = {
     version: number;
     status: "draft" | "active" | "archived";
     inputSchemaJson?: Record<string, unknown> | null;
+    /** The node the pipeline begins execution at — mirrors `config.startAt`. */
+    entryNodeKey: string;
     nodeDefinitions: NodeDefinitionSpec[];
     dependencyEdges: DependencyEdgeSpec[];
     /** Step specs referenced by this pipeline. Used by the push command to auto-push steps that aren't explicitly exported. */