@galaxy-tool-util/schema 1.13.1 → 1.14.0

package/dist/workflow/index.js

@@ -5,7 +5,7 @@ export { GalaxyWorkflowSchema, GalaxyWorkflowDraftSchema, DraftWorkflowStepSchem
 // Plain JSON Schema siblings for downstream packagers (issue #108)
 export { galaxyWorkflowDraftJsonSchema } from "./json-schemas.js";
 // Normalized workflow types + normalizers
-export { normalizedFormat2, normalizeStepIn, normalizeStepOut, NormalizedFormat2WorkflowSchema, NormalizedFormat2StepSchema, NormalizedFormat2InputSchema, NormalizedFormat2OutputSchema, NormalizedFormat2StepInputSchema, NormalizedFormat2StepOutputSchema, GalaxyUserToolStubSchema, isGalaxyUserToolRun, normalizedNative, NormalizedNativeWorkflowSchema, NormalizedNativeStepSchema, ToolReferenceSchema, toFormat2, toNative, toFormat2Stateful, toNativeStateful, ensureFormat2, ensureNative, expandedFormat2, expandedNative, isTrsUrl, MAX_EXPANSION_DEPTH, flattenCommentData, unflattenCommentData, resolveSourceReference, stepRenderIdentity, rawStepRenderIdentity, UNLABELED_INPUT_PREFIX, UNLABELED_STEP_PREFIX, } from "./normalized/index.js";
+export { normalizedFormat2, normalizeStepIn, normalizeStepOut, NormalizedFormat2WorkflowSchema, NormalizedFormat2StepSchema, NormalizedFormat2InputSchema, NormalizedFormat2OutputSchema, NormalizedFormat2StepInputSchema, NormalizedFormat2StepOutputSchema, GalaxyUserToolStubSchema, isGalaxyUserToolRun, normalizedNative, NormalizedNativeWorkflowSchema, NormalizedNativeStepSchema, ToolReferenceSchema, toFormat2, toNative, toFormat2Stateful, toNativeStateful, ensureFormat2, ensureNative, expandedFormat2, expandedNative, isTrsUrl, trsDescriptorUrl, MAX_EXPANSION_DEPTH, flattenCommentData, unflattenCommentData, resolveSourceReference, stepRenderIdentity, rawStepRenderIdentity, unlabeledNodeId, UNLABELED_INPUT_PREFIX, UNLABELED_STEP_PREFIX, } from "./normalized/index.js";
 export { flatStatePath, keysStartingWith, repeatInputsToArray, selectWhichWhen, } from "./walk-helpers.js";
 export { injectConnectionsIntoState, stripConnectedValues, nativeConnectionsFromFormat2In, } from "./state-merge.js";
 export { expandToolStateDefaults } from "./fill-defaults.js";
@@ -23,6 +23,8 @@ export { cleanWorkflow } from "./clean.js";
 export { workflowToMermaid } from "./mermaid.js";
 export { edgeAnnotationKey } from "./edge-annotation.js";
 export { cytoscapeElements } from "./cytoscape.js";
+export { applyLayout, layeredPositions, layoutPositions, AUTO as LAYOUT_AUTO, LayoutCycleError, } from "./layout.js";
+export { GRAPH_PROPERTY_CHECKERS } from "./layout-properties.js";
 export { elementsToList, } from "./cytoscape-models.js";
 export { COL_STRIDE, ROW_STRIDE, LAYOUT_NAMES, bakesCoordinates, isLayoutName, topologicalPositions, } from "./cytoscape-layout.js";
 export { detectFormat } from "./detect-format.js";
@@ -31,7 +33,7 @@ export { stripPlanFields, promoteFullyConcreteDrafts, } from "./promote-draft.js
 export { withClass, validateFormat2, validateFormat2Strict, validateNative, validateNativeStrict, validatorForFixture, } from "./validators.js";
 export { validateEncodingNative, validateEncodingFormat2, checkStrictEncoding, checkStrictStructure, } from "./strict-checks.js";
 export { LintContext, LintMessage, Linter, LEVEL_ERROR, LEVEL_WARN, lintNative, lintFormat2, lintWorkflow, lintBestPracticesFormat2, lintBestPracticesNative, } from "./lint.js";
-export { NativeStepKeyNotInteger } from "./lint-rules.js";
+export { NativeStepKeyNotInteger, StepLabelNotUnique } from "./lint-rules.js";
 export { parseLintProfiles, lintProfilesById, rulesForProfile, iwcRuleIds, LINT_PROFILES_FILENAME, IWC_PROFILE_NAMES, } from "./lint-profiles.js";
 // Structured report models (mirrors Python _report_models.py)
 export { SKIP_STATUSES, validationSummary, validationFailures, cleanDisplayLabel, categoryOf, groupByCategory, buildSingleValidationReport, buildSingleLintReport, buildSingleCleanReport, buildSingleDraftValidationReport, buildSingleDraftExtractReport, buildWorkflowValidationResult, buildLintWorkflowResult, buildWorkflowCleanResult, buildTreeValidationReport, buildLintTreeReport, buildTreeCleanReport, buildWorkflowExportResult, buildExportTreeReport, buildWorkflowToNativeResult, buildToNativeTreeReport, buildRoundTripTreeReport, } from "./report-models.js";

package/dist/workflow/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/workflow/index.ts"],"names":[],"mappings":"AAAA,qCAAqC;AACrC,OAAO,EAAE,iBAAiB,EAAE,aAAa,EAAiC,MAAM,gBAAgB,CAAC;AAEjG,wCAAwC;AACxC,OAAO,EAEL,oBAAoB,EAEpB,yBAAyB,EAEzB,uBAAuB,EAEvB,0BAA0B,GAC3B,MAAM,gBAAgB,CAAC;AAExB,mEAAmE;AACnE,OAAO,EAAE,6BAA6B,EAAE,MAAM,mBAAmB,CAAC;AAElE,0CAA0C;AAC1C,OAAO,EACL,iBAAiB,EACjB,eAAe,EACf,gBAAgB,EAChB,+BAA+B,EAC/B,2BAA2B,EAC3B,4BAA4B,EAC5B,6BAA6B,EAC7B,gCAAgC,EAChC,iCAAiC,EACjC,wBAAwB,EACxB,mBAAmB,EAQnB,gBAAgB,EAChB,8BAA8B,EAC9B,0BAA0B,EAC1B,mBAAmB,EAInB,SAAS,EAGT,QAAQ,EAER,iBAAiB,EACjB,gBAAgB,EAMhB,aAAa,EACb,YAAY,EACZ,eAAe,EACf,cAAc,EACd,QAAQ,EACR,mBAAmB,EAOnB,kBAAkB,EAClB,oBAAoB,EACpB,sBAAsB,EACtB,kBAAkB,EAClB,qBAAqB,EACrB,sBAAsB,EACtB,qBAAqB,GACtB,MAAM,uBAAuB,CAAC;AAE/B,OAAO,EACL,aAAa,EACb,gBAAgB,EAChB,mBAAmB,EACnB,eAAe,GAChB,MAAM,mBAAmB,CAAC;AAE3B,OAAO,EACL,0BAA0B,EAC1B,oBAAoB,EACpB,8BAA8B,GAC/B,MAAM,kBAAkB,CAAC;AAE1B,OAAO,EAAE,uBAAuB,EAAE,MAAM,oBAAoB,CAAC;AAC7D,OAAO,EAAE,qBAAqB,EAAE,MAAM,yBAAyB,CAAC;AAChE,OAAO,EACL,eAAe,EACf,gBAAgB,EAChB,SAAS,GAEV,MAAM,oBAAoB,CAAC;AAE5B,OAAO,EAAE,mBAAmB,EAAkC,MAAM,uBAAuB,CAAC;AAE5F,OAAO,EACL,aAAa,GAId,MAAM,sBAAsB,CAAC;AAE9B,OAAO,EACL,eAAe,EACf,gBAAgB,EAChB,UAAU,EACV,eAAe,EACf,oBAAoB,GAGrB,MAAM,aAAa,CAAC;AAErB,OAAO,EACL,kBAAkB,EAClB,kBAAkB,EAClB,qBAAqB,EACrB,mBAAmB,GAEpB,MAAM,uBAAuB,CAAC;AAE/B,OAAO,EACL,sBAAsB,EACtB,kBAAkB,GAGnB,MAAM,eAAe,CAAC;AAEvB,OAAO,EACL,2BAA2B,EAC3B,uBAAuB,EACvB,wBAAwB,EACxB,8BAA8B,GAG/B,MAAM,wBAAwB,CAAC;AAEhC,OAAO,EAAE,eAAe,EAA8B,MAAM,uBAAuB,CAAC;AAEpF,OAAO,EACL,iBAAiB,GAMlB,MAAM,gBAAgB,CAAC;AAExB,OAAO,EAAE,aAAa,EAAuD,MAAM,YAAY,CAAC;AAEhG,OAAO,EAAE,iBAAiB,EAAuB,MAAM,cAAc,CAAC;AAEtE,OAAO,EAAE,iBAAiB,EAAuB,MAAM,sBAAsB,CAAC;AAE9E,OAAO,EAAE,iBAAiB,EAAyB,MAAM,gBAAgB,CAAC;AAC1E,OAAO,EACL,cAAc,GAUf,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EACL,UAAU,EACV,UAAU,EACV,YAAY,EACZ,gBAAgB,EAChB,YAAY,EACZ,oBAAoB,GAErB,MAAM,uBAAuB,CAAC;AAE/B,OAAO,EAAE,YAAY,EAAuB,MAAM,oBAAoB,CAAC;AAEvE,OAAO,EACL,qBAAqB,EACrB,WAAW,EACX,WAAW,EACX,cAAc,EACd,eAAe,EACf,WAAW,EACX,aAAa,EACb,aAAa,EACb,qBAAqB,EACrB,mBAAmB,EACnB,aAAa,GAiBd,MAAM,mBAAmB,CAAC;AAE3B,OAAO,EACL,eAAe,EACf,0BAA0B,GAI3B,MAAM,oBAAoB,CAAC;AAE5B,OAAO,EACL,SAAS,EACT,eAAe,EACf,qBAAqB,EACrB,cAAc,EACd,oBAAoB,EACpB,mBAAmB,GACpB,MAAM,iBAAiB,CAAC;AAEzB,OAAO,EACL,sBAAsB,EACtB,uBAAuB,EACvB,mBAAmB,EACnB,oBAAoB,GACrB,MAAM,oBAAoB,CAAC;AAE5B,OAAO,EACL,WAAW,EACX,WAAW,EACX,MAAM,EACN,WAAW,EACX,UAAU,EACV,UAAU,EACV,WAAW,EACX,YAAY,EACZ,wBAAwB,EACxB,uBAAuB,GAKxB,MAAM,WAAW,CAAC;AAEnB,OAAO,EAAE,uBAAuB,EAAE,MAAM,iBAAiB,CAAC;AAE1D,OAAO,EACL,iBAAiB,EACjB,gBAAgB,EAChB,eAAe,EACf,UAAU,EACV,sBAAsB,EACtB,iBAAiB,GAElB,MAAM,oBAAoB,CAAC;AAE5B,8DAA8D;AAC9D,OAAO,EAEL,aAAa,EAwDb,iBAAiB,EACjB,kBAAkB,EAClB,iBAAiB,EACjB,UAAU,EACV,eAAe,EACf,2BAA2B,EAC3B,qBAAqB,EACrB,sBAAsB,EACtB,gCAAgC,EAChC,6BAA6B,EAC7B,6BAA6B,EAC7B,uBAAuB,EACvB,wBAAwB,EACxB,yBAAyB,EACzB,mBAAmB,EACnB,oBAAoB,EACpB,yBAAyB,EACzB,qBAAqB,EACrB,2BAA2B,EAC3B,uBAAuB,EACvB,wBAAwB,GACzB,MAAM,oBAAoB,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/workflow/index.ts"],"names":[],"mappings":"AAAA,qCAAqC;AACrC,OAAO,EAAE,iBAAiB,EAAE,aAAa,EAAiC,MAAM,gBAAgB,CAAC;AAEjG,wCAAwC;AACxC,OAAO,EAEL,oBAAoB,EAEpB,yBAAyB,EAEzB,uBAAuB,EAEvB,0BAA0B,GAC3B,MAAM,gBAAgB,CAAC;AAExB,mEAAmE;AACnE,OAAO,EAAE,6BAA6B,EAAE,MAAM,mBAAmB,CAAC;AAElE,0CAA0C;AAC1C,OAAO,EACL,iBAAiB,EACjB,eAAe,EACf,gBAAgB,EAChB,+BAA+B,EAC/B,2BAA2B,EAC3B,4BAA4B,EAC5B,6BAA6B,EAC7B,gCAAgC,EAChC,iCAAiC,EACjC,wBAAwB,EACxB,mBAAmB,EAQnB,gBAAgB,EAChB,8BAA8B,EAC9B,0BAA0B,EAC1B,mBAAmB,EAInB,SAAS,EAGT,QAAQ,EAER,iBAAiB,EACjB,gBAAgB,EAMhB,aAAa,EACb,YAAY,EACZ,eAAe,EACf,cAAc,EACd,QAAQ,EACR,gBAAgB,EAChB,mBAAmB,EAOnB,kBAAkB,EAClB,oBAAoB,EACpB,sBAAsB,EACtB,kBAAkB,EAClB,qBAAqB,EACrB,eAAe,EACf,sBAAsB,EACtB,qBAAqB,GACtB,MAAM,uBAAuB,CAAC;AAE/B,OAAO,EACL,aAAa,EACb,gBAAgB,EAChB,mBAAmB,EACnB,eAAe,GAChB,MAAM,mBAAmB,CAAC;AAE3B,OAAO,EACL,0BAA0B,EAC1B,oBAAoB,EACpB,8BAA8B,GAC/B,MAAM,kBAAkB,CAAC;AAE1B,OAAO,EAAE,uBAAuB,EAAE,MAAM,oBAAoB,CAAC;AAC7D,OAAO,EAAE,qBAAqB,EAAE,MAAM,yBAAyB,CAAC;AAChE,OAAO,EACL,eAAe,EACf,gBAAgB,EAChB,SAAS,GAEV,MAAM,oBAAoB,CAAC;AAE5B,OAAO,EAAE,mBAAmB,EAAkC,MAAM,uBAAuB,CAAC;AAE5F,OAAO,EACL,aAAa,GAId,MAAM,sBAAsB,CAAC;AAE9B,OAAO,EACL,eAAe,EACf,gBAAgB,EAChB,UAAU,EACV,eAAe,EACf,oBAAoB,GAGrB,MAAM,aAAa,CAAC;AAErB,OAAO,EACL,kBAAkB,EAClB,kBAAkB,EAClB,qBAAqB,EACrB,mBAAmB,GAEpB,MAAM,uBAAuB,CAAC;AAE/B,OAAO,EACL,sBAAsB,EACtB,kBAAkB,GAGnB,MAAM,eAAe,CAAC;AAEvB,OAAO,EACL,2BAA2B,EAC3B,uBAAuB,EACvB,wBAAwB,EACxB,8BAA8B,GAG/B,MAAM,wBAAwB,CAAC;AAEhC,OAAO,EAAE,eAAe,EAA8B,MAAM,uBAAuB,CAAC;AAEpF,OAAO,EACL,iBAAiB,GAMlB,MAAM,gBAAgB,CAAC;AAExB,OAAO,EAAE,aAAa,EAAuD,MAAM,YAAY,CAAC;AAEhG,OAAO,EAAE,iBAAiB,EAAuB,MAAM,cAAc,CAAC;AAEtE,OAAO,EAAE,iBAAiB,EAAuB,MAAM,sBAAsB,CAAC;AAE9E,OAAO,EAAE,iBAAiB,EAAyB,MAAM,gBAAgB,CAAC;AAC1E,OAAO,EACL,WAAW,EACX,gBAAgB,EAChB,eAAe,EACf,IAAI,IAAI,WAAW,EACnB,gBAAgB,GAIjB,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,uBAAuB,EAA6B,MAAM,wBAAwB,CAAC;AAC5F,OAAO,EACL,cAAc,GAUf,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EACL,UAAU,EACV,UAAU,EACV,YAAY,EACZ,gBAAgB,EAChB,YAAY,EACZ,oBAAoB,GAErB,MAAM,uBAAuB,CAAC;AAE/B,OAAO,EAAE,YAAY,EAAuB,MAAM,oBAAoB,CAAC;AAEvE,OAAO,EACL,qBAAqB,EACrB,WAAW,EACX,WAAW,EACX,cAAc,EACd,eAAe,EACf,WAAW,EACX,aAAa,EACb,aAAa,EACb,qBAAqB,EACrB,mBAAmB,EACnB,aAAa,GAiBd,MAAM,mBAAmB,CAAC;AAE3B,OAAO,EACL,eAAe,EACf,0BAA0B,GAI3B,MAAM,oBAAoB,CAAC;AAE5B,OAAO,EACL,SAAS,EACT,eAAe,EACf,qBAAqB,EACrB,cAAc,EACd,oBAAoB,EACpB,mBAAmB,GACpB,MAAM,iBAAiB,CAAC;AAEzB,OAAO,EACL,sBAAsB,EACtB,uBAAuB,EACvB,mBAAmB,EACnB,oBAAoB,GACrB,MAAM,oBAAoB,CAAC;AAE5B,OAAO,EACL,WAAW,EACX,WAAW,EACX,MAAM,EACN,WAAW,EACX,UAAU,EACV,UAAU,EACV,WAAW,EACX,YAAY,EACZ,wBAAwB,EACxB,uBAAuB,GAKxB,MAAM,WAAW,CAAC;AAEnB,OAAO,EAAE,uBAAuB,EAAE,kBAAkB,EAAE,MAAM,iBAAiB,CAAC;AAE9E,OAAO,EACL,iBAAiB,EACjB,gBAAgB,EAChB,eAAe,EACf,UAAU,EACV,sBAAsB,EACtB,iBAAiB,GAElB,MAAM,oBAAoB,CAAC;AAE5B,8DAA8D;AAC9D,OAAO,EAEL,aAAa,EAwDb,iBAAiB,EACjB,kBAAkB,EAClB,iBAAiB,EACjB,UAAU,EACV,eAAe,EACf,2BAA2B,EAC3B,qBAAqB,EACrB,sBAAsB,EACtB,gCAAgC,EAChC,6BAA6B,EAC7B,6BAA6B,EAC7B,uBAAuB,EACvB,wBAAwB,EACxB,yBAAyB,EACzB,mBAAmB,EACnB,oBAAoB,EACpB,yBAAyB,EACzB,qBAAqB,EACrB,2BAA2B,EAC3B,uBAAuB,EACvB,wBAAwB,GACzB,MAAM,oBAAoB,CAAC"}

package/dist/workflow/layout-properties.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Structural graph properties any conforming workflow layout must satisfy.
+ *
+ * Port of gxformat2/layout/_properties.py. The property names are the
+ * cross-language contract for `graph_properties` in layout.yml expectations;
+ * each checker takes a laid-out document and throws on violation.
+ */
+export type GraphPropertyChecker = (workflow: unknown) => void;
+export declare const GRAPH_PROPERTY_CHECKERS: Record<string, GraphPropertyChecker>;
+//# sourceMappingURL=layout-properties.d.ts.map

package/dist/workflow/layout-properties.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"layout-properties.d.ts","sourceRoot":"","sources":["../../src/workflow/layout-properties.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAeH,MAAM,MAAM,oBAAoB,GAAG,CAAC,QAAQ,EAAE,OAAO,KAAK,IAAI,CAAC;AAkH/D,eAAO,MAAM,uBAAuB,EAAE,MAAM,CAAC,MAAM,EAAE,oBAAoB,CAKxE,CAAC"}

package/dist/workflow/layout-properties.js

@@ -0,0 +1,112 @@
+/**
+ * Structural graph properties any conforming workflow layout must satisfy.
+ *
+ * Port of gxformat2/layout/_properties.py. The property names are the
+ * cross-language contract for `graph_properties` in layout.yml expectations;
+ * each checker takes a laid-out document and throws on violation.
+ */
+import { extractGraph, format2NodeId, isGraphDocument, isNativeDocument, iterSubworkflows, layoutElements, nativeNodeId, } from "./layout.js";
+function isDict(value) {
+    return typeof value === "object" && value !== null && !Array.isArray(value);
+}
+/** Read `{nodeId: position}` straight from the document (not from cytoscape). */
+function readNodePositions(workflow) {
+    const positions = new Map();
+    if (isNativeDocument(workflow)) {
+        if (isDict(workflow.steps)) {
+            for (const [key, step] of Object.entries(workflow.steps)) {
+                if (isDict(step) && step.position != null) {
+                    positions.set(nativeNodeId(key, step), step.position);
+                }
+            }
+        }
+        return positions;
+    }
+    for (const containerKey of ["inputs", "steps"]) {
+        const container = workflow[containerKey];
+        const isInput = containerKey === "inputs";
+        const entries = isDict(container)
+            ? Object.entries(container)
+            : Array.isArray(container)
+                ? container.map((item) => [null, item])
+                : [];
+        for (const [key, item] of entries) {
+            const nodeId = format2NodeId(item, key, isInput);
+            if (isDict(item) && item.position != null && nodeId !== null) {
+                positions.set(nodeId, item.position);
+            }
+        }
+    }
+    return positions;
+}
+function graph(workflow, graphEntries) {
+    const [nodeIds, edges] = extractGraph(layoutElements(workflow, graphEntries));
+    return [nodeIds, edges, readNodePositions(workflow)];
+}
+function check(condition, message) {
+    if (!condition)
+        throw new Error(message);
+}
+/** Every edge points strictly rightward: `target.left > source.left`. */
+function downstreamRightOfUpstream([, edges, positions]) {
+    for (const [source, target] of edges) {
+        const s = positions.get(source);
+        const t = positions.get(target);
+        check(s !== undefined, `edge ${source}->${target}: source ${source} has no position`);
+        check(t !== undefined, `edge ${source}->${target}: target ${target} has no position`);
+        check(t.left > s.left, `edge ${source}->${target}: target.left ${t.left} not strictly right of source.left ${s.left}`);
+    }
+}
+/** Every graph node has a position in the document. */
+function allNodesPositioned([nodeIds, , positions]) {
+    const missing = nodeIds.filter((id) => !positions.has(id)).sort();
+    check(missing.length === 0, `nodes missing a position: ${JSON.stringify(missing)}`);
+}
+/** No two nodes occupy the same `{left, top}` coordinate. */
+function noPositionCollisions([, , positions]) {
+    const seen = new Map();
+    for (const [id, pos] of positions) {
+        const key = `${pos.left},${pos.top}`;
+        check(!seen.has(key), `nodes ${seen.get(key)} and ${id} share position (${key})`);
+        seen.set(key, id);
+    }
+}
+/** Nodes with no incoming edge sit at the minimum `left`. */
+function rootsLeftmost([nodeIds, edges, positions]) {
+    const targets = new Set(edges.map(([, target]) => target));
+    const roots = nodeIds.filter((id) => !targets.has(id));
+    if (roots.length === 0 || positions.size === 0)
+        return;
+    const minLeft = Math.min(...[...positions.values()].map((p) => p.left));
+    for (const id of roots) {
+        const pos = positions.get(id);
+        check(pos !== undefined, `root ${id} has no position`);
+        check(pos.left === minLeft, `root ${id} at left ${pos.left} is not at the minimum left ${minLeft}`);
+    }
+}
+/** The document plus every in-file subworkflow / `$graph` entry it lays out. */
+function* iterLayoutUnits(workflow, graphEntries = []) {
+    if (isGraphDocument(workflow)) {
+        const raw = workflow.$graph;
+        const entries = (Array.isArray(raw) ? raw : isDict(raw) ? Object.values(raw) : []).filter(isDict);
+        for (const entry of entries)
+            yield* iterLayoutUnits(entry, entries);
+        return;
+    }
+    yield graph(workflow, graphEntries);
+    for (const sub of iterSubworkflows(workflow))
+        yield* iterLayoutUnits(sub);
+}
+function recursive(checker) {
+    return (workflow) => {
+        for (const unit of iterLayoutUnits(workflow))
+            checker(unit);
+    };
+}
+export const GRAPH_PROPERTY_CHECKERS = {
+    downstream_right_of_upstream: recursive(downstreamRightOfUpstream),
+    all_nodes_positioned: recursive(allNodesPositioned),
+    no_position_collisions: recursive(noPositionCollisions),
+    roots_leftmost: recursive(rootsLeftmost),
+};
+//# sourceMappingURL=layout-properties.js.map

package/dist/workflow/layout-properties.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"layout-properties.js","sourceRoot":"","sources":["../../src/workflow/layout-properties.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAEL,YAAY,EACZ,aAAa,EACb,eAAe,EACf,gBAAgB,EAChB,gBAAgB,EAChB,cAAc,EAEd,YAAY,GACb,MAAM,aAAa,CAAC;AAKrB,SAAS,MAAM,CAAC,KAAc;IAC5B,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;AAC9E,CAAC;AAED,iFAAiF;AACjF,SAAS,iBAAiB,CAAC,QAAc;IACvC,MAAM,SAAS,GAAG,IAAI,GAAG,EAA0B,CAAC;IACpD,IAAI,gBAAgB,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC/B,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;YAC3B,KAAK,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;gBACzD,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,EAAE,CAAC;oBAC1C,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,QAA0B,CAAC,CAAC;gBAC1E,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,KAAK,MAAM,YAAY,IAAI,CAAC,QAAQ,EAAE,OAAO,CAAC,EAAE,CAAC;QAC/C,MAAM,SAAS,GAAG,QAAQ,CAAC,YAAY,CAAC,CAAC;QACzC,MAAM,OAAO,GAAG,YAAY,KAAK,QAAQ,CAAC;QAC1C,MAAM,OAAO,GAA+B,MAAM,CAAC,SAAS,CAAC;YAC3D,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC;YAC3B,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC;gBACxB,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;gBACvC,CAAC,CAAC,EAAE,CAAC;QACT,KAAK,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,OAAO,EAAE,CAAC;YAClC,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;YACjD,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;gBAC7D,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,QAA0B,CAAC,CAAC;YACzD,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAID,SAAS,KAAK,CAAC,QAAc,EAAE,YAAoB;IACjD,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,GAAG,YAAY,CAAC,cAAc,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC,CAAC;IAC9E,OAAO,CAAC,OAAO,EAAE,KAAK,EAAE,iBAAiB,CAAC,QAAQ,CAAC,CAAC,CAAC;AACvD,CAAC;AAED,SAAS,KAAK,CAAC,SAAkB,EAAE,OAAe;IAChD,IAAI,CAAC,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC;AAC3C,CAAC;AAED,yEAAyE;AACzE,SAAS,yBAAyB,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,CAAQ;IAC5D,KAAK,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACrC,MAAM,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAChC,MAAM,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAChC,KAAK,CAAC,CAAC,KAAK,SAAS,EAAE,QAAQ,MAAM,KAAK,MAAM,YAAY,MAAM,kBAAkB,CAAC,CAAC;QACtF,KAAK,CAAC,CAAC,KAAK,SAAS,EAAE,QAAQ,MAAM,KAAK,MAAM,YAAY,MAAM,kBAAkB,CAAC,CAAC;QACtF,KAAK,CACH,CAAE,CAAC,IAAI,GAAG,CAAE,CAAC,IAAI,EACjB,QAAQ,MAAM,KAAK,MAAM,iBAAiB,CAAE,CAAC,IAAI,sCAAsC,CAAE,CAAC,IAAI,EAAE,CACjG,CAAC;IACJ,CAAC;AACH,CAAC;AAED,uDAAuD;AACvD,SAAS,kBAAkB,CAAC,CAAC,OAAO,EAAE,AAAD,EAAG,SAAS,CAAQ;IACvD,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAClE,KAAK,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,6BAA6B,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;AACtF,CAAC;AAED,6DAA6D;AAC7D,SAAS,oBAAoB,CAAC,CAAC,EAAE,AAAD,EAAG,SAAS,CAAQ;IAClD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,KAAK,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,SAAS,EAAE,CAAC;QAClC,MAAM,GAAG,GAAG,GAAG,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,GAAG,EAAE,CAAC;QACrC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,SAAS,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,EAAE,oBAAoB,GAAG,GAAG,CAAC,CAAC;QAClF,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;IACpB,CAAC;AACH,CAAC;AAED,6DAA6D;AAC7D,SAAS,aAAa,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,SAAS,CAAQ;IACvD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;IAC3D,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACvD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,SAAS,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO;IACvD,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACxE,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;QACvB,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC9B,KAAK,CAAC,GAAG,KAAK,SAAS,EAAE,QAAQ,EAAE,kBAAkB,CAAC,CAAC;QACvD,KAAK,CACH,GAAI,CAAC,IAAI,KAAK,OAAO,EACrB,QAAQ,EAAE,YAAY,GAAI,CAAC,IAAI,+BAA+B,OAAO,EAAE,CACxE,CAAC;IACJ,CAAC;AACH,CAAC;AAED,gFAAgF;AAChF,QAAQ,CAAC,CAAC,eAAe,CAAC,QAAc,EAAE,eAAuB,EAAE;IACjE,IAAI,eAAe,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC9B,MAAM,GAAG,GAAG,QAAQ,CAAC,MAAM,CAAC;QAC5B,MAAM,OAAO,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CACvF,MAAM,CACP,CAAC;QACF,KAAK,MAAM,KAAK,IAAI,OAAO;YAAE,KAAK,CAAC,CAAC,eAAe,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QACpE,OAAO;IACT,CAAC;IACD,MAAM,KAAK,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;IACpC,KAAK,MAAM,GAAG,IAAI,gBAAgB,CAAC,QAAQ,CAAC;QAAE,KAAK,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;AAC5E,CAAC;AAED,SAAS,SAAS,CAAC,OAA8B;IAC/C,OAAO,CAAC,QAAiB,EAAE,EAAE;QAC3B,KAAK,MAAM,IAAI,IAAI,eAAe,CAAC,QAAgB,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,CAAC;IACtE,CAAC,CAAC;AACJ,CAAC;AAED,MAAM,CAAC,MAAM,uBAAuB,GAAyC;IAC3E,4BAA4B,EAAE,SAAS,CAAC,yBAAyB,CAAC;IAClE,oBAAoB,EAAE,SAAS,CAAC,kBAAkB,CAAC;IACnD,sBAAsB,EAAE,SAAS,CAAC,oBAAoB,CAAC;IACvD,cAAc,EAAE,SAAS,CAAC,aAAa,CAAC;CACzC,CAAC"}

package/dist/workflow/layout.d.ts

@@ -0,0 +1,84 @@
+/**
+ * Compute and apply node positions for Galaxy workflows.
+ *
+ * Port of gxformat2/layout. Two strategies: `topological` (the cross-language
+ * layering from `cytoscape-layout.ts`) and `layered` (barycenter Sugiyama
+ * crossing reduction). Layered coordinates are not a cross-language contract;
+ * both strategies are validated by the structural checkers in
+ * `layout-properties.ts`. Cyclic workflows raise {@link LayoutCycleError}.
+ */
+import type { CytoscapeElements, CytoscapePosition } from "./cytoscape-models.js";
+/** Sentinel value for `position:` that requests automatic layout. */
+export declare const AUTO = "auto";
+export type LayoutStrategy = "topological" | "layered";
+export interface LayoutPosition {
+    left: number;
+    top: number;
+}
+export interface ApplyLayoutOptions {
+    strategy?: LayoutStrategy;
+    /** Replace explicit positions too (an `auto` sentinel is always replaced). */
+    overwrite?: boolean;
+    /** Also lay out embedded in-file subworkflows. Defaults to true. */
+    recursive?: boolean;
+}
+/**
+ * Raised when a workflow graph contains a cycle. The bake path refuses to lay
+ * out a cyclic graph; the cytoscape viz path keeps its diagonal fallback.
+ */
+export declare class LayoutCycleError extends Error {
+    constructor(message: string);
+}
+type Dict = Record<string, unknown>;
+export type Edge = [string, string];
+/** Pull `[nodeIds, edges]` out of cytoscape elements, dropping dangling edges. */
+export declare function extractGraph(elements: CytoscapeElements): [string[], Edge[]];
+/**
+ * Longest-path layering via Kahn topological sort with declaration-index tie
+ * break (same as `topologicalPositions`). Throws {@link LayoutCycleError} when
+ * the graph is not a DAG.
+ */
+export declare function layerAssignment(nodeIds: string[], edges: Edge[]): Map<string, number>;
+/** Throw {@link LayoutCycleError} if `elements` describes a cyclic graph. */
+export declare function checkAcyclic(elements: CytoscapeElements): void;
+/**
+ * Sugiyama-style layered layout: longest-path layering, barycenter crossing
+ * reduction, then order-index rows per layer. Skip-level edges are not split
+ * into dummy nodes, so results can be suboptimal but every edge still points
+ * rightward.
+ */
+export declare function layeredPositions(elements: CytoscapeElements): Map<string, CytoscapePosition>;
+export declare function isNativeDocument(workflow: Dict): boolean;
+/** A `$graph` multi-workflow document (many workflows, one file). */
+export declare function isGraphDocument(workflow: unknown): workflow is Dict;
+/**
+ * Yield in-file subworkflows embedded in `workflow`'s steps (native inline
+ * `subworkflow`, Format2 embedded `run`). String references are not followed.
+ */
+export declare function iterSubworkflows(workflow: Dict): Generator<Dict>;
+/**
+ * Id cytoscape assigns to a Format2 node: inputs by id, steps by render
+ * identity. `key` is the dict-container key, or null for list form.
+ */
+export declare function format2NodeId(item: unknown, key: string | null, isInput: boolean): string | null;
+/** Id normalization assigns to a native step (label, else unlabeled sentinel). */
+export declare function nativeNodeId(key: string, step: Dict): string;
+/**
+ * Compute node positions keyed by node id (Format2 input ids / step render
+ * identities — the ids the cytoscape builder emits).
+ */
+/**
+ * Preset cytoscape elements for one layout unit. `graphEntries` are the
+ * sibling entries when `workflow` is part of a `$graph` document.
+ */
+export declare function layoutElements(workflow: unknown, graphEntries?: Dict[]): CytoscapeElements;
+export declare function layoutPositions(workflow: unknown, strategy?: LayoutStrategy, graphEntries?: Dict[]): Map<string, LayoutPosition>;
+/**
+ * Merge computed positions into a Format2 or native workflow dict, mutating it
+ * in place and returning it. Explicit positions are kept unless `overwrite`;
+ * `position: auto` is always replaced. With `recursive` (default), embedded
+ * subworkflows and every `$graph` entry get their own coordinate space.
+ */
+export declare function applyLayout(workflow: Dict, opts?: ApplyLayoutOptions): Dict;
+export {};
+//# sourceMappingURL=layout.d.ts.map

package/dist/workflow/layout.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"layout.d.ts","sourceRoot":"","sources":["../../src/workflow/layout.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAGH,OAAO,KAAK,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAKlF,qEAAqE;AACrE,eAAO,MAAM,IAAI,SAAS,CAAC;AAE3B,MAAM,MAAM,cAAc,GAAG,aAAa,GAAG,SAAS,CAAC;AAEvD,MAAM,WAAW,cAAc;IAC7B,IAAI,EAAE,MAAM,CAAC;IACb,GAAG,EAAE,MAAM,CAAC;CACb;AAED,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,EAAE,cAAc,CAAC;IAC1B,8EAA8E;IAC9E,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,oEAAoE;IACpE,SAAS,CAAC,EAAE,OAAO,CAAC;CACrB;AAED;;;GAGG;AACH,qBAAa,gBAAiB,SAAQ,KAAK;gBAC7B,OAAO,EAAE,MAAM;CAI5B;AAED,KAAK,IAAI,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;AACpC,MAAM,MAAM,IAAI,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AAcpC,kFAAkF;AAClF,wBAAgB,YAAY,CAAC,QAAQ,EAAE,iBAAiB,GAAG,CAAC,MAAM,EAAE,EAAE,IAAI,EAAE,CAAC,CAS5E;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAmCrF;AAED,6EAA6E;AAC7E,wBAAgB,YAAY,CAAC,QAAQ,EAAE,iBAAiB,GAAG,IAAI,CAG9D;AAkED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,QAAQ,EAAE,iBAAiB,GAAG,GAAG,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAgC5F;AAID,wBAAgB,gBAAgB,CAAC,QAAQ,EAAE,IAAI,GAAG,OAAO,CAExD;AAED,qEAAqE;AACrE,wBAAgB,eAAe,CAAC,QAAQ,EAAE,OAAO,GAAG,QAAQ,IAAI,IAAI,CAEnE;AAMD;;;GAGG;AACH,wBAAiB,gBAAgB,CAAC,QAAQ,EAAE,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,CAOjE;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI,EAAE,OAAO,EAAE,OAAO,GAAG,MAAM,GAAG,IAAI,CAShG;AAED,kFAAkF;AAClF,wBAAgB,YAAY,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,GAAG,MAAM,CAM5D;AAoBD;;;GAGG;AACH;;;GAGG;AACH,wBAAgB,cAAc,CAAC,QAAQ,EAAE,OAAO,EAAE,YAAY,GAAE,IAAI,EAAO,GAAG,iBAAiB,CAU9F;AAED,wBAAgB,eAAe,CAC7B,QAAQ,EAAE,OAAO,EACjB,QAAQ,GAAE,cAA8B,EACxC,YAAY,GAAE,IAAI,EAAO,GACxB,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,CAgB7B;AAoCD;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,QAAQ,EAAE,IAAI,EAAE,IAAI,GAAE,kBAAuB,GAAG,IAAI,CAO/E"}

package/dist/workflow/layout.js

@@ -0,0 +1,356 @@
+/**
+ * Compute and apply node positions for Galaxy workflows.
+ *
+ * Port of gxformat2/layout. Two strategies: `topological` (the cross-language
+ * layering from `cytoscape-layout.ts`) and `layered` (barycenter Sugiyama
+ * crossing reduction). Layered coordinates are not a cross-language contract;
+ * both strategies are validated by the structural checkers in
+ * `layout-properties.ts`. Cyclic workflows raise {@link LayoutCycleError}.
+ */
+import { COL_STRIDE, ROW_STRIDE, topologicalPositions } from "./cytoscape-layout.js";
+import { cytoscapeElements } from "./cytoscape.js";
+import { rawStepRenderIdentity, unlabeledNodeId } from "./normalized/labels.js";
+import { INPUT_STEP_TYPES } from "./normalized/toFormat2.js";
+/** Sentinel value for `position:` that requests automatic layout. */
+export const AUTO = "auto";
+/**
+ * Raised when a workflow graph contains a cycle. The bake path refuses to lay
+ * out a cyclic graph; the cytoscape viz path keeps its diagonal fallback.
+ */
+export class LayoutCycleError extends Error {
+    constructor(message) {
+        super(message);
+        this.name = "LayoutCycleError";
+    }
+}
+function isDict(value) {
+    return typeof value === "object" && value !== null && !Array.isArray(value);
+}
+function containerItems(container) {
+    if (Array.isArray(container))
+        return container;
+    if (isDict(container))
+        return Object.values(container);
+    return [];
+}
+// --- Graph + layering -------------------------------------------------------
+/** Pull `[nodeIds, edges]` out of cytoscape elements, dropping dangling edges. */
+export function extractGraph(elements) {
+    const nodeIds = elements.nodes.map((n) => n.data.id);
+    const idSet = new Set(nodeIds);
+    const edges = [];
+    for (const edge of elements.edges) {
+        const { source, target } = edge.data;
+        if (idSet.has(source) && idSet.has(target))
+            edges.push([source, target]);
+    }
+    return [nodeIds, edges];
+}
+/**
+ * Longest-path layering via Kahn topological sort with declaration-index tie
+ * break (same as `topologicalPositions`). Throws {@link LayoutCycleError} when
+ * the graph is not a DAG.
+ */
+export function layerAssignment(nodeIds, edges) {
+    const indexById = new Map(nodeIds.map((id, i) => [id, i]));
+    const incoming = new Map(nodeIds.map((id) => [id, []]));
+    const dependents = new Map(nodeIds.map((id) => [id, []]));
+    for (const [source, target] of edges) {
+        incoming.get(target).push(source);
+        dependents.get(source).push(target);
+    }
+    const inDegree = new Map(nodeIds.map((id) => [id, incoming.get(id).length]));
+    const column = new Map();
+    const queue = nodeIds.filter((id) => inDegree.get(id) === 0);
+    while (queue.length > 0) {
+        let best = 0;
+        for (let i = 1; i < queue.length; i++) {
+            if (indexById.get(queue[i]) < indexById.get(queue[best]))
+                best = i;
+        }
+        const id = queue.splice(best, 1)[0];
+        const sources = incoming.get(id);
+        column.set(id, sources.length === 0 ? 0 : Math.max(...sources.map((s) => column.get(s) + 1)));
+        for (const dep of dependents.get(id)) {
+            const remaining = inDegree.get(dep) - 1;
+            inDegree.set(dep, remaining);
+            if (remaining === 0)
+                queue.push(dep);
+        }
+    }
+    if (column.size !== nodeIds.length) {
+        const unplaced = nodeIds.filter((id) => !column.has(id)).sort();
+        throw new LayoutCycleError("Workflow graph contains a cycle; cannot compute a layout. " +
+            `Nodes on or downstream of the cycle: ${JSON.stringify(unplaced)}`);
+    }
+    return column;
+}
+/** Throw {@link LayoutCycleError} if `elements` describes a cyclic graph. */
+export function checkAcyclic(elements) {
+    const [nodeIds, edges] = extractGraph(elements);
+    layerAssignment(nodeIds, edges);
+}
+/** Barycenter sweeps to attempt; the best ordering seen is kept. */
+const MAX_SWEEPS = 8;
+function countCrossingsBetween(upper, lower, successors) {
+    const posLower = new Map(lower.map((id, i) => [id, i]));
+    const edges = [];
+    upper.forEach((u, uIdx) => {
+        for (const v of successors.get(u)) {
+            const vIdx = posLower.get(v);
+            if (vIdx !== undefined)
+                edges.push([uIdx, vIdx]);
+        }
+    });
+    let crossings = 0;
+    for (let i = 0; i < edges.length; i++) {
+        const [ui, vi] = edges[i];
+        for (let j = i + 1; j < edges.length; j++) {
+            const [uj, vj] = edges[j];
+            if ((ui < uj && vi > vj) || (ui > uj && vi < vj))
+                crossings += 1;
+        }
+    }
+    return crossings;
+}
+function countAllCrossings(layers, successors) {
+    let total = 0;
+    for (let col = 0; col < layers.length - 1; col++) {
+        total += countCrossingsBetween(layers[col], layers[col + 1], successors);
+    }
+    return total;
+}
+/** Stable reorder of `layer` by mean position of each node's fixed neighbors. */
+function orderByBarycenter(layer, neighbors, posInFixed) {
+    const keyed = layer.map((id, idx) => {
+        const fixed = neighbors
+            .get(id)
+            .map((m) => posInFixed.get(m))
+            .filter((p) => p !== undefined);
+        const key = fixed.length > 0 ? fixed.reduce((a, b) => a + b, 0) / fixed.length : idx;
+        return { id, key };
+    });
+    // Array.prototype.sort is stable, so ties preserve input order.
+    return keyed.sort((a, b) => a.key - b.key).map((k) => k.id);
+}
+function sweep(layers, neighbors, down) {
+    const columns = [];
+    if (down)
+        for (let col = 1; col < layers.length; col++)
+            columns.push(col);
+    else
+        for (let col = layers.length - 2; col >= 0; col--)
+            columns.push(col);
+    for (const col of columns) {
+        const fixed = layers[down ? col - 1 : col + 1];
+        const posInFixed = new Map(fixed.map((id, i) => [id, i]));
+        layers[col] = orderByBarycenter(layers[col], neighbors, posInFixed);
+    }
+}
+/**
+ * Sugiyama-style layered layout: longest-path layering, barycenter crossing
+ * reduction, then order-index rows per layer. Skip-level edges are not split
+ * into dummy nodes, so results can be suboptimal but every edge still points
+ * rightward.
+ */
+export function layeredPositions(elements) {
+    const [nodeIds, edges] = extractGraph(elements);
+    const column = layerAssignment(nodeIds, edges);
+    const maxCol = Math.max(-1, ...column.values());
+    const layers = Array.from({ length: maxCol + 1 }, () => []);
+    for (const id of nodeIds)
+        layers[column.get(id)].push(id);
+    const predecessors = new Map(nodeIds.map((id) => [id, []]));
+    const successors = new Map(nodeIds.map((id) => [id, []]));
+    for (const [source, target] of edges) {
+        successors.get(source).push(target);
+        predecessors.get(target).push(source);
+    }
+    let bestLayers = layers.map((l) => [...l]);
+    let bestCrossings = countAllCrossings(bestLayers, successors);
+    for (let i = 0; i < MAX_SWEEPS && bestCrossings > 0; i++) {
+        const goingDown = i % 2 === 0;
+        sweep(layers, goingDown ? predecessors : successors, goingDown);
+        const crossings = countAllCrossings(layers, successors);
+        if (crossings < bestCrossings) {
+            bestCrossings = crossings;
+            bestLayers = layers.map((l) => [...l]);
+        }
+    }
+    const positions = new Map();
+    bestLayers.forEach((layer, col) => {
+        layer.forEach((id, row) => positions.set(id, { x: col * COL_STRIDE, y: row * ROW_STRIDE }));
+    });
+    return positions;
+}
+// --- Document helpers (shared with layout-properties.ts) ---------------------
+export function isNativeDocument(workflow) {
+    return workflow.a_galaxy_workflow === "true";
+}
+/** A `$graph` multi-workflow document (many workflows, one file). */
+export function isGraphDocument(workflow) {
+    return isDict(workflow) && "$graph" in workflow && !("class" in workflow);
+}
+function isEmbeddedWorkflow(value) {
+    return isDict(value) && (value.class === "GalaxyWorkflow" || value.a_galaxy_workflow === "true");
+}
+/**
+ * Yield in-file subworkflows embedded in `workflow`'s steps (native inline
+ * `subworkflow`, Format2 embedded `run`). String references are not followed.
+ */
+export function* iterSubworkflows(workflow) {
+    const native = isNativeDocument(workflow);
+    for (const step of containerItems(workflow.steps)) {
+        if (!isDict(step))
+            continue;
+        const candidate = native ? step.subworkflow : step.run;
+        if (isEmbeddedWorkflow(candidate))
+            yield candidate;
+    }
+}
+/**
+ * Id cytoscape assigns to a Format2 node: inputs by id, steps by render
+ * identity. `key` is the dict-container key, or null for list form.
+ */
+export function format2NodeId(item, key, isInput) {
+    if (isInput) {
+        if (key !== null)
+            return key;
+        return isDict(item) && typeof item.id === "string" ? item.id : null;
+    }
+    if (key !== null)
+        return rawStepRenderIdentity(item, key);
+    if (!isDict(item))
+        return null;
+    const id = item.label || item.id;
+    return id ?? null;
+}
+/** Id normalization assigns to a native step (label, else unlabeled sentinel). */
+export function nativeNodeId(key, step) {
+    return unlabeledNodeId(step.label, step.id ?? key, INPUT_STEP_TYPES.has(step.type));
+}
+function stripPositions(workflow) {
+    const cleaned = JSON.parse(JSON.stringify(workflow));
+    const containerKeys = isNativeDocument(cleaned) ? ["steps"] : ["inputs", "steps"];
+    for (const containerKey of containerKeys) {
+        for (const item of containerItems(cleaned[containerKey])) {
+            if (isDict(item))
+                delete item.position;
+        }
+    }
+    return cleaned;
+}
+function shouldWrite(existing, overwrite) {
+    if (existing == null || existing === AUTO)
+        return true;
+    return overwrite;
+}
+// --- Public API ---------------------------------------------------------------
+/**
+ * Compute node positions keyed by node id (Format2 input ids / step render
+ * identities — the ids the cytoscape builder emits).
+ */
+/**
+ * Preset cytoscape elements for one layout unit. `graphEntries` are the
+ * sibling entries when `workflow` is part of a `$graph` document.
+ */
+export function layoutElements(workflow, graphEntries = []) {
+    // Strip positions first: strategies ignore them and `auto` isn't a valid position.
+    let source = isDict(workflow) ? stripPositions(workflow) : workflow;
+    if (graphEntries.length > 0 && isDict(source)) {
+        // Normalize the entry as `main` alongside its siblings so `#id` run
+        // references resolve.
+        const siblings = graphEntries.filter((e) => e !== workflow && e.id !== "main");
+        source = { $graph: [{ ...source, id: "main" }, ...siblings] };
+    }
+    return cytoscapeElements(source, { layout: "preset", draftOverlay: null });
+}
+export function layoutPositions(workflow, strategy = "topological", graphEntries = []) {
+    if (strategy !== "topological" && strategy !== "layered") {
+        throw new Error(`Unknown layout strategy "${strategy}". Valid values: topological, layered.`);
+    }
+    const elements = layoutElements(workflow, graphEntries);
+    let positions;
+    if (strategy === "topological") {
+        // topologicalPositions silently falls back on cycles; refuse up front.
+        checkAcyclic(elements);
+        positions = topologicalPositions(elements);
+    }
+    else {
+        positions = layeredPositions(elements);
+    }
+    const result = new Map();
+    for (const [id, p] of positions)
+        result.set(id, { left: p.x, top: p.y });
+    return result;
+}
+function applyToContainer(container, positions, overwrite, isInput) {
+    if (isDict(container)) {
+        for (const key of Object.keys(container)) {
+            const pos = positions.get(format2NodeId(container[key], key, isInput) ?? "");
+            if (pos === undefined)
+                continue;
+            // Promote Format2 shorthand (e.g. `x: data`) to mapping form.
+            const value = isDict(container[key]) ? container[key] : { type: container[key] };
+            if (shouldWrite(value.position, overwrite))
+                value.position = { ...pos };
+            container[key] = value;
+        }
+    }
+    else if (Array.isArray(container)) {
+        for (const item of container) {
+            if (!isDict(item))
+                continue;
+            const pos = positions.get(format2NodeId(item, null, isInput) ?? "");
+            if (pos !== undefined && shouldWrite(item.position, overwrite))
+                item.position = { ...pos };
+        }
+    }
+    return container;
+}
+function applyNative(workflow, positions, overwrite) {
+    if (!isDict(workflow.steps))
+        return;
+    for (const [key, step] of Object.entries(workflow.steps)) {
+        if (!isDict(step))
+            continue;
+        const pos = positions.get(nativeNodeId(key, step));
+        if (pos !== undefined && shouldWrite(step.position, overwrite))
+            step.position = { ...pos };
+    }
+}
+/**
+ * Merge computed positions into a Format2 or native workflow dict, mutating it
+ * in place and returning it. Explicit positions are kept unless `overwrite`;
+ * `position: auto` is always replaced. With `recursive` (default), embedded
+ * subworkflows and every `$graph` entry get their own coordinate space.
+ */
+export function applyLayout(workflow, opts = {}) {
+    if (isGraphDocument(workflow)) {
+        const entries = containerItems(workflow.$graph).filter(isDict);
+        for (const entry of entries)
+            applyLayoutUnit(entry, opts, entries);
+        return workflow;
+    }
+    return applyLayoutUnit(workflow, opts, []);
+}
+function applyLayoutUnit(workflow, opts, graphEntries) {
+    const { strategy = "topological", overwrite = false, recursive = true } = opts;
+    const positions = layoutPositions(workflow, strategy, graphEntries);
+    if (isNativeDocument(workflow)) {
+        applyNative(workflow, positions, overwrite);
+    }
+    else {
+        for (const containerKey of ["inputs", "steps"]) {
+            if (workflow[containerKey] == null)
+                continue;
+            workflow[containerKey] = applyToContainer(workflow[containerKey], positions, overwrite, containerKey === "inputs");
+        }
+    }
+    if (recursive) {
+        for (const sub of iterSubworkflows(workflow))
+            applyLayout(sub, opts);
+    }
+    return workflow;
+}
+//# sourceMappingURL=layout.js.map