| checkGenerator() |  | 0% | | 0% | 7 | 7 | 60 | 60 | 1 | 1 |
| generate(SetOpsCornerCasesTest.State, int) | | 0% | | 0% | 16 | 16 | 38 | 38 | 1 | 1 |
| checkSeedHash() | | 0% | | n/a | 1 | 1 | 51 | 51 | 1 | 1 |
| cornerCaseChecksMemory(SetOpsCornerCasesTest.State, SetOpsCornerCasesTest.State, int) | | 0% | | n/a | 1 | 1 | 25 | 25 | 1 | 1 |
| compareSetOpsRandom(int, int, int, int, int) | | 0% | | 0% | 3 | 3 | 20 | 20 | 1 | 1 |
| cornerCaseChecks(SetOpsCornerCasesTest.State, SetOpsCornerCasesTest.State, int) | | 0% | | n/a | 1 | 1 | 19 | 19 | 1 | 1 |
| checkPwUnionReduceToK() | | 0% | | n/a | 1 | 1 | 17 | 17 | 1 | 1 |
| compareCornerCases() | | 0% | | 0% | 7 | 7 | 8 | 8 | 1 | 1 |
| checkUnionNotOrdered() | | 0% | | n/a | 1 | 1 | 13 | 13 | 1 | 1 |
| checkCornerCase(Sketch, Sketch) | | 0% | | n/a | 1 | 1 | 14 | 14 | 1 | 1 |
| doPwUnion(Sketch, Sketch, int) | | 0% | | 0% | 5 | 5 | 6 | 6 | 1 | 1 |
| checkSetOpsRandom() | | 0% | | 0% | 2 | 2 | 7 | 7 | 1 | 1 |
| doStdStatefulAnotB(Sketch, Sketch, WritableMemory) | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| doStdUnion(Sketch, Sketch, int, WritableMemory) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| doStdIntersection(Sketch, Sketch, WritableMemory) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| doStdPairUnion(Sketch, Sketch, int, WritableMemory) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| doStdPairIntersection(Sketch, Sketch, WritableMemory) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| doStdAnotB(Sketch, Sketch, WritableMemory) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| SetOpsCornerCasesTest() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| doPwIntersection(Sketch, Sketch) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| doPwAnotB(Sketch, Sketch) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| static {...} | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| printlnTest() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| println(String) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |