[ package ] [ object ] [ method ] [ explanation ]
The following document contains the results of a JavaNCSS metric analysis, using JavaNCSS version 32.53.[ package ] [ object ] [ method ] [ explanation ]
Packages sorted by NCSS.
| Package | Classes | Methods | NCSS | Javadocs | Javadoc lines | Single lines comment | Multi lines comment |
|---|---|---|---|---|---|---|---|
| org.slasoi.gslam.commons.plan.graph | 10 | 66 | 258 | 76 | 698 | 14 | 387 |
| org.slasoi.gslam.commons.plan | 5 | 31 | 147 | 36 | 260 | 10 | 191 |
| Classes total | Methods total | NCSS total | Javadocs | Javadoc lines | Single lines comment | Multi lines comment |
|---|---|---|---|---|---|---|
| 15 | 97 | 405 | 112 | 958 | 24 | 578 |
[ package ] [ object ] [ method ] [ explanation ]
TOP 30 classes containing the most NCSS.
| Object | NCSS | Methods | Classes | Javadocs |
|---|---|---|---|---|
| org.slasoi.gslam.commons.plan.graph.DirectedAcyclicGraph | 117 | 22 | 0 | 23 |
| org.slasoi.gslam.commons.plan.Plan | 72 | 12 | 0 | 13 |
| org.slasoi.gslam.commons.plan.Task | 44 | 16 | 0 | 17 |
| org.slasoi.gslam.commons.plan.graph.VertexDirectedEdgesCollection | 40 | 10 | 0 | 11 |
| org.slasoi.gslam.commons.plan.graph.AbstractGraph | 17 | 4 | 0 | 5 |
| org.slasoi.gslam.commons.plan.graph.Graph | 16 | 15 | 0 | 16 |
| org.slasoi.gslam.commons.plan.graph.Edge | 15 | 5 | 0 | 6 |
| org.slasoi.gslam.commons.plan.graph.DirectedGraph | 7 | 6 | 0 | 7 |
| org.slasoi.gslam.commons.plan.graph.EdgeFoundException | 5 | 1 | 0 | 2 |
| org.slasoi.gslam.commons.plan.graph.EdgeNotFoundException | 5 | 1 | 0 | 2 |
| org.slasoi.gslam.commons.plan.graph.VertexFoundException | 5 | 1 | 0 | 2 |
| org.slasoi.gslam.commons.plan.graph.VertexNotFoundException | 5 | 1 | 0 | 2 |
| org.slasoi.gslam.commons.plan.RootFoundException | 5 | 1 | 0 | 2 |
| org.slasoi.gslam.commons.plan.TaskFoundException | 5 | 1 | 0 | 2 |
| org.slasoi.gslam.commons.plan.TaskNotFoundException | 5 | 1 | 0 | 2 |
TOP 30 classes containing the most methods.
| Object | NCSS | Methods | Classes | Javadocs |
|---|---|---|---|---|
| org.slasoi.gslam.commons.plan.graph.DirectedAcyclicGraph | 117 | 22 | 0 | 23 |
| org.slasoi.gslam.commons.plan.Task | 44 | 16 | 0 | 17 |
| org.slasoi.gslam.commons.plan.graph.Graph | 16 | 15 | 0 | 16 |
| org.slasoi.gslam.commons.plan.Plan | 72 | 12 | 0 | 13 |
| org.slasoi.gslam.commons.plan.graph.VertexDirectedEdgesCollection | 40 | 10 | 0 | 11 |
| org.slasoi.gslam.commons.plan.graph.DirectedGraph | 7 | 6 | 0 | 7 |
| org.slasoi.gslam.commons.plan.graph.Edge | 15 | 5 | 0 | 6 |
| org.slasoi.gslam.commons.plan.graph.AbstractGraph | 17 | 4 | 0 | 5 |
| org.slasoi.gslam.commons.plan.graph.EdgeFoundException | 5 | 1 | 0 | 2 |
| org.slasoi.gslam.commons.plan.graph.EdgeNotFoundException | 5 | 1 | 0 | 2 |
| org.slasoi.gslam.commons.plan.graph.VertexFoundException | 5 | 1 | 0 | 2 |
| org.slasoi.gslam.commons.plan.graph.VertexNotFoundException | 5 | 1 | 0 | 2 |
| org.slasoi.gslam.commons.plan.RootFoundException | 5 | 1 | 0 | 2 |
| org.slasoi.gslam.commons.plan.TaskFoundException | 5 | 1 | 0 | 2 |
| org.slasoi.gslam.commons.plan.TaskNotFoundException | 5 | 1 | 0 | 2 |
Averages.
| NCSS average | Program NCSS | Classes average | Methods average | Javadocs average |
|---|---|---|---|---|
| 24.20 | 405.00 | 0.00 | 6.47 | 7.47 |
[ package ] [ object ] [ method ] [ explanation ]
TOP 30 Methods containing the most NCSS.
| Methods | NCSS | CCN | Javadocs |
|---|---|---|---|
| org.slasoi.gslam.commons.plan.Plan.getNumberNodes() | 18 | 5 | 1 |
| org.slasoi.gslam.commons.plan.graph.DirectedAcyclicGraph.getEdges(V,V) | 11 | 6 | 1 |
| org.slasoi.gslam.commons.plan.Plan.addChildren(Task,Task) | 10 | 5 | 1 |
| org.slasoi.gslam.commons.plan.graph.DirectedAcyclicGraph.addEdge(V) | 9 | 5 | 1 |
| org.slasoi.gslam.commons.plan.graph.DirectedAcyclicGraph.getEdge(V,V) | 9 | 6 | 1 |
| org.slasoi.gslam.commons.plan.graph.VertexDirectedEdgesCollection.toString() | 9 | 3 | 1 |
| org.slasoi.gslam.commons.plan.graph.DirectedAcyclicGraph.containsEdge(V) | 8 | 2 | 1 |
| org.slasoi.gslam.commons.plan.graph.DirectedAcyclicGraph.getPredecessors(V) | 7 | 2 | 1 |
| org.slasoi.gslam.commons.plan.graph.DirectedAcyclicGraph.getSuccessors(V) | 7 | 2 | 1 |
| org.slasoi.gslam.commons.plan.graph.DirectedAcyclicGraph.removeEdge(V,V) | 7 | 3 | 1 |
| org.slasoi.gslam.commons.plan.graph.VertexDirectedEdgesCollection.containsEdge(E,E) | 7 | 3 | 1 |
| org.slasoi.gslam.commons.plan.Plan.setRoot(Task) | 7 | 5 | 1 |
| org.slasoi.gslam.commons.plan.graph.DirectedAcyclicGraph.toString() | 6 | 2 | 1 |
| org.slasoi.gslam.commons.plan.Task.Task(String,String,String,String) | 6 | 1 | 1 |
| org.slasoi.gslam.commons.plan.graph.AbstractGraph.removeEdges(E) | 5 | 3 | 1 |
| org.slasoi.gslam.commons.plan.graph.AbstractGraph.removeVertices(V) | 5 | 3 | 1 |
| org.slasoi.gslam.commons.plan.graph.DirectedAcyclicGraph.addVertex(V) | 5 | 3 | 1 |
| org.slasoi.gslam.commons.plan.graph.DirectedAcyclicGraph.removeEdge(V) | 5 | 1 | 1 |
| org.slasoi.gslam.commons.plan.Plan.addNode(Task) | 5 | 4 | 1 |
| org.slasoi.gslam.commons.plan.Plan.toString() | 5 | 1 | 1 |
| org.slasoi.gslam.commons.plan.graph.AbstractGraph.removeEdges(V,V) | 4 | 1 | 1 |
| org.slasoi.gslam.commons.plan.graph.DirectedAcyclicGraph.getInDegree(V) | 4 | 3 | 1 |
| org.slasoi.gslam.commons.plan.graph.DirectedAcyclicGraph.getIncomingEdges(V) | 4 | 3 | 1 |
| org.slasoi.gslam.commons.plan.graph.DirectedAcyclicGraph.getOutDegree(V) | 4 | 3 | 1 |
| org.slasoi.gslam.commons.plan.graph.DirectedAcyclicGraph.getOutgoingEdges(V) | 4 | 3 | 1 |
| org.slasoi.gslam.commons.plan.graph.DirectedAcyclicGraph.addEdge(V,V) | 4 | 1 | 1 |
| org.slasoi.gslam.commons.plan.graph.DirectedAcyclicGraph.getEdgeCollection(V) | 4 | 3 | 1 |
| org.slasoi.gslam.commons.plan.graph.DirectedAcyclicGraph.getEdges(V) | 4 | 1 | 1 |
| org.slasoi.gslam.commons.plan.graph.DirectedAcyclicGraph.removeVertex(V) | 4 | 1 | 1 |
| org.slasoi.gslam.commons.plan.graph.VertexDirectedEdgesCollection.removeIncomingEdge(E) | 4 | 3 | 1 |
Averages.
| Program NCSS | NCSS average | CCN average | Javadocs average |
|---|---|---|---|
| 405.00 | 3.27 | 1.71 | 1.00 |
[ package ] [ object ] [ method ] [ explanation ]
Non Commenting Source Statements (NCSS)
Statements for JavaNCSS are not statements as specified in the Java Language Specification but include all kinds of declarations too. Roughly spoken, NCSS is approximately equivalent to counting ';' and '{' characters in Java source files.
Not counted are empty statements, empty blocks or semicolons after closing brackets. Of course, comments don't get counted too. Closing brackets also never get counted, the same applies to blocks in general.
| Examples | |
|---|---|
| Package declaration | package java.lang; |
| Import declaration | import java.awt.*; |
| Class declaration |
|
| Interface declaration | public interface Able ; { |
| Field declaration |
|
| Method declaration |
|
| Constructor declaration | public Foo() { |
| Constructor invocation |
|
| Statement declaration |
|
| Label declaration | fine : |
In some cases consecutive semicolons are illegal according to the JLS but JavaNCSS still tolerates them (thought JavaNCSS is still more strict as 'javac'). Nevertheless they are never counted as two statements.
Cyclomatic Complexity Number (CCN)
CCN is also know as McCabe Metric. There exists a much hyped theory behind it based on graph theory, but it all comes down to simply counting 'if', 'for', 'while' statements etc. in a method. Whenever the control flow of a method splits, the "CCN counter" gets incremented by one.
Each method has a minimum value of 1 per default. For each of the following Java keywords/statements this value gets incremented by one:
Also if the control flow of a method returns abortively the CCNvalue will be incremented by one:
An ordinary return at the end of method will not be counted.
Note that 'else', 'default', and 'finally' don't increment the CCN value any further. On the other hand, a simple method with a 'switch' statement and a huge block of 'case' statements can have a surprisingly high CCN value (still it has the same value when converting a 'switch' block to an equivalent sequence of 'if' statements).
