Is there an "AllCombinations" convenience method in Verify?

[emilybache]

Hi,

I've previously used this "test all combinations" feature in Approvals.Java

https://gist.github.com/emilybache/0a3386840bf4c495ddfc0ad35e038575

and in python approvals

https://gist.github.com/emilybache/93ff869d0946de862a6633d58dccd15f

The idea is that with only a very small amount of test code you generate a lot of input combinations and verify them all.

Is there an equivalent in Verify? I couldn't find it if so.

Regards,
Emily Bache

[SimonCropp]

currently no. although i am happy to consider a pull request that adds that feature

[emilybache]

Thanks for the prompt and accurate answer.

[emilybache]

In case anyone is interested this is a solution that uses Verify to solve GildedRose:

https://gist.github.com/emilybache/b7aef33a8fe449d47c0a194a9451bd3c

[SimonCropp]

@emilybache i released a beta with a new experimental api https://github.com/VerifyTests/Verify/blob/main/docs/combinations.md

thoughts?

i will flesh out the docs shortly

[SimonCropp]

@emilybache where are the docs for verifyBestCoveringPairs ?

[emilybache]

Good point! There probably isn't any. It's basically applying All-Pairs testing to cut down the number of combinations.

[SimonCropp]

i pushed a stable V27.1.0
updated the docs https://github.com/VerifyTests/Verify/blob/main/docs/combinations.md

[SimonCropp]

i doubt i will get around to implementing BestCoveringPairs

[emilybache]

That looks brilliant! You've spent a lot of effort on making the output look readable. Thanks for doing this.