!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w x y z { | } ~                                                                                                                                   Safe,ATest if an exception was a ^C;. QuickCheck won't try to shrink an interrupted test case.ZA special exception that makes QuickCheck discard the test case. Normally you should use ==>Z, but if for some reason this isn't possible (e.g. you are deep inside a generator), use  instead. Trustworthy.LThe "standard" QuickCheck random number generator. A wrapper around either  on GHC, or   on other Haskell systems.    SafeQVX6A generator for values of type a.The third-party package  2http://hackage.haskell.org/package/QuickCheck-GenTQuickCheck-GenT* provides a monad transformer version of GenT.dRun the generator on a particular seed. If you just want to get a random value out, consider using &.+Modifies a generator using an integer seed. ?Used to construct generators that depend on the size parameter. For example, 2m, which uses the size parameter as an upper bound on length of lists it generates, can be defined like this: `listOf :: Gen a -> Gen [a] listOf gen = sized $ \n -> do k <- choose (0,n) vectorOf k genYou can also do this using !.!^Generates the size parameter. Used to construct generators that depend on the size parameter. For example, 2m, which uses the size parameter as an upper bound on length of lists it generates, can be defined like this: ^listOf :: Gen a -> Gen [a] listOf gen = do n <- getSize k <- choose (0,n) vectorOf k genYou can also do this using  ."sOverrides the size parameter. Returns a generator which uses the given size instead of the runtime-size parameter.#GAdjust the size parameter, by transforming it with the given function.$8Generates a random element in the given inclusive range.%5Generates a random element over the natural range of a.&yRun a generator. The size passed to the generator is always 30; if you want another size then you should explicitly use ".'Generates some example values.(1Generates some example values and prints them to stdout.)-Generates a value that satisfies a predicate.*9Generates a value for which the given function returns a  !, and then applies the function.+kTries to generate a value that satisfies a predicate. If it fails to do so after enough attempts, returns Nothing.,MRandomly uses one of the given generators. The input list must be non-empty.-lChooses one of the given generators, with a weighted random distribution. The input list must be non-empty..DGenerates one of the given values. The input list must be non-empty./1Generates a random subsequence of the given list.01Generates a random permutation of the given list.1Takes a list of elements of increasing size, and chooses among an initial segment of the list. The size of this initial segment increases with the size parameter. The input list must be non-empty.2UGenerates a list of random length. The maximum length depends on the size parameter.3_Generates a non-empty list of random length. The maximum length depends on the size parameter.4%Generates a list of the given length.5Generates an infinite list. !"#$%&'()*+,-./012345876 !"#$%&'()*+,-./012345SafeQVbn;>Promotes a monadic generator to a generator of monadic values.<&Randomly generates a function of type  a -> aQ, which you can then use to evaluate generators. Mostly useful in implementing ;.= A variant of <q that returns a polymorphic evaluation function. Can be used in a pinch to generate polymorphic (rank-2) values: genSelector :: Gen (a -> a -> a) genSelector = elements [\x y -> x, \x y -> y] data Selector = Selector (forall a. a -> a -> a) genPolySelector :: Gen Selector genPolySelector = do Capture eval <- capture return (Selector (eval genSelector))9:;<=;<=9:9: Trustworthy,7;<=>?FKSTV)>(Used for random generation of functions.AIf you are using a recent GHC, there is a default definition of ? using c, so if your type has a   instance it's enough to say instance CoArbitrary MyTypeYou should only use c/ for data types where equality is structural, i.e. if you can't have two different representations of the same value. An example where it's not safe is sets implemented using binary search trees: the same set can be represented as several different trees. Here you would have to explicitly define &coarbitrary s = coarbitrary (toList s).?$Used to generate a function of type a -> bJ. The first argument is a value, the second a generator. You should use } to perturb the random generator; the goal is that different values for the first argument will lead to different calls to . An example will help: Ginstance CoArbitrary a => CoArbitrary [a] where coarbitrary [] =  0 coarbitrary (x:xs) =  1 . coarbitrary (x,xs)  XProvides the immediate subterms of a term that are of the same type as the term itself.In contrast to  9, this returns the immediate next constructor available. XProvides the immediate subterms of a term that are of the same type as the term itself.HRequires a constructor to be stripped off; this means it skips through M1 wrappers and returns []- on everything that's not `(:*:)` or `(:+:)`.TOnce a `(:*:)` or `(:+:)` constructor has been reached, this function delegates to  7 to return the immediately next constructor available.@Lifting of the F# class to binary type constructors.CLifting of the F" class to unary type constructors.F*Random generation and shrinking of values.QuickCheck provides  Arbitrary instances for most types in baseF, except those which incur extra dependencies. For a wider range of  Arbitrary instances see the  7http://hackage.haskell.org/package/quickcheck-instancesquickcheck-instances package.G)A generator for values of the given type.It is worth spending time thinking about what sort of test data you want - good generators are often the difference between finding bugs and not finding them. You can use (, label and classify( to check the quality of your test data.There is no generic  arbitraryu implementation included because we don't know how to make a high-quality one. If you want one, consider using the  /http://hackage.haskell.org/package/testing-feat testing-feat or  1http://hackage.haskell.org/package/generic-randomgeneric-random packages.The  7http://www.cse.chalmers.se/~rjmh/QuickCheck/manual.htmlQuickCheck manuals goes into detail on how to write good generators. Make sure to look at it, especially if your type is recursive!H[Produces a (possibly) empty list of all the possible immediate shrinks of the given value.The default implementation returns the empty list, so will not try to shrink the value. If your data type has no special invariants, you can enable shrinking by defining  shrink = M', but by customising the behaviour of shrink+ you can often get simpler counterexamples.Most implementations of H" should try at least three things: @Shrink a term to any of its immediate subterms. You can use O to do this.Recursively apply H, to all immediate subterms. You can use N to do this.VType-specific shrinkings such as replacing a constructor by a simpler constructor.JFor example, suppose we have the following implementation of binary trees: .data Tree a = Nil | Branch a (Tree a) (Tree a)We can then define H as follows: shrink Nil = [] shrink (Branch x l r) = -- shrink Branch to Nil [Nil] ++ -- shrink to subterms [l, r] ++ -- recursively shrink subterms [Branch x' l' r' | (x', l', r') <- shrink (x, l, r)]&There are a couple of subtleties here:QuickCheck tries the shrinking candidates in the order they appear in the list, so we put more aggressive shrinking steps (such as replacing the whole tree by NilF) before smaller ones (such as recursively shrinking the subtrees).,It is tempting to write the last line as B[Branch x' l' r' | x' <- shrink x, l' <- shrink l, r' <- shrink r] but this is the  wrong thing(! It will force QuickCheck to shrink x, l and r) in tandem, and shrinking will stop once one! of the three is fully shrunk.~There is a fair bit of boilerplate in the code above. We can avoid it with the help of some generic functions. The function M~ tries shrinking a term to all of its subterms and, failing that, recursively shrinks the subterms. Using it, we can define H as: sshrink x = shrinkToNil x ++ genericShrink x where shrinkToNil Nil = [] shrinkToNil (Branch _ l r) = [Nil]M is a combination of O4, which shrinks a term to any of its subterms, and Nq, which shrinks all subterms of a term. These may be useful if you need a bit more control over shrinking than M gives you.!A final gotcha: we cannot define H as simply H x = Nil:M x as this shrinks Nil to Nil/, and shrinking will go into an infinite loop.1If all this leaves you bewildered, you might try H = M to begin with, after deriving Genericd for your type. However, if your data type has any special invariants, you will need to check that M can't break those invariants.MZShrink a term to any of its immediate subterms, and also recursively shrink all subterms.N*Recursively shrink all immediate subterms.O!All immediate subterms of a term.PIShrink a list of values given a shrinking function for individual values.Q,Apply a binary function to random arguments.R-Apply a ternary function to random arguments.S0Apply a function of arity 4 to random arguments.TGenerates an integral number. The number can be positive or negative and its maximum absolute value depends on the size parameter.UVGenerates a natural number. The number's maximum value depends on the size parameter.VGenerates a fractional number. The number can be positive or negative and its maximum absolute value depends on the size parameter.WvGenerates an integral number. The number is chosen uniformly from the entire range of the type. You may want to use Z instead.XaGenerates an element of a bounded type. The element is chosen from the entire range of the type.Y.Generates an element of a bounded enumeration.ZGenerates an integral number from a bounded domain. The number is chosen from the entire range of the type, but small numbers are generated more often than big numbers. Inspired by demands from Phil Wadler.[5Generates any Unicode character (but not a surrogate)\+Generates a random ASCII character (0-127).](Generates a printable Unicode character.^"Returns no shrinking alternatives._iMap a shrink function to another domain. This is handy if your data type has special invariants, but is almost isomorphic to some other type. shrinkOrderedList :: (Ord a, Arbitrary a) => [a] -> [[a]] shrinkOrderedList = shrinkMap sort id shrinkSet :: (Ord a, Arbitrary a) => Set a -> Set [a] shrinkSet = shrinkMap fromList toList `Non-overloaded version of _.aShrink an integral number.bShrink a fraction.c#Generic CoArbitrary implementation.dQCombine two generator perturbing functions, for example the results of calls to  or ?.eA ?% implementation for integral numbers.fA ?! implementation for real numbers.g? helper for lazy people :-).hA ? implementation for enums.i#Generates a list of a given length.jGenerates an ordered list.kGenerates an infinite list.n Generates  with non-empty non-negative  versionBranch , and empty  versionTags.>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijk/FGH>??CDEIJ@ABKLQRSTUWZVXY[\]MONc^P_`abefghdijk >??  @ABCDEFGHSafe!"#$%&'()*+,-./012012-./*+,'()$%&!"#!"#$%&'()*+,-./012 Trustworthy1>?KQPrintableStringU: generates a printable unicode String. The string will not contain surrogate pairs.T UnicodeStringK: generates a unicode String. The string will not contain surrogate pairs.W ASCIIString: generates an ASCII string.] Shrinking _ x2: allows for maintaining a state during shrinking._ Smart _ x): tries a different order when shrinking.a Shrink2 x<: allows 2 shrinking steps at the same time when shrinking xdSmall x: generates values of x, drawn from a small range. The opposite of g.gLarge x#: by default, QuickCheck generates s drawn from a small range.  Large Int6 gives you values drawn from the entire range instead.j NonNegative x: guarantees that x >= 0.m NonZero x: guarantees that x /= 0.p Positive x: guarantees that x > 0.sInfiniteList xs _: guarantees that xs is an infinite list. When a counterexample is found, only prints the prefix of xs that was used by the program.%Here is a contrived example property: pprop_take_10 :: InfiniteList Char -> Bool prop_take_10 (InfiniteList xs _) = or [ x == 'a' | x <- take 10 xs ]:In the following counterexample, the list must start with  "bbbbbbbbbb"9 but the remaining (infinite) part can contain anything:quickCheck prop_take_106*** Failed! Falsifiable (after 1 test and 14 shrinks):"bbbbbbbbbb" ++ ...w NonEmpty xs": guarantees that xs is non-empty.z Ordered xs : guarantees that xs is ordered.}Fixed x: as x, but will not be shrunk.Blind x): as x, but x does not have to be in the  class.2QRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~2}~z{|wxystuvpqrmnojklghidef_`abc]^Z[\WXYTUVQRSQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~Safe %&',7<FSTd4Generation of random shrinkable, showable functions."To generate random values of type  a b, you must have an instance  a. See also , and  with GHC >= 7.8. The class  Function a> is used for random generation of showable functions of type a -> b.&There is a default implementation for \, which you can use if your type has structural equality. Otherwise, you can normally use  or ./The type of possibly partial concrete functions)A modifier for testing ternary functions.(A modifier for testing binary functions. prop_zipWith :: Fun (Int, Bool) Char -> [Int] -> [Bool] -> Bool prop_zipWith (Fn2 f) xs ys = zipWith f xs ys == [ f x y | (x, y) <- zip xs ys]!A modifier for testing functions. rprop :: Fun String Integer -> Bool prop (Fn f) = f "banana" == f "monkey" || f "banana" == f "elephant" Provides a  instance for types with  and C. Use only for small types (i.e. not integers): creates the list ['minBound'..'maxBound']! Provides a  instance for types with . Provides a  instance for types with  . Provides a  instance for types with  and !.The basic building block for  instances. Provides a < instance by mapping to and from a type that already has a  instance."Generic  implementation. Alias to .!Extracts the value of a function., is the pattern equivalent of this function. prop :: Fun String Integer -> Bool prop f = applyFun f "banana" == applyFun f "monkey" || applyFun f "banana" == applyFun f "elephant"(Extracts the value of a binary function., is the pattern equivalent of this function. prop_zipWith :: Fun (Int, Bool) Char -> [Int] -> [Bool] -> Bool prop_zipWith f xs ys = zipWith (applyFun2 f) xs ys == [ applyFun2 f x y | (x, y) <- zip xs ys]*Extracts the value of a ternary function. - is the pattern equivalent of this function.#$%&'()*+,- Safe3456789:;<=>?@ABCD456789:;<=>?@A3DBC3.45 Safe"PFxState represents QuickCheck's internal state while testing a property. The state is made visible to callback functions.Hthe current terminalI)maximum number of successful tests neededJ5maximum number of discarded tests per successful testK.how to compute the size of test cases from  tests and discarded testsL(How many shrinks to try before giving upM/the current number of tests that have succeededN%the current number of discarded testsO<the number of discarded tests since the last successful testP(all labels that have been defined so farQ*all labels that have been collected so farR-indicates if the property is expected to failSthe current random seedT+number of successful shrinking steps so farUAnumber of failed shrinking steps since the last successful shrinkV&total number of failed shrinking stepsFGVUTSRQONMLKJIHPFGHIJKLMNOPQRSTUVFGHIJKLMNOPQRSTUV Safe1v6WThe result of a single test.Y*result of the test case; Nothing = discardZ5indicates what the expected result of the property is[$a message indicating what went wrong\the exception thrown, if any](if True, the test should not be repeated^stop after this many tests_ all labels used by this property`'the collected labels for this test casea the callbacks for this test casebthe generated test casedAffected by the  combinatoreNot affected by the  combinatorfDifferent kinds of callbacksgCalled just after a testh'Called with the final failing test-caseoIf a property returns oO, the current test case is discarded, the same as if a precondition was false.q|The class of properties, i.e., types which QuickCheck knows how to test. Typically a property will be a function returning / or s.NIf a property does no quantification, i.e. has no parameters and doesn't use U, it will only be tested once. This may not be what you want if your property is an IO Bool+. You can change this behaviour using the  combinator.r Convert the thing to a property.sThe type of properties.vDo I/O inside a property.wDo I/O inside a property.?Warning: any random values generated inside of the argument to  ioProperty] will not currently be shrunk. For best results, generate all random values before calling  ioProperty.{ Execute the IORose> bits of a rose tree, returning a tree constructed by MkRose.|aApply a function to the outermost MkRose constructor of a rose tree. The function must be total!})Wrap a rose tree in an exception handler.~:Wrap all the Results in a rose tree in exception handlers.2Changes the maximum test case size for a property.Shrinks the argument to a property if it fails. Shrinking is done automatically for most types. This function is only needed when you want to override the default behavior.-Disables shrinking for a property altogether.Adds a callbackBAdds the given string to the counterexample if the property fails.BAdds the given string to the counterexample if the property fails. Performs an 0- action after the last failure of a property. Performs an 0 action every time a property fails. Thus, if shrinking is done, this can be used to keep track of the failures along the way.ePrints out the generated testcase every time the property is tested. Only variables quantified over inside the  are printed.dIndicates that a property is supposed to fail. QuickCheck will report an error if it does not fail.FModifies a property so that it only will be tested once. Opposite of .GModifies a property so that it will be tested repeatedly. Opposite of .4Configures how many times a property will be tested. For example, "quickCheck (withMaxSuccess 1000 p) will test p up to 1000 times.SAttaches a label to a property. This is used for reporting test case distribution. For example: prop_reverse_reverse :: [Int] -> Property prop_reverse_reverse xs = label ("length of input is " ++ show (length xs)) $ reverse (reverse xs) === xsquickCheck prop_reverse_reverse+++ OK, passed 100 tests:7% length of input is 76% length of input is 35% length of input is 44% length of input is 6...SAttaches a label to a property. This is used for reporting test case distribution. collect x = label (show x) For example: {prop_reverse_reverse :: [Int] -> Property prop_reverse_reverse xs = collect (length xs) $ reverse (reverse xs) === xsquickCheck prop_reverse_reverse+++ OK, passed 100 tests:7% 76% 35% 44% 6...6Records how many test cases satisfy a given condition. For example: prop_sorted_sort :: [Int] -> Property prop_sorted_sort xs = sorted xs ==> classify (length xs > 1) "non-trivial" $ sort xs === xsquickCheck prop_sorted_sort++++ OK, passed 100 tests (22% non-trivial).-Checks that at least the given proportion of  successfulv test cases belong to the given class. Discarded tests (i.e. ones with a false precondition) do not affect coverage. For example: prop_sorted_sort :: [Int] -> Property prop_sorted_sort xs = sorted xs ==> cover (length xs > 1) 50 "non-trivial" $ sort xs === xsquickCheck prop_sorted_sortJ*** Insufficient coverage after 100 tests (only 24% non-trivial, not 50%).SImplication for properties: The resulting property holds if the first argument is 1M (in which case the test case is discarded), or if the given property holds.]Considers a property failed if it does not complete within the given number of microseconds.QExplicit universal quantification: uses an explicitly given test case generator.Like :, but tries to shrink the argument for failing test cases.Nondeterministic choice: p1  p2 picks randomly one of p1 and p2J to test. If you test the property 100 times it makes 100 random choices. Conjunction: p1  p2 passes if both p1 and p2 pass.+Take the conjunction of several properties. Disjunction: p1  p2 passes unless p1 and p2 simultaneously fail.+Take the disjunction of several properties.Like 2,, but prints a counterexample when it fails.AChecks that a value is total, i.e., doesn't crash when evaluated.H-like function.The original argumentTrue% if the test case should be labelled.Label.True' if the test case belongs to the class..The required percentage (0-100) of test cases.Label for the test case class.PWXba^]Y`\[_Zcedfhgikjlmnopqrstuvwxyz{|}~[stuqropvwxlmnijkyz{|}~fghcdeWXYZ[\]^_`abW XYZ[\]^_`abcdefghijklmnopqrstu01114 Safe\"!Result represents the test resultA successful test runGiven upA failed test run*A property that should have failed did notThe tests passed but a use of  had insufficient coverageNumber of tests performed8Labels and frequencies found during all successful testsPrinted output.Number of successful shrinking steps performed0Number of unsuccessful shrinking steps performedMNumber of unsuccessful shrinking steps performed since last successful shrinkWhat seed was usedWhat was the test sizeWhy did the property fail(The exception the property threw, if any(The test case which provoked the failure1Args specifies arguments to the QuickCheck driverShould we replay a previous test? Note: saving a seed from one version of QuickCheck and replaying it in another is not supported. If you want to store a test case permanently you should save the test case itself.Maximum number of successful tests before succeeding. Testing stops at the first failure. If all tests are passing and you want to run more tests, increase this number.FMaximum number of discarded tests per successful test before giving up&Size to use for the biggest test casesWhether to print anything[Maximum number of shrinks to before giving up. Setting this to zero turns shrinking off.*Check if the test run result was a successThe default test arguments+Tests a property and prints the results to stdout.lBy default up to 100 tests are performed, which may not be enough to find all bugs. To run more tests, use .BTests a property, using test arguments, and prints the results to stdout.DTests a property, produces a test result, and prints the results to stdout.ZTests a property, using test arguments, produces a test result, and prints the results to stdout.HTests a property and prints the results and all test cases generated to stdout>. This is just a convenience function that means the same as  . ._Tests a property, using test arguments, and prints the results and all test cases generated to stdout5. This is just a convenience function that combines  and .aTests a property, produces a test result, and prints the results and all test cases generated to stdout5. This is just a convenience function that combines  and .wTests a property, using test arguments, produces a test result, and prints the results and all test cases generated to stdout5. This is just a convenience function that combines  and .6B SafeQV eThe property monad is really a monad transformer that can contain monadic computations in the monad m it is parameterized by:m - the m+-computations that may be performed within  PropertyM Elements of  PropertyM m a! may mix property operations and m-computations.:Allows embedding non-monadic properties into monadic ones.Tests preconditions. Unlike p this does not cause the property to fail, rather it discards them just like using the implication combinator .This allows representing the )https://en.wikipedia.org/wiki/Hoare_logic Hoare triple  {p} x ! e{q}as pre p x <- run e assert q GThe lifting operation of the property monad. Allows embedding monadic/0-actions in properties: Hlog :: Int -> IO () prop_foo n = monadicIO $ do run (log n) -- ... 8Quantification in a monadic property, fits better with  do-notation than .The Shttps://en.wikipedia.org/wiki/Predicate_transformer_semantics#Weakest_preconditionsweakest precondition  wp(x ! e, p)can be expressed as in code as wp e (\x -> p).9An alternative to quantification a monadic properties to , with a notation similar to ./Allows making observations about the test data:  monitor ( e) &collects the distribution of value of e.  monitor ( "Failure!") Adds  "Failure!" to the counterexamples.Runs the property monad for 0-computations. >prop_cat msg = monadicIO $ do (exitCode, stdout, _) <- run ( "cat" [] msg) pre (( == exitCode) assert (stdout == msg) quickCheck prop_cat+++ OK, passed 100 tests.Runs the property monad for 3-computations. A-- Your mutable sorting algorithm here sortST :: Ord a => [a] -> 3 s (MVector s a) sortST =  .  . 4 prop_sortST xs = monadicST $ do sorted <- run ( =<< sortST xs) assert ( sorted == sort xs) quickCheck prop_sortST+++ OK, passed 100 tests. TrustworthyQV}>Test a polymorphic property, defaulting all type variables to 4. Invoke as $( 'prop), where prop+ is a property. Note that just evaluating  propM in GHCi will seem to work, but will silently default all type variables to ()!$( 'prop) means the same as  $( 'prop)-. If you want to supply custom arguments to , you will have to combine  and  yourself.If you want to use Z in the same file where you defined the property, the same scoping problems pop up as in : see the note there about  return [].>Test a polymorphic property, defaulting all type variables to 45. This is just a convenience function that combines  and .If you want to use Z in the same file where you defined the property, the same scoping problems pop up as in : see the note there about  return [].GMonomorphise an arbitrary property by defaulting all type variables to 4.For example, if f has type 5 a => [a] -> [a] then $( 'f) has type [4] -> [4].If you want to use Z in the same file where you defined the property, the same scoping problems pop up as in : see the note there about  return [].;Test all properties in the current module, using a custom $ function. The same caveats as with  apply.$ has type (s -> 0 ) -> 0 /. An example invocation is $  , which does the same thing as $.$ has the same issue with scoping as : see the note there about  return [].*List all properties in the current module.$ has type [(6, s)].$ has the same issue with scoping as : see the note there about  return [].UTest all properties in the current module. The name of the property must begin with prop_/. Polymorphic properties will be defaulted to 4 . Returns 7 if all tests succeeded, 1 otherwise.To use 5, add a definition to your module along the lines of #return [] runTests = $quickCheckAlland then execute runTests.Note: the bizarre  return []C in the example above is needed on GHC 7.8 and later; without it, G will not be able to find any of the properties. For the curious, the  return [] is a Template Haskell splice that makes GHC insert the empty list of declarations at that point in the program; GHC typechecks everything before the  return []Q before it starts on the rest of the module, which means that the later call to 1 can see everything that was defined before the  return []. Yikes!^Test all properties in the current module. This is just a convenience function that combines  and .$ has the same issue with scoping as : see the note there about  return [].Safed !"#$&'()*+,-./012345>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijkQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~opqrsw$,-.1 !"#)*+23450/ijk&('FGH>??CDEIJ@ABKLQRSTUVZWXY[\]cMON^P_`abefghd}~z{|wxystuvpqrmnojklghidef_`abc]^Z[\WXYTUVQRSsqrwop8 !"##$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789::;<<=>>?@@ABBCDDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcddeffghhijklmmnnoopqqrsstuuvwwxyyz{{|}~      !"#$%&'()*+,-./012345 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a S b c d e f g h i j k l m n o p q q r s t u v w x y z { | } ~                                                     Z       S       ^ _                                             *                           ! "# "$ %& %' ()*++,-./01234 56789: ;<=>?9@  ABC&QuickCheck-2.11-673Flpi8GZRAagIhD6nMBITest.QuickCheck.ExceptionTest.QuickCheck.RandomTest.QuickCheck.GenTest.QuickCheck.Gen.UnsafeTest.QuickCheck.ArbitraryTest.QuickCheck.PolyTest.QuickCheck.ModifiersTest.QuickCheck.FunctionTest.QuickCheck.TextTest.QuickCheck.StateTest.QuickCheck.PropertyTest.QuickCheck.TestTest.QuickCheck.MonadicTest.QuickCheck.AllSystem.ProcessreadProcessWithExitCode System.Exit ExitSuccess Data.VectorthawfromList Data.ListsortfreezetoListTest.QuickCheck AnException tryEvaluate tryEvaluateIOevaluate isInterruptdiscard isDiscardfinallyQCGen newTheGenbitsmaskdoneBitchipchopstopmkTheGennewQCGenmkQCGen bigNatVariant natVariant variantTheGen boolVariant variantQCGen$fRandomGenQCGen $fReadQCGen $fShowQCGenGenMkGenunGenvariantsizedgetSizeresizescalechoose chooseAnygeneratesample'samplesuchThat suchThatMap suchThatMaybeoneof frequencyelements sublistOfshufflegrowingElementslistOflistOf1vectorOfinfiniteListOf $fMonadGen$fApplicativeGen $fFunctorGenCapturepromotedelaycapture CoArbitrary coarbitrary Arbitrary2liftArbitrary2 liftShrink2 Arbitrary1 liftArbitrary liftShrink Arbitrary arbitraryshrink arbitrary1shrink1 arbitrary2shrink2 genericShrinkrecursivelyShrinksubterms shrinkListapplyArbitrary2applyArbitrary3applyArbitrary4arbitrarySizedIntegralarbitrarySizedNaturalarbitrarySizedFractionalarbitraryBoundedIntegralarbitraryBoundedRandomarbitraryBoundedEnumarbitrarySizedBoundedIntegralarbitraryUnicodeChararbitraryASCIIChararbitraryPrintableChar shrinkNothing shrinkMap shrinkMapByshrinkIntegralshrinkRealFracgenericCoarbitrary><coarbitraryIntegralcoarbitraryRealcoarbitraryShowcoarbitraryEnumvector orderedList infiniteList$fArbitraryExitCode$fArbitraryQCGen$fArbitraryVersion$fArbitraryAlt$fArbitraryLast$fArbitraryFirst$fArbitraryProduct$fArbitrarySum$fArbitraryAny$fArbitraryAll$fArbitraryDual$fArbitraryWrappedArrow$fArbitraryWrappedMonad$fArbitraryConst$fArbitraryConstant$fArbitraryIdentity$fArbitraryZipList$fArbitrarySeq$fArbitraryIntMap$fArbitraryIntSet$fArbitraryMap$fArbitrarySet$fArbitraryCDouble$fArbitraryCFloat$fArbitraryCUIntMax$fArbitraryCIntMax$fArbitraryCUIntPtr$fArbitraryCIntPtr$fArbitraryCULLong$fArbitraryCLLong$fArbitraryCSigAtomic$fArbitraryCWchar$fArbitraryCSize$fArbitraryCPtrdiff$fArbitraryCULong$fArbitraryCLong$fArbitraryCUInt$fArbitraryCInt$fArbitraryCUShort$fArbitraryCShort$fArbitraryCUChar$fArbitraryCSChar$fArbitraryCChar$fArbitraryDouble$fArbitraryFloat$fArbitraryChar$fArbitraryWord64$fArbitraryWord32$fArbitraryWord16$fArbitraryWord8$fArbitraryWord$fArbitraryInt64$fArbitraryInt32$fArbitraryInt16$fArbitraryInt8$fArbitraryInt$fArbitraryInteger$fArbitrary(,,,,,,,,,)$fArbitrary(,,,,,,,,)$fArbitrary(,,,,,,,)$fArbitrary(,,,,,,)$fArbitrary(,,,,,)$fArbitrary(,,,,)$fArbitrary(,,,)$fArbitrary(,,)$fArbitrary(,)$fArbitraryFixed$fArbitraryComplex$fArbitraryRatio $fArbitrary[]$fArbitraryEither$fArbitraryMaybe$fArbitraryOrdering$fArbitraryBool $fArbitrary()$fArbitraryCompose$fArbitrary1Compose$fArbitraryProduct0$fArbitrary1Product$fArbitrary1Identity$fArbitrary1ZipList$fArbitrary1Seq$fArbitrary1IntMap$fArbitrary1Map$fArbitrary1[]$fArbitrary1Maybe$fArbitrary1Const$fArbitrary2Const$fArbitrary1Constant$fArbitrary2Constant$fArbitrary1(,)$fArbitrary2(,)$fArbitrary1Either$fArbitrary2Either$fRecursivelyShrinkkV1$fRecursivelyShrinkkU1$fRecursivelyShrinkkK1$fRecursivelyShrinkkM1$fRecursivelyShrinkk:+:$fRecursivelyShrinkk:*:$fGSubtermsK1b$fGSubtermsM1a$fGSubtermsU1a$fGSubtermsV1a$fGSubtermsInclK1b$fGSubtermsInclK1a$fGSubtermsInclM1a$fGSubtermsIncl:+:a$fGSubtermsIncl:*:a$fGSubtermsInclU1a$fGSubtermsInclV1a$fGSubterms:+:a$fGSubterms:*:a$fArbitraryBounds$fIntegralBounds$fBoundedBounds$fArbitraryCSUSeconds$fArbitraryCUSeconds$fArbitraryCTime$fArbitraryCClock$fGCoArbitrarykM1$fGCoArbitraryk:+:$fGCoArbitraryk:*:$fGCoArbitrarykU1$fCoArbitraryVersion$fCoArbitraryAlt$fCoArbitraryLast$fCoArbitraryFirst$fCoArbitraryProduct$fCoArbitrarySum$fCoArbitraryAny$fCoArbitraryAll$fCoArbitraryEndo$fCoArbitraryDual$fCoArbitraryConst$fCoArbitraryConstant$fCoArbitraryIdentity$fCoArbitraryZipList$fCoArbitrarySeq$fCoArbitraryIntMap$fCoArbitraryIntSet$fCoArbitraryMap$fCoArbitrarySet$fCoArbitraryDouble$fCoArbitraryFloat$fCoArbitraryChar$fCoArbitraryWord64$fCoArbitraryWord32$fCoArbitraryWord16$fCoArbitraryWord8$fCoArbitraryWord$fCoArbitraryInt64$fCoArbitraryInt32$fCoArbitraryInt16$fCoArbitraryInt8$fCoArbitraryInt$fCoArbitraryInteger$fCoArbitrary(,,,,)$fCoArbitrary(,,,)$fCoArbitrary(,,)$fCoArbitrary(,)$fCoArbitraryComplex$fCoArbitraryFixed$fCoArbitraryRatio$fCoArbitrary[]$fCoArbitraryEither$fCoArbitraryMaybe$fCoArbitraryOrdering$fCoArbitraryBool$fCoArbitrary()$fCoArbitrary(->)$fGCoArbitrarykK1$fArbitraryEndo$fArbitrary(->)$fArbitrary1(->) $fEqBounds $fOrdBounds $fNumBounds $fEnumBounds $fRealBounds $fShowBoundsOrdCunOrdCOrdBunOrdBOrdAunOrdACunCBunBAunA$fCoArbitraryA $fArbitraryA$fShowA$fCoArbitraryB $fArbitraryB$fShowB$fCoArbitraryC $fArbitraryC$fShowC$fCoArbitraryOrdA$fArbitraryOrdA $fShowOrdA $fNumOrdA$fCoArbitraryOrdB$fArbitraryOrdB $fShowOrdB $fNumOrdB$fCoArbitraryOrdC$fArbitraryOrdC $fShowOrdC $fNumOrdC$fEqA$fEqB$fEqC$fEqOrdA $fOrdOrdA$fEqOrdB $fOrdOrdB$fEqOrdC $fOrdOrdCPrintableStringgetPrintableString UnicodeStringgetUnicodeString ASCIIStringgetASCIIString ShrinkState shrinkInit shrinkState ShrinkingSmartShrink2 getShrink2SmallgetSmallLargegetLarge NonNegativegetNonNegativeNonZero getNonZeroPositive getPositive InfiniteListgetInfiniteListinfiniteListInternalData NonEmptyListNonEmpty getNonEmpty OrderedListOrdered getOrderedFixedgetFixedBlindgetBlind$fArbitraryBlind $fShowBlind$fFunctorBlind$fFunctorFixed$fArbitraryOrderedList$fFunctorOrderedList$fArbitraryNonEmptyList$fFunctorNonEmptyList#$fArbitraryInfiniteListInternalData$fArbitraryInfiniteList$fShowInfiniteList$fArbitraryPositive$fFunctorPositive$fArbitraryNonZero$fFunctorNonZero$fArbitraryNonNegative$fFunctorNonNegative$fArbitraryLarge$fFunctorLarge$fArbitrarySmall$fFunctorSmall$fArbitraryShrink2$fFunctorShrink2$fArbitrarySmart $fShowSmart$fFunctorSmart$fShowShrinking$fFunctorShrinking$fArbitraryShrinking$fArbitraryASCIIString$fArbitraryUnicodeString$fArbitraryPrintableString $fEqBlind $fOrdBlind $fNumBlind$fIntegralBlind $fRealBlind $fEnumBlind $fEqFixed $fOrdFixed $fShowFixed $fReadFixed $fNumFixed$fIntegralFixed $fRealFixed $fEnumFixed$fEqOrderedList$fOrdOrderedList$fShowOrderedList$fReadOrderedList$fEqNonEmptyList$fOrdNonEmptyList$fShowNonEmptyList$fReadNonEmptyList $fEqPositive $fOrdPositive$fShowPositive$fReadPositive$fEnumPositive $fEqNonZero $fOrdNonZero $fShowNonZero $fReadNonZero $fEnumNonZero$fEqNonNegative$fOrdNonNegative$fShowNonNegative$fReadNonNegative$fEnumNonNegative $fEqLarge $fOrdLarge $fShowLarge $fReadLarge $fNumLarge$fIntegralLarge $fRealLarge $fEnumLarge $fIxLarge $fEqSmall $fOrdSmall $fShowSmall $fReadSmall $fNumSmall$fIntegralSmall $fRealSmall $fEnumSmall $fIxSmall $fEqShrink2 $fOrdShrink2 $fShowShrink2 $fReadShrink2 $fNumShrink2$fIntegralShrink2 $fRealShrink2 $fEnumShrink2$fEqASCIIString$fOrdASCIIString$fShowASCIIString$fReadASCIIString$fEqUnicodeString$fOrdUnicodeString$fShowUnicodeString$fReadUnicodeString$fEqPrintableString$fOrdPrintableString$fShowPrintableString$fReadPrintableStringFunFunctionfunction:->Fn3Fn2FnfunctionBoundedEnumfunctionRealFracfunctionIntegral functionShow functionMapapplyapplyFun applyFun2 applyFun3 $fShow:-> $fFunctor:->$fGFunctionkM1$fGFunctionk:+:$fGFunctionk:*:$fGFunctionkU1$fGFunctionkK1$fArbitrary:->$fFunctionOrdC$fFunctionOrdB$fFunctionOrdA $fFunctionC $fFunctionB $fFunctionA$fFunctionWord64$fFunctionWord32$fFunctionWord16$fFunctionWord8$fFunctionInt64$fFunctionInt32$fFunctionInt16$fFunctionInt8 $fFunctionSeq$fFunctionIntMap$fFunctionIntSet $fFunctionMap $fFunctionSet$fFunctionComplex$fFunctionFixed$fFunctionRatio$fFunctionOrdering$fFunctionDouble$fFunctionFloat$fFunctionChar$fFunctionWord $fFunctionInt$fFunctionInteger$fFunctionBool$fFunctionMaybe $fFunction[]$fFunction(,,,,,,)$fFunction(,,,,,)$fFunction(,,,,)$fFunction(,,,)$fFunction(,,)$fFunctionEither $fFunction(,) $fFunction()$fArbitraryFun $fShowFun $fEqShrunkTerminalStrMkStrrangesnumbershortshowErroneLine isOneLinebold newTerminalwithStdioTerminalwithNullTerminalterminalOutputhandleputPartputLineputTemp $fShowStrStateMkStateterminalmaxSuccessTestsmaxDiscardedRatio computeSizenumTotMaxShrinksnumSuccessTestsnumDiscardedTestsnumRecentlyDiscardedTestslabels collectedexpectedFailure randomSeednumSuccessShrinks numTryShrinksnumTotTryShrinksResultMkResultokexpectreason theExceptionabort maybeNumTestsstamp callbackstestCase CallbackKindCounterexampleNotCounterexampleCallbackPostTestPostFinalFailureRoseMkRoseIORosePropMkPropunPropDiscardTestablepropertyProperty MkProperty unPropertymorallyDubiousIOProperty ioPropertyprotectioRosejoinRose reduceRoseonRose protectRoseprotectResults exceptionformatException protectResult succeededfailedrejectedliftBool mapResultmapTotalResult mapRoseResultmapPropmapSize shrinking noShrinkingcallbackcounterexampleshowCounterexample printTestCasewhenFail whenFail'verbose expectFailureonceagainwithMaxSuccesslabelcollectclassifycover==>withinforAll forAllShrink.&..&&.conjoin.||.disjoin===total $fMonadRose$fApplicativeRose $fFunctorRose$fTestable(->)$fTestableProperty $fTestableGen$fTestableProp$fTestableResult$fTestableBool $fTestable()$fTestableDiscardSuccessGaveUpFailureNoExpectedFailureInsufficientCoveragenumTestsoutput numShrinksnumShrinkTriesnumShrinkFinalusedSeedusedSizefailingTestCaseArgsreplay maxSuccessmaxDiscardRatiomaxSizechatty maxShrinks isSuccessstdArgs quickCheckquickCheckWithquickCheckResultquickCheckWithResult verboseCheckverboseCheckWithverboseCheckResultverboseCheckWithResulttest doneTestinggiveUprunATestfailureSummary failureReasonfailureSummaryAndReasonsummarysuccess formatLabel labelCount percentageinsufficientlyCovered foundFailurelocalMin localMin' localMinFoundcallbackPostTestcallbackPostFinalFailure $fShowArgs $fReadArgs $fShowResult PropertyM MkPropertyM unPropertyMassertprerunpickwpforAllMmonitormonadicmonadic' monadicIO monadicSTrunSTGen$fMonadIOPropertyM$fMonadTransPropertyM$fMonadFailPropertyM$fMonadPropertyM$fApplicativePropertyM$fFunctorPropertyMpolyQuickCheckpolyVerboseCheck monomorphicforAllProperties allProperties quickCheckAllverboseCheckAll$tf-random-0.5-ABwehMmciu8CuAFbHLp6ToSystem.Random.TF.GenTFGen!random-1.1-LLUGZ7T9DqQ5vN0Jbcd0We System.RandomStdGenbaseGHC.BaseJust GHC.GenericsGeneric gSubtermsIncl gSubterms Data.VersionVersion GCoArbitrary gCoarbitraryBoundsunBounds GSubtermsIncl GSubtermsRecursivelyShrinkgrecursivelyShrinkghc-prim GHC.TypesIntGHC.ShowShowInfiniteListInternalDataInfinite FinitePrefixGHC.EnumBoundedEnumGHC.RealRealFracIntegralGHC.ReadReadgenericFunctionShrunk NotShrunk GFunction gFunctionPair:+:UnitNilTableMap MkTerminalBoolIOFalse GHC.Classes==GHC.STST integer-gmpGHC.Integer.TypeIntegerOrdStringTrue