BugTreeModel.java
| Index Score | ||
|---|---|---|
 |
 |
edu.umd.cs.findbugs.gui2 |
 |
 |
FindBugs |
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 | |
|---|---|---|
| EXEC_COMMENTS | Comments in executable code |  |
| LINE_COMMENT | Number of line comments | |
| JAVA0034 | JAVA0034 Missing braces in if statement | |
| JAVA0144 | JAVA0144 Line exceeds maximum M characters | |
| CYCLOMATIC | Cyclomatic complexity | |
| LOOPS | Number of loops | |
| OPERATORS | Number of operators | |
| PROGRAM_LENGTH | Halstead program length | |
| OPERANDS | Number of operands | |
| LOC | Lines of code | |
| SIZE | Size of the file in bytes | |
| COMPARISONS | Number of comparison operators | |
| EXITS | Procedure exits | |
| LOGICAL_LINES | Number of statements | |
| BLOCKS | Number of blocks | |
| JAVA0266 | JAVA0266 Use of System.out | |
| INTERFACE_COMPLEXITY | Interface complexity | |
| LINES | Number of lines in the source file | |
| RETURNS | Number of return points from functions | |
| JAVA0145 | JAVA0145 Tab character used in source file | |
| FUNCTIONS | Number of function declarations | |
| ELOC | Effective lines of code | |
| UNIQUE_OPERANDS | Number of unique operands | |
| JAVA0081 | JAVA0081 Boolean literal in comparison | |
| PROGRAM_VOCAB | Halstead program vocabulary | |
| PARAMS | Number of formal parameter declarations | |
| JAVA0117 | JAVA0117 Missing javadoc: method 'method' | |
| JAVA0270 | JAVA0270 Use Java 5.0 enhanced for loop construct to iterate over all elements in an array | |
| JAVA0267 | JAVA0267 Use of System.err | |
| JAVA0035 | JAVA0035 Missing braces in for statement | |
| UNIQUE_OPERATORS | Number of unique operators | |
| JAVA0102 | JAVA0102 Last statement in finalize() not super.finalize() | |
| COMMENTS | Comment lines | |
| JAVA0128 | JAVA0128 Public constructor in non-public class | |
| PROGRAM_VOLUME | Halstead program volume | |
| WHITESPACE | Number of whitespace lines | |
| JAVA0136 | JAVA0136 N methods defined in class (maximum: M) | |
| JAVA0126 | JAVA0126 Method declares unchecked exception in throws | |
| JAVA0110 | JAVA0110 Incorrect javadoc: no @return tag | |
| JAVA0173 | JAVA0173 Unused method parameter | |
| JAVA0029 | JAVA0029 Private method not used | |
| JAVA0100 | JAVA0100 Class contains N non-final fields (maximum: M) | |
| JAVA0108 | JAVA0108 Incorrect javadoc: no @param tag for 'parameter' | |
| DOC_COMMENT | Number of javadoc comment lines | |
| DECL_COMMENTS | Comments in declarations | |
| JAVA0130 | JAVA0130 Non-static method does not use instance fields | |
| BLOCK_COMMENT | Number of block comment lines | |
| NEST_DEPTH | Maximum nesting depth | |
/*
* FindBugs - Find Bugs in Java programs
* Copyright (C) 2006, University of Maryland
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston MA 02111-1307, USA
*/
package edu.umd.cs.findbugs.gui2;
import java.util.ArrayList;
import java.util.List;
import java.util.Vector;
import javax.swing.JTree;
import javax.swing.SwingUtilities;
import javax.swing.event.ChangeEvent;
import javax.swing.event.ListSelectionEvent;
import javax.swing.event.TableColumnModelEvent;
import javax.swing.event.TableColumnModelListener;
import javax.swing.event.TreeExpansionEvent;
import javax.swing.event.TreeExpansionListener;
import javax.swing.event.TreeModelEvent;
import javax.swing.event.TreeModelListener;
import javax.swing.tree.TreeModel;
import javax.swing.tree.TreePath;
import edu.umd.cs.findbugs.BugInstance;
import edu.umd.cs.findbugs.gui2.BugAspects.SortableValue;
/*
* Our TreeModel. Once upon a time it was a simple model, that queried data, its BugSet, for what to show under each branch
* Then it got more and more complicated, no one knows why it still seems to work... or why it doesn't if it in fact doesn't.
*
* Here's a tip, Dont even attempt to deal with suppressions or filtering and their related tree model events without the API
* for TreeModelEvents open. And read it three times first. Ignore the fact that its inconsistent for sending events about the root, just pick one of the things it says and go with it
*
* Heres the order things MUST be done when dealing with suppressions, filtering, unsuppressions... unfiltering... all that fun stuff
*
* Inserts:
* Update model
* Get Path
* Make Event
* Send Event
* ResetData
*
* Removes:
* Get Path
* Make Event
* Update Model
* Send Event
* ResetData
*
* Restructure:
* Update Model
* Get Path
* Make Event
* Send Event
* resetData? hmmm
*
* These may or may not be the orders of events used in suppressBug, unsuppressBug, branchOperations and so forth
* if they seem to work anyway, I wouldn't touch them.
*
* changeSet() is what to do when the data set is completely different (loaded a new collection, reran the analysis what have you)
* changeSet calls rebuild(), which does a very tricky thing, where it makes a new model, and a new JTree, and swaps them in in place of this one, as well as
* turning off user input in hopefully every place it needs to be turned off
*
*/
/**
* The treeModel for our JTree
*/
public class BugTreeModel implements TreeModel, TableColumnModelListener, TreeExpansionListener
{
private BugAspects root = new BugAspects();
private SorterTableColumnModel st;
private BugSet data;
private ArrayList<TreeModelListener> listeners = new ArrayList<TreeModelListener>();
private JTree tree;
static Vector<BugLeafNode> selectedBugLeafNodes = new Vector<BugLeafNode>();
private static final boolean DEBUG = false;
private volatile Thread rebuildingThread;
private boolean sortOrderChanged;
private boolean sortsAddedOrRemoved;
public BugTreeModel(JTree tree, SorterTableColumnModel st, BugSet data)
{
st.addColumnModelListener(this);
this.tree = tree;
this.st = st;
this.data = data;
BugSet.setAsRootAndCache(this.data);
root.setCount(data.size());
FilterActivity.addFilterListener(bugTreeFilterListener);
if (DEBUG)
this.addTreeModelListener(new TreeModelListener() {
public void treeNodesChanged(TreeModelEvent arg0) {
System.out.println("Tree nodes changed");
System.out.println(" " + arg0.getTreePath());
}
public void treeNodesInserted(TreeModelEvent arg0) {
System.out.println("Tree nodes inserted");
System.out.println(" " + arg0.getTreePath());
}
public void treeNodesRemoved(TreeModelEvent arg0) {
System.out.println("Tree nodes removed");
System.out.println(" " + arg0.getTreePath());
}
public void treeStructureChanged(TreeModelEvent arg0) {
System.out.println("Tree structure changed");
System.out.println(" " + arg0.getTreePath());
}});
}
public BugTreeModel(BugTreeModel other)
{
this.root = new BugAspects(other.root);
this.st = other.st;
this.data = new BugSet(other.data);
//this.listeners = other.listeners;
this.tree = other.tree;
}
public void getOffListenerList()
{
FilterActivity.removeFilterListener(bugTreeFilterListener);
st.removeColumnModelListener(this);
tree.removeTreeExpansionListener(this);
}
public Object getRoot()
{
return root;
}
public Object getChild(Object o, int index) {
Object result = getChild0(o,index);
assert o != null : "child " + index + " of " + this + " is null";
return result;
}
public Object getChild0(Object o, int index)
{
BugAspects a = (BugAspects) o;
if (st.getOrderBeforeDivider().size()==0 && a.size()==0)//Root without any sortables
return data.get(index);
try
{
if ((a.size() == 0) || (a.last().key != st.getOrderBeforeDivider().get(st.getOrderBeforeDivider().size() - 1)))
{
BugAspects child=a.addToNew(enumsThatExist(a).get(index));
child.setCount(data.query(child).size());
return child;
}
else
return data.query(a).get(index);
}
catch (IndexOutOfBoundsException e)
{
Debug.println("IndexOutOfBounds caught: I am treemodel #" + this + "I am no longer the current treemodel," +
" my data is cached and I return bad values for getChild. Something is wrong with rebuild," +
" since the tree is asking both of us for children");
return null;
}
}
public int getChildCount(Object o)
{
// long start = bean.getCurrentThreadCpuTime();
// try
// {
// System.out.println("# getChildCount [o = " + o + "]");
// System.out.println("getChildCount: " + Thread.currentThread().toString());
if(!(o instanceof BugAspects))
return 0;
BugAspects a = (BugAspects) o;
if (st.getOrderBeforeDivider().size()==0 && a.size() == 0)//If its the root and we aren't sorting by anything
return data.size();
if ((a.size() == 0) || (a.last().key != st.getOrderBeforeDivider().get(st.getOrderBeforeDivider().size() - 1)))
// {
// System.out.println("# before enumsThatExist: " + (bean.getCurrentThreadCpuTime() - start));
return enumsThatExist(a).size();
// }
else
// {
// System.out.println("# before query: " + (bean.getCurrentThreadCpuTime() - start));
return data.query(a).size();
// }
// }
// finally
// {
// System.out.println("# finished: " + (bean.getCurrentThreadCpuTime() - start));
// }
}
/*This contract has been changed to return a HashList of Stringpair, our own data structure in which finding the index of an object in the list is very fast*/
private HashList<SortableValue> enumsThatExist(BugAspects a)
{
// long start = bean.getCurrentThreadCpuTime();
// System.out.println(" ## enumsThatExist [a = " + a + "]");
// try
// {
//StringPair[] toCheck = null;
if (st.getOrderBeforeDivider().size()==0)
return null;
// if (a.size() == 0) // root
// toCheck = getValues(st.getOrder().get(0));
// else if (st.getOrder().indexOf(a.get(a.size() - 1).key) == st.getOrder().size() - 1) // last branch
// return null;
// else // somewhere in between
// toCheck = getValues(st.getOrder().get(st.getOrder().indexOf(a.get(a.size() - 1).key) + 1));
// BugSet set = data.query(a);
// System.out.println(" ## after query: " + (bean.getCurrentThreadCpuTime() - start));
// for (StringPair sp : toCheck)
// if (set.contains(sp))
// result.add(sp);
// System.out.println(" ## after loop (" + toCheck.length + " elements): " + (bean.getCurrentThreadCpuTime() - start));
// return result;
Sortables key = (a.size() == 0 ?
st.getOrderBeforeDivider().get(0) :
st.getOrderBeforeDivider().get(st.getOrderBeforeDivider().indexOf(a.last().key) + 1));
String[] all = key.getAll(data.query(a));
ArrayList<SortableValue> result = new ArrayList<SortableValue>();
for (String i : all)
result.add(new SortableValue(key, i));
// System.out.println(" ## before sort: " + (bean.getCurrentThreadCpuTime() - start));
// Collections.sort(result, key);
// System.out.println(" ## after sort: " + (bean.getCurrentThreadCpuTime() - start));
return new HashList<SortableValue>(result);
// }
// finally
// {
// System.out.println(" ## finished: " + (bean.getCurrentThreadCpuTime() - start));
// }
}
public boolean isLeaf(Object o)
{
return (o instanceof BugLeafNode);
}
public void valueForPathChanged(TreePath arg0, Object arg1) {}
public int getIndexOfChild(Object parent, Object child)
{
if (parent == null || child == null || isLeaf(parent))
return -1;
if (isLeaf(child))
{
return data.query((BugAspects) parent).indexOf((BugLeafNode) child);
}
else
{
HashList<SortableValue> stringPairs = enumsThatExist((BugAspects) parent);
if (stringPairs==null)
{
//XXX-Threading difficulties-stringpairs is null somehow
Debug.println("Stringpairs is null on getIndexOfChild! Error!");
assert(false);
return -1;
}
return stringPairs.indexOf(((BugAspects)child).last());
// for (int i = 0; i < stringPairs.size(); i++)
// if (stringPairs.get(i).equals(((BugAspects)child).get(((BugAspects)child).size() -1)))
// return i;
//
// if (stringPairArray[i] == ((BugAspects)child).get(((BugAspects)child).size() - 1))
// return i;
// return -1;
}
}
public void addTreeModelListener(TreeModelListener listener)
{
listeners.add(listener);
}
public void removeTreeModelListener(TreeModelListener listener)
{
listeners.remove(listener);
}
private static SortableValue[] getValues(Sortables key)
{
String[] values= key.getAllSorted();
SortableValue[] result = new SortableValue[values.length];
for (int i = 0; i < values.length; i++)
{
result[i] = new SortableValue(key, values[i]);
}
return result;
}
public void columnAdded(TableColumnModelEvent e)
{
sortsAddedOrRemoved=true;
//rebuild();
}
public void columnRemoved(TableColumnModelEvent e)
{
sortsAddedOrRemoved=true;
//rebuild();
}
public void columnMoved(final TableColumnModelEvent evt)
{
if (evt.getFromIndex() == evt.getToIndex())
return;
sortOrderChanged=true;
//rebuild();
}
void changeSet(BugSet set)
{
BugSet.setAsRootAndCache(set);
data=new BugSet(set);
root.setCount(data.size());
rebuild();
}
/**
* Swaps in a new BugTreeModel and a new JTree
*
*/
private void rebuild()
{
if (TRACE) System.out.println("rebuilding bug tree model");
PreferencesFrame.getInstance().freeze();
st.freezeOrder();
MainFrame.getInstance().setRebuilding(true);
NewFilterFromBug.closeAll();
//If this thread is not interrupting a previous thread, set the paths to be opened when the new tree is complete
//If the thread is interrupting another thread, dont do this, because you dont have the tree with the correct paths selected
//As of now, it should be impossible to interrupt a rebuilding thread, in another version this may change, so this if statement check is left in, even though it should always be true.
if (rebuildingThread==null)
setOldSelectedBugs();
Debug.println("Please Wait called right before starting rebuild thread");
pleaseWait();
rebuildingThread = new Thread()
{
BugTreeModel newModel;
@Override
public void run()
{
try
{
newModel = new BugTreeModel(BugTreeModel.this);
newModel.listeners = listeners;
newModel.resetData();
newModel.data.sortList();
}
finally
{
rebuildingThread = null;
SwingUtilities.invokeLater(new Runnable() {
public void run() {
if (newModel != null) {
JTree newTree = new JTree(newModel);
newModel.tree = newTree;
MainFrame.getInstance().newTree(newTree,newModel);
}
getOffListenerList();
MainFrame.getInstance().setRebuilding(false);
PreferencesFrame.getInstance().thaw();
//st.thawOrder should be the last thing that happens, otherwise a very determined user could slip a new order in before we allow him to rebuild the tree, things get out of sync, nothing bad happens, it just looks wrong until he resorts.
st.thawOrder();
}});
}
}
};
rebuildingThread.start();
}
public void crawl(final ArrayList<BugAspects> path, final int depth)
{
for (int i = 0; i < getChildCount(path.get(path.size() - 1)); i++)
if (depth > 0)
{
ArrayList<BugAspects> newPath = new ArrayList<BugAspects>(path);
newPath.add((BugAspects) getChild(path.get(path.size() - 1), i));
crawl(newPath, depth - 1);
}
else
{
for (TreeModelListener l : listeners)
l.treeStructureChanged(new TreeModelEvent(this, path.toArray()));
}
}
void openPreviouslySelected(List<BugLeafNode> selected)
{
BugInstance bug=null;
TreePath path=null;
Debug.println("Starting Open Previously Selected");
for (BugLeafNode b: selected)
{
try
{
bug=b.getBug();
path=getPathToBug(bug);
MainFrame.getInstance().tree.expandPath(path.getParentPath());
MainFrame.getInstance().tree.addSelectionPath(path);
}
catch(NullPointerException e)
{
//Try to recover!
if (MainFrame.DEBUG) System.err.println("Failure opening a selected node, node will not be opened in new tree");
// System.err.println(b); This will be accurate
// System.err.println(bug); This will be accurate
//System.err.println(path);
// e.printStackTrace();
continue;
}
catch(ArrayIndexOutOfBoundsException e)
{
//System.err.println("Failure opening a selected node");
//System.err.println(b);
//System.err.println(bug);
//System.err.println(path);
if (MainFrame.DEBUG) System.err.println("Failure opening a selected node, node will not be opened in new tree");
// e.printStackTrace();
continue;
}
}
}
/* Recursively traverses the tree, opens all nodes matching any bug
* in the list, then creates the full paths to the bugs that are selected
* This keeps whatever bugs were selected selected when sorting
* DEPRECATED--Too Slow, use openPreviouslySelected
*/
public void crawlToOpen(TreePath path, ArrayList<BugLeafNode> bugLeafNodes, ArrayList<TreePath> treePaths)
{
for (int i = 0; i < getChildCount(path.getLastPathComponent()); i++)
{
if (!isLeaf(getChild(path.getLastPathComponent(), i)))
for (BugLeafNode p : bugLeafNodes)
{
if (p.matches((BugAspects) getChild(path.getLastPathComponent(), i)))
{
tree.expandPath(path);
crawlToOpen(path.pathByAddingChild(getChild(path.getLastPathComponent(), i)), bugLeafNodes, treePaths);
break;
}
}
else
{
for (BugLeafNode b: bugLeafNodes)
{
if (getChild(path.getLastPathComponent(),i).equals(b) )
{
tree.expandPath(path);
treePaths.add(path.pathByAddingChild(getChild(path.getLastPathComponent(), i)));
}
}
}
}
}
public static boolean TRACE = false;
public void resetData()//FIXME: Does this need a setAsRootAndCache() on the new BugSet?
{
if (TRACE) System.out.println("Reseting data in bug tree model");
data=new BugSet(data);
}
FilterListener bugTreeFilterListener = new MyFilterListener();
class MyFilterListener implements FilterListener {
public void clearCache()
{
if (TRACE) System.out.println("clearing cache in bug tree model");
resetData();
BugSet.setAsRootAndCache(data);//FIXME: Should this be in resetData? Does this allow our main list to not be the same as the data in our tree?
root.setCount(data.size());
rebuild();
}
public void unsuppressBug(TreePath path)
{
if (TRACE) System.out.println("unsuppressing bug");
if (path==null)
return;
TreePath pathToFirstDeleted=null;
Object[] objPath=path.getParentPath().getPath();
ArrayList<Object> reconstruct=new ArrayList<Object>();
boolean earlyStop=false;
for (int x=0; x<objPath.length;x++)
{
Object o=objPath[x];
reconstruct.add(o);
if (o instanceof BugAspects)
{
pathToFirstDeleted=new TreePath(reconstruct.toArray());
((BugAspects)o).setCount(((BugAspects)o).getCount()+1);
if (((BugAspects)o).getCount()==2 && reconstruct.size() >1)
{
earlyStop=true;
break;
}
for (TreeModelListener l: listeners)
{
if (pathToFirstDeleted.getParentPath()!=null)
l.treeNodesChanged(new TreeModelEvent(this, pathToFirstDeleted.getParentPath(),new int[]{getIndexOfChild(pathToFirstDeleted.getParentPath().getLastPathComponent(),pathToFirstDeleted.getLastPathComponent())}, new Object[]{pathToFirstDeleted.getLastPathComponent()}));
}
}
}
if (path.getParentPath()==null)//They are unsuppressing from the root, but we don't allow root to be suppressed, Dont know what to do here
{
throw new RuntimeException();
}
if (pathToFirstDeleted==null)
{
pathToFirstDeleted=path;
}
if (earlyStop==false)
{
pathToFirstDeleted=pathToFirstDeleted.pathByAddingChild(path.getLastPathComponent());
}
Object parent=pathToFirstDeleted.getParentPath().getLastPathComponent();
Object child=pathToFirstDeleted.getLastPathComponent();
TreeModelEvent insertionEvent=new TreeModelEvent(this, pathToFirstDeleted.getParentPath(),new int[]{getIndexOfChild(parent,child)}, new Object[]{child});
for (TreeModelListener l: listeners)
{
l.treeNodesInserted(insertionEvent);
}
if (!isLeaf(child))
{
TreeModelEvent structureEvent=new TreeModelEvent(this, pathToFirstDeleted,new int[0], new Object[0]);
for (TreeModelListener l: listeners)
{
l.treeStructureChanged(structureEvent);
}
}
}
public void suppressBug(TreePath path)
{
if (TRACE) System.out.println("unsuppressing bug");
Debug.println(path);
Object[] objPath=path.getParentPath().getPath();
ArrayList<Object> reconstruct=new ArrayList<Object>();
for (int x=0; x< objPath.length;x++)
{
Object o=objPath[x];
((BugAspects)o).setCount(((BugAspects)o).getCount()-1);
}
for (int x=0; x< objPath.length;x++)
{
Object o=objPath[x];
reconstruct.add(o);
if (o instanceof BugAspects)
{
if (((BugAspects)o).getCount()==0)
{
path=new TreePath(reconstruct.toArray());
break;
}
}
}
TreeModelEvent event;
if (path.getParentPath()==null)//They are suppressing the last bug in the tree
{
event=new TreeModelEvent(this,path,new int[]{0},new Object[]{BugTreeModel.this.getChild(root,0)});
root.setCount(0);
}
else
{
Object parent = path.getParentPath().getLastPathComponent();
Object child = path.getLastPathComponent();
int indexOfChild=getIndexOfChild(parent,child);
if (indexOfChild!=-1)
{
event=new TreeModelEvent(this, path.getParentPath(),new int[]{indexOfChild}, new Object[]{child});
resetData();
}
else//They are suppressing something that has already been filtered out by setting a designation of a bug to a type that has been filtered out.
{
resetData();
for (TreeModelListener l: listeners)
{
l.treeStructureChanged(new TreeModelEvent(this, path.getParentPath()));
}
return;
}
}
for (TreeModelListener l: listeners)
{
l.treeNodesRemoved(event);
}
}
}
void treeNodeChanged(TreePath path)
{
Debug.println("Tree Node Changed: " + path);
if (path.getParentPath()==null)
{
TreeModelEvent event=new TreeModelEvent(this,path,null,null);
for (TreeModelListener l:listeners)
{
l.treeNodesChanged(event);
}
return;
}
TreeModelEvent event=new TreeModelEvent(this,path.getParentPath(),new int[]{getIndexOfChild(path.getParentPath().getLastPathComponent(),path.getLastPathComponent())},new Object[] {path.getLastPathComponent()});
for (TreeModelListener l: listeners)
{
l.treeNodesChanged(event);
}
}
public TreePath getPathToBug(BugInstance b)
{
//ArrayList<Sortables> order=MainFrame.getInstance().getSorter().getOrder();
List<Sortables> order=st.getOrderBeforeDivider();
//Create an array of BugAspects of lengths from one to the full BugAspect list of the bugInstance
BugAspects[] toBug=new BugAspects[order.size()];
for (int i=0; i < order.size(); i++)
toBug[i]=new BugAspects();
for (int x=0; x< order.size();x++)
{
for (int y=0; y<=x;y++)
{
Sortables s = order.get(y);
toBug[x].add(new SortableValue(s,s.getFrom(b)));
}
}
//Add this array as elements of the path
TreePath pathToBug=new TreePath(root);
for (int x=0;x<order.size();x++)
{
int index=getIndexOfChild(pathToBug.getLastPathComponent(),toBug[x]);
if (index==-1)
{
if (MainFrame.DEBUG) System.err.println("Node does not exist in the tree");//For example, not a bug bugs are filtered, they set a bug to be not a bug it filters out
return null;
}
pathToBug=pathToBug.pathByAddingChild(getChild(pathToBug.getLastPathComponent(),index));
}
//Using a hashlist to store bugs in BugSet will make getIndexOfChild Waaaaaay faster, thus making this O(1) (avg case)
int index=getIndexOfChild(pathToBug.getLastPathComponent(),new BugLeafNode(b));
if(index == -1)
return null;
pathToBug=pathToBug.pathByAddingChild(getChild(pathToBug.getLastPathComponent(),index));
return pathToBug;
}
public TreePath getPathToNewlyUnsuppressedBug(BugInstance b)
{
resetData();
return getPathToBug(b);
}
@Override
protected void finalize() throws Throwable
{
super.finalize();
//this will inform us when the garbage collector finds our old bug tree models and deletes them, thus preventing obnoxiously hard to find bugs from not remembering to remove the model from our listeners
Debug.println("The BugTreeModel has been DELETED! This means there are no more references to it, and its finally off all of the stupid listener lists");
}
public void columnMarginChanged(ChangeEvent arg0) {}
public void columnSelectionChanged(ListSelectionEvent arg0) {}
public void treeExpanded(TreeExpansionEvent event) {
}
public void treeCollapsed(TreeExpansionEvent event) {
}
private void setOldSelectedBugs()
{
selectedBugLeafNodes.clear();
if (tree.getSelectionPaths() != null) // Who the cussword wrote this API anyway?
for (TreePath path : tree.getSelectionPaths())
if (isLeaf(path.getLastPathComponent()))
selectedBugLeafNodes.add((BugLeafNode) path.getLastPathComponent());
}
Vector<BugLeafNode> getOldSelectedBugs()
{
return selectedBugLeafNodes;
}
void checkSorter()
{
if (sortOrderChanged==true || sortsAddedOrRemoved==true)
{
sortOrderChanged=false;
sortsAddedOrRemoved=false;
rebuild();
}
// This old version isn't wrong... it just worries me, as it looks like we could rebuild twice, although
// we never do. Above version should be safer.
// if (sortOrderChanged==true)
// {
// sortOrderChanged=false;
// rebuild();
// }
// if (sortsAddedOrRemoved==true)
// {
// sortsAddedOrRemoved=false;
// rebuild();
// }
}
static void pleaseWait()
{
pleaseWait(null);
}
static void pleaseWait(final String message)
{
MainFrame.getInstance().showWaitCard();
}
public TreeModelEvent restructureBranch(ArrayList<String> stringsToBranch, boolean removing) throws BranchOperationException
{
if (removing)
return branchOperations(stringsToBranch, TreeModification.REMOVERESTRUCTURE);
else
return branchOperations(stringsToBranch, TreeModification.INSERTRESTRUCTURE);
}
public TreeModelEvent insertBranch(ArrayList<String> stringsToBranch) throws BranchOperationException
{
return branchOperations(stringsToBranch, TreeModification.INSERT);
}
public TreeModelEvent removeBranch(ArrayList<String> stringsToBranch) throws BranchOperationException
{
return branchOperations(stringsToBranch, TreeModification.REMOVE);
}
public void sortBranch(TreePath pathToBranch)
{
BugSet bs=data.query((BugAspects)pathToBranch.getLastPathComponent());
bs.sortList();
Debug.println("Data in sorted branch: " + pathToBranch.getLastPathComponent());
for (BugLeafNode b: bs)
{
Debug.println(b);
}
Object[] children=new Object[getChildCount(pathToBranch.getLastPathComponent())];
int[] childIndices=new int[children.length];
for (int x=0; x<children.length; x++)
{
children[x]=getChild(pathToBranch.getLastPathComponent(),x);
childIndices[x]=x;
}
for (TreeModelListener l: listeners)
{
TreeModelEvent event=new TreeModelEvent(this,pathToBranch,childIndices,children);
l.treeNodesChanged(event);
}
}
@SuppressWarnings("serial")
static class BranchOperationException extends Exception
{
public BranchOperationException(String s)
{
super(s);
}
}
enum TreeModification {REMOVE, INSERT, REMOVERESTRUCTURE, INSERTRESTRUCTURE};
private TreeModelEvent branchOperations(ArrayList<String> stringsToBranch, TreeModification whatToDo) throws BranchOperationException
{
TreeModelEvent event=null;
if (whatToDo==TreeModification.REMOVE)
Debug.println("Removing a branch......");
else if (whatToDo==TreeModification.INSERT)
Debug.println("Inserting a branch......");
else if (whatToDo==TreeModification.REMOVERESTRUCTURE)
Debug.println("Restructuring from branch to remove......");
else if (whatToDo==TreeModification.INSERTRESTRUCTURE)
Debug.println("Restructuring from branch to insert......");
Debug.println(stringsToBranch);
if (whatToDo==TreeModification.INSERT || whatToDo==TreeModification.INSERTRESTRUCTURE)
{
resetData();
}
//ArrayList<Sortables> order=MainFrame.getInstance().getSorter().getOrder();
List<Sortables> order=st.getOrderBeforeDivider();
//Create an array of BugAspects of lengths from one to the full BugAspect list of the bugInstance
BugAspects[] toBug=new BugAspects[stringsToBranch.size()];
for (int x=0; x < stringsToBranch.size(); x++) {
toBug[x]=new BugAspects();
for (int y=0; y<=x;y++)
{
Sortables s = order.get(y);
toBug[x].add(new SortableValue(s,stringsToBranch.get(y)));
}
}
//Add this array as elements of the path
TreePath pathToBranch=new TreePath(root);
for (int x=0;x<stringsToBranch.size();x++)
{
BugAspects child=toBug[x];
BugAspects parent=(BugAspects) pathToBranch.getLastPathComponent();
if (getIndexOfChild(parent,child)!=-1)
{
pathToBranch=pathToBranch.pathByAddingChild(child);
}
else
{
Debug.println(parent + " does not contain " + child);
throw new BranchOperationException("Branch has been filtered out by another filter.");
// break;
}
}
if (pathToBranch.getParentPath()!=null)
while (getChildCount(pathToBranch.getParentPath().getLastPathComponent())==1)
{
if (pathToBranch.getParentPath().getLastPathComponent().equals(root))
break;
pathToBranch=pathToBranch.getParentPath();
}
Debug.println(pathToBranch);
if (whatToDo==TreeModification.INSERT)
{
event=new TreeModelEvent(this,pathToBranch.getParentPath(),new int[]{getIndexOfChild(pathToBranch.getParentPath().getLastPathComponent(),pathToBranch.getLastPathComponent())}, new Object[]{pathToBranch.getLastPathComponent()});
}
else if (whatToDo==TreeModification.INSERTRESTRUCTURE)
{
event=new TreeModelEvent(this,pathToBranch);
}
if (whatToDo==TreeModification.REMOVE)
{
event=new TreeModelEvent(this,pathToBranch.getParentPath(),new int[]{getIndexOfChild(pathToBranch.getParentPath().getLastPathComponent(),pathToBranch.getLastPathComponent())}, new Object[]{pathToBranch.getLastPathComponent()});
}
else if (whatToDo==TreeModification.REMOVERESTRUCTURE)
{
event=new TreeModelEvent(this,pathToBranch);
}
if (whatToDo==TreeModification.REMOVE || whatToDo==TreeModification.REMOVERESTRUCTURE)
resetData();
return event;
}
void sendEvent(TreeModelEvent event, TreeModification whatToDo)
{
Debug.println("Sending An Event!");
if (event==null)
{
throw new IllegalStateException("Dont throw null events.");
}
resetData();
for (TreeModelListener l: listeners)
{
if (whatToDo==TreeModification.REMOVE)
l.treeNodesRemoved(event);
else if (whatToDo==TreeModification.INSERT)
{
l.treeNodesInserted(event);
l.treeStructureChanged(new TreeModelEvent(this,new TreePath(event.getPath()).pathByAddingChild(event.getChildren()[0])));
}
else if (whatToDo==TreeModification.INSERTRESTRUCTURE || whatToDo==TreeModification.REMOVERESTRUCTURE)
{
l.treeStructureChanged(event);
}
}
root.setCount(data.size());
TreePath changedPath=new TreePath(root);
treeNodeChanged(changedPath);
changedPath=new TreePath(event.getPath());
while (changedPath.getParentPath()!=null)
{
treeNodeChanged(changedPath);
changedPath=changedPath.getParentPath();
}
}
}
The table below shows all metrics for BugTreeModel.java.
| Metric | Value | Description | |
|---|---|---|---|
| BLOCKS | 121.00 | Number of blocks | |
| BLOCK_COMMENT | 62.00 | Number of block comment lines | |
| COMMENTS | 158.00 | Comment lines | |
| COMMENT_DENSITY | 0.35 | Comment density | |
| COMPARISONS | 91.00 | Number of comparison operators | |
| CYCLOMATIC | 144.00 | Cyclomatic complexity | |
| DECL_COMMENTS | 6.00 | Comments in declarations | |
| DOC_COMMENT | 7.00 | Number of javadoc comment lines | |
| ELOC | 447.00 | Effective lines of code | |
| EXEC_COMMENTS | 82.00 | Comments in executable code | |
| EXITS | 93.00 | Procedure exits | |
| FUNCTIONS | 52.00 | Number of function declarations | |
| HALSTEAD_DIFFICULTY | 115.89 | Halstead difficulty | |
| HALSTEAD_EFFORT | 0.00 | Halstead effort | |
| INTERFACE_COMPLEXITY | 128.00 | Interface complexity | |
| JAVA0001 | 1.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 | 1.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 | 1.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 | 35.00 | JAVA0034 Missing braces in if statement | |
| JAVA0035 | 2.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 | 1.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 | 3.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 | 0.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 | 1.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 | 1.00 | JAVA0116 Missing javadoc: field 'field' | |
| JAVA0117 | 14.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 | 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 | 1.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 | 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 | 22.00 | JAVA0144 Line exceeds maximum M characters | |
| JAVA0145 | 2764.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 | 1.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 | 0.00 | JAVA0179 Local variable hides visible field | |
| JAVA0233 | 0.00 | JAVA0233 Definition of serialVersionUID other than 'private static final long serialVersionUID' | |
| JAVA0234 | 1.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 | 0.00 | JAVA0254 Use enhanced for loop construct instead of Iterator | |
| JAVA0255 | 0.00 | JAVA0255 Result of method invocation not used | |
| JAVA0256 | 0.00 | JAVA0256 Assignment of external collection/array to field | |
| JAVA0257 | 0.00 | JAVA0257 Use of 'Constant Interface' anti-pattern | |
| JAVA0258 | 0.00 | JAVA0258 Implement Iterable for foreach compatibility | |
| JAVA0259 | 1.00 | JAVA0259 Return of collection/array field | |
| JAVA0260 | 0.00 | JAVA0260 Use 'enum' instead of Enumerated Type pattern | |
| JAVA0261 | 0.00 | JAVA0261 Use specialized Enum collection types | |
| JAVA0262 | 0.00 | JAVA0262 Use of char in integer context | |
| JAVA0263 | 0.00 | JAVA0263 Long literal ends with 'l' instead of 'L' | |
| JAVA0264 | 0.00 | JAVA0264 Integer math in long context - check for overflow | |
| JAVA0265 | 0.00 | JAVA0265 Use of Throwable.printStackTrace() | |
| JAVA0266 | 13.00 | JAVA0266 Use of System.out | |
| JAVA0267 | 3.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 | |
| LINES | 952.00 | Number of lines in the source file | |
| LINE_COMMENT | 89.00 | Number of line comments | |
| LOC | 677.00 | Lines of code | |
| LOGICAL_LINES | 309.00 | Number of statements | |
| LOOPS | 16.00 | Number of loops | |
| NEST_DEPTH | 5.00 | Maximum nesting depth | |
| OPERANDS | 1536.00 | Number of operands | |
| OPERATORS | 3050.00 | Number of operators | |
| PARAMS | 52.00 | Number of formal parameter declarations | |
| PROGRAM_LENGTH | 4586.00 | Halstead program length | |
| PROGRAM_VOCAB | 450.00 | Halstead program vocabulary | |
| PROGRAM_VOLUME | 0.00 | Halstead program volume | |
| RETURNS | 76.00 | Number of return points from functions | |
| SIZE | 30128.00 | Size of the file in bytes | |
| UNIQUE_OPERANDS | 391.00 | Number of unique operands | |
| UNIQUE_OPERATORS | 59.00 | Number of unique operators | |
| WHITESPACE | 117.00 | Number of whitespace lines | |