Source file "com/carrotsearch/hppc/BitSet.java" was not found during generation of report.
| Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Lines | Missed | Methods |
| Total | 1,460 of 1,460 | 0% | 124 of 124 | 0% | 113 | 113 | 274 | 274 | 51 | 51 |
| clear(long, long) | | 0% | | 0% | 5 | 5 | 17 | 17 | 1 | 1 |
| clear(int, int) | | 0% | | 0% | 5 | 5 | 17 | 17 | 1 | 1 |
| flip(long, long) | | 0% | | 0% | 4 | 4 | 13 | 13 | 1 | 1 |
| equals(Object) | | 0% | | 0% | 8 | 8 | 12 | 12 | 1 | 1 |
| set(long, long) | | 0% | | 0% | 3 | 3 | 12 | 12 | 1 | 1 |
| nextSetBit(long) | | 0% | | 0% | 5 | 5 | 10 | 10 | 1 | 1 |
| nextSetBit(int) | | 0% | | 0% | 5 | 5 | 10 | 10 | 1 | 1 |
| union(BitSet) | | 0% | | 0% | 3 | 3 | 11 | 11 | 1 | 1 |
| xor(BitSet) | | 0% | | 0% | 3 | 3 | 11 | 11 | 1 | 1 |
| unionCount(BitSet, BitSet) | | 0% | | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
| xorCount(BitSet, BitSet) | | 0% | | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
| toString() | | 0% | | 0% | 3 | 3 | 11 | 11 | 1 | 1 |
| intersect(BitSet) | | 0% | | 0% | 3 | 3 | 10 | 10 | 1 | 1 |
| getAndSet(long) | | 0% | | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
| getAndSet(int) | | 0% | | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
| flipAndGet(long) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| get(long) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| hashCode() | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| flipAndGet(int) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| get(int) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| andNotCount(BitSet, BitSet) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| clear(long) | | 0% | | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
| intersects(BitSet) | | 0% | | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
| remove(BitSet) | | 0% | | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
| length() | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| set(long) | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| flip(long) | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| trimTrailingZeros() | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| expandingWordNum(long) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| grow(long[], int) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| clone() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| BitSet(long) | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| getNextSize(int) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| intersectionCount(BitSet, BitSet) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| ensureCapacityWords(int) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| BitSet(long[], int) | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| isEmpty() | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| bits2words(long) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| iterator() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| clear() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| capacity() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| cardinality() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| ensureCapacity(long) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| asIntLookupContainer() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| asLongLookupContainer() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| BitSet() | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| newInstance() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| and(BitSet) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| or(BitSet) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| andNot(BitSet) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| size() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 |