RecalculateTaskScheduleAlgorithm.java
| Index Score | ||
|---|---|---|
 |
 |
net.sourceforge.ganttproject.task.algorithm |
 |
 |
GanttProject |
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 | |
|---|---|---|
| JAVA0034 | JAVA0034 Missing braces in if statement |  |
| JAVA0123 | JAVA0123 Use all three components of for loop | |
| JAVA0254 | JAVA0254 Use enhanced for loop construct instead of Iterator | |
| BLOCK_COMMENT | Number of block comment lines | |
| JAVA0270 | JAVA0270 Use Java 5.0 enhanced for loop construct to iterate over all elements in an array | |
| JAVA0029 | JAVA0029 Private method not used | |
| SIZE | Size of the file in bytes | |
| EXITS | Procedure exits | |
| LOOPS | Number of loops | |
| JAVA0117 | JAVA0117 Missing javadoc: method 'method' | |
| JAVA0082 | JAVA0082 Unnecessary widening cast | |
| UNIQUE_OPERATORS | Number of unique operators | |
| PROGRAM_VOLUME | Halstead program volume | |
| JAVA0032 | JAVA0032 Switch statement missing default | |
| JAVA0126 | JAVA0126 Method declares unchecked exception in throws | |
| JAVA0110 | JAVA0110 Incorrect javadoc: no @return tag | |
| JAVA0108 | JAVA0108 Incorrect javadoc: no @param tag for 'parameter' | |
| WHITESPACE | Number of whitespace lines | |
| DECL_COMMENTS | Comments in declarations | |
| DOC_COMMENT | Number of javadoc comment lines | |
| JAVA0145 | JAVA0145 Tab character used in source file | |
package net.sourceforge.ganttproject.task.algorithm;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.SortedMap;
import java.util.TreeMap;
import net.sourceforge.ganttproject.GanttCalendar;
import net.sourceforge.ganttproject.task.Task;
import net.sourceforge.ganttproject.task.TaskContainmentHierarchyFacade;
import net.sourceforge.ganttproject.task.TaskLength;
import net.sourceforge.ganttproject.task.TaskMutator;
import net.sourceforge.ganttproject.task.dependency.TaskDependency;
import net.sourceforge.ganttproject.task.dependency.TaskDependencyConstraint;
import net.sourceforge.ganttproject.task.dependency.TaskDependencyException;
/**
* Created by IntelliJ IDEA. User: bard
*/
public abstract class RecalculateTaskScheduleAlgorithm extends AlgorithmBase {
private Set myMarkedTasks = new HashSet();
private SortedMap myDistance2dependencyList = new TreeMap();
private Set<Task> myModifiedTasks = new HashSet<Task>();
private final AdjustTaskBoundsAlgorithm myAdjuster;
private int myEntranceCounter;
private boolean isRunning;
public RecalculateTaskScheduleAlgorithm(AdjustTaskBoundsAlgorithm adjuster) {
myAdjuster = adjuster;
}
public void run(Task changedTask) throws TaskDependencyException {
if (!isEnabled()) {
return;
}
isRunning = true;
myEntranceCounter++;
myMarkedTasks.clear();
buildDistanceGraph(changedTask);
fulfilDependencies();
myDistance2dependencyList.clear();
myModifiedTasks.add(changedTask);
myAdjuster.run((Task[]) myModifiedTasks.toArray(new Task[0]));
myDistance2dependencyList.clear();
myModifiedTasks.clear();
myEntranceCounter--;
isRunning = false;
}
public void run(Set taskSet) throws TaskDependencyException {
if (!isEnabled()) {
return;
}
isRunning = true;
myEntranceCounter++;
myMarkedTasks.clear();
for (Iterator tasks = taskSet.iterator(); tasks.hasNext();) {
Task nextTask = (Task) tasks.next();
buildDistanceGraph(nextTask);
fulfilDependencies();
myDistance2dependencyList.clear();
myModifiedTasks.add(nextTask);
}
myAdjuster.run((Task[]) myModifiedTasks.toArray(new Task[0]));
myDistance2dependencyList.clear();
myModifiedTasks.clear();
myEntranceCounter--;
isRunning = false;
}
public void run() throws TaskDependencyException {
if (!isEnabled()) {
return;
}
isRunning = true;
TaskContainmentHierarchyFacade facade = createContainmentFacade();
Set independentTasks = new HashSet();
traverse(facade, facade.getRootTask(), independentTasks);
for (Iterator it = independentTasks.iterator(); it.hasNext();) {
Task next = (Task) it.next();
buildDistanceGraph(next);
}
fulfilDependencies();
isRunning = false;
}
public boolean isRunning() {
return isRunning;
}
private void traverse(TaskContainmentHierarchyFacade facade, Task root,
Set independentTasks) {
TaskDependency[] asDependant = root.getDependenciesAsDependant()
.toArray();
if (asDependant.length == 0) {
independentTasks.add(root);
}
Task[] nestedTasks = facade.getNestedTasks(root);
for (int i = 0; i < nestedTasks.length; i++) {
traverse(facade, nestedTasks[i], independentTasks);
}
}
private void fulfilDependencies() throws TaskDependencyException {
// System.err.println("[RecalculateTaskSchedule]
// >>>fulfilDependencies()");
for (Iterator distances = myDistance2dependencyList.entrySet()
.iterator(); distances.hasNext();) {
Map.Entry nextEntry = (Map.Entry) distances.next();
List nextDependenciesList = (List) nextEntry.getValue();
for (int i = 0; i < nextDependenciesList.size(); i++) {
TaskDependency nextDependency = (TaskDependency) nextDependenciesList
.get(i);
TaskDependencyConstraint nextConstraint = nextDependency
.getConstraint();
TaskDependencyConstraint.Collision collision = nextConstraint
.getCollision();
if (collision.isActive()) {
fulfilConstraints(nextDependency);
nextDependency.getDependant().applyThirdDateConstraint();
}
}
}
// System.err.println("[RecalculateTaskSchedule]
// <<<fulfilDependencies()");
}
private void fulfilConstraints(TaskDependency dependency)
throws TaskDependencyException {
Task dependant = dependency.getDependant();
TaskDependency[] depsAsDependant = dependant
.getDependenciesAsDependant().toArray();
if (depsAsDependant.length > 0) {
ArrayList startLaterVariations = new ArrayList();
ArrayList startEarlierVariations = new ArrayList();
ArrayList noVariations = new ArrayList();
//
for (int i = 0; i < depsAsDependant.length; i++) {
TaskDependency next = depsAsDependant[i];
TaskDependencyConstraint.Collision nextCollision = next
.getConstraint().getCollision();
GanttCalendar acceptableStart = nextCollision
.getAcceptableStart();
switch (nextCollision.getVariation()) {
case TaskDependencyConstraint.Collision.START_EARLIER_VARIATION: {
startEarlierVariations.add(acceptableStart);
break;
}
case TaskDependencyConstraint.Collision.START_LATER_VARIATION: {
startLaterVariations.add(acceptableStart);
break;
}
case TaskDependencyConstraint.Collision.NO_VARIATION: {
noVariations.add(acceptableStart);
break;
}
}
}
if (noVariations.size() > 1) {
throw new TaskDependencyException(
"Failed to fulfill constraints of task="
+ dependant
+ ". There are "
+ noVariations.size()
+ " constraints which don't allow for task start variation");
}
//
Collections.sort(startEarlierVariations);
Collections.sort(startLaterVariations);
//
GanttCalendar solution;
GanttCalendar earliestStart = (GanttCalendar) (startEarlierVariations
.size() == 0 ? null : startEarlierVariations.get(0));
GanttCalendar latestStart = (GanttCalendar) (startLaterVariations
.size() >= 0 ? startLaterVariations
.get(startLaterVariations.size() - 1) : null);
if (earliestStart == null && latestStart == null) {
solution = dependant.getStart();
} else {
if (earliestStart == null && latestStart != null) {
earliestStart = latestStart;
} else if (earliestStart != null && latestStart == null) {
latestStart = earliestStart;
}
if (earliestStart.compareTo(latestStart) < 0) {
throw new TaskDependencyException(
"Failed to fulfill constraints of task="
+ dependant);
}
}
if (noVariations.size() > 0) {
GanttCalendar notVariableStart = (GanttCalendar) noVariations
.get(0);
if (notVariableStart.compareTo(earliestStart) < 0
|| notVariableStart.compareTo(latestStart) > 0) {
throw new TaskDependencyException(
"Failed to fulfill constraints of task="
+ dependant);
}
solution = notVariableStart;
} else {
solution = latestStart;
}
//
modifyTaskStart(dependant, solution);
}
}
private void modifyTaskStart(Task task, GanttCalendar newStart) {
TaskMutator mutator = task.createMutator();
mutator.createFixedDurationTimeInterval().setStartDate(newStart.getTime());
mutator.commit();
myModifiedTasks.add(task);
}
private void modifyTaskEnd(Task task, GanttCalendar taskEnd) {
task.setEnd(taskEnd);
myModifiedTasks.add(task);
}
private void buildDistanceGraph(Task changedTask) {
TaskDependency[] depsAsDependee = changedTask
.getDependenciesAsDependee().toArray();
buildDistanceGraph(depsAsDependee, 1);
}
private void buildDistanceGraph(TaskDependency[] deps, int distance) {
if (deps.length == 0) {
return;
}
Integer key = new Integer(distance);
List depsList = (List) myDistance2dependencyList.get(key);
if (depsList == null) {
depsList = new ArrayList();
myDistance2dependencyList.put(key, depsList);
}
depsList.addAll(Arrays.asList(deps));
for (int i = 0; i < deps.length; i++) {
Task dependant = deps[i].getDependant();
TaskDependency[] nextStepDeps = dependant
.getDependenciesAsDependee().toArray();
buildDistanceGraph(nextStepDeps, ++distance);
}
}
/*
* private void forwardScheduling(Task changedTask,
* TaskContainmentHierarchyFacade containmentFacade) { //new
* Exception().printStackTrace(); //System.out.println("forword scheduling:
* "+count++); //for Debug CL /////////////////////////////////
* //setAllDependencies(); ////Code should be deleted after the depend has
* been replaced by successors //////////////////////////////// ArrayList
* taskNodes = null;//getAllTasks(); for (int i = 0; i < taskNodes.size();
* i++) { DefaultMutableTreeNode node = (DefaultMutableTreeNode)
* taskNodes.get(i); if (node.getChildCount() == 0) { //it is not a mother
* task GanttTask task = (GanttTask) node.getUserObject(); if
* (!task.isChecked()) { findEarliestStart(task); } } } //Treat the mother
* task. (the children have been scheduled.) //start date of mother task
* should be the earliest start date of its children //finish date of mother
* task is the last finish date of its children for (int i = 0; i <
* taskNodes.size(); i++) { DefaultMutableTreeNode node =
* (DefaultMutableTreeNode) taskNodes.get(i); if (node.getChildCount() != 0) {
* //it is a mother task if (node.isRoot()) { continue; } Task task = (Task)
* node.getUserObject(); GanttCalendar earliestStartDate = new
* GanttCalendar(2949, 10, 1); GanttCalendar earliestFinishDate = new
* GanttCalendar(1049, 10, 1); //find the earliest date of children's start
* dates //find the last finish date of children's finish dates Enumeration
* childNodes = node.children(); while (childNodes.hasMoreElements()) { Task
* childTask = (Task) ((DefaultMutableTreeNode) childNodes.nextElement()).
* getUserObject(); if (earliestStartDate.compareTo(childTask.getStart()) >
* 0) { earliestStartDate = childTask.getStart().Clone(); } if
* (earliestFinishDate.compareTo(childTask.getEnd()) < 0) {
* earliestFinishDate = childTask.getEnd().Clone(); } }
* task.setStart(earliestStartDate); task.setEnd(earliestFinishDate); } } }
* //static int countFindEarliestStart=0;//for Debug CL private void
* findEarliestStart(Task task) { //System.out.println("I m in
* findEarliestStart for "+countFindEarliestStart++);//for Debug CL
* GanttCalendar earliestStart = new GanttCalendar(1099, 10, 1); //set the
* earliest start date to be some date impossible. at least where I don't
* care:) if (!isMarked(task)) { TaskDependency[] asDependant =
* task.getDependenciesAsDependant().toArray(); //for the task without
* predecessor, the start date is the earliest start date if
* (asDependant.length==0) { markTask(task); return; } //If there are
* predecessors, the earliest date should be depended //on the relationship
* type and start or end date of each predecessor. for (int i = 0; i <
* asDependant.length; i++) { Task predecessorTask =
* asDependant[i].getDependee(); int relationshipType =
* ((GanttTaskRelationship) predecessors.get(i)).getRelationshipType(); if
* (relationshipType == GanttTaskRelationship.FS) {
* //////////////////////////////////// //FS realtionship: the earliest
* start date should be the //latest earliest finish date of all the
* predecessors //////////////////////////////////// if
* (!predecessorTask.isChecked()) { //If ther predecessor has not been
* checked, check it here. It is a recursive algorithm
* findEarliestStart(predecessorTask); } if (predecessorTask.isChecked()) {
* //if checked, the start and end date are valid GanttCalendar temp =
* predecessorTask.getEnd().Clone(); //temp.add(1); //should be one day
* behind the predecessor finish date. if (temp.compareTo(earliestStart) >
* 0) { //if the current earliest start is earlier than the end date of one
* of its prodecessor, it set equal to the end date of this predecessor
* earliestStart = temp; } } } else if (relationshipType ==
* GanttTaskRelationship.FF) { //////////////////////////////////// //FF
* realtionship: As soon as the predecessor task finishes, //the successor
* task can finish //////////////////////////////////// if
* (!predecessorTask.isChecked()) { findEarliestStart(predecessorTask);
* //check the predecessor } if (predecessorTask.isChecked()) {
* GanttCalendar temp = predecessorTask.getEnd().Clone(); GanttCalendar
* earliestFinish = earliestStart; earliestFinish.add(task.getLength()); if
* (earliestFinish.compareTo(temp) < 0) { //if the earliest finish is
* earlier than the end date of its predecessor, it set equal to the end
* date of predecessor earliestFinish = temp.Clone(); earliestStart =
* earliestFinish.Clone(); earliestStart.add(-task.getLength()); } else {
* //do nothing, if it is behind end date of predecessor } } } else if
* (relationshipType == GanttTaskRelationship.SF) {
* //////////////////////////////////// //SF realtionship: As soon as the
* predecessor task starts, //the successor task can finish.
* //////////////////////////////////// if (!predecessorTask.isChecked()) {
* findEarliestStart(predecessorTask); //if the predecessor has not been
* checked, check it here. it is a recursive algorithm } if
* (predecessorTask.isChecked()) { GanttCalendar temp =
* predecessorTask.getStart().Clone(); GanttCalendar earliestFinish =
* earliestStart; earliestFinish.add(task.getLength()); if
* (earliestFinish.compareTo(temp) < 0) { //if the earliest finish of the
* task is earlier than the start date of one of its predecessors, it set
* equal to the start date of the predecessor earliestFinish = temp.Clone();
* earliestStart = earliestFinish.Clone();
* earliestStart.add(-task.getLength()); } else { //already satisfied the SF
* relationship, do nothing } } } else if (relationshipType ==
* GanttTaskRelationship.SS) { //////////////////////////////////// //SS
* realtionship: As soon as the predecessor task starts, //the successor
* task can start. //////////////////////////////////// if
* (!predecessorTask.isChecked()) { findEarliestStart(predecessorTask); //if
* the predecessor has not been checked, check it here. it is a recursive
* algorithm } if (predecessorTask.isChecked()) { GanttCalendar temp =
* predecessorTask.getStart().Clone(); if (earliestStart.compareTo(temp) <
* 0) { // if the start date of the task is earlier than the start date of
* its predecessor, it set equal to the start date of predecessor
* earliestStart = temp.Clone(); } else { //already satisfied the SS
* relationship, do nothing. } } } } if
* (earliestStart.compareTo(task.getStart()) < 0) { //if the actual start is
* behind earliest start, don't need to do anything } else {
* task.setStart(earliestStart); GanttCalendar temp = earliestStart.Clone();
* temp.add(task.getLength()); task.setEnd(temp); } task.setChecked(true); }
* return; }
*/
private void markTask(Task task) {
myMarkedTasks.add(task);
}
private boolean isMarked(Task task) {
return myMarkedTasks.contains(task);
}
protected abstract TaskContainmentHierarchyFacade createContainmentFacade();
}
The table below shows all metrics for RecalculateTaskScheduleAlgorithm.java.
| Metric | Value | Description | |
|---|---|---|---|
| BLOCKS | 41.00 | Number of blocks | |
| BLOCK_COMMENT | 100.00 | Number of block comment lines | |
| COMMENTS | 111.00 | Comment lines | |
| COMMENT_DENSITY | 0.58 | Comment density | |
| COMPARISONS | 32.00 | Number of comparison operators | |
| CYCLOMATIC | 45.00 | Cyclomatic complexity | |
| DECL_COMMENTS | 2.00 | Comments in declarations | |
| DOC_COMMENT | 3.00 | Number of javadoc comment lines | |
| ELOC | 192.00 | Effective lines of code | |
| EXEC_COMMENTS | 6.00 | Comments in executable code | |
| EXITS | 51.00 | Procedure exits | |
| FUNCTIONS | 15.00 | Number of function declarations | |
| HALSTEAD_DIFFICULTY | 0.93 | Halstead difficulty | |
| HALSTEAD_EFFORT | 0.00 | Halstead effort | |
| INTERFACE_COMPLEXITY | 41.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 | 1.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 | 3.00 | JAVA0029 Private method not used | |
| JAVA0030 | 0.00 | JAVA0030 Private field not used | |
| JAVA0031 | 0.00 | JAVA0031 Case statement not properly closed | |
| JAVA0032 | 1.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 | 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 | 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 | 1.00 | JAVA0080 Import declaration not used | |
| JAVA0081 | 0.00 | JAVA0081 Boolean literal in comparison | |
| JAVA0082 | 2.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 | 0.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 | 0.00 | JAVA0108 Incorrect javadoc: no @param tag for 'parameter' | |
| JAVA0109 | 0.00 | JAVA0109 Incorrect javadoc: no parameter 'parameter' | |
| JAVA0110 | 0.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 | 1.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 | 6.00 | JAVA0117 Missing javadoc: method 'method' | |
| JAVA0118 | 0.00 | JAVA0118 Missing javadoc: type 'type' | |
| JAVA0119 | 0.00 | JAVA0119 Control variable changed within body of for loop | |
| JAVA0123 | 3.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 | 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 | 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 | 14.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 | 1.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 | 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 | 3.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 | 3.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 | |
| JAVA0289 | 1.00 | null | |
| LINES | 371.00 | Number of lines in the source file | |
| LINE_COMMENT | 8.00 | Number of line comments | |
| LOC | 232.00 | Lines of code | |
| LOGICAL_LINES | 137.00 | Number of statements | |
| LOOPS | 7.00 | Number of loops | |
| NEST_DEPTH | 4.00 | Maximum nesting depth | |
| OPERANDS | 538.00 | Number of operands | |
| OPERATORS | 984.00 | Number of operators | |
| PARAMS | 16.00 | Number of formal parameter declarations | |
| PROGRAM_LENGTH | 1522.00 | Halstead program length | |
| PROGRAM_VOCAB | 217.00 | Halstead program vocabulary | |
| PROGRAM_VOLUME | 0.00 | Halstead program volume | |
| RETURNS | 25.00 | Number of return points from functions | |
| SIZE | 17407.00 | Size of the file in bytes | |
| UNIQUE_OPERANDS | 168.00 | Number of unique operands | |
| UNIQUE_OPERATORS | 49.00 | Number of unique operators | |
| WHITESPACE | 28.00 | Number of whitespace lines | |