Use parallelSort for links

tkrodriguez · tkrodriguez · commit 6f52a8f6de50 · 2025-11-03T22:25:13.000-08:00
diff --git a/visualizer/IdealGraphVisualizer/HierarchicalLayout/src/main/java/org/graalvm/visualizer/hierarchicallayout/HierarchicalLayoutManager.java b/visualizer/IdealGraphVisualizer/HierarchicalLayout/src/main/java/org/graalvm/visualizer/hierarchicallayout/HierarchicalLayoutManager.java
@@ -2914,12 +2914,12 @@ protected void run() {
             }
 
             // Set up edges
-            List<? extends Link> links = new ArrayList<>(graph.getLinks());
+            Link[] links = graph.getLinks().toArray(new Link[0]);
             final boolean VIP = !noVip;
             if (VIP) {
-                Collections.sort(links, LINK_COMPARATOR);
+                Arrays.parallelSort(links, LINK_COMPARATOR);
             } else {
-                Collections.sort(links, LINK_NOVIP_COMPARATOR);
+                Arrays.parallelSort(links, LINK_NOVIP_COMPARATOR);
             }
 
             for (Link l : links) {

Original file line number	Diff line number	Diff line change
`@@ -2914,12 +2914,12 @@ protected void run() {`
`2914`	`2914`	`}`
`2915`	`2915`
`2916`	`2916`	`// Set up edges`
`2917`		`- List<? extends Link> links = new ArrayList<>(graph.getLinks());`
	`2917`	`+ Link[] links = graph.getLinks().toArray(new Link[0]);`
`2918`	`2918`	`final boolean VIP = !noVip;`
`2919`	`2919`	`if (VIP) {`
`2920`		`- Collections.sort(links, LINK_COMPARATOR);`
	`2920`	`+ Arrays.parallelSort(links, LINK_COMPARATOR);`
`2921`	`2921`	`} else {`
`2922`		`- Collections.sort(links, LINK_NOVIP_COMPARATOR);`
	`2922`	`+ Arrays.parallelSort(links, LINK_NOVIP_COMPARATOR);`
`2923`	`2923`	`}`
`2924`	`2924`
`2925`	`2925`	`for (Link l : links) {`