Closed evnu closed 3 years ago
I think the input list to generate the tree might just be too large. I added IO.inspect(length(l))
to the tree
generator:
..snip..
.[length: 320076]
.[length: 354481]
.[length: 331755]
.[length: 437763]
.[length: 338493]
.[length: 381151]
.[length: 418301]
.[length: 281827]
@alfert to avoid timeouts, we could keep the list smaller, or pre-sort it (but that kind-of defeats the purpose of the insertions into the binary tree). Another option would be to make the examples more amenable to the insertion by splitting into chunks and sorting within the chunks.
Simply reduced the amount of search steps (1.000 -> 600). Seems to help
PropCheck.Test.TargetTreeTest
sometimes times out on my machine when running repeatedly with the same settings as CI:Error:
Judging from the
.
that are written when usingPROPCHECK_VERBOSE
, test iterations slow down after a few tries. It seems that this depends on the seed used for running the tests. After finding the instance above, I was able to reproduce immediately again by using the seed from the test: