Package edu.umd.cs.findbugs.gui2

Class BugAspects

java.lang.Object

edu.umd.cs.findbugs.gui2.BugAspects

All Implemented Interfaces:

java.lang.Iterable<edu.umd.cs.findbugs.gui2.BugAspects.SortableValue>

public class BugAspects
extends java.lang.Object
implements java.lang.Iterable<edu.umd.cs.findbugs.gui2.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 <priority,high> or it could be <priority,high>, <designation,must fix>,<class,fishpond>, <package,default> In this implementation, <priority,high>,<designation,unclassified> is different from <designation,unclassified>,<priority,high>. (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

Constructor Summary

Constructors

Constructor	Description
BugAspects()
BugAspects(BugAspects a)

Method Summary

Modifier and Type	Method	Description
void	add(edu.umd.cs.findbugs.gui2.BugAspects.SortableValue sp)
BugAspects	addToNew(edu.umd.cs.findbugs.gui2.BugAspects.SortableValue sp)
edu.umd.cs.findbugs.gui2.BugAspects.SortableValue	get(int i)
int	getCount()
Matcher	getMatcher()
BugSet	getMatchingBugs(BugSet theSet)
StackedFilterMatcher	getStackedFilterMatcher()
java.util.Iterator<edu.umd.cs.findbugs.gui2.BugAspects.SortableValue>	iterator()
edu.umd.cs.findbugs.gui2.BugAspects.SortableValue	last()
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
int	size()
java.lang.String	toString()

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Constructor Detail

BugAspects

public BugAspects()

BugAspects

public BugAspects(BugAspects a)

Method Detail

last

public edu.umd.cs.findbugs.gui2.BugAspects.SortableValue last()

size

public int size()

get

public edu.umd.cs.findbugs.gui2.BugAspects.SortableValue get(int i)

toString

public java.lang.String toString()

Overrides:

toString in class java.lang.Object

setCount

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 -

getCount

public int getCount()

add

public void add(edu.umd.cs.findbugs.gui2.BugAspects.SortableValue sp)

addToNew

public BugAspects addToNew(edu.umd.cs.findbugs.gui2.BugAspects.SortableValue sp)

getMatcher

public Matcher getMatcher()

getStackedFilterMatcher

public StackedFilterMatcher getStackedFilterMatcher()

getMatchingBugs

public BugSet getMatchingBugs(BugSet theSet)

iterator

public java.util.Iterator<edu.umd.cs.findbugs.gui2.BugAspects.SortableValue> iterator()

Specified by:

iterator in interface java.lang.Iterable<edu.umd.cs.findbugs.gui2.BugAspects.SortableValue>