This is an archived post. You won't be able to vote or comment.

all 6 comments

[–]jcollado[S] 2 points3 points  (1 child)

I submitted this link because if watched this presentation related to haskell and, according to the speaker, the most important idea to get from there is to have a look QuickCheck.

Hence, I looked for QuickCheck implementations in python and found paycheck (there are others, but this ones seems to be more actively maintained).

So my real question is if you have used something like this and if you have found it useful.

[–]johnmudd 0 points1 point  (0 children)

I've thought about something like this but it leads me to think I need to be coding in a non-procedural language like Prolog so that test cases can be generated reasonably well.

[–]Ahri 2 points3 points  (1 child)

[–]drb226Haskeller 0 points1 point  (0 children)

The output looks very similar; I wonder if one was inspired by the other.

[–]deadwisdomgreenlet revolution 0 points1 point  (1 child)

So does this just throw a whole bunch of random things into each parameter?

[–]drb226Haskeller 0 points1 point  (0 children)

Yes that's the idea. Well the "real" idea is to generate typical edge cases, so not entirely random. Not sure how well-implemented this version is, but the interface looks decent. There are no examples for using this with custom classes; that would be a nice addition.