AODE.java

Index Score
weka.classifiers.bayes
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.

MetricDescription
EXEC_COMMENTSComments in executable code
JAVA0034JAVA0034 Missing braces in if statement
DECL_COMMENTSComments in declarations
LINE_COMMENTNumber of line comments
DOC_COMMENTNumber of javadoc comment lines
COMMENTSComment lines
JAVA0177JAVA0177 Variable declaration missing initializer
SIZESize of the file in bytes
LOOPSNumber of loops
LINESNumber of lines in the source file
JAVA0233JAVA0233 Definition of serialVersionUID other than 'private static final long serialVersionUID'
JAVA0082JAVA0082 Unnecessary widening cast
LOGICAL_LINESNumber of statements
ELOCEffective lines of code
OPERATORSNumber of operators
PROGRAM_LENGTHHalstead program length
OPERANDSNumber of operands
LOCLines of code
PROGRAM_VOCABHalstead program vocabulary
UNIQUE_OPERANDSNumber of unique operands
UNIQUE_OPERATORSNumber of unique operators
WHITESPACENumber of whitespace lines
JAVA0117JAVA0117 Missing javadoc: method 'method'
JAVA0144JAVA0144 Line exceeds maximum M characters
JAVA0094JAVA0094 Field hides a superclass field
PROGRAM_VOLUMEHalstead program volume
CYCLOMATICCyclomatic complexity
JAVA0136JAVA0136 N methods defined in class (maximum: M)
JAVA0266JAVA0266 Use of System.out
EXITSProcedure exits
JAVA0126JAVA0126 Method declares unchecked exception in throws
JAVA0110JAVA0110 Incorrect javadoc: no @return tag
BLOCKSNumber of blocks
JAVA0100JAVA0100 Class contains N non-final fields (maximum: M)
JAVA0108JAVA0108 Incorrect javadoc: no @param tag for 'parameter'
NEST_DEPTHMaximum nesting depth
JAVA0145JAVA0145 Tab character used in source file
/* * 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. */ /* * AODE.java * Copyright (C) 2003 * Algorithm developed by: Geoff Webb * Code written by: Janice Boughton & Zhihai Wang */ package weka.classifiers.bayes; import weka.classifiers.Classifier; import weka.classifiers.UpdateableClassifier; import weka.core.Capabilities; import weka.core.Instance; import weka.core.Instances; import weka.core.Option; import weka.core.OptionHandler; import weka.core.RevisionUtils; import weka.core.TechnicalInformation; import weka.core.TechnicalInformationHandler; import weka.core.Utils; import weka.core.WeightedInstancesHandler; import weka.core.Capabilities.Capability; import weka.core.TechnicalInformation.Field; import weka.core.TechnicalInformation.Type; import java.util.Enumeration; import java.util.Vector; /** <!-- globalinfo-start --> * AODE achieves highly accurate classification by averaging over all of a small space of alternative naive-Bayes-like models that have weaker (and hence less detrimental) independence assumptions than naive Bayes. The resulting algorithm is computationally efficient while delivering highly accurate classification on many learning tasks.<br/> * <br/> * For more information, see<br/> * <br/> * G. Webb, J. Boughton, Z. Wang (2005). Not So Naive Bayes: Aggregating One-Dependence Estimators. Machine Learning. 58(1):5-24.<br/> * <br/> * Further papers are available at<br/> * http://www.csse.monash.edu.au/~webb/.<br/> * <br/> * Can use an m-estimate for smoothing base probability estimates in place of the Laplace correction (via option -M).<br/> * Default frequency limit set to 1. * <p/> <!-- globalinfo-end --> * <!-- technical-bibtex-start --> * BibTeX: * <pre> * &#64;article{Webb2005, * author = {G. Webb and J. Boughton and Z. Wang}, * journal = {Machine Learning}, * number = {1}, * pages = {5-24}, * title = {Not So Naive Bayes: Aggregating One-Dependence Estimators}, * volume = {58}, * year = {2005} * } * </pre> * <p/> <!-- technical-bibtex-end --> * <!-- options-start --> * Valid options are: <p/> * * <pre> -D * Output debugging information * </pre> * * <pre> -F &lt;int&gt; * Impose a frequency limit for superParents * (default is 1)</pre> * * <pre> -M * Use m-estimate instead of laplace correction * </pre> * * <pre> -W &lt;int&gt; * Specify a weight to use with m-estimate * (default is 1)</pre> * <!-- options-end --> * * @author Janice Boughton (jrbought@csse.monash.edu.au) * @author Zhihai Wang (zhw@csse.monash.edu.au) * @version $Revision: 1.19 $ */ public class AODE extends Classifier implements OptionHandler, WeightedInstancesHandler, UpdateableClassifier, TechnicalInformationHandler { /** for serialization */ static final long serialVersionUID = 9197439980415113523L; /** * 3D array (m_NumClasses * m_TotalAttValues * m_TotalAttValues) * of attribute counts, i.e., the number of times an attribute value occurs * in conjunction with another attribute value and a class value. */ private double [][][] m_CondiCounts; /** The number of times each class value occurs in the dataset */ private double [] m_ClassCounts; /** The sums of attribute-class counts * -- if there are no missing values for att, then * m_SumForCounts[classVal][att] will be the same as * m_ClassCounts[classVal] */ private double [][] m_SumForCounts; /** The number of classes */ private int m_NumClasses; /** The number of attributes in dataset, including class */ private int m_NumAttributes; /** The number of instances in the dataset */ private int m_NumInstances; /** The index of the class attribute */ private int m_ClassIndex; /** The dataset */ private Instances m_Instances; /** * The total number of values (including an extra for each attribute's * missing value, which are included in m_CondiCounts) for all attributes * (not including class). E.g., for three atts each with two possible values, * m_TotalAttValues would be 9 (6 values + 3 missing). * This variable is used when allocating space for m_CondiCounts matrix. */ private int m_TotalAttValues; /** The starting index (in the m_CondiCounts matrix) of the values for each * attribute */ private int [] m_StartAttIndex; /** The number of values for each attribute */ private int [] m_NumAttValues; /** The frequency of each attribute value for the dataset */ private double [] m_Frequencies; /** The number of valid class values observed in dataset * -- with no missing classes, this number is the same as m_NumInstances. */ private double m_SumInstances; /** An att's frequency must be this value or more to be a superParent */ private int m_Limit = 1; /** If true, outputs debugging info */ private boolean m_Debug = false; /** flag for using m-estimates */ private boolean m_MEstimates = false; /** value for m in m-estimate */ private int m_Weight = 1; /** * Returns a string describing this classifier * @return a description of the classifier suitable for * displaying in the explorer/experimenter gui */ public String globalInfo() { return "AODE achieves highly accurate classification by averaging over " +"all of a small space of alternative naive-Bayes-like models that have " +"weaker (and hence less detrimental) independence assumptions than " +"naive Bayes. The resulting algorithm is computationally efficient " +"while delivering highly accurate classification on many learning " +"tasks.\n\n" +"For more information, see\n\n" + getTechnicalInformation().toString() + "\n\n" +"Further papers are available at\n" +" http://www.csse.monash.edu.au/~webb/.\n\n" + "Can use an m-estimate for smoothing base probability estimates " + "in place of the Laplace correction (via option -M).\n" + "Default frequency limit set to 1."; } /** * Returns an instance of a TechnicalInformation object, containing * detailed information about the technical background of this class, * e.g., paper reference or book this class is based on. * * @return the technical information about this class */ public TechnicalInformation getTechnicalInformation() { TechnicalInformation result; result = new TechnicalInformation(Type.ARTICLE); result.setValue(Field.AUTHOR, "G. Webb and J. Boughton and Z. Wang"); result.setValue(Field.YEAR, "2005"); result.setValue(Field.TITLE, "Not So Naive Bayes: Aggregating One-Dependence Estimators"); result.setValue(Field.JOURNAL, "Machine Learning"); result.setValue(Field.VOLUME, "58"); result.setValue(Field.NUMBER, "1"); result.setValue(Field.PAGES, "5-24"); return result; } /** * Returns default capabilities of the classifier. * * @return the capabilities of this classifier */ public Capabilities getCapabilities() { Capabilities result = super.getCapabilities(); // attributes result.enable(Capability.NOMINAL_ATTRIBUTES); result.enable(Capability.MISSING_VALUES); // class result.enable(Capability.NOMINAL_CLASS); result.enable(Capability.MISSING_CLASS_VALUES); // instances result.setMinimumNumberInstances(0); return result; } /** * Generates the classifier. * * @param instances set of instances serving as training data * @throws Exception if the classifier has not been generated * successfully */ public void buildClassifier(Instances instances) throws Exception { // can classifier handle the data? getCapabilities().testWithFail(instances); // remove instances with missing class m_Instances = new Instances(instances); m_Instances.deleteWithMissingClass(); // reset variable for this fold m_SumInstances = 0; m_ClassIndex = instances.classIndex(); m_NumInstances = m_Instances.numInstances(); m_NumAttributes = m_Instances.numAttributes(); m_NumClasses = m_Instances.numClasses(); // allocate space for attribute reference arrays m_StartAttIndex = new int[m_NumAttributes]; m_NumAttValues = new int[m_NumAttributes]; m_TotalAttValues = 0; for(int i = 0; i < m_NumAttributes; i++) { if(i != m_ClassIndex) { m_StartAttIndex[i] = m_TotalAttValues; m_NumAttValues[i] = m_Instances.attribute(i).numValues(); m_TotalAttValues += m_NumAttValues[i] + 1; // + 1 so room for missing value count } else { // m_StartAttIndex[i] = -1; // class isn't included m_NumAttValues[i] = m_NumClasses; } } // allocate space for counts and frequencies m_CondiCounts = new double[m_NumClasses][m_TotalAttValues][m_TotalAttValues]; m_ClassCounts = new double[m_NumClasses]; m_SumForCounts = new double[m_NumClasses][m_NumAttributes]; m_Frequencies = new double[m_TotalAttValues]; // calculate the counts for(int k = 0; k < m_NumInstances; k++) { addToCounts((Instance)m_Instances.instance(k)); } // free up some space m_Instances = new Instances(m_Instances, 0); } /** * Updates the classifier with the given instance. * * @param instance the new training instance to include in the model */ public void updateClassifier(Instance instance) { this.addToCounts(instance); } /** * Puts an instance's values into m_CondiCounts, m_ClassCounts and * m_SumInstances. * * @param instance the instance whose values are to be put into the counts * variables */ private void addToCounts(Instance instance) { double [] countsPointer; if(instance.classIsMissing()) return; // ignore instances with missing class int classVal = (int)instance.classValue(); double weight = instance.weight(); m_ClassCounts[classVal] += weight; m_SumInstances += weight; // store instance's att val indexes in an array, b/c accessing it // in loop(s) is more efficient int [] attIndex = new int[m_NumAttributes]; for(int i = 0; i < m_NumAttributes; i++) { if(i == m_ClassIndex) attIndex[i] = -1; // we don't use the class attribute in counts else { if(instance.isMissing(i)) attIndex[i] = m_StartAttIndex[i] + m_NumAttValues[i]; else attIndex[i] = m_StartAttIndex[i] + (int)instance.value(i); } } for(int Att1 = 0; Att1 < m_NumAttributes; Att1++) { if(attIndex[Att1] == -1) continue; // avoid pointless looping as Att1 is currently the class attribute m_Frequencies[attIndex[Att1]] += weight; // if this is a missing value, we don't want to increase sumforcounts if(!instance.isMissing(Att1)) m_SumForCounts[classVal][Att1] += weight; // save time by referencing this now, rather than do it repeatedly in the loop countsPointer = m_CondiCounts[classVal][attIndex[Att1]]; for(int Att2 = 0; Att2 < m_NumAttributes; Att2++) { if(attIndex[Att2] != -1) { countsPointer[attIndex[Att2]] += weight; } } } } /** * Calculates the class membership probabilities for the given test * instance. * * @param instance the instance to be classified * @return predicted class probability distribution * @throws Exception if there is a problem generating the prediction */ public double [] distributionForInstance(Instance instance) throws Exception { // accumulates posterior probabilities for each class double [] probs = new double[m_NumClasses]; // index for parent attribute value, and a count of parents used int pIndex, parentCount; // pointers for efficiency // for current class, point to joint frequency for any pair of att values double [][] countsForClass; // for current class & parent, point to joint frequency for any att value double [] countsForClassParent; // store instance's att indexes in an int array, so accessing them // is more efficient in loop(s). int [] attIndex = new int[m_NumAttributes]; for(int att = 0; att < m_NumAttributes; att++) { if(instance.isMissing(att) || att == m_ClassIndex) attIndex[att] = -1; // can't use class or missing values in calculations else attIndex[att] = m_StartAttIndex[att] + (int)instance.value(att); } // calculate probabilities for each possible class value for(int classVal = 0; classVal < m_NumClasses; classVal++) { probs[classVal] = 0; double spodeP = 0; // P(X,y) for current parent and class parentCount = 0; countsForClass = m_CondiCounts[classVal]; // each attribute has a turn of being the parent for(int parent = 0; parent < m_NumAttributes; parent++) { if(attIndex[parent] == -1) continue; // skip class attribute or missing value // determine correct index for the parent in m_CondiCounts matrix pIndex = attIndex[parent]; // check that the att value has a frequency of m_Limit or greater if(m_Frequencies[pIndex] < m_Limit) continue; countsForClassParent = countsForClass[pIndex]; // block the parent from being its own child attIndex[parent] = -1; parentCount++; // joint frequency of class and parent double classparentfreq = countsForClassParent[pIndex]; // find the number of missing values for parent's attribute double missing4ParentAtt = m_Frequencies[m_StartAttIndex[parent] + m_NumAttValues[parent]]; // calculate the prior probability -- P(parent & classVal) if (!m_MEstimates) { spodeP = (classparentfreq + 1.0) / ((m_SumInstances - missing4ParentAtt) + m_NumClasses * m_NumAttValues[parent]); } else { spodeP = (classparentfreq + ((double)m_Weight / (double)(m_NumClasses * m_NumAttValues[parent]))) / ((m_SumInstances - missing4ParentAtt) + m_Weight); } // take into account the value of each attribute for(int att = 0; att < m_NumAttributes; att++) { if(attIndex[att] == -1) continue; double missingForParentandChildAtt = countsForClassParent[m_StartAttIndex[att] + m_NumAttValues[att]]; if(!m_MEstimates) { spodeP *= (countsForClassParent[attIndex[att]] + 1.0) / ((classparentfreq - missingForParentandChildAtt) + m_NumAttValues[att]); } else { spodeP *= (countsForClassParent[attIndex[att]] + ((double)m_Weight / (double)m_NumAttValues[att])) / ((classparentfreq - missingForParentandChildAtt) + m_Weight); } } // add this probability to the overall probability probs[classVal] += spodeP; // unblock the parent attIndex[parent] = pIndex; } // check that at least one att was a parent if(parentCount < 1) { // do plain naive bayes conditional prob probs[classVal] = NBconditionalProb(instance, classVal); } else { // divide by number of parent atts to get the mean probs[classVal] /= (double)(parentCount); } } Utils.normalize(probs); return probs; } /** * Calculates the probability of the specified class for the given test * instance, using naive Bayes. * * @param instance the instance to be classified * @param classVal the class for which to calculate the probability * @return predicted class probability */ public double NBconditionalProb(Instance instance, int classVal) { double prob; double [][] pointer; // calculate the prior probability if(!m_MEstimates) { prob = (m_ClassCounts[classVal] + 1.0) / (m_SumInstances + m_NumClasses); } else { prob = (m_ClassCounts[classVal] + ((double)m_Weight / (double)m_NumClasses)) / (m_SumInstances + m_Weight); } pointer = m_CondiCounts[classVal]; // consider effect of each att value for(int att = 0; att < m_NumAttributes; att++) { if(att == m_ClassIndex || instance.isMissing(att)) continue; // determine correct index for att in m_CondiCounts int aIndex = m_StartAttIndex[att] + (int)instance.value(att); if(!m_MEstimates) { prob *= (double)(pointer[aIndex][aIndex] + 1.0) / ((double)m_SumForCounts[classVal][att] + m_NumAttValues[att]); } else { prob *= (double)(pointer[aIndex][aIndex] + ((double)m_Weight / (double)m_NumAttValues[att])) / (double)(m_SumForCounts[classVal][att] + m_Weight); } } return prob; } /** * Returns an enumeration describing the available options * * @return an enumeration of all the available options */ public Enumeration listOptions() { Vector newVector = new Vector(4); newVector.addElement( new Option("\tOutput debugging information\n", "D", 0,"-D")); newVector.addElement( new Option("\tImpose a frequency limit for superParents\n" + "\t(default is 1)", "F", 1,"-F <int>")); newVector.addElement( new Option("\tUse m-estimate instead of laplace correction\n", "M", 0,"-M")); newVector.addElement( new Option("\tSpecify a weight to use with m-estimate\n" + "\t(default is 1)", "W", 1,"-W <int>")); return newVector.elements(); } /** * Parses a given list of options. <p/> * <!-- options-start --> * Valid options are: <p/> * * <pre> -D * Output debugging information * </pre> * * <pre> -F &lt;int&gt; * Impose a frequency limit for superParents * (default is 1)</pre> * * <pre> -M * Use m-estimate instead of laplace correction * </pre> * * <pre> -W &lt;int&gt; * Specify a weight to use with m-estimate * (default is 1)</pre> * <!-- options-end --> * * @param options the list of options as an array of strings * @throws Exception if an option is not supported */ public void setOptions(String[] options) throws Exception { m_Debug = Utils.getFlag('D', options); String Freq = Utils.getOption('F', options); if (Freq.length() != 0) m_Limit = Integer.parseInt(Freq); else m_Limit = 1; m_MEstimates = Utils.getFlag('M', options); String weight = Utils.getOption('W', options); if (weight.length() != 0) { if (!m_MEstimates) throw new Exception("Can't use Laplace AND m-estimate weight. Choose one."); m_Weight = Integer.parseInt(weight); } else { if (m_MEstimates) m_Weight = 1; } Utils.checkForRemainingOptions(options); } /** * Gets the current settings of the classifier. * * @return an array of strings suitable for passing to setOptions */ public String [] getOptions() { Vector result = new Vector(); if (m_Debug) result.add("-D"); result.add("-F"); result.add("" + m_Limit); if (m_MEstimates) { result.add("-M"); result.add("-W"); result.add("" + m_Weight); } return (String[]) result.toArray(new String[result.size()]); } /** * Returns the tip text for this property * @return tip text for this property suitable for * displaying in the explorer/experimenter gui */ public String weightTipText() { return "Set the weight for m-estimate."; } /** * Sets the weight for m-estimate * * @param w the weight */ public void setWeight(int w) { if (!getUseMEstimates()) { System.out.println( "Weight is only used in conjunction with m-estimate - ignored!"); } else { if (w > 0) m_Weight = w; else System.out.println("Weight must be greater than 0!"); } } /** * Gets the weight used in m-estimate * * @return the frequency limit */ public int getWeight() { return m_Weight; } /** * Returns the tip text for this property * @return tip text for this property suitable for * displaying in the explorer/experimenter gui */ public String useMEstimatesTipText() { return "Use m-estimate instead of laplace correction."; } /** * Gets if m-estimaces is being used. * * @return Value of m_MEstimates. */ public boolean getUseMEstimates() { return m_MEstimates; } /** * Sets if m-estimates is to be used. * * @param value Value to assign to m_MEstimates. */ public void setUseMEstimates(boolean value) { m_MEstimates = value; } /** * Returns the tip text for this property * @return tip text for this property suitable for * displaying in the explorer/experimenter gui */ public String frequencyLimitTipText() { return "Attributes with a frequency in the train set below " + "this value aren't used as parents."; } /** * Sets the frequency limit * * @param f the frequency limit */ public void setFrequencyLimit(int f) { m_Limit = f; } /** * Gets the frequency limit. * * @return the frequency limit */ public int getFrequencyLimit() { return m_Limit; } /** * Returns a description of the classifier. * * @return a description of the classifier as a string. */ public String toString() { StringBuffer text = new StringBuffer(); text.append("The AODE Classifier"); if (m_Instances == null) { text.append(": No model built yet."); } else { try { for (int i = 0; i < m_NumClasses; i++) { // print to string, the prior probabilities of class values text.append("\nClass " + m_Instances.classAttribute().value(i) + ": Prior probability = " + Utils. doubleToString(((m_ClassCounts[i] + 1) /(m_SumInstances + m_NumClasses)), 4, 2)+"\n\n"); } text.append("Dataset: " + m_Instances.relationName() + "\n" + "Instances: " + m_NumInstances + "\n" + "Attributes: " + m_NumAttributes + "\n" + "Frequency limit for superParents: " + m_Limit + "\n"); text.append("Correction: "); if (!m_MEstimates) text.append("laplace\n"); else text.append("m-estimate (m=" + m_Weight + ")\n"); } catch (Exception ex) { text.append(ex.getMessage()); } } return text.toString(); } /** * Returns the revision string. * * @return the revision */ public String getRevision() { return RevisionUtils.extract("$Revision: 1.19 $"); } /** * Main method for testing this class. * * @param argv the options */ public static void main(String [] argv) { runClassifier(new AODE(), argv); } }

The table below shows all metrics for AODE.java.

MetricValueDescription
BLOCKS57.00Number of blocks
BLOCK_COMMENT21.00Number of block comment lines
COMMENTS303.00Comment lines
COMMENT_DENSITY 0.99Comment density
COMPARISONS35.00Number of comparison operators
CYCLOMATIC64.00Cyclomatic complexity
DECL_COMMENTS44.00Comments in declarations
DOC_COMMENT241.00Number of javadoc comment lines
ELOC305.00Effective lines of code
EXEC_COMMENTS38.00Comments in executable code
EXITS44.00Procedure exits
FUNCTIONS23.00Number of function declarations
HALSTEAD_DIFFICULTY87.78Halstead difficulty
HALSTEAD_EFFORT 0.00Halstead effort
INTERFACE_COMPLEXITY44.00Interface complexity
JAVA0001 0.00JAVA0001 Package name does not contain only lower case letters
JAVA0002 1.00JAVA0002 Package name does not begin with a top level domain name or country code
JAVA0003 0.00JAVA0003 Minimize use of on-demand (.*) imports
JAVA0004 0.00JAVA0004 Unnecessary import from java.lang
JAVA0005 1.00JAVA0005 Imports not in specified order
JAVA0006 0.00JAVA0006 Empty finally block
JAVA0007 0.00JAVA0007 Should not declare public field
JAVA0008 0.00JAVA0008 Empty catch block
JAVA0009 0.00JAVA0009 Protected member in final class
JAVA0010 0.00JAVA0010 Non-instantiable class does not contain a non-private static member
JAVA0011 0.00JAVA0011 Abstract class does not contain an abstract method
JAVA0012 0.00JAVA0012 Non-constructor method with same name as declaring class
JAVA0013 0.00JAVA0013 Non-blank final field is not static
JAVA0014 0.00JAVA0014 Class with only static members has non-private constructor
JAVA0015 0.00JAVA0015 Package class contains public nested type
JAVA0016 0.00JAVA0016 Abstract class contains public constructor
JAVA0017 0.00JAVA0017 Class name does not have required form
JAVA0018 0.00JAVA0018 Method name does not have required form
JAVA0019 0.00JAVA0019 Interface name does not have required form
JAVA0020 0.00JAVA0020 Field name does not have required form
JAVA0021 0.00JAVA0021 Interface method name does not have required form
JAVA0022 0.00JAVA0022 Static final field name does not have required form
JAVA0023 0.00JAVA0023 Empty finalize method
JAVA0024 0.00JAVA0024 Empty class
JAVA0025 0.00JAVA0025 Method override is empty
JAVA0026 0.00JAVA0026 Finalize method with parameters
JAVA0029 0.00JAVA0029 Private method not used
JAVA0030 0.00JAVA0030 Private field not used
JAVA0031 0.00JAVA0031 Case statement not properly closed
JAVA0032 0.00JAVA0032 Switch statement missing default
JAVA0033 0.00JAVA0033 default: not last case in switch statement
JAVA003421.00JAVA0034 Missing braces in if statement
JAVA0035 0.00JAVA0035 Missing braces in for statement
JAVA0036 0.00JAVA0036 Missing braces in while statement
JAVA0038 0.00JAVA0038 Non-case label in switch statement
JAVA0039 0.00JAVA0039 Break statement with label
JAVA0040 0.00JAVA0040 Switch statement contains N cases (maximum: M)
JAVA0041 0.00JAVA0041 Nested synchronized block
JAVA0042 0.00JAVA0042 Empty synchronized statement
JAVA0043 0.00JAVA0043 Inner class does not use outer class
JAVA0044 0.00JAVA0044 Serializable class with no instance variables
JAVA0045 0.00JAVA0045 Serializable class with only transient fields
JAVA0046 0.00JAVA0046 Name of class not derived from Exception ends with 'Exception'
JAVA0047 0.00JAVA0047 Serializable class derives from invalid base class
JAVA0048 0.00JAVA0048 Name of class derived from Exception does not end with 'Exception'
JAVA0049 0.00JAVA0049 Nested block at depth N (maximum: M)
JAVA0050 0.00JAVA0050 Class derives from java.lang.Error
JAVA0051 0.00JAVA0051 Class derives from java.lang.RuntimeException
JAVA0052 0.00JAVA0052 Class derives from java.lang.Throwable
JAVA0053 0.00JAVA0053 Unused label
JAVA0054 0.00JAVA0054 Inheritance depth N exceeds maximum M
JAVA0055 0.00JAVA0055 Class should be interface
JAVA0056 0.00JAVA0056 Unnecessary abstract modifier for interface or annotation
JAVA0057 0.00JAVA0057 Unnecessary default constructor
JAVA0058 0.00JAVA0058 Constructor calls super()
JAVA0059 0.00JAVA0059 Method override only calls super()
JAVA0061 0.00JAVA0061 Inaccessible member in anonymous class
JAVA0062 0.00JAVA0062 Public class missing public member or protected constructor
JAVA0063 0.00JAVA0063 Identifier name should not contain '$'
JAVA0064 0.00JAVA0064 N variations of identifier name (maximum: M)
JAVA0065 0.00JAVA0065 Unnecessary final modifier for method in final class
JAVA0066 0.00JAVA0066 Unnecessary modifier for interface nested type
JAVA0067 0.00JAVA0067 Array descriptor on identifier name
JAVA0068 0.00JAVA0068 Modifiers not declared in recommended order
JAVA0071 0.00JAVA0071 Strings compared with ==
JAVA0073 0.00JAVA0073 Integer division in floating-point context
JAVA0074 0.00JAVA0074 Use of Object.notify()
JAVA0075 0.00JAVA0075 Method parameter hides field
JAVA0076 0.00JAVA0076 Use of magic number
JAVA0077 0.00JAVA0077 Private field not used in declaring class
JAVA0078 0.00JAVA0078 Floating point values compared with ==
JAVA0079 0.00JAVA0079 Use of instance to reference static member
JAVA0080 0.00JAVA0080 Import declaration not used
JAVA0081 0.00JAVA0081 Boolean literal in comparison
JAVA0082 5.00JAVA0082 Unnecessary widening cast
JAVA0083 0.00JAVA0083 Unnecessary instanceof test
JAVA0084 0.00JAVA0084 Should use compound assignment operator
JAVA0085 0.00JAVA0085 Use of sun.* class
JAVA0087 0.00JAVA0087 Use of Thread.sleep()
JAVA0089 0.00JAVA0089 Use of restricted package
JAVA0092 0.00JAVA0092 Use of restricted type
JAVA0093 0.00JAVA0093 Redundant assignment
JAVA0094 1.00JAVA0094 Field hides a superclass field
JAVA0095 0.00JAVA0095 Uninitialized private field
JAVA0096 0.00JAVA0096 Field in nested class hides outer field
JAVA0098 0.00JAVA0098 Minimize use of implicit field initializers
JAVA0100 1.00JAVA0100 Class contains N non-final fields (maximum: M)
JAVA0101 0.00JAVA0101 Unnecessary modifier for field in interface
JAVA0102 0.00JAVA0102 Last statement in finalize() not super.finalize()
JAVA0103 0.00JAVA0103 Explicit call to finalize()
JAVA0104 0.00JAVA0104 finalize() only calls super.finalize()
JAVA0105 0.00JAVA0105 Duplicate import declaration
JAVA0106 0.00JAVA0106 Unnecessary import from current package
JAVA0108 0.00JAVA0108 Incorrect javadoc: no @param tag for 'parameter'
JAVA0109 0.00JAVA0109 Incorrect javadoc: no parameter 'parameter'
JAVA0110 0.00JAVA0110 Incorrect javadoc: no @return tag
JAVA0111 0.00JAVA0111 Incorrect javadoc: @return tag for void method
JAVA0112 0.00JAVA0112 Incorrect javadoc: no exception 'exception' in throws
JAVA0113 0.00JAVA0113 Incorrect javadoc: no @author tag
JAVA0114 0.00JAVA0114 Incorrect javadoc: no @version tag
JAVA0115 0.00JAVA0115 Incorrect javadoc: no @throws or @exception tag for 'exception'
JAVA0116 0.00JAVA0116 Missing javadoc: field 'field'
JAVA0117 0.00JAVA0117 Missing javadoc: method 'method'
JAVA0118 0.00JAVA0118 Missing javadoc: type 'type'
JAVA0119 0.00JAVA0119 Control variable changed within body of for loop
JAVA0123 0.00JAVA0123 Use all three components of for loop
JAVA0125 0.00JAVA0125 Continue statement with label
JAVA0126 0.00JAVA0126 Method declares unchecked exception in throws
JAVA0128 0.00JAVA0128 Public constructor in non-public class
JAVA0130 0.00JAVA0130 Non-static method does not use instance fields
JAVA0131 0.00JAVA0131 Compatible method does not override base
JAVA0132 0.00JAVA0132 Method overload with compatible signature
JAVA0133 0.00JAVA0133 Non-synchronized method overrides synchronized method
JAVA0135 0.00JAVA0135 Only one of Object.equals and Object.hashCode defined: missing 'method'
JAVA0136 1.00JAVA0136 N methods defined in class (maximum: M)
JAVA0137 1.00JAVA0137 Non-abstract class missing constructor
JAVA0138 0.00JAVA0138 N parameters defined for method (maximum: M)
JAVA0139 0.00JAVA0139 Definition of main other than public static void main(java.lang.String[])
JAVA0141 0.00JAVA0141 Unnecessary modifier for method in interface
JAVA0143 0.00JAVA0143 Synchronized method
JAVA0144 2.00JAVA0144 Line exceeds maximum M characters
JAVA014511.00JAVA0145 Tab character used in source file
JAVA0150 0.00JAVA0150 java.lang.Error (or subclass) thrown
JAVA0153 0.00JAVA0153 Inefficient conversion of integer to string
JAVA0159 0.00JAVA0159 Inefficient conversion of string to integer
JAVA0160 0.00JAVA0160 Method does not throw specified exception
JAVA0161 0.00JAVA0161 Conditional wait() not in loop
JAVA0163 0.00JAVA0163 Empty statement
JAVA0165 0.00JAVA0165 Conflicting return statement in finally block
JAVA0166 1.00JAVA0166 Generic exception caught
JAVA0167 0.00JAVA0167 ThreadDeath not rethrown
JAVA0169 0.00JAVA0169 Unnecessary catch block: exception 'exception'
JAVA0170 0.00JAVA0170 Caught exception not derived from java.lang.Exception
JAVA0171 0.00JAVA0171 Unused local variable
JAVA0173 0.00JAVA0173 Unused method parameter
JAVA0174 0.00JAVA0174 Assigned local variable never used
JAVA0175 0.00JAVA0175 Successive assignment to variable
JAVA0176 0.00JAVA0176 Local variable name does not have required form
JAVA0177 8.00JAVA0177 Variable declaration missing initializer
JAVA0179 0.00JAVA0179 Local variable hides visible field
JAVA0233 1.00JAVA0233 Definition of serialVersionUID other than 'private static final long serialVersionUID'
JAVA0234 0.00JAVA0234 Class is Serializable but does not define serialVersionUID
JAVA0235 0.00JAVA0235 Class defines serialVersionUID but does not implement Serializable
JAVA0236 0.00JAVA0236 Attempt to clone an object which does not implement Cloneable
JAVA0237 1.00JAVA0237 Class implements Cloneable but does not have public clone method
JAVA0238 0.00JAVA0238 Clone method does not call super.clone()
JAVA0239 0.00JAVA0239 Class declares 'readObject' or 'writeObject' but does not implement Serializable
JAVA0240 0.00JAVA0240 Serializable class which declares readObject or writeObject but not both
JAVA0241 0.00JAVA0241 'readObject' or 'writeObject' should be declared private in Serializable class
JAVA0242 0.00JAVA0242 Transient field in non-Serializable class
JAVA0243 0.00JAVA0243 'readResolve' or 'writeReplace' should be declared private or protected
JAVA0244 0.00JAVA0244 Field or method name in subclass differs only by case from inherited field or method
JAVA0245 0.00JAVA0245 JUnit TestCase with non-trivial constructor
JAVA0246 0.00JAVA0246 JUnit assertXXX statement missing message parameter
JAVA0247 0.00JAVA0247 JUnit 'setUp()' and 'tearDown()' should call super method
JAVA0248 0.00JAVA0248 JUnit method 'setUp' or 'tearDown' with incorrect signature
JAVA0249 0.00JAVA0249 JUnit TestCase 'suite()' should be declared static
JAVA0250 0.00JAVA0250 JUnit TestCase declares testXXX method with incorrect signature
JAVA0251 0.00JAVA0251 Use '%n' for line breaks in printf/format for platform independence
JAVA0252 0.00JAVA0252 'enum' is a Java 1.5 reserved word
JAVA0253 0.00JAVA0253 Not all enum constants consumed in switch statement
JAVA0254 0.00JAVA0254 Use enhanced for loop construct instead of Iterator
JAVA0255 0.00JAVA0255 Result of method invocation not used
JAVA0256 0.00JAVA0256 Assignment of external collection/array to field
JAVA0257 0.00JAVA0257 Use of 'Constant Interface' anti-pattern
JAVA0258 0.00JAVA0258 Implement Iterable for foreach compatibility
JAVA0259 0.00JAVA0259 Return of collection/array field
JAVA0260 0.00JAVA0260 Use 'enum' instead of Enumerated Type pattern
JAVA0261 0.00JAVA0261 Use specialized Enum collection types
JAVA0262 0.00JAVA0262 Use of char in integer context
JAVA0263 0.00JAVA0263 Long literal ends with 'l' instead of 'L'
JAVA0264 0.00JAVA0264 Integer math in long context - check for overflow
JAVA0265 0.00JAVA0265 Use of Throwable.printStackTrace()
JAVA0266 2.00JAVA0266 Use of System.out
JAVA0267 0.00JAVA0267 Use of System.err
JAVA0269 0.00JAVA0269 Contents of StringBuffer never used
JAVA0270 0.00JAVA0270 Use Java 5.0 enhanced for loop construct to iterate over all elements in an array
JAVA0271 0.00JAVA0271 Minimize use of on-demand (.*) static imports
JAVA0272 0.00JAVA0272 Thread.run() called
JAVA0273 0.00JAVA0273 Non-final derivative of Thread calls start() in constructor
JAVA0274 0.00JAVA0274 Serializable class has a synchronized readObject()
JAVA0275 0.00JAVA0275 Serializable class has a synchronized writeObject() and no other synchronized methods
JAVA0276 0.00JAVA0276 Unnecessary use of String constructor
JAVA0277 0.00JAVA0277 Iterator.next() implementation does not throw NoSuchElementException
JAVA0278 0.00JAVA0278 Unnecessary use of Boolean constructor
JAVA0279 0.00JAVA0279 Serialization method readObject or readObjectNoData calls an overridable method
JAVA0280 0.00JAVA0280 IllegalMonitorStateException caught
JAVA0281 0.00JAVA0281 Iterator.next() not called in loop
JAVA0282 0.00JAVA0282 Call to Iterator.next() in loop which does not test Iterator.hasNext()
JAVA0283 0.00JAVA0283 Control variable not updated in loop body
JAVA0284 0.00JAVA0284 Explicit garbage collection
JAVA0285 0.00JAVA0285 Dereference of potentially null variable
JAVA0286 0.00JAVA0286 Dereference of null variable
JAVA0287 0.00JAVA0287 Unnecessary null check
JAVA0288 0.00JAVA0288 Inconsistent null check
LINES781.00Number of lines in the source file
LINE_COMMENT41.00Number of line comments
LOC355.00Lines of code
LOGICAL_LINES201.00Number of statements
LOOPS11.00Number of loops
NEST_DEPTH 5.00Maximum nesting depth
OPERANDS790.00Number of operands
OPERATORS1569.00Number of operators
PARAMS11.00Number of formal parameter declarations
PROGRAM_LENGTH2359.00Halstead program length
PROGRAM_VOCAB286.00Halstead program vocabulary
PROGRAM_VOLUME 0.00Halstead program volume
RETURNS33.00Number of return points from functions
SIZE24280.00Size of the file in bytes
UNIQUE_OPERANDS234.00Number of unique operands
UNIQUE_OPERATORS52.00Number of unique operators
WHITESPACE123.00Number of whitespace lines