@n8n/workflow-sdk 0.2.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/LICENSE.md +88 -0
- package/README.md +30 -0
- package/dist/ast-interpreter/errors.d.ts +19 -0
- package/dist/ast-interpreter/errors.js +64 -0
- package/dist/ast-interpreter/errors.js.map +1 -0
- package/dist/ast-interpreter/index.d.ts +5 -0
- package/dist/ast-interpreter/index.js +18 -0
- package/dist/ast-interpreter/index.js.map +1 -0
- package/dist/ast-interpreter/interpreter.d.ts +2 -0
- package/dist/ast-interpreter/interpreter.js +471 -0
- package/dist/ast-interpreter/interpreter.js.map +1 -0
- package/dist/ast-interpreter/parser.d.ts +2 -0
- package/dist/ast-interpreter/parser.js +61 -0
- package/dist/ast-interpreter/parser.js.map +1 -0
- package/dist/ast-interpreter/validators.d.ts +13 -0
- package/dist/ast-interpreter/validators.js +243 -0
- package/dist/ast-interpreter/validators.js.map +1 -0
- package/dist/build.tsbuildinfo +1 -0
- package/dist/cli/code-to-json.d.ts +1 -0
- package/dist/cli/code-to-json.js +51 -0
- package/dist/cli/code-to-json.js.map +1 -0
- package/dist/cli/index.d.ts +2 -0
- package/dist/cli/index.js +25 -0
- package/dist/cli/index.js.map +1 -0
- package/dist/cli/json-to-code.d.ts +1 -0
- package/dist/cli/json-to-code.js +60 -0
- package/dist/cli/json-to-code.js.map +1 -0
- package/dist/cli/utils.d.ts +1 -0
- package/dist/cli/utils.js +16 -0
- package/dist/cli/utils.js.map +1 -0
- package/dist/codegen/code-generator.d.ts +14 -0
- package/dist/codegen/code-generator.js +807 -0
- package/dist/codegen/code-generator.js.map +1 -0
- package/dist/codegen/composite-builder.d.ts +3 -0
- package/dist/codegen/composite-builder.js +718 -0
- package/dist/codegen/composite-builder.js.map +1 -0
- package/dist/codegen/composite-handlers/build-utils.d.ts +24 -0
- package/dist/codegen/composite-handlers/build-utils.js +79 -0
- package/dist/codegen/composite-handlers/build-utils.js.map +1 -0
- package/dist/codegen/composite-handlers/error-handler.d.ts +6 -0
- package/dist/codegen/composite-handlers/error-handler.js +51 -0
- package/dist/codegen/composite-handlers/error-handler.js.map +1 -0
- package/dist/codegen/composite-handlers/if-else-handler.d.ts +5 -0
- package/dist/codegen/composite-handlers/if-else-handler.js +57 -0
- package/dist/codegen/composite-handlers/if-else-handler.js.map +1 -0
- package/dist/codegen/composite-handlers/index.d.ts +1 -0
- package/dist/codegen/composite-handlers/index.js +17 -0
- package/dist/codegen/composite-handlers/index.js.map +1 -0
- package/dist/codegen/composite-handlers/merge-handler.d.ts +5 -0
- package/dist/codegen/composite-handlers/merge-handler.js +25 -0
- package/dist/codegen/composite-handlers/merge-handler.js.map +1 -0
- package/dist/codegen/composite-handlers/sib-handler.d.ts +5 -0
- package/dist/codegen/composite-handlers/sib-handler.js +57 -0
- package/dist/codegen/composite-handlers/sib-handler.js.map +1 -0
- package/dist/codegen/composite-handlers/switch-case-handler.d.ts +5 -0
- package/dist/codegen/composite-handlers/switch-case-handler.js +80 -0
- package/dist/codegen/composite-handlers/switch-case-handler.js.map +1 -0
- package/dist/codegen/composite-tree.d.ts +81 -0
- package/dist/codegen/composite-tree.js +3 -0
- package/dist/codegen/composite-tree.js.map +1 -0
- package/dist/codegen/config-builder.d.ts +7 -0
- package/dist/codegen/config-builder.js +22 -0
- package/dist/codegen/config-builder.js.map +1 -0
- package/dist/codegen/constants.d.ts +5 -0
- package/dist/codegen/constants.js +30 -0
- package/dist/codegen/constants.js.map +1 -0
- package/dist/codegen/deferred-connections.d.ts +20 -0
- package/dist/codegen/deferred-connections.js +46 -0
- package/dist/codegen/deferred-connections.js.map +1 -0
- package/dist/codegen/execution-schema-jsdoc.d.ts +3 -0
- package/dist/codegen/execution-schema-jsdoc.js +109 -0
- package/dist/codegen/execution-schema-jsdoc.js.map +1 -0
- package/dist/codegen/execution-status.d.ts +9 -0
- package/dist/codegen/execution-status.js +42 -0
- package/dist/codegen/execution-status.js.map +1 -0
- package/dist/codegen/expression-annotator.d.ts +2 -0
- package/dist/codegen/expression-annotator.js +38 -0
- package/dist/codegen/expression-annotator.js.map +1 -0
- package/dist/codegen/graph-annotator.d.ts +2 -0
- package/dist/codegen/graph-annotator.js +107 -0
- package/dist/codegen/graph-annotator.js.map +1 -0
- package/dist/codegen/index.d.ts +20 -0
- package/dist/codegen/index.js +60 -0
- package/dist/codegen/index.js.map +1 -0
- package/dist/codegen/merge-pattern.d.ts +12 -0
- package/dist/codegen/merge-pattern.js +119 -0
- package/dist/codegen/merge-pattern.js.map +1 -0
- package/dist/codegen/node-type-utils.d.ts +4 -0
- package/dist/codegen/node-type-utils.js +38 -0
- package/dist/codegen/node-type-utils.js.map +1 -0
- package/dist/codegen/output-utils.d.ts +9 -0
- package/dist/codegen/output-utils.js +68 -0
- package/dist/codegen/output-utils.js.map +1 -0
- package/dist/codegen/parse-workflow-code.d.ts +3 -0
- package/dist/codegen/parse-workflow-code.js +438 -0
- package/dist/codegen/parse-workflow-code.js.map +1 -0
- package/dist/codegen/semantic-graph.d.ts +3 -0
- package/dist/codegen/semantic-graph.js +216 -0
- package/dist/codegen/semantic-graph.js.map +1 -0
- package/dist/codegen/semantic-registry.d.ts +18 -0
- package/dist/codegen/semantic-registry.js +102 -0
- package/dist/codegen/semantic-registry.js.map +1 -0
- package/dist/codegen/sib-merge-handler.d.ts +20 -0
- package/dist/codegen/sib-merge-handler.js +92 -0
- package/dist/codegen/sib-merge-handler.js.map +1 -0
- package/dist/codegen/string-utils.d.ts +6 -0
- package/dist/codegen/string-utils.js +38 -0
- package/dist/codegen/string-utils.js.map +1 -0
- package/dist/codegen/subnode-generator.d.ts +17 -0
- package/dist/codegen/subnode-generator.js +219 -0
- package/dist/codegen/subnode-generator.js.map +1 -0
- package/dist/codegen/types.d.ts +40 -0
- package/dist/codegen/types.js +16 -0
- package/dist/codegen/types.js.map +1 -0
- package/dist/codegen/variable-names.d.ts +8 -0
- package/dist/codegen/variable-names.js +121 -0
- package/dist/codegen/variable-names.js.map +1 -0
- package/dist/constants/index.d.ts +1 -0
- package/dist/constants/index.js +14 -0
- package/dist/constants/index.js.map +1 -0
- package/dist/constants/node-types.d.ts +19 -0
- package/dist/constants/node-types.js +46 -0
- package/dist/constants/node-types.js.map +1 -0
- package/dist/expression/index.d.ts +6 -0
- package/dist/expression/index.js +181 -0
- package/dist/expression/index.js.map +1 -0
- package/dist/expression.d.ts +1 -0
- package/dist/expression.js +10 -0
- package/dist/expression.js.map +1 -0
- package/dist/generate-types/generate-node-defs-cli.d.ts +7 -0
- package/dist/generate-types/generate-node-defs-cli.js +99 -0
- package/dist/generate-types/generate-node-defs-cli.js.map +1 -0
- package/dist/generate-types/generate-types.d.ts +163 -0
- package/dist/generate-types/generate-types.js +2569 -0
- package/dist/generate-types/generate-types.js.map +1 -0
- package/dist/generate-types/generate-zod-schemas.d.ts +41 -0
- package/dist/generate-types/generate-zod-schemas.js +1129 -0
- package/dist/generate-types/generate-zod-schemas.js.map +1 -0
- package/dist/generate-types/index.d.ts +3 -0
- package/dist/generate-types/index.js +62 -0
- package/dist/generate-types/index.js.map +1 -0
- package/dist/generate-types/zod-helpers.d.ts +189 -0
- package/dist/generate-types/zod-helpers.js +76 -0
- package/dist/generate-types/zod-helpers.js.map +1 -0
- package/dist/index.d.ts +20 -0
- package/dist/index.js +87 -0
- package/dist/index.js.map +1 -0
- package/dist/types/aliases.d.ts +5 -0
- package/dist/types/aliases.js +3 -0
- package/dist/types/aliases.js.map +1 -0
- package/dist/types/base.d.ts +395 -0
- package/dist/types/base.js +22 -0
- package/dist/types/base.js.map +1 -0
- package/dist/utils/code-helpers.d.ts +7 -0
- package/dist/utils/code-helpers.js +47 -0
- package/dist/utils/code-helpers.js.map +1 -0
- package/dist/utils/index.d.ts +2 -0
- package/dist/utils/index.js +11 -0
- package/dist/utils/index.js.map +1 -0
- package/dist/utils/safe-access.d.ts +3 -0
- package/dist/utils/safe-access.js +21 -0
- package/dist/utils/safe-access.js.map +1 -0
- package/dist/utils/trigger-detection.d.ts +1 -0
- package/dist/utils/trigger-detection.js +17 -0
- package/dist/utils/trigger-detection.js.map +1 -0
- package/dist/validation/display-options.d.ts +18 -0
- package/dist/validation/display-options.js +194 -0
- package/dist/validation/display-options.js.map +1 -0
- package/dist/validation/index.d.ts +34 -0
- package/dist/validation/index.js +428 -0
- package/dist/validation/index.js.map +1 -0
- package/dist/validation/input-resolver.d.ts +2 -0
- package/dist/validation/input-resolver.js +23 -0
- package/dist/validation/input-resolver.js.map +1 -0
- package/dist/validation/resolve-schema.d.ts +14 -0
- package/dist/validation/resolve-schema.js +105 -0
- package/dist/validation/resolve-schema.js.map +1 -0
- package/dist/validation/schema-helpers.d.ts +164 -0
- package/dist/validation/schema-helpers.js +51 -0
- package/dist/validation/schema-helpers.js.map +1 -0
- package/dist/validation/schema-validator.d.ts +22 -0
- package/dist/validation/schema-validator.js +402 -0
- package/dist/validation/schema-validator.js.map +1 -0
- package/dist/validation/test-schema-setup.d.ts +2 -0
- package/dist/validation/test-schema-setup.js +108 -0
- package/dist/validation/test-schema-setup.js.map +1 -0
- package/dist/validation.d.ts +1 -0
- package/dist/validation.js +9 -0
- package/dist/validation.js.map +1 -0
- package/dist/workflow-builder/connection-utils.d.ts +4 -0
- package/dist/workflow-builder/connection-utils.js +42 -0
- package/dist/workflow-builder/connection-utils.js.map +1 -0
- package/dist/workflow-builder/constants.d.ts +3 -0
- package/dist/workflow-builder/constants.js +7 -0
- package/dist/workflow-builder/constants.js.map +1 -0
- package/dist/workflow-builder/control-flow-builders/if-else.d.ts +2 -0
- package/dist/workflow-builder/control-flow-builders/if-else.js +3 -0
- package/dist/workflow-builder/control-flow-builders/if-else.js.map +1 -0
- package/dist/workflow-builder/control-flow-builders/next-batch.d.ts +2 -0
- package/dist/workflow-builder/control-flow-builders/next-batch.js +7 -0
- package/dist/workflow-builder/control-flow-builders/next-batch.js.map +1 -0
- package/dist/workflow-builder/control-flow-builders/split-in-batches.d.ts +27 -0
- package/dist/workflow-builder/control-flow-builders/split-in-batches.js +268 -0
- package/dist/workflow-builder/control-flow-builders/split-in-batches.js.map +1 -0
- package/dist/workflow-builder/control-flow-builders/switch-case.d.ts +2 -0
- package/dist/workflow-builder/control-flow-builders/switch-case.js +3 -0
- package/dist/workflow-builder/control-flow-builders/switch-case.js.map +1 -0
- package/dist/workflow-builder/layout-utils.d.ts +2 -0
- package/dist/workflow-builder/layout-utils.js +54 -0
- package/dist/workflow-builder/layout-utils.js.map +1 -0
- package/dist/workflow-builder/node-builders/index.d.ts +2 -0
- package/dist/workflow-builder/node-builders/index.js +29 -0
- package/dist/workflow-builder/node-builders/index.js.map +1 -0
- package/dist/workflow-builder/node-builders/node-builder.d.ts +26 -0
- package/dist/workflow-builder/node-builders/node-builder.js +596 -0
- package/dist/workflow-builder/node-builders/node-builder.js.map +1 -0
- package/dist/workflow-builder/node-builders/subnode-builders.d.ts +25 -0
- package/dist/workflow-builder/node-builders/subnode-builders.js +110 -0
- package/dist/workflow-builder/node-builders/subnode-builders.js.map +1 -0
- package/dist/workflow-builder/pin-data-utils.d.ts +5 -0
- package/dist/workflow-builder/pin-data-utils.js +54 -0
- package/dist/workflow-builder/pin-data-utils.js.map +1 -0
- package/dist/workflow-builder/plugins/composite-handlers/branch-handler-utils.d.ts +9 -0
- package/dist/workflow-builder/plugins/composite-handlers/branch-handler-utils.js +162 -0
- package/dist/workflow-builder/plugins/composite-handlers/branch-handler-utils.js.map +1 -0
- package/dist/workflow-builder/plugins/composite-handlers/if-else-handler.d.ts +5 -0
- package/dist/workflow-builder/plugins/composite-handlers/if-else-handler.js +83 -0
- package/dist/workflow-builder/plugins/composite-handlers/if-else-handler.js.map +1 -0
- package/dist/workflow-builder/plugins/composite-handlers/index.d.ts +3 -0
- package/dist/workflow-builder/plugins/composite-handlers/index.js +10 -0
- package/dist/workflow-builder/plugins/composite-handlers/index.js.map +1 -0
- package/dist/workflow-builder/plugins/composite-handlers/split-in-batches-handler.d.ts +15 -0
- package/dist/workflow-builder/plugins/composite-handlers/split-in-batches-handler.js +216 -0
- package/dist/workflow-builder/plugins/composite-handlers/split-in-batches-handler.js.map +1 -0
- package/dist/workflow-builder/plugins/composite-handlers/switch-case-handler.d.ts +5 -0
- package/dist/workflow-builder/plugins/composite-handlers/switch-case-handler.js +91 -0
- package/dist/workflow-builder/plugins/composite-handlers/switch-case-handler.js.map +1 -0
- package/dist/workflow-builder/plugins/defaults.d.ts +2 -0
- package/dist/workflow-builder/plugins/defaults.js +53 -0
- package/dist/workflow-builder/plugins/defaults.js.map +1 -0
- package/dist/workflow-builder/plugins/index.d.ts +3 -0
- package/dist/workflow-builder/plugins/index.js +9 -0
- package/dist/workflow-builder/plugins/index.js.map +1 -0
- package/dist/workflow-builder/plugins/registry.d.ts +22 -0
- package/dist/workflow-builder/plugins/registry.js +98 -0
- package/dist/workflow-builder/plugins/registry.js.map +1 -0
- package/dist/workflow-builder/plugins/serializers/index.d.ts +1 -0
- package/dist/workflow-builder/plugins/serializers/index.js +6 -0
- package/dist/workflow-builder/plugins/serializers/index.js.map +1 -0
- package/dist/workflow-builder/plugins/serializers/json-serializer.d.ts +3 -0
- package/dist/workflow-builder/plugins/serializers/json-serializer.js +140 -0
- package/dist/workflow-builder/plugins/serializers/json-serializer.js.map +1 -0
- package/dist/workflow-builder/plugins/types.d.ts +76 -0
- package/dist/workflow-builder/plugins/types.js +29 -0
- package/dist/workflow-builder/plugins/types.js.map +1 -0
- package/dist/workflow-builder/plugins/validators/agent-validator.d.ts +2 -0
- package/dist/workflow-builder/plugins/validators/agent-validator.js +45 -0
- package/dist/workflow-builder/plugins/validators/agent-validator.js.map +1 -0
- package/dist/workflow-builder/plugins/validators/chain-llm-validator.d.ts +2 -0
- package/dist/workflow-builder/plugins/validators/chain-llm-validator.js +39 -0
- package/dist/workflow-builder/plugins/validators/chain-llm-validator.js.map +1 -0
- package/dist/workflow-builder/plugins/validators/date-method-validator.d.ts +2 -0
- package/dist/workflow-builder/plugins/validators/date-method-validator.js +28 -0
- package/dist/workflow-builder/plugins/validators/date-method-validator.js.map +1 -0
- package/dist/workflow-builder/plugins/validators/disconnected-node-validator.d.ts +2 -0
- package/dist/workflow-builder/plugins/validators/disconnected-node-validator.js +142 -0
- package/dist/workflow-builder/plugins/validators/disconnected-node-validator.js.map +1 -0
- package/dist/workflow-builder/plugins/validators/expression-path-validator.d.ts +2 -0
- package/dist/workflow-builder/plugins/validators/expression-path-validator.js +155 -0
- package/dist/workflow-builder/plugins/validators/expression-path-validator.js.map +1 -0
- package/dist/workflow-builder/plugins/validators/expression-prefix-validator.d.ts +2 -0
- package/dist/workflow-builder/plugins/validators/expression-prefix-validator.js +32 -0
- package/dist/workflow-builder/plugins/validators/expression-prefix-validator.js.map +1 -0
- package/dist/workflow-builder/plugins/validators/from-ai-validator.d.ts +2 -0
- package/dist/workflow-builder/plugins/validators/from-ai-validator.js +30 -0
- package/dist/workflow-builder/plugins/validators/from-ai-validator.js.map +1 -0
- package/dist/workflow-builder/plugins/validators/http-request-validator.d.ts +2 -0
- package/dist/workflow-builder/plugins/validators/http-request-validator.js +55 -0
- package/dist/workflow-builder/plugins/validators/http-request-validator.js.map +1 -0
- package/dist/workflow-builder/plugins/validators/index.d.ts +15 -0
- package/dist/workflow-builder/plugins/validators/index.js +34 -0
- package/dist/workflow-builder/plugins/validators/index.js.map +1 -0
- package/dist/workflow-builder/plugins/validators/max-nodes-validator.d.ts +2 -0
- package/dist/workflow-builder/plugins/validators/max-nodes-validator.js +40 -0
- package/dist/workflow-builder/plugins/validators/max-nodes-validator.js.map +1 -0
- package/dist/workflow-builder/plugins/validators/merge-node-validator.d.ts +2 -0
- package/dist/workflow-builder/plugins/validators/merge-node-validator.js +54 -0
- package/dist/workflow-builder/plugins/validators/merge-node-validator.js.map +1 -0
- package/dist/workflow-builder/plugins/validators/missing-trigger-validator.d.ts +2 -0
- package/dist/workflow-builder/plugins/validators/missing-trigger-validator.js +27 -0
- package/dist/workflow-builder/plugins/validators/missing-trigger-validator.js.map +1 -0
- package/dist/workflow-builder/plugins/validators/no-nodes-validator.d.ts +2 -0
- package/dist/workflow-builder/plugins/validators/no-nodes-validator.js +23 -0
- package/dist/workflow-builder/plugins/validators/no-nodes-validator.js.map +1 -0
- package/dist/workflow-builder/plugins/validators/set-node-validator.d.ts +2 -0
- package/dist/workflow-builder/plugins/validators/set-node-validator.js +41 -0
- package/dist/workflow-builder/plugins/validators/set-node-validator.js.map +1 -0
- package/dist/workflow-builder/plugins/validators/subnode-connection-validator.d.ts +2 -0
- package/dist/workflow-builder/plugins/validators/subnode-connection-validator.js +64 -0
- package/dist/workflow-builder/plugins/validators/subnode-connection-validator.js.map +1 -0
- package/dist/workflow-builder/plugins/validators/tool-node-validator.d.ts +2 -0
- package/dist/workflow-builder/plugins/validators/tool-node-validator.js +37 -0
- package/dist/workflow-builder/plugins/validators/tool-node-validator.js.map +1 -0
- package/dist/workflow-builder/string-utils.d.ts +9 -0
- package/dist/workflow-builder/string-utils.js +237 -0
- package/dist/workflow-builder/string-utils.js.map +1 -0
- package/dist/workflow-builder/subnode-utils.d.ts +2 -0
- package/dist/workflow-builder/subnode-utils.js +180 -0
- package/dist/workflow-builder/subnode-utils.js.map +1 -0
- package/dist/workflow-builder/type-guards.d.ts +15 -0
- package/dist/workflow-builder/type-guards.js +48 -0
- package/dist/workflow-builder/type-guards.js.map +1 -0
- package/dist/workflow-builder/validation-helpers.d.ts +27 -0
- package/dist/workflow-builder/validation-helpers.js +195 -0
- package/dist/workflow-builder/validation-helpers.js.map +1 -0
- package/dist/workflow-builder/workflow-import.d.ts +15 -0
- package/dist/workflow-builder/workflow-import.js +102 -0
- package/dist/workflow-builder/workflow-import.js.map +1 -0
- package/dist/workflow-builder.d.ts +2 -0
- package/dist/workflow-builder.js +636 -0
- package/dist/workflow-builder.js.map +1 -0
- package/package.json +61 -0
|
@@ -0,0 +1,718 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
exports.buildCompositeTree = buildCompositeTree;
|
|
4
|
+
const build_utils_1 = require("./composite-handlers/build-utils");
|
|
5
|
+
const merge_pattern_1 = require("./merge-pattern");
|
|
6
|
+
const output_utils_1 = require("./output-utils");
|
|
7
|
+
const semantic_registry_1 = require("./semantic-registry");
|
|
8
|
+
const sib_merge_handler_1 = require("./sib-merge-handler");
|
|
9
|
+
function buildBranchTargets(targets, ctx, sourceNodeName, sourceOutputIndex) {
|
|
10
|
+
if (targets.length === 0)
|
|
11
|
+
return null;
|
|
12
|
+
if (targets.length === 1) {
|
|
13
|
+
const singleTarget = targets[0];
|
|
14
|
+
const targetNode = ctx.graph.nodes.get(singleTarget.target);
|
|
15
|
+
if (ctx.isBranchContext && targetNode && (0, build_utils_1.isMergeType)(targetNode.type) && sourceNodeName) {
|
|
16
|
+
ctx.visited.add(singleTarget.target);
|
|
17
|
+
ctx.variables.set(singleTarget.target, targetNode);
|
|
18
|
+
ctx.deferredMergeNodes.add(singleTarget.target);
|
|
19
|
+
let inputIndex = 0;
|
|
20
|
+
if (singleTarget.targetInputSlot) {
|
|
21
|
+
inputIndex = (0, build_utils_1.extractInputIndex)(singleTarget.targetInputSlot);
|
|
22
|
+
}
|
|
23
|
+
else {
|
|
24
|
+
const sourceNode = ctx.graph.nodes.get(sourceNodeName);
|
|
25
|
+
const isSwitch = sourceNode && (0, build_utils_1.isSwitchType)(sourceNode.type);
|
|
26
|
+
const outputSlotName = (0, build_utils_1.getOutputSlotName)(sourceOutputIndex ?? 0, isSwitch);
|
|
27
|
+
inputIndex = (0, merge_pattern_1.findMergeInputIndex)(targetNode, sourceNodeName, outputSlotName);
|
|
28
|
+
}
|
|
29
|
+
ctx.deferredConnections.push({
|
|
30
|
+
sourceNodeName,
|
|
31
|
+
sourceOutputIndex: sourceOutputIndex ?? 0,
|
|
32
|
+
targetNode,
|
|
33
|
+
targetInputIndex: inputIndex,
|
|
34
|
+
});
|
|
35
|
+
return (0, build_utils_1.createVarRef)(singleTarget.target);
|
|
36
|
+
}
|
|
37
|
+
return buildFromNode(singleTarget.target, ctx);
|
|
38
|
+
}
|
|
39
|
+
const targetNames = targets.map((t) => t.target);
|
|
40
|
+
const directMergePattern = (0, merge_pattern_1.findDirectMergeInFanOut)(targetNames, ctx);
|
|
41
|
+
if (directMergePattern) {
|
|
42
|
+
const { mergeNode, nonMergeTargets } = directMergePattern;
|
|
43
|
+
if (ctx.isBranchContext) {
|
|
44
|
+
ctx.visited.add(mergeNode.name);
|
|
45
|
+
ctx.variables.set(mergeNode.name, mergeNode);
|
|
46
|
+
const builtBranches = [];
|
|
47
|
+
for (const targetName of nonMergeTargets) {
|
|
48
|
+
if (ctx.visited.has(targetName)) {
|
|
49
|
+
const targetNode = ctx.graph.nodes.get(targetName);
|
|
50
|
+
if (targetNode) {
|
|
51
|
+
ctx.variables.set(targetName, targetNode);
|
|
52
|
+
builtBranches.push((0, build_utils_1.createVarRef)(targetName));
|
|
53
|
+
}
|
|
54
|
+
}
|
|
55
|
+
else {
|
|
56
|
+
builtBranches.push(buildFromNode(targetName, ctx));
|
|
57
|
+
}
|
|
58
|
+
}
|
|
59
|
+
if (targetNames.includes(mergeNode.name) && sourceNodeName) {
|
|
60
|
+
const directTarget = targets.find((t) => t.target === mergeNode.name);
|
|
61
|
+
let inputIndex = 0;
|
|
62
|
+
if (directTarget?.targetInputSlot) {
|
|
63
|
+
inputIndex = (0, build_utils_1.extractInputIndex)(directTarget.targetInputSlot);
|
|
64
|
+
}
|
|
65
|
+
else {
|
|
66
|
+
inputIndex = (0, merge_pattern_1.findMergeInputIndex)(mergeNode, sourceNodeName);
|
|
67
|
+
}
|
|
68
|
+
ctx.deferredConnections.push({
|
|
69
|
+
targetNode: mergeNode,
|
|
70
|
+
targetInputIndex: inputIndex,
|
|
71
|
+
sourceNodeName,
|
|
72
|
+
sourceOutputIndex: sourceOutputIndex ?? 0,
|
|
73
|
+
});
|
|
74
|
+
ctx.deferredMergeNodes.add(mergeNode.name);
|
|
75
|
+
}
|
|
76
|
+
if (builtBranches.length === 0)
|
|
77
|
+
return null;
|
|
78
|
+
if (builtBranches.length === 1)
|
|
79
|
+
return builtBranches[0];
|
|
80
|
+
return builtBranches;
|
|
81
|
+
}
|
|
82
|
+
ctx.visited.add(mergeNode.name);
|
|
83
|
+
ctx.variables.set(mergeNode.name, mergeNode);
|
|
84
|
+
ctx.deferredMergeNodes.add(mergeNode.name);
|
|
85
|
+
for (const [inputSlot, sources] of mergeNode.inputSources) {
|
|
86
|
+
const inputIndex = (0, build_utils_1.extractInputIndex)(inputSlot);
|
|
87
|
+
for (const source of sources) {
|
|
88
|
+
const sourceNode = ctx.graph.nodes.get(source.from);
|
|
89
|
+
if (sourceNode) {
|
|
90
|
+
ctx.variables.set(source.from, sourceNode);
|
|
91
|
+
}
|
|
92
|
+
ctx.deferredConnections.push({
|
|
93
|
+
sourceNodeName: source.from,
|
|
94
|
+
sourceOutputIndex: (0, build_utils_1.getOutputIndex)(source.outputSlot),
|
|
95
|
+
targetNode: mergeNode,
|
|
96
|
+
targetInputIndex: inputIndex,
|
|
97
|
+
});
|
|
98
|
+
}
|
|
99
|
+
}
|
|
100
|
+
const builtBranches = [];
|
|
101
|
+
for (const targetName of nonMergeTargets) {
|
|
102
|
+
if (!ctx.visited.has(targetName)) {
|
|
103
|
+
builtBranches.push(buildFromNode(targetName, ctx));
|
|
104
|
+
}
|
|
105
|
+
}
|
|
106
|
+
if (builtBranches.length === 0)
|
|
107
|
+
return (0, build_utils_1.createVarRef)(mergeNode.name);
|
|
108
|
+
if (builtBranches.length === 1)
|
|
109
|
+
return builtBranches[0];
|
|
110
|
+
return builtBranches;
|
|
111
|
+
}
|
|
112
|
+
if (ctx.isBranchContext && sourceNodeName) {
|
|
113
|
+
for (const targetConn of targets) {
|
|
114
|
+
const target = targetConn.target;
|
|
115
|
+
const targetNode = ctx.graph.nodes.get(target);
|
|
116
|
+
if (targetNode && (0, build_utils_1.isMergeType)(targetNode.type)) {
|
|
117
|
+
ctx.visited.add(target);
|
|
118
|
+
ctx.variables.set(target, targetNode);
|
|
119
|
+
let inputIndex = 0;
|
|
120
|
+
if (targetConn.targetInputSlot) {
|
|
121
|
+
inputIndex = (0, build_utils_1.extractInputIndex)(targetConn.targetInputSlot);
|
|
122
|
+
}
|
|
123
|
+
else {
|
|
124
|
+
inputIndex = (0, merge_pattern_1.findMergeInputIndex)(targetNode, sourceNodeName);
|
|
125
|
+
}
|
|
126
|
+
ctx.deferredConnections.push({
|
|
127
|
+
targetNode,
|
|
128
|
+
targetInputIndex: inputIndex,
|
|
129
|
+
sourceNodeName,
|
|
130
|
+
sourceOutputIndex: sourceOutputIndex ?? 0,
|
|
131
|
+
});
|
|
132
|
+
ctx.deferredMergeNodes.add(target);
|
|
133
|
+
}
|
|
134
|
+
}
|
|
135
|
+
}
|
|
136
|
+
const branches = [];
|
|
137
|
+
for (const targetConn of targets) {
|
|
138
|
+
const target = targetConn.target;
|
|
139
|
+
const targetNode = ctx.graph.nodes.get(target);
|
|
140
|
+
if (ctx.isBranchContext && sourceNodeName && targetNode && (0, build_utils_1.isMergeType)(targetNode.type)) {
|
|
141
|
+
continue;
|
|
142
|
+
}
|
|
143
|
+
if (ctx.visited.has(target)) {
|
|
144
|
+
if (targetNode) {
|
|
145
|
+
ctx.variables.set(target, targetNode);
|
|
146
|
+
branches.push((0, build_utils_1.createVarRef)(target));
|
|
147
|
+
}
|
|
148
|
+
}
|
|
149
|
+
else {
|
|
150
|
+
branches.push(buildFromNode(target, ctx));
|
|
151
|
+
}
|
|
152
|
+
}
|
|
153
|
+
if (branches.length === 0)
|
|
154
|
+
return null;
|
|
155
|
+
if (branches.length === 1)
|
|
156
|
+
return branches[0];
|
|
157
|
+
return branches;
|
|
158
|
+
}
|
|
159
|
+
function buildIfElse(node, ctx) {
|
|
160
|
+
const trueBranchTargets = node.outputs.get('trueBranch') ?? [];
|
|
161
|
+
const falseBranchTargets = node.outputs.get('falseBranch') ?? [];
|
|
162
|
+
const branchCtx = {
|
|
163
|
+
...ctx,
|
|
164
|
+
isBranchContext: true,
|
|
165
|
+
};
|
|
166
|
+
const trueBranch = buildBranchTargets(trueBranchTargets, branchCtx, node.name, 0);
|
|
167
|
+
const falseBranch = buildBranchTargets(falseBranchTargets, branchCtx, node.name, 1);
|
|
168
|
+
return {
|
|
169
|
+
kind: 'ifElse',
|
|
170
|
+
ifNode: node,
|
|
171
|
+
trueBranch,
|
|
172
|
+
falseBranch,
|
|
173
|
+
};
|
|
174
|
+
}
|
|
175
|
+
function buildSwitchCase(node, ctx) {
|
|
176
|
+
const cases = [];
|
|
177
|
+
const caseIndices = [];
|
|
178
|
+
const branchCtx = {
|
|
179
|
+
...ctx,
|
|
180
|
+
isBranchContext: true,
|
|
181
|
+
};
|
|
182
|
+
for (const [outputName, connections] of node.outputs) {
|
|
183
|
+
let outputIndex = 0;
|
|
184
|
+
const caseMatch = outputName.match(/^case(\d+)$/);
|
|
185
|
+
if (caseMatch) {
|
|
186
|
+
const caseIndex = parseInt(caseMatch[1], 10);
|
|
187
|
+
caseIndices.push(caseIndex);
|
|
188
|
+
outputIndex = caseIndex;
|
|
189
|
+
}
|
|
190
|
+
else if (outputName === 'fallback') {
|
|
191
|
+
const fallbackIndex = caseIndices.length > 0 ? Math.max(...caseIndices) + 1 : 0;
|
|
192
|
+
caseIndices.push(fallbackIndex);
|
|
193
|
+
outputIndex = fallbackIndex;
|
|
194
|
+
}
|
|
195
|
+
else {
|
|
196
|
+
const outputMatch = outputName.match(/(\d+)$/);
|
|
197
|
+
if (outputMatch) {
|
|
198
|
+
const idx = parseInt(outputMatch[1], 10);
|
|
199
|
+
caseIndices.push(idx);
|
|
200
|
+
outputIndex = idx;
|
|
201
|
+
}
|
|
202
|
+
else {
|
|
203
|
+
caseIndices.push(cases.length);
|
|
204
|
+
outputIndex = cases.length;
|
|
205
|
+
}
|
|
206
|
+
}
|
|
207
|
+
cases.push(buildBranchTargets(connections, branchCtx, node.name, outputIndex));
|
|
208
|
+
}
|
|
209
|
+
return {
|
|
210
|
+
kind: 'switchCase',
|
|
211
|
+
switchNode: node,
|
|
212
|
+
cases,
|
|
213
|
+
caseIndices,
|
|
214
|
+
};
|
|
215
|
+
}
|
|
216
|
+
function buildMerge(node, ctx) {
|
|
217
|
+
ctx.variables.set(node.name, node);
|
|
218
|
+
ctx.deferredMergeNodes.add(node.name);
|
|
219
|
+
for (const [inputSlot, sources] of node.inputSources) {
|
|
220
|
+
const inputIndex = (0, build_utils_1.extractInputIndex)(inputSlot);
|
|
221
|
+
for (const source of sources) {
|
|
222
|
+
const sourceNode = ctx.graph.nodes.get(source.from);
|
|
223
|
+
if (sourceNode) {
|
|
224
|
+
ctx.variables.set(source.from, sourceNode);
|
|
225
|
+
}
|
|
226
|
+
ctx.deferredConnections.push({
|
|
227
|
+
sourceNodeName: source.from,
|
|
228
|
+
sourceOutputIndex: (0, build_utils_1.getOutputIndex)(source.outputSlot),
|
|
229
|
+
targetNode: node,
|
|
230
|
+
targetInputIndex: inputIndex,
|
|
231
|
+
});
|
|
232
|
+
}
|
|
233
|
+
}
|
|
234
|
+
return (0, build_utils_1.createVarRef)(node.name);
|
|
235
|
+
}
|
|
236
|
+
function buildSplitInBatches(node, ctx) {
|
|
237
|
+
const sibMergePattern = (0, sib_merge_handler_1.detectSibMergePattern)(node, ctx);
|
|
238
|
+
if (sibMergePattern) {
|
|
239
|
+
return (0, sib_merge_handler_1.buildSibMergeExplicitConnections)(sibMergePattern, ctx);
|
|
240
|
+
}
|
|
241
|
+
const doneTargets = node.outputs.get('done') ?? [];
|
|
242
|
+
const loopTargets = node.outputs.get('loop') ?? [];
|
|
243
|
+
const branchCtx = {
|
|
244
|
+
...ctx,
|
|
245
|
+
isBranchContext: true,
|
|
246
|
+
};
|
|
247
|
+
const doneChain = buildBranchTargets(doneTargets, branchCtx, node.name, 0);
|
|
248
|
+
const loopChain = buildBranchTargets(loopTargets, branchCtx, node.name, 1);
|
|
249
|
+
return {
|
|
250
|
+
kind: 'splitInBatches',
|
|
251
|
+
sibNode: node,
|
|
252
|
+
doneChain,
|
|
253
|
+
loopChain,
|
|
254
|
+
};
|
|
255
|
+
}
|
|
256
|
+
function buildFromNode(nodeName, ctx) {
|
|
257
|
+
const node = ctx.graph.nodes.get(nodeName);
|
|
258
|
+
if (!node) {
|
|
259
|
+
return (0, build_utils_1.createVarRef)(nodeName);
|
|
260
|
+
}
|
|
261
|
+
if (ctx.visited.has(nodeName)) {
|
|
262
|
+
ctx.variables.set(nodeName, node);
|
|
263
|
+
return (0, build_utils_1.createVarRef)(nodeName);
|
|
264
|
+
}
|
|
265
|
+
if ((0, build_utils_1.shouldBeVariable)(node)) {
|
|
266
|
+
ctx.variables.set(nodeName, node);
|
|
267
|
+
}
|
|
268
|
+
ctx.visited.add(nodeName);
|
|
269
|
+
const compositeType = (0, semantic_registry_1.getCompositeType)(node.type);
|
|
270
|
+
let compositeNode;
|
|
271
|
+
switch (compositeType) {
|
|
272
|
+
case 'ifElse':
|
|
273
|
+
compositeNode = buildIfElse(node, ctx);
|
|
274
|
+
break;
|
|
275
|
+
case 'switchCase':
|
|
276
|
+
compositeNode = buildSwitchCase(node, ctx);
|
|
277
|
+
break;
|
|
278
|
+
case 'merge':
|
|
279
|
+
compositeNode = buildMerge(node, ctx);
|
|
280
|
+
break;
|
|
281
|
+
case 'splitInBatches':
|
|
282
|
+
compositeNode = buildSplitInBatches(node, ctx);
|
|
283
|
+
break;
|
|
284
|
+
default: {
|
|
285
|
+
let errorHandler;
|
|
286
|
+
if ((0, build_utils_1.hasErrorOutput)(node)) {
|
|
287
|
+
const errorTargets = (0, build_utils_1.getErrorOutputTargets)(node);
|
|
288
|
+
if (errorTargets.length > 0) {
|
|
289
|
+
const firstErrorTarget = errorTargets[0];
|
|
290
|
+
if (ctx.visited.has(firstErrorTarget)) {
|
|
291
|
+
const errorNode = ctx.graph.nodes.get(firstErrorTarget);
|
|
292
|
+
if (errorNode) {
|
|
293
|
+
ctx.variables.set(firstErrorTarget, errorNode);
|
|
294
|
+
errorHandler = (0, build_utils_1.createVarRef)(firstErrorTarget);
|
|
295
|
+
}
|
|
296
|
+
}
|
|
297
|
+
else {
|
|
298
|
+
errorHandler = buildFromNode(firstErrorTarget, ctx);
|
|
299
|
+
}
|
|
300
|
+
}
|
|
301
|
+
}
|
|
302
|
+
compositeNode = (0, build_utils_1.createLeaf)(node, errorHandler);
|
|
303
|
+
}
|
|
304
|
+
}
|
|
305
|
+
if (compositeType === 'merge') {
|
|
306
|
+
const mergeOutputs = (0, build_utils_1.getAllFirstOutputTargets)(node);
|
|
307
|
+
const unvisitedOutputs = mergeOutputs.filter((target) => !ctx.visited.has(target));
|
|
308
|
+
if (unvisitedOutputs.length === 1) {
|
|
309
|
+
const nextComposite = buildFromNode(unvisitedOutputs[0], ctx);
|
|
310
|
+
return {
|
|
311
|
+
kind: 'chain',
|
|
312
|
+
nodes: [compositeNode, nextComposite],
|
|
313
|
+
};
|
|
314
|
+
}
|
|
315
|
+
if (unvisitedOutputs.length > 1) {
|
|
316
|
+
const fanOutBranches = [];
|
|
317
|
+
for (const target of unvisitedOutputs) {
|
|
318
|
+
fanOutBranches.push(buildFromNode(target, ctx));
|
|
319
|
+
}
|
|
320
|
+
if (fanOutBranches.length === 1) {
|
|
321
|
+
return {
|
|
322
|
+
kind: 'chain',
|
|
323
|
+
nodes: [compositeNode, fanOutBranches[0]],
|
|
324
|
+
};
|
|
325
|
+
}
|
|
326
|
+
const fanOut = {
|
|
327
|
+
kind: 'fanOut',
|
|
328
|
+
sourceNode: compositeNode,
|
|
329
|
+
targets: fanOutBranches,
|
|
330
|
+
};
|
|
331
|
+
return fanOut;
|
|
332
|
+
}
|
|
333
|
+
const visitedOutputs = mergeOutputs.filter((target) => ctx.visited.has(target));
|
|
334
|
+
if (visitedOutputs.length > 0) {
|
|
335
|
+
const loopTargets = [];
|
|
336
|
+
for (const target of visitedOutputs) {
|
|
337
|
+
const targetNode = ctx.graph.nodes.get(target);
|
|
338
|
+
if (targetNode) {
|
|
339
|
+
ctx.variables.set(target, targetNode);
|
|
340
|
+
loopTargets.push((0, build_utils_1.createVarRef)(target));
|
|
341
|
+
}
|
|
342
|
+
}
|
|
343
|
+
if (loopTargets.length === 1) {
|
|
344
|
+
return {
|
|
345
|
+
kind: 'chain',
|
|
346
|
+
nodes: [compositeNode, loopTargets[0]],
|
|
347
|
+
};
|
|
348
|
+
}
|
|
349
|
+
if (loopTargets.length > 1) {
|
|
350
|
+
return {
|
|
351
|
+
kind: 'chain',
|
|
352
|
+
nodes: [compositeNode, ...loopTargets],
|
|
353
|
+
};
|
|
354
|
+
}
|
|
355
|
+
}
|
|
356
|
+
return compositeNode;
|
|
357
|
+
}
|
|
358
|
+
if (compositeType === undefined) {
|
|
359
|
+
if ((0, output_utils_1.hasMultipleOutputSlots)(node) && (0, output_utils_1.hasConsecutiveOutputSlots)(node)) {
|
|
360
|
+
const targetsByIndex = (0, output_utils_1.getOutputTargetsByIndex)(node);
|
|
361
|
+
const outputTargets = new Map();
|
|
362
|
+
for (const [outputIndex, targets] of targetsByIndex) {
|
|
363
|
+
if (targets.length === 1) {
|
|
364
|
+
const targetInfo = targets[0];
|
|
365
|
+
const targetNode = ctx.graph.nodes.get(targetInfo.targetName);
|
|
366
|
+
if (targetNode) {
|
|
367
|
+
const targetInputIndex = (0, build_utils_1.extractInputIndex)(targetInfo.targetInputSlot);
|
|
368
|
+
if (targetInputIndex > 0) {
|
|
369
|
+
ctx.variables.set(node.name, node);
|
|
370
|
+
ctx.variables.set(targetInfo.targetName, targetNode);
|
|
371
|
+
ctx.deferredConnections.push({
|
|
372
|
+
targetNode,
|
|
373
|
+
targetInputIndex,
|
|
374
|
+
sourceNodeName: node.name,
|
|
375
|
+
sourceOutputIndex: outputIndex,
|
|
376
|
+
});
|
|
377
|
+
}
|
|
378
|
+
else if (ctx.visited.has(targetInfo.targetName)) {
|
|
379
|
+
ctx.variables.set(targetInfo.targetName, targetNode);
|
|
380
|
+
outputTargets.set(outputIndex, (0, build_utils_1.createVarRef)(targetInfo.targetName));
|
|
381
|
+
}
|
|
382
|
+
else {
|
|
383
|
+
outputTargets.set(outputIndex, buildFromNode(targetInfo.targetName, ctx));
|
|
384
|
+
}
|
|
385
|
+
}
|
|
386
|
+
}
|
|
387
|
+
else if (targets.length > 1) {
|
|
388
|
+
const fanOutBranches = [];
|
|
389
|
+
for (const targetInfo of targets) {
|
|
390
|
+
const targetNode = ctx.graph.nodes.get(targetInfo.targetName);
|
|
391
|
+
if (targetNode) {
|
|
392
|
+
const targetInputIndex = (0, build_utils_1.extractInputIndex)(targetInfo.targetInputSlot);
|
|
393
|
+
if (targetInputIndex > 0) {
|
|
394
|
+
ctx.variables.set(node.name, node);
|
|
395
|
+
ctx.variables.set(targetInfo.targetName, targetNode);
|
|
396
|
+
ctx.deferredConnections.push({
|
|
397
|
+
targetNode,
|
|
398
|
+
targetInputIndex,
|
|
399
|
+
sourceNodeName: node.name,
|
|
400
|
+
sourceOutputIndex: outputIndex,
|
|
401
|
+
});
|
|
402
|
+
}
|
|
403
|
+
else if (ctx.visited.has(targetInfo.targetName)) {
|
|
404
|
+
ctx.variables.set(targetInfo.targetName, targetNode);
|
|
405
|
+
fanOutBranches.push((0, build_utils_1.createVarRef)(targetInfo.targetName));
|
|
406
|
+
}
|
|
407
|
+
else {
|
|
408
|
+
fanOutBranches.push(buildFromNode(targetInfo.targetName, ctx));
|
|
409
|
+
}
|
|
410
|
+
}
|
|
411
|
+
}
|
|
412
|
+
if (fanOutBranches.length > 0) {
|
|
413
|
+
const fanOut = {
|
|
414
|
+
kind: 'fanOut',
|
|
415
|
+
sourceNode: (0, build_utils_1.createLeaf)(node),
|
|
416
|
+
targets: fanOutBranches,
|
|
417
|
+
};
|
|
418
|
+
outputTargets.set(outputIndex, fanOut);
|
|
419
|
+
}
|
|
420
|
+
}
|
|
421
|
+
}
|
|
422
|
+
const hasDeferred = ctx.deferredConnections.some((c) => c.sourceNodeName === node.name);
|
|
423
|
+
if (outputTargets.size > 0 || hasDeferred) {
|
|
424
|
+
ctx.variables.set(node.name, node);
|
|
425
|
+
const multiOutput = {
|
|
426
|
+
kind: 'multiOutput',
|
|
427
|
+
sourceNode: node,
|
|
428
|
+
outputTargets,
|
|
429
|
+
};
|
|
430
|
+
return multiOutput;
|
|
431
|
+
}
|
|
432
|
+
}
|
|
433
|
+
const nextTargets = (0, output_utils_1.hasMultipleOutputSlots)(node)
|
|
434
|
+
? (0, output_utils_1.getAllOutputTargets)(node)
|
|
435
|
+
: (0, build_utils_1.getAllFirstOutputTargets)(node);
|
|
436
|
+
if (nextTargets.length > 1) {
|
|
437
|
+
const mergePattern = (0, merge_pattern_1.detectMergePattern)(nextTargets, ctx);
|
|
438
|
+
if (mergePattern) {
|
|
439
|
+
ctx.variables.set(mergePattern.mergeNode.name, mergePattern.mergeNode);
|
|
440
|
+
ctx.deferredMergeNodes.add(mergePattern.mergeNode.name);
|
|
441
|
+
ctx.visited.add(mergePattern.mergeNode.name);
|
|
442
|
+
for (const [inputSlot, sources] of mergePattern.mergeNode.inputSources) {
|
|
443
|
+
const inputIndex = (0, build_utils_1.extractInputIndex)(inputSlot);
|
|
444
|
+
for (const source of sources) {
|
|
445
|
+
const sourceNode = ctx.graph.nodes.get(source.from);
|
|
446
|
+
if (sourceNode) {
|
|
447
|
+
ctx.variables.set(source.from, sourceNode);
|
|
448
|
+
}
|
|
449
|
+
ctx.deferredConnections.push({
|
|
450
|
+
sourceNodeName: source.from,
|
|
451
|
+
sourceOutputIndex: (0, build_utils_1.getOutputIndex)(source.outputSlot),
|
|
452
|
+
targetNode: mergePattern.mergeNode,
|
|
453
|
+
targetInputIndex: inputIndex,
|
|
454
|
+
});
|
|
455
|
+
}
|
|
456
|
+
}
|
|
457
|
+
const builtBranches = [];
|
|
458
|
+
for (const branchName of mergePattern.branches) {
|
|
459
|
+
if (!ctx.visited.has(branchName)) {
|
|
460
|
+
builtBranches.push(buildFromNode(branchName, ctx));
|
|
461
|
+
}
|
|
462
|
+
}
|
|
463
|
+
if (builtBranches.length > 0) {
|
|
464
|
+
if (builtBranches.length === 1) {
|
|
465
|
+
return {
|
|
466
|
+
kind: 'chain',
|
|
467
|
+
nodes: [compositeNode, builtBranches[0]],
|
|
468
|
+
};
|
|
469
|
+
}
|
|
470
|
+
const fanOut = {
|
|
471
|
+
kind: 'fanOut',
|
|
472
|
+
sourceNode: compositeNode,
|
|
473
|
+
targets: builtBranches,
|
|
474
|
+
};
|
|
475
|
+
return fanOut;
|
|
476
|
+
}
|
|
477
|
+
return compositeNode;
|
|
478
|
+
}
|
|
479
|
+
const directMergePattern = (0, merge_pattern_1.findDirectMergeInFanOut)(nextTargets, ctx);
|
|
480
|
+
if (directMergePattern) {
|
|
481
|
+
const { mergeNode, nonMergeTargets } = directMergePattern;
|
|
482
|
+
ctx.visited.add(mergeNode.name);
|
|
483
|
+
ctx.variables.set(mergeNode.name, mergeNode);
|
|
484
|
+
ctx.deferredMergeNodes.add(mergeNode.name);
|
|
485
|
+
for (const [inputSlot, sources] of mergeNode.inputSources) {
|
|
486
|
+
const inputIndex = (0, build_utils_1.extractInputIndex)(inputSlot);
|
|
487
|
+
for (const source of sources) {
|
|
488
|
+
const sourceNode = ctx.graph.nodes.get(source.from);
|
|
489
|
+
if (sourceNode) {
|
|
490
|
+
ctx.variables.set(source.from, sourceNode);
|
|
491
|
+
}
|
|
492
|
+
ctx.deferredConnections.push({
|
|
493
|
+
sourceNodeName: source.from,
|
|
494
|
+
sourceOutputIndex: (0, build_utils_1.getOutputIndex)(source.outputSlot),
|
|
495
|
+
targetNode: mergeNode,
|
|
496
|
+
targetInputIndex: inputIndex,
|
|
497
|
+
});
|
|
498
|
+
}
|
|
499
|
+
}
|
|
500
|
+
const builtBranches = [];
|
|
501
|
+
for (const targetName of nonMergeTargets) {
|
|
502
|
+
if (!ctx.visited.has(targetName)) {
|
|
503
|
+
builtBranches.push(buildFromNode(targetName, ctx));
|
|
504
|
+
}
|
|
505
|
+
}
|
|
506
|
+
if (builtBranches.length === 0) {
|
|
507
|
+
return {
|
|
508
|
+
kind: 'chain',
|
|
509
|
+
nodes: [compositeNode, (0, build_utils_1.createVarRef)(mergeNode.name)],
|
|
510
|
+
};
|
|
511
|
+
}
|
|
512
|
+
if (builtBranches.length === 1) {
|
|
513
|
+
return {
|
|
514
|
+
kind: 'chain',
|
|
515
|
+
nodes: [compositeNode, builtBranches[0]],
|
|
516
|
+
};
|
|
517
|
+
}
|
|
518
|
+
const fanOut = {
|
|
519
|
+
kind: 'fanOut',
|
|
520
|
+
sourceNode: compositeNode,
|
|
521
|
+
targets: builtBranches,
|
|
522
|
+
};
|
|
523
|
+
return fanOut;
|
|
524
|
+
}
|
|
525
|
+
const outputConnections = [];
|
|
526
|
+
for (const [outputSlot, connections] of node.outputs) {
|
|
527
|
+
if (outputSlot === 'error')
|
|
528
|
+
continue;
|
|
529
|
+
for (const conn of connections) {
|
|
530
|
+
outputConnections.push({
|
|
531
|
+
target: conn.target,
|
|
532
|
+
targetInputSlot: conn.targetInputSlot,
|
|
533
|
+
outputSlot,
|
|
534
|
+
});
|
|
535
|
+
}
|
|
536
|
+
}
|
|
537
|
+
const handledMerges = new Set();
|
|
538
|
+
const nonMergeTargets = [];
|
|
539
|
+
for (const conn of outputConnections) {
|
|
540
|
+
const targetNode = ctx.graph.nodes.get(conn.target);
|
|
541
|
+
if (!targetNode)
|
|
542
|
+
continue;
|
|
543
|
+
if ((0, build_utils_1.isMergeType)(targetNode.type)) {
|
|
544
|
+
if (!handledMerges.has(conn.target)) {
|
|
545
|
+
ctx.visited.add(conn.target);
|
|
546
|
+
ctx.variables.set(conn.target, targetNode);
|
|
547
|
+
ctx.deferredMergeNodes.add(conn.target);
|
|
548
|
+
handledMerges.add(conn.target);
|
|
549
|
+
}
|
|
550
|
+
const inputIndex = (0, build_utils_1.extractInputIndex)(conn.targetInputSlot);
|
|
551
|
+
const sourceOutputIndex = (0, build_utils_1.getOutputIndex)(conn.outputSlot);
|
|
552
|
+
ctx.deferredConnections.push({
|
|
553
|
+
sourceNodeName: node.name,
|
|
554
|
+
sourceOutputIndex,
|
|
555
|
+
targetNode,
|
|
556
|
+
targetInputIndex: inputIndex,
|
|
557
|
+
});
|
|
558
|
+
}
|
|
559
|
+
else if (!nonMergeTargets.includes(conn.target)) {
|
|
560
|
+
nonMergeTargets.push(conn.target);
|
|
561
|
+
}
|
|
562
|
+
}
|
|
563
|
+
const fanOutBranches = [];
|
|
564
|
+
for (const targetName of nonMergeTargets) {
|
|
565
|
+
const targetNode = ctx.graph.nodes.get(targetName);
|
|
566
|
+
if (targetNode) {
|
|
567
|
+
if (ctx.visited.has(targetName)) {
|
|
568
|
+
ctx.variables.set(targetName, targetNode);
|
|
569
|
+
fanOutBranches.push((0, build_utils_1.createVarRef)(targetName));
|
|
570
|
+
}
|
|
571
|
+
else {
|
|
572
|
+
const branchComposite = buildFromNode(targetName, ctx);
|
|
573
|
+
fanOutBranches.push(branchComposite);
|
|
574
|
+
}
|
|
575
|
+
}
|
|
576
|
+
}
|
|
577
|
+
if (fanOutBranches.length > 0) {
|
|
578
|
+
if (fanOutBranches.length === 1) {
|
|
579
|
+
const firstBranch = fanOutBranches[0];
|
|
580
|
+
if (firstBranch.kind === 'chain') {
|
|
581
|
+
return {
|
|
582
|
+
kind: 'chain',
|
|
583
|
+
nodes: [compositeNode, ...firstBranch.nodes],
|
|
584
|
+
};
|
|
585
|
+
}
|
|
586
|
+
return {
|
|
587
|
+
kind: 'chain',
|
|
588
|
+
nodes: [compositeNode, firstBranch],
|
|
589
|
+
};
|
|
590
|
+
}
|
|
591
|
+
const fanOut = {
|
|
592
|
+
kind: 'fanOut',
|
|
593
|
+
sourceNode: compositeNode,
|
|
594
|
+
targets: fanOutBranches,
|
|
595
|
+
};
|
|
596
|
+
return fanOut;
|
|
597
|
+
}
|
|
598
|
+
}
|
|
599
|
+
else if (nextTargets.length === 1) {
|
|
600
|
+
const nextTarget = nextTargets[0];
|
|
601
|
+
const nextNode = ctx.graph.nodes.get(nextTarget);
|
|
602
|
+
if (ctx.isBranchContext && nextNode && (0, build_utils_1.isMergeType)(nextNode.type)) {
|
|
603
|
+
ctx.visited.add(nextTarget);
|
|
604
|
+
ctx.variables.set(nextTarget, nextNode);
|
|
605
|
+
const inputIndex = (0, merge_pattern_1.findMergeInputIndex)(nextNode, node.name);
|
|
606
|
+
ctx.deferredConnections.push({
|
|
607
|
+
targetNode: nextNode,
|
|
608
|
+
targetInputIndex: inputIndex,
|
|
609
|
+
sourceNodeName: node.name,
|
|
610
|
+
sourceOutputIndex: 0,
|
|
611
|
+
});
|
|
612
|
+
ctx.deferredMergeNodes.add(nextTarget);
|
|
613
|
+
return compositeNode;
|
|
614
|
+
}
|
|
615
|
+
if (nextNode && (0, build_utils_1.isMergeType)(nextNode.type) && ctx.deferredMergeNodes.has(nextTarget)) {
|
|
616
|
+
const alreadyHasConnection = ctx.deferredConnections.some((c) => c.sourceNodeName === node.name && c.targetNode.name === nextTarget);
|
|
617
|
+
if (!alreadyHasConnection) {
|
|
618
|
+
const inputIndex = (0, merge_pattern_1.findMergeInputIndex)(nextNode, node.name);
|
|
619
|
+
ctx.deferredConnections.push({
|
|
620
|
+
targetNode: nextNode,
|
|
621
|
+
targetInputIndex: inputIndex,
|
|
622
|
+
sourceNodeName: node.name,
|
|
623
|
+
sourceOutputIndex: 0,
|
|
624
|
+
});
|
|
625
|
+
}
|
|
626
|
+
return compositeNode;
|
|
627
|
+
}
|
|
628
|
+
const nextComposite = buildFromNode(nextTarget, ctx);
|
|
629
|
+
if (nextComposite.kind === 'chain') {
|
|
630
|
+
return {
|
|
631
|
+
kind: 'chain',
|
|
632
|
+
nodes: [compositeNode, ...nextComposite.nodes],
|
|
633
|
+
};
|
|
634
|
+
}
|
|
635
|
+
else {
|
|
636
|
+
return {
|
|
637
|
+
kind: 'chain',
|
|
638
|
+
nodes: [compositeNode, nextComposite],
|
|
639
|
+
};
|
|
640
|
+
}
|
|
641
|
+
}
|
|
642
|
+
}
|
|
643
|
+
else {
|
|
644
|
+
const outputConnections = node.outputs.get('output') ?? node.outputs.get('output0') ?? [];
|
|
645
|
+
if (outputConnections.length > 0 && compositeType !== 'splitInBatches') {
|
|
646
|
+
const nextTarget = outputConnections[0].target;
|
|
647
|
+
const nextComposite = buildFromNode(nextTarget, ctx);
|
|
648
|
+
return {
|
|
649
|
+
kind: 'chain',
|
|
650
|
+
nodes: [compositeNode, nextComposite],
|
|
651
|
+
};
|
|
652
|
+
}
|
|
653
|
+
}
|
|
654
|
+
return compositeNode;
|
|
655
|
+
}
|
|
656
|
+
function buildCompositeTree(graph) {
|
|
657
|
+
const ctx = {
|
|
658
|
+
graph,
|
|
659
|
+
visited: new Set(),
|
|
660
|
+
variables: new Map(),
|
|
661
|
+
isBranchContext: false,
|
|
662
|
+
deferredConnections: [],
|
|
663
|
+
deferredMergeDownstreams: [],
|
|
664
|
+
deferredMergeNodes: new Set(),
|
|
665
|
+
};
|
|
666
|
+
const roots = [];
|
|
667
|
+
for (const rootName of graph.roots) {
|
|
668
|
+
const composite = buildFromNode(rootName, ctx);
|
|
669
|
+
roots.push(composite);
|
|
670
|
+
}
|
|
671
|
+
for (const mergeNodeName of ctx.deferredMergeNodes) {
|
|
672
|
+
const mergeNode = graph.nodes.get(mergeNodeName);
|
|
673
|
+
if (!mergeNode)
|
|
674
|
+
continue;
|
|
675
|
+
const mergeOutputs = mergeNode.outputs.get('output') ?? [];
|
|
676
|
+
for (const output of mergeOutputs) {
|
|
677
|
+
const targetName = output.target;
|
|
678
|
+
const targetNode = graph.nodes.get(targetName);
|
|
679
|
+
if (!targetNode)
|
|
680
|
+
continue;
|
|
681
|
+
if (ctx.deferredMergeNodes.has(targetName) && (0, build_utils_1.isMergeType)(targetNode.type)) {
|
|
682
|
+
const inputIndex = (0, build_utils_1.extractInputIndex)(output.targetInputSlot);
|
|
683
|
+
ctx.deferredConnections.push({
|
|
684
|
+
targetNode,
|
|
685
|
+
targetInputIndex: inputIndex,
|
|
686
|
+
sourceNodeName: mergeNodeName,
|
|
687
|
+
sourceOutputIndex: 0,
|
|
688
|
+
});
|
|
689
|
+
continue;
|
|
690
|
+
}
|
|
691
|
+
if (!ctx.visited.has(targetName)) {
|
|
692
|
+
const downstreamCtx = {
|
|
693
|
+
...ctx,
|
|
694
|
+
isBranchContext: false,
|
|
695
|
+
};
|
|
696
|
+
const downstreamChain = buildFromNode(targetName, downstreamCtx);
|
|
697
|
+
ctx.deferredMergeDownstreams.push({
|
|
698
|
+
mergeNode,
|
|
699
|
+
downstreamChain,
|
|
700
|
+
});
|
|
701
|
+
}
|
|
702
|
+
else {
|
|
703
|
+
ctx.variables.set(targetName, targetNode);
|
|
704
|
+
ctx.deferredMergeDownstreams.push({
|
|
705
|
+
mergeNode,
|
|
706
|
+
downstreamChain: (0, build_utils_1.createVarRef)(targetName),
|
|
707
|
+
});
|
|
708
|
+
}
|
|
709
|
+
}
|
|
710
|
+
}
|
|
711
|
+
return {
|
|
712
|
+
roots,
|
|
713
|
+
variables: ctx.variables,
|
|
714
|
+
deferredConnections: ctx.deferredConnections,
|
|
715
|
+
deferredMergeDownstreams: ctx.deferredMergeDownstreams,
|
|
716
|
+
};
|
|
717
|
+
}
|
|
718
|
+
//# sourceMappingURL=composite-builder.js.map
|