TreeLayoutAlgorithm.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 | |
|---|---|---|
| LOOPS | Number of loops |  |
| JAVA0254 | JAVA0254 Use enhanced for loop construct instead of Iterator | |
| JAVA0117 | JAVA0117 Missing javadoc: method 'method' | |
| LOGICAL_LINES | Number of statements | |
| COMPARISONS | Number of comparison operators | |
| CYCLOMATIC | Cyclomatic complexity | |
| OPERANDS | Number of operands | |
| PROGRAM_LENGTH | Halstead program length | |
| BLOCKS | Number of blocks | |
| OPERATORS | Number of operators | |
| ELOC | Effective lines of code | |
| LOC | Lines of code | |
| JAVA0034 | JAVA0034 Missing braces in if statement | |
| LINES | Number of lines in the source file | |
| JAVA0179 | JAVA0179 Local variable hides visible field | |
| UNIQUE_OPERANDS | Number of unique operands | |
| PROGRAM_VOCAB | Halstead program vocabulary | |
| FUNCTIONS | Number of function declarations | |
| JAVA0128 | JAVA0128 Public constructor in non-public class | |
| JAVA0119 | JAVA0119 Control variable changed within body of for loop | |
| EXITS | Procedure exits | |
| SIZE | Size of the file in bytes | |
| INTERFACE_COMPLEXITY | Interface complexity | |
| RETURNS | Number of return points from functions | |
| WHITESPACE | Number of whitespace lines | |
| UNIQUE_OPERATORS | Number of unique operators | |
| PROGRAM_VOLUME | Halstead program volume | |
| DECL_COMMENTS | Comments in declarations | |
| JAVA0136 | JAVA0136 N methods defined in class (maximum: M) | |
| JAVA0126 | JAVA0126 Method declares unchecked exception in throws | |
| JAVA0145 | JAVA0145 Tab character used in source file | |
| JAVA0285 | JAVA0285 Dereference of potentially null variable | |
| LINE_COMMENT | Number of line comments | |
| JAVA0043 | JAVA0043 Inner class does not use outer class | |
| PARAMS | Number of formal parameter declarations | |
| EXEC_COMMENTS | Comments in executable code | |
| JAVA0123 | JAVA0123 Use all three components of for loop | |
| JAVA0100 | JAVA0100 Class contains N non-final fields (maximum: M) | |
| JAVA0108 | JAVA0108 Incorrect javadoc: no @param tag for 'parameter' | |
| JAVA0075 | JAVA0075 Method parameter hides field | |
| JAVA0110 | JAVA0110 Incorrect javadoc: no @return tag | |
/*
* @(#)TreeLayoutAlgorithm.java 1.0 12-MAY-2004
*
* Copyright (c) 2004, Martin Krueger
* 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.Dimension;
import java.awt.Insets;
import java.awt.Point;
import java.awt.Rectangle;
import java.awt.geom.Rectangle2D;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import javax.swing.SwingConstants;
import org.jgraph.JGraph;
import org.jgraph.graph.CellView;
import org.jgraph.graph.GraphConstants;
import org.jgraph.graph.GraphModel;
/**
* TODO:COMMENT ME!
*
* @author krueger
*/
public class TreeLayoutAlgorithm extends JGraphLayoutAlgorithm {
protected int alignment = SwingConstants.TOP;
protected int orientation = SwingConstants.NORTH;
protected int levelDistance = 30;
protected int nodeDistance = 20;
protected boolean centerRoot = false;
protected boolean combineLevelNodes = true;
protected JGraph graph;
protected Map cell2node = new HashMap(); //CellView -> TreeNode
/**
* Returns the name of this algorithm in human
* readable form.
*/
public String toString() {
return "Tree Layout";
}
/**
* Get a human readable hint for using this layout.
*/
public String getHint() {
return "Select a root node";
}
public JGraphLayoutSettings createSettings() {
return new TreeLayoutSettings(this);
}
/**
* SwingConstants.TOP
* SwingConstants.CENTER
* SwingConstants.BOTTOM
* @param alignment
*/
public void setAlignment(int alignment) {
if (alignment != SwingConstants.TOP
&& alignment != SwingConstants.CENTER
&& alignment != SwingConstants.BOTTOM) {
throw new IllegalArgumentException("Alignment must be one of TOP, CENTER or BOTTOM"); //$NON-NLS-1$
}
this.alignment = alignment;
}
/**
* SwingConstants.NORTH
* SwingConstants.EAST
* SwingConstants.SOUTH
* SwingConstants.WEST
* @param orientation
*/
public void setOrientation(int orientation) {
if (orientation != SwingConstants.NORTH
&& orientation != SwingConstants.EAST
&& orientation != SwingConstants.SOUTH
&& orientation != SwingConstants.WEST) {
throw new IllegalArgumentException("Orientation must be one of NORTH, EAST, SOUTH or WEST");
}
this.orientation = orientation;
}
public void setLevelDistance(int distance) {
levelDistance = distance;
}
public void setNodeDistance(int distance) {
nodeDistance = distance;
}
public void setCenterRoot(boolean b) {
centerRoot = b;
}
/*
* @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.graph = graph;
CellView[] selectedCellViews =
graph.getGraphLayoutCache().getMapping(new Object[]{dynamic_cells[0]});
List roots = Arrays.asList(selectedCellViews);
for (Iterator it = roots.iterator(); it.hasNext();) {
if (!(it.next() instanceof CellView)) {
it.remove();
}
}
roots = buildTrees(roots);
layoutTrees(roots);
if (combineLevelNodes) {
setLevelHeights(roots);
}
setPosition(roots);
}
/* Building Tree */
protected List buildTrees(List roots) {
List l = new ArrayList();
for (Iterator it = roots.iterator(); it.hasNext();) {
l.add(buildTree((CellView) it.next()));
}
return l;
}
protected TreeNode buildTree(CellView view) {
List children = getChildren(view);
TreeNode node = getTreeNode(view);
for (Iterator it = children.iterator(); it.hasNext();) {
CellView c = (CellView) it.next();
TreeNode n = buildTree(c);
node.children.add(n);
}
return node;
}
protected List getChildren(CellView view) {
ArrayList children = new ArrayList();
GraphModel model = graph.getModel();
Object cell = view.getCell();
for (int i = 0; i < model.getChildCount(cell); i++) {
Object port = model.getChild(cell, i);
for (Iterator edges = model.edges(port); edges.hasNext();) {
Object edge = edges.next();
if (port == model.getSource(edge)) {
Object targetPort = model.getTarget(edge);
Object targetVertex = model.getParent(targetPort);
children.add(graph.getGraphLayoutCache().getMapping(targetVertex, false));
}
}
}
return children;
}
protected TreeNode getTreeNode(CellView view) {
Object o = cell2node.get(view);
if (o != null) {
return (TreeNode) o;
}
TreeNode node = new TreeNode(view);
cell2node.put(view, node);
return node;
}
/* Layout trees */
protected void layoutTrees(List roots) {
for (Iterator it = roots.iterator(); it.hasNext();) {
layout((TreeNode) it.next());
}
}
protected void layout(TreeNode node) {
if (node.children.size() == 0) {
//do nothing
} else if (node.children.size() == 1) {
TreeNode sub = (TreeNode) node.children.get(0);
sub.depth = node.depth + 1;
layout(sub);
sub.leftContour.dx = (sub.width - node.width) / 2;
sub.rightContour.dx = (sub.width - node.width) / 2;
node.leftContour.next = sub.leftContour;
node.rightContour.next = sub.rightContour;
} else {
for (Iterator it = node.children.iterator(); it.hasNext();) {
TreeNode n = (TreeNode) it.next();
n.depth = node.depth + 1;
layout(n);
}
join(node);
}
}
/* Joining trees */
protected void join(TreeNode node) {
int distance = 0;
for (int i = 0; i < node.children.size(); i++) {
TreeNode n1 = (TreeNode) node.children.get(i);
for (int j = i + 1; j < node.children.size(); j++) {
TreeNode n2 = (TreeNode) node.children.get(j);
int dist = distance(n1.rightContour, n2.leftContour) / (j - i);
distance = Math.max(distance, dist);
}
}
distance += nodeDistance;
//set relative position
int left;
if (node.children.size() % 2 == 0) {
left = (node.children.size() / 2 - 1) * distance + distance / 2;
} else {
left = node.children.size() / 2 * distance;
}
Iterator it = node.children.iterator();
for (int i = 0; it.hasNext(); i++) {
((TreeNode) it.next()).x = -left + i * distance;
}
//new contour
TreeNode first = getLeftMostX(node);
TreeNode last = getRightMostX(node);
node.leftContour.next = first.leftContour;
node.rightContour.next = last.rightContour;
for (int i = 1; i < node.children.size(); i++) {
TreeNode n = (TreeNode) node.children.get(i);
merge(node.leftContour.next, n.leftContour, i * distance + node.width);
}
for (int i = node.children.size() - 2; i >= 0; i--) {
TreeNode n = (TreeNode) node.children.get(i);
merge(node.rightContour.next, n.rightContour, i * distance + node.width);
}
distance = (node.children.size() - 1) * distance / 2;
node.leftContour.next.dx += distance - node.width / 2;
node.rightContour.next.dx += distance - node.width / 2;
}
protected TreeNode getLeftMostX(TreeNode node)
{
int tmp = Integer.MAX_VALUE;
TreeNode mostLeft = null;
Iterator iter = node.getChildren();
while (iter.hasNext())
{
TreeNode child = (TreeNode) iter.next();
int leftPos = child.x - child.getLeftWidth();
if (leftPos < tmp)
{
mostLeft = child;
tmp = leftPos;
}
}
return (mostLeft != null) ? mostLeft : (TreeNode) node.children.get(0);
}
protected TreeNode getRightMostX(TreeNode node)
{
int tmp = Integer.MIN_VALUE;
TreeNode mostRight = null;
Iterator iter = node.getChildren();
while (iter.hasNext())
{
TreeNode child = (TreeNode) iter.next();
int rightPos = child.x + child.getRightWidth();
if (rightPos > tmp)
{
mostRight = child;
tmp = rightPos;
}
}
return (mostRight != null) ? mostRight : (TreeNode) node.children.get(0);
}
protected void merge(PolyLine main, PolyLine left, int distance) {
while (main != null) {
if (left.next == null) {
return;
}
if (main.next == null) {
left = left.next;
break;
}
distance += main.dx - left.dx;
main = main.next;
left = left.next;
}
left.dx += -distance;
main.next = left;
}
protected int distance(PolyLine right, PolyLine left) {
int distance = 0;
for (int i = 0; right != null && left != null;) {
i += right.dx + left.dx;
if (i > 0) {
distance += i;
i = 0;
}
right = right.next;
left = left.next;
}
return distance;
}
/* Positioning */
protected void setPosition(List roots) {
for (Iterator it = roots.iterator(); it.hasNext();) {
((TreeNode) it.next()).setPosition(null, 0);
}
}
protected void setLevelHeights(List roots) {
for (Iterator it = roots.iterator(); it.hasNext();) {
List level = ((TreeNode) it.next()).getNodesByLevel();
int max = 0;
for (int i = 0; i < level.size(); i++) {
List l = (List) level.get(i);
for (int j = 0; j < l.size(); j++) {
max = Math.max(max, ((TreeNode) l.get(j)).height);
}
for (int j = 0; j < l.size(); j++) {
((TreeNode) l.get(j)).levelheight = max;
}
max = 0;
}
}
}
protected class TreeNode {
List children;
int width;
int height;
int x;
int y;
int levelheight;
PolyLine leftContour;
PolyLine rightContour;
int depth;
CellView view;
public TreeNode(CellView view) {
this.view = view;
if (orientation == SwingConstants.NORTH || orientation == SwingConstants.SOUTH) {
width = (int) view.getBounds().getWidth();
height = (int) view.getBounds().getHeight();
} else {
width = (int) view.getBounds().getHeight();
height = (int) view.getBounds().getWidth();
}
this.children = new ArrayList();
this.leftContour = new PolyLine(width / 2);
this.rightContour = new PolyLine(width / 2);
this.depth = 0;
}
public Iterator getChildren() {
return children.iterator();
}
public int getLeftWidth() {
int width = 0;
PolyLine poly = leftContour;
int tmp = 0;
while(poly != null) {
tmp += poly.dx;
if(tmp > 0) {
width += tmp;
tmp = 0;
}
poly = poly.next;
}
return width;
}
public int getRightWidth() {
int width = 0;
PolyLine poly = rightContour;
int tmp = 0;
while(poly != null) {
tmp += poly.dx;
if(tmp > 0) {
width += tmp;
tmp = 0;
}
poly = poly.next;
}
return width;
}
public int getHeight() {
if(children.isEmpty()) {
return levelheight;
}
int height = 0;
for(Iterator it = children.iterator(); it.hasNext(); ) {
height = Math.max(height, ((TreeNode) it.next()).getHeight());
}
return height + levelDistance + levelheight;
}
public void setPosition(Point parent, int levelHeight) {
int nextLevelHeight = 0;
for (Iterator it = children.iterator(); it.hasNext();) {
nextLevelHeight = Math.max(nextLevelHeight, ((TreeNode) it.next()).height);
}
if (parent == null) {
Rectangle2D b = view.getBounds();
Rectangle bounds = new Rectangle((int) b.getX(),(int) b.getY(), (int) b.getWidth(), (int) b.getHeight());
Point p = bounds.getLocation();
if(centerRoot) {
int lw = getLeftWidth();
int rw = getRightWidth();
int h = getHeight();
Insets i = graph.getInsets();
if(orientation == SwingConstants.NORTH) {
bounds.x = lw - width / 2;
bounds.y = i.top;
} else if (orientation == SwingConstants.EAST) {
bounds.x = i.left + h - width;
bounds.y = lw - height / 2;
} else if (orientation == SwingConstants.SOUTH) {
bounds.x = lw - width / 2;
bounds.y = i.top + h;
} else if (orientation == SwingConstants.WEST) {
bounds.x = i.right;
bounds.y = lw - width / 2;
}
Object cell = view.getCell();
Map attributes =
GraphConstants.createAttributes(cell, GraphConstants.BOUNDS, bounds);
graph.getGraphLayoutCache().edit(attributes, null, null, null);
if (orientation == SwingConstants.WEST || orientation == SwingConstants.EAST) {
graph.setPreferredSize(new Dimension(h + i.left + i.right, lw+rw+ i.top+ i.bottom));
} else {
graph.setPreferredSize(new Dimension(lw+rw + i.left + i.right, h + i.top + i.bottom));
}
p = bounds.getLocation();
}
if (orientation == SwingConstants.WEST || orientation == SwingConstants.EAST) {
int tmp = p.x;
p.x = p.y;
p.y = tmp;
}
if (orientation == SwingConstants.NORTH || orientation == SwingConstants.WEST) {
parent = new Point(p.x + width / 2, p.y + height);
} else if (
orientation == SwingConstants.SOUTH || orientation == SwingConstants.EAST) {
parent = new Point(p.x + width / 2, p.y);
}
for (Iterator it = children.iterator(); it.hasNext();) {
((TreeNode) it.next()).setPosition(parent, nextLevelHeight);
}
return;
}
if (combineLevelNodes) {
levelHeight = this.levelheight;
}
Rectangle cellBounds = new Rectangle(width, height);
if (orientation == SwingConstants.NORTH || orientation == SwingConstants.WEST) {
cellBounds.x = x + parent.x - width / 2;
cellBounds.y = parent.y + levelDistance;
} else {
cellBounds.x = x + parent.x - width / 2;
cellBounds.y = parent.y - levelDistance - levelheight;
}
if (alignment == SwingConstants.CENTER) {
cellBounds.y += (levelHeight - height) / 2;
} else if (alignment == SwingConstants.BOTTOM) {
cellBounds.y += levelHeight - height;
}
if (orientation == SwingConstants.WEST || orientation == SwingConstants.EAST) {
int tmp = cellBounds.x;
cellBounds.x = cellBounds.y;
cellBounds.y = tmp;
tmp = cellBounds.width;
cellBounds.width = cellBounds.height;
cellBounds.height = tmp;
}
Object cell = view.getCell();
Map attributes =
GraphConstants.createAttributes(cell, GraphConstants.BOUNDS, cellBounds);
graph.getGraphLayoutCache().edit(attributes, null, null, null);
if (orientation == SwingConstants.NORTH || orientation == SwingConstants.WEST) {
y = parent.y + levelDistance + levelHeight;
} else {
y = parent.y - levelDistance - levelHeight;
}
for (Iterator it = children.iterator(); it.hasNext();) {
((TreeNode) it.next()).setPosition(new Point(x + parent.x, y), nextLevelHeight);
}
}
public List getNodesByLevel() {
List level = new ArrayList();
for (Iterator it = children.iterator(); it.hasNext();) {
List l2 = ((TreeNode) it.next()).getNodesByLevel();
if (level.size() < l2.size()) {
List tmp = level;
level = l2;
l2 = tmp;
}
for (int i = 0; i < l2.size(); i++) {
((List) level.get(i)).addAll((List) l2.get(i));
}
}
ArrayList node = new ArrayList();
node.add(this);
level.add(0, node);
return level;
}
}
protected class PolyLine {
int dx;
PolyLine next;
public PolyLine(int dx) {
this.dx = dx;
}
}
/**
* @return Returns the combineLevelNodes.
*/
public boolean isCombineLevelNodes() {
return combineLevelNodes;
}
/**
* @param combineLevelNodes The combineLevelNodes to set.
*/
public void setCombineLevelNodes(boolean combineLevelNodes) {
this.combineLevelNodes = combineLevelNodes;
}
/**
* @return Returns the alignment.
*/
public int getAlignment() {
return alignment;
}
/**
* @return Returns the centerRoot.
*/
public boolean isCenterRoot() {
return centerRoot;
}
/**
* @return Returns the levelDistance.
*/
public int getLevelDistance() {
return levelDistance;
}
/**
* @return Returns the nodeDistance.
*/
public int getNodeDistance() {
return nodeDistance;
}
/**
* @return Returns the orientation.
*/
public int getOrientation() {
return orientation;
}
}
The table below shows all metrics for TreeLayoutAlgorithm.java.
| Metric | Value | Description | |
|---|---|---|---|
| BLOCKS | 107.00 | Number of blocks | |
| BLOCK_COMMENT | 38.00 | Number of block comment lines | |
| COMMENTS | 87.00 | Comment lines | |
| COMMENT_DENSITY | 0.24 | Comment density | |
| COMPARISONS | 84.00 | Number of comparison operators | |
| CYCLOMATIC | 117.00 | Cyclomatic complexity | |
| DECL_COMMENTS | 18.00 | Comments in declarations | |
| DOC_COMMENT | 46.00 | Number of javadoc comment lines | |
| ELOC | 367.00 | Effective lines of code | |
| EXEC_COMMENTS | 3.00 | Comments in executable code | |
| EXITS | 55.00 | Procedure exits | |
| FUNCTIONS | 37.00 | Number of function declarations | |
| HALSTEAD_DIFFICULTY | 115.12 | Halstead difficulty | |
| HALSTEAD_EFFORT | 0.00 | Halstead effort | |
| INTERFACE_COMPLEXITY | 72.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 | 0.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 | 0.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 | 1.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 | 0.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 | 0.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 | 1.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 | 1.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 | 0.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 | 1.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 | 0.00 | JAVA0108 Incorrect javadoc: no @param tag for 'parameter' | |
| JAVA0109 | 0.00 | JAVA0109 Incorrect javadoc: no parameter 'parameter' | |
| JAVA0110 | 2.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 | 1.00 | JAVA0114 Incorrect javadoc: no @version tag | |
| JAVA0115 | 0.00 | JAVA0115 Incorrect javadoc: no @throws or @exception tag for 'exception' | |
| JAVA0116 | 0.00 | JAVA0116 Missing javadoc: field 'field' | |
| JAVA0117 | 24.00 | JAVA0117 Missing javadoc: method 'method' | |
| JAVA0118 | 0.00 | JAVA0118 Missing javadoc: type 'type' | |
| JAVA0119 | 2.00 | JAVA0119 Control variable changed within body of for loop | |
| JAVA0123 | 1.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 | 2.00 | JAVA0128 Public constructor in non-public class | |
| JAVA0130 | 0.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 | 1.00 | JAVA0136 N methods defined in class (maximum: M) | |
| JAVA0137 | 1.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 | 1293.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 | 1.00 | JAVA0177 Variable declaration missing initializer | |
| JAVA0179 | 3.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 | 15.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 | 1.00 | JAVA0258 Implement Iterable for foreach compatibility | |
| JAVA0259 | 0.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 | 0.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 | 1.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 | 679.00 | Number of lines in the source file | |
| LINE_COMMENT | 3.00 | Number of line comments | |
| LOC | 471.00 | Lines of code | |
| LOGICAL_LINES | 296.00 | Number of statements | |
| LOOPS | 29.00 | Number of loops | |
| NEST_DEPTH | 4.00 | Maximum nesting depth | |
| OPERANDS | 1317.00 | Number of operands | |
| OPERATORS | 2265.00 | Number of operators | |
| PARAMS | 29.00 | Number of formal parameter declarations | |
| PROGRAM_LENGTH | 3582.00 | Halstead program length | |
| PROGRAM_VOCAB | 336.00 | Halstead program vocabulary | |
| PROGRAM_VOLUME | 0.00 | Halstead program volume | |
| RETURNS | 43.00 | Number of return points from functions | |
| SIZE | 17542.00 | Size of the file in bytes | |
| UNIQUE_OPERANDS | 286.00 | Number of unique operands | |
| UNIQUE_OPERATORS | 50.00 | Number of unique operators | |
| WHITESPACE | 121.00 | Number of whitespace lines | |