úÎ!Šż€}¤       ! " #$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmno p q r s t u v w x y z { | } ~  €  ‚ ƒ „ … † ‡ ˆ ‰ Š ‹ Œ  Ž   ‘ ’ “ ” • – — ˜ ™ š › œ  ž Ÿ   Ą ˘ Ł Safe–¤ĽNone NŚ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 =>?@ACMXE{&#checkersLike %! but for unary type constructors.'checkers Explicit Š7 dictionary. Doesn't have to correspond to an actual Š instance, though see H.)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=checkersf `denotationFor' g proves that f is a model for g , ie that & . g * f.>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.AcheckersAntisymmetric property: (a rel b) && (a /= b) ==> not (b rel a).Bcheckers/Has a given left identity, according to '(=-=)'Ccheckers0Has a given right identity, according to '(=-=)'Dcheckers9Has a given left and right identity, according to '(=-=)'Echeckers!Associative, according to '(=-=)'Fcheckers!Commutative, according to '(=-=)'Gcheckers!Commutative, according to '(=-=)'HcheckersŠ dictionary built from the Š methods.Icheckers;Monoid dictionary for an unwrapped endomorphism. See also H and Endo.JcheckersMHomomorphism properties with respect to given monoid dictionaries. See also monoidMorphism.KcheckersThe unary function f is idempotent, i.e.,  f . f == fLcheckersA binary function op is idempotent, i.e., x op x == x , for all xMcheckersA binary function op is has an idempotent element x , i.e., x op x == xUcheckersGenerate n arbitrary valuesVcheckers!Produce n values from a generator5#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUV52134560/789:.-,+)*;(>?@ABCDEGF'HIJKLM%&NOPQRS<=#$UVT*4 (c) David Sankel 2008BSD3david@sankelsoftware.com experimentalNonePłocheckersbIs the given function commutative when restricted to the same value but possibly different times?pcheckersbIs the given function associative when restricted to the same value but possibly different times?qcheckersyDelay a value's availability by the given duration in seconds. Note that the delay happens only on the first evaluation.rcheckers+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.opqrpoqr NoneQ stst None[ ucheckersCGenerates a 'non space' character, i.e. any ascii except ' ', '\t', '\n' and '\r'.vcheckers8Generates any whitespace character, including new lines.wcheckers0Generates a whitespace charecter, not a newline.xcheckersGenerates either a '\n' or '\r'.ycheckers)Generates any lower case alpha character.zcheckers)Generates any upper case alpha character.{checkersGenerates a digit character.|checkers&Generates one or other of '(' and ')'.}checkers&Generates one or other of '[' and ']'.~checkers&Generates one or other of '{' and '}'.checkersGenerates one of Ž, Ż, °, ą, ˛, ł, '|' and #. uvwxyz{|}~ uvwxyz{|}~None[¤& stuvwxyz{|}~ (c) Conal Elliott 2008BSD3conal@conal.net experimentalNone>HSUVXY€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 bƒcheckersThe 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 J.‡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 properties‘checkersThe 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.4-Dd7tQEzeRMN89FLIVRSGJlTest.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-JmShDDDEHjQJVh0RGoNSDcTest.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 denotationFor 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(,)(,) $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.4-LTbL4Vb65Vv4vOsyKPU0ekData.Functor.Bind.ClassApply ApplicativeMonad Data.Foldablefoldl'foldr'