natas_hw
/
UMLGraph
mirror of https://github.com/dspinellis/UMLGraph
0
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Trivial simplification.

This commit is contained in:
Erich Schubert 2018-10-27 12:27:03 +02:00
parent fc1b199daf
commit 141c8a9353
2 changed files with 8 additions and 29 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

23
src/main/java/org/umlgraph/doclet/ClassGraph.java
View File

@ -717,17 +717,6 @@ class ClassGraph {
} }
} }
/**
* Prints associations recovered from the fields of a class. An association is inferred only
* if another relation between the two classes is not already in the graph.
* @param classes
*/
public void printInferredRelations(ClassDoc[] classes) {
for (ClassDoc c : classes) {
printInferredRelations(c);
}
}
/** /**
* Prints associations recovered from the fields of a class. An association is inferred only * Prints associations recovered from the fields of a class. An association is inferred only
* if another relation between the two classes is not already in the graph. * if another relation between the two classes is not already in the graph.
@ -766,18 +755,6 @@ class ClassGraph {
} }
} }
/**
* Prints dependencies recovered from the methods of a class. A
* dependency is inferred only if another relation between the two
* classes is not already in the graph.
* @param classes
*/
public void printInferredDependencies(ClassDoc[] classes) {
for (ClassDoc c : classes) {
printInferredDependencies(c);
}
}
/** Returns an array representing the imported classes of c. /** Returns an array representing the imported classes of c.
* Disables the deprecation warning, which is output, because the * Disables the deprecation warning, which is output, because the
* imported classed are an implementation detail. * imported classed are an implementation detail.

14
src/main/java/org/umlgraph/doclet/UmlGraph.java
View File

@ -113,14 +113,16 @@ public class UmlGraph {
ClassGraph c = new ClassGraph(root, op, contextDoc); ClassGraph c = new ClassGraph(root, op, contextDoc);
c.prologue(); c.prologue();
for (int i = 0; i < classes.length; i++) for (ClassDoc cd : classes)
c.printClass(classes[i], true); c.printClass(cd, true);
for (int i = 0; i < classes.length; i++) for (ClassDoc cd : classes)
c.printRelations(classes[i]); c.printRelations(cd);
if(opt.inferRelationships) if(opt.inferRelationships)
c.printInferredRelations(classes); for (ClassDoc cd : classes)
c.printInferredRelations(cd);
if(opt.inferDependencies) if(opt.inferDependencies)
c.printInferredDependencies(classes); for (ClassDoc cd : classes)
c.printInferredDependencies(cd);
c.printExtraClasses(root); c.printExtraClasses(root);
c.epilogue(); c.epilogue();