!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvw x y z { | } ~                                                                                                                                                                   ! " # $ % & ' ( ) * + , - . / 0 1 2 3 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 stuvwxyz{|}~ TrustworthyLThe "standard" QuickCheck random number generator. A wrapper around either  on GHC, or  on other Haskell systems.     SafeTest 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.Safe !"#$%&'()*+,-. !"#$%&'()*+,- !"#$%&'()*-+, !"#$%&'()*+,-.Safe/xState represents QuickCheck's internal state while testing a property. The state is made visible to callback functions.1the current terminal2)maximum number of successful tests needed3-maximum number of tests that can be discarded4.how to compute the size of test cases from  tests and discarded tests5/the current number of tests that have succeeded6%the current number of discarded tests7<the number of discarded tests since the last successful test8(all labels that have been defined so far9*all labels that have been collected so far:-indicates if the property is expected to fail;the current random seed<+number of successful shrinking steps so far=Anumber of failed shrinking steps since the last successful shrink>&total number of failed shrinking steps/0123456789:;<=>/0812345679:;<=>/0123456789:;<=>/0123456789:;<=>SafeOT?A generator for values of type a.AdRun the generator on a particular seed. If you just want to get a random value out, consider using G.B+Modifies a generator using an integer seed.C?Used to construct generators that depend on the size parameter.DsOverrides the size parameter. Returns a generator which uses the given size instead of the runtime-size parameter.EGAdjust the size parameter, by transforming it with the given function.F8Generates a random element in the given inclusive range.GyRun a generator. The size passed to the generator is always 30; if you want another size then you should explicitly use D.HGenerates some example values.I1Generates some example values and prints them to stdout.J-Generates a value that satisfies a predicate.K5Tries to generate a value that satisfies a predicate.LMRandomly uses one of the given generators. The input list must be non-empty.MlChooses one of the given generators, with a weighted random distribution. The input list must be non-empty.NDGenerates one of the given values. The input list must be non-empty.O1Generates a random subsequence of the given list.P1Generates a random permutation of the given list.QTakes 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.RUGenerates a list of random length. The maximum length depends on the size parameter.S_Generates a non-empty list of random length. The maximum length depends on the size parameter.T%Generates a list of the given length.UGenerates an infinite list.?@ABCDEFGHIJKLMNOPQRSTUVWX?@ABCDEFGHIJKLMNOPQRSTU?@AXWVBCDEFGHIJKLMNOPQRSTU?@ABCDEFGHIJKLMNOPQRSTUVWXSafeOT[>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))YZ[\]YZ[\][\]YZYZ[\]Safe 69:;<=DQRT ^(Used for random generation of functions.AIf you are using a recent GHC, there is a default definition of _ using r, so if your type has a  instance it's enough to say instance CoArbitrary MyTypeYou should only use r/ 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 B} to perturb the random generator; the goal is that different values for the first argument will lead to different calls to B. An example will help: Ginstance CoArbitrary a => CoArbitrary [a] where coarbitrary [] = B 0 coarbitrary (x:xs) = B 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.`*Random generation and shrinking of values.a)A generator for values of the given type.bProduces 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.Most implementations of b" should try at least three things: /Shrink a term to any of its immediate subterms.Recursively apply b to all immediate subterms.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 b 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; note that these only work on GHC 7.2 and above. The function c~ tries shrinking a term to all of its subterms and, failing that, recursively shrinks the subterms. Using it, we can define b as: sshrink x = shrinkToNil x ++ genericShrink x where shrinkToNil Nil = [] shrinkToNil (Branch _ l r) = [Nil]c is a combination of e4, which shrinks a term to any of its subterms, and dq, which shrinks all subterms of a term. These may be useful if you need a bit more control over shrinking than c gives you.!A final gotcha: we cannot define b as simply b x = Nil:c x as this shrinks Nil to Nil/, and shrinking will go into an infinite loop.1If all this leaves you bewildered, you might try b = c to begin with, after deriving Genericd for your type. However, if your data type has any special invariants, you will need to check that c can't break those invariants.cZShrink a term to any of its immediate subterms, and also recursively shrink all subterms.d*Recursively shrink all immediate subterms.e!All immediate subterms of a term.fIShrink a list of values given a shrinking function for individual values.gGenerates an integral number. The number can be positive or negative and its maximum absolute value depends on the size parameter.hVGenerates a natural number. The number's maximum value depends on the size parameter.iGenerates a fractional number. The number can be positive or negative and its maximum absolute value depends on the size parameter.jvGenerates an integral number. The number is chosen uniformly from the entire range of the type. You may want to use m instead.kaGenerates an element of a bounded type. The element is chosen from the entire range of the type.l.Generates an element of a bounded enumeration.mGenerates 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.n"Returns no shrinking alternatives.oShrink an integral number.p6Shrink a fraction, but only shrink to integral values.qShrink a fraction.r#Generic CoArbitrary implementation.sQCombine two generator perturbing functions, for example the results of calls to B or _.tA _% implementation for integral numbers.uA _! implementation for real numbers.v_ helper for lazy people :-).wA _ implementation for enums.x#Generates a list of a given length.yGenerates an ordered list.zGenerate an infinite list. Generates  with non-empty non-negative  versionBranch , and empty  versionTags^_`abcdefghijklmnopqrstuvwxyz{|}~^_`abcdefghijklmnopqrstuvwxyz`ab^__ghjmiklcedrnfoqptuvwsxyz^__`abcdefghijklmnopqrstuvwxyz{|}~ Trustworthy<=I  Shrinking _ x2: allows for maintaining a state during shrinking. Smart _ x): tries a different order when shrinking. Shrink2 x<: allows 2 shrinking steps at the same time when shrinking xSmall x: generates values of x, drawn from a small range. The opposite of .Large x#: by default, QuickCheck generates s drawn from a small range.  Large Int6 gives you values drawn from the entire range instead.  NonNegative x: guarantees that x >= 0.  NonZero x: guarantees that x /= 0. Positive x: guarantees that x > 0. NonEmpty xs": guarantees that xs is non-empty. 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.@      !"#$%&'()*+,-./0123456789%     %     (      !"#$%&'()*+,-./0123456789 NoneI$wxyz{|}~wxyz{|}~}~z{|wxywxyz{|}~ None %&6:QRb/The type of possibly partial concrete functions1A pattern for matching against the function only: 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.P  G Safe2The result of a single test.*result of the test case; Nothing = discard5indicates what the expected result of the property is$a message indicating what went wrongthe exception thrown, if any(if True, the test should not be repeated all labels used by this property'the collected values for this test case the callbacks for this test caseAffected by the  combinatorNot affected by the  combinatorDifferent kinds of callbacksCalled just after a test'Called with the final failing test-caseIf a property returns O, the current test case is discarded, the same as if a precondition was false.EThe class of things which can be tested, i.e. turned into a property. Convert the thing to a property.The type of properties.?Backwards combatibility note: in older versions of QuickCheck  was a type synonym for ? 7, so you could mix and match property combinators and ?n monad operations. Code that does this will no longer typecheck. However, it is easy to fix: because of the + typeclass, any combinator that expects a  will also accept a ? . If you have a  where you need a ? a0, simply wrap the property combinator inside a  to get a ? , and all should be well._Do I/O inside a property. This can obviously lead to unrepeatable testcases, so use with care._Do I/O inside a property. This can obviously lead to unrepeatable testcases, so use with care.;For more advanced monadic testing you may want to look at Test.QuickCheck.Monadic.Note that if you use  on a property of type IO Bool, or more generally a property that does no quantification, the property will only be executed once. To test the property repeatedly you must use the " combinator. 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 property if it fails. Shrinking is done automatically for most types. This is only needed when you want to override the default behavior.-Disables shrinking for a property altogether.Adds a callback,Adds the given string to the counterexample.,Adds the given string to the counterexample. Performs an - action after the last failure of a property. Performs an  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.!8Modifies a property so that it only will be tested once."Undoes the effect of !.#SAttaches a label to a property. This is used for reporting test case distribution.$Labels a property with a value: collect x = label (show x)%Conditionally labels test case.&-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.'SImplication for properties: The resulting property holds if the first argument is M (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.0Like ,, but prints a counterexample when it fails.U     b-like function.The original argument !"#$%True% 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.'()*+,-./0123456789:K      !"#$%&'()*+,-./0U:987654321      !"#$%&'()*+,-./0@       !"#$%&'()*+,-./0123456789:'0+1,1.104 Safe ;!Result represents the test result<A successful test run=Given up>A failed test run?*A property that should have failed did not@The tests passed but a use of & had insufficient coverageANumber of tests performedB8Labels and frequencies found during all successful testsCPrinted outputD.Number of successful shrinking steps performedE0Number of unsuccessful shrinking steps performedFMNumber of unsuccessful shrinking steps performed since last successful shrinkGWhat seed was usedHWhat was the test sizeIWhy did the property failJ(The exception the property threw, if anyK1Args specifies arguments to the QuickCheck driverMShould 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.N4Maximum number of successful tests before succeedingOFMaximum number of discarded tests per successful test before giving upP&Size to use for the biggest test casesQWhether to print anythingR*Check if the test run result was a successSThe default test argumentsT+Tests a property and prints the results to stdout.UBTests a property, using test arguments, and prints the results to stdout.VDTests a property, produces a test result, and prints the results to stdout.WZTests a property, using test arguments, produces a test result, and prints the results to stdout.XHTests a property and prints the results and all test cases generated to stdout>. This is just a convenience function that means the same as T . .Y_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 U and .ZaTests 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 V 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 W and ./;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghi/;<=>?@BIJACDEFGHKLMNOPQRSTUVWXYZ[\]^_`abcdefghi;KLMNOPQ;<=>?@ABCABCADEFGHIJBCABCABCRSTUVWXYZ[\]^_`abcdefghi;<=>?@ABCABCADEFGHIJBCABCABCKLMNOPQRSTUVWXYZ[\]^_`abcdefghi  TrustworthyOTm>Test a polymorphic property, defaulting all type variables to . Invoke as $(m 'prop), where prop+ is a property. Note that just evaluating T propM in GHCi will seem to work, but will silently default all type variables to ()!$(m 'prop) means the same as T $(o 'prop)-. If you want to supply custom arguments to m, you will have to combine U and o yourself.If you want to use mZ in the same file where you defined the property, the same scoping problems pop up as in q: see the note there about  return [].n>Test a polymorphic property, defaulting all type variables to 5. This is just a convenience function that combines X and o.If you want to use nZ in the same file where you defined the property, the same scoping problems pop up as in q: see the note there about  return [].oGMonomorphise an arbitrary property by defaulting all type variables to .For example, if f has type  a => [a] -> [a] then $(o 'f) has type [] -> [].If you want to use oZ in the same file where you defined the property, the same scoping problems pop up as in q: see the note there about  return [].p;Test all properties in the current module, using a custom T$ function. The same caveats as with q apply.$p has type ( ->  ;) ->  . An example invocation is $p V , which does the same thing as $q.p$ has the same issue with scoping as q: see the note there about  return [].qUTest all properties in the current module. The name of the property must begin with prop_/. Polymorphic properties will be defaulted to  . Returns  if all tests succeeded,  otherwise.To use q5, add a definition to your module along the lines of #return [] runTests = $quickCheckAlland then execute runTests.Note: the bizarre  return []9 in the example above is needed on GHC 7.8; without it, qG 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 q1 can see everything that was defined before the  return []. Yikes!r^Test all properties in the current module. This is just a convenience function that combines q and .r$ has the same issue with scoping as q: see the note there about  return [].mnopqrmnopqrqrpmnomnopqrSafeOT seThe 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.w:Allows embedding non-monadic properties into monadic ones.xTests preconditions. Unlike wp 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 yGThe lifting operation of the property monad. Allows embedding monadic/-actions in properties: Hlog :: Int -> IO () prop_foo n = monadicIO $ do run (log n) -- ... z8Quantification 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 z, 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 -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 -computations. A-- Your mutable sorting algorithm here sortST :: Ord a => [a] ->  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.stuvwxyz{|}~stuvwxyz{|}~stuywx{z|}v~stuvwxyz{|}~Safe?BCDEFGHIJKLMNOPQRSTU^_`abcdefghijklmnopqrstuvwxyz      !"#$%&'()*+,-./0;<=>?@BIJACDEFGHKLMNOPQSTUVWXYZ[mnopqrTKLMNOPQ;<=>?@ABCABCADEFGHIJBCABCABCSUWVXY[Zqrpmno?FLMNQCDEJKRSTUPOxyzGIH`ab^__ghimjklrcednfoqpBtuvws     )*'0!"(+,-./ #$%& !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrsstuvwxyz{|}~       !""#$%&'()**+,,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~                                                                                                                       R                                               ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ?  @ A B C D E R F G H I J K   L 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 rstu"vwxyz{|}~                          'QuickCheck-2.9.1-ADKJfTsJVEWJp7VC229wViTest.QuickCheck.RandomTest.QuickCheck.ExceptionTest.QuickCheck.TextTest.QuickCheck.StateTest.QuickCheck.GenTest.QuickCheck.Gen.UnsafeTest.QuickCheck.ArbitraryTest.QuickCheck.ModifiersTest.QuickCheck.PolyTest.QuickCheck.FunctionTest.QuickCheck.PropertyTest.QuickCheck.TestTest.QuickCheck.AllTest.QuickCheck.MonadicSystem.ProcessreadProcessWithExitCode System.Exit ExitSuccess Data.VectorthawfromList Data.ListsortfreezetoListTest.QuickCheckQCGen newTheGenbitsmaskdoneBitchipchopstopmkTheGennewQCGenmkQCGen bigNatVariant natVariant variantTheGen boolVariant variantQCGen$fRandomGenQCGen $fReadQCGen $fShowQCGen AnException tryEvaluate tryEvaluateIOevaluate isInterruptdiscard isDiscardfinallyTerminalStrMkStrrangesnumbershortshowErroneLine isOneLinebold newTerminalwithStdioTerminalwithNullTerminalterminalOutputhandleputPartputLineputTemp $fShowStrStateMkStateterminalmaxSuccessTestsmaxDiscardedTests computeSizenumSuccessTestsnumDiscardedTestsnumRecentlyDiscardedTestslabels collectedexpectedFailure randomSeednumSuccessShrinks numTryShrinksnumTotTryShrinksGenMkGenunGenvariantsizedresizescalechoosegeneratesample'samplesuchThat suchThatMaybeoneof frequencyelements sublistOfshufflegrowingElementslistOflistOf1vectorOfinfiniteListOf $fMonadGen$fApplicativeGen $fFunctorGenCapturepromotedelaycapture CoArbitrary coarbitrary Arbitrary arbitraryshrink genericShrinkrecursivelyShrinksubterms shrinkListarbitrarySizedIntegralarbitrarySizedNaturalarbitrarySizedFractionalarbitraryBoundedIntegralarbitraryBoundedRandomarbitraryBoundedEnumarbitrarySizedBoundedIntegral shrinkNothingshrinkIntegralshrinkRealFracToIntegershrinkRealFracgenericCoarbitrary><coarbitraryIntegralcoarbitraryRealcoarbitraryShowcoarbitraryEnumvector orderedList infiniteList$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$fCoArbitraryNatural$fCoArbitraryInteger$fCoArbitrary(,,,,)$fCoArbitrary(,,,)$fCoArbitrary(,,)$fCoArbitrary(,)$fCoArbitraryComplex$fCoArbitraryFixed$fCoArbitraryRatio$fCoArbitraryNonEmpty$fCoArbitrary[]$fCoArbitraryEither$fCoArbitraryMaybe$fCoArbitraryOrdering$fCoArbitraryBool$fCoArbitrary()$fCoArbitrary(->)$fGCoArbitraryK1$fGCoArbitraryM1$fGCoArbitrary:+:$fGCoArbitrary:*:$fGCoArbitraryU1$fArbitraryVersion$fArbitraryAlt$fArbitraryLast$fArbitraryFirst$fArbitraryProduct$fArbitrarySum$fArbitraryAny$fArbitraryAll$fArbitraryEndo$fArbitraryDual$fArbitraryConst$fArbitraryConstant$fArbitraryIdentity$fArbitraryZipList$fArbitrarySeq$fArbitraryIntMap$fArbitraryIntSet$fArbitraryMap$fArbitrarySet$fArbitraryDouble$fArbitraryFloat$fArbitraryChar$fArbitraryWord64$fArbitraryWord32$fArbitraryWord16$fArbitraryWord8$fArbitraryWord$fArbitraryInt64$fArbitraryInt32$fArbitraryInt16$fArbitraryInt8$fArbitraryInt$fArbitraryNatural$fArbitraryInteger$fArbitrary(,,,,,,,,,)$fArbitrary(,,,,,,,,)$fArbitrary(,,,,,,,)$fArbitrary(,,,,,,)$fArbitrary(,,,,,)$fArbitrary(,,,,)$fArbitrary(,,,)$fArbitrary(,,)$fArbitrary(,)$fArbitraryFixed$fArbitraryComplex$fArbitraryRatio$fArbitraryNonEmpty $fArbitrary[]$fArbitraryEither$fArbitraryMaybe$fArbitraryOrdering$fArbitraryBool $fArbitrary()$fArbitrary(->)$fGSubtermsInclK1b$fGSubtermsInclK1a$fGSubtermsInclM1a$fGSubtermsIncl:+:a$fGSubtermsIncl:*:a$fGSubtermsInclU1a$fGSubtermsInclV1a$fGSubtermsK1b$fGSubtermsM1a$fGSubterms:+:a$fGSubterms:*:a$fGSubtermsU1a$fGSubtermsV1a$fRecursivelyShrinkV1$fRecursivelyShrinkU1$fRecursivelyShrinkK1$fRecursivelyShrinkM1$fRecursivelyShrink:+:$fRecursivelyShrink:*: ShrinkState shrinkInit shrinkState ShrinkingSmartShrink2 getShrink2SmallgetSmallLargegetLarge NonNegativegetNonNegativeNonZero getNonZeroPositive getPositive NonEmptyListNonEmpty getNonEmpty OrderedListOrdered getOrderedFixedgetFixedBlindgetBlind$fArbitraryShrinking$fShowShrinking$fFunctorShrinking$fArbitrarySmart $fShowSmart$fFunctorSmart$fArbitraryShrink2$fFunctorShrink2$fArbitrarySmall$fFunctorSmall$fArbitraryLarge$fFunctorLarge$fArbitraryNonNegative$fFunctorNonNegative$fArbitraryNonZero$fFunctorNonZero$fArbitraryPositive$fFunctorPositive$fArbitraryNonEmptyList$fFunctorNonEmptyList$fArbitraryOrderedList$fFunctorOrderedList$fFunctorFixed$fArbitraryBlind $fShowBlind$fFunctorBlind $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 $fEqSmall $fOrdSmall $fShowSmall $fReadSmall $fNumSmall$fIntegralSmall $fRealSmall $fEnumSmall $fEqShrink2 $fOrdShrink2 $fShowShrink2 $fReadShrink2 $fNumShrink2$fIntegralShrink2 $fRealShrink2 $fEnumShrink2OrdCunOrdCOrdBunOrdBOrdAunOrdACunCBunBAunA$fCoArbitraryOrdC$fArbitraryOrdC $fShowOrdC$fCoArbitraryOrdB$fArbitraryOrdB $fShowOrdB$fCoArbitraryOrdA$fArbitraryOrdA $fShowOrdA$fCoArbitraryC $fArbitraryC$fShowC$fCoArbitraryB $fArbitraryB$fShowB$fCoArbitraryA $fArbitraryA$fShowA$fEqA$fEqB$fEqC$fEqOrdA $fOrdOrdA $fNumOrdA$fEqOrdB $fOrdOrdB $fNumOrdB$fEqOrdC $fOrdOrdC $fNumOrdCFunFunctionfunction:->FnfunctionBoundedEnumfunctionRealFracfunctionIntegral functionShow functionMapapply$fArbitraryFun $fShowFun $fGFunctionK1 $fGFunctionM1$fGFunction:+:$fGFunction:*: $fGFunctionU1$fArbitrary:->$fFunctionOrdC$fFunctionOrdB$fFunctionOrdA $fFunctionC $fFunctionB $fFunctionA$fFunctionWord64$fFunctionWord32$fFunctionWord16$fFunctionWord8$fFunctionInt64$fFunctionInt32$fFunctionInt16$fFunctionInt8$fFunctionNatural $fFunctionSeq$fFunctionIntMap$fFunctionIntSet $fFunctionMap $fFunctionSet$fFunctionComplex$fFunctionFixed$fFunctionRatio$fFunctionNonEmpty$fFunctionOrdering$fFunctionDouble$fFunctionFloat$fFunctionChar $fFunctionInt$fFunctionInteger$fFunctionBool$fFunctionMaybe $fFunction[]$fFunction(,,,,,,)$fFunction(,,,,,)$fFunction(,,,,)$fFunction(,,,)$fFunction(,,)$fFunctionEither $fFunction(,) $fFunction() $fShow:-> $fFunctor:->ResultMkResultokexpectreason theExceptionabortstamp callbacks CallbackKindCounterexampleNotCounterexampleCallbackPostTestPostFinalFailureRoseMkRoseIORosePropMkPropunPropDiscardTestablepropertyProperty MkProperty unPropertymorallyDubiousIOProperty ioPropertyprotectioRosejoinRose reduceRoseonRose protectRoseprotectResults exceptionformatException protectResult succeededfailedrejectedliftBool mapResultmapTotalResult mapRoseResultmapPropmapSize shrinking noShrinkingcallbackcounterexample printTestCasewhenFail whenFail'verbose expectFailureonceagainlabelcollectclassifycover==>withinforAll forAllShrink.&..&&.conjoin.||.disjoin=== $fMonadRose$fApplicativeRose $fFunctorRose$fTestable(->)$fTestableProperty $fTestableGen$fTestableProp$fTestableResult$fTestableBool$fTestableDiscardSuccessGaveUpFailureNoExpectedFailureInsufficientCoveragenumTestsoutput numShrinksnumShrinkTriesnumShrinkFinalusedSeedusedSizeArgsreplay maxSuccessmaxDiscardRatiomaxSizechatty isSuccessstdArgs quickCheckquickCheckWithquickCheckResultquickCheckWithResult verboseCheckverboseCheckWithverboseCheckResultverboseCheckWithResulttest doneTestinggiveUprunATestsummarysuccesslabelPercentageinsufficientCoverage foundFailurelocalMin localMin' localMinFoundcallbackPostTestcallbackPostFinalFailure $fShowArgs $fReadArgs $fShowResultpolyQuickCheckpolyVerboseCheck monomorphicforAllProperties quickCheckAllverboseCheckAll PropertyM MkPropertyM unPropertyMassertprerunpickwpforAllMmonitormonadicmonadic' monadicIO monadicSTrunSTGen$fMonadIOPropertyM$fMonadTransPropertyM$fMonadPropertyM$fApplicativePropertyM$fFunctorPropertyM#tf-random-0.5-4z8OJUaXC1FRNfrLPFWADSystem.Random.TF.GenTFGen!random-1.1-54KmMHXjttlERYcr1mvsAe System.RandomStdGen MkTerminal withBufferingflushbase GHC.GenericsGeneric gSubtermsIncl gSubterms Data.VersionVersion GCoArbitrary gCoarbitrary GSubtermsIncl GSubtermsRecursivelyShrinkgrecursivelyShrinkinBounds withBoundsghc-prim GHC.TypesIntGHC.ShowShowGHC.EnumBoundedEnumGHC.RealRealFracIntegralGHC.ReadReadgenericFunction GFunction gFunctionPair:+:UnitNilTableMap showFunctionabstracttablefunctionMapWithfunctionPairWithfunctionEitherWith shrinkFunmkFunGHC.BasereturnIOFalse GHC.Classes== integer-gmpGHC.Integer.TypeIntegerOrdBoolTrueErrorexpNameisVarinfoTypedeconstructTypemonomorphiseType readUTF8Fileset_utf8_io_encrunQuickCheckAllGHC.STST