RadialTreeLayoutAlgorithm.java
| Index Score | ||
|---|---|---|
 |
 |
org.jgraph.plugins.layouts |
 |
 |
JGraph |
View: Reasons, Metrics, Source Code
These are the metrics that contribute to the Enerjy Score for this file, ranked by impact. So the metrics listed at the top influence the score to a greater extent that the metrics listed at the bottom.
| Metric | Description | |
|---|---|---|
| JAVA0254 | JAVA0254 Use enhanced for loop construct instead of Iterator |  |
| LOOPS | Number of loops | |
| JAVA0078 | JAVA0078 Floating point values compared with == | |
| JAVA0177 | JAVA0177 Variable declaration missing initializer | |
| JAVA0007 | JAVA0007 Should not declare public field | |
| JAVA0285 | JAVA0285 Dereference of potentially null variable | |
| JAVA0108 | JAVA0108 Incorrect javadoc: no @param tag for 'parameter' | |
| JAVA0116 | JAVA0116 Missing javadoc: field 'field' | |
| JAVA0117 | JAVA0117 Missing javadoc: method 'method' | |
| SIZE | Size of the file in bytes | |
| EXITS | Procedure exits | |
| JAVA0130 | JAVA0130 Non-static method does not use instance fields | |
| JAVA0034 | JAVA0034 Missing braces in if statement | |
| JAVA0110 | JAVA0110 Incorrect javadoc: no @return tag | |
| LOGICAL_LINES | Number of statements | |
| OPERANDS | Number of operands | |
| PROGRAM_LENGTH | Halstead program length | |
| BLOCKS | Number of blocks | |
| OPERATORS | Number of operators | |
| COMPARISONS | Number of comparison operators | |
| PROGRAM_VOCAB | Halstead program vocabulary | |
| UNIQUE_OPERANDS | Number of unique operands | |
| JAVA0270 | JAVA0270 Use Java 5.0 enhanced for loop construct to iterate over all elements in an array | |
| JAVA0075 | JAVA0075 Method parameter hides field | |
| CYCLOMATIC | Cyclomatic complexity | |
| LINES | Number of lines in the source file | |
| ELOC | Effective lines of code | |
| JAVA0119 | JAVA0119 Control variable changed within body of for loop | |
| NEST_DEPTH | Maximum nesting depth | |
| PROGRAM_VOLUME | Halstead program volume | |
| LOC | Lines of code | |
| UNIQUE_OPERATORS | Number of unique operators | |
| JAVA0126 | JAVA0126 Method declares unchecked exception in throws | |
| INTERFACE_COMPLEXITY | Interface complexity | |
| JAVA0145 | JAVA0145 Tab character used in source file | |
/*
* @(#)RadialTreeLayoutAlgorithm.java 1.0 18-MAY-2004
*
* Copyright (c) 2004, Michael J. Lawley
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* - Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* - Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* - Neither the name of JGraph nor the names of its contributors may be used
* to endorse or promote products derived from this software without specific
* prior written permission.
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
package org.jgraph.plugins.layouts;
import java.awt.Rectangle;
import java.awt.geom.Rectangle2D;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Hashtable;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Properties;
import org.jgraph.JGraph;
import org.jgraph.graph.CellView;
import org.jgraph.graph.GraphConstants;
import org.jgraph.graph.GraphModel;
import org.jgraph.graph.VertexView;
/**
* Lays out the nodes in a graph as a radial tree (root at the centre, children in concentric ovals).
* <p>
* The layout algorithm is similar to that described in the paper
* <em>"Radial Tree Graph Drawing Algorithm for Representing Large Hierarchies"</em>
* by Greg Book and Neeta Keshary.
* <p>
* The algorithm is modified from that in the above paper since it
* contains bugs and the sample code contains major inefficiencies.
* <p>
* Since this algorithm needs to be applied to a tree but we have
* a directed graph, a spanning tree is first constructed then the
* algorithm is applied to it.
*
* @author <a href="mailto:lawley@dstc.edu.au">michael j lawley</a>
* @since 3.1
* @version 1.0 init
*/
public class RadialTreeLayoutAlgorithm extends JGraphLayoutAlgorithm {
/**
* Property key for specifying maximum width of layout area.
*
* If WIDTH is specified, then CENTRE_X and RADIUS_X are
* calculated from it based on the maximum depth of the
* spanning tree.
*/
public static final String KEY_WIDTH = "Width";
/**
* Property key for specifying maximum height of layout area.
*
* If HEIGHT is specified, then CENTRE_Y and RADIUS_Y are
* calculated from it based on the maximum depth of the
* spanning tree.
*/
public static final String KEY_HEIGHT = "Height";
/**
* Property key for specifying the X-axis coordinate of the centre of the layout.
*
* If WIDTH is specified, then the supplied value is ignored and
* CENTRE_X is calculated from it based on the maximum depth of the
* spanning tree.
*/
public static final String KEY_CENTRE_X = "CentreX";
/**
* Property key for specifying the Y-axis coordinate of the centre of the layout.
*
* If HEIGHT is specified, then the supplied value is ignored and
* CENTRE_Y is calculated from it based on the maximum depth of the
* spanning tree.
*/
public static final String KEY_CENTRE_Y = "CentreY";
/**
* Property key for specifying the maximum horizontal distance between a parent and child node.
*
* If WIDTH is specified, then the supplied value is ignored and
* RADIUS_X is calculated from it based on the maximum depth of the
* spanning tree.
*/
public static final String KEY_RADIUS_X = "RadiusX";
/**
* Property key for specifying the maximum vertical distance between a parent and child node.
*
* If WIDTH is specified, then the supplied value is ignored and
* RADIUS_X is calculated from it based on the maximum depth of the
* spanning tree.
*/
public static final String KEY_RADIUS_Y = "RadiusY";
// public static final String KEY_CONTINUOUS = "Continuous";
private static final String RADIAL_TREE_VISITED = "RadialTreeVisited";
private static final double TWO_PI = Math.PI * 2.0;
protected double RADIUSX;
protected double RADIUSY;
protected double ROOTX;
protected double ROOTY, WIDTH, HEIGHT;
private JGraph jgraph;
public RadialTreeLayoutAlgorithm() {
}
/**
* Returns the name of this algorithm in human
* readable form.
*/
public String toString() {
return "Radial Tree";
}
/**
* Get a human readable hint for using this layout.
*/
public String getHint() {
return "Select a tree";
}
/**
* Returns an new instance of SugiyamaLayoutSettings
*/
public JGraphLayoutSettings createSettings() {
return new RadialTreeLayoutSettings(this);
}
/**
* Applies a radial tree layout to nodes in the jgraph with respect to the supplied gpConfiguration.
*
* @param graph JGraph instance
* @param dynamic_cells List of all nodes the layout should move
* @param static_cells List of node the layout should not move but allow for
*/
public void run(JGraph graph, Object[] dynamic_cells, Object[] static_cells) {
this.jgraph = graph;
if (dynamic_cells == null || dynamic_cells.length == 0)
return;
CellView[] selectedCellViews =
graph.getGraphLayoutCache().getMapping(dynamic_cells);
// search all roots
List roots = getRoots(jgraph, selectedCellViews);
TreeNode tree = getSpanningTree(selectedCellViews, roots);
if (null == tree) {
return;
}
double depth = tree.getDepth();
Rectangle2D bounds = jgraph.getCellBounds(dynamic_cells);
double autoW = WIDTH;
if ((WIDTH == ROOTX) && (ROOTX == RADIUSX) && (ROOTX == 0)) {
autoW = bounds.getWidth();
}
if (autoW != 0) {
ROOTX = autoW / 2.0;
RADIUSX = ROOTX / depth;
}
double autoH = HEIGHT;
if ((HEIGHT == ROOTY) && (ROOTY == RADIUSY) && (ROOTY == 0)) {
autoH = bounds.getHeight();
}
if (autoH != 0) {
ROOTY = autoH / 2.0;
RADIUSY = ROOTY / depth;
}
Map viewMap = new HashMap();
layoutTree0(viewMap, tree);
jgraph.getGraphLayoutCache().edit(viewMap, null, null, null);
}
public void setConfiguration(Properties configuration) {
if (configuration.containsKey(KEY_WIDTH)) {
WIDTH = Double.parseDouble(configuration.getProperty(KEY_WIDTH));
} else {
if (configuration.containsKey(KEY_CENTRE_X)) {
ROOTX = Double.parseDouble(configuration.getProperty(KEY_CENTRE_X));
} else {
throw new IllegalArgumentException("Must specify one of KEY_WIDTH or KEY_CENTRE_X");
}
if (configuration.containsKey(KEY_RADIUS_X)) {
RADIUSX = Double.parseDouble(configuration.getProperty(KEY_RADIUS_X));
} else {
throw new IllegalArgumentException("Must specify one of KEY_WIDTH or KEY_RADIUS_X");
}
}
if (configuration.containsKey(KEY_HEIGHT)) {
HEIGHT = Double.parseDouble(configuration.getProperty(KEY_HEIGHT));
} else {
if (configuration.containsKey(KEY_CENTRE_Y)) {
ROOTY = Double.parseDouble(configuration.getProperty(KEY_CENTRE_Y));
} else {
throw new IllegalArgumentException("Must specify one of KEY_HEIGHT or KEY_CENTRE_Y");
}
if (configuration.containsKey(KEY_RADIUS_Y)) {
RADIUSY = Double.parseDouble(configuration.getProperty(KEY_RADIUS_Y));
} else {
throw new IllegalArgumentException("Must specify one of KEY_WIDTH or KEY_RADIUS_X");
}
}
}
private void layoutTree0(Map viewMap, TreeNode node) {
node.angle = 0;
node.x = ROOTX;
node.y = ROOTY;
node.rightBisector = 0;
node.rightTangent = 0;
node.leftBisector = TWO_PI;
node.leftTangent = TWO_PI;
VertexView view = node.getView();
if (null != view) {
placeView(viewMap, view, ROOTX, ROOTY);
}
List parent = new ArrayList(1);
parent.add(node);
layoutTreeN(viewMap, 1, parent);
}
private void layoutTreeN(Map viewMap, int level, List nodes) {
double i;
double prevAngle = 0.0;
TreeNode parent, node, firstParent = null, prevParent = null;
List parentNodes = new ArrayList();
Iterator nitr = nodes.iterator();
while (nitr.hasNext()) {
parent = (TreeNode) nitr.next();
List children = parent.getChildren();
double rightLimit = parent.rightLimit();
double angleSpace = (parent.leftLimit() - rightLimit) / children.size();
Iterator itr = children.iterator();
for (i = 0.5; itr.hasNext(); i++) {
node = (TreeNode) itr.next();
VertexView view = node.getView();
node.angle = rightLimit + (i * angleSpace);
node.x = ROOTX + ((level * RADIUSX) * Math.cos(node.angle));
node.y = ROOTY + ((level * RADIUSY) * Math.sin(node.angle));
placeView(viewMap, view, node.x, node.y);
// Is it a parent node?
if (node.hasChildren()) {
parentNodes.add(node);
if (null == firstParent) {
firstParent = node;
}
// right bisector limit
double prevGap = node.angle - prevAngle;
node.rightBisector = node.angle - (prevGap / 2.0);
if (null != prevParent) {
prevParent.leftBisector = node.rightBisector;
}
double arcAngle = level / (level + 1.0);
double arc = 2.0 * Math.asin(arcAngle);
node.leftTangent = node.angle + arc;
node.rightTangent = node.angle - arc;
prevAngle = node.angle;
prevParent = node;
}
}
}
if (null != firstParent) {
double remaningAngle = TWO_PI - prevParent.angle;
firstParent.rightBisector = (firstParent.angle - remaningAngle) / 2.0;
if (firstParent.rightBisector < 0) {
prevParent.leftBisector = firstParent.rightBisector + TWO_PI + TWO_PI;
} else {
prevParent.leftBisector = firstParent.rightBisector + TWO_PI;
}
}
if (parentNodes.size() > 0) {
layoutTreeN(viewMap, level + 1, parentNodes);
}
}
private void placeView(Map viewMap, VertexView view, double x, double y) {
Rectangle2D rect = view.getBounds();
Rectangle bounds = new Rectangle((int) rect.getX(),
(int) rect.getY(), (int) rect.getWidth(), (int) rect.getHeight());
//(Rectangle) view.getBounds().clone();
bounds.x = (int) Math.round(x);
bounds.y = (int) Math.round(y);
Object cell = view.getCell();
Map map = new Hashtable();
GraphConstants.setBounds(map, bounds);
viewMap.put(cell, map);
}
private List getChildren(VertexView view, List level) {
ArrayList children = new ArrayList();
Object vertex = view.getCell();
GraphModel model = jgraph.getModel();
int portCount = model.getChildCount(vertex);
// iterate any NodePort
for (int i = 0; i < portCount; i++) {
Object port = model.getChild(vertex, i);
// iterate any Edge in the port
Iterator itrEdges = model.edges(port);
while (itrEdges.hasNext()) {
Object edge = itrEdges.next();
// if the Edge is a forward edge we should follow this edge
if (port == model.getSource(edge)) {
Object targetPort = model.getTarget(edge);
Object targetVertex = model.getParent(targetPort);
VertexView targetVertexView =
(VertexView) jgraph.getGraphLayoutCache().getMapping(targetVertex, false);
if (level.contains(targetVertexView)) {
children.add(targetVertexView);
}
}
}
}
return children;
}
private List getRoots(JGraph jgraph, CellView[] cellViews) {
List roots = new ArrayList();
GraphModel model = jgraph.getModel();
for (int i = 0; i < cellViews.length; i++) {
if (cellViews[i] instanceof VertexView) {
VertexView vertexView = (VertexView) cellViews[i];
boolean isRoot = true;
Object vertex = vertexView.getCell();
int portCount = model.getChildCount(vertex);
for (int j = 0; isRoot && j < portCount; j++) {
Object port = model.getChild(vertex, j);
Iterator itrEdges = model.edges(port);
while (isRoot && itrEdges.hasNext()) {
Object edge = itrEdges.next();
if (model.getTarget(edge) == port) {
isRoot = false;
}
}
}
if (isRoot) {
roots.add(vertexView);
}
}
}
return roots;
}
/**
* Algorithm assumes a single root node so if there are multiple roots
* (nodes with no incoming edges), then we construct the spanning tree
* with an invisible root node that is the parent of the real roots.
*/
private TreeNode getSpanningTree(CellView[] cellViews, List roots) {
List vertexViews = new ArrayList(cellViews.length);
// first: mark all as not visited
for (int i = 0; i < cellViews.length; i++) {
if (cellViews[i] instanceof VertexView) {
VertexView vertexView = (VertexView) cellViews[i];
vertexView.getAttributes().remove(RADIAL_TREE_VISITED);
vertexViews.add(vertexView);
}
}
TreeNode node;
if (roots.size() == 0) {
if (vertexViews.size() == 0) {
return null;
}
// else, pick an arbitrary node
roots.add(vertexViews.get(0));
}
if (roots.size() > 1) {
node = new TreeNode(null);
buildSpanningTree(vertexViews, node, roots);
} else {
VertexView vertexView = (VertexView) roots.get(0);
node = new TreeNode(vertexView);
vertexView.getAttributes().put(RADIAL_TREE_VISITED, Boolean.TRUE);
buildSpanningTree(vertexViews, node, getChildren(vertexView, vertexViews));
}
return node;
}
/**
* Breadth-first traversal of the graph.
*/
private void buildSpanningTree(List vertexViews, TreeNode node, List children) {
Iterator itr = children.iterator();
while (itr.hasNext()) {
VertexView vertexView = (VertexView) itr.next();
if (null == vertexView.getAttributes().get(RADIAL_TREE_VISITED)) {
vertexView.getAttributes().put(RADIAL_TREE_VISITED, Boolean.TRUE);
TreeNode childNode = new TreeNode(vertexView);
node.addChild(childNode);
}
}
itr = node.getChildren().iterator();
while (itr.hasNext()) {
TreeNode childNode = (TreeNode) itr.next();
VertexView vertexView = childNode.getView();
buildSpanningTree(vertexViews, childNode, getChildren(vertexView, vertexViews));
}
}
private static class TreeNode {
private VertexView view;
private List children = new ArrayList();
public double angle, x, y, rightBisector, leftBisector, rightTangent, leftTangent;
TreeNode(VertexView view) {
this.view = view;
}
public int getDepth() {
int depth = 1;
Iterator itr = children.iterator();
while (itr.hasNext()) {
TreeNode node = (TreeNode) itr.next();
int childDepth = node.getDepth();
if (childDepth >= depth) {
depth = childDepth + 1;
}
}
return depth;
}
public VertexView getView() {
return view;
}
public void addChild(TreeNode node) {
children.add(node);
}
public List getChildren() {
return children;
}
public boolean hasChildren() {
return children.size() > 0;
}
public double leftLimit() {
return Math.min(normalize(leftBisector), (leftTangent));
}
public double rightLimit() {
return Math.max(normalize(rightBisector), (rightTangent));
}
private double normalize(double angle) {
/*
while (angle > TWO_PI) {
angle -= TWO_PI;
}
while (angle < -TWO_PI) {
angle += TWO_PI;
}
*/
return angle;
}
}
}
The table below shows all metrics for RadialTreeLayoutAlgorithm.java.
| Metric | Value | Description | |
|---|---|---|---|
| BLOCKS | 70.00 | Number of blocks | |
| BLOCK_COMMENT | 37.00 | Number of block comment lines | |
| COMMENTS | 132.00 | Comment lines | |
| COMMENT_DENSITY | 0.52 | Comment density | |
| COMPARISONS | 49.00 | Number of comparison operators | |
| CYCLOMATIC | 68.00 | Cyclomatic complexity | |
| DECL_COMMENTS | 15.00 | Comments in declarations | |
| DOC_COMMENT | 85.00 | Number of javadoc comment lines | |
| ELOC | 252.00 | Effective lines of code | |
| EXEC_COMMENTS | 10.00 | Comments in executable code | |
| EXITS | 56.00 | Procedure exits | |
| FUNCTIONS | 22.00 | Number of function declarations | |
| HALSTEAD_DIFFICULTY | 82.83 | Halstead difficulty | |
| HALSTEAD_EFFORT | 0.00 | Halstead effort | |
| INTERFACE_COMPLEXITY | 60.00 | Interface complexity | |
| JAVA0001 | 0.00 | JAVA0001 Package name does not contain only lower case letters | |
| JAVA0002 | 0.00 | JAVA0002 Package name does not begin with a top level domain name or country code | |
| JAVA0003 | 0.00 | JAVA0003 Minimize use of on-demand (.*) imports | |
| JAVA0004 | 0.00 | JAVA0004 Unnecessary import from java.lang | |
| JAVA0005 | 0.00 | JAVA0005 Imports not in specified order | |
| JAVA0006 | 0.00 | JAVA0006 Empty finally block | |
| JAVA0007 | 7.00 | JAVA0007 Should not declare public field | |
| JAVA0008 | 0.00 | JAVA0008 Empty catch block | |
| JAVA0009 | 0.00 | JAVA0009 Protected member in final class | |
| JAVA0010 | 0.00 | JAVA0010 Non-instantiable class does not contain a non-private static member | |
| JAVA0011 | 0.00 | JAVA0011 Abstract class does not contain an abstract method | |
| JAVA0012 | 0.00 | JAVA0012 Non-constructor method with same name as declaring class | |
| JAVA0013 | 0.00 | JAVA0013 Non-blank final field is not static | |
| JAVA0014 | 0.00 | JAVA0014 Class with only static members has non-private constructor | |
| JAVA0015 | 0.00 | JAVA0015 Package class contains public nested type | |
| JAVA0016 | 0.00 | JAVA0016 Abstract class contains public constructor | |
| JAVA0017 | 0.00 | JAVA0017 Class name does not have required form | |
| JAVA0018 | 0.00 | JAVA0018 Method name does not have required form | |
| JAVA0019 | 0.00 | JAVA0019 Interface name does not have required form | |
| JAVA0020 | 0.00 | JAVA0020 Field name does not have required form | |
| JAVA0021 | 0.00 | JAVA0021 Interface method name does not have required form | |
| JAVA0022 | 0.00 | JAVA0022 Static final field name does not have required form | |
| JAVA0023 | 0.00 | JAVA0023 Empty finalize method | |
| JAVA0024 | 0.00 | JAVA0024 Empty class | |
| JAVA0025 | 0.00 | JAVA0025 Method override is empty | |
| JAVA0026 | 0.00 | JAVA0026 Finalize method with parameters | |
| JAVA0029 | 0.00 | JAVA0029 Private method not used | |
| JAVA0030 | 0.00 | JAVA0030 Private field not used | |
| JAVA0031 | 0.00 | JAVA0031 Case statement not properly closed | |
| JAVA0032 | 0.00 | JAVA0032 Switch statement missing default | |
| JAVA0033 | 0.00 | JAVA0033 default: not last case in switch statement | |
| JAVA0034 | 1.00 | JAVA0034 Missing braces in if statement | |
| JAVA0035 | 0.00 | JAVA0035 Missing braces in for statement | |
| JAVA0036 | 0.00 | JAVA0036 Missing braces in while statement | |
| JAVA0038 | 0.00 | JAVA0038 Non-case label in switch statement | |
| JAVA0039 | 0.00 | JAVA0039 Break statement with label | |
| JAVA0040 | 0.00 | JAVA0040 Switch statement contains N cases (maximum: M) | |
| JAVA0041 | 0.00 | JAVA0041 Nested synchronized block | |
| JAVA0042 | 0.00 | JAVA0042 Empty synchronized statement | |
| JAVA0043 | 0.00 | JAVA0043 Inner class does not use outer class | |
| JAVA0044 | 0.00 | JAVA0044 Serializable class with no instance variables | |
| JAVA0045 | 0.00 | JAVA0045 Serializable class with only transient fields | |
| JAVA0046 | 0.00 | JAVA0046 Name of class not derived from Exception ends with 'Exception' | |
| JAVA0047 | 0.00 | JAVA0047 Serializable class derives from invalid base class | |
| JAVA0048 | 0.00 | JAVA0048 Name of class derived from Exception does not end with 'Exception' | |
| JAVA0049 | 1.00 | JAVA0049 Nested block at depth N (maximum: M) | |
| JAVA0050 | 0.00 | JAVA0050 Class derives from java.lang.Error | |
| JAVA0051 | 0.00 | JAVA0051 Class derives from java.lang.RuntimeException | |
| JAVA0052 | 0.00 | JAVA0052 Class derives from java.lang.Throwable | |
| JAVA0053 | 0.00 | JAVA0053 Unused label | |
| JAVA0054 | 0.00 | JAVA0054 Inheritance depth N exceeds maximum M | |
| JAVA0055 | 0.00 | JAVA0055 Class should be interface | |
| JAVA0056 | 0.00 | JAVA0056 Unnecessary abstract modifier for interface or annotation | |
| JAVA0057 | 1.00 | JAVA0057 Unnecessary default constructor | |
| JAVA0058 | 0.00 | JAVA0058 Constructor calls super() | |
| JAVA0059 | 0.00 | JAVA0059 Method override only calls super() | |
| JAVA0061 | 0.00 | JAVA0061 Inaccessible member in anonymous class | |
| JAVA0062 | 0.00 | JAVA0062 Public class missing public member or protected constructor | |
| JAVA0063 | 0.00 | JAVA0063 Identifier name should not contain '$' | |
| JAVA0064 | 0.00 | JAVA0064 N variations of identifier name (maximum: M) | |
| JAVA0065 | 0.00 | JAVA0065 Unnecessary final modifier for method in final class | |
| JAVA0066 | 0.00 | JAVA0066 Unnecessary modifier for interface nested type | |
| JAVA0067 | 0.00 | JAVA0067 Array descriptor on identifier name | |
| JAVA0068 | 0.00 | JAVA0068 Modifiers not declared in recommended order | |
| JAVA0071 | 0.00 | JAVA0071 Strings compared with == | |
| JAVA0073 | 0.00 | JAVA0073 Integer division in floating-point context | |
| JAVA0074 | 0.00 | JAVA0074 Use of Object.notify() | |
| JAVA0075 | 2.00 | JAVA0075 Method parameter hides field | |
| JAVA0076 | 0.00 | JAVA0076 Use of magic number | |
| JAVA0077 | 0.00 | JAVA0077 Private field not used in declaring class | |
| JAVA0078 | 8.00 | JAVA0078 Floating point values compared with == | |
| JAVA0079 | 0.00 | JAVA0079 Use of instance to reference static member | |
| JAVA0080 | 0.00 | JAVA0080 Import declaration not used | |
| JAVA0081 | 0.00 | JAVA0081 Boolean literal in comparison | |
| JAVA0082 | 0.00 | JAVA0082 Unnecessary widening cast | |
| JAVA0083 | 0.00 | JAVA0083 Unnecessary instanceof test | |
| JAVA0084 | 0.00 | JAVA0084 Should use compound assignment operator | |
| JAVA0085 | 0.00 | JAVA0085 Use of sun.* class | |
| JAVA0087 | 0.00 | JAVA0087 Use of Thread.sleep() | |
| JAVA0089 | 0.00 | JAVA0089 Use of restricted package | |
| JAVA0092 | 0.00 | JAVA0092 Use of restricted type | |
| JAVA0093 | 0.00 | JAVA0093 Redundant assignment | |
| JAVA0094 | 0.00 | JAVA0094 Field hides a superclass field | |
| JAVA0095 | 0.00 | JAVA0095 Uninitialized private field | |
| JAVA0096 | 0.00 | JAVA0096 Field in nested class hides outer field | |
| JAVA0098 | 2.00 | JAVA0098 Minimize use of implicit field initializers | |
| JAVA0100 | 0.00 | JAVA0100 Class contains N non-final fields (maximum: M) | |
| JAVA0101 | 0.00 | JAVA0101 Unnecessary modifier for field in interface | |
| JAVA0102 | 0.00 | JAVA0102 Last statement in finalize() not super.finalize() | |
| JAVA0103 | 0.00 | JAVA0103 Explicit call to finalize() | |
| JAVA0104 | 0.00 | JAVA0104 finalize() only calls super.finalize() | |
| JAVA0105 | 0.00 | JAVA0105 Duplicate import declaration | |
| JAVA0106 | 0.00 | JAVA0106 Unnecessary import from current package | |
| JAVA0108 | 5.00 | JAVA0108 Incorrect javadoc: no @param tag for 'parameter' | |
| JAVA0109 | 0.00 | JAVA0109 Incorrect javadoc: no parameter 'parameter' | |
| JAVA0110 | 4.00 | JAVA0110 Incorrect javadoc: no @return tag | |
| JAVA0111 | 0.00 | JAVA0111 Incorrect javadoc: @return tag for void method | |
| JAVA0112 | 0.00 | JAVA0112 Incorrect javadoc: no exception 'exception' in throws | |
| JAVA0113 | 0.00 | JAVA0113 Incorrect javadoc: no @author tag | |
| JAVA0114 | 0.00 | JAVA0114 Incorrect javadoc: no @version tag | |
| JAVA0115 | 0.00 | JAVA0115 Incorrect javadoc: no @throws or @exception tag for 'exception' | |
| JAVA0116 | 7.00 | JAVA0116 Missing javadoc: field 'field' | |
| JAVA0117 | 9.00 | JAVA0117 Missing javadoc: method 'method' | |
| JAVA0118 | 0.00 | JAVA0118 Missing javadoc: type 'type' | |
| JAVA0119 | 1.00 | JAVA0119 Control variable changed within body of for loop | |
| JAVA0123 | 0.00 | JAVA0123 Use all three components of for loop | |
| JAVA0125 | 0.00 | JAVA0125 Continue statement with label | |
| JAVA0126 | 0.00 | JAVA0126 Method declares unchecked exception in throws | |
| JAVA0128 | 0.00 | JAVA0128 Public constructor in non-public class | |
| JAVA0130 | 3.00 | JAVA0130 Non-static method does not use instance fields | |
| JAVA0131 | 0.00 | JAVA0131 Compatible method does not override base | |
| JAVA0132 | 0.00 | JAVA0132 Method overload with compatible signature | |
| JAVA0133 | 0.00 | JAVA0133 Non-synchronized method overrides synchronized method | |
| JAVA0135 | 0.00 | JAVA0135 Only one of Object.equals and Object.hashCode defined: missing 'method' | |
| JAVA0136 | 0.00 | JAVA0136 N methods defined in class (maximum: M) | |
| JAVA0137 | 0.00 | JAVA0137 Non-abstract class missing constructor | |
| JAVA0138 | 0.00 | JAVA0138 N parameters defined for method (maximum: M) | |
| JAVA0139 | 0.00 | JAVA0139 Definition of main other than public static void main(java.lang.String[]) | |
| JAVA0141 | 0.00 | JAVA0141 Unnecessary modifier for method in interface | |
| JAVA0143 | 0.00 | JAVA0143 Synchronized method | |
| JAVA0144 | 0.00 | JAVA0144 Line exceeds maximum M characters | |
| JAVA0145 | 109.00 | JAVA0145 Tab character used in source file | |
| JAVA0150 | 0.00 | JAVA0150 java.lang.Error (or subclass) thrown | |
| JAVA0153 | 0.00 | JAVA0153 Inefficient conversion of integer to string | |
| JAVA0159 | 0.00 | JAVA0159 Inefficient conversion of string to integer | |
| JAVA0160 | 0.00 | JAVA0160 Method does not throw specified exception | |
| JAVA0161 | 0.00 | JAVA0161 Conditional wait() not in loop | |
| JAVA0163 | 0.00 | JAVA0163 Empty statement | |
| JAVA0165 | 0.00 | JAVA0165 Conflicting return statement in finally block | |
| JAVA0166 | 0.00 | JAVA0166 Generic exception caught | |
| JAVA0167 | 0.00 | JAVA0167 ThreadDeath not rethrown | |
| JAVA0169 | 0.00 | JAVA0169 Unnecessary catch block: exception 'exception' | |
| JAVA0170 | 0.00 | JAVA0170 Caught exception not derived from java.lang.Exception | |
| JAVA0171 | 0.00 | JAVA0171 Unused local variable | |
| JAVA0173 | 0.00 | JAVA0173 Unused method parameter | |
| JAVA0174 | 0.00 | JAVA0174 Assigned local variable never used | |
| JAVA0175 | 0.00 | JAVA0175 Successive assignment to variable | |
| JAVA0176 | 0.00 | JAVA0176 Local variable name does not have required form | |
| JAVA0177 | 4.00 | JAVA0177 Variable declaration missing initializer | |
| JAVA0179 | 0.00 | JAVA0179 Local variable hides visible field | |
| JAVA0233 | 0.00 | JAVA0233 Definition of serialVersionUID other than 'private static final long serialVersionUID' | |
| JAVA0234 | 0.00 | JAVA0234 Class is Serializable but does not define serialVersionUID | |
| JAVA0235 | 0.00 | JAVA0235 Class defines serialVersionUID but does not implement Serializable | |
| JAVA0236 | 0.00 | JAVA0236 Attempt to clone an object which does not implement Cloneable | |
| JAVA0237 | 0.00 | JAVA0237 Class implements Cloneable but does not have public clone method | |
| JAVA0238 | 0.00 | JAVA0238 Clone method does not call super.clone() | |
| JAVA0239 | 0.00 | JAVA0239 Class declares 'readObject' or 'writeObject' but does not implement Serializable | |
| JAVA0240 | 0.00 | JAVA0240 Serializable class which declares readObject or writeObject but not both | |
| JAVA0241 | 0.00 | JAVA0241 'readObject' or 'writeObject' should be declared private in Serializable class | |
| JAVA0242 | 0.00 | JAVA0242 Transient field in non-Serializable class | |
| JAVA0243 | 0.00 | JAVA0243 'readResolve' or 'writeReplace' should be declared private or protected | |
| JAVA0244 | 0.00 | JAVA0244 Field or method name in subclass differs only by case from inherited field or method | |
| JAVA0245 | 0.00 | JAVA0245 JUnit TestCase with non-trivial constructor | |
| JAVA0246 | 0.00 | JAVA0246 JUnit assertXXX statement missing message parameter | |
| JAVA0247 | 0.00 | JAVA0247 JUnit 'setUp()' and 'tearDown()' should call super method | |
| JAVA0248 | 0.00 | JAVA0248 JUnit method 'setUp' or 'tearDown' with incorrect signature | |
| JAVA0249 | 0.00 | JAVA0249 JUnit TestCase 'suite()' should be declared static | |
| JAVA0250 | 0.00 | JAVA0250 JUnit TestCase declares testXXX method with incorrect signature | |
| JAVA0251 | 0.00 | JAVA0251 Use '%n' for line breaks in printf/format for platform independence | |
| JAVA0252 | 0.00 | JAVA0252 'enum' is a Java 1.5 reserved word | |
| JAVA0253 | 0.00 | JAVA0253 Not all enum constants consumed in switch statement | |
| JAVA0254 | 5.00 | JAVA0254 Use enhanced for loop construct instead of Iterator | |
| JAVA0255 | 0.00 | JAVA0255 Result of method invocation not used | |
| JAVA0256 | 0.00 | JAVA0256 Assignment of external collection/array to field | |
| JAVA0257 | 0.00 | JAVA0257 Use of 'Constant Interface' anti-pattern | |
| JAVA0258 | 0.00 | JAVA0258 Implement Iterable for foreach compatibility | |
| JAVA0259 | 1.00 | JAVA0259 Return of collection/array field | |
| JAVA0260 | 0.00 | JAVA0260 Use 'enum' instead of Enumerated Type pattern | |
| JAVA0261 | 0.00 | JAVA0261 Use specialized Enum collection types | |
| JAVA0262 | 0.00 | JAVA0262 Use of char in integer context | |
| JAVA0263 | 0.00 | JAVA0263 Long literal ends with 'l' instead of 'L' | |
| JAVA0264 | 0.00 | JAVA0264 Integer math in long context - check for overflow | |
| JAVA0265 | 0.00 | JAVA0265 Use of Throwable.printStackTrace() | |
| JAVA0266 | 0.00 | JAVA0266 Use of System.out | |
| JAVA0267 | 0.00 | JAVA0267 Use of System.err | |
| JAVA0269 | 0.00 | JAVA0269 Contents of StringBuffer never used | |
| JAVA0270 | 2.00 | JAVA0270 Use Java 5.0 enhanced for loop construct to iterate over all elements in an array | |
| JAVA0271 | 0.00 | JAVA0271 Minimize use of on-demand (.*) static imports | |
| JAVA0272 | 0.00 | JAVA0272 Thread.run() called | |
| JAVA0273 | 0.00 | JAVA0273 Non-final derivative of Thread calls start() in constructor | |
| JAVA0274 | 0.00 | JAVA0274 Serializable class has a synchronized readObject() | |
| JAVA0275 | 0.00 | JAVA0275 Serializable class has a synchronized writeObject() and no other synchronized methods | |
| JAVA0276 | 0.00 | JAVA0276 Unnecessary use of String constructor | |
| JAVA0277 | 0.00 | JAVA0277 Iterator.next() implementation does not throw NoSuchElementException | |
| JAVA0278 | 0.00 | JAVA0278 Unnecessary use of Boolean constructor | |
| JAVA0279 | 0.00 | JAVA0279 Serialization method readObject or readObjectNoData calls an overridable method | |
| JAVA0280 | 0.00 | JAVA0280 IllegalMonitorStateException caught | |
| JAVA0281 | 0.00 | JAVA0281 Iterator.next() not called in loop | |
| JAVA0282 | 0.00 | JAVA0282 Call to Iterator.next() in loop which does not test Iterator.hasNext() | |
| JAVA0283 | 0.00 | JAVA0283 Control variable not updated in loop body | |
| JAVA0284 | 0.00 | JAVA0284 Explicit garbage collection | |
| JAVA0285 | 3.00 | JAVA0285 Dereference of potentially null variable | |
| JAVA0286 | 0.00 | JAVA0286 Dereference of null variable | |
| JAVA0287 | 0.00 | JAVA0287 Unnecessary null check | |
| JAVA0288 | 0.00 | JAVA0288 Inconsistent null check | |
| LINES | 530.00 | Number of lines in the source file | |
| LINE_COMMENT | 10.00 | Number of line comments | |
| LOC | 316.00 | Lines of code | |
| LOGICAL_LINES | 186.00 | Number of statements | |
| LOOPS | 11.00 | Number of loops | |
| NEST_DEPTH | 6.00 | Maximum nesting depth | |
| OPERANDS | 853.00 | Number of operands | |
| OPERATORS | 1487.00 | Number of operators | |
| PARAMS | 25.00 | Number of formal parameter declarations | |
| PROGRAM_LENGTH | 2340.00 | Halstead program length | |
| PROGRAM_VOCAB | 289.00 | Halstead program vocabulary | |
| PROGRAM_VOLUME | 0.00 | Halstead program volume | |
| RETURNS | 35.00 | Number of return points from functions | |
| SIZE | 18243.00 | Size of the file in bytes | |
| UNIQUE_OPERANDS | 242.00 | Number of unique operands | |
| UNIQUE_OPERATORS | 47.00 | Number of unique operators | |
| WHITESPACE | 82.00 | Number of whitespace lines | |