| Child |
Name |
Tests |
Failures |
Skipped |
Duration |
Success rate |
| Candidate policies share the exact same within-group intersection rule |
candidatePoliciesShareUnderStemming() |
1 |
0 |
0 |
0.007s |
100% |
| Disjoint sets and cross-group intersections produce exact candidate-aware counts |
disjointAndCollidingSets() |
1 |
0 |
0 |
0.001s |
100% |
| Candidate intersections repair primary under-stemming and count each pair once |
intersectionsRepairUnderStemming() |
1 |
0 |
0 |
0.002s |
100% |
| Invalid candidate collections fail with precise contextual diagnostics |
invalidCandidateOutput() |
1 |
0 |
0 |
0.006s |
100% |
| ANY_CANDIDATE and ALL_CANDIDATES apply their distinct over-stemming relations |
policySpecificOverStemming() |
1 |
0 |
0 |
0.001s |
100% |
| Optimized candidate metrics equal a deterministic randomized brute-force oracle |
randomizedOracleAgreement() |
1 |
0 |
0 |
0.062s |
100% |