cameleer/cameleer-server
1
0
Fork 0
Code Issues 41 Pull Requests Actions Packages Projects Releases Wiki Activity

fix: update diagram tests for new cameleer3-common without flat nodes list
All checks were successful
CI / cleanup-branch (push) Has been skipped
Details
CI / build (push) Successful in 1m3s
Details
CI / docker (push) Successful in 1m0s
Details
CI / deploy-feature (push) Has been skipped
Details
CI / deploy (push) Successful in 51s
Details

Browse Source 
RouteGraph no longer stores a separate nodes list; getNodes() computes
from root tree. Tests now build proper tree via setRoot() + setChildren()
instead of calling setNodes().

Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>
This commit is contained in:
hsiegeln
2026-03-29 19:41:04 +02:00
parent 7e968dc06b
commit b2ae37637d
1 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
cameleer3-server-app/src/test/java/com/cameleer3/server/app/diagram/ElkDiagramRendererTest.java
View File

@@ -39,7 +39,8 @@ class ElkDiagramRendererTest {
RouteNode process = new RouteNode("node-2", NodeType.BEAN, "myProcessor"); RouteNode process = new RouteNode("node-2", NodeType.BEAN, "myProcessor");
RouteNode to = new RouteNode("node-3", NodeType.TO, "log:output"); RouteNode to = new RouteNode("node-3", NodeType.TO, "log:output");
graph.setNodes(List.of(from, process, to)); from.setChildren(List.of(process, to));
graph.setRoot(from);
graph.setEdges(List.of( graph.setEdges(List.of(
new RouteEdge("node-1", "node-2", RouteEdge.EdgeType.FLOW), new RouteEdge("node-1", "node-2", RouteEdge.EdgeType.FLOW),
new RouteEdge("node-2", "node-3", RouteEdge.EdgeType.FLOW) new RouteEdge("node-2", "node-3", RouteEdge.EdgeType.FLOW)
@@ -62,10 +63,10 @@ class ElkDiagramRendererTest {
RouteNode otherwise = new RouteNode("node-4", NodeType.EIP_OTHERWISE, "otherwise"); RouteNode otherwise = new RouteNode("node-4", NodeType.EIP_OTHERWISE, "otherwise");
RouteNode to = new RouteNode("node-5", NodeType.TO, "log:result"); RouteNode to = new RouteNode("node-5", NodeType.TO, "log:result");
// Set children on the choice node // Build tree: from → [choice, to]; choice → [when, otherwise]
choice.setChildren(List.of(when, otherwise)); choice.setChildren(List.of(when, otherwise));
from.setChildren(List.of(choice, to));
graph.setNodes(List.of(from, choice, when, otherwise, to)); graph.setRoot(from);
graph.setEdges(List.of( graph.setEdges(List.of(
new RouteEdge("node-1", "node-2", RouteEdge.EdgeType.FLOW), new RouteEdge("node-1", "node-2", RouteEdge.EdgeType.FLOW),
new RouteEdge("node-2", "node-3", RouteEdge.EdgeType.FLOW), new RouteEdge("node-2", "node-3", RouteEdge.EdgeType.FLOW),
@@ -193,9 +194,8 @@ class ElkDiagramRendererTest {
doFinally.setChildren(List.of(cleanup)); doFinally.setChildren(List.of(cleanup));
doCatch.setChildren(List.of(errorLog)); doCatch.setChildren(List.of(errorLog));
doTry.setChildren(List.of(process, log1, doFinally, doCatch)); doTry.setChildren(List.of(process, log1, doFinally, doCatch));
from.setChildren(List.of(doTry, to));
graph.setRoot(from); graph.setRoot(from);
graph.setNodes(List.of(from, doTry, process, log1, doFinally, cleanup, doCatch, errorLog, to));
graph.setEdges(List.of( graph.setEdges(List.of(
new RouteEdge("node-1", "node-2", RouteEdge.EdgeType.FLOW), new RouteEdge("node-1", "node-2", RouteEdge.EdgeType.FLOW),
new RouteEdge("node-2", "node-3", RouteEdge.EdgeType.FLOW), new RouteEdge("node-2", "node-3", RouteEdge.EdgeType.FLOW),