aae34cf1e5
* Change to use deterministic artifact graph * Update output to use the new order * Fix to clear everything when scene is cleared * Fix lots * Update artifact graph output for the last time * Delete unused sorting code * Remove unneeded cfg * Fix to preserve top-level artifacts when there's an error * Update output after error fix * Add better doc comments * Remove duplicate global operations * Update comments * Update ignored tests that were flaky * Update graph for new samples after rebase * Fix test assertion message
1.8 KiB
1.8 KiB
flowchart LR
subgraph path2 [Path]
2["Path<br>[35, 60, 0]"]
%% [ProgramBodyItem { index: 0 }, VariableDeclarationDeclaration, VariableDeclarationInit, PipeBodyItem { index: 1 }]
3["Segment<br>[66, 85, 0]"]
%% [ProgramBodyItem { index: 0 }, VariableDeclarationDeclaration, VariableDeclarationInit, PipeBodyItem { index: 2 }]
4["Segment<br>[91, 128, 0]"]
%% [ProgramBodyItem { index: 0 }, VariableDeclarationDeclaration, VariableDeclarationInit, PipeBodyItem { index: 3 }]
5["Segment<br>[134, 154, 0]"]
%% [ProgramBodyItem { index: 0 }, VariableDeclarationDeclaration, VariableDeclarationInit, PipeBodyItem { index: 4 }]
end
1["Plane<br>[12, 29, 0]"]
%% [ProgramBodyItem { index: 0 }, VariableDeclarationDeclaration, VariableDeclarationInit, PipeBodyItem { index: 0 }]
6["Sweep Extrusion<br>[160, 180, 0]"]
%% [ProgramBodyItem { index: 0 }, VariableDeclarationDeclaration, VariableDeclarationInit, PipeBodyItem { index: 5 }]
7[Wall]
%% face_code_ref=Missing NodePath
8[Wall]
%% face_code_ref=Missing NodePath
9[Wall]
%% face_code_ref=Missing NodePath
10["Cap Start"]
%% face_code_ref=Missing NodePath
11["Cap End"]
%% face_code_ref=Missing NodePath
12["SweepEdge Opposite"]
13["SweepEdge Adjacent"]
14["SweepEdge Opposite"]
15["SweepEdge Adjacent"]
16["SweepEdge Opposite"]
17["SweepEdge Adjacent"]
1 --- 2
2 --- 3
2 --- 4
2 --- 5
2 ---- 6
3 --- 7
3 x--> 10
3 --- 12
3 --- 13
4 --- 8
4 x--> 10
4 --- 14
4 --- 15
5 --- 9
5 x--> 10
5 --- 16
5 --- 17
6 --- 7
6 --- 8
6 --- 9
6 --- 10
6 --- 11
6 --- 12
6 --- 13
6 --- 14
6 --- 15
6 --- 16
6 --- 17
7 --- 12
7 --- 13
17 <--x 7
13 <--x 8
8 --- 14
8 --- 15
15 <--x 9
9 --- 16
9 --- 17
12 <--x 11
14 <--x 11
16 <--x 11