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

Added prologue and epilogue.

This commit is contained in:
Diomidis Spinellis 2002-07-19 12:06:44 +00:00
parent 3c15106e73
commit 802e656e0d
10 changed files with 310 additions and 90 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

40
src/gr/spinellis/umlgraph/doclet/ClassGraph.java
View File

@ -20,14 +20,36 @@
import com.sun.javadoc.*;
public class UmlGraph {
public static boolean start(RootDoc root) {
ClassDoc[] classes = root.classes();
for (int i = 0; i < classes.length; i++) {
ClassDoc c = classes[i];
System.out.println(classes[i]);
}
return true;
class ClassGraph {
private ClassDoc c;
ClassGraph(ClassDoc ic) { c = ic; }
public void print() {
System.out.println(c);
}
}
public class UmlGraph {
public static boolean start(RootDoc root) {
prologue();
ClassDoc[] classes = root.classes();
for (int i = 0; i < classes.length; i++) {
ClassGraph c = new ClassGraph(classes[i]);
c.print();
}
epilogue();
return true;
}
private static void prologue() {
System.out.println(
"#!/usr/local/bin/dot\n" +
"#\n" +
"# Class hirerarchy\n" +
"#\n\n" +
"digraph G {\n" +
"\tnode [fontname=\"Helvetica\",fontsize=8,shape=record];"
);
}
private static void epilogue() {
System.out.println("}\n");
}
}

40
src/gr/spinellis/umlgraph/doclet/ClassInfo.java
View File

@ -20,14 +20,36 @@
import com.sun.javadoc.*;
public class UmlGraph {
public static boolean start(RootDoc root) {
ClassDoc[] classes = root.classes();
for (int i = 0; i < classes.length; i++) {
ClassDoc c = classes[i];
System.out.println(classes[i]);
}
return true;
class ClassGraph {
private ClassDoc c;
ClassGraph(ClassDoc ic) { c = ic; }
public void print() {
System.out.println(c);
}
}
public class UmlGraph {
public static boolean start(RootDoc root) {
prologue();
ClassDoc[] classes = root.classes();
for (int i = 0; i < classes.length; i++) {
ClassGraph c = new ClassGraph(classes[i]);
c.print();
}
epilogue();
return true;
}
private static void prologue() {
System.out.println(
"#!/usr/local/bin/dot\n" +
"#\n" +
"# Class hirerarchy\n" +
"#\n\n" +
"digraph G {\n" +
"\tnode [fontname=\"Helvetica\",fontsize=8,shape=record];"
);
}
private static void epilogue() {
System.out.println("}\n");
}
}

40
src/gr/spinellis/umlgraph/doclet/Options.java
View File

@ -20,14 +20,36 @@
import com.sun.javadoc.*;
public class UmlGraph {
public static boolean start(RootDoc root) {
ClassDoc[] classes = root.classes();
for (int i = 0; i < classes.length; i++) {
ClassDoc c = classes[i];
System.out.println(classes[i]);
}
return true;
class ClassGraph {
private ClassDoc c;
ClassGraph(ClassDoc ic) { c = ic; }
public void print() {
System.out.println(c);
}
}
public class UmlGraph {
public static boolean start(RootDoc root) {
prologue();
ClassDoc[] classes = root.classes();
for (int i = 0; i < classes.length; i++) {
ClassGraph c = new ClassGraph(classes[i]);
c.print();
}
epilogue();
return true;
}
private static void prologue() {
System.out.println(
"#!/usr/local/bin/dot\n" +
"#\n" +
"# Class hirerarchy\n" +
"#\n\n" +
"digraph G {\n" +
"\tnode [fontname=\"Helvetica\",fontsize=8,shape=record];"
);
}
private static void epilogue() {
System.out.println("}\n");
}
}

40
src/gr/spinellis/umlgraph/doclet/StringUtil.java
View File

@ -20,14 +20,36 @@
import com.sun.javadoc.*;
public class UmlGraph {
public static boolean start(RootDoc root) {
ClassDoc[] classes = root.classes();
for (int i = 0; i < classes.length; i++) {
ClassDoc c = classes[i];
System.out.println(classes[i]);
}
return true;
class ClassGraph {
private ClassDoc c;
ClassGraph(ClassDoc ic) { c = ic; }
public void print() {
System.out.println(c);
}
}
public class UmlGraph {
public static boolean start(RootDoc root) {
prologue();
ClassDoc[] classes = root.classes();
for (int i = 0; i < classes.length; i++) {
ClassGraph c = new ClassGraph(classes[i]);
c.print();
}
epilogue();
return true;
}
private static void prologue() {
System.out.println(
"#!/usr/local/bin/dot\n" +
"#\n" +
"# Class hirerarchy\n" +
"#\n\n" +
"digraph G {\n" +
"\tnode [fontname=\"Helvetica\",fontsize=8,shape=record];"
);
}
private static void epilogue() {
System.out.println("}\n");
}
}

40
src/gr/spinellis/umlgraph/doclet/UmlGraph.java
View File

@ -20,14 +20,36 @@
import com.sun.javadoc.*;
public class UmlGraph {
public static boolean start(RootDoc root) {
ClassDoc[] classes = root.classes();
for (int i = 0; i < classes.length; i++) {
ClassDoc c = classes[i];
System.out.println(classes[i]);
}
return true;
class ClassGraph {
private ClassDoc c;
ClassGraph(ClassDoc ic) { c = ic; }
public void print() {
System.out.println(c);
}
}
public class UmlGraph {
public static boolean start(RootDoc root) {
prologue();
ClassDoc[] classes = root.classes();
for (int i = 0; i < classes.length; i++) {
ClassGraph c = new ClassGraph(classes[i]);
c.print();
}
epilogue();
return true;
}
private static void prologue() {
System.out.println(
"#!/usr/local/bin/dot\n" +
"#\n" +
"# Class hirerarchy\n" +
"#\n\n" +
"digraph G {\n" +
"\tnode [fontname=\"Helvetica\",fontsize=8,shape=record];"
);
}
private static void epilogue() {
System.out.println("}\n");
}
}

40
src/org/umlgraph/doclet/ClassGraph.java
View File

@ -20,14 +20,36 @@
import com.sun.javadoc.*;
public class UmlGraph {
public static boolean start(RootDoc root) {
ClassDoc[] classes = root.classes();
for (int i = 0; i < classes.length; i++) {
ClassDoc c = classes[i];
System.out.println(classes[i]);
}
return true;
class ClassGraph {
private ClassDoc c;
ClassGraph(ClassDoc ic) { c = ic; }
public void print() {
System.out.println(c);
}
}
public class UmlGraph {
public static boolean start(RootDoc root) {
prologue();
ClassDoc[] classes = root.classes();
for (int i = 0; i < classes.length; i++) {
ClassGraph c = new ClassGraph(classes[i]);
c.print();
}
epilogue();
return true;
}
private static void prologue() {
System.out.println(
"#!/usr/local/bin/dot\n" +
"#\n" +
"# Class hirerarchy\n" +
"#\n\n" +
"digraph G {\n" +
"\tnode [fontname=\"Helvetica\",fontsize=8,shape=record];"
);
}
private static void epilogue() {
System.out.println("}\n");
}
}

40
src/org/umlgraph/doclet/ClassInfo.java
View File

@ -20,14 +20,36 @@
import com.sun.javadoc.*;
public class UmlGraph {
public static boolean start(RootDoc root) {
ClassDoc[] classes = root.classes();
for (int i = 0; i < classes.length; i++) {
ClassDoc c = classes[i];
System.out.println(classes[i]);
}
return true;
class ClassGraph {
private ClassDoc c;
ClassGraph(ClassDoc ic) { c = ic; }
public void print() {
System.out.println(c);
}
}
public class UmlGraph {
public static boolean start(RootDoc root) {
prologue();
ClassDoc[] classes = root.classes();
for (int i = 0; i < classes.length; i++) {
ClassGraph c = new ClassGraph(classes[i]);
c.print();
}
epilogue();
return true;
}
private static void prologue() {
System.out.println(
"#!/usr/local/bin/dot\n" +
"#\n" +
"# Class hirerarchy\n" +
"#\n\n" +
"digraph G {\n" +
"\tnode [fontname=\"Helvetica\",fontsize=8,shape=record];"
);
}
private static void epilogue() {
System.out.println("}\n");
}
}

40
src/org/umlgraph/doclet/Options.java
View File

@ -20,14 +20,36 @@
import com.sun.javadoc.*;
public class UmlGraph {
public static boolean start(RootDoc root) {
ClassDoc[] classes = root.classes();
for (int i = 0; i < classes.length; i++) {
ClassDoc c = classes[i];
System.out.println(classes[i]);
}
return true;
class ClassGraph {
private ClassDoc c;
ClassGraph(ClassDoc ic) { c = ic; }
public void print() {
System.out.println(c);
}
}
public class UmlGraph {
public static boolean start(RootDoc root) {
prologue();
ClassDoc[] classes = root.classes();
for (int i = 0; i < classes.length; i++) {
ClassGraph c = new ClassGraph(classes[i]);
c.print();
}
epilogue();
return true;
}
private static void prologue() {
System.out.println(
"#!/usr/local/bin/dot\n" +
"#\n" +
"# Class hirerarchy\n" +
"#\n\n" +
"digraph G {\n" +
"\tnode [fontname=\"Helvetica\",fontsize=8,shape=record];"
);
}
private static void epilogue() {
System.out.println("}\n");
}
}

40
src/org/umlgraph/doclet/StringUtil.java
View File

@ -20,14 +20,36 @@
import com.sun.javadoc.*;
public class UmlGraph {
public static boolean start(RootDoc root) {
ClassDoc[] classes = root.classes();
for (int i = 0; i < classes.length; i++) {
ClassDoc c = classes[i];
System.out.println(classes[i]);
}
return true;
class ClassGraph {
private ClassDoc c;
ClassGraph(ClassDoc ic) { c = ic; }
public void print() {
System.out.println(c);
}
}
public class UmlGraph {
public static boolean start(RootDoc root) {
prologue();
ClassDoc[] classes = root.classes();
for (int i = 0; i < classes.length; i++) {
ClassGraph c = new ClassGraph(classes[i]);
c.print();
}
epilogue();
return true;
}
private static void prologue() {
System.out.println(
"#!/usr/local/bin/dot\n" +
"#\n" +
"# Class hirerarchy\n" +
"#\n\n" +
"digraph G {\n" +
"\tnode [fontname=\"Helvetica\",fontsize=8,shape=record];"
);
}
private static void epilogue() {
System.out.println("}\n");
}
}

40
src/org/umlgraph/doclet/UmlGraph.java
View File

@ -20,14 +20,36 @@
import com.sun.javadoc.*;
public class UmlGraph {
public static boolean start(RootDoc root) {
ClassDoc[] classes = root.classes();
for (int i = 0; i < classes.length; i++) {
ClassDoc c = classes[i];
System.out.println(classes[i]);
}
return true;
class ClassGraph {
private ClassDoc c;
ClassGraph(ClassDoc ic) { c = ic; }
public void print() {
System.out.println(c);
}
}
public class UmlGraph {
public static boolean start(RootDoc root) {
prologue();
ClassDoc[] classes = root.classes();
for (int i = 0; i < classes.length; i++) {
ClassGraph c = new ClassGraph(classes[i]);
c.print();
}
epilogue();
return true;
}
private static void prologue() {
System.out.println(
"#!/usr/local/bin/dot\n" +
"#\n" +
"# Class hirerarchy\n" +
"#\n\n" +
"digraph G {\n" +
"\tnode [fontname=\"Helvetica\",fontsize=8,shape=record];"
);
}
private static void epilogue() {
System.out.println("}\n");
}
}