| prettySort(Collection) |  | 0% | | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
| fixedTypeSet(boolean, Class[]) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| nativeTypeSet(boolean, Class[]) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| greedyTypeSet(boolean, Class[]) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| treeTypeSet(boolean, Class[]) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| fixedTypeSet(boolean, Collection) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| nativeTypeSet(boolean, Collection) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| greedyTypeSet(boolean, Collection) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| treeTypeSet(boolean, Collection) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| fixedTypeSet(Collection) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| fixedTypeSet(Class[]) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| nativeTypeSet(Collection) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| nativeTypeSet(Class[]) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| greedyTypeSet(Collection) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| greedyTypeSet(Class[]) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| treeTypeSet(Collection) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| treeTypeSet(Class[]) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$prettySort$4(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$treeTypeSet$3(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$greedyTypeSet$2(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$nativeTypeSet$1(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$fixedTypeSet$0(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |