edu.umd.cs.findbugs.gui2
Class BugAspects
public
class
BugAspects
extends Object
implements Iterable<BugAspects.SortableValue>
These are the branches in our tree, each branch forms a complete query that could be sent
to the main bugset to return all the bugs it contains
For example, a single bugAspects could be
or it could be ,
,,
In this implementation, , is different from
,. (I'm not talking about the fact we use the .equals
from ArrayList, I'm talking about what a query would return, though both are true)
For a speed boost, this class could be rewritten to make these equal, BugSet could be rewritten
to cache full queries off the main BugSet, (instead of caching each part of the query separately
in the BugSets created) and resetData could be rewritten to work more like Swing's validate, only
clearing data if the data is wrong. This would save time after changing certain aspects of the tree.
Just an idea, I wouldn't suggest it unless its absolutely necessary. -Dan
Author: All of us
public BugAspects()
public void add(BugAspects.SortableValue sp)
public
BugAspects addToNew(BugAspects.SortableValue sp)
public int getCount()
public StackedFilterMatcher getStackedFilterMatcher()
public Iterator<BugAspects.SortableValue> iterator()
public BugAspects.SortableValue last()
public void setCount(int count)
This is how the numbers after the branches contain the number of bugs in them, even if they aren't the final branch
Parameters: count
public int size()
FindBugs™ is licenced under the LGPL. Copyright © 2006 University of Maryland.