MoenLayoutAlgorithm.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 | |
|---|---|---|
| JAVA0177 | JAVA0177 Variable declaration missing initializer |  |
| JAVA0117 | JAVA0117 Missing javadoc: method 'method' | |
| LOOPS | Number of loops | |
| JAVA0254 | JAVA0254 Use enhanced for loop construct instead of Iterator | |
| LOGICAL_LINES | Number of statements | |
| OPERANDS | Number of operands | |
| LOC | Lines of code | |
| PARAMS | Number of formal parameter declarations | |
| PROGRAM_LENGTH | Halstead program length | |
| OPERATORS | Number of operators | |
| LINES | Number of lines in the source file | |
| SIZE | Size of the file in bytes | |
| ELOC | Effective lines of code | |
| JAVA0034 | JAVA0034 Missing braces in if statement | |
| BLOCKS | Number of blocks | |
| PROGRAM_VOCAB | Halstead program vocabulary | |
| EXITS | Procedure exits | |
| INTERFACE_COMPLEXITY | Interface complexity | |
| CYCLOMATIC | Cyclomatic complexity | |
| UNIQUE_OPERANDS | Number of unique operands | |
| JAVA0031 | JAVA0031 Case statement not properly closed | |
| UNIQUE_OPERATORS | Number of unique operators | |
| JAVA0110 | JAVA0110 Incorrect javadoc: no @return tag | |
| EXEC_COMMENTS | Comments in executable code | |
| JAVA0128 | JAVA0128 Public constructor in non-public class | |
| PROGRAM_VOLUME | Halstead program volume | |
| JAVA0136 | JAVA0136 N methods defined in class (maximum: M) | |
| JAVA0116 | JAVA0116 Missing javadoc: field 'field' | |
| JAVA0174 | JAVA0174 Assigned local variable never used | |
| JAVA0138 | JAVA0138 N parameters defined for method (maximum: M) | |
| JAVA0126 | JAVA0126 Method declares unchecked exception in throws | |
| JAVA0043 | JAVA0043 Inner class does not use outer class | |
| FUNCTIONS | Number of function declarations | |
| COMPARISONS | Number of comparison operators | |
| DECL_COMMENTS | Comments in declarations | |
| JAVA0270 | JAVA0270 Use Java 5.0 enhanced for loop construct to iterate over all elements in an array | |
| DOC_COMMENT | Number of javadoc comment lines | |
/*
* @(#)MoenLayoutAlgorithm.java 1.0 18-MAY-2004
*
* Copyright (c) 2004-2005, Gaudenz Alder and others
* 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.Point;
import java.awt.geom.Rectangle2D;
import java.util.ArrayList;
import java.util.Collection;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import org.jgraph.JGraph;
import org.jgraph.graph.CellView;
import org.jgraph.graph.EdgeView;
import org.jgraph.graph.GraphModel;
import org.jgraph.graph.PortView;
import org.jgraph.graph.VertexView;
public class MoenLayoutAlgorithm extends JGraphLayoutAlgorithm
{
/**
* layout,attachParent,layoutLeaf,join,merge,offset and bridge
* methods below were taken line by line from Moen's algorithm.
*
* Attempts to understand the above methods without reading the paper
* first are strongly discouraged.
*
* http://www.computer.org/software/so1990/s4021abs.htm
*
* */
public static final Object CELL_WRAPPER = new Object();
public static final int LEFT_TO_RIGHT = 0;
public static final int UP_TO_DOWN = 1;
public static final int DEFAULT_ORIENTATION = LEFT_TO_RIGHT;
JGraph jgraph;
protected int orientation;
protected int childParentDistance;
public MoenLayoutAlgorithm()
{
setChildParentDistance(30);
setLayoutOrientation(DEFAULT_ORIENTATION);
}
/**
* Returns the name of this algorithm in human
* readable form.
*/
public String toString() {
return "Moen's Tree";
}
/**
* Get a human readable hint for using this layout.
*/
public String getHint() {
return "Select a root node";
}
/**
* Returns an new instance of SugiyamaLayoutSettings
*/
public JGraphLayoutSettings createSettings() {
return new MoenLayoutSettings(this);
}
public void setLayoutOrientation(int orientation)
{
if (orientation < 0 && orientation > 1)
{
orientation = DEFAULT_ORIENTATION;
}
else
{
this.orientation = orientation;
}
}
public void setChildParentDistance(int distance)
{
if (distance <= 0) throw new IllegalArgumentException("Distance has to be positive integer " + distance);
childParentDistance = distance;
}
protected void layout(TreeLayoutNode t)
{
TreeLayoutNode c;
if (t == null)
{
return;
}
c = t.child;
while (c != null)
{
layout(c);
c = c.sibling;
}
if (t.child != null)
{
attachParent(t, join(t));
}
else
{
layoutLeaf(t);
}
}
protected void attachParent(TreeLayoutNode t, int h)
{
final int x;
int y1;
final int y2;
x = t.border + childParentDistance;
y2 = (h - t.height) / 2 - t.border;
y1 = y2 + t.height + 2 * t.border - h;
t.child.offset.x = x + t.width;
t.child.offset.y = y1;
t.contour.upper_head = new PolyLine(t.width, 0, new PolyLine(x, y1,
t.contour.upper_head));
t.contour.lower_head = new PolyLine(t.width, 0, new PolyLine(x, y2,
t.contour.lower_head));
}
protected void layoutLeaf(TreeLayoutNode t)
{
t.contour.upper_tail = new PolyLine(t.width + 2 * t.border, 0, null);
t.contour.upper_head = t.contour.upper_tail;
t.contour.lower_tail = new PolyLine(0, -t.height - 2 * t.border, null);
t.contour.lower_head = new PolyLine(t.width + 2 * t.border, 0,
t.contour.lower_tail);
}
protected int join(TreeLayoutNode t)
{
TreeLayoutNode c;
int d, h, sum;
c = t.child;
t.contour = c.contour;
sum = h = c.height + 2 * c.border;
c = c.sibling;
while (c != null)
{
d = merge(t.contour, c.contour);
c.offset.y = d + h;
c.offset.x = 0;
h = c.height + 2 * c.border;
sum += d + h;
c = c.sibling;
}
return sum;
}
protected int merge(Polygon c1, Polygon c2)
{
int x, y, total, d;
PolyLine lower, upper, b;
x = y = total = 0;
upper = c1.lower_head;
lower = c2.upper_head;
while (lower != null && upper != null)
{
d = offset(x, y, lower.dx, lower.dy, upper.dx, upper.dy);
y += d;
total += d;
if (x + lower.dx <= upper.dx)
{
y += lower.dy;
x += lower.dx;
lower = lower.link;
}
else
{
y -= upper.dy;
x -= upper.dx;
upper = upper.link;
}
}
if (lower != null)
{
b = bridge(c1.upper_tail, 0, 0, lower, x, y);
c1.upper_tail = (b.link != null) ? c2.upper_tail : b;
c1.lower_tail = c2.lower_tail;
}
else
{
b = bridge(c2.lower_tail, x, y, upper, 0, 0);
if (b.link == null)
{
c1.lower_tail = b;
}
}
c1.lower_head = c2.lower_head;
return total;
}
protected int offset(int p1, int p2, int a1, int a2, int b1, int b2)
{
int d, s, t;
if (b1 <= p1 || p1 + a1 <= 0)
{
return 0;
}
t = b1 * a2 - a1 * b2;
if (t > 0)
{
if (p1 < 0)
{
s = p1 * a2;
d = s / a1 - p2;
}
else
if (p1 > 0)
{
s = p1 * b2;
d = s / b1 - p2;
}
else
{
d = -p2;
}
}
else
if (b1 < p1 + a1)
{
s = (b1 - p1) * a2;
d = b2 - (p2 + s / a1);
}
else
if (b1 > p1 + a1)
{
s = (a1 + p1) * b2;
d = s / b1 - (p2 + a2);
}
else
{
d = b2 - (p2 + a2);
}
if (d > 0)
{
return d;
}
return 0;
}
protected PolyLine bridge(PolyLine line1, int x1, int y1, PolyLine line2, int x2,
int y2)
{
int dy, dx, s;
PolyLine r;
dx = x2 + line2.dx - x1;
if (line2.dx == 0)
{
dy = line2.dy;
}
else
{
s = dx * line2.dy;
dy = s / line2.dx;
}
r = new PolyLine(dx, dy, line2.link);
line1.link = new PolyLine(0, y2 + line2.dy - dy - y1, r);
return r;
}
protected void leftRightNodeLayout(TreeLayoutNode node, int off_x, int off_y)
{
TreeLayoutNode child, s;
int siblingOffest;
node.pos.translate(off_x + node.offset.x, off_y + node.offset.y);
child = node.child; //topmost child
if (child != null)
{
leftRightNodeLayout(child, node.pos.x, node.pos.y);
s = child.sibling;
siblingOffest = node.pos.y + child.offset.y;
while (s != null)
{
leftRightNodeLayout(s, node.pos.x + child.offset.x, siblingOffest);
siblingOffest += s.offset.y;
s = s.sibling;
}
}
}
protected void upDownNodeLayout(TreeLayoutNode node, int off_x, int off_y)
{
TreeLayoutNode child, s;
int siblingOffset;
node.pos.translate(off_x + (-1 * node.offset.y), off_y + node.offset.x);
child = node.child; //rightmost child
if (child != null)
{
upDownNodeLayout(child, node.pos.x, node.pos.y);
s = child.sibling;
siblingOffset = node.pos.x - child.offset.y;
while (s != null)
{
upDownNodeLayout(s, siblingOffset, node.pos.y + child.offset.x);
siblingOffset -= s.offset.y;
s = s.sibling;
}
}
}
/**
* This method assumes the graph describes a tree structure. It does not
* test to see if the graph is a network.
*
* Use extreme caution if applyToAll parameter is set to false and
* only the selected cells are to be used. In the set of selected cells,
* any vertex with no source edge in the set will be considered to be a tree
* root. This will work fine as long as all tree vertices in the set that
* are a child of a tree vertex in the set are connected by a path of edges
* to that parent tree vertex (I think).
*
* @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;
List roots = getRootVertices(new Object[]{dynamic_cells[0]});
buildLayoutHelperTree(roots);
layoutTrees(roots);
display(roots);
}
/**
* If it is a Vertex and it has no source, it must be a root vertex.
*
* !!!todo I will need to enforce that there is always at least one vertex,
* and that is the acq portal.
*
* @return all the tree root vertices
*/
protected ArrayList getRootVertices(Object[] selectedCells)
{
HashSet potentialRoot = new HashSet();
HashSet notARoot = new HashSet();
CellView viewTargetPort;
CellView viewTarget;
/*
* Loop through all the vertex and edge cells
*/
for (int i = 0; i < selectedCells.length; i++)
{
Object view = jgraph.getGraphLayoutCache()
.getMapping(selectedCells[i], false);
/*
* If the vertex is not in the notARoot bucket, it is a potential
* root.
*/
if (view instanceof VertexView)
{
if (!(notARoot.contains(view)))
{
potentialRoot.add(view);
}
}
/*
* The target of an edge is not a root.
*/
else if (view instanceof EdgeView)
{
viewTargetPort = ((EdgeView) view).getTarget();
viewTarget = viewTargetPort.getParentView();
potentialRoot.remove(viewTarget);
notARoot.add(viewTarget);
}
else if (view instanceof PortView)
{
// Ignore ports
}
/*
* It should be impossible to get to the next statement
*/
else
{
throw new RuntimeException("Cell is other than Vertex or Edge.");
}
}
/*
* When the loop ends, only tree roots are left
*/
return new ArrayList(potentialRoot);
}
protected List getChildren(VertexView node)
{
ArrayList children = new ArrayList();
Object vertex = node.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);
children.add(targetVertexView);
}
}
}
return children;
}
protected void layoutTrees(Collection roots)
{
for (Iterator iterator = roots.iterator(); iterator.hasNext();)
{
VertexView view = (VertexView) iterator.next();
TreeLayoutNode root = getTreeLayoutNode(view);
// kick off Moen's algorithm
layout(root);
Rectangle2D rect = view.getBounds();
Point rootPos = new Point((int) rect.getX(), (int) rect.getY()); //view.getBounds().getLocation();
switch (orientation)
{
case LEFT_TO_RIGHT:
leftRightNodeLayout(root, rootPos.x, rootPos.y);
break;
case UP_TO_DOWN:
upDownNodeLayout(root, rootPos.x, rootPos.y);
break;
default:
leftRightNodeLayout(root, rootPos.x, rootPos.y);
}
}
}
protected void buildLayoutHelperTree(Collection roots)
{
for (Iterator iterator = roots.iterator(); iterator.hasNext();)
{
VertexView vv = (VertexView) iterator.next();
decorateNode(vv);
}
}
protected void decorateNode(VertexView node)
{
List cl = getChildren(node);
TreeLayoutNode parent = getTreeLayoutNode(node);
if (cl.size() > 0)
{
//Decorate children with Moen's nodes, parent has a reference
//to a first child only. Each child has a reference to a parent
//and possible next sibling
for (int i = 0; i < cl.size(); i++)
{
VertexView currentChild = (VertexView) cl.get(i);
TreeLayoutNode cln = getTreeLayoutNode(currentChild);
if (i == 0)
{
parent.child = cln;
}
else
{
VertexView previousChild = (VertexView) cl.get(i - 1);
TreeLayoutNode pln = getTreeLayoutNode(previousChild);
pln.sibling = cln;
}
cln.parent = parent;
decorateNode(currentChild);
}
}
}
protected TreeLayoutNode getTreeLayoutNode(VertexView view)
{
return getTreeLayoutNode(view, true);
}
protected TreeLayoutNode getTreeLayoutNode(VertexView view, boolean createIfNotPresent)
{
TreeLayoutNode decor = (TreeLayoutNode) view.getAttributes().get(CELL_WRAPPER);
if (decor == null && createIfNotPresent)
{
TreeLayoutNode n = new TreeLayoutNode(view);
view.getAttributes().put(CELL_WRAPPER, n);
return n;
}
return decor;
}
protected void display(Collection roots)
{
for (Iterator iterator = roots.iterator(); iterator.hasNext();)
{
VertexView vertexView = (VertexView) iterator.next();
displayHelper(vertexView);
}
}
protected void displayHelper(VertexView view)
{
TreeLayoutNode node = getTreeLayoutNode(view);
/*
Object cell = view.getCell();
Map attributes =
GraphConstants.createAttributes(
cell,
GraphConstants.BOUNDS,
new Rectangle(node.pos, new Dimension(node.width, node.height)));
jgraph.getGraphLayoutCache().edit(attributes, null, null, null);
*/
Rectangle2D rect = view.getBounds();
rect.setFrame(node.pos.x, node.pos.y, node.width, node.height);
List c = getChildren(view);
for (Iterator iterator = c.iterator(); iterator.hasNext();)
{
VertexView vertexView = (VertexView) iterator.next();
displayHelper(vertexView);
}
view.getAttributes().remove(CELL_WRAPPER);
}
private class TreeLayoutNode
{
TreeLayoutNode parent, child, sibling;
final int width;
final int height;
final int border;
final Point pos;
final Point offset;
Polygon contour;
public TreeLayoutNode(VertexView node)
{
width = (int) node.getBounds().getWidth();
height = (int) node.getBounds().getHeight();
border = 5;
pos = new Point();
offset = new Point();
contour = new Polygon();
}
}
private static class Polygon
{
PolyLine lower_head, lower_tail;
PolyLine upper_head, upper_tail;
}
private static class PolyLine
{
final int dx;
final int dy;
PolyLine link;
PolyLine(int dx, int dy, PolyLine link)
{
this.dx = dx;
this.dy = dy;
this.link = link;
}
}
}
The table below shows all metrics for MoenLayoutAlgorithm.java.
| Metric | Value | Description | |
|---|---|---|---|
| BLOCKS | 73.00 | Number of blocks | |
| BLOCK_COMMENT | 55.00 | Number of block comment lines | |
| COMMENTS | 106.00 | Comment lines | |
| COMMENT_DENSITY | 0.34 | Comment density | |
| COMPARISONS | 39.00 | Number of comparison operators | |
| CYCLOMATIC | 73.00 | Cyclomatic complexity | |
| DECL_COMMENTS | 7.00 | Comments in declarations | |
| DOC_COMMENT | 43.00 | Number of javadoc comment lines | |
| ELOC | 308.00 | Effective lines of code | |
| EXEC_COMMENTS | 12.00 | Comments in executable code | |
| EXITS | 53.00 | Procedure exits | |
| FUNCTIONS | 27.00 | Number of function declarations | |
| HALSTEAD_DIFFICULTY | 116.37 | Halstead difficulty | |
| HALSTEAD_EFFORT | 0.00 | Halstead effort | |
| INTERFACE_COMPLEXITY | 77.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 | 1.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 | 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 | 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 | 0.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 | 3.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 | 1.00 | JAVA0108 Incorrect javadoc: no @param tag for 'parameter' | |
| JAVA0109 | 0.00 | JAVA0109 Incorrect javadoc: no parameter 'parameter' | |
| JAVA0110 | 3.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 | 3.00 | JAVA0116 Missing javadoc: field 'field' | |
| JAVA0117 | 21.00 | JAVA0117 Missing javadoc: method 'method' | |
| JAVA0118 | 1.00 | JAVA0118 Missing javadoc: type 'type' | |
| JAVA0119 | 0.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 | 1.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 | 2.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 | 206.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 | 1.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 | 30.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 | 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 | 1.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 | 0.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 | 642.00 | Number of lines in the source file | |
| LINE_COMMENT | 8.00 | Number of line comments | |
| LOC | 460.00 | Lines of code | |
| LOGICAL_LINES | 230.00 | Number of statements | |
| LOOPS | 13.00 | Number of loops | |
| NEST_DEPTH | 4.00 | Maximum nesting depth | |
| OPERANDS | 1041.00 | Number of operands | |
| OPERATORS | 1649.00 | Number of operators | |
| PARAMS | 44.00 | Number of formal parameter declarations | |
| PROGRAM_LENGTH | 2690.00 | Halstead program length | |
| PROGRAM_VOCAB | 301.00 | Halstead program vocabulary | |
| PROGRAM_VOLUME | 0.00 | Halstead program volume | |
| RETURNS | 33.00 | Number of return points from functions | |
| SIZE | 18299.00 | Size of the file in bytes | |
| UNIQUE_OPERANDS | 246.00 | Number of unique operands | |
| UNIQUE_OPERATORS | 55.00 | Number of unique operators | |
| WHITESPACE | 76.00 | Number of whitespace lines | |