gencheck-0.1.1: A testing framework inspired by QuickCheck and SmallCheck

Safe HaskellSafe-Infered




extreme :: EnumStratSource

extreme (1,20) = [1,20,10,2,11,9,19,5,15,3,12,6,16,4,14,8,18,7,13,17]|

The first two extreme binary trees will be the ``all left'' and ''all right'' branched trees, which is a good start for testing, but in general extreme indices may or may not map to boundary conditions in a particular structure.

Extreme generators is best used for pulling a small number of cases in conjunction with random testing. It is not an efficient strategy to produce a large number of test cases, and may contain duplicate index entries.

interleave :: [a] -> [a] -> [a]Source