classesToRemove = new HashSet<>();\n for (String classFqn : classReferencesGraph.vertexSet()) {\n if (!packagesInCodebase.contains(getPackage(classFqn))) {\n classesToRemove.add(classFqn);\n }\n }\n\n classReferencesGraph.removeAllVertices(classesToRemove);\n }\n\n String getPackage(String fqn) {\n // handle no package\n if (!fqn.contains(\".\")) {\n return \"\";\n }\n\n int lastIndex = fqn.lastIndexOf(\".\");\n return fqn.substring(0, lastIndex);\n }\n}\n"
},
{
"path": "codebase-graph-builder/src/main/java/org/hjug/graphbuilder/visitor/BaseCodebaseVisitor.java",
"content": "package org.hjug.graphbuilder.visitor;\n\nimport lombok.Getter;\nimport org.hjug.graphbuilder.DependencyCollector;\nimport org.openrewrite.java.JavaIsoVisitor;\n\n@Getter\npublic abstract class BaseCodebaseVisitor extends JavaIsoVisitor
{\n\n protected final DependencyCollector dependencyCollector;\n\n protected BaseCodebaseVisitor(DependencyCollector dependencyCollector) {\n this.dependencyCollector = dependencyCollector;\n }\n\n protected abstract String getCurrentOwnerFqn();\n}\n"
},
{
"path": "codebase-graph-builder/src/main/java/org/hjug/graphbuilder/visitor/BaseTypeProcessor.java",
"content": "package org.hjug.graphbuilder.visitor;\n\nimport lombok.extern.slf4j.Slf4j;\nimport org.hjug.graphbuilder.DependencyCollector;\nimport org.openrewrite.Cursor;\nimport org.openrewrite.java.service.AnnotationService;\nimport org.openrewrite.java.tree.Expression;\nimport org.openrewrite.java.tree.J;\nimport org.openrewrite.java.tree.JavaType;\nimport org.openrewrite.java.tree.TypeTree;\n\n@Slf4j\npublic abstract class BaseTypeProcessor {\n\n private final TypeDependencyExtractor typeDependencyExtractor = new TypeDependencyExtractor();\n\n protected abstract DependencyCollector getDependencyCollector();\n\n protected void processType(String ownerFqn, JavaType javaType) {\n if (javaType == null || javaType instanceof JavaType.Unknown) {\n return;\n }\n\n for (String dependency : typeDependencyExtractor.extractDependencies(javaType)) {\n getDependencyCollector().addClassDependency(ownerFqn, dependency);\n }\n }\n\n protected void processAnnotation(String ownerFqn, J.Annotation annotation, Cursor cursor) {\n if (annotation.getType() instanceof JavaType.Unknown) {\n return;\n }\n\n JavaType.Class type = (JavaType.Class) annotation.getType();\n if (null != type) {\n String annotationFqn = type.getFullyQualifiedName();\n log.debug(\"Variable Annotation FQN: {}\", annotationFqn);\n getDependencyCollector().addClassDependency(ownerFqn, annotationFqn);\n\n if (null != annotation.getArguments()) {\n for (Expression argument : annotation.getArguments()) {\n processType(ownerFqn, argument.getType());\n }\n }\n }\n }\n\n protected void processTypeParameter(String ownerFqn, J.TypeParameter typeParameter, Cursor cursor) {\n if (null != typeParameter.getBounds()) {\n for (TypeTree bound : typeParameter.getBounds()) {\n processType(ownerFqn, bound.getType());\n }\n }\n\n if (!typeParameter.getAnnotations().isEmpty()) {\n for (J.Annotation annotation : typeParameter.getAnnotations()) {\n processAnnotation(ownerFqn, annotation, cursor);\n }\n }\n }\n\n protected void processAnnotations(String ownerFqn, Cursor cursor) {\n AnnotationService annotationService = new AnnotationService();\n for (J.Annotation annotation : annotationService.getAllAnnotations(cursor)) {\n processAnnotation(ownerFqn, annotation, cursor);\n }\n }\n\n protected String getPackageFromFqn(String fqn) {\n if (!fqn.contains(\".\")) {\n return \"\";\n }\n int lastIndex = fqn.lastIndexOf(\".\");\n return fqn.substring(0, lastIndex);\n }\n}\n"
},
{
"path": "codebase-graph-builder/src/main/java/org/hjug/graphbuilder/visitor/FqnCapturingProcessor.java",
"content": "package org.hjug.graphbuilder.visitor;\n\nimport java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.List;\nimport java.util.Map;\nimport org.openrewrite.java.tree.J;\n\npublic interface FqnCapturingProcessor {\n\n default J.ClassDeclaration captureClassDeclarations(\n J.ClassDeclaration classDecl, Map> fqns) {\n // get class fqn (including \"$\")\n String fqn = classDecl.getType().getFullyQualifiedName();\n\n String currentPackage = getPackage(fqn);\n String className = getClassName(fqn);\n Map classesInPackage = fqns.getOrDefault(currentPackage, new HashMap<>());\n\n if (className.contains(\"$\")) {\n String normalizedClassName = className.replace('$', '.');\n List parts = Arrays.asList(normalizedClassName.split(\"\\\\.\"));\n for (int i = 0; i < parts.size(); i++) {\n String key = String.join(\".\", parts.subList(i, parts.size()));\n classesInPackage.put(key, currentPackage + \".\" + normalizedClassName);\n }\n } else {\n classesInPackage.put(className, fqn);\n }\n\n fqns.put(currentPackage, classesInPackage);\n return classDecl;\n }\n\n default String getPackage(String fqn) {\n // handle no package\n if (!fqn.contains(\".\")) {\n return \"\";\n }\n\n int lastIndex = fqn.lastIndexOf(\".\");\n return fqn.substring(0, lastIndex);\n }\n\n /**\n *\n * @param fqn\n * @return Class name (including \"$\") after last period in FQN\n */\n default String getClassName(String fqn) {\n // handle no package\n if (!fqn.contains(\".\")) {\n return fqn;\n }\n\n int lastIndex = fqn.lastIndexOf(\".\");\n return fqn.substring(lastIndex + 1);\n }\n}\n"
},
{
"path": "codebase-graph-builder/src/main/java/org/hjug/graphbuilder/visitor/JavaClassDeclarationVisitor.java",
"content": "package org.hjug.graphbuilder.visitor;\n\nimport java.util.List;\nimport lombok.extern.slf4j.Slf4j;\nimport org.hjug.graphbuilder.DependencyCollector;\nimport org.openrewrite.java.tree.*;\n\n@Slf4j\npublic class JavaClassDeclarationVisitor extends BaseCodebaseVisitor
{\n\n private final BaseTypeProcessor typeProcessor;\n private String currentOwnerFqn;\n\n public JavaClassDeclarationVisitor(DependencyCollector dependencyCollector) {\n super(dependencyCollector);\n this.typeProcessor = new BaseTypeProcessor() {\n @Override\n protected DependencyCollector getDependencyCollector() {\n return dependencyCollector;\n }\n };\n }\n\n @Override\n public J.ClassDeclaration visitClassDeclaration(J.ClassDeclaration classDecl, P p) {\n JavaType.FullyQualified type = classDecl.getType();\n if (type == null) {\n log.warn(\"ClassDeclaration has null type, skipping: {}\", classDecl.getSimpleName());\n return classDecl;\n }\n\n String owningFqn = type.getFullyQualifiedName();\n String previousOwner = currentOwnerFqn;\n currentOwnerFqn = owningFqn;\n\n try {\n typeProcessor.processType(owningFqn, type);\n\n TypeTree extendsTypeTree = classDecl.getExtends();\n if (null != extendsTypeTree) {\n typeProcessor.processType(owningFqn, extendsTypeTree.getType());\n }\n\n List implementsTypeTree = classDecl.getImplements();\n if (null != implementsTypeTree) {\n for (TypeTree typeTree : implementsTypeTree) {\n typeProcessor.processType(owningFqn, typeTree.getType());\n }\n }\n\n for (J.Annotation leadingAnnotation : classDecl.getLeadingAnnotations()) {\n typeProcessor.processAnnotation(owningFqn, leadingAnnotation, getCursor());\n }\n\n if (null != classDecl.getTypeParameters()) {\n for (J.TypeParameter typeParameter : classDecl.getTypeParameters()) {\n typeProcessor.processTypeParameter(owningFqn, typeParameter, getCursor());\n }\n }\n\n return super.visitClassDeclaration(classDecl, p);\n } finally {\n currentOwnerFqn = previousOwner;\n }\n }\n\n @Override\n public J.MethodInvocation visitMethodInvocation(J.MethodInvocation method, P p) {\n J.MethodInvocation methodInvocation = super.visitMethodInvocation(method, p);\n if (currentOwnerFqn == null) {\n return methodInvocation;\n }\n\n JavaType.Method methodType = methodInvocation.getMethodType();\n if (null != methodType && null != methodType.getDeclaringType()) {\n typeProcessor.processType(currentOwnerFqn, methodType.getDeclaringType());\n }\n\n if (null != methodInvocation.getTypeParameters()\n && !methodInvocation.getTypeParameters().isEmpty()) {\n for (Expression typeParameter : methodInvocation.getTypeParameters()) {\n typeProcessor.processType(currentOwnerFqn, typeParameter.getType());\n }\n }\n\n return methodInvocation;\n }\n\n @Override\n public J.NewClass visitNewClass(J.NewClass newClass, P p) {\n J.NewClass result = super.visitNewClass(newClass, p);\n if (currentOwnerFqn != null) {\n typeProcessor.processType(currentOwnerFqn, newClass.getType());\n }\n return result;\n }\n\n @Override\n public J.Lambda visitLambda(J.Lambda lambda, P p) {\n if (currentOwnerFqn != null && lambda.getType() != null) {\n typeProcessor.processType(currentOwnerFqn, lambda.getType());\n }\n\n // Recursively visit the lambda body to capture method invocations and type references\n // The super.visitLambda call will traverse into the lambda's body and parameters\n return super.visitLambda(lambda, p);\n }\n\n @Override\n public J.If visitIf(J.If iff, P p) {\n return super.visitIf(iff, p);\n }\n\n @Override\n public J.ForLoop visitForLoop(J.ForLoop forLoop, P p) {\n return super.visitForLoop(forLoop, p);\n }\n\n @Override\n public J.ForEachLoop visitForEachLoop(J.ForEachLoop forEachLoop, P p) {\n return super.visitForEachLoop(forEachLoop, p);\n }\n\n @Override\n public J.WhileLoop visitWhileLoop(J.WhileLoop whileLoop, P p) {\n return super.visitWhileLoop(whileLoop, p);\n }\n\n @Override\n public J.DoWhileLoop visitDoWhileLoop(J.DoWhileLoop doWhileLoop, P p) {\n return super.visitDoWhileLoop(doWhileLoop, p);\n }\n\n @Override\n public J.Switch visitSwitch(J.Switch switchStatement, P p) {\n return super.visitSwitch(switchStatement, p);\n }\n\n @Override\n public J.Try visitTry(J.Try tryStatement, P p) {\n J.Try result = super.visitTry(tryStatement, p);\n if (currentOwnerFqn != null && tryStatement.getCatches() != null) {\n for (J.Try.Catch catchClause : tryStatement.getCatches()) {\n if (catchClause.getParameter().getTree() instanceof J.VariableDeclarations) {\n J.VariableDeclarations varDecl =\n (J.VariableDeclarations) catchClause.getParameter().getTree();\n if (varDecl.getTypeExpression() != null) {\n typeProcessor.processType(\n currentOwnerFqn, varDecl.getTypeExpression().getType());\n }\n }\n }\n }\n return result;\n }\n\n @Override\n public J.InstanceOf visitInstanceOf(J.InstanceOf instanceOf, P p) {\n J.InstanceOf result = super.visitInstanceOf(instanceOf, p);\n if (currentOwnerFqn != null && instanceOf.getClazz() != null && instanceOf.getClazz() instanceof TypeTree) {\n typeProcessor.processType(currentOwnerFqn, ((TypeTree) instanceOf.getClazz()).getType());\n }\n return result;\n }\n\n @Override\n public J.TypeCast visitTypeCast(J.TypeCast typeCast, P p) {\n J.TypeCast result = super.visitTypeCast(typeCast, p);\n if (currentOwnerFqn != null && typeCast.getClazz() != null) {\n typeProcessor.processType(\n currentOwnerFqn, typeCast.getClazz().getTree().getType());\n }\n return result;\n }\n\n @Override\n public J.MemberReference visitMemberReference(J.MemberReference memberRef, P p) {\n J.MemberReference result = super.visitMemberReference(memberRef, p);\n if (currentOwnerFqn != null && memberRef.getType() != null) {\n typeProcessor.processType(currentOwnerFqn, memberRef.getType());\n }\n return result;\n }\n\n @Override\n public J.NewArray visitNewArray(J.NewArray newArray, P p) {\n J.NewArray result = super.visitNewArray(newArray, p);\n if (currentOwnerFqn != null && newArray.getType() != null) {\n typeProcessor.processType(currentOwnerFqn, newArray.getType());\n }\n return result;\n }\n\n @Override\n protected String getCurrentOwnerFqn() {\n return currentOwnerFqn;\n }\n}\n"
},
{
"path": "codebase-graph-builder/src/main/java/org/hjug/graphbuilder/visitor/JavaFqnCapturingVisitor.java",
"content": "package org.hjug.graphbuilder.visitor;\n\nimport java.util.*;\nimport lombok.Getter;\nimport org.openrewrite.java.JavaIsoVisitor;\nimport org.openrewrite.java.tree.J;\n\n/**\n * Captures Fully Qualified Names (FQN) of classes as they will be imported in import statements.\n * fqns map that is populated by this visitor is used to resolve Generic types.\n *\n * @param \n */\n@Getter\npublic class JavaFqnCapturingVisitor
extends JavaIsoVisitor
{\n\n // consider using ConcurrentHashMap to scale performance\n // package -> name, FQN\n private final Map> fqnMap = new HashMap<>();\n private final Set fqns = new HashSet<>();\n\n @Override\n public J.ClassDeclaration visitClassDeclaration(J.ClassDeclaration classDecl, P p) {\n captureClassDeclarations(classDecl, fqnMap);\n return classDecl;\n }\n\n J.ClassDeclaration captureClassDeclarations(J.ClassDeclaration classDecl, Map> fqnMap) {\n String fqn = classDecl.getType().getFullyQualifiedName();\n fqns.add(fqn);\n return classDecl;\n }\n\n String getPackage(String fqn) {\n // handle no package\n if (!fqn.contains(\".\")) {\n return \"\";\n }\n\n int lastIndex = fqn.lastIndexOf(\".\");\n return fqn.substring(0, lastIndex);\n }\n\n /**\n *\n * @param fqn\n * @return Class name (including \"$\") after last period in FQN\n */\n String getClassName(String fqn) {\n // handle no package\n if (!fqn.contains(\".\")) {\n return fqn;\n }\n\n int lastIndex = fqn.lastIndexOf(\".\");\n return fqn.substring(lastIndex + 1);\n }\n}\n"
},
{
"path": "codebase-graph-builder/src/main/java/org/hjug/graphbuilder/visitor/JavaMethodDeclarationVisitor.java",
"content": "package org.hjug.graphbuilder.visitor;\n\nimport java.util.List;\nimport lombok.extern.slf4j.Slf4j;\nimport org.hjug.graphbuilder.DependencyCollector;\nimport org.openrewrite.java.tree.J;\nimport org.openrewrite.java.tree.JavaType;\nimport org.openrewrite.java.tree.NameTree;\nimport org.openrewrite.java.tree.TypeTree;\n\n@Slf4j\npublic class JavaMethodDeclarationVisitor extends BaseCodebaseVisitor
{\n\n private final BaseTypeProcessor typeProcessor;\n\n public JavaMethodDeclarationVisitor(DependencyCollector dependencyCollector) {\n super(dependencyCollector);\n this.typeProcessor = new BaseTypeProcessor() {\n @Override\n protected DependencyCollector getDependencyCollector() {\n return dependencyCollector;\n }\n };\n }\n\n @Override\n public J.MethodDeclaration visitMethodDeclaration(J.MethodDeclaration method, P p) {\n J.MethodDeclaration methodDeclaration = super.visitMethodDeclaration(method, p);\n\n JavaType.Method methodType = methodDeclaration.getMethodType();\n if (null == methodType) {\n log.warn(\"MethodDeclaration has null methodType, skipping: {}\", methodDeclaration.getSimpleName());\n return methodDeclaration;\n }\n\n if (methodType.getDeclaringType() == null) {\n log.warn(\"MethodDeclaration has null declaring type, skipping: {}\", methodDeclaration.getSimpleName());\n return methodDeclaration;\n }\n\n String owner = methodType.getDeclaringType().getFullyQualifiedName();\n\n TypeTree returnTypeExpression = methodDeclaration.getReturnTypeExpression();\n if (returnTypeExpression != null) {\n JavaType returnType = returnTypeExpression.getType();\n\n if (!(returnType instanceof JavaType.Primitive)) {\n typeProcessor.processType(owner, returnType);\n }\n }\n\n for (J.Annotation leadingAnnotation : methodDeclaration.getLeadingAnnotations()) {\n typeProcessor.processAnnotation(owner, leadingAnnotation, getCursor());\n }\n\n if (null != methodDeclaration.getTypeParameters()) {\n for (J.TypeParameter typeParameter : methodDeclaration.getTypeParameters()) {\n typeProcessor.processTypeParameter(owner, typeParameter, getCursor());\n }\n }\n\n List throwz = methodDeclaration.getThrows();\n if (null != throwz && !throwz.isEmpty()) {\n for (NameTree thrown : throwz) {\n typeProcessor.processType(owner, thrown.getType());\n }\n }\n\n return methodDeclaration;\n }\n\n @Override\n protected String getCurrentOwnerFqn() {\n return null;\n }\n}\n"
},
{
"path": "codebase-graph-builder/src/main/java/org/hjug/graphbuilder/visitor/JavaVariableTypeVisitor.java",
"content": "package org.hjug.graphbuilder.visitor;\n\nimport java.util.List;\nimport lombok.extern.slf4j.Slf4j;\nimport org.hjug.graphbuilder.DependencyCollector;\nimport org.openrewrite.java.tree.*;\n\n@Slf4j\npublic class JavaVariableTypeVisitor extends BaseCodebaseVisitor
{\n\n private final BaseTypeProcessor typeProcessor;\n\n public JavaVariableTypeVisitor(DependencyCollector dependencyCollector) {\n super(dependencyCollector);\n this.typeProcessor = new BaseTypeProcessor() {\n @Override\n protected DependencyCollector getDependencyCollector() {\n return dependencyCollector;\n }\n };\n }\n\n @Override\n public J.VariableDeclarations visitVariableDeclarations(J.VariableDeclarations multiVariable, P p) {\n J.VariableDeclarations variableDeclarations = super.visitVariableDeclarations(multiVariable, p);\n\n List variables = variableDeclarations.getVariables();\n if (null == variables || variables.isEmpty() || null == variables.get(0).getVariableType()) {\n log.debug(\"Skipping variable declaration with null variable type\");\n return variableDeclarations;\n }\n\n JavaType owner = variables.get(0).getVariableType().getOwner();\n String ownerFqn = \"\";\n\n if (owner instanceof JavaType.Method) {\n JavaType.Method m = (JavaType.Method) owner;\n if (m.getDeclaringType() == null) {\n log.warn(\"Method owner has null declaring type, skipping variable declaration\");\n return variableDeclarations;\n }\n ownerFqn = m.getDeclaringType().getFullyQualifiedName();\n } else if (owner instanceof JavaType.Class) {\n JavaType.Class c = (JavaType.Class) owner;\n ownerFqn = c.getFullyQualifiedName();\n } else {\n log.debug(\"Unknown owner type: {}\", owner != null ? owner.getClass() : \"null\");\n return variableDeclarations;\n }\n\n log.debug(\"Processing variable declaration in: {}\", ownerFqn);\n\n TypeTree typeTree = variableDeclarations.getTypeExpression();\n\n JavaType javaType;\n if (null != typeTree) {\n javaType = typeTree.getType();\n } else {\n return variableDeclarations;\n }\n\n typeProcessor.processAnnotations(ownerFqn, getCursor());\n\n if (javaType instanceof JavaType.Primitive) {\n return variableDeclarations;\n }\n\n typeProcessor.processType(ownerFqn, javaType);\n\n return variableDeclarations;\n }\n\n @Override\n protected String getCurrentOwnerFqn() {\n return null;\n }\n}\n"
},
{
"path": "codebase-graph-builder/src/main/java/org/hjug/graphbuilder/visitor/JavaVisitor.java",
"content": "package org.hjug.graphbuilder.visitor;\n\nimport java.util.*;\nimport lombok.Getter;\nimport lombok.extern.slf4j.Slf4j;\nimport org.hjug.graphbuilder.DependencyCollector;\nimport org.openrewrite.java.tree.*;\n\n@Slf4j\npublic class JavaVisitor extends BaseCodebaseVisitor
{\n\n @Getter\n private final Map classToSourceFilePathMapping = new HashMap<>();\n\n private final JavaClassDeclarationVisitor javaClassDeclarationVisitor;\n\n public JavaVisitor(DependencyCollector dependencyCollector) {\n super(dependencyCollector);\n javaClassDeclarationVisitor = new JavaClassDeclarationVisitor<>(dependencyCollector);\n }\n\n @Override\n public J.ClassDeclaration visitClassDeclaration(J.ClassDeclaration classDecl, P p) {\n return javaClassDeclarationVisitor.visitClassDeclaration(classDecl, p);\n }\n\n // Map each class to its source file\n @Override\n public J.CompilationUnit visitCompilationUnit(J.CompilationUnit cu, P p) {\n J.CompilationUnit compilationUnit = super.visitCompilationUnit(cu, p);\n\n J.Package packageDeclaration = compilationUnit.getPackageDeclaration();\n if (null == packageDeclaration) {\n return compilationUnit;\n }\n\n dependencyCollector.registerPackage(packageDeclaration.getPackageName());\n\n for (J.ClassDeclaration aClass : compilationUnit.getClasses()) {\n String classFqn = aClass.getType().getFullyQualifiedName();\n String sourcePath = compilationUnit.getSourcePath().toUri().toString();\n classToSourceFilePathMapping.put(classFqn, sourcePath);\n dependencyCollector.recordClassLocation(classFqn, sourcePath);\n }\n\n return compilationUnit;\n }\n\n @Override\n protected String getCurrentOwnerFqn() {\n return null;\n }\n}\n"
},
{
"path": "codebase-graph-builder/src/main/java/org/hjug/graphbuilder/visitor/TypeDependencyExtractor.java",
"content": "package org.hjug.graphbuilder.visitor;\n\nimport java.util.HashSet;\nimport java.util.Set;\nimport lombok.extern.slf4j.Slf4j;\nimport org.openrewrite.java.tree.JavaType;\n\n@Slf4j\npublic class TypeDependencyExtractor {\n\n /**\n * Extracts all type dependencies from a JavaType\n *\n * @param javaType The type to extract dependencies from\n * @return Set of fully qualified type names that the given type depends on\n */\n public Set extractDependencies(JavaType javaType) {\n Set dependencies = new HashSet<>();\n if (javaType == null) {\n return dependencies;\n }\n\n extractDependenciesRecursive(javaType, dependencies);\n return dependencies;\n }\n\n private void extractDependenciesRecursive(JavaType javaType, Set dependencies) {\n if (javaType instanceof JavaType.Class) {\n extractFromClass((JavaType.Class) javaType, dependencies);\n } else if (javaType instanceof JavaType.Parameterized) {\n extractFromParameterized((JavaType.Parameterized) javaType, dependencies);\n } else if (javaType instanceof JavaType.GenericTypeVariable) {\n extractFromGenericTypeVariable((JavaType.GenericTypeVariable) javaType, dependencies);\n } else if (javaType instanceof JavaType.Array) {\n extractFromArray((JavaType.Array) javaType, dependencies);\n }\n }\n\n private void extractFromClass(JavaType.Class classType, Set dependencies) {\n log.debug(\"Class type FQN: {}\", classType.getFullyQualifiedName());\n dependencies.add(classType.getFullyQualifiedName());\n extractAnnotations(classType, dependencies);\n }\n\n private void extractFromParameterized(JavaType.Parameterized parameterized, Set dependencies) {\n log.debug(\"Parameterized type FQN: {}\", parameterized.getFullyQualifiedName());\n dependencies.add(parameterized.getFullyQualifiedName());\n extractAnnotations(parameterized, dependencies);\n\n log.debug(\"Nested Parameterized type parameters: {}\", parameterized.getTypeParameters());\n for (JavaType parameter : parameterized.getTypeParameters()) {\n extractDependenciesRecursive(parameter, dependencies);\n }\n }\n\n private void extractFromArray(JavaType.Array arrayType, Set dependencies) {\n log.debug(\"Array Element type: {}\", arrayType.getElemType());\n extractDependenciesRecursive(arrayType.getElemType(), dependencies);\n }\n\n private void extractFromGenericTypeVariable(JavaType.GenericTypeVariable typeVariable, Set dependencies) {\n log.debug(\"Type parameter type name: {}\", typeVariable.getName());\n\n for (JavaType bound : typeVariable.getBounds()) {\n if (bound instanceof JavaType.Class) {\n dependencies.add(((JavaType.Class) bound).getFullyQualifiedName());\n } else if (bound instanceof JavaType.Parameterized) {\n dependencies.add(((JavaType.Parameterized) bound).getFullyQualifiedName());\n } else {\n log.debug(\"Unknown type bound: {}\", bound);\n }\n }\n }\n\n private void extractAnnotations(JavaType.FullyQualified fullyQualified, Set dependencies) {\n if (!fullyQualified.getAnnotations().isEmpty()) {\n for (JavaType.FullyQualified annotation : fullyQualified.getAnnotations()) {\n String annotationFqn = annotation.getFullyQualifiedName();\n log.debug(\"Annotation FQN: {}\", annotationFqn);\n dependencies.add(annotationFqn);\n }\n }\n }\n}\n"
},
{
"path": "codebase-graph-builder/src/test/java/org/hjug/graphbuilder/JavaGraphBuilderTest.java",
"content": "package org.hjug.graphbuilder;\n\nimport static org.junit.jupiter.api.Assertions.*;\n\nimport java.io.File;\nimport java.io.IOException;\nimport java.util.HashSet;\nimport java.util.Set;\nimport org.jgrapht.Graph;\nimport org.jgrapht.graph.DefaultWeightedEdge;\nimport org.junit.jupiter.api.Assertions;\nimport org.junit.jupiter.api.DisplayName;\nimport org.junit.jupiter.api.Test;\n\nclass JavaGraphBuilderTest {\n\n JavaGraphBuilder javaGraphBuilder = new JavaGraphBuilder();\n\n @DisplayName(\"When source directory input param is empty or null throw IllegalArgumentException.\")\n @Test\n void parseSourceDirectoryEmptyTest() {\n Assertions.assertThrows(\n IllegalArgumentException.class, () -> javaGraphBuilder.getCodebaseGraphDTO(\"\", false, \"\"));\n Assertions.assertThrows(\n IllegalArgumentException.class, () -> javaGraphBuilder.getCodebaseGraphDTO(null, false, \"\"));\n }\n\n @DisplayName(\"Given a valid source directory input parameter return a valid graph.\")\n @Test\n void parseSourceDirectoryTest() throws IOException {\n File srcDirectory = new File(\"src/test/resources/javaSrcDirectory\");\n CodebaseGraphDTO dto = javaGraphBuilder.getCodebaseGraphDTO(srcDirectory.getAbsolutePath(), false, \"\");\n Graph classReferencesGraph = dto.getClassReferencesGraph();\n assertNotNull(classReferencesGraph);\n assertEquals(5, classReferencesGraph.vertexSet().size());\n assertEquals(7, classReferencesGraph.edgeSet().size());\n assertTrue(classReferencesGraph.containsVertex(\"com.ideacrest.parser.testclasses.A\"));\n assertTrue(classReferencesGraph.containsVertex(\"com.ideacrest.parser.testclasses.B\"));\n assertTrue(classReferencesGraph.containsVertex(\"com.ideacrest.parser.testclasses.C\"));\n assertTrue(classReferencesGraph.containsVertex(\"com.ideacrest.parser.testclasses.D\"));\n assertTrue(classReferencesGraph.containsVertex(\"com.ideacrest.parser.testclasses.E\"));\n assertTrue(classReferencesGraph.containsEdge(\n \"com.ideacrest.parser.testclasses.A\", \"com.ideacrest.parser.testclasses.B\"));\n assertTrue(classReferencesGraph.containsEdge(\n \"com.ideacrest.parser.testclasses.B\", \"com.ideacrest.parser.testclasses.C\"));\n assertTrue(classReferencesGraph.containsEdge(\n \"com.ideacrest.parser.testclasses.C\", \"com.ideacrest.parser.testclasses.A\"));\n assertTrue(classReferencesGraph.containsEdge(\n \"com.ideacrest.parser.testclasses.C\", \"com.ideacrest.parser.testclasses.E\"));\n assertTrue(classReferencesGraph.containsEdge(\n \"com.ideacrest.parser.testclasses.D\", \"com.ideacrest.parser.testclasses.A\"));\n assertTrue(classReferencesGraph.containsEdge(\n \"com.ideacrest.parser.testclasses.D\", \"com.ideacrest.parser.testclasses.C\"));\n assertTrue(classReferencesGraph.containsEdge(\n \"com.ideacrest.parser.testclasses.E\", \"com.ideacrest.parser.testclasses.D\"));\n\n // confirm edge weight calculations\n assertEquals(\n 1,\n getEdgeWeight(\n classReferencesGraph,\n \"com.ideacrest.parser.testclasses.A\",\n \"com.ideacrest.parser.testclasses.B\"));\n assertEquals(\n 2,\n getEdgeWeight(\n classReferencesGraph,\n \"com.ideacrest.parser.testclasses.E\",\n \"com.ideacrest.parser.testclasses.D\"));\n }\n\n private static double getEdgeWeight(\n Graph classReferencesGraph, String sourceVertex, String targetVertex) {\n return classReferencesGraph.getEdgeWeight(classReferencesGraph.getEdge(sourceVertex, targetVertex));\n }\n\n @Test\n void removeClassesNotInCodebase() throws IOException {\n File srcDirectory = new File(\"src/test/resources/javaSrcDirectory\");\n CodebaseGraphDTO dto = javaGraphBuilder.getCodebaseGraphDTO(srcDirectory.getAbsolutePath(), false, \"\");\n Graph classReferencesGraph = dto.getClassReferencesGraph();\n classReferencesGraph.addVertex(\"org.favioriteoss.FunClass\");\n classReferencesGraph.addVertex(\"org.favioriteoss.AnotherFunClass\");\n\n DefaultWeightedEdge edge1 =\n classReferencesGraph.addEdge(\"com.ideacrest.parser.testclasses.A\", \"org.favioriteoss.FunClass\");\n DefaultWeightedEdge edge2 =\n classReferencesGraph.addEdge(\"com.ideacrest.parser.testclasses.A\", \"org.favioriteoss.AnotherFunClass\");\n\n assertTrue(classReferencesGraph.containsVertex(\"org.favioriteoss.FunClass\"));\n assertTrue(classReferencesGraph.containsVertex(\"org.favioriteoss.AnotherFunClass\"));\n\n Set packagesInCodebase = new HashSet<>();\n packagesInCodebase.add(\"com.ideacrest.parser.testclasses\");\n\n javaGraphBuilder.removeClassesNotInCodebase(packagesInCodebase, classReferencesGraph);\n\n assertFalse(classReferencesGraph.containsVertex(\"org.favioriteoss.FunClass\"));\n assertFalse(classReferencesGraph.containsVertex(\"org.favioriteoss.AnotherFunClass\"));\n assertFalse(classReferencesGraph.containsEdge(edge1));\n assertFalse(classReferencesGraph.containsEdge(edge2));\n }\n}\n"
},
{
"path": "codebase-graph-builder/src/test/java/org/hjug/graphbuilder/visitor/JavaClassDeclarationVisitorTest.java",
"content": "package org.hjug.graphbuilder.visitor;\n\nimport java.io.File;\nimport java.io.IOException;\nimport java.nio.file.Files;\nimport java.nio.file.Path;\nimport java.nio.file.Paths;\nimport java.util.List;\nimport java.util.stream.Collectors;\nimport org.hjug.graphbuilder.GraphDependencyCollector;\nimport org.jgrapht.Graph;\nimport org.jgrapht.graph.DefaultDirectedWeightedGraph;\nimport org.jgrapht.graph.DefaultWeightedEdge;\nimport org.junit.jupiter.api.Assertions;\nimport org.junit.jupiter.api.Test;\nimport org.openrewrite.ExecutionContext;\nimport org.openrewrite.InMemoryExecutionContext;\nimport org.openrewrite.java.JavaParser;\n\nclass JavaClassDeclarationVisitorTest {\n\n @Test\n void visitClasses() throws IOException {\n\n File srcDirectory = new File(\"src/test/java/org/hjug/graphbuilder/visitor/testclasses\");\n\n org.openrewrite.java.JavaParser javaParser =\n JavaParser.fromJavaVersion().build();\n ExecutionContext ctx = new InMemoryExecutionContext(Throwable::printStackTrace);\n\n Graph classReferencesGraph =\n new DefaultDirectedWeightedGraph<>(DefaultWeightedEdge.class);\n Graph packageReferencesGraph =\n new DefaultDirectedWeightedGraph<>(DefaultWeightedEdge.class);\n GraphDependencyCollector dependencyCollector =\n new GraphDependencyCollector(classReferencesGraph, packageReferencesGraph);\n\n JavaClassDeclarationVisitor javaVariableCapturingVisitor =\n new JavaClassDeclarationVisitor<>(dependencyCollector);\n\n List list = Files.walk(Paths.get(srcDirectory.getAbsolutePath())).collect(Collectors.toList());\n javaParser.parse(list, Paths.get(srcDirectory.getAbsolutePath()), ctx).forEach(cu -> {\n javaVariableCapturingVisitor.visit(cu, ctx);\n });\n\n Assertions.assertTrue(classReferencesGraph.containsVertex(\"org.hjug.graphbuilder.visitor.testclasses.A\"));\n Assertions.assertTrue(classReferencesGraph.containsVertex(\"org.hjug.graphbuilder.visitor.testclasses.B\"));\n Assertions.assertTrue(classReferencesGraph.containsVertex(\"org.hjug.graphbuilder.visitor.testclasses.C\"));\n Assertions.assertTrue(classReferencesGraph.containsVertex(\"org.hjug.graphbuilder.visitor.testclasses.D\"));\n Assertions.assertTrue(\n classReferencesGraph.containsVertex(\"org.hjug.graphbuilder.visitor.testclasses.MyAnnotation\"));\n Assertions.assertFalse(classReferencesGraph.containsVertex(\"org.hjug.graphbuilder.visitor.testclasses.E\"));\n Assertions.assertTrue(classReferencesGraph.containsVertex(\"org.hjug.graphbuilder.visitor.testclasses.F\"));\n Assertions.assertTrue(classReferencesGraph.containsVertex(\"org.hjug.graphbuilder.visitor.testclasses.G\"));\n }\n}\n"
},
{
"path": "codebase-graph-builder/src/test/java/org/hjug/graphbuilder/visitor/JavaFqnCapturingVisitorTest.java",
"content": "package org.hjug.graphbuilder.visitor;\n\nimport java.io.File;\nimport java.io.IOException;\nimport java.nio.file.Files;\nimport java.nio.file.Path;\nimport java.nio.file.Paths;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.stream.Collectors;\nimport org.junit.jupiter.api.Assertions;\nimport org.junit.jupiter.api.Disabled;\nimport org.junit.jupiter.api.Test;\nimport org.openrewrite.ExecutionContext;\nimport org.openrewrite.InMemoryExecutionContext;\nimport org.openrewrite.java.JavaParser;\n\n@Disabled\nclass JavaFqnCapturingVisitorTest {\n\n @Test\n void visitClasses() throws IOException {\n\n File srcDirectory = new File(\"src/test/java/org/hjug/graphbuilder/visitor/testclasses\");\n\n org.openrewrite.java.JavaParser javaParser =\n JavaParser.fromJavaVersion().build();\n ExecutionContext ctx = new InMemoryExecutionContext(Throwable::printStackTrace);\n\n JavaFqnCapturingVisitor javaFqnCapturingVisitor = new JavaFqnCapturingVisitor();\n\n List list = Files.walk(Paths.get(srcDirectory.getAbsolutePath())).collect(Collectors.toList());\n javaParser.parse(list, Paths.get(srcDirectory.getAbsolutePath()), ctx).forEach(cu -> {\n javaFqnCapturingVisitor.visit(cu, ctx);\n });\n\n Map> fqns = javaFqnCapturingVisitor.getFqnMap();\n Map processed = fqns.get(\"org.hjug.graphbuilder.visitor.testclasses\");\n Assertions.assertEquals(\"org.hjug.graphbuilder.visitor.testclasses.A\", processed.get(\"A\"));\n Assertions.assertEquals(\n \"org.hjug.graphbuilder.visitor.testclasses.A.InnerClass\", processed.get(\"A.InnerClass\"));\n Assertions.assertEquals(\"org.hjug.graphbuilder.visitor.testclasses.A.InnerClass\", processed.get(\"InnerClass\"));\n Assertions.assertEquals(\n \"org.hjug.graphbuilder.visitor.testclasses.A.InnerClass.InnerInner\",\n processed.get(\"A.InnerClass.InnerInner\"));\n Assertions.assertEquals(\n \"org.hjug.graphbuilder.visitor.testclasses.A.InnerClass.InnerInner\",\n processed.get(\"InnerClass.InnerInner\"));\n Assertions.assertEquals(\n \"org.hjug.graphbuilder.visitor.testclasses.A.InnerClass.InnerInner\", processed.get(\"InnerInner\"));\n Assertions.assertEquals(\n \"org.hjug.graphbuilder.visitor.testclasses.A.InnerClass.InnerInner.MegaInner\",\n processed.get(\"A.InnerClass.InnerInner.MegaInner\"));\n Assertions.assertEquals(\n \"org.hjug.graphbuilder.visitor.testclasses.A.InnerClass.InnerInner.MegaInner\",\n processed.get(\"InnerClass.InnerInner.MegaInner\"));\n Assertions.assertEquals(\n \"org.hjug.graphbuilder.visitor.testclasses.A.InnerClass.InnerInner.MegaInner\",\n processed.get(\"InnerInner.MegaInner\"));\n Assertions.assertEquals(\n \"org.hjug.graphbuilder.visitor.testclasses.A.InnerClass.InnerInner.MegaInner\",\n processed.get(\"MegaInner\"));\n Assertions.assertEquals(\n \"org.hjug.graphbuilder.visitor.testclasses.A.StaticInnerClass\", processed.get(\"A.StaticInnerClass\"));\n Assertions.assertEquals(\n \"org.hjug.graphbuilder.visitor.testclasses.A.StaticInnerClass\", processed.get(\"StaticInnerClass\"));\n Assertions.assertEquals(\"org.hjug.graphbuilder.visitor.testclasses.NonPublic\", processed.get(\"NonPublic\"));\n }\n}\n"
},
{
"path": "codebase-graph-builder/src/test/java/org/hjug/graphbuilder/visitor/JavaInitializerBlockVisitorTest.java",
"content": "package org.hjug.graphbuilder.visitor;\n\nimport java.io.File;\nimport java.io.IOException;\nimport java.nio.file.Files;\nimport java.nio.file.Path;\nimport java.nio.file.Paths;\nimport java.util.List;\nimport java.util.stream.Collectors;\nimport org.hjug.graphbuilder.GraphDependencyCollector;\nimport org.jgrapht.Graph;\nimport org.jgrapht.graph.DefaultDirectedWeightedGraph;\nimport org.jgrapht.graph.DefaultWeightedEdge;\nimport org.junit.jupiter.api.Assertions;\nimport org.junit.jupiter.api.Test;\nimport org.openrewrite.ExecutionContext;\nimport org.openrewrite.InMemoryExecutionContext;\nimport org.openrewrite.java.JavaParser;\n\nclass JavaInitializerBlockVisitorTest {\n\n @Test\n void visitInstanceInitializerBlocks() throws IOException {\n\n File srcDirectory = new File(\"src/test/java/org/hjug/graphbuilder/visitor/testclasses/initializers\");\n\n JavaParser javaParser = JavaParser.fromJavaVersion().build();\n ExecutionContext ctx = new InMemoryExecutionContext(Throwable::printStackTrace);\n\n Graph classReferencesGraph =\n new DefaultDirectedWeightedGraph<>(DefaultWeightedEdge.class);\n Graph packageReferencesGraph =\n new DefaultDirectedWeightedGraph<>(DefaultWeightedEdge.class);\n\n GraphDependencyCollector dependencyCollector =\n new GraphDependencyCollector(classReferencesGraph, packageReferencesGraph);\n\n JavaClassDeclarationVisitor classDeclarationVisitor =\n new JavaClassDeclarationVisitor<>(dependencyCollector);\n\n List list = Files.walk(Paths.get(srcDirectory.getAbsolutePath())).collect(Collectors.toList());\n javaParser.parse(list, Paths.get(srcDirectory.getAbsolutePath()), ctx).forEach(cu -> {\n classDeclarationVisitor.visit(cu, ctx);\n });\n\n // Verify that the test class is in the graph\n Assertions.assertTrue(\n classReferencesGraph.containsVertex(\n \"org.hjug.graphbuilder.visitor.testclasses.initializers.InitializerBlockTestClass\"),\n \"InitializerBlockTestClass should be in the graph\");\n\n // Verify ArrayList is captured from instance initializer block: new ArrayList<>()\n Assertions.assertTrue(\n classReferencesGraph.containsVertex(\"java.util.ArrayList\"),\n \"ArrayList should be captured from instance initializer block\");\n\n // Verify edge from InitializerBlockTestClass to ArrayList exists\n Assertions.assertTrue(\n classReferencesGraph.containsEdge(\n \"org.hjug.graphbuilder.visitor.testclasses.initializers.InitializerBlockTestClass\",\n \"java.util.ArrayList\"),\n \"Should have edge from InitializerBlockTestClass to ArrayList from initializer block\");\n\n // Verify HashMap is captured from instance initializer block: new HashMap<>()\n Assertions.assertTrue(\n classReferencesGraph.containsVertex(\"java.util.HashMap\"),\n \"HashMap should be captured from instance initializer block\");\n\n // Verify edge from InitializerBlockTestClass to HashMap exists\n Assertions.assertTrue(\n classReferencesGraph.containsEdge(\n \"org.hjug.graphbuilder.visitor.testclasses.initializers.InitializerBlockTestClass\",\n \"java.util.HashMap\"),\n \"Should have edge from InitializerBlockTestClass to HashMap from initializer block\");\n\n // Verify StringBuilder is captured from instance initializer block: new StringBuilder()\n Assertions.assertTrue(\n classReferencesGraph.containsVertex(\"java.lang.StringBuilder\"),\n \"StringBuilder should be captured from instance initializer block\");\n\n // Verify edge from InitializerBlockTestClass to StringBuilder exists\n Assertions.assertTrue(\n classReferencesGraph.containsEdge(\n \"org.hjug.graphbuilder.visitor.testclasses.initializers.InitializerBlockTestClass\",\n \"java.lang.StringBuilder\"),\n \"Should have edge from InitializerBlockTestClass to StringBuilder from initializer block\");\n }\n\n @Test\n void visitStaticInitializerBlocks() throws IOException {\n\n File srcDirectory = new File(\"src/test/java/org/hjug/graphbuilder/visitor/testclasses/initializers\");\n\n JavaParser javaParser = JavaParser.fromJavaVersion().build();\n ExecutionContext ctx = new InMemoryExecutionContext(Throwable::printStackTrace);\n\n Graph classReferencesGraph =\n new DefaultDirectedWeightedGraph<>(DefaultWeightedEdge.class);\n Graph packageReferencesGraph =\n new DefaultDirectedWeightedGraph<>(DefaultWeightedEdge.class);\n\n GraphDependencyCollector dependencyCollector =\n new GraphDependencyCollector(classReferencesGraph, packageReferencesGraph);\n\n JavaClassDeclarationVisitor classDeclarationVisitor =\n new JavaClassDeclarationVisitor<>(dependencyCollector);\n\n List list = Files.walk(Paths.get(srcDirectory.getAbsolutePath())).collect(Collectors.toList());\n javaParser.parse(list, Paths.get(srcDirectory.getAbsolutePath()), ctx).forEach(cu -> {\n classDeclarationVisitor.visit(cu, ctx);\n });\n\n // Verify that the complex test class is in the graph\n Assertions.assertTrue(\n classReferencesGraph.containsVertex(\n \"org.hjug.graphbuilder.visitor.testclasses.initializers.ComplexInitializerClass\"),\n \"ComplexInitializerClass should be in the graph\");\n\n // Verify ConcurrentHashMap is captured from static initializer block\n Assertions.assertTrue(\n classReferencesGraph.containsVertex(\"java.util.concurrent.ConcurrentHashMap\"),\n \"ConcurrentHashMap should be captured from static initializer block\");\n\n // Verify edge from ComplexInitializerClass to ConcurrentHashMap exists\n Assertions.assertTrue(\n classReferencesGraph.containsEdge(\n \"org.hjug.graphbuilder.visitor.testclasses.initializers.ComplexInitializerClass\",\n \"java.util.concurrent.ConcurrentHashMap\"),\n \"Should have edge from ComplexInitializerClass to ConcurrentHashMap from static initializer\");\n\n // Verify AtomicInteger is captured from static initializer block\n Assertions.assertTrue(\n classReferencesGraph.containsVertex(\"java.util.concurrent.atomic.AtomicInteger\"),\n \"AtomicInteger should be captured from static initializer block\");\n\n // Verify edge from ComplexInitializerClass to AtomicInteger exists\n Assertions.assertTrue(\n classReferencesGraph.containsEdge(\n \"org.hjug.graphbuilder.visitor.testclasses.initializers.ComplexInitializerClass\",\n \"java.util.concurrent.atomic.AtomicInteger\"),\n \"Should have edge from ComplexInitializerClass to AtomicInteger from static initializer\");\n\n // Verify nested classes are captured from instance initializer\n Assertions.assertTrue(\n classReferencesGraph.containsVertex(\n \"org.hjug.graphbuilder.visitor.testclasses.initializers.ComplexInitializerClass$DataProcessor\"),\n \"DataProcessor nested class should be captured from instance initializer\");\n\n Assertions.assertTrue(\n classReferencesGraph.containsVertex(\n \"org.hjug.graphbuilder.visitor.testclasses.initializers.ComplexInitializerClass$HelperService\"),\n \"HelperService nested class should be captured from instance initializer\");\n }\n}\n"
},
{
"path": "codebase-graph-builder/src/test/java/org/hjug/graphbuilder/visitor/JavaLambdaVisitorTest.java",
"content": "package org.hjug.graphbuilder.visitor;\n\nimport java.io.File;\nimport java.io.IOException;\nimport java.nio.file.Files;\nimport java.nio.file.Path;\nimport java.nio.file.Paths;\nimport java.util.List;\nimport java.util.stream.Collectors;\nimport org.hjug.graphbuilder.GraphDependencyCollector;\nimport org.jgrapht.Graph;\nimport org.jgrapht.graph.DefaultDirectedWeightedGraph;\nimport org.jgrapht.graph.DefaultWeightedEdge;\nimport org.junit.jupiter.api.Assertions;\nimport org.junit.jupiter.api.Test;\nimport org.openrewrite.ExecutionContext;\nimport org.openrewrite.InMemoryExecutionContext;\nimport org.openrewrite.java.JavaParser;\n\nclass JavaLambdaVisitorTest {\n\n @Test\n void visitLambdaBodiesRecursively() throws IOException {\n\n File srcDirectory = new File(\"src/test/java/org/hjug/graphbuilder/visitor/testclasses/lambda\");\n\n JavaParser javaParser = JavaParser.fromJavaVersion().build();\n ExecutionContext ctx = new InMemoryExecutionContext(Throwable::printStackTrace);\n\n Graph classReferencesGraph =\n new DefaultDirectedWeightedGraph<>(DefaultWeightedEdge.class);\n Graph packageReferencesGraph =\n new DefaultDirectedWeightedGraph<>(DefaultWeightedEdge.class);\n\n GraphDependencyCollector dependencyCollector =\n new GraphDependencyCollector(classReferencesGraph, packageReferencesGraph);\n\n JavaClassDeclarationVisitor classDeclarationVisitor =\n new JavaClassDeclarationVisitor<>(dependencyCollector);\n\n List list = Files.walk(Paths.get(srcDirectory.getAbsolutePath())).collect(Collectors.toList());\n javaParser.parse(list, Paths.get(srcDirectory.getAbsolutePath()), ctx).forEach(cu -> {\n classDeclarationVisitor.visit(cu, ctx);\n });\n\n // Verify that the main test class is in the graph\n Assertions.assertTrue(\n classReferencesGraph.containsVertex(\"org.hjug.graphbuilder.visitor.testclasses.lambda.LambdaTestClass\"),\n \"LambdaTestClass should be in the graph\");\n\n // Verify that HelperClass is captured as a dependency\n // This is from field declaration AND from lambda body: helper.process(item)\n Assertions.assertTrue(\n classReferencesGraph.containsVertex(\"org.hjug.graphbuilder.visitor.testclasses.lambda.HelperClass\"),\n \"HelperClass should be captured from lambda body method invocation\");\n\n // Verify edge from LambdaTestClass to HelperClass exists\n Assertions.assertTrue(\n classReferencesGraph.containsEdge(\n \"org.hjug.graphbuilder.visitor.testclasses.lambda.LambdaTestClass\",\n \"org.hjug.graphbuilder.visitor.testclasses.lambda.HelperClass\"),\n \"Should have edge from LambdaTestClass to HelperClass\");\n\n // Verify that DataProcessor is captured from lambda body: new DataProcessor()\n Assertions.assertTrue(\n classReferencesGraph.containsVertex(\"org.hjug.graphbuilder.visitor.testclasses.lambda.DataProcessor\"),\n \"DataProcessor should be captured from new class instantiation in lambda body\");\n\n // Verify edge from LambdaTestClass to DataProcessor exists\n Assertions.assertTrue(\n classReferencesGraph.containsEdge(\n \"org.hjug.graphbuilder.visitor.testclasses.lambda.LambdaTestClass\",\n \"org.hjug.graphbuilder.visitor.testclasses.lambda.DataProcessor\"),\n \"Should have edge from LambdaTestClass to DataProcessor from lambda body\");\n\n // Verify that StringBuilder is captured from lambda body: new StringBuilder(s)\n Assertions.assertTrue(\n classReferencesGraph.containsVertex(\"java.lang.StringBuilder\"),\n \"StringBuilder should be captured from new class instantiation in lambda body\");\n\n // Verify edge from LambdaTestClass to StringBuilder exists\n Assertions.assertTrue(\n classReferencesGraph.containsEdge(\n \"org.hjug.graphbuilder.visitor.testclasses.lambda.LambdaTestClass\", \"java.lang.StringBuilder\"),\n \"Should have edge from LambdaTestClass to StringBuilder from lambda body\");\n\n // Verify that String is captured (from method invocations like s.toUpperCase())\n Assertions.assertTrue(\n classReferencesGraph.containsVertex(\"java.lang.String\"),\n \"String should be captured from method invocations in lambda body\");\n\n // Verify edge weight - multiple lambda usages should increase edge weight\n DefaultWeightedEdge edge = classReferencesGraph.getEdge(\n \"org.hjug.graphbuilder.visitor.testclasses.lambda.LambdaTestClass\",\n \"org.hjug.graphbuilder.visitor.testclasses.lambda.DataProcessor\");\n\n // DataProcessor is used twice: once in processWithLambda() and once in lambdaWithLocalVariable()\n Assertions.assertTrue(\n classReferencesGraph.getEdgeWeight(edge) >= 2.0,\n \"Edge weight should reflect multiple uses of DataProcessor in lambda bodies\");\n }\n\n @Test\n void visitNestedLambdaBodiesRecursively() throws IOException {\n\n File srcDirectory = new File(\"src/test/java/org/hjug/graphbuilder/visitor/testclasses/lambda\");\n\n JavaParser javaParser = JavaParser.fromJavaVersion().build();\n ExecutionContext ctx = new InMemoryExecutionContext(Throwable::printStackTrace);\n\n Graph classReferencesGraph =\n new DefaultDirectedWeightedGraph<>(DefaultWeightedEdge.class);\n Graph packageReferencesGraph =\n new DefaultDirectedWeightedGraph<>(DefaultWeightedEdge.class);\n\n GraphDependencyCollector dependencyCollector =\n new GraphDependencyCollector(classReferencesGraph, packageReferencesGraph);\n\n JavaClassDeclarationVisitor classDeclarationVisitor =\n new JavaClassDeclarationVisitor<>(dependencyCollector);\n\n List list = Files.walk(Paths.get(srcDirectory.getAbsolutePath())).collect(Collectors.toList());\n javaParser.parse(list, Paths.get(srcDirectory.getAbsolutePath()), ctx).forEach(cu -> {\n classDeclarationVisitor.visit(cu, ctx);\n });\n\n // Verify that the nested lambda test class is in the graph\n Assertions.assertTrue(\n classReferencesGraph.containsVertex(\n \"org.hjug.graphbuilder.visitor.testclasses.lambda.NestedLambdaTestClass\"),\n \"NestedLambdaTestClass should be in the graph\");\n\n // Verify DataProcessor is captured from INNER lambda: new DataProcessor() inside nested lambda\n Assertions.assertTrue(\n classReferencesGraph.containsVertex(\"org.hjug.graphbuilder.visitor.testclasses.lambda.DataProcessor\"),\n \"DataProcessor should be captured from inner nested lambda body\");\n\n // Verify edge from NestedLambdaTestClass to DataProcessor exists\n Assertions.assertTrue(\n classReferencesGraph.containsEdge(\n \"org.hjug.graphbuilder.visitor.testclasses.lambda.NestedLambdaTestClass\",\n \"org.hjug.graphbuilder.visitor.testclasses.lambda.DataProcessor\"),\n \"Should have edge from NestedLambdaTestClass to DataProcessor from nested lambda\");\n\n // Verify HelperClass is captured from nested lambda method invocation\n Assertions.assertTrue(\n classReferencesGraph.containsVertex(\"org.hjug.graphbuilder.visitor.testclasses.lambda.HelperClass\"),\n \"HelperClass should be captured from nested lambda method invocation\");\n\n // Verify edge from NestedLambdaTestClass to HelperClass exists\n Assertions.assertTrue(\n classReferencesGraph.containsEdge(\n \"org.hjug.graphbuilder.visitor.testclasses.lambda.NestedLambdaTestClass\",\n \"org.hjug.graphbuilder.visitor.testclasses.lambda.HelperClass\"),\n \"Should have edge from NestedLambdaTestClass to HelperClass from nested lambda\");\n\n // Verify edge weight reflects multiple nested lambda usages\n DefaultWeightedEdge dataProcessorEdge = classReferencesGraph.getEdge(\n \"org.hjug.graphbuilder.visitor.testclasses.lambda.NestedLambdaTestClass\",\n \"org.hjug.graphbuilder.visitor.testclasses.lambda.DataProcessor\");\n\n // DataProcessor is used in multiple nested lambdas: processNestedLambdas() and deeplyNestedLambdaWithNewClass()\n Assertions.assertTrue(\n classReferencesGraph.getEdgeWeight(dataProcessorEdge) >= 2.0,\n \"Edge weight should reflect multiple uses of DataProcessor in nested lambda bodies\");\n\n // Verify that deeply nested instantiations are captured\n DefaultWeightedEdge helperEdge = classReferencesGraph.getEdge(\n \"org.hjug.graphbuilder.visitor.testclasses.lambda.NestedLambdaTestClass\",\n \"org.hjug.graphbuilder.visitor.testclasses.lambda.HelperClass\");\n\n // HelperClass is used in field declaration and in nested lambdas\n Assertions.assertTrue(\n classReferencesGraph.getEdgeWeight(helperEdge) >= 2.0,\n \"Edge weight should reflect HelperClass usage in nested lambda blocks\");\n }\n}\n"
},
{
"path": "codebase-graph-builder/src/test/java/org/hjug/graphbuilder/visitor/JavaMethodDeclarationVisitorTest.java",
"content": "package org.hjug.graphbuilder.visitor;\n\nimport java.io.File;\nimport java.io.IOException;\nimport java.nio.file.Files;\nimport java.nio.file.Path;\nimport java.nio.file.Paths;\nimport java.util.List;\nimport java.util.stream.Collectors;\nimport org.hjug.graphbuilder.GraphDependencyCollector;\nimport org.jgrapht.Graph;\nimport org.jgrapht.graph.DefaultDirectedWeightedGraph;\nimport org.jgrapht.graph.DefaultWeightedEdge;\nimport org.junit.jupiter.api.Assertions;\nimport org.junit.jupiter.api.Test;\nimport org.openrewrite.ExecutionContext;\nimport org.openrewrite.InMemoryExecutionContext;\nimport org.openrewrite.java.JavaParser;\n\nclass JavaMethodDeclarationVisitorTest {\n\n @Test\n void visitMethodDeclarations() throws IOException {\n\n File srcDirectory = new File(\"src/test/java/org/hjug/graphbuilder/visitor/testclasses\");\n\n org.openrewrite.java.JavaParser javaParser =\n JavaParser.fromJavaVersion().build();\n ExecutionContext ctx = new InMemoryExecutionContext(Throwable::printStackTrace);\n\n Graph classReferencesGraph =\n new DefaultDirectedWeightedGraph<>(DefaultWeightedEdge.class);\n Graph packageReferencesGraph =\n new DefaultDirectedWeightedGraph<>(DefaultWeightedEdge.class);\n GraphDependencyCollector dependencyCollector =\n new GraphDependencyCollector(classReferencesGraph, packageReferencesGraph);\n\n JavaMethodDeclarationVisitor methodDeclarationVisitor =\n new JavaMethodDeclarationVisitor<>(dependencyCollector);\n\n List list = Files.walk(Paths.get(srcDirectory.getAbsolutePath())).collect(Collectors.toList());\n javaParser.parse(list, Paths.get(srcDirectory.getAbsolutePath()), ctx).forEach(cu -> {\n methodDeclarationVisitor.visit(cu, ctx);\n });\n\n Assertions.assertTrue(classReferencesGraph.containsVertex(\"org.hjug.graphbuilder.visitor.testclasses.A\"));\n\n // TODO: Assert stuff\n /* Assertions.assertTrue(methodDeclarationVisitor.getClassReferencesGraph().containsVertex(\"org.hjug.javaVariableVisitorTestClasses.A\"));\n Assertions.assertTrue(methodDeclarationVisitor.getClassReferencesGraph().containsVertex(\"org.hjug.javaVariableVisitorTestClasses.B\"));\n Assertions.assertTrue(methodDeclarationVisitor.getClassReferencesGraph().containsVertex(\"org.hjug.javaVariableVisitorTestClasses.C\"));\n Assertions.assertFalse(methodDeclarationVisitor.getClassReferencesGraph().containsVertex(\"org.hjug.javaVariableVisitorTestClasses.D\"));\n Assertions.assertTrue(methodDeclarationVisitor.getClassReferencesGraph().containsVertex(\"org.hjug.javaVariableVisitorTestClasses.MyAnnotation\"));\n Assertions.assertFalse(methodDeclarationVisitor.getClassReferencesGraph().containsVertex(\"org.hjug.javaVariableVisitorTestClasses.E\"));\n Assertions.assertTrue(methodDeclarationVisitor.getClassReferencesGraph().containsVertex(\"org.hjug.javaVariableVisitorTestClasses.F\"));\n Assertions.assertTrue(methodDeclarationVisitor.getClassReferencesGraph().containsVertex(\"org.hjug.javaVariableVisitorTestClasses.G\"));*/\n }\n}\n"
},
{
"path": "codebase-graph-builder/src/test/java/org/hjug/graphbuilder/visitor/JavaMethodInvocationVisitorTest.java",
"content": "package org.hjug.graphbuilder.visitor;\n\nimport java.io.File;\nimport java.io.IOException;\nimport java.nio.file.Files;\nimport java.nio.file.Path;\nimport java.nio.file.Paths;\nimport java.util.List;\nimport java.util.stream.Collectors;\nimport org.hjug.graphbuilder.GraphDependencyCollector;\nimport org.jgrapht.Graph;\nimport org.jgrapht.graph.DefaultWeightedEdge;\nimport org.jgrapht.graph.SimpleDirectedWeightedGraph;\nimport org.junit.jupiter.api.Assertions;\nimport org.junit.jupiter.api.Test;\nimport org.openrewrite.ExecutionContext;\nimport org.openrewrite.InMemoryExecutionContext;\nimport org.openrewrite.java.JavaParser;\n\nclass JavaMethodInvocationVisitorTest {\n\n @Test\n void visitMethodInvocations() throws IOException {\n\n File srcDirectory = new File(\"src/test/java/org/hjug/graphbuilder/visitor/testclasses/methodInvocation\");\n\n JavaParser javaParser = JavaParser.fromJavaVersion().build();\n ExecutionContext ctx = new InMemoryExecutionContext(Throwable::printStackTrace);\n\n Graph classReferencesGraph =\n new SimpleDirectedWeightedGraph<>(DefaultWeightedEdge.class);\n Graph packageReferencesGraph =\n new SimpleDirectedWeightedGraph<>(DefaultWeightedEdge.class);\n\n GraphDependencyCollector dependencyCollector =\n new GraphDependencyCollector(classReferencesGraph, packageReferencesGraph);\n\n JavaClassDeclarationVisitor classDeclarationVisitor =\n new JavaClassDeclarationVisitor<>(dependencyCollector);\n JavaVariableTypeVisitor variableTypeVisitor =\n new JavaVariableTypeVisitor<>(dependencyCollector);\n\n List list = Files.walk(Paths.get(srcDirectory.getAbsolutePath())).collect(Collectors.toList());\n javaParser.parse(list, Paths.get(srcDirectory.getAbsolutePath()), ctx).forEach(cu -> {\n classDeclarationVisitor.visit(cu, ctx);\n variableTypeVisitor.visit(cu, ctx);\n });\n\n Graph graph = classReferencesGraph;\n Assertions.assertTrue(graph.containsVertex(\"org.hjug.graphbuilder.visitor.testclasses.methodInvocation.A\"));\n Assertions.assertTrue(graph.containsVertex(\"org.hjug.graphbuilder.visitor.testclasses.methodInvocation.B\"));\n Assertions.assertTrue(graph.containsVertex(\"org.hjug.graphbuilder.visitor.testclasses.methodInvocation.C\"));\n\n Assertions.assertEquals(\n 3,\n graph.getEdgeWeight(graph.getEdge(\n \"org.hjug.graphbuilder.visitor.testclasses.methodInvocation.A\",\n \"org.hjug.graphbuilder.visitor.testclasses.methodInvocation.B\")));\n Assertions.assertEquals(\n 3,\n graph.getEdgeWeight(graph.getEdge(\n \"org.hjug.graphbuilder.visitor.testclasses.methodInvocation.A\",\n \"org.hjug.graphbuilder.visitor.testclasses.methodInvocation.C\")));\n }\n}\n"
},
{
"path": "codebase-graph-builder/src/test/java/org/hjug/graphbuilder/visitor/JavaNewClassVisitorFullTest.java",
"content": "package org.hjug.graphbuilder.visitor;\n\nimport java.io.File;\nimport java.io.IOException;\nimport java.nio.file.Files;\nimport java.nio.file.Path;\nimport java.nio.file.Paths;\nimport java.util.List;\nimport java.util.stream.Collectors;\nimport org.hjug.graphbuilder.GraphDependencyCollector;\nimport org.jgrapht.Graph;\nimport org.jgrapht.graph.DefaultWeightedEdge;\nimport org.jgrapht.graph.SimpleDirectedWeightedGraph;\nimport org.junit.jupiter.api.Assertions;\nimport org.junit.jupiter.api.Test;\nimport org.openrewrite.ExecutionContext;\nimport org.openrewrite.InMemoryExecutionContext;\nimport org.openrewrite.java.JavaParser;\n\npublic class JavaNewClassVisitorFullTest {\n\n @Test\n void visitNewClass() throws IOException {\n\n File srcDirectory = new File(\"src/test/java/org/hjug/graphbuilder/visitor/testclasses/newClass\");\n\n JavaParser javaParser = JavaParser.fromJavaVersion().build();\n ExecutionContext ctx = new InMemoryExecutionContext(Throwable::printStackTrace);\n\n Graph classReferencesGraph =\n new SimpleDirectedWeightedGraph<>(DefaultWeightedEdge.class);\n Graph packageReferencesGraph =\n new SimpleDirectedWeightedGraph<>(DefaultWeightedEdge.class);\n\n GraphDependencyCollector dependencyCollector =\n new GraphDependencyCollector(classReferencesGraph, packageReferencesGraph);\n\n final JavaVisitor javaVisitor = new JavaVisitor<>(dependencyCollector);\n final JavaVariableTypeVisitor javaVariableTypeVisitor =\n new JavaVariableTypeVisitor<>(dependencyCollector);\n final JavaMethodDeclarationVisitor javaMethodDeclarationVisitor =\n new JavaMethodDeclarationVisitor<>(dependencyCollector);\n\n List list = Files.walk(Paths.get(srcDirectory.getAbsolutePath())).collect(Collectors.toList());\n\n javaParser.parse(list, Paths.get(srcDirectory.getAbsolutePath()), ctx).forEach(cu -> {\n javaVisitor.visit(cu, ctx);\n javaVariableTypeVisitor.visit(cu, ctx);\n javaMethodDeclarationVisitor.visit(cu, ctx);\n });\n\n Graph graph = classReferencesGraph;\n Assertions.assertTrue(graph.containsVertex(\"org.hjug.graphbuilder.visitor.testclasses.newClass.A\"));\n Assertions.assertTrue(graph.containsVertex(\"org.hjug.graphbuilder.visitor.testclasses.newClass.B\"));\n Assertions.assertTrue(graph.containsVertex(\"org.hjug.graphbuilder.visitor.testclasses.newClass.C\"));\n\n // capturing counts of all types\n Assertions.assertEquals(\n 6,\n graph.getEdgeWeight(graph.getEdge(\n \"org.hjug.graphbuilder.visitor.testclasses.newClass.A\",\n \"org.hjug.graphbuilder.visitor.testclasses.newClass.B\")));\n\n Assertions.assertEquals(\n 3,\n graph.getEdgeWeight(graph.getEdge(\n \"org.hjug.graphbuilder.visitor.testclasses.newClass.A\",\n \"org.hjug.graphbuilder.visitor.testclasses.newClass.C\")));\n }\n}\n"
},
{
"path": "codebase-graph-builder/src/test/java/org/hjug/graphbuilder/visitor/JavaNewClassVisitorTest.java",
"content": "package org.hjug.graphbuilder.visitor;\n\nimport java.io.File;\nimport java.io.IOException;\nimport java.nio.file.Files;\nimport java.nio.file.Path;\nimport java.nio.file.Paths;\nimport java.util.List;\nimport java.util.stream.Collectors;\nimport org.hjug.graphbuilder.GraphDependencyCollector;\nimport org.jgrapht.Graph;\nimport org.jgrapht.graph.DefaultWeightedEdge;\nimport org.jgrapht.graph.SimpleDirectedWeightedGraph;\nimport org.junit.jupiter.api.Assertions;\nimport org.junit.jupiter.api.Test;\nimport org.openrewrite.ExecutionContext;\nimport org.openrewrite.InMemoryExecutionContext;\nimport org.openrewrite.java.JavaParser;\n\npublic class JavaNewClassVisitorTest {\n\n @Test\n void visitNewClass() throws IOException {\n\n File srcDirectory = new File(\"src/test/java/org/hjug/graphbuilder/visitor/testclasses/newClass\");\n\n JavaParser javaParser = JavaParser.fromJavaVersion().build();\n ExecutionContext ctx = new InMemoryExecutionContext(Throwable::printStackTrace);\n\n Graph classReferencesGraph =\n new SimpleDirectedWeightedGraph<>(DefaultWeightedEdge.class);\n Graph packageReferencesGraph =\n new SimpleDirectedWeightedGraph<>(DefaultWeightedEdge.class);\n\n GraphDependencyCollector dependencyCollector =\n new GraphDependencyCollector(classReferencesGraph, packageReferencesGraph);\n\n JavaClassDeclarationVisitor classDeclarationVisitor =\n new JavaClassDeclarationVisitor<>(dependencyCollector);\n JavaVariableTypeVisitor variableTypeVisitor =\n new JavaVariableTypeVisitor<>(dependencyCollector);\n\n List list = Files.walk(Paths.get(srcDirectory.getAbsolutePath())).collect(Collectors.toList());\n javaParser.parse(list, Paths.get(srcDirectory.getAbsolutePath()), ctx).forEach(cu -> {\n classDeclarationVisitor.visit(cu, ctx);\n variableTypeVisitor.visit(cu, ctx);\n });\n\n Graph graph = classReferencesGraph;\n Assertions.assertTrue(graph.containsVertex(\"org.hjug.graphbuilder.visitor.testclasses.newClass.A\"));\n Assertions.assertTrue(graph.containsVertex(\"org.hjug.graphbuilder.visitor.testclasses.newClass.B\"));\n Assertions.assertTrue(graph.containsVertex(\"org.hjug.graphbuilder.visitor.testclasses.newClass.C\"));\n\n // only looking for what was visited by classDeclarationVisitor and variableTypeVisitor\n Assertions.assertEquals(\n 5,\n graph.getEdgeWeight(graph.getEdge(\n \"org.hjug.graphbuilder.visitor.testclasses.newClass.A\",\n \"org.hjug.graphbuilder.visitor.testclasses.newClass.B\")));\n\n Assertions.assertEquals(\n 3,\n graph.getEdgeWeight(graph.getEdge(\n \"org.hjug.graphbuilder.visitor.testclasses.newClass.A\",\n \"org.hjug.graphbuilder.visitor.testclasses.newClass.C\")));\n }\n}\n"
},
{
"path": "codebase-graph-builder/src/test/java/org/hjug/graphbuilder/visitor/JavaVariableTypeVisitorTest.java",
"content": "package org.hjug.graphbuilder.visitor;\n\nimport java.io.File;\nimport java.io.IOException;\nimport java.nio.file.Files;\nimport java.nio.file.Path;\nimport java.nio.file.Paths;\nimport java.util.List;\nimport java.util.stream.Collectors;\nimport org.hjug.graphbuilder.GraphDependencyCollector;\nimport org.jgrapht.Graph;\nimport org.jgrapht.graph.DefaultDirectedWeightedGraph;\nimport org.jgrapht.graph.DefaultWeightedEdge;\nimport org.junit.jupiter.api.Assertions;\nimport org.junit.jupiter.api.Test;\nimport org.openrewrite.ExecutionContext;\nimport org.openrewrite.InMemoryExecutionContext;\nimport org.openrewrite.java.JavaParser;\n\nclass JavaVariableTypeVisitorTest {\n\n @Test\n void visitClasses() throws IOException {\n\n File srcDirectory = new File(\"src/test/java/org/hjug/graphbuilder/visitor/testclasses\");\n\n org.openrewrite.java.JavaParser javaParser =\n JavaParser.fromJavaVersion().build();\n ExecutionContext ctx = new InMemoryExecutionContext(Throwable::printStackTrace);\n\n Graph classReferencesGraph =\n new DefaultDirectedWeightedGraph<>(DefaultWeightedEdge.class);\n Graph packageReferencesGraph =\n new DefaultDirectedWeightedGraph<>(DefaultWeightedEdge.class);\n GraphDependencyCollector dependencyCollector =\n new GraphDependencyCollector(classReferencesGraph, packageReferencesGraph);\n\n JavaVariableTypeVisitor javaVariableCapturingVisitor =\n new JavaVariableTypeVisitor<>(dependencyCollector);\n\n List list = Files.walk(Paths.get(srcDirectory.getAbsolutePath())).collect(Collectors.toList());\n javaParser.parse(list, Paths.get(srcDirectory.getAbsolutePath()), ctx).forEach(cu -> {\n javaVariableCapturingVisitor.visit(cu, ctx);\n });\n\n Assertions.assertTrue(classReferencesGraph.containsVertex(\"org.hjug.graphbuilder.visitor.testclasses.A\"));\n Assertions.assertTrue(classReferencesGraph.containsVertex(\"org.hjug.graphbuilder.visitor.testclasses.B\"));\n Assertions.assertTrue(classReferencesGraph.containsVertex(\"org.hjug.graphbuilder.visitor.testclasses.C\"));\n Assertions.assertTrue(classReferencesGraph.containsVertex(\"org.hjug.graphbuilder.visitor.testclasses.D\"));\n Assertions.assertTrue(classReferencesGraph.containsVertex(\"org.hjug.graphbuilder.visitor.testclasses.E\"));\n Assertions.assertTrue(\n classReferencesGraph.containsVertex(\"org.hjug.graphbuilder.visitor.testclasses.MyAnnotation\"));\n Assertions.assertFalse(classReferencesGraph.containsVertex(\"org.hjug.graphbuilder.visitor.testclasses.F\"));\n Assertions.assertFalse(classReferencesGraph.containsVertex(\"org.hjug.graphbuilder.visitor.testclasses.G\"));\n }\n}\n"
},
{
"path": "codebase-graph-builder/src/test/java/org/hjug/graphbuilder/visitor/JavaVisitorTest.java",
"content": "package org.hjug.graphbuilder.visitor;\n\nimport static org.junit.jupiter.api.Assertions.assertEquals;\n\nimport java.io.File;\nimport java.io.IOException;\nimport java.nio.file.Files;\nimport java.nio.file.Path;\nimport java.nio.file.Paths;\nimport java.util.List;\nimport java.util.stream.Collectors;\nimport org.hjug.graphbuilder.GraphDependencyCollector;\nimport org.jgrapht.Graph;\nimport org.jgrapht.graph.DefaultWeightedEdge;\nimport org.jgrapht.graph.SimpleDirectedWeightedGraph;\nimport org.junit.jupiter.api.Test;\nimport org.openrewrite.ExecutionContext;\nimport org.openrewrite.InMemoryExecutionContext;\nimport org.openrewrite.java.JavaParser;\n\nclass JavaVisitorTest {\n\n @Test\n void visitClasses() throws IOException {\n\n File srcDirectory = new File(\"src/test/java/org/hjug/graphbuilder/visitor/testclasses\");\n\n org.openrewrite.java.JavaParser javaParser =\n JavaParser.fromJavaVersion().build();\n ExecutionContext ctx = new InMemoryExecutionContext(Throwable::printStackTrace);\n\n final Graph classReferencesGraph =\n new SimpleDirectedWeightedGraph<>(DefaultWeightedEdge.class);\n final Graph packageReferencesGraph =\n new SimpleDirectedWeightedGraph<>(DefaultWeightedEdge.class);\n\n final GraphDependencyCollector dependencyCollector =\n new GraphDependencyCollector(classReferencesGraph, packageReferencesGraph);\n\n final JavaVisitor javaVisitor = new JavaVisitor<>(dependencyCollector);\n\n List list = Files.walk(Paths.get(srcDirectory.getAbsolutePath())).collect(Collectors.toList());\n javaParser.parse(list, Paths.get(srcDirectory.getAbsolutePath()), ctx).forEach(cu -> {\n System.out.println(cu.getSourcePath());\n javaVisitor.visit(cu, ctx);\n });\n\n assertEquals(5, dependencyCollector.getPackagesInCodebase().size());\n }\n}\n"
},
{
"path": "codebase-graph-builder/src/test/java/org/hjug/graphbuilder/visitor/testclasses/A.java",
"content": "package org.hjug.graphbuilder.visitor.testclasses;\n\nimport java.util.List;\nimport java.util.Map;\n\n@MyAnnotation\npublic class A {\n\n //\tpublic A(B cB, C cC){}\n\n B crazyType;\n\n @MyAnnotation\n @MyOtherAnnotation\n int intVar, intVar2;\n\n @MyAnnotation\n @MyOtherAnnotation\n C rawC;\n\n B b, b3;\n C c;\n D[] ds;\n D d;\n\n @MyAnnotation\n B[] arrayOfGenericBsWithCTypeParam;\n\n @MyAnnotation\n B bWithArrayOfCs;\n\n List> listWithNestedGenric;\n Map map;\n List> listOfListsOfNumbers;\n\n @MyAnnotation\n F doSomething(B paramB, C genericParam) {\n List> list3;\n A a2;\n B b2;\n C c2;\n\n H h = new H();\n\n B.invocationTest(h);\n\n return new G();\n }\n\n class InnerClass {\n class InnerInner {\n class MegaInner {\n D d;\n }\n }\n }\n\n static class StaticInnerClass {}\n}\n\nclass NonPublic {}\n"
},
{
"path": "codebase-graph-builder/src/test/java/org/hjug/graphbuilder/visitor/testclasses/B.java",
"content": "package org.hjug.graphbuilder.visitor.testclasses;\n\npublic class B {\n\n static D invocationTest(T type) {\n return new D();\n }\n\n static class InnerB extends A {}\n}\n"
},
{
"path": "codebase-graph-builder/src/test/java/org/hjug/graphbuilder/visitor/testclasses/C.java",
"content": "package org.hjug.graphbuilder.visitor.testclasses;\n\npublic class C {}\n"
},
{
"path": "codebase-graph-builder/src/test/java/org/hjug/graphbuilder/visitor/testclasses/D.java",
"content": "package org.hjug.graphbuilder.visitor.testclasses;\n\npublic class D {}\n"
},
{
"path": "codebase-graph-builder/src/test/java/org/hjug/graphbuilder/visitor/testclasses/E.java",
"content": "package org.hjug.graphbuilder.visitor.testclasses;\n\npublic interface E {\n void foo(A a);\n}\n"
},
{
"path": "codebase-graph-builder/src/test/java/org/hjug/graphbuilder/visitor/testclasses/F.java",
"content": "package org.hjug.graphbuilder.visitor.testclasses;\n\npublic class F {}\n"
},
{
"path": "codebase-graph-builder/src/test/java/org/hjug/graphbuilder/visitor/testclasses/G.java",
"content": "package org.hjug.graphbuilder.visitor.testclasses;\n\npublic class G extends F {}\n"
},
{
"path": "codebase-graph-builder/src/test/java/org/hjug/graphbuilder/visitor/testclasses/H.java",
"content": "package org.hjug.graphbuilder.visitor.testclasses;\n\npublic class H extends B {}\n"
},
{
"path": "codebase-graph-builder/src/test/java/org/hjug/graphbuilder/visitor/testclasses/MyAnnotation.java",
"content": "package org.hjug.graphbuilder.visitor.testclasses;\n\nimport java.lang.annotation.ElementType;\nimport java.lang.annotation.Target;\n\n@Target(ElementType.TYPE_USE)\n@interface MyAnnotation {}\n"
},
{
"path": "codebase-graph-builder/src/test/java/org/hjug/graphbuilder/visitor/testclasses/MyOtherAnnotation.java",
"content": "package org.hjug.graphbuilder.visitor.testclasses;\n\nimport java.lang.annotation.ElementType;\nimport java.lang.annotation.Target;\n\n@Target(ElementType.TYPE_USE)\n@interface MyOtherAnnotation {}\n"
},
{
"path": "codebase-graph-builder/src/test/java/org/hjug/graphbuilder/visitor/testclasses/initializers/ComplexInitializerClass.java",
"content": "package org.hjug.graphbuilder.visitor.testclasses.initializers;\n\nimport java.util.concurrent.ConcurrentHashMap;\nimport java.util.concurrent.atomic.AtomicInteger;\n\npublic class ComplexInitializerClass {\n\n private static ConcurrentHashMap staticCache;\n private static AtomicInteger instanceCounter;\n\n private DataProcessor processor;\n private HelperService helper;\n\n // Static initializer with new class instantiations\n static {\n staticCache = new ConcurrentHashMap<>();\n instanceCounter = new AtomicInteger(0);\n staticCache.put(\"initialized\", \"true\");\n }\n\n // Instance initializer with dependencies\n {\n processor = new DataProcessor();\n helper = new HelperService();\n instanceCounter.incrementAndGet();\n }\n\n // Another static initializer\n static {\n staticCache.put(\"version\", \"1.0\");\n }\n\n public void process() {\n processor.execute();\n }\n\n static class DataProcessor {\n public void execute() {}\n }\n\n static class HelperService {}\n}\n"
},
{
"path": "codebase-graph-builder/src/test/java/org/hjug/graphbuilder/visitor/testclasses/initializers/InitializerBlockTestClass.java",
"content": "package org.hjug.graphbuilder.visitor.testclasses.initializers;\n\nimport java.util.ArrayList;\nimport java.util.HashMap;\nimport java.util.List;\nimport java.util.Map;\n\npublic class InitializerBlockTestClass {\n\n private List items;\n private Map counters;\n private StringBuilder builder;\n\n // Instance initializer block\n {\n items = new ArrayList<>();\n counters = new HashMap<>();\n builder = new StringBuilder(\"Initialized\");\n }\n\n // Static initializer block\n static {\n System.out.println(\"Static initializer\");\n }\n\n // Another instance initializer block with method invocations\n {\n items.add(\"default\");\n counters.put(\"default\", 0);\n builder.append(\" with defaults\");\n }\n\n public InitializerBlockTestClass() {\n // Constructor\n }\n}\n"
},
{
"path": "codebase-graph-builder/src/test/java/org/hjug/graphbuilder/visitor/testclasses/lambda/DataProcessor.java",
"content": "package org.hjug.graphbuilder.visitor.testclasses.lambda;\n\npublic class DataProcessor {\n\n public String transform(String data) {\n return data;\n }\n}\n"
},
{
"path": "codebase-graph-builder/src/test/java/org/hjug/graphbuilder/visitor/testclasses/lambda/HelperClass.java",
"content": "package org.hjug.graphbuilder.visitor.testclasses.lambda;\n\npublic class HelperClass {\n\n public String process(String input) {\n return input.toUpperCase();\n }\n\n public static String staticProcess(String input) {\n return input.toLowerCase();\n }\n}\n"
},
{
"path": "codebase-graph-builder/src/test/java/org/hjug/graphbuilder/visitor/testclasses/lambda/LambdaTestClass.java",
"content": "package org.hjug.graphbuilder.visitor.testclasses.lambda;\n\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.util.stream.Collectors;\n\npublic class LambdaTestClass {\n\n private List items = new ArrayList<>();\n private HelperClass helper = new HelperClass();\n\n public void processWithLambda() {\n // Lambda with method invocation on helper class\n items.forEach(item -> helper.process(item));\n\n // Lambda with multiple method invocations\n items.stream().map(s -> s.toUpperCase()).filter(s -> s.length() > 5).collect(Collectors.toList());\n\n // Lambda with new class instantiation - creates dependency on DataProcessor\n items.stream().map(s -> new DataProcessor().transform(s)).collect(Collectors.toList());\n\n // Lambda with new StringBuilder instantiation\n items.stream().map(s -> new StringBuilder(s)).collect(Collectors.toList());\n\n // Nested lambda\n items.stream()\n .map(s -> s.chars().mapToObj(c -> String.valueOf((char) c)).collect(Collectors.joining()))\n .collect(Collectors.toList());\n\n // Lambda with static method reference\n items.stream().map(HelperClass::staticProcess).forEach(System.out::println);\n\n // Lambda with type cast\n items.stream().map(s -> (CharSequence) s).collect(Collectors.toList());\n }\n\n public void lambdaWithLocalVariable() {\n items.forEach(item -> {\n DataProcessor processor = new DataProcessor();\n String processed = processor.transform(item);\n System.out.println(processed);\n });\n }\n}\n"
},
{
"path": "codebase-graph-builder/src/test/java/org/hjug/graphbuilder/visitor/testclasses/lambda/NestedLambdaTestClass.java",
"content": "package org.hjug.graphbuilder.visitor.testclasses.lambda;\n\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.util.stream.Collectors;\n\npublic class NestedLambdaTestClass {\n\n private List> nestedItems = new ArrayList<>();\n private HelperClass helper = new HelperClass();\n\n public void processNestedLambdas() {\n // Nested lambda with DataProcessor instantiation in inner lambda\n nestedItems.stream()\n .map(innerList -> innerList.stream()\n .map(s -> new DataProcessor().transform(s))\n .collect(Collectors.toList()))\n .collect(Collectors.toList());\n\n // Nested lambda with HelperClass method invocation in inner lambda\n nestedItems.stream()\n .flatMap(innerList -> innerList.stream().map(s -> helper.process(s)))\n .collect(Collectors.toList());\n\n // Triple nested lambda with multiple dependencies\n nestedItems.stream()\n .map(outerList -> outerList.stream()\n .map(middleItem -> middleItem\n .chars()\n .mapToObj(c -> new DataProcessor().transform(String.valueOf((char) c)))\n .collect(Collectors.joining()))\n .collect(Collectors.toList()))\n .collect(Collectors.toList());\n }\n\n public void deeplyNestedLambdaWithNewClass() {\n // Deeply nested lambda creating new instances at each level\n nestedItems.stream()\n .map(level1 -> {\n DataProcessor processor1 = new DataProcessor();\n return level1.stream()\n .map(level2 -> {\n HelperClass helper2 = new HelperClass();\n return helper2.process(processor1.transform(level2));\n })\n .collect(Collectors.toList());\n })\n .collect(Collectors.toList());\n }\n}\n"
},
{
"path": "codebase-graph-builder/src/test/java/org/hjug/graphbuilder/visitor/testclasses/methodInvocation/A.java",
"content": "package org.hjug.graphbuilder.visitor.testclasses.methodInvocation;\n\npublic class A {\n\n A doSomething() {\n B.invocationTest(new D());\n A a = B.invocationTest(new D());\n // TODO: add visitor for J.ReturnType\n return B.invocationTest(new D());\n }\n}\n"
},
{
"path": "codebase-graph-builder/src/test/java/org/hjug/graphbuilder/visitor/testclasses/methodInvocation/B.java",
"content": "package org.hjug.graphbuilder.visitor.testclasses.methodInvocation;\n\npublic class B {\n\n static A invocationTest(T type) {\n return new A();\n }\n}\n"
},
{
"path": "codebase-graph-builder/src/test/java/org/hjug/graphbuilder/visitor/testclasses/methodInvocation/C.java",
"content": "package org.hjug.graphbuilder.visitor.testclasses.methodInvocation;\n\npublic class C extends B {}\n"
},
{
"path": "codebase-graph-builder/src/test/java/org/hjug/graphbuilder/visitor/testclasses/methodInvocation/D.java",
"content": "package org.hjug.graphbuilder.visitor.testclasses.methodInvocation;\n\npublic class D extends C {}\n"
},
{
"path": "codebase-graph-builder/src/test/java/org/hjug/graphbuilder/visitor/testclasses/newClass/A.java",
"content": "package org.hjug.graphbuilder.visitor.testclasses.newClass;\n\nimport java.util.ArrayList;\nimport java.util.List;\n\npublic class A {\n\n B newClassMethod() {\n new C();\n C c = new C();\n\n // var treated like \"B\", counts as 2\n var b = new B(null);\n // <> treated like , counts as 2\n List listB = new ArrayList<>();\n\n // TODO: add visitor for J.ReturnType\n return new B(c);\n }\n}\n"
},
{
"path": "codebase-graph-builder/src/test/java/org/hjug/graphbuilder/visitor/testclasses/newClass/B.java",
"content": "package org.hjug.graphbuilder.visitor.testclasses.newClass;\n\npublic class B {\n\n public B(C c) {}\n}\n"
},
{
"path": "codebase-graph-builder/src/test/java/org/hjug/graphbuilder/visitor/testclasses/newClass/C.java",
"content": "package org.hjug.graphbuilder.visitor.testclasses.newClass;\n\npublic class C {}\n"
},
{
"path": "codebase-graph-builder/src/test/resources/javaSrcDirectory/com/ideacrest/parser/testclasses/A.java",
"content": "package com.ideacrest.parser.testclasses;\n\npublic class A {\n\tB b;\n}\n"
},
{
"path": "codebase-graph-builder/src/test/resources/javaSrcDirectory/com/ideacrest/parser/testclasses/B.java",
"content": "package com.ideacrest.parser.testclasses;\n\npublic class B {\n\tC c;\n}\n"
},
{
"path": "codebase-graph-builder/src/test/resources/javaSrcDirectory/com/ideacrest/parser/testclasses/C.java",
"content": "package com.ideacrest.parser.testclasses;\n\npublic class C {\n\tA a;\n\tE e;\n}\n"
},
{
"path": "codebase-graph-builder/src/test/resources/javaSrcDirectory/com/ideacrest/parser/testclasses/D.java",
"content": "package com.ideacrest.parser.testclasses;\n\npublic class D {\n\tA a;\n\tC c;\n}\n"
},
{
"path": "codebase-graph-builder/src/test/resources/javaSrcDirectory/com/ideacrest/parser/testclasses/E.java",
"content": "package com.ideacrest.parser.testclasses;\n\npublic class E {\n\tD d;\n\tD d2;\n}\n"
},
{
"path": "cost-benefit-calculator/pom.xml",
"content": "\n\n 4.0.0\n\n \n org.hjug.refactorfirst\n refactor-first\n 0.8.1-SNAPSHOT\n \n\n org.hjug.refactorfirst.costbenefitcalculator\n cost-benefit-calculator\n\n RefactorFirst Cost Benefit Calculator\n\n \n \n \n org.slf4j\n slf4j-api\n \n\n \n org.hjug.refactorfirst.codebasegraphbuilder\n codebase-graph-builder\n \n\n \n org.hjug.refactorfirst.changepronenessranker\n change-proneness-ranker\n \n\n \n org.hjug.refactorfirst.effortranker\n effort-ranker\n \n\n \n org.hjug.refactorfirst.dsm\n graph-algorithms\n \n\n \n org.hjug.refactorfirst.testresources\n test-resources\n \n\n \n\n"
},
{
"path": "cost-benefit-calculator/src/main/java/org/hjug/cbc/CostBenefitCalculator.java",
"content": "package org.hjug.cbc;\n\nimport static net.sourceforge.pmd.RuleViolation.CLASS_NAME;\nimport static net.sourceforge.pmd.RuleViolation.PACKAGE_NAME;\n\nimport java.io.File;\nimport java.io.IOException;\nimport java.nio.file.Files;\nimport java.nio.file.Path;\nimport java.nio.file.Paths;\nimport java.util.*;\nimport java.util.concurrent.ConcurrentHashMap;\nimport java.util.stream.Collectors;\nimport java.util.stream.Stream;\nimport lombok.extern.slf4j.Slf4j;\nimport net.sourceforge.pmd.*;\nimport net.sourceforge.pmd.lang.LanguageRegistry;\nimport org.eclipse.jgit.api.errors.GitAPIException;\nimport org.hjug.git.ChangePronenessRanker;\nimport org.hjug.git.GitLogReader;\nimport org.hjug.git.ScmLogInfo;\nimport org.hjug.metrics.*;\nimport org.hjug.metrics.rules.CBORule;\nimport org.jgrapht.Graph;\nimport org.jgrapht.graph.DefaultWeightedEdge;\n\n@Slf4j\npublic class CostBenefitCalculator implements AutoCloseable {\n\n private Report report;\n private final String repositoryPath;\n private GitLogReader gitLogReader;\n\n private final ChangePronenessRanker changePronenessRanker;\n private final Map classToSourceFilePathMapping;\n\n public CostBenefitCalculator(String repositoryPath, Map classToSourceFilePathMapping) {\n this.repositoryPath = repositoryPath;\n\n log.info(\"Initiating Cost Benefit calculation\");\n try {\n gitLogReader = new GitLogReader(new File(repositoryPath));\n } catch (IOException e) {\n log.error(\"Failure to access Git repository\", e);\n }\n\n changePronenessRanker = new ChangePronenessRanker(gitLogReader);\n this.classToSourceFilePathMapping = classToSourceFilePathMapping;\n }\n\n @Override\n public void close() throws Exception {\n gitLogReader.close();\n }\n\n // copied from PMD's PmdTaskImpl.java and modified\n public void runPmdAnalysis() throws IOException {\n PMDConfiguration configuration = new PMDConfiguration();\n\n try (PmdAnalysis pmd = PmdAnalysis.create(configuration)) {\n loadRules(pmd);\n\n try (Stream files = Files.walk(Paths.get(repositoryPath))) {\n files.filter(Files::isRegularFile).forEach(file -> pmd.files().addFile(file));\n }\n\n report = pmd.performAnalysisAndCollectReport();\n }\n }\n\n public void runPmdAnalysis(boolean excludeTests, String testSourceDirectory) throws IOException {\n PMDConfiguration configuration = new PMDConfiguration();\n\n try (PmdAnalysis pmd = PmdAnalysis.create(configuration)) {\n loadRules(pmd);\n\n try (Stream files = Files.walk(Paths.get(repositoryPath))) {\n Stream pathStream;\n if (excludeTests) {\n pathStream = files.filter(Files::isRegularFile)\n .filter(file -> !file.toString().contains(testSourceDirectory));\n } else {\n pathStream = files.filter(Files::isRegularFile);\n }\n\n pathStream.forEach(file -> pmd.files().addFile(file));\n }\n\n report = pmd.performAnalysisAndCollectReport();\n }\n }\n\n private void loadRules(PmdAnalysis pmd) {\n RuleSetLoader rulesetLoader = pmd.newRuleSetLoader();\n pmd.addRuleSets(rulesetLoader.loadRuleSetsWithoutException(List.of(\"category/java/design.xml\")));\n\n Rule cboClassRule = new CBORule();\n cboClassRule.setLanguage(LanguageRegistry.PMD.getLanguageByFullName(\"Java\"));\n pmd.addRuleSet(RuleSet.forSingleRule(cboClassRule));\n\n log.info(\"files to be scanned: \" + Paths.get(repositoryPath));\n }\n\n public List calculateGodClassCostBenefitValues() {\n List godClasses = getGodClasses();\n\n List scmLogInfos = getRankedChangeProneness(godClasses);\n\n Map rankedLogInfosByPath = getRankedLogInfosByPath(scmLogInfos);\n\n List rankedDisharmonies = godClasses.stream()\n .filter(godClass -> rankedLogInfosByPath.containsKey(godClass.getFileName()))\n .map(godClass -> new RankedDisharmony(godClass, rankedLogInfosByPath.get(godClass.getFileName())))\n .sorted(Comparator.comparing(RankedDisharmony::getRawPriority).reversed())\n .collect(Collectors.toList());\n\n int godClassPriority = 1;\n for (RankedDisharmony rankedGodClassDisharmony : rankedDisharmonies) {\n rankedGodClassDisharmony.setPriority(godClassPriority++);\n }\n\n return rankedDisharmonies;\n }\n\n private static Map getRankedLogInfosByPath(List scmLogInfos) {\n return scmLogInfos.stream().collect(Collectors.toMap(ScmLogInfo::getPath, logInfo -> logInfo, (a, b) -> b));\n }\n\n private static Map getRankedLogInfosByClass(List scmLogInfos) {\n return scmLogInfos.stream()\n .collect(Collectors.toMap(ScmLogInfo::getClassName, logInfo -> logInfo, (a, b) -> b));\n }\n\n private List getGodClasses() {\n List godClasses = new ArrayList<>();\n for (RuleViolation violation : report.getViolations()) {\n if (violation.getRule().getName().contains(\"GodClass\")) {\n GodClass godClass = new GodClass(\n violation.getAdditionalInfo().get(CLASS_NAME),\n getFileName(violation),\n violation.getAdditionalInfo().get(PACKAGE_NAME),\n violation.getDescription());\n log.info(\"God Class identified: {}\", godClass.getFileName());\n godClasses.add(godClass);\n }\n }\n\n GodClassRanker godClassRanker = new GodClassRanker();\n godClassRanker.rankGodClasses(godClasses);\n\n return godClasses;\n }\n\n public List getRankedChangeProneness(List disharmonies) {\n log.info(\"Calculating Change Proneness\");\n\n Map innerClassPaths = new ConcurrentHashMap<>();\n Map scmLogInfosByPath = new ConcurrentHashMap<>();\n\n List> scmLogInfos = disharmonies.parallelStream()\n .map(disharmony -> {\n String className = disharmony.getClassName();\n String path = null;\n ScmLogInfo scmLogInfo = null;\n try {\n if (className.contains(\"$\")\n && classToSourceFilePathMapping.containsKey(\n className.substring(0, className.indexOf(\"$\")))) {\n path = classToSourceFilePathMapping.get(className.substring(0, className.indexOf(\"$\")));\n log.debug(\"Found source file {} for nested class: {}\", path, className);\n innerClassPaths.put(className, path);\n } else {\n path = disharmony.getFileName();\n try {\n log.debug(\"Reading scmLogInfo for {}\", path);\n scmLogInfo = gitLogReader.fileLog(path);\n scmLogInfo.setClassName(className);\n log.debug(\"Successfully fetched scmLogInfo for {}\", scmLogInfo.getPath());\n scmLogInfosByPath.put(path, scmLogInfo);\n } catch (GitAPIException | IOException e) {\n log.error(\"Error reading Git repository contents.\", e);\n }\n }\n } catch (NullPointerException e) {\n // Should not be reached\n log.error(\n \"Error looking up class SCM info. If this error is encountered, \"\n + \"please log a bug on the RefactorFirst project and describe if the class is a nested class, lambda, etc. \\nClass: {}, Path: {}\",\n className,\n path,\n e);\n }\n\n Optional scmLogInfoOptional = Optional.ofNullable(scmLogInfo);\n if (scmLogInfoOptional.isEmpty()) {\n log.warn(\"No scmLogInfo found for class: {} at path: {}\", className, path);\n }\n return scmLogInfoOptional;\n })\n .collect(Collectors.toList());\n\n List> innerClassScmLogInfos = innerClassPaths.entrySet().parallelStream()\n .map(innerClassPathEntry -> {\n ScmLogInfo scmLogInfo = scmLogInfosByPath.get(innerClassPathEntry.getValue());\n\n ScmLogInfo innerClassScmLogInfo = null;\n if (scmLogInfo == null) {\n String className = innerClassPathEntry.getKey();\n String path = classToSourceFilePathMapping.get(className.substring(0, className.indexOf(\"$\")));\n log.debug(\"Reading scmLogInfo for inner class {}\", canonicaliseURIStringForRepoLookup(path));\n try {\n innerClassScmLogInfo = gitLogReader.fileLog(canonicaliseURIStringForRepoLookup(path));\n innerClassScmLogInfo.setClassName(className);\n log.debug(\n \"Successfully fetched scmLogInfo for inner class {} at {}\",\n innerClassScmLogInfo.getClassName(),\n innerClassScmLogInfo.getPath());\n scmLogInfosByPath.put(path, innerClassScmLogInfo);\n } catch (GitAPIException | IOException e) {\n log.error(\n \"Error reading Git repository contents for class {} with file path {}\",\n className,\n path,\n e);\n }\n } else {\n innerClassScmLogInfo = new ScmLogInfo(\n innerClassPathEntry.getValue(),\n innerClassPathEntry.getKey(),\n scmLogInfo.getEarliestCommit(),\n scmLogInfo.getMostRecentCommit(),\n scmLogInfo.getCommitCount());\n\n String className = innerClassPathEntry.getKey();\n innerClassScmLogInfo.setClassName(className);\n String path = classToSourceFilePathMapping.get(className.substring(0, className.indexOf(\"$\")));\n scmLogInfosByPath.put(path, innerClassScmLogInfo);\n }\n return Optional.ofNullable(innerClassScmLogInfo);\n })\n .collect(Collectors.toList());\n\n scmLogInfos.addAll(innerClassScmLogInfos);\n\n List sortedScmInfos = new ArrayList<>(scmLogInfos.stream()\n .filter(Optional::isPresent)\n .map(Optional::get)\n .collect(Collectors.toList()));\n\n changePronenessRanker.rankChangeProneness(sortedScmInfos);\n return sortedScmInfos;\n }\n\n public List calculateCBOCostBenefitValues() {\n List cboClasses = getCBOClasses();\n\n List scmLogInfos = getRankedChangeProneness(cboClasses);\n\n Map rankedLogInfosByPath = getRankedLogInfosByPath(scmLogInfos);\n for (Map.Entry stringScmLogInfoEntry : rankedLogInfosByPath.entrySet()) {\n log.debug(\n \"ScmLogInfo entry: {} path: {}\",\n stringScmLogInfoEntry.getKey(),\n stringScmLogInfoEntry.getValue().getPath());\n }\n\n List rankedDisharmonies = new ArrayList<>();\n for (CBOClass cboClass : cboClasses) {\n log.debug(\"CBO Class identified: {}\", cboClass.getFileName());\n log.debug(\n \"ScmLogInfo: {}\",\n rankedLogInfosByPath.get(cboClass.getFileName()).getPath());\n rankedDisharmonies.add(new RankedDisharmony(cboClass, rankedLogInfosByPath.get(cboClass.getFileName())));\n }\n\n rankedDisharmonies.sort(\n Comparator.comparing(RankedDisharmony::getRawPriority).reversed());\n\n int cboPriority = 1;\n for (RankedDisharmony rankedCBODisharmony : rankedDisharmonies) {\n rankedCBODisharmony.setPriority(cboPriority++);\n }\n\n return rankedDisharmonies;\n }\n\n private List getCBOClasses() {\n List cboClasses = new ArrayList<>();\n for (RuleViolation violation : report.getViolations()) {\n if (violation.getRule().getName().contains(\"CBORule\")) {\n log.info(violation.getDescription());\n CBOClass godClass = new CBOClass(\n violation.getAdditionalInfo().get(CLASS_NAME),\n getFileName(violation),\n violation.getAdditionalInfo().get(PACKAGE_NAME),\n violation.getDescription());\n log.debug(\"Highly Coupled class identified: {}\", godClass.getFileName());\n cboClasses.add(godClass);\n }\n }\n return cboClasses;\n }\n\n public List calculateSourceNodeCostBenefitValues(\n Graph classGraph,\n Map edgeSourceNodeInfos,\n Map edgeTargetNodeInfos,\n Map edgeToRemoveCycleCounts,\n Set vertexesToRemove) {\n List sourceLogInfos = getRankedChangeProneness(new ArrayList<>(edgeSourceNodeInfos.values()));\n List targetLogInfos = getRankedChangeProneness(new ArrayList<>(edgeTargetNodeInfos.values()));\n List scmLogInfos = new ArrayList<>(sourceLogInfos.size() + targetLogInfos.size());\n scmLogInfos.addAll(sourceLogInfos);\n scmLogInfos.addAll(targetLogInfos);\n\n Map sourceRankedLogInfosByPath = getRankedLogInfosByPath(scmLogInfos);\n List edgesThatNeedToBeRemoved = new ArrayList<>();\n\n for (Map.Entry entry : edgeSourceNodeInfos.entrySet()) {\n String edgeSource = classGraph.getEdgeSource(entry.getKey());\n\n String edgeSourcePath;\n if (edgeSource.contains(\"$\")) {\n edgeSourcePath = classToSourceFilePathMapping.get(edgeSource.substring(0, edgeSource.indexOf(\"$\")));\n } else {\n edgeSourcePath = classToSourceFilePathMapping.get(edgeSource);\n }\n\n String edgeTarget = classGraph.getEdgeTarget(entry.getKey());\n String edgeTargetPath;\n if (edgeTarget.contains(\"$\")) {\n edgeTargetPath = classToSourceFilePathMapping.get(edgeTarget.substring(0, edgeTarget.indexOf(\"$\")));\n } else {\n edgeTargetPath = classToSourceFilePathMapping.get(edgeTarget);\n }\n\n String sourceNodeFileName = canonicaliseURIStringForRepoLookup(edgeSourcePath);\n String targetNodeFileName = canonicaliseURIStringForRepoLookup(edgeTargetPath);\n\n boolean sourceNodeShouldBeRemoved = vertexesToRemove.contains(edgeSource);\n boolean targetNodeShouldBeRemoved = vertexesToRemove.contains(edgeTarget);\n\n ScmLogInfo sourceScmLogInfo = null;\n if (sourceRankedLogInfosByPath.containsKey(sourceNodeFileName)) {\n sourceScmLogInfo = sourceRankedLogInfosByPath.get(sourceNodeFileName);\n }\n\n ScmLogInfo targetScmLogInfo = null;\n if (sourceRankedLogInfosByPath.containsKey(sourceNodeFileName)) {\n targetScmLogInfo = sourceRankedLogInfosByPath.get(targetNodeFileName);\n }\n\n RankedDisharmony edgeThatNeedsToBeRemoved = new RankedDisharmony(\n edgeSource,\n entry.getKey(),\n edgeToRemoveCycleCounts.get(entry.getKey()),\n (int) classGraph.getEdgeWeight(entry.getKey()),\n sourceNodeShouldBeRemoved,\n targetNodeShouldBeRemoved,\n sourceScmLogInfo,\n targetScmLogInfo);\n edgesThatNeedToBeRemoved.add(edgeThatNeedsToBeRemoved);\n }\n\n sortEdgesThatNeedToBeRemoved(edgesThatNeedToBeRemoved);\n\n // Then subtract edge weight\n int rawPriority = 1;\n for (RankedDisharmony rankedDisharmony : edgesThatNeedToBeRemoved) {\n rankedDisharmony.setRawPriority(rawPriority++);\n }\n\n // Push edges with higher weights down in the priority list\n edgesThatNeedToBeRemoved.sort(Comparator.comparing(RankedDisharmony::getRawPriority));\n\n // Then set priority\n int sourceNodePriority = 1;\n for (RankedDisharmony rankedSourceNodeDisharmony : edgesThatNeedToBeRemoved) {\n rankedSourceNodeDisharmony.setPriority(sourceNodePriority++);\n }\n\n return edgesThatNeedToBeRemoved;\n }\n\n static void sortEdgesThatNeedToBeRemoved(List rankedDisharmonies) {\n // Sort by impact value\n // Order by cycle count reversed (highest count bubbles to the top)\n rankedDisharmonies.sort(Comparator.comparingInt(RankedDisharmony::getCycleCount)\n .reversed()\n // then by weight, with lowest weight edges bubbling to the top\n .thenComparingInt(RankedDisharmony::getEffortRank)\n // then by change proneness\n .thenComparingInt(rankedDisharmony -> -1 * rankedDisharmony.getChangePronenessRank())\n .thenComparingInt(rankedDisharmony -> -1 * rankedDisharmony.getEdgeTargetChangePronenessRank())\n // then if the source node is in the list of nodes to be removed\n // multiplying by -1 reverses the sort order (reverse doesn't work in chained comparators)\n .thenComparingInt(rankedDisharmony -> -1 * rankedDisharmony.getSourceNodeShouldBeRemoved())\n // then if the target node is in the list of nodes to be removed\n .thenComparingInt(rankedDisharmony -> -1 * rankedDisharmony.getTargetNodeShouldBeRemoved()));\n }\n\n private String getFileName(RuleViolation violation) {\n String uriString = violation.getFileId().getUriString();\n return canonicaliseURIStringForRepoLookup(uriString);\n }\n\n String canonicaliseURIStringForRepoLookup(String uriString) {\n if (repositoryPath.startsWith(\"/\") || repositoryPath.startsWith(\"\\\\\")) {\n return uriString.replace(\"file://\" + repositoryPath.replace(\"\\\\\", \"/\") + \"/\", \"\");\n }\n return uriString.replace(\"file:///\" + repositoryPath.replace(\"\\\\\", \"/\") + \"/\", \"\");\n }\n}\n"
},
{
"path": "cost-benefit-calculator/src/main/java/org/hjug/cbc/CycleNode.java",
"content": "package org.hjug.cbc;\n\nimport java.time.Instant;\nimport lombok.Data;\nimport org.hjug.git.ScmLogInfo;\nimport org.hjug.metrics.Disharmony;\n\n@Data\npublic class CycleNode implements Disharmony {\n\n private final String className;\n private String fileName;\n private Integer changePronenessRank;\n\n private Instant firstCommitTime;\n private Instant mostRecentCommitTime;\n private Integer commitCount;\n\n public CycleNode(String className, String fileName) {\n this.className = className;\n this.fileName = fileName;\n }\n\n public String getPackageName() {\n return className.substring(0, className.lastIndexOf('.'));\n }\n\n public void setScmLogInfo(ScmLogInfo scmLogInfo) {\n firstCommitTime = Instant.ofEpochSecond(scmLogInfo.getEarliestCommit());\n mostRecentCommitTime = Instant.ofEpochSecond(scmLogInfo.getMostRecentCommit());\n commitCount = scmLogInfo.getCommitCount();\n }\n}\n"
},
{
"path": "cost-benefit-calculator/src/main/java/org/hjug/cbc/CycleRanker.java",
"content": "package org.hjug.cbc;\n\nimport java.io.IOException;\nimport java.nio.file.Files;\nimport java.nio.file.Path;\nimport java.nio.file.Paths;\nimport java.util.*;\nimport java.util.stream.Collectors;\nimport java.util.stream.Stream;\nimport lombok.Getter;\nimport lombok.RequiredArgsConstructor;\nimport lombok.extern.slf4j.Slf4j;\nimport org.hjug.dsm.CircularReferenceChecker;\nimport org.hjug.graphbuilder.CodebaseGraphDTO;\nimport org.hjug.graphbuilder.JavaGraphBuilder;\nimport org.jgrapht.Graph;\nimport org.jgrapht.graph.AsSubgraph;\nimport org.jgrapht.graph.DefaultWeightedEdge;\n\n@RequiredArgsConstructor\n@Slf4j\npublic class CycleRanker {\n\n private final String repositoryPath;\n private final JavaGraphBuilder javaGraphBuilder = new JavaGraphBuilder();\n\n @Getter\n private Graph classReferencesGraph;\n\n @Getter\n private CodebaseGraphDTO codebaseGraphDTO;\n\n @Getter\n private Map classNamesAndPaths = new HashMap<>();\n\n @Getter\n private Map fqnsAndPaths = new HashMap<>();\n\n public void generateClassReferencesGraph(boolean excludeTests, String testSourceDirectory) {\n try {\n codebaseGraphDTO = javaGraphBuilder.getCodebaseGraphDTO(repositoryPath, excludeTests, testSourceDirectory);\n\n classReferencesGraph = codebaseGraphDTO.getClassReferencesGraph();\n\n loadClassNamesAndPaths();\n\n /*for (Map.Entry stringStringEntry : fqnsAndPaths.entrySet()) {\n log.info(stringStringEntry.getKey() + \" : \" + stringStringEntry.getValue());\n }*/\n\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n\n public List performCycleAnalysis(boolean excludeTests, String testSourceDirectory) {\n List rankedCycles = new ArrayList<>();\n try {\n boolean calculateCycleChurn = false;\n generateClassReferencesGraph(excludeTests, testSourceDirectory);\n identifyRankedCycles(rankedCycles);\n sortRankedCycles(rankedCycles, calculateCycleChurn);\n setPriorities(rankedCycles);\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n\n return rankedCycles;\n }\n\n private void identifyRankedCycles(List rankedCycles) throws IOException {\n CircularReferenceChecker circularReferenceChecker = new CircularReferenceChecker();\n Map> cycles =\n circularReferenceChecker.getCycles(classReferencesGraph);\n cycles.forEach((vertex, subGraph) -> {\n // TODO: Calculate min cuts for smaller graphs - has a runtime of O(V^4) for a graph\n /*Set minCutEdges;\n GusfieldGomoryHuCutTree gusfieldGomoryHuCutTree =\n new GusfieldGomoryHuCutTree<>(new AsUndirectedGraph<>(subGraph));\n double minCut = gusfieldGomoryHuCutTree.calculateMinCut();\n minCutEdges = gusfieldGomoryHuCutTree.getCutEdges();*/\n\n List cycleNodes = subGraph.vertexSet().stream()\n .map(classInCycle -> new CycleNode(classInCycle, classNamesAndPaths.get(classInCycle)))\n // .peek(cycleNode -> log.info(cycleNode.toString()))\n .collect(Collectors.toList());\n\n rankedCycles.add(createRankedCycle(vertex, subGraph, cycleNodes, 0.0, new HashSet<>()));\n });\n }\n\n public CycleNode classToCycleNode(String fqnClass) {\n return new CycleNode(fqnClass, fqnsAndPaths.get(fqnClass));\n }\n\n private RankedCycle createRankedCycle(\n String vertex,\n AsSubgraph subGraph,\n List cycleNodes,\n double minCut,\n Set minCutEdges) {\n\n return new RankedCycle(vertex, subGraph.vertexSet(), subGraph.edgeSet(), minCut, minCutEdges, cycleNodes);\n }\n\n private static void sortRankedCycles(List rankedCycles, boolean calculateChurnForCycles) {\n if (calculateChurnForCycles) {\n rankedCycles.sort(Comparator.comparing(RankedCycle::getAverageChangeProneness));\n\n int cpr = 1;\n for (RankedCycle rankedCycle : rankedCycles) {\n rankedCycle.setChangePronenessRank(cpr++);\n }\n } else {\n rankedCycles.sort(Comparator.comparing(RankedCycle::getRawPriority).reversed());\n }\n }\n\n private static void setPriorities(List rankedCycles) {\n int priority = 1;\n for (RankedCycle rankedCycle : rankedCycles) {\n rankedCycle.setPriority(priority++);\n }\n }\n\n void loadClassNamesAndPaths() throws IOException {\n try (Stream walk = Files.walk(Paths.get(repositoryPath))) {\n walk.forEach(path -> {\n String filename = path.getFileName().toString();\n if (filename.endsWith(\".java\")) {\n // extract package and class name\n String packageName = getPackageName(path);\n String uriString = path.toUri().toString();\n String className = getClassName(filename);\n String canonicalUri = canonicaliseURIStringForRepoLookup(uriString);\n fqnsAndPaths.put(packageName + \".\" + className, canonicalUri);\n classNamesAndPaths.put(className, canonicalUri);\n }\n });\n }\n }\n\n private static String getPackageName(Path path) {\n try {\n return Files.readAllLines(path).stream()\n .filter(line -> line.startsWith(\"package\"))\n .map(line -> line.replace(\"package\", \"\").replace(\";\", \"\").trim())\n .findFirst()\n .orElse(\"\");\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n }\n\n private String canonicaliseURIStringForRepoLookup(String uriString) {\n if (repositoryPath.startsWith(\"/\") || repositoryPath.startsWith(\"\\\\\")) {\n return uriString.replace(\"file://\" + repositoryPath.replace(\"\\\\\", \"/\") + \"/\", \"\");\n }\n return uriString.replace(\"file:///\" + repositoryPath.replace(\"\\\\\", \"/\") + \"/\", \"\");\n }\n\n /**\n * Extract class name from java file name\n * Example : MyJavaClass.java becomes MyJavaClass\n *\n * @param javaFileName\n * @return\n */\n private String getClassName(String javaFileName) {\n return javaFileName.substring(0, javaFileName.indexOf('.'));\n }\n}\n"
},
{
"path": "cost-benefit-calculator/src/main/java/org/hjug/cbc/RankedCycle.java",
"content": "package org.hjug.cbc;\n\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.Set;\nimport lombok.Data;\nimport lombok.extern.slf4j.Slf4j;\nimport org.jgrapht.graph.DefaultWeightedEdge;\n\n@Data\n@Slf4j\npublic class RankedCycle {\n\n private final String cycleName;\n private Integer changePronenessRankSum = 0;\n\n private final Set vertexSet;\n private final Set edgeSet;\n private final double minCutCount;\n private final Set minCutEdges;\n private final List cycleNodes;\n\n private float rawPriority;\n private Integer priority = 0;\n private float averageChangeProneness;\n private Integer changePronenessRank = 0;\n private float impact;\n\n public RankedCycle(\n String cycleName,\n Set vertexSet,\n Set edgeSet,\n double minCutCount,\n Set minCutEdges,\n List cycleNodes) {\n this.cycleNodes = cycleNodes;\n this.cycleName = cycleName;\n this.vertexSet = vertexSet;\n this.edgeSet = edgeSet;\n this.minCutCount = minCutCount;\n\n if (null == minCutEdges) {\n this.minCutEdges = new HashSet<>();\n } else {\n this.minCutEdges = minCutEdges;\n }\n\n if (minCutCount == 0.0) {\n this.impact = (float) (vertexSet.size());\n } else {\n this.impact = (float) (vertexSet.size() / minCutCount);\n }\n\n this.rawPriority = this.impact;\n }\n\n public RankedCycle(\n String cycleName,\n Integer changePronenessRankSum,\n Set vertexSet,\n Set edgeSet,\n double minCutCount,\n Set minCutEdges,\n List cycleNodes) {\n this.cycleNodes = cycleNodes;\n this.cycleName = cycleName;\n this.changePronenessRankSum = changePronenessRankSum;\n this.vertexSet = vertexSet;\n this.edgeSet = edgeSet;\n this.minCutCount = minCutCount;\n\n if (null == minCutEdges) {\n this.minCutEdges = new HashSet<>();\n } else {\n this.minCutEdges = minCutEdges;\n }\n\n if (minCutCount == 0.0) {\n this.impact = (float) (vertexSet.size());\n } else {\n this.impact = (float) (vertexSet.size() / minCutCount);\n }\n\n this.averageChangeProneness = (float) changePronenessRankSum / vertexSet.size();\n this.rawPriority = this.impact + averageChangeProneness;\n }\n}\n"
},
{
"path": "cost-benefit-calculator/src/main/java/org/hjug/cbc/RankedDisharmony.java",
"content": "package org.hjug.cbc;\n\nimport java.nio.file.Paths;\nimport java.time.Instant;\nimport lombok.Data;\nimport org.hjug.git.ScmLogInfo;\nimport org.hjug.metrics.CBOClass;\nimport org.hjug.metrics.GodClass;\nimport org.jgrapht.graph.DefaultWeightedEdge;\n\n@Data\npublic class RankedDisharmony {\n\n private Instant firstCommitTime;\n private Instant mostRecentCommitTime;\n private Integer commitCount;\n\n private String path;\n private String fileName;\n private final String className;\n private final Integer effortRank;\n private final Integer changePronenessRank;\n private Integer rawPriority;\n private Integer priority = 0;\n\n private Integer wmc;\n private Integer wmcRank;\n private Integer atfd;\n private Integer atfdRank;\n private Float tcc;\n private Integer tccRank;\n\n private DefaultWeightedEdge edge;\n private Integer cycleCount;\n private int sourceNodeShouldBeRemoved;\n private int targetNodeShouldBeRemoved;\n private String edgeTargetClass;\n private Integer edgeTargetChangePronenessRank;\n\n public RankedDisharmony(GodClass godClass, ScmLogInfo scmLogInfo) {\n path = scmLogInfo.getPath();\n // from https://stackoverflow.com/questions/1011287/get-file-name-from-a-file-location-in-java\n fileName = Paths.get(path).getFileName().toString();\n className = godClass.getClassName();\n changePronenessRank = scmLogInfo.getChangePronenessRank();\n effortRank = godClass.getOverallRank();\n rawPriority = changePronenessRank - effortRank;\n\n wmc = godClass.getWmc();\n wmcRank = godClass.getWmcRank();\n atfd = godClass.getAtfd();\n atfdRank = godClass.getAtfdRank();\n tcc = godClass.getTcc();\n tccRank = godClass.getTccRank();\n\n firstCommitTime = Instant.ofEpochSecond(scmLogInfo.getEarliestCommit());\n mostRecentCommitTime = Instant.ofEpochSecond(scmLogInfo.getMostRecentCommit());\n commitCount = scmLogInfo.getCommitCount();\n }\n\n public RankedDisharmony(CBOClass cboClass, ScmLogInfo scmLogInfo) {\n path = scmLogInfo.getPath();\n // from https://stackoverflow.com/questions/1011287/get-file-name-from-a-file-location-in-java\n fileName = Paths.get(path).getFileName().toString();\n className = cboClass.getClassName();\n changePronenessRank = scmLogInfo.getChangePronenessRank();\n effortRank = cboClass.getCouplingCount();\n rawPriority = changePronenessRank - effortRank;\n\n firstCommitTime = Instant.ofEpochSecond(scmLogInfo.getEarliestCommit());\n mostRecentCommitTime = Instant.ofEpochSecond(scmLogInfo.getMostRecentCommit());\n commitCount = scmLogInfo.getCommitCount();\n }\n\n public RankedDisharmony(\n String edgeSource,\n DefaultWeightedEdge edge,\n int cycleCount,\n int weight,\n boolean sourceNodeShouldBeRemoved,\n boolean targetNodeShouldBeRemoved,\n ScmLogInfo sourceScmLogInfo,\n ScmLogInfo targetScmLogInfo) {\n\n if (null != sourceScmLogInfo) {\n path = sourceScmLogInfo.getPath();\n // from https://stackoverflow.com/questions/1011287/get-file-name-from-a-file-location-in-java\n fileName = Paths.get(path).getFileName().toString();\n firstCommitTime = Instant.ofEpochSecond(sourceScmLogInfo.getEarliestCommit());\n mostRecentCommitTime = Instant.ofEpochSecond(sourceScmLogInfo.getMostRecentCommit());\n commitCount = sourceScmLogInfo.getCommitCount();\n }\n\n className = edgeSource;\n this.edge = edge;\n this.cycleCount = cycleCount;\n changePronenessRank = null == sourceScmLogInfo ? 0 : sourceScmLogInfo.getChangePronenessRank();\n edgeTargetChangePronenessRank = null == targetScmLogInfo ? 0 : targetScmLogInfo.getChangePronenessRank();\n effortRank = weight;\n this.sourceNodeShouldBeRemoved = sourceNodeShouldBeRemoved ? 1 : 0;\n this.targetNodeShouldBeRemoved = targetNodeShouldBeRemoved ? 1 : 0;\n }\n}\n"
},
{
"path": "cost-benefit-calculator/src/test/java/org/hjug/cbc/CostBenefitCalculatorTest.java",
"content": "package org.hjug.cbc;\n\nimport static java.nio.charset.StandardCharsets.UTF_8;\n\nimport java.io.*;\nimport java.util.*;\nimport org.eclipse.jgit.api.Git;\nimport org.eclipse.jgit.api.errors.GitAPIException;\nimport org.eclipse.jgit.lib.Repository;\nimport org.eclipse.jgit.revwalk.RevCommit;\nimport org.hjug.git.ScmLogInfo;\nimport org.hjug.metrics.Disharmony;\nimport org.jetbrains.annotations.NotNull;\nimport org.jgrapht.graph.DefaultWeightedEdge;\nimport org.jgrapht.graph.SimpleDirectedWeightedGraph;\nimport org.junit.jupiter.api.*;\nimport org.junit.jupiter.api.io.TempDir;\n\nclass CostBenefitCalculatorTest {\n\n @TempDir\n public File tempFolder;\n\n private String faceletsPath = \"org/apache/myfaces/tobago/facelets/\";\n private String hudsonPath = \"hudson/model/\";\n private Git git;\n private Repository repository;\n\n @BeforeEach\n public void setUp() throws GitAPIException {\n git = Git.init().setDirectory(tempFolder).call();\n repository = git.getRepository();\n new File(tempFolder.getPath() + \"/\" + faceletsPath).mkdirs();\n new File(tempFolder.getPath() + \"/\" + hudsonPath).mkdirs();\n }\n\n @AfterEach\n public void tearDown() {\n repository.close();\n }\n\n @Test\n void testCBOViolation() throws IOException, GitAPIException, InterruptedException {\n // Has CBO violation\n String user = \"User.java\";\n InputStream userResourceAsStream = getClass().getClassLoader().getResourceAsStream(hudsonPath + user);\n writeFile(hudsonPath + user, convertInputStreamToString(userResourceAsStream));\n\n git.add().addFilepattern(\".\").call();\n RevCommit firstCommit = git.commit().setMessage(\"message\").call();\n\n CostBenefitCalculator costBenefitCalculator =\n new CostBenefitCalculator(git.getRepository().getDirectory().getParent(), new HashMap<>());\n costBenefitCalculator.runPmdAnalysis();\n List disharmonies = costBenefitCalculator.calculateCBOCostBenefitValues();\n\n Assertions.assertFalse(disharmonies.isEmpty());\n }\n\n @Test\n void testCostBenefitCalculation() throws IOException, GitAPIException, InterruptedException {\n\n String attributeHandler = \"AttributeHandler.java\";\n InputStream resourceAsStream = getClass().getClassLoader().getResourceAsStream(faceletsPath + attributeHandler);\n writeFile(faceletsPath + attributeHandler, convertInputStreamToString(resourceAsStream));\n\n git.add().addFilepattern(\".\").call();\n RevCommit firstCommit = git.commit().setMessage(\"message\").call();\n\n // Sleeping for one second to guarantee commits have different time stamps\n Thread.sleep(1000);\n\n // write contents of updated file to original file\n InputStream resourceAsStream2 =\n getClass().getClassLoader().getResourceAsStream(faceletsPath + \"AttributeHandler2.java\");\n writeFile(faceletsPath + attributeHandler, convertInputStreamToString(resourceAsStream2));\n\n InputStream resourceAsStream3 =\n getClass().getClassLoader().getResourceAsStream(faceletsPath + \"AttributeHandlerAndSorter.java\");\n writeFile(faceletsPath + \"AttributeHandlerAndSorter.java\", convertInputStreamToString(resourceAsStream3));\n\n git.add().addFilepattern(\".\").call();\n RevCommit secondCommit = git.commit().setMessage(\"message\").call();\n\n CostBenefitCalculator costBenefitCalculator =\n new CostBenefitCalculator(git.getRepository().getDirectory().getParent(), new HashMap<>());\n costBenefitCalculator.runPmdAnalysis();\n List disharmonies = costBenefitCalculator.calculateGodClassCostBenefitValues();\n\n Assertions.assertEquals(1, disharmonies.get(0).getRawPriority().intValue());\n Assertions.assertEquals(1, disharmonies.get(1).getRawPriority().intValue());\n\n Assertions.assertEquals(1, disharmonies.get(0).getPriority().intValue());\n Assertions.assertEquals(2, disharmonies.get(1).getPriority().intValue());\n }\n\n @Test\n void calculateSourceNodeCostBenefitValues_filtersMissingLogInfoAndAssignsPriority() throws Exception {\n\n writeFile(hudsonPath + \"Dummy.java\", \"public class Dummy {}\");\n\n git.add().addFilepattern(\".\").call();\n git.commit().setMessage(\"initial commit\").call();\n\n SimpleDirectedWeightedGraph classGraph =\n new SimpleDirectedWeightedGraph<>(DefaultWeightedEdge.class);\n\n classGraph.addVertex(\"ClassA\");\n classGraph.addVertex(\"ClassB\");\n classGraph.addVertex(\"ClassC\");\n classGraph.addVertex(\"ClassD\");\n classGraph.addVertex(\"ClassE\");\n classGraph.addVertex(\"ClassF\");\n\n DefaultWeightedEdge edge1 = classGraph.addEdge(\"ClassA\", \"ClassB\");\n classGraph.setEdgeWeight(edge1, 4);\n\n DefaultWeightedEdge edge2 = classGraph.addEdge(\"ClassC\", \"ClassD\");\n classGraph.setEdgeWeight(edge2, 2);\n\n Map edgeSourceNodeInfos = new HashMap<>();\n edgeSourceNodeInfos.put(edge1, new CycleNode(\"ClassA\", hudsonPath + \"ClassA.java\"));\n edgeSourceNodeInfos.put(edge2, new CycleNode(\"ClassC\", hudsonPath + \"ClassC.java\"));\n\n Map edgeTargeteNodeInfos = new HashMap<>();\n edgeTargeteNodeInfos.put(edge1, new CycleNode(\"ClassB\", hudsonPath + \"ClassB.java\"));\n edgeTargeteNodeInfos.put(edge2, new CycleNode(\"ClassD\", hudsonPath + \"ClassD.java\"));\n\n Map edgeToRemoveCycleCounts = new HashMap<>();\n edgeToRemoveCycleCounts.put(edge1, 5);\n edgeToRemoveCycleCounts.put(edge2, 3);\n\n Set vertexesToRemove = new HashSet<>(Arrays.asList(\"ClassA\", \"ClassD\"));\n\n ScmLogInfo scmLogInfo1 = new ScmLogInfo(hudsonPath + \"ClassA.java\", null, 1, 2, 3);\n scmLogInfo1.setChangePronenessRank(4);\n\n ScmLogInfo scmLogInfo2 = new ScmLogInfo(hudsonPath + \"ClassC.java\", null, 1, 2, 5);\n scmLogInfo2.setChangePronenessRank(7);\n\n List scmLogInfos = Arrays.asList(scmLogInfo1, scmLogInfo2);\n\n try (TestableCostBenefitCalculator costBenefitCalculator = new TestableCostBenefitCalculator(\n git.getRepository().getDirectory().getParent(), scmLogInfos)) {\n\n List disharmonies = costBenefitCalculator.calculateSourceNodeCostBenefitValues(\n classGraph, edgeTargeteNodeInfos, edgeTargeteNodeInfos, edgeToRemoveCycleCounts, vertexesToRemove);\n\n Assertions.assertEquals(2, disharmonies.size());\n\n RankedDisharmony classA = disharmonies.get(0);\n Assertions.assertEquals(\"ClassA\", classA.getClassName());\n Assertions.assertEquals(5, classA.getCycleCount().intValue());\n Assertions.assertEquals(4, classA.getEffortRank().intValue());\n Assertions.assertEquals(1, classA.getSourceNodeShouldBeRemoved());\n Assertions.assertEquals(0, classA.getTargetNodeShouldBeRemoved());\n Assertions.assertEquals(1, classA.getPriority().intValue());\n\n RankedDisharmony classC = disharmonies.get(1);\n Assertions.assertEquals(\"ClassC\", classC.getClassName());\n Assertions.assertEquals(3, classC.getCycleCount().intValue());\n Assertions.assertEquals(2, classC.getEffortRank().intValue());\n Assertions.assertEquals(0, classC.getSourceNodeShouldBeRemoved());\n Assertions.assertEquals(1, classC.getTargetNodeShouldBeRemoved());\n Assertions.assertEquals(2, classC.getPriority().intValue());\n Assertions.assertEquals(7, classC.getChangePronenessRank());\n }\n }\n\n @Test\n void calculateSourceNodeCostBenefitValues_prefersHigherChangePronenessRank() throws Exception {\n\n writeFile(faceletsPath + \"Placeholder.java\", \"public class Placeholder {}\");\n\n git.add().addFilepattern(\".\").call();\n git.commit().setMessage(\"initial commit\").call();\n\n SimpleDirectedWeightedGraph classGraph =\n new SimpleDirectedWeightedGraph<>(DefaultWeightedEdge.class);\n\n classGraph.addVertex(\"Alpha\");\n classGraph.addVertex(\"Beta\");\n classGraph.addVertex(\"Gamma\");\n\n DefaultWeightedEdge edge1 = classGraph.addEdge(\"Alpha\", \"Beta\");\n classGraph.setEdgeWeight(edge1, 3);\n\n DefaultWeightedEdge edge2 = classGraph.addEdge(\"Gamma\", \"Beta\");\n classGraph.setEdgeWeight(edge2, 3);\n\n Map edgeSourceNodeInfos = new HashMap<>();\n edgeSourceNodeInfos.put(edge1, new CycleNode(\"Alpha\", faceletsPath + \"Alpha.java\"));\n edgeSourceNodeInfos.put(edge2, new CycleNode(\"Gamma\", faceletsPath + \"Gamma.java\"));\n\n Map edgeTargetNodeInfos = new HashMap<>();\n edgeTargetNodeInfos.put(edge1, new CycleNode(\"Beta\", faceletsPath + \"Beta.java\"));\n\n Map edgeToRemoveCycleCounts = new HashMap<>();\n edgeToRemoveCycleCounts.put(edge1, 4);\n edgeToRemoveCycleCounts.put(edge2, 4);\n\n Set vertexesToRemove = new HashSet<>(Arrays.asList(\"Alpha\", \"Gamma\"));\n\n ScmLogInfo scmLogInfo1 = new ScmLogInfo(faceletsPath + \"Alpha.java\", null, 2, 3, 1);\n scmLogInfo1.setChangePronenessRank(2);\n\n ScmLogInfo scmLogInfo2 = new ScmLogInfo(faceletsPath + \"Gamma.java\", null, 2, 3, 1);\n scmLogInfo2.setChangePronenessRank(8);\n\n List scmLogInfos = Arrays.asList(scmLogInfo1, scmLogInfo2);\n\n try (TestableCostBenefitCalculator costBenefitCalculator = new TestableCostBenefitCalculator(\n git.getRepository().getDirectory().getParent(), scmLogInfos)) {\n\n List disharmonies = costBenefitCalculator.calculateSourceNodeCostBenefitValues(\n classGraph, edgeSourceNodeInfos, edgeTargetNodeInfos, edgeToRemoveCycleCounts, vertexesToRemove);\n\n Assertions.assertEquals(2, disharmonies.size());\n Assertions.assertEquals(8, disharmonies.get(0).getChangePronenessRank());\n Assertions.assertEquals(1, disharmonies.get(0).getPriority().intValue());\n Assertions.assertEquals(2, disharmonies.get(1).getPriority().intValue());\n Assertions.assertEquals(2, disharmonies.get(1).getChangePronenessRank());\n }\n }\n\n @Test\n void sortEdgesThatNeedToBeRemoved_sortsByMultipleCriteria() {\n // Create ScmLogInfo objects for testing\n ScmLogInfo logInfo1 = new ScmLogInfo(\"path1.java\", null, 1, 2, 3);\n logInfo1.setChangePronenessRank(5);\n\n ScmLogInfo logInfo2 = new ScmLogInfo(\"path2.java\", null, 1, 2, 3);\n logInfo2.setChangePronenessRank(3);\n\n ScmLogInfo logInfo3 = new ScmLogInfo(\"path3.java\", null, 1, 2, 3);\n logInfo3.setChangePronenessRank(8);\n\n ScmLogInfo logInfo4 = new ScmLogInfo(\"path4.java\", null, 1, 2, 3);\n logInfo4.setChangePronenessRank(2);\n\n ScmLogInfo logInfo5 = new ScmLogInfo(\"path4.java\", null, 1, 2, 3);\n logInfo5.setChangePronenessRank(5);\n\n // Create RankedDisharmony objects with different combinations\n // Expected order after sorting: cycleCount desc, then sourceRemoved desc, then targetRemoved desc, then\n // changeProneness desc\n // cycle=5, source=0, target=0, change=5\n RankedDisharmony disharmony1 = new RankedDisharmony(\n \"Class1\", new org.jgrapht.graph.DefaultWeightedEdge(), 5, 1, false, false, logInfo1, null);\n\n // cycle=5, source=1, target=0, change=3\n RankedDisharmony disharmony2 = new RankedDisharmony(\n \"Class2\", new org.jgrapht.graph.DefaultWeightedEdge(), 5, 1, true, false, logInfo2, null);\n\n // cycle=3, source=0, target=1, change=8\n RankedDisharmony disharmony3 = new RankedDisharmony(\n \"Class3\", new org.jgrapht.graph.DefaultWeightedEdge(), 3, 1, false, true, logInfo3, null);\n\n // cycle=3, source=0, target=0, change=2\n RankedDisharmony disharmony4 = new RankedDisharmony(\n \"Class4\", new org.jgrapht.graph.DefaultWeightedEdge(), 3, 1, false, false, logInfo4, null);\n\n // cycle=3, source=0, target=0, change=5\n RankedDisharmony disharmony5 = new RankedDisharmony(\n \"Class5\", new org.jgrapht.graph.DefaultWeightedEdge(), 3, 1, false, false, logInfo5, null);\n\n List disharmonies =\n Arrays.asList(disharmony4, disharmony2, disharmony1, disharmony3, disharmony5);\n\n // Sort the list\n CostBenefitCalculator.sortEdgesThatNeedToBeRemoved(disharmonies);\n\n // Verify the order\n // Order by cycle count reversed (highest count bubbles to the top)\n // then Order by source node removed (source nodes needing to be removed bubble to the top)\n // then Order by target node removed (target nodes needing to be removed bubble to the top)\\\n // then Order by change proneness (highest change proneness bubbles to the top)\n for (RankedDisharmony disharmony : disharmonies) {\n System.out.println(disharmony.getClassName() + \" \"\n + disharmony.getCycleCount() + \" \"\n + disharmony.getEffortRank() + \" \"\n + disharmony.getSourceNodeShouldBeRemoved() + \" \"\n + disharmony.getTargetNodeShouldBeRemoved() + \" \"\n + disharmony.getChangePronenessRank());\n }\n\n RankedDisharmony orderedDisharmony0 = disharmonies.get(0);\n Assertions.assertEquals(\"Class1\", orderedDisharmony0.getClassName());\n Assertions.assertEquals(5, orderedDisharmony0.getCycleCount().intValue());\n Assertions.assertEquals(1, orderedDisharmony0.getEffortRank().intValue());\n Assertions.assertEquals(0, orderedDisharmony0.getSourceNodeShouldBeRemoved());\n Assertions.assertEquals(0, orderedDisharmony0.getTargetNodeShouldBeRemoved());\n Assertions.assertEquals(5, orderedDisharmony0.getChangePronenessRank());\n\n RankedDisharmony orderedDisharmony1 = disharmonies.get(1);\n Assertions.assertEquals(\"Class2\", orderedDisharmony1.getClassName());\n Assertions.assertEquals(5, orderedDisharmony1.getCycleCount().intValue());\n Assertions.assertEquals(1, orderedDisharmony1.getEffortRank().intValue());\n Assertions.assertEquals(1, orderedDisharmony1.getSourceNodeShouldBeRemoved());\n Assertions.assertEquals(0, orderedDisharmony1.getTargetNodeShouldBeRemoved());\n Assertions.assertEquals(3, orderedDisharmony1.getChangePronenessRank());\n\n RankedDisharmony orderedDisharmony2 = disharmonies.get(2);\n Assertions.assertEquals(\"Class3\", orderedDisharmony2.getClassName());\n Assertions.assertEquals(3, orderedDisharmony2.getCycleCount().intValue());\n Assertions.assertEquals(1, orderedDisharmony2.getEffortRank().intValue());\n Assertions.assertEquals(0, orderedDisharmony2.getSourceNodeShouldBeRemoved());\n Assertions.assertEquals(1, orderedDisharmony2.getTargetNodeShouldBeRemoved());\n Assertions.assertEquals(8, orderedDisharmony2.getChangePronenessRank());\n\n RankedDisharmony orderedDisharmony3 = disharmonies.get(3);\n Assertions.assertEquals(\"Class5\", orderedDisharmony3.getClassName());\n Assertions.assertEquals(3, orderedDisharmony3.getCycleCount().intValue());\n Assertions.assertEquals(1, orderedDisharmony3.getEffortRank().intValue());\n Assertions.assertEquals(0, orderedDisharmony3.getSourceNodeShouldBeRemoved());\n Assertions.assertEquals(0, orderedDisharmony3.getTargetNodeShouldBeRemoved());\n Assertions.assertEquals(5, orderedDisharmony3.getChangePronenessRank());\n\n RankedDisharmony orderedDisharmony4 = disharmonies.get(4);\n Assertions.assertEquals(\"Class4\", orderedDisharmony4.getClassName());\n Assertions.assertEquals(1, orderedDisharmony4.getEffortRank().intValue());\n Assertions.assertEquals(3, orderedDisharmony4.getCycleCount().intValue());\n Assertions.assertEquals(0, orderedDisharmony4.getSourceNodeShouldBeRemoved());\n Assertions.assertEquals(0, orderedDisharmony4.getTargetNodeShouldBeRemoved());\n Assertions.assertEquals(2, orderedDisharmony4.getChangePronenessRank());\n }\n\n private void writeFile(String name, String content) throws IOException {\n // Files.writeString(Path.of(git.getRepository().getWorkTree().getPath()), content);\n File file = new File(git.getRepository().getWorkTree(), name);\n\n try (FileOutputStream outputStream = new FileOutputStream(file)) {\n outputStream.write(content.getBytes(UTF_8));\n }\n }\n\n private String convertInputStreamToString(InputStream inputStream) throws IOException {\n ByteArrayOutputStream result = new ByteArrayOutputStream();\n byte[] buffer = new byte[1024];\n int length;\n while ((length = inputStream.read(buffer)) != -1) {\n result.write(buffer, 0, length);\n }\n return result.toString(\"UTF-8\");\n }\n\n private static class TestableCostBenefitCalculator extends CostBenefitCalculator {\n\n private final List scmLogInfos;\n\n TestableCostBenefitCalculator(String repositoryPath, List scmLogInfos) {\n super(repositoryPath, getClassToSourceFilePathMapping());\n this.scmLogInfos = scmLogInfos;\n }\n\n private static @NotNull Map getClassToSourceFilePathMapping() {\n Map classToSourceFilePathMapping = new HashMap<>();\n classToSourceFilePathMapping.put(\"Alpha\", \"org/apache/myfaces/tobago/facelets/Alpha.java\");\n classToSourceFilePathMapping.put(\"Beta\", \"org/apache/myfaces/tobago/facelets/Beta.java\");\n classToSourceFilePathMapping.put(\"Gamma\", \"org/apache/myfaces/tobago/facelets/Gamma.java\");\n classToSourceFilePathMapping.put(\"ClassA\", \"hudson/model/ClassA.java\");\n classToSourceFilePathMapping.put(\"ClassB\", \"hudson/model/ClassB.java\");\n classToSourceFilePathMapping.put(\"ClassC\", \"hudson/model/ClassC.java\");\n classToSourceFilePathMapping.put(\"ClassD\", \"hudson/model/ClassD.java\");\n return classToSourceFilePathMapping;\n }\n\n @Override\n public List getRankedChangeProneness(List