| currentUnchanged() |  | 0% | | 0% | 3 | 3 | 9 | 9 | 1 | 1 |
| lambda$getStaticLiteralHashCode$9(Value) | | 0% | | n/a | 1 | 1 | 9 | 9 | 1 | 1 |
| getCurrentHashCode(Value) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| getPreviousHashCode(Value) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| getLowestNonTrivialPartition() | | 0% | | n/a | 1 | 1 | 8 | 8 | 1 | 1 |
| GraphComparisons.Partitioning(Set) | | 0% | | n/a | 1 | 1 | 6 | 6 | 1 | 1 |
| GraphComparisons.Partitioning(Map, Map) | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| nextIteration() | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| getMappingSize() | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| getCurrentHashCodeMapping() | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| lambda$getStaticLiteralHashCode$7(String) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| isFine() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| isFullyDistinguished() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| lambda$getLowestNonTrivialPartition$4(Collection) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| lambda$isFine$3(Collection) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| setCurrentHashCode(BNode, HashCode) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| getStaticLiteralHashCode(Literal) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$getMappingSize$5(HashCode) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$new$0(BNode) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$getPreviousHashCode$2(Value) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$getCurrentHashCode$1(Value) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$getStaticLiteralHashCode$8(List, HashCode) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getNodes() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getCurrentNodeMapping() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$getMappingSize$6(BigInteger, BigInteger) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getStaticValueMapping() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |