Better pre-sizing for visited set

Author: xxDark

recaf-core/src/main/java/software/coley/recaf/services/inheritance/ClassPathNodeProvider.java

@@ -14,7 +14,7 @@ sealed interface ClassPathNodeProvider {
 	@Nullable
 	ClassPathNode getNode(@Nonnull String name);
 
-	static ClassPathNodeProvider cache(Workspace workspace) {
+	static ClassPathNodeProvider.Cached cache(Workspace workspace) {
 		Stream<ClassPathNode> stream = workspace.classesStream();
 		Map<String, ClassPathNode> nodes = new HashMap<>(4096);
 		stream.forEach(classPathNode -> {
@@ -32,6 +32,10 @@ public ClassPathNode getNode(@Nonnull String name) {
 	}
 
 	record Cached(Map<String, ClassPathNode> nodes) implements ClassPathNodeProvider {
+		int size() {
+			return nodes.size();
+		}
+
 		@Nullable
 		@Override
 		public ClassPathNode getNode(@Nonnull String name) {

recaf-core/src/main/java/software/coley/recaf/services/inheritance/InheritanceGraph.java

@@ -113,8 +113,8 @@ private void refreshChildLookup() {
 		parentToChild.clear();
 
 		// Repopulate
-		Set<ClassInfo> visited = Collections.newSetFromMap(new IdentityHashMap<>(16384));
-		ClassPathNodeProvider nodeProvider = ClassPathNodeProvider.cache(workspace);
+		ClassPathNodeProvider.Cached nodeProvider = ClassPathNodeProvider.cache(workspace);
+		Set<ClassInfo> visited = Collections.newSetFromMap(new IdentityHashMap<>(nodeProvider.size() + 1024 /* leeway */));
 		workspace.forEachClass(false, cls -> {
 			populateParentToChildLookup(cls, visited, nodeProvider);
 		});