| add(Object) |   | 43% | | 50% | 1 | 2 | 2 | 4 | 0 | 1 |
| remove(Object) | | 43% | | 50% | 1 | 2 | 2 | 4 | 0 | 1 |
| contains(Object) | | 37% | | 50% | 1 | 2 | 2 | 4 | 0 | 1 |
| equals(Object) | | 56% | | 33% | 6 | 7 | 5 | 12 | 0 | 1 |
| _appendRecursivelyUpTo(ValueSetImpl.Node, Class, ArrayItemAccess, StringBuilder, int) | | 95% | | 93% | 1 | 9 | 1 | 17 | 0 | 1 |
| _findValidIndexFor(ArrayItemAccess, Object, int, Object) | | 95% | | 62% | 3 | 5 | 1 | 9 | 0 | 1 |
| retainAll(Set) | | 93% | | 87% | 1 | 5 | 1 | 10 | 0 | 1 |
| removeAll(Stream) | | 87% | | 50% | 1 | 2 | 1 | 5 | 0 | 1 |
| isLinked() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$removeAll$4(ValueSet, ValueSet) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$addAll$2(ValueSetImpl, ValueSetImpl) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| _with(ValueSetImpl.Node, Class, ArrayItemAccess, Object, int) | | 100% | | 92% | 1 | 8 | 0 | 27 | 0 | 1 |
| _without(ValueSetImpl.Node, Class, ArrayItemAccess, Object, int) | | 100% | | 100% | 0 | 10 | 0 | 26 | 0 | 1 |
| _recursiveEquals(ValueSetImpl.Node, ValueSetImpl.Node, Class) | | 100% | | 85% | 3 | 11 | 0 | 17 | 0 | 1 |
| _toTuple(ValueSetImpl.Node, Class) | | 100% | | 100% | 0 | 4 | 0 | 8 | 0 | 1 |
| _recursiveHashCode(ValueSetImpl.Node) | | 100% | | 100% | 0 | 4 | 0 | 7 | 0 | 1 |
| toString() | | 100% | | 100% | 0 | 2 | 0 | 9 | 0 | 1 |
| _findValidIndexFor(ValueSetImpl.Node, ArrayItemAccess, Object, int) | | 100% | | 100% | 0 | 5 | 0 | 11 | 0 | 1 |
| _contains(ValueSetImpl.Node, ArrayItemAccess, Object, int) | | 100% | | 100% | 0 | 4 | 0 | 11 | 0 | 1 |
| _fillNodeArrays(int, Class, Object) | | 100% | | 100% | 0 | 2 | 0 | 8 | 0 | 1 |
| _exhaustiveEquals(ValueSetImpl, ValueSetImpl) | | 100% | | 100% | 0 | 4 | 0 | 8 | 0 | 1 |
| _sumBranchSizes(ValueSetImpl.Node[]) | | 100% | | 100% | 0 | 3 | 0 | 5 | 0 | 1 |
| _withBranchAt(ValueSetImpl.Node, Class, int, ValueSetImpl.Node) | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| hashCode() | | 100% | | 100% | 0 | 2 | 0 | 6 | 0 | 1 |
| ValueSetImpl(Class, ArrayItemAccess, ValueSetImpl.Node) | | 100% | | n/a | 0 | 1 | 0 | 6 | 0 | 1 |
| _computeBranchIndex(ValueSetImpl.Node, int, int) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| ValueSetImpl(int, Class, Object, int[], ValueSetImpl.Node[], boolean) | | 100% | | n/a | 0 | 1 | 0 | 4 | 0 | 1 |
| _withNewRoot(ValueSetImpl.Node) | | 100% | | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
| _isEqual(ValueSetImpl.Node, ArrayItemAccess, Object, int, Object, int) | | 100% | | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
| ValueSetImpl(Class) | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| addAll(Stream) | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| iterator() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| spliterator() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| _maxEntriesForThisNode(ValueSetImpl.Node) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| lambda$_toTuple$0(List, Object) | | 100% | | 50% | 1 | 2 | 0 | 3 | 0 | 1 |
| toTuple() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| _minBranchingPerNode(ValueSetImpl.Node) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| clear() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| lambda$addAll$1(ValueSetImpl, Object) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| size() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| lambda$removeAll$3(ValueSet, Object) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| static {...} | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| type() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| isSorted() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |