| Test |
Method name |
Duration |
Result |
| Count equals 2^n for a few n |
countMatchesTwoToTheN() |
0s |
passed |
| Returned arrays are defensive copies (immutability) and fresh instances |
defensiveCopiesAndFreshInstances() |
0s |
passed |
| Edge cases: n=0 yields one empty subset; n=1 yields two subsets |
edgeCases() |
0s |
passed |
| Invalid arguments throw IllegalArgumentException |
invalidArgs() |
0.001s |
passed |
| Iterator respects hasNext()/next() and throws on exhaustion |
iteratorContract() |
0.001s |
passed |
| No duplicates; total equals 2^n (n=5) |
noDuplicates_n5() |
0s |
passed |
| Size-then-lexicographic order for n=3 |
sizeThenLexOrder_n3() |
0s |
passed |