PluginTreeNode.java

Index Score
devplugin
TV-Browser

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
JAVA0143JAVA0143 Synchronized method
BLOCKSNumber of blocks
CYCLOMATICCyclomatic complexity
EXITSProcedure exits
RETURNSNumber of return points from functions
JAVA0117JAVA0117 Missing javadoc: method 'method'
LOOPSNumber of loops
JAVA0049JAVA0049 Nested block at depth N (maximum: M)
COMPARISONSNumber of comparison operators
LOGICAL_LINESNumber of statements
OPERATORSNumber of operators
INTERFACE_COMPLEXITYInterface complexity
LOCLines of code
PROGRAM_LENGTHHalstead program length
FUNCTIONSNumber of function declarations
ELOCEffective lines of code
OPERANDSNumber of operands
UNIQUE_OPERANDSNumber of unique operands
PROGRAM_VOCABHalstead program vocabulary
LINESNumber of lines in the source file
EXEC_COMMENTSComments in executable code
SIZESize of the file in bytes
JAVA0270JAVA0270 Use Java 5.0 enhanced for loop construct to iterate over all elements in an array
JAVA0254JAVA0254 Use enhanced for loop construct instead of Iterator
PARAMSNumber of formal parameter declarations
JAVA0282JAVA0282 Call to Iterator.next() in loop which does not test Iterator.hasNext()
JAVA0034JAVA0034 Missing braces in if statement
UNIQUE_OPERATORSNumber of unique operators
JAVA0177JAVA0177 Variable declaration missing initializer
LINE_COMMENTNumber of line comments
JAVA0077JAVA0077 Private field not used in declaring class
NEST_DEPTHMaximum nesting depth
PROGRAM_VOLUMEHalstead program volume
JAVA0136JAVA0136 N methods defined in class (maximum: M)
JAVA0032JAVA0032 Switch statement missing default
JAVA0126JAVA0126 Method declares unchecked exception in throws
JAVA0285JAVA0285 Dereference of potentially null variable
JAVA0110JAVA0110 Incorrect javadoc: no @return tag
JAVA0100JAVA0100 Class contains N non-final fields (maximum: M)
JAVA0145JAVA0145 Tab character used in source file
/* * TV-Browser * Copyright (C) 04-2003 Martin Oberhauser (martin@tvbrowser.org) * * 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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. * * CVS information: * $RCSfile$ * $Source$ * $Date: 2008-05-30 13:41:27 -0400 (Fri, 30 May 2008) $ * $Author: ds10 $ * $Revision: 4748 $ */ package devplugin; import java.io.IOException; import java.io.ObjectInputStream; import java.io.ObjectOutputStream; import java.util.ArrayList; import java.util.Arrays; import java.util.Collections; import java.util.Comparator; import java.util.HashMap; import java.util.Iterator; import java.util.List; import java.util.Map; import java.util.Set; import javax.swing.Action; import tvbrowser.core.TvDataUpdateListener; import tvbrowser.core.TvDataUpdater; import tvbrowser.ui.pluginview.Node; import tvbrowser.ui.pluginview.PluginTreeModel; import util.program.ProgramUtilities; import util.ui.Localizer; /** * The PluginTreeNode class represents a single node of the plugin tree view. * */ public class PluginTreeNode { private static final util.ui.Localizer mLocalizer = util.ui.Localizer.getLocalizerFor(PluginTreeNode.class); private int mNodeType; private ArrayList<PluginTreeNode> mChildNodes; private Object mObject; private ArrayList<PluginTreeListener> mNodeListeners; private Marker mMarker; private Node mDefaultNode; private boolean mGroupingByDate; private boolean mGroupWeekly; private PluginTreeNode(int type, Object o) { mChildNodes = null; // do not initialize to save memory mNodeType = type; mObject = o; mDefaultNode = new Node(type, mObject); mNodeListeners = null; // do not initialize to save memory mGroupingByDate = true; mGroupWeekly = false; } /** * Creates a new PluginTreeNode object with a specified title * @param title */ public PluginTreeNode(String title) { this(Node.CUSTOM_NODE, title); } /** * Creates a new root PluginTreeNode * On TV listings updates, the {@link PluginTreeListener} gets informed. * @param marker */ public PluginTreeNode(Marker marker) { this(marker, true); } /** * Creates a new root PluginTreeNode * @param marker * @param handleTvDataUpdate specifies, if the {@link PluginTreeListener} * should get called on TV listings updates */ public PluginTreeNode(Marker marker, boolean handleTvDataUpdate) { this(Node.PLUGIN_ROOT, marker); mMarker = marker; if (handleTvDataUpdate) { final RemovedProgramsHandler removedProgramsHandler = new RemovedProgramsHandler(); TvDataUpdater.getInstance().addTvDataUpdateListener(new TvDataUpdateListener() { public void tvDataUpdateStarted() { removedProgramsHandler.clear(); } public void tvDataUpdateFinished() { refreshAllPrograms(removedProgramsHandler); update(); Program[] removedPrograms = removedProgramsHandler.getRemovedPrograms(); fireProgramsRemoved(removedPrograms); } }); } } /** * Creates a new Node containing a program item. * @param item */ public PluginTreeNode(ProgramItem item) { this(Node.PROGRAM, item); mDefaultNode.setAllowsChildren(false); } public void addNodeListener(PluginTreeListener listener) { if (mNodeListeners == null) { mNodeListeners = new ArrayList<PluginTreeListener>(1); } mNodeListeners.add(listener); } public boolean removeNodeListener(PluginTreeListener listener) { if (mNodeListeners == null) { return false; } return mNodeListeners.remove(listener); } public void removeAllNodeListeners() { if (mNodeListeners == null) { return; } mNodeListeners.clear(); mNodeListeners = null; } /** * Remove all programs from this node which are not available any more */ private synchronized void refreshAllPrograms(RemovedProgramsHandler handler) { // non initialized child collection, if it is empty if (mChildNodes == null) { return; } for (int i=mChildNodes.size()-1; i>=0; i--) { PluginTreeNode node = mChildNodes.get(i); node.mMarker = mMarker; if (node.isLeaf()) { ProgramItem progItemInTree = (ProgramItem)node.getUserObject(); Program progInTree = progItemInTree.getProgram(); if(progInTree.getProgramState() == Program.WAS_DELETED_STATE) { removeProgram(progInTree); handler.addRemovedProgram(progInTree); } else if(progInTree.getProgramState() == Program.WAS_UPDATED_STATE) { Program updatedProg = Plugin.getPluginManager().getProgram(progInTree.getDate(), progInTree.getID()); progItemInTree.setProgram(updatedProg); } } else { node.refreshAllPrograms(handler); } } } private void fireProgramsRemoved(Program[] progArr) { if (mNodeListeners == null) { return; } for (int i=0; i<mNodeListeners.size(); i++) { PluginTreeListener listener = mNodeListeners.get(i); listener.programsRemoved(progArr); } } public Node getMutableTreeNode() { return mDefaultNode; } /** * Adds a an action menu to this node * @param menu */ public void addActionMenu(ActionMenu menu) { mDefaultNode.addActionMenu(menu); } public void removeAllActions() { mDefaultNode.removeAllActionMenus(); } public void addAction(Action action) { addActionMenu(new ActionMenu(action)); } public ActionMenu[] getActionMenus() { return mDefaultNode.getActionMenus(); } /** * Sets the formatter for this node and all of the child nodes. * @param formatter the formatter */ public void setNodeFormatter(NodeFormatter formatter) { mDefaultNode.setNodeFormatter(formatter); } /** * Enables/Disables the 'grouping by date'-feature. * Default is 'enabled' * * @param enable */ public void setGroupingByDateEnabled(boolean enable) { mGroupingByDate = enable; } /** * Enables/Disables 'grouping by week' for nodes showing * programs by date. Only evaluated if "grouping by date" * is enabled. * Default is 'disabled' * * @see #setGroupingByDateEnabled(boolean) * * @param enable */ public void setGroupingByWeekEnabled(boolean enable) { mGroupWeekly = enable; } private NodeFormatter getNodeFormatter(boolean isWeekNodesEnabled) { return mDefaultNode.getNodeFormatter(isWeekNodesEnabled); } private void createDefaultNodes() { mDefaultNode.removeAllChildren(); // non initialized child collection, if it is empty if (mChildNodes == null) { return; } PluginTreeNode[] items = mChildNodes.toArray(new PluginTreeNode[mChildNodes.size()]); Arrays.sort(items, sPluginTreeNodeComparator); Date currentDate = null; for (int i=0; i<items.length; i++) { PluginTreeNode n = items[i]; if (!n.isLeaf()) { if (n.mGroupingByDate) { n.createDateNodes(); } else { n.createDefaultNodes(); } mDefaultNode.add(n.getMutableTreeNode()); } else { if (n.mNodeType == Node.PROGRAM) { ProgramItem progItem = (ProgramItem)n.getUserObject(); Node node = n.getMutableTreeNode(); if (currentDate == null) { currentDate = Date.getCurrentDate(); } if(progItem.getProgram().getDate().addDays(1).compareTo(currentDate) >= 0) mDefaultNode.add(node); } else { mDefaultNode.add(n.getMutableTreeNode()); } } } } private void createDateNodes() { /* We create new folders for each day and assign the program items to the appropriate folder */ mDefaultNode.removeAllChildren(); // return if no nodes available if (mChildNodes == null || mChildNodes.size() == 0) { return; } Map<Date, ArrayList<PluginTreeNode>> dateMap = new HashMap<Date, ArrayList<PluginTreeNode>>(); // key: date; value: ArrayList of ProgramItem objects Iterator<PluginTreeNode> it = mChildNodes.iterator(); Date currentDate = Date.getCurrentDate(); while (it.hasNext()) { PluginTreeNode n = it.next(); if (!n.isLeaf()) { if (n.mGroupingByDate) { n.createDateNodes(); } else { n.createDefaultNodes(); } mDefaultNode.add(n.getMutableTreeNode()); } else { Date date = ((ProgramItem)n.getUserObject()).getProgram().getDate(); if(date.addDays(1).compareTo(currentDate) >= 0) { ArrayList<PluginTreeNode> list = dateMap.get(date); if (list == null) { list = new ArrayList<PluginTreeNode>(); dateMap.put(date, list); } list.add(n); } } } // Create the new nodes Set<Date> keySet = dateMap.keySet(); Date[] dates = new Date[keySet.size()]; keySet.toArray(dates); Arrays.sort(dates); Date today = currentDate; Date nextDay = today.addDays(1); Date yesterDay = today.addDays(-1); Node node=null; String lastDateStr=""; int numPrograms = 0; for (Date date : dates) { numPrograms += dateMap.get(date).size(); } // show week nodes if there are less than 2 programs per day on average boolean createWeekNodes = mGroupWeekly && (numPrograms <= dates.length * 2); boolean isShowingWeekNodes = createWeekNodes; for (int i=0; i<dates.length; i++) { String dateStr; if (yesterDay.equals(dates[i])) { dateStr = Localizer.getLocalization(Localizer.I18N_YESTERDAY); isShowingWeekNodes = false; } else if (today.equals(dates[i])) { dateStr = Localizer.getLocalization(Localizer.I18N_TODAY); isShowingWeekNodes = false; } else if (nextDay.equals(dates[i])) { dateStr = Localizer.getLocalization(Localizer.I18N_TOMORROW); isShowingWeekNodes = false; } else { if (createWeekNodes) { int weeks = dates[i].getNumberOfDaysSince(today) / 7; if (weeks <= 3) { dateStr = mLocalizer.msg("weeks."+weeks,"in {0} weeks",weeks); } else { dateStr = mLocalizer.msg("weeks.later","later"); } } else { dateStr = dates[i].getLongDateString(); } } if (!dateStr.equals(lastDateStr)) { node = new Node(Node.STRUCTURE_NODE, dateStr); mDefaultNode.add(node); lastDateStr = dateStr; } List<PluginTreeNode> list = dateMap.get(dates[i]); PluginTreeNode[] nodeArr = new PluginTreeNode[list.size()]; list.toArray(nodeArr); Arrays.sort(nodeArr, sPluginTreeNodeComparator); for (int k=0; k<nodeArr.length; k++) { Node newNode = new Node((ProgramItem)nodeArr[k].getUserObject()); newNode.setNodeFormatter(nodeArr[k].getNodeFormatter(createWeekNodes && isShowingWeekNodes)); node.add(newNode); } isShowingWeekNodes = createWeekNodes; } } private static Comparator<PluginTreeNode> sPluginTreeNodeComparator = new Comparator<PluginTreeNode>() { public int compare(PluginTreeNode n1, PluginTreeNode n2) { Object u1 = n1.getUserObject(); Object u2 = n2.getUserObject(); if (u1 instanceof ProgramItem && u2 instanceof ProgramItem) { return sProgramItemComparator.compare((ProgramItem)u1, (ProgramItem)u2); } if (u1 instanceof String && u2 instanceof String) { return ((String)u1).compareToIgnoreCase((String)u2); } if (u1 instanceof String) { return 1; } return -1; } }; private static Comparator<ProgramItem> sProgramItemComparator = new Comparator<ProgramItem>(){ public int compare(ProgramItem pi1, ProgramItem pi2) { Program p1 = pi1.getProgram(); Program p2 = pi2.getProgram(); int result = p1.getDate().compareTo(p2.getDate()); if (result != 0) { return result; } int t1 = p1.getStartTime(); int t2 = p2.getStartTime(); if (t1 < t2) { return -1; } else if (t1 > t2) { return 1; } return 0; } }; public Object getUserObject() { return mObject; } public synchronized void removeAllChildren() { if (mMarker != null) { Program[] programs = getPrograms(); for (int i=0; i<programs.length; i++) { programs[i].unmark(mMarker); } } if (mChildNodes != null) { mChildNodes.clear(); mChildNodes = null; } mDefaultNode.removeAllChildren(); } public synchronized void add(PluginTreeNode node) { // create collection on demand only if (mChildNodes == null) { mChildNodes = new ArrayList<PluginTreeNode>(1); } mChildNodes.add(node); node.mMarker = mMarker; } public boolean contains(Program prog, boolean recursive) { PluginTreeNode node = findProgramTreeNode(prog, recursive); return node != null; } public boolean contains(Program prog) { return contains(prog, false); } /** * Refreshs the tree. Call this method after you have added/removed/changed nodes * of the (sub-)tree */ public synchronized void update() { if (mGroupingByDate) { createDateNodes(); } else { createDefaultNodes(); } PluginTreeModel.getInstance().reload(mDefaultNode); } public synchronized void addPrograms(List<Program> listNew) { Iterator<Program> newIt = listNew.iterator(); // create sorted lists of current and new programs, but only if this node contains any children at all! if (mChildNodes != null && mChildNodes.size() > 0) { Program[] currentProgs = getPrograms(); ArrayList<Program> listCurrent = new ArrayList<Program>(currentProgs.length); for (int i = 0; i < currentProgs.length; i++) { listCurrent.add(currentProgs[i]); } Comparator<Program> comp = ProgramUtilities.getProgramComparator(); Collections.sort(listCurrent, comp); Collections.sort(listNew, comp); Iterator<Program> currentIt = listCurrent.iterator(); // iterate both lists in parallel and add only new programs if (currentIt.hasNext() && newIt.hasNext()) { Program newProg = newIt.next(); Program currentProg = currentIt.next(); while (newProg != null && currentProg != null) { int comparison = comp.compare(newProg, currentProg); // new program is sorted first -> add it and investigate next new if (comparison < 0) { markAndAdd(newProg); if (newIt.hasNext()) { newProg = newIt.next(); } else { newProg = null; } } // old program is sorted first -> go to next old program for comparison else if (comparison > 0) { if (currentIt.hasNext()) { currentProg = currentIt.next(); } else { currentProg = null; } } // program already available -> skip else if (comparison == 0) { if (currentIt.hasNext()) { currentProg = currentIt.next(); } else { currentProg = null; } if (newIt.hasNext()) { newProg = newIt.next(); } else { newProg = null; } } } } } // add all remaining new programs while (newIt.hasNext()) { markAndAdd(newIt.next()); } } private void markAndAdd(Program program) { if (mMarker != null) { program.mark(mMarker); } PluginTreeNode node = new PluginTreeNode(new ProgramItem(program)); add(node); } /** * add a single program to this tree node. * If the program is already contained in this sub tree, it is not added again. * * @param program * @return the tree node containing the program */ public synchronized PluginTreeNode addProgram(Program program) { // don't search using contains(), this would require a second search PluginTreeNode node = findProgramTreeNode(program, false); if (node != null) { // node already exists return node; } if (mMarker != null) { program.mark(mMarker); } node = new PluginTreeNode(new ProgramItem(program)); add(node); return node; } /** * add a single program node to this tree node. * It is not checked if the program is already contained in this sub tree, * so you may only use this method with newly created tree nodes! * * @param program * @return the tree node containing the program */ public synchronized PluginTreeNode addProgramWithoutCheck(Program program) { if (mMarker != null) { program.mark(mMarker); } PluginTreeNode node = new PluginTreeNode(new ProgramItem(program)); add(node); return node; } private PluginTreeNode findProgramTreeNode(PluginTreeNode root, Program prog, boolean recursive) { if (root.mChildNodes != null) { Iterator<PluginTreeNode> it = root.mChildNodes.iterator(); while (it.hasNext()) { PluginTreeNode node = (PluginTreeNode)it.next(); if (!node.isLeaf()) { if (recursive) { PluginTreeNode n = findProgramTreeNode(node, prog, recursive); if (n!=null) { return n; } } } else { ProgramItem item = (ProgramItem)node.getUserObject(); if (item.getProgram().equals(prog)) { return node; } } } } return null; } private PluginTreeNode findProgramTreeNode(Program prog, boolean recursive) { return findProgramTreeNode(this, prog, recursive); } public synchronized void removeProgram(ProgramItem item) { removeProgram(item.getProgram()); } public synchronized void removeProgram(Program program) { PluginTreeNode node = findProgramTreeNode(program, false); if (node != null) { mChildNodes.remove(node); if (mMarker != null) { program.unmark(mMarker); } } } public synchronized PluginTreeNode addNode(String title) { PluginTreeNode node = new PluginTreeNode(title); add(node); return node; } public ProgramItem[] getProgramItems() { // return if there are no child nodes if (mChildNodes == null) { return new ProgramItem[0]; } // we have child nodes ArrayList<Object> list = new ArrayList<Object>(); Iterator<PluginTreeNode> it = mChildNodes.iterator(); while (it.hasNext()) { PluginTreeNode n = it.next(); if (n.isLeaf()) { list.add(n.getUserObject()); } } ProgramItem[] result = new ProgramItem[list.size()]; list.toArray(result); return result; } public Program[] getPrograms() { // return if there are no children if (mChildNodes == null) { return new Program[0]; } // we have child nodes ArrayList<Program> list = new ArrayList<Program>(); Iterator<PluginTreeNode> it = mChildNodes.iterator(); while (it.hasNext()) { PluginTreeNode n = it.next(); if (n.isLeaf()) { ProgramItem item = (ProgramItem)n.getUserObject(); list.add(item.getProgram()); } } Program[] result = new Program[list.size()]; list.toArray(result); return result; } public void store(ObjectOutputStream out) throws IOException { int childrenCnt = 0; if (mChildNodes != null) { childrenCnt = mChildNodes.size(); } out.writeInt(childrenCnt); for (int i=0; i<childrenCnt; i++) { PluginTreeNode n = mChildNodes.get(i); out.writeInt(n.mNodeType); if (!n.isLeaf()) { String title = (String)n.getUserObject(); out.writeObject(title); } else { ProgramItem item = (ProgramItem)n.getUserObject(); item.write(out); } n.store(out); } } public void load(ObjectInputStream in) throws IOException, ClassNotFoundException { int cnt = in.readInt(); for (int i=0; i<cnt; i++) { int type = in.readInt(); PluginTreeNode n; if (type == Node.PROGRAM) { ProgramItem item = new ProgramItem(); item.read(in); n = findProgramTreeNode(item.getProgram(), true); if (n == null) { n = new PluginTreeNode(item); if (item.getProgram() != null) { add(n); if (mMarker != null) { item.getProgram().mark(mMarker); } } } } else { String title = (String)in.readObject(); n = new PluginTreeNode(title); add(n); } n.load(in); } } /** * Get the number of child nodes. * * @return number of child nodes */ public int size() { if (mChildNodes == null) { return 0; } return mChildNodes.size(); } public synchronized void clear() { if (mChildNodes == null) { return; } mChildNodes.clear(); mChildNodes = null; } public boolean isEmpty() { return (mChildNodes == null || mChildNodes.isEmpty()); } public boolean isLeaf() { return (mDefaultNode.getType() == Node.PROGRAM); } @Override public String toString() { switch (mNodeType) { case Node.PLUGIN_ROOT: { return "plugin node: " + mObject.toString(); } case Node.PROGRAM: { return "program node: " + mObject.toString(); } case Node.STRUCTURE_NODE: { return "structure node: " + mObject.toString(); } case Node.CUSTOM_NODE: { return "custom node: " + mObject.toString(); } } return super.toString(); } public static class RemovedProgramsHandler { private ArrayList<Program> mProgArr; public RemovedProgramsHandler() { mProgArr = new ArrayList<Program>(); } public void clear() { mProgArr.clear(); } public void addRemovedProgram(Program prog) { mProgArr.add(prog); } public Program[] getRemovedPrograms() { Program[] progArr = new Program[mProgArr.size()]; mProgArr.toArray(progArr); return progArr; } } }

The table below shows all metrics for PluginTreeNode.java.

MetricValueDescription
BLOCKS157.00Number of blocks
BLOCK_COMMENT27.00Number of block comment lines
COMMENTS119.00Comment lines
COMMENT_DENSITY 0.27Comment density
COMPARISONS89.00Number of comparison operators
CYCLOMATIC149.00Cyclomatic complexity
DECL_COMMENTS15.00Comments in declarations
DOC_COMMENT74.00Number of javadoc comment lines
ELOC448.00Effective lines of code
EXEC_COMMENTS19.00Comments in executable code
EXITS112.00Procedure exits
FUNCTIONS53.00Number of function declarations
HALSTEAD_DIFFICULTY93.14Halstead difficulty
HALSTEAD_EFFORT 0.00Halstead effort
INTERFACE_COMPLEXITY129.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 0.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 1.00JAVA0032 Switch statement missing default
JAVA0033 0.00JAVA0033 default: not last case in switch statement
JAVA0034 1.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'
JAVA004910.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 1.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 1.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 0.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 1.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 1.00JAVA0113 Incorrect javadoc: no @author tag
JAVA0114 1.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'
JAVA011727.00JAVA0117 Missing javadoc: method 'method'
JAVA0118 1.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 0.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
JAVA014311.00JAVA0143 Synchronized method
JAVA0144 1.00JAVA0144 Line exceeds maximum M characters
JAVA0145 4.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 0.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 2.00JAVA0177 Variable declaration missing initializer
JAVA0179 0.00JAVA0179 Local variable hides visible field
JAVA0233 0.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 0.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 4.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 0.00JAVA0266 Use of System.out
JAVA0267 0.00JAVA0267 Use of System.err
JAVA0269 0.00JAVA0269 Contents of StringBuffer never used
JAVA0270 5.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 4.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 1.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
LINES819.00Number of lines in the source file
LINE_COMMENT18.00Number of line comments
LOC607.00Lines of code
LOGICAL_LINES299.00Number of statements
LOOPS15.00Number of loops
NEST_DEPTH 6.00Maximum nesting depth
OPERANDS1243.00Number of operands
OPERATORS2549.00Number of operators
PARAMS40.00Number of formal parameter declarations
PROGRAM_LENGTH3792.00Halstead program length
PROGRAM_VOCAB422.00Halstead program vocabulary
PROGRAM_VOLUME 0.00Halstead program volume
RETURNS89.00Number of return points from functions
SIZE23148.00Size of the file in bytes
UNIQUE_OPERANDS367.00Number of unique operands
UNIQUE_OPERATORS55.00Number of unique operators
WHITESPACE93.00Number of whitespace lines