Trie.java
| Index Score | ||
|---|---|---|
 |
 |
weka.core |
 |
 |
Weka |
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 |  |
| JAVA0034 | JAVA0034 Missing braces in if statement | |
| DECL_COMMENTS | Comments in declarations | |
| DOC_COMMENT | Number of javadoc comment lines | |
| COMMENTS | Comment lines | |
| LOOPS | Number of loops | |
| LINES | Number of lines in the source file | |
| FUNCTIONS | Number of function declarations | |
| LOGICAL_LINES | Number of statements | |
| EXITS | Procedure exits | |
| JAVA0036 | JAVA0036 Missing braces in while statement | |
| CYCLOMATIC | Cyclomatic complexity | |
| JAVA0035 | JAVA0035 Missing braces in for statement | |
| SIZE | Size of the file in bytes | |
| ELOC | Effective lines of code | |
| LOC | Lines of code | |
| RETURNS | Number of return points from functions | |
| OPERATORS | Number of operators | |
| PROGRAM_LENGTH | Halstead program length | |
| OPERANDS | Number of operands | |
| COMPARISONS | Number of comparison operators | |
| UNIQUE_OPERANDS | Number of unique operands | |
| PROGRAM_VOCAB | Halstead program vocabulary | |
| INTERFACE_COMPLEXITY | Interface complexity | |
| WHITESPACE | Number of whitespace lines | |
| JAVA0096 | JAVA0096 Field in nested class hides outer field | |
| BLOCKS | Number of blocks | |
| JAVA0117 | JAVA0117 Missing javadoc: method 'method' | |
| JAVA0277 | JAVA0277 Iterator.next() implementation does not throw NoSuchElementException | |
| JAVA0058 | JAVA0058 Constructor calls super() | |
| PROGRAM_VOLUME | Halstead program volume | |
| UNIQUE_OPERATORS | Number of unique operators | |
| JAVA0136 | JAVA0136 N methods defined in class (maximum: M) | |
| JAVA0238 | JAVA0238 Clone method does not call super.clone() | |
| JAVA0126 | JAVA0126 Method declares unchecked exception in throws | |
| JAVA0108 | JAVA0108 Incorrect javadoc: no @param tag for 'parameter' | |
| JAVA0068 | JAVA0068 Modifiers not declared in recommended order | |
| JAVA0270 | JAVA0270 Use Java 5.0 enhanced for loop construct to iterate over all elements in an array | |
| JAVA0110 | JAVA0110 Incorrect javadoc: no @return tag | |
/*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
/*
* Trie.java
* Copyright (C) 2007 University of Waikato, Hamilton, New Zealand
*/
package weka.core;
import java.io.Serializable;
import java.lang.reflect.Array;
import java.util.Collection;
import java.util.Enumeration;
import java.util.Hashtable;
import java.util.Iterator;
import java.util.Vector;
import javax.swing.tree.DefaultMutableTreeNode;
/**
* A class representing a Trie data structure for strings.
* See also <a href="http://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a>
* on WikiPedia.
*
* @author fracpete (fracpete at waikato dot ac dot nz)
* @version $Revision: 1.2 $
*/
public class Trie
implements Serializable, Cloneable, Collection<String>, RevisionHandler {
/** for serialization */
private static final long serialVersionUID = -5897980928817779048L;
/**
* Represents a node in the trie.
*
* @author fracpete (fracpete at waikato dot ac dot nz)
* @version $Revision: 1.2 $
*/
public static class TrieNode
extends DefaultMutableTreeNode
implements RevisionHandler {
/** for serialization */
private static final long serialVersionUID = -2252907099391881148L;
/** the stop character */
public final static Character STOP = '\0';
/** for fast access to the children */
protected Hashtable<Character,TrieNode> m_Children;
/**
* initializes the node
*
* @param c the value of this node
*/
public TrieNode(char c) {
this(new Character(c));
}
/**
* initializes the node
*
* @param c the value of this node
*/
public TrieNode(Character c) {
super(c);
m_Children = new Hashtable<Character,TrieNode>(100);
}
/**
* returns the stored character
*
* @return the stored character
*/
public Character getChar() {
return (Character) getUserObject();
}
/**
* sets the character this node represents
*
* @param value the character to store
*/
public void setChar(Character value) {
setUserObject(value);
}
/**
* adds the given string to its children (creates children if necessary)
*
* @param suffix the suffix to add to its children
* @return true if the add operation changed the structure
*/
public boolean add(String suffix) {
boolean result;
Character c;
String newSuffix;
TrieNode child;
result = false;
c = suffix.charAt(0);
newSuffix = suffix.substring(1);
// find child and add if necessary
child = m_Children.get(c);
if (child == null) {
result = true;
child = add(c);
}
// propagate remaining suffix
if (newSuffix.length() > 0)
result = child.add(newSuffix) || result;
return result;
}
/**
* adds the given charater to its children
*
* @param c the character to add
* @return the generated child node
*/
protected TrieNode add(Character c) {
TrieNode child;
child = new TrieNode(c);
add(child);
m_Children.put(c, child);
return child;
}
/**
* removes the given characted from its children
*
* @param c the character to remove
*/
protected void remove(Character c) {
TrieNode child;
child = m_Children.get(c);
remove(child);
m_Children.remove(c);
}
/**
* Removes a suffix from the trie.
*
* @param suffix the suffix to remove
* @return true if this trie changed as a result of the call
*/
public boolean remove(String suffix) {
boolean result;
Character c;
String newSuffix;
TrieNode child;
c = suffix.charAt(0);
newSuffix = suffix.substring(1);
child = m_Children.get(c);
if (child == null) {
result = false;
}
else if (newSuffix.length() == 0) {
remove(c);
result = true;
}
else {
result = child.remove(newSuffix);
if (child.getChildCount() == 0)
remove(child.getChar());
}
return result;
}
/**
* checks whether a suffix can be found in its children
*
* @param suffix the suffix to look for
* @return true if suffix was found
*/
public boolean contains(String suffix) {
boolean result;
Character c;
String newSuffix;
TrieNode child;
c = suffix.charAt(0);
newSuffix = suffix.substring(1);
child = m_Children.get(c);
if (child == null)
result = false;
else if (newSuffix.length() == 0)
result = true;
else
result = child.contains(newSuffix);
return result;
}
/**
* creates a deep copy of itself
*
* @return a deep copy of itself
*/
public Object clone() {
TrieNode result;
Enumeration<Character> keys;
Character key;
TrieNode child;
result = new TrieNode(getChar());
keys = m_Children.keys();
while (keys.hasMoreElements()) {
key = keys.nextElement();
child = (TrieNode) m_Children.get(key).clone();
result.add(child);
result.m_Children.put(key, child);
}
return result;
}
/**
* Indicates whether some other object is "equal to" this one.
*
* @param obj the object to check for equality
* @return true if equal
*/
public boolean equals(Object obj) {
boolean result;
TrieNode node;
Enumeration<Character> keys;
Character key;
node = (TrieNode) obj;
// is payload the same?
if (getChar() == null)
result = (node.getChar() == null);
else
result = getChar().equals(node.getChar());
// check children
if (result) {
keys = m_Children.keys();
while (keys.hasMoreElements()) {
key = keys.nextElement();
result = m_Children.get(key).equals(node.m_Children.get(key));
if (!result)
break;
}
}
return result;
}
/**
* returns the node with the given suffix
*
* @param suffix the suffix to look for
* @return null if unsuccessful otherwise the corresponding node
*/
public TrieNode find(String suffix) {
TrieNode result;
Character c;
String newSuffix;
TrieNode child;
c = suffix.charAt(0);
newSuffix = suffix.substring(1);
child = m_Children.get(c);
if (child == null)
result = null;
else if (newSuffix.length() == 0)
result = child;
else
result = child.find(newSuffix);
return result;
}
/**
* returns the common prefix for all the nodes starting with this node.
* The result includes this node, unless it's the root node or a STOP node.
*
* @return the result of the search
*/
public String getCommonPrefix() {
return getCommonPrefix("");
}
/**
* returns the common prefix for all the nodes starting with the node
* for the specified prefix. Can be null if initial prefix is not found.
* The result includes this node, unless it's the root node or a STOP node.
* Using the empty string means starting with this node.
*
* @param startPrefix the prefix of the node to start the search from
* @return the result of the search, null if startPrefix
* cannot be found
*/
public String getCommonPrefix(String startPrefix) {
String result;
TrieNode startNode;
if (startPrefix.length() == 0)
startNode = this;
else
startNode = find(startPrefix);
if (startNode == null)
result = null;
else
result = startPrefix + startNode.determineCommonPrefix("");
return result;
}
/**
* determines the common prefix of the nodes.
*
* @param currentPrefix the common prefix found so far
* @return the result of the search
*/
protected String determineCommonPrefix(String currentPrefix) {
String result;
String newPrefix;
if (!isRoot() && (getChar() != STOP))
newPrefix = currentPrefix + getChar();
else
newPrefix = currentPrefix;
if (m_Children.size() == 1)
result = ((TrieNode) getChildAt(0)).determineCommonPrefix(newPrefix);
else
result = newPrefix;
return result;
}
/**
* returns the number of stored strings, i.e., leaves
*
* @return the number of stored strings
*/
public int size() {
int result;
TrieNode leaf;
result = 0;
leaf = (TrieNode) getFirstLeaf();
while (leaf != null) {
if (leaf != getRoot())
result++;
leaf = (TrieNode) leaf.getNextLeaf();
}
return result;
}
/**
* returns the full string up to the root
*
* @return the full string to the root
*/
public String getString() {
char[] result;
TrieNode node;
result = new char[this.getLevel()];
node = this;
while (node.getParent() != null) {
if (node.isRoot())
break;
else
result[node.getLevel() - 1] = node.getChar();
node = (TrieNode) node.getParent();
}
return new String(result);
}
/**
* returns the node in a string representation
*
* @return the node as string
*/
public String toString() {
return "" + getChar();
}
/**
* Returns the revision string.
*
* @return the revision
*/
public String getRevision() {
return RevisionUtils.extract("$Revision: 1.2 $");
}
}
/**
* Represents an iterator over a trie
*
* @author fracpete (fracpete at waikato dot ac dot nz)
* @version $Revision: 1.2 $
*/
public static class TrieIterator
implements Iterator<String>, RevisionHandler {
/** the node to use as root */
protected TrieNode m_Root;
/** the last leaf for this root node */
protected TrieNode m_LastLeaf;
/** the current leaf node */
protected TrieNode m_CurrentLeaf;
/**
* initializes the iterator
*
* @param node the node to use as root
*/
public TrieIterator(TrieNode node) {
super();
m_Root = node;
m_CurrentLeaf = (TrieNode) m_Root.getFirstLeaf();
m_LastLeaf = (TrieNode) m_Root.getLastLeaf();
}
/**
* Returns true if the iteration has more elements.
*
* @return true if there is at least one more element
*/
public boolean hasNext() {
return (m_CurrentLeaf != null);
}
/**
* Returns the next element in the iteration.
*
* @return the next element
*/
public String next() {
String result;
result = m_CurrentLeaf.getString();
result = result.substring(0, result.length() - 1); // remove STOP
if (m_CurrentLeaf != m_LastLeaf)
m_CurrentLeaf = (TrieNode) m_CurrentLeaf.getNextLeaf();
else
m_CurrentLeaf = null;
return result;
}
/**
* ignored
*/
public void remove() {
}
/**
* Returns the revision string.
*
* @return the revision
*/
public String getRevision() {
return RevisionUtils.extract("$Revision: 1.2 $");
}
}
/** the root node */
protected TrieNode m_Root;
/** the hash code */
protected int m_HashCode;
/** whether the structure got modified and the hash code needs to be
* re-calculated */
protected boolean m_RecalcHashCode;
/**
* initializes the data structure
*/
public Trie() {
super();
m_Root = new TrieNode(null);
m_RecalcHashCode = true;
}
/**
* Ensures that this collection contains the specified element.
*
* @param o the string to add
* @return true if the structure changed
*/
public boolean add(String o) {
return m_Root.add(o + TrieNode.STOP);
}
/**
* Adds all of the elements in the specified collection to this collection
*
* @param c the collection to add
*/
public boolean addAll(Collection<? extends String> c) {
boolean result;
Iterator<String> iter;
result = false;
iter = (Iterator<String>) c.iterator();
while (iter.hasNext())
result = add(iter.next()) || result;
return result;
}
/**
* Removes all of the elements from this collection
*/
public void clear() {
m_Root.removeAllChildren();
m_RecalcHashCode = true;
}
/**
* returns a deep copy of itself
*
* @return a copy of itself
*/
public Object clone() {
Trie result;
result = new Trie();
result.m_Root = (TrieNode) m_Root.clone();
return result;
}
/**
* Returns true if this collection contains the specified element.
*
* @param o the object to check for in trie
* @return true if found
*/
public boolean contains(Object o) {
return m_Root.contains(((String) o) + TrieNode.STOP);
}
/**
* Returns true if this collection contains all of the elements in the
* specified collection.
*
* @param c the collection to look for in the trie
* @return true if all elements were found
*/
public boolean containsAll(Collection<?> c) {
boolean result;
Iterator iter;
result = true;
iter = c.iterator();
while (iter.hasNext()) {
if (!contains(iter.next())) {
result = false;
break;
}
}
return result;
}
/**
* checks whether the given prefix is stored in the trie
*
* @param prefix the prefix to check
* @return true if the prefix is part of the trie
*/
public boolean containsPrefix(String prefix) {
return m_Root.contains(prefix);
}
/**
* Compares the specified object with this collection for equality.
*
* @param o the object to check for equality
*/
public boolean equals(Object o) {
return m_Root.equals(((Trie) o).getRoot());
}
/**
* returns the common prefix for all the nodes
*
* @return the result of the search
*/
public String getCommonPrefix() {
return m_Root.getCommonPrefix();
}
/**
* returns the root node of the trie
*
* @return the root node
*/
public TrieNode getRoot() {
return m_Root;
}
/**
* returns all stored strings that match the given prefix
*
* @param prefix the prefix that all strings must have
* @return all strings that match the prefix
*/
public Vector<String> getWithPrefix(String prefix) {
Vector<String> result;
TrieNode node;
TrieIterator iter;
result = new Vector<String>();
if (containsPrefix(prefix)) {
node = m_Root.find(prefix);
iter = new TrieIterator(node);
while (iter.hasNext())
result.add(iter.next());
}
return result;
}
/**
* Returns the hash code value for this collection.
*
* @return the hash code
*/
public int hashCode() {
if (m_RecalcHashCode) {
m_HashCode = toString().hashCode();
m_RecalcHashCode = false;
}
return m_HashCode;
}
/**
* Returns true if this collection contains no elements.
*
* @return true if empty
*/
public boolean isEmpty() {
return (m_Root.getChildCount() == 0);
}
/**
* Returns an iterator over the elements in this collection.
*
* @return returns an iterator over all the stored strings
*/
public Iterator<String> iterator() {
return new TrieIterator(m_Root);
}
/**
* Removes a single instance of the specified element from this collection,
* if it is present.
*
* @param o the object to remove
* @return true if this collection changed as a result of the call
*/
public boolean remove(Object o) {
boolean result;
result = m_Root.remove(((String) o) + TrieNode.STOP);
m_RecalcHashCode = result;
return result;
}
/**
* Removes all this collection's elements that are also contained in the
* specified collection
*
* @param c the collection to remove
* @return true if the collection changed
*/
public boolean removeAll(Collection<?> c) {
boolean result;
Iterator iter;
result = false;
iter = c.iterator();
while (iter.hasNext()) {
result = remove(iter.next()) || result;
}
m_RecalcHashCode = result;
return result;
}
/**
* Retains only the elements in this collection that are contained in
* the specified collection
*
* @param c the collection to use as reference
* @return true if this collection changed as a result of the call
*/
public boolean retainAll(Collection<?> c) {
boolean result;
Iterator iter;
Object o;
result = false;
iter = iterator();
while (iter.hasNext()) {
o = iter.next();
if (!c.contains(o))
result = remove(o) || result;
}
m_RecalcHashCode = result;
return result;
}
/**
* Returns the number of elements in this collection.
*
* @return the number of nodes in the tree
*/
public int size() {
return m_Root.size();
}
/**
* Returns an array containing all of the elements in this collection.
*
* @return the stored strings as array
*/
public Object[] toArray() {
return toArray(new String[0]);
}
/**
* Returns an array containing all of the elements in this collection; the
* runtime type of the returned array is that of the specified array.
*
* @param a the array into which the elements of this collection
* are to be stored
* @return an array containing the elements of this collection
*/
public <T> T[] toArray(T[] a) {
Object[] result;
Iterator iter;
Vector list;
int i;
list = new Vector();
iter = iterator();
while (iter.hasNext())
list.add(iter.next());
if (Array.getLength(a) != list.size())
result = (Object[]) Array.newInstance(a.getClass().getComponentType(), list.size());
else
result = a;
for (i = 0; i < list.size(); i++)
result[i] = list.get(i);
return (T[]) result;
}
/**
* returns the node as String
*
* @param node the node to turn into a string
* @return the node as string
*/
protected String toString(TrieNode node) {
StringBuffer result;
int i;
StringBuffer indentation;
result = new StringBuffer();
// indent the node
indentation = new StringBuffer();
for (i = 0; i < node.getLevel(); i++)
indentation.append(" | ");
result.append(indentation.toString());
// add the node label
if (node.getChar() == null)
result.append("<root>");
else if (node.getChar() == TrieNode.STOP)
result.append("STOP");
else
result.append("'" + node.getChar() + "'");
result.append("\n");
// add the children
for (i = 0; i < node.getChildCount(); i++)
result.append(toString((TrieNode) node.getChildAt(i)));
return result.toString();
}
/**
* returns the trie in string representation
*
* @return the trie as string
*/
public String toString() {
return toString(m_Root);
}
/**
* Returns the revision string.
*
* @return the revision
*/
public String getRevision() {
return RevisionUtils.extract("$Revision: 1.2 $");
}
/**
* Only for testing (prints the built Trie). Arguments are added to the Trie.
* If not arguments provided then a few default strings are uses for building.
*
* @param args commandline arguments
*/
public static void main(String[] args) {
String[] data;
if (args.length == 0) {
data = new String[3];
data[0] = "this is a test";
data[1] = "this is another test";
data[2] = "and something else";
}
else {
data = args.clone();
}
// build trie
Trie t = new Trie();
for (int i = 0; i < data.length; i++)
t.add(data[i]);
System.out.println(t);
}
}
The table below shows all metrics for Trie.java.
| Metric | Value | Description | |
|---|---|---|---|
| BLOCKS | 66.00 | Number of blocks | |
| BLOCK_COMMENT | 19.00 | Number of block comment lines | |
| COMMENTS | 327.00 | Comment lines | |
| COMMENT_DENSITY | 0.92 | Comment density | |
| COMPARISONS | 52.00 | Number of comparison operators | |
| CYCLOMATIC | 95.00 | Cyclomatic complexity | |
| DECL_COMMENTS | 64.00 | Comments in declarations | |
| DOC_COMMENT | 300.00 | Number of javadoc comment lines | |
| ELOC | 355.00 | Effective lines of code | |
| EXEC_COMMENTS | 8.00 | Comments in executable code | |
| EXITS | 73.00 | Procedure exits | |
| FUNCTIONS | 49.00 | Number of function declarations | |
| HALSTEAD_DIFFICULTY | 82.61 | 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 | 1.00 | JAVA0002 Package name does not begin with a top level domain name or country code | |
| JAVA0003 | 0.00 | JAVA0003 Minimize use of on-demand (.*) imports | |
| JAVA0004 | 0.00 | JAVA0004 Unnecessary import from java.lang | |
| JAVA0005 | 0.00 | JAVA0005 Imports not in specified order | |
| JAVA0006 | 0.00 | JAVA0006 Empty finally block | |
| JAVA0007 | 0.00 | JAVA0007 Should not declare public field | |
| JAVA0008 | 0.00 | JAVA0008 Empty catch block | |
| JAVA0009 | 0.00 | JAVA0009 Protected member in final class | |
| JAVA0010 | 0.00 | JAVA0010 Non-instantiable class does not contain a non-private static member | |
| JAVA0011 | 0.00 | JAVA0011 Abstract class does not contain an abstract method | |
| JAVA0012 | 0.00 | JAVA0012 Non-constructor method with same name as declaring class | |
| JAVA0013 | 0.00 | JAVA0013 Non-blank final field is not static | |
| JAVA0014 | 0.00 | JAVA0014 Class with only static members has non-private constructor | |
| JAVA0015 | 0.00 | JAVA0015 Package class contains public nested type | |
| JAVA0016 | 0.00 | JAVA0016 Abstract class contains public constructor | |
| JAVA0017 | 0.00 | JAVA0017 Class name does not have required form | |
| JAVA0018 | 0.00 | JAVA0018 Method name does not have required form | |
| JAVA0019 | 0.00 | JAVA0019 Interface name does not have required form | |
| JAVA0020 | 0.00 | JAVA0020 Field name does not have required form | |
| JAVA0021 | 0.00 | JAVA0021 Interface method name does not have required form | |
| JAVA0022 | 0.00 | JAVA0022 Static final field name does not have required form | |
| JAVA0023 | 0.00 | JAVA0023 Empty finalize method | |
| JAVA0024 | 0.00 | JAVA0024 Empty class | |
| JAVA0025 | 0.00 | JAVA0025 Method override is empty | |
| JAVA0026 | 0.00 | JAVA0026 Finalize method with parameters | |
| JAVA0029 | 0.00 | JAVA0029 Private method not used | |
| JAVA0030 | 0.00 | JAVA0030 Private field not used | |
| JAVA0031 | 0.00 | JAVA0031 Case statement not properly closed | |
| JAVA0032 | 0.00 | JAVA0032 Switch statement missing default | |
| JAVA0033 | 0.00 | JAVA0033 default: not last case in switch statement | |
| JAVA0034 | 30.00 | JAVA0034 Missing braces in if statement | |
| JAVA0035 | 4.00 | JAVA0035 Missing braces in for statement | |
| JAVA0036 | 3.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 | 2.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 | 1.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 | 1.00 | JAVA0096 Field in nested class hides outer field | |
| JAVA0098 | 2.00 | JAVA0098 Minimize use of implicit field initializers | |
| JAVA0100 | 0.00 | JAVA0100 Class contains N non-final fields (maximum: M) | |
| JAVA0101 | 0.00 | JAVA0101 Unnecessary modifier for field in interface | |
| JAVA0102 | 0.00 | JAVA0102 Last statement in finalize() not super.finalize() | |
| JAVA0103 | 0.00 | JAVA0103 Explicit call to finalize() | |
| JAVA0104 | 0.00 | JAVA0104 finalize() only calls super.finalize() | |
| JAVA0105 | 0.00 | JAVA0105 Duplicate import declaration | |
| JAVA0106 | 0.00 | JAVA0106 Unnecessary import from current package | |
| JAVA0108 | 0.00 | JAVA0108 Incorrect javadoc: no @param tag for 'parameter' | |
| JAVA0109 | 0.00 | JAVA0109 Incorrect javadoc: no parameter 'parameter' | |
| JAVA0110 | 2.00 | JAVA0110 Incorrect javadoc: no @return tag | |
| JAVA0111 | 0.00 | JAVA0111 Incorrect javadoc: @return tag for void method | |
| JAVA0112 | 0.00 | JAVA0112 Incorrect javadoc: no exception 'exception' in throws | |
| JAVA0113 | 0.00 | JAVA0113 Incorrect javadoc: no @author tag | |
| JAVA0114 | 0.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 | 0.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 | 0.00 | JAVA0128 Public constructor in non-public class | |
| JAVA0130 | 0.00 | JAVA0130 Non-static method does not use instance fields | |
| JAVA0131 | 2.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 | 1.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 | 0.00 | JAVA0144 Line exceeds maximum M characters | |
| JAVA0145 | 263.00 | JAVA0145 Tab character used in source file | |
| JAVA0150 | 0.00 | JAVA0150 java.lang.Error (or subclass) thrown | |
| JAVA0153 | 0.00 | JAVA0153 Inefficient conversion of integer to string | |
| JAVA0159 | 0.00 | JAVA0159 Inefficient conversion of string to integer | |
| JAVA0160 | 0.00 | JAVA0160 Method does not throw specified exception | |
| JAVA0161 | 0.00 | JAVA0161 Conditional wait() not in loop | |
| JAVA0163 | 0.00 | JAVA0163 Empty statement | |
| JAVA0165 | 0.00 | JAVA0165 Conflicting return statement in finally block | |
| JAVA0166 | 0.00 | JAVA0166 Generic exception caught | |
| JAVA0167 | 0.00 | JAVA0167 ThreadDeath not rethrown | |
| JAVA0169 | 0.00 | JAVA0169 Unnecessary catch block: exception 'exception' | |
| JAVA0170 | 0.00 | JAVA0170 Caught exception not derived from java.lang.Exception | |
| JAVA0171 | 0.00 | JAVA0171 Unused local variable | |
| JAVA0173 | 0.00 | JAVA0173 Unused method parameter | |
| JAVA0174 | 0.00 | JAVA0174 Assigned local variable never used | |
| JAVA0175 | 0.00 | JAVA0175 Successive assignment to variable | |
| JAVA0176 | 0.00 | JAVA0176 Local variable name does not have required form | |
| JAVA0177 | 57.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 | 2.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 | 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 | 1.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 | 1.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 | 887.00 | Number of lines in the source file | |
| LINE_COMMENT | 8.00 | Number of line comments | |
| LOC | 424.00 | Lines of code | |
| LOGICAL_LINES | 253.00 | Number of statements | |
| LOOPS | 14.00 | Number of loops | |
| NEST_DEPTH | 3.00 | Maximum nesting depth | |
| OPERANDS | 864.00 | Number of operands | |
| OPERATORS | 1633.00 | Number of operators | |
| PARAMS | 26.00 | Number of formal parameter declarations | |
| PROGRAM_LENGTH | 2497.00 | Halstead program length | |
| PROGRAM_VOCAB | 299.00 | Halstead program vocabulary | |
| PROGRAM_VOLUME | 0.00 | Halstead program volume | |
| RETURNS | 51.00 | Number of return points from functions | |
| SIZE | 21015.00 | Size of the file in bytes | |
| UNIQUE_OPERANDS | 251.00 | Number of unique operands | |
| UNIQUE_OPERATORS | 48.00 | Number of unique operators | |
| WHITESPACE | 136.00 | Number of whitespace lines | |