úÎ!‰~î¢       ! " #$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklm n o p q r s t u v w x y z { | } ~  € ‚ ƒ „ … † ‡ ˆ ‰ Š ‹ Œ Ž ‘ ’ “ ” • – — ˜ ™ š › œ ž Ÿ   ¡ Safe|¢£None 4¤checkersNever yield an answer. Like ¥] or 'error "whatever"', but don't raise an error, and don't consume computational resources.¦checkers Block foreverSafe ‚Safe ¸Safe ö   SafeŒ checkersOGenerates a non-empty list with the contents generated using its argument. checkersXGenerates any list (possibly empty) with the contents generated using its argument.checkersEGenerates an infinite list with contents generated using its argumentcheckers"Generates a list with a set lengthcheckers$Generate increasing towards infinitycheckers.Generate an infinite list of increasing valuescheckersGenerate nondecreasing valuescheckers1Generate an infinite list of nondecreasing valuescheckers$Generate increasing towards infinitycheckers.Generate an infinite list of increasing valuescheckersGenerate nondecreasing valuescheckers1Generate an infinite list of nondecreasing values  Safe"Safeðcheckers>Generates a 2-tuple using its arguments to generate the parts.checkers>Generates a 3-tuple using its arguments to generate the parts.checkers>Generates a 4-tuple using its arguments to generate the parts.checkers>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 experimentalportableSafeó !" !"(c) Conal Elliott 2007,2008BSD3conal@conal.net experimentalNone =>?@ACMXCô%#checkersLike %! but for unary type constructors.'checkers Explicit §7 dictionary. Doesn't have to correspond to an actual § instance, though see G.)checkersRTypes of values that can be tested for equality, perhaps through random sampling.+checkers"Token uninteresting type for tests,checkersToken ¨ type for tests-checkersToken © type for tests.checkersToken ª type for tests/checkers+Binary function, handy for type annotations0checkers*Unary function, handy for type annotations1checkersNamed batch of tests2checkers Named test3checkers-Flatten a test batch for inclusion in another4checkersRun a batch of tests. See 5 and 6.5checkersCheck a batch tersely.6checkersCheck a batch verbosely.8checkersf is its own inverse. See also :.9checkersf is a left inverse of g . See also :.:checkersf is a left and right inverse of g . See also 9.;checkersFor « types as ) types=checkersReflexive property: a rel a>checkersTransitive 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.?checkersSymmetric property: a rel b ==> b rel a . Generate a randomly, but use gen a to generate b. gen ought to satisfy rel fairly often.@checkersAntisymmetric property: (a rel b) && (a /= b) ==> not (b rel a).Acheckers/Has a given left identity, according to '(=-=)'Bcheckers0Has a given right identity, according to '(=-=)'Ccheckers9Has a given left and right identity, according to '(=-=)'Dcheckers!Associative, according to '(=-=)'Echeckers!Commutative, according to '(=-=)'Fcheckers!Commutative, according to '(=-=)'Gcheckers§ dictionary built from the § methods.Hcheckers;Monoid dictionary for an unwrapped endomorphism. See also G and Endo.IcheckersMHomomorphism properties with respect to given monoid dictionaries. See also monoidMorphism.JcheckersThe unary function f is idempotent, i.e.,  f . f == fKcheckersA binary function op is idempotent, i.e., x op x == x , for all xLcheckersA binary function op is has an idempotent element x , i.e., x op x == xTcheckersGenerate n arbitrary valuesUcheckers!Produce n values from a generator4#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTU42134560/789:.-,+)*;(=>?@ABCDFE'GHIJKL%&MNOPQR<#$TUS*4 (c) David Sankel 2008BSD3david@sankelsoftware.com experimentalNoneO$mcheckersbIs the given function commutative when restricted to the same value but possibly different times?ncheckersbIs the given function associative when restricted to the same value but possibly different times?ocheckersyDelay a value's availability by the given duration in seconds. Note that the delay happens only on the first evaluation.pcheckers+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.mnopnmop NoneOzqrqr NoneY‡ scheckersCGenerates a 'non space' character, i.e. any ascii except ' ', '\t', '\n' and '\r'.tcheckers8Generates any whitespace character, including new lines.ucheckers0Generates a whitespace charecter, not a newline.vcheckersGenerates either a '\n' or '\r'.wcheckers)Generates any lower case alpha character.xcheckers)Generates any upper case alpha character.ycheckersGenerates a digit character.zcheckers&Generates one or other of '(' and ')'.{checkers&Generates one or other of '[' and ']'.|checkers&Generates one or other of '{' and '}'.}checkersGenerates one of ¬, ­, ®, ¯, °, ±, '|' and #. stuvwxyz{|} stuvwxyz{|}NoneZ& qrstuvwxyz{|} (c) Conal Elliott 2008BSD3conal@conal.net experimentalNone>HSUVX}Ê~checkersTotal ordering.gen a ought to generate values b satisfying a rel b fairly often.checkers¨ laws.gen a ought to generate values b satisfying a rel b fairly often.€checkers¨ 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 bcheckersThe semantic function (&) for a is an €.‚checkersProperties to check that the § ad satisfies the monoid properties. The argument value is ignored and is present only for its type.ƒcheckersProperties to check that the ² ag satisfies the semigroup properties. The argument value is ignored and is present only for its type.„checkers*Monoid homomorphism properties. See also I.…checkersThe semantic function (&) for a is a „.‡checkersProperties to check that the ³ m# satisfies the functor properties.ˆcheckers³- morphism (natural transformation) properties‰checkersThe semantic function ($) for f is a ˆ.ŠcheckersProperties to check that the ´ m satisfies the apply properties‹checkers´ morphism propertiesŒcheckersThe semantic function ($) for f is an ‹.checkersProperties to check that the µ m& satisfies the applicative propertiesŽcheckersµ morphism propertiescheckersThe semantic function ($) for f is an Ž.checkersProperties to check that the  m satisfies the bind properties’checkers morphism properties“checkersThe semantic function ($) for f is a ’.”checkersProperties to check that the ¶ m satisfies the monad properties•checkers*Law for monads that are also instances of ³.!Note that instances that satisfy  and ”+ are implied to satisfy this property too.–checkers Note that ” also contains these properties.—checkers¶ morphism propertiesµ morphism properties˜checkersThe semantic function ($) for f is a —.™checkers4Laws for MonadPlus instances with left distribution.šcheckers-Laws for MonadPlus instances with left catch.›checkersCheck Alt Semigroup lawœcheckersCheck Alternative Monoid laws  checkers Note that  ! doesn't check the strictness of ·, ¸ and foldMap'.¡ checkers$~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š›œžŸ ¡$~€ƒ‚„…‡ˆ‰†Š‹ŒŽ’“‘”—˜•–ž ¡Ÿ™š›œ¹ !"#$%&'()*+,-./ 0 1 2 3 456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~  € ‚ ƒ „ … † ‡ ˆ ‰ Š ‹ Œ Ž ‘ ’ “ ” • – — ˜ ™ š › œ ž Ÿ   ¡ ¢ £ ¤ ¥ ¦ § ¨ © ª « ¬ ­ ® ¯ ° ± ² ³´µ¶·¸¹º·»¼½¾¿·ÀÁ·Âý¾Ä·ÀÅ·ÂÆ·ÀÇ·ÀȽ¾É½¾Ê·»Ë·»ÌÍÎÏ·»з»Ñ·ÒÓ·ÒÔÕ%checkers-0.5.2-GJbT1HW2kk2LE3jYMrrAqUTest.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.13.2-1FftnVviu6BCWJanU0jy5VTest.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[]$fEqPropInteger$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 traversablefoldablefoldableFunctor satisfiesMif'hangbaseGHC.Err undefinedhangIOGHC.BaseMonoidghc-prim GHC.ClassesOrdGHC.NumNumGHC.Real FractionalEq*/-+<> SemigroupFunctor*semigroupoids-5.3.3-A4bBKJAkghEL51J5STzP7GData.Functor.Bind.ClassApply ApplicativeMonad Data.Foldablefoldl'foldr'