Source file "com/zaxxer/sparsebits/SparseBitSet.java" was not found during generation of report.
| Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Lines | Missed | Methods |
| Total | 1,971 of 2,602 | 24% | 299 of 384 | 22% | 219 | 249 | 388 | 529 | 44 | 57 |
| setScanner(int, int, SparseBitSet, SparseBitSet.AbstractStrategy) | | 60% | | 37% | 64 | 69 | 31 | 100 | 0 | 1 |
| statistics(String[]) | | 0% | | 0% | 7 | 7 | 34 | 34 | 1 | 1 |
| previousClearBit(int) | | 0% | | 0% | 15 | 15 | 33 | 33 | 1 | 1 |
| nextClearBit(int) | | 0% | | 0% | 13 | 13 | 28 | 28 | 1 | 1 |
| nextSetBit(int) | | 0% | | 0% | 13 | 13 | 24 | 24 | 1 | 1 |
| previousSetBit(int) | | 0% | | 0% | 13 | 13 | 30 | 30 | 1 | 1 |
| readObject(ObjectInputStream) | | 0% | | 0% | 6 | 6 | 24 | 24 | 1 | 1 |
| writeObject(ObjectOutputStream) | | 0% | | 0% | 8 | 8 | 22 | 22 | 1 | 1 |
| throwIndexOutOfBoundsException(int, int) | | 0% | | 0% | 7 | 7 | 10 | 10 | 1 | 1 |
| flip(int) | | 0% | | 0% | 5 | 5 | 14 | 14 | 1 | 1 |
| toString() | | 0% | | 0% | 7 | 7 | 20 | 20 | 1 | 1 |
| clear(int) | | 0% | | 0% | 5 | 5 | 12 | 12 | 1 | 1 |
| equals(Object) | | 0% | | 0% | 4 | 4 | 9 | 9 | 1 | 1 |
| clone() | | 0% | n/a | 1 | 1 | 9 | 9 | 1 | 1 | |
| and(int, boolean) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| andNot(int, boolean) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| or(int, boolean) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| xor(int, boolean) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| and(SparseBitSet) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| get(int, int) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| SparseBitSet(int, int) | | 54% | 50% | 1 | 2 | 1 | 8 | 0 | 1 | |
| intersects(SparseBitSet) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| set(int) | | 85% | | 87% | 1 | 5 | 1 | 14 | 0 | 1 |
| get(int) | | 80% | | 90% | 1 | 6 | 1 | 4 | 0 | 1 |
| set(int, int, boolean) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| andNot(SparseBitSet) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| set(int, boolean) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| intersects(int, int, SparseBitSet) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| and(SparseBitSet, SparseBitSet) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| andNot(SparseBitSet, SparseBitSet) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| or(SparseBitSet) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| or(SparseBitSet, SparseBitSet) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| xor(SparseBitSet) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| xor(SparseBitSet, SparseBitSet) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| resize(int) | | 90% | | 68% | 4 | 9 | 1 | 17 | 0 | 1 |
| and(int, int, SparseBitSet) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| andNot(int, int, SparseBitSet) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| clear(int, int) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| flip(int, int) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| or(int, int, SparseBitSet) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| set(int, int) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| xor(int, int, SparseBitSet) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| cardinality() | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| hashCode() | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| length() | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| size() | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| toStringCompaction(boolean) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| statistics() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| toStringCompaction(int) | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| isEmpty() | | 90% | 50% | 1 | 2 | 0 | 2 | 0 | 1 | |
| static {...} | | 100% | n/a | 0 | 1 | 0 | 11 | 0 | 1 | |
| nullify(int) | | 100% | | 75% | 1 | 3 | 0 | 6 | 0 | 1 |
| constructorHelper() | | 100% | n/a | 0 | 1 | 0 | 4 | 0 | 1 | |
| statisticsUpdate() | | 100% | | 100% | 0 | 2 | 0 | 4 | 0 | 1 |
| SparseBitSet() | | 100% | n/a | 0 | 1 | 0 | 2 | 0 | 1 | |
| SparseBitSet(int) | | 100% | n/a | 0 | 1 | 0 | 2 | 0 | 1 | |
| clear() | 100% | n/a | 0 | 1 | 0 | 2 | 0 | 1 |