Package edu.berkeley.cs.jqf.fuzz.util
Interface ICoverage<T extends Counter>
- All Known Implementing Classes:
Coverage,FastNonCollidingCoverage
public interface ICoverage<T extends Counter>
-
Method Summary
Modifier and TypeMethodDescriptionvoidclear()Clears the coverage map.org.eclipse.collections.api.list.primitive.IntListcomputeNewCoverage(ICoverage baseline) Returns a set of edges in this coverage that don't exist in baselinecopy()org.eclipse.collections.api.list.primitive.IntListReturns a collection of branches that are covered.intReturns the number of edges covered.intReturns a hash code of the list of edges that have been covered at least once.intsize()Returns the size of the coverage map.booleanupdateBits(ICoverage that) Updates this coverage with bits from the parameter.
-
Method Details
-
size
int size()Returns the size of the coverage map.- Returns:
- the size of the coverage map
-
getNonZeroCount
int getNonZeroCount()Returns the number of edges covered.- Returns:
- the number of edges with non-zero counts
-
getCovered
org.eclipse.collections.api.list.primitive.IntList getCovered()Returns a collection of branches that are covered.- Returns:
- a collection of keys that are covered
-
computeNewCoverage
Returns a set of edges in this coverage that don't exist in baseline- Parameters:
baseline- the baseline coverage- Returns:
- the set of edges that do not exist in
baseline
-
clear
void clear()Clears the coverage map. -
updateBits
Updates this coverage with bits from the parameter.- Parameters:
that- the run coverage whose bits to OR- Returns:
trueiffthatis not a subset ofthis, causingthisto change.
-
nonZeroHashCode
int nonZeroHashCode()Returns a hash code of the list of edges that have been covered at least once.- Returns:
- a hash of non-zero entries
-
getCounter
Counter getCounter() -
copy
-