How do you test a random algorithm like this? Besides obvious checks like that the returned element must belong to the set. Any deterministic test to check randomness will have a finite probability of failure even if the algorithm is sound.
On Fri, May 6, 2016 at 10:46 AM, Steven G. Johnson <[email protected]> wrote: > Filed https://github.com/JuliaLang/julia/issues/16231 >
