| intersect(Sketch) |  | 0% | | 0% | 17 | 17 | 37 | 37 | 1 | 1 |
| performIntersect(Sketch) | | 0% | | 0% | 12 | 12 | 32 | 32 | 1 | 1 |
| toByteArray() | | 0% | | 0% | 5 | 5 | 20 | 20 | 1 | 1 |
| getResult(boolean, WritableMemory) | | 0% | | 0% | 4 | 4 | 17 | 17 | 1 | 1 |
| moveDataToTgt(long[], int) | | 0% | | 0% | 8 | 8 | 19 | 19 | 1 | 1 |
| moveDataToTgt(Sketch) | | 0% | | 0% | 8 | 8 | 23 | 23 | 1 | 1 |
| heapifyInstance(Memory, long) | | 0% | | 0% | 4 | 4 | 13 | 13 | 1 | 1 |
| IntersectionImpl(WritableMemory, long, boolean, boolean) | | 0% | | 0% | 4 | 4 | 16 | 16 | 1 | 1 |
| wrapInstance(WritableMemory, long, boolean) | | 0% | | 0% | 2 | 2 | 8 | 8 | 1 | 1 |
| initNewDirectInstance(long, WritableMemory) | | 0% | | n/a | 1 | 1 | 10 | 10 | 1 | 1 |
| resetCommon() | | 0% | | 0% | 3 | 3 | 9 | 9 | 1 | 1 |
| getCache() | | 0% | | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
| intersect(Sketch, Sketch, boolean, WritableMemory) | | 0% | | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| hasResult() | | 0% | | 0% | 4 | 4 | 1 | 1 | 1 | 1 |
| hardReset() | | 0% | | 0% | 2 | 2 | 7 | 7 | 1 | 1 |
| resetToEmpty() | | 0% | | 0% | 2 | 2 | 7 | 7 | 1 | 1 |
| initNewHeapInstance(long) | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| isSameResource(Memory) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| isDirect() | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| static {...} | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| hasMemory() | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| reset() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| getRetainedEntries() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| isEmpty() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getSeedHash() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getThetaLong() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |