úÎt}kD€       ! " #$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUV 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€€€SafeSafe>Generates a 2-tuple using its arguments to generate the parts.>Generates a 3-tuple using its arguments to generate the parts.>Generates a 4-tuple using its arguments to generate the parts.>Generates a 5-tuple using its arguments to generate the parts.SafeSafe    SafeSafe OGenerates a non-empty list with the contents generated using its argument.XGenerates any list (possibly empty) with the contents generated using its argument.EGenerates an infinite list with contents generated using its argument"Generates a list with a set length$Generate increasing towards infinity.Generate an infinite list of increasing valuesGenerate nondecreasing values1Generate an infinite list of nondecreasing values$Generate increasing towards infinity.Generate an infinite list of increasing valuesGenerate nondecreasing values1Generate an infinite list of nondecreasing values‚ƒ„  ‚ƒ„None…Never yield an answer. Like †] or 'error "whatever"', but don't raise an error, and don't consume computational resources.‡ Block forever…‡…‡ (c) Andy Gill 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimentalportableSafe !" !" !" !"(c) Conal Elliott 2007,2008BSD3conal@conal.net experimentalNone 34579CN%#Like %! but for unary type constructors.' Explicit ˆ7 dictionary. Doesn't have to correspond to an actual ˆ instance, though see G.)RTypes of values that can be tested for equality, perhaps through random sampling.+"Token uninteresting type for tests,Token ‰ type for tests-Token Š type for tests.Token ‹ type for tests/+Binary function, handy for type annotations0*Unary function, handy for type annotations1Named batch of tests2 Named test3-Flatten a test batch for inclusion in another4Run a batch of tests. See 5 and 6.5Check a batch tersely.6Check a batch verbosely.8f is its own inverse. See also :.9f is a left inverse of g . See also :.:f is a left and right inverse of g . See also 9.;For Œ types as ) types=Reflexive property: a rel a>Transitive property: a rel b && b rel c ==> a rel c . Generate a randomly, but use gen a to generate b and gen b to generate c. gen ought to satisfy rel fairly often.?Symmetric property: a rel b ==> b rel a . Generate a randomly, but use gen a to generate b. gen ought to satisfy rel fairly often.@Symmetric property: a rel b && b rel a ==> a == b . Generate a randomly, but use gen a to generate b. gen ought to satisfy both rel( directions fairly often but not always.A/Has a given left identity, according to '(=-=)'B0Has a given right identity, according to '(=-=)'C9Has a given left and right identity, according to '(=-=)'D!Associative, according to '(=-=)'E!Commutative, according to '(=-=)'F!Commutative, according to '(=-=)'Gˆ dictionary built from the ˆ methods.H;Monoid dictionary for an unwrapped endomorphism. See also G and .IMHomomorphism properties with respect to given monoid dictionaries. See also monoidMorphism.JThe unary function f is idempotent, i.e.,  f . f == fKA binary function op is idempotent, i.e., x op x == x , for all xLA binary function op is has an idempotent element x , i.e., x op x == xTGenerate n arbitrary valuesU!Produce n values from a generatorN#$%&'()*+,-./0123456‘789:;<=>?@ABCDEFGHIJKLMNOPQRSTU’“”•–—˜™š›œŸ ¡¢£¤¥¦§¨4#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTU42134560/789:.-,+)*;(=>?@ABCDFE'GHIJKL%&MNOPQR<#$TUSJ#$%&'()*+,-./0123456‘789:;<=>?@ABCDEFGHIJKLMNOPQRSTU’“”•–—˜™š›œŸ ¡¢£¤¥¦§¨* NoneVWVWVWVW None XCGenerates a 'non space' character, i.e. any ascii except ' ', '\t', '\n' and '\r'.Y8Generates any whitespace character, including new lines.Z0Generates a whitespace charecter, not a newline.[Generates either a '\n' or '\r'.\)Generates any lower case alpha character.])Generates any upper case alpha character.^Generates a digit character._&Generates one or other of '(' and ')'.`&Generates one or other of '[' and ']'.a&Generates one or other of '{' and '}'.bGenerates one of ©, ª, «, ¬, ­, ®, '|' and '#'. XYZ[¯\]^_`ab XYZ[\]^_`ab XYZ[\]^_`ab XYZ[¯\]^_`ab (c) Conal Elliott 2008BSD3conal@conal.net experimentalNone4>IKLNcTotal ordering. gen a ought to generate values b satisfying a rel b fairly often.dTotal orderinge‰ morphism properties. h is an ‰ morphism iff: Y a <= b = h a <= h b h (a `min` b) = h a `min` h b h (a `max` b) = h a `max` h bfThe semantic function (&) for a is an e.gProperties to check that the ˆ ad satisfies the monoid properties. The argument value is ignored and is present only for its type.h*Monoid homomorphism properties. See also I.iThe semantic function (&) for a is a h.kProperties to check that the ° m# satisfies the functor properties.l°- morphism (natural transformation) propertiesmThe semantic function ($) for f is a l.nProperties to check that the ± m satisfies the monad propertieso± morphism propertiespThe semantic function ($) for f is an o.qProperties to check that the ² m satisfies the monad propertiesr*Law for monads that are also instances of °.t² morphism properties± morphism propertiesuThe semantic function ($) for f is a t.v4Laws for MonadPlus instances with left distribution.w-Laws for MonadPlus instances with left catch.xCheck Alternative Monoid lawscdefghijklmnopqrstuvwxyz{cdefghijklmnopqrstuvwxyz{cdefghiklmjnopqtursyz{vwxcdefghijklmnopqrstuvwxyz{None& VWXYZ[\]^_`ab (c) David Sankel 2008BSD3david@sankelsoftware.com experimentalNone|bIs the given function commutative when restricted to the same value but possibly different times?}bIs the given function associative when restricted to the same value but possibly different times?~yDelay a value's availability by the given duration in seconds. Note that the delay happens only on the first evaluation.+A value that is never available. Rerun of hang8 from unamb, but replicated to avoid mutual dependency.CTODO: Remove when this module is moved into the unamb-test package.³|}´~|}~}|~³|}´~µ !"#$%&'()*+,-./ 0 1 2 3 456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefg h i j k l m n o p q r s t u v w x y z { | } ~  € ‚ ƒ „ … † ‡ ˆ ‰ Š ‹ Œ ‘’“”•–—˜™š›˜œŸ ˜¡¢˜£¤Ÿ¥˜¦§9¨©ª«¬­®¯°±²³´µ¶·¸¹º»¼½¾¿ÀÁ˜¡Â˜£Ã˜¡Ä˜¡ÅŸÆŸÇ ȘœɘœʘœË Ì ÍÎcheck_Ia5hJig5YVz3AZKgqd0bF3Test.QuickCheck.CheckersTest.QuickCheck.Instances.ArrayTest.QuickCheck.Instances.TupleTest.QuickCheck.Instances.OrdTest.QuickCheck.Instances.NumTest.QuickCheck.Instances.MaybeTest.QuickCheck.Instances.ListTest.QuickCheck.BottomsTest.QuickCheck.UtilsTest.QuickCheck.Instances.EqTest.QuickCheck.Instances.CharTest.QuickCheck.ClassesTest.QuickCheck.LaterControl.Monad.ExtensionsTest.QuickCheck.InstancesQuick_BnZKeqxVf7FCbnejbqAnPLTest.QuickCheck.Property.&.$fCoArbitraryArray$fArbitraryArray>*<>**<>***<>****< greaterThanlessThan nonNegativepositive nonPositivenegativenonZerononZero_maybeGennonEmptyanyList infiniteList setLength increasing increasingInf nondecreasingnondecreasingInf decreasing decreasingInf nonincreasingnonincreasingInfbottom infiniteCompisAssociativeBy isAssociativeisCommutableBy isCommutable isTotalOrderModel1model1ModelmodelMonoidDBinRelEqProp=-=TOrdTNumTFracTBinopUnop TestBatchTestunbatch checkBatch quickBatch verboseBatchgenR involutioninverseLinverseeqeqModels reflexive transitive symmetric antiSymmetricleftIdrightIdbothIdisAssoccommutesisCommutmonoidD endoMonoidD homomorphism idempotent idempotent2idemElemmeqmeq1meq2meq3meq4meq5arbitrarySatisfyingarbsgens notEqualTonotOneofnonSpace whitespacespacenewline lowerAlpha upperAlphanumeric parenthesisbracketbraceoperatorordRelord ordMorphism semanticOrdmonoidmonoidMorphismsemanticMonoid functorMonoidfunctorfunctorMorphismsemanticFunctor applicativeapplicativeMorphismsemanticApplicativemonad monadFunctormonadApplicative monadMorphism semanticMonad monadPlusmonadOr alternativearrow arrowChoice traversable isCommutTimes isAssocTimesdelay delayForever satisfiesMif'sumA monotonic_ monotonichangbaseGHC.Err undefinedhangIOGHC.BaseMonoidghc-prim GHC.ClassesOrdGHC.NumNumGHC.Real FractionalEq Data.MonoidEndopadToquick'verbose'randgenerate $fTestable(,) $fTestable[] $fModel(,)(,) $fModel[][]$fModelDoubleDouble$fModelFloatFloat $fModelIntInt$fModelCharChar$fModelBoolBool $fEqProp(->)$fEqPropEither $fEqProp(,,,) $fEqProp(,,) $fEqProp(,) $fEqPropMaybe $fEqProp[]$fEqPropDouble $fEqPropFloat $fEqPropInt $fEqPropChar $fEqPropBool*/-+<>lettersFunctor ApplicativeMonaddelayP eventually