úÎxÁnÓŸ       ! " #$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijkl m n o p q r s t u v w x y z { | } ~  € ‚ ƒ „ … † ‡ ˆ ‰ Š ‹ Œ Ž ‘ ’ “ ” • – — ˜ ™ š › œ ž SafeUŸ None Ë¡Never yield an answer. Like ¢] or 'error "whatever"', but don't raise an error, and don't consume computational resources.£ Block foreverSafe Safe SSafe “   Safe“ 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  Safe+Safes>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. (c) Andy Gill 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimentalportableSafex !" !"(c) Conal Elliott 2007,2008BSD3conal@conal.net experimentalNone ;<=>?AKV>S%#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 Endo.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 generator4#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTU42134560/789:.-,+)*;(=>?@ABCDFE'GHIJKL%&MNOPQR<#$TUS#$%&'©)**4 (c) David Sankel 2008BSD3david@sankelsoftware.com experimentalNoneI!lbIs the given function commutative when restricted to the same value but possibly different times?mbIs the given function associative when restricted to the same value but possibly different times?nyDelay a value's availability by the given duration in seconds. Note that the delay happens only on the first evaluation.o+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.lmnomlno NoneIypqpq NoneR rCGenerates a 'non space' character, i.e. any ascii except ' ', '\t', '\n' and '\r'.s8Generates any whitespace character, including new lines.t0Generates a whitespace charecter, not a newline.uGenerates either a '\n' or '\r'.v)Generates any lower case alpha character.w)Generates any upper case alpha character.xGenerates a digit character.y&Generates one or other of '(' and ')'.z&Generates one or other of '[' and ']'.{&Generates one or other of '{' and '}'.|Generates one of ª, «, ¬, ­, ®, ¯, '|' and #. rstuvwxyz{| rstuvwxyz{|NoneR¢& pqrstuvwxyz{| (c) Conal Elliott 2008BSD3conal@conal.net experimentalNone<FQSTVm½}Total ordering. gen a ought to generate values b satisfying a rel b fairly often.~Total ordering¥ 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 b€The semantic function (&) for a is an .Properties to check that the ¤ ad satisfies the monoid properties. The argument value is ignored and is present only for its type.‚Properties to check that the ° ag satisfies the semigroup properties. The argument value is ignored and is present only for its type.ƒ*Monoid homomorphism properties. See also I.„The semantic function (&) for a is a ƒ.†Properties to check that the ± m# satisfies the functor properties.‡±- morphism (natural transformation) propertiesˆThe semantic function ($) for f is a ‡.‰Properties to check that the ² m satisfies the apply propertiesŠ² morphism properties‹The semantic function ($) for f is an Š.ŒProperties to check that the ³ m& satisfies the applicative properties³ morphism propertiesŽThe semantic function ($) for f is an .Properties to check that the  m satisfies the bind properties‘ morphism properties’The semantic function ($) for f is a ‘.“Properties to check that the ´ m satisfies the monad properties”*Law for monads that are also instances of ±.–´ morphism properties³ morphism properties—The semantic function ($) for f is a –.˜4Laws for MonadPlus instances with left distribution.™-Laws for MonadPlus instances with left catch.šCheck Alt Semigroup law›Check Alternative Monoid laws"}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š›œž"}~€‚ƒ„†‡ˆ…‰Š‹ŒŽ‘’“–—”•œž˜™š›µ !"#$%&'()*+,-./ 0 1 2 3 456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|} ~  € ‚ ƒ „ … † ‡ ˆ ‰ Š ‹ Œ Ž ‘ ’ “ ” • – — ˜ ™ š › œ ž Ÿ   ¡ ¢ £ ¤ ¥ ¦ § ¨ © ª « ¬ ­ ® ¯ °±²³´µ¶·´¸¹º»¼´½¾´¿Àº»Á9´½Â´¿Ã´½Ä´½Åº»Æº»Ç´ÈÉ´¸ÊËÌÍ´¸δ¸ÏÐ&checkers-0.4.10-7N4mlVy4VcA8rPPk8g35JfTest.QuickCheck.CheckersTest.QuickCheck.BottomsTest.QuickCheck.Instances.ArrayTest.QuickCheck.Instances.MaybeTest.QuickCheck.Instances.NumTest.QuickCheck.Instances.ListTest.QuickCheck.Instances.OrdTest.QuickCheck.Instances.TupleTest.QuickCheck.UtilsTest.QuickCheck.LaterTest.QuickCheck.Instances.EqTest.QuickCheck.Instances.CharTest.QuickCheck.ClassesControl.Monad.ExtensionsTest.QuickCheck.Instances(QuickCheck-2.10.1-BUFYQzp5Pjm7JbQeTzW89lTest.QuickCheck.Property.&.bottom infiniteComp$fCoArbitraryArray$fArbitraryArraymaybeGen nonNegativepositive nonPositivenegativenonZerononZero_nonEmptyanyList infiniteList setLength increasing increasingInf nondecreasingnondecreasingInf decreasing decreasingInf nonincreasingnonincreasingInf greaterThanlessThan>*<>**<>***<>****<isAssociativeBy isAssociativeisCommutableBy isCommutable isTotalOrderModel1model1ModelmodelMonoidDBinRelEqProp=-=TOrdTNumTFracTBinopUnop TestBatchTestunbatch checkBatch quickBatch verboseBatchgenR involutioninverseLinverseeqeqModels reflexive transitive symmetric antiSymmetricleftIdrightIdbothIdisAssoccommutesisCommutmonoidD endoMonoidD homomorphism idempotent idempotent2idemElemmeqmeq1meq2meq3meq4meq5arbitrarySatisfyingarbsgens $fTestable(,) $fTestable[] $fEqProp(->)$fEqPropEither $fEqProp(,,,) $fEqProp(,,) $fEqProp(,) $fEqPropMaybe $fEqProp[]$fEqPropDouble $fEqPropFloat $fEqPropInt $fEqPropChar $fEqPropBool $fEqProp() $fModel(,)(,) $fModel[][]$fModelDoubleDouble$fModelFloatFloat $fModelIntInt$fModelCharChar$fModelBoolBool isCommutTimes isAssocTimesdelay delayForever notEqualTonotOneofnonSpace whitespacespacenewline lowerAlpha upperAlphanumeric parenthesisbracketbraceoperatorordRelord ordMorphism semanticOrdmonoid semigroupmonoidMorphismsemanticMonoid functorMonoidfunctorfunctorMorphismsemanticFunctorapply applyMorphism semanticApply applicativeapplicativeMorphismsemanticApplicativebind bindApply bindMorphism semanticBindmonad monadFunctormonadApplicative monadMorphism semanticMonad monadPlusmonadOralt alternativearrow arrowChoice traversable satisfiesMif'hangbaseGHC.Err undefinedhangIOGHC.BaseMonoidghc-prim GHC.ClassesOrdGHC.NumNumGHC.Real FractionalEq*/-+<>Data.Semigroup SemigroupFunctor*semigroupoids-5.2.2-AWVtxQlpf729VBd9H2aVn8Data.Functor.Bind.ClassApply ApplicativeMonad