úÎuºlt–      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ _ ` 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 { | } ~  € ‚ ƒ „ … † ‡ ˆ ‰ Š ‹ Œ Ž ‘ ’ “ ” • (c) Andy Gill 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimentalportableSafeSafe>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.    Safe    Safe   (c) Conal Elliott 2007,2008BSD3conal@conal.net experimentalNone 9:;<=?IT% Like ! but for unary type constructors. Explicit –7 dictionary. Doesn't have to correspond to an actual – instance, though see 1.RTypes of values that can be tested for equality, perhaps through random sampling."Token uninteresting type for testsToken — type for testsToken ˜ type for testsToken ™ type for tests+Binary function, handy for type annotations*Unary function, handy for type annotationsNamed batch of tests Named test-Flatten a test batch for inclusion in anotherRun a batch of tests. See  and  .Check a batch tersely. Check a batch verbosely."f is its own inverse. See also $.#f is a left inverse of g . See also $.$f is a left and right inverse of g . See also #.%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.+/Has a given left identity, according to '(=-=)',0Has a given right identity, according to '(=-=)'-9Has a given left and right identity, according to '(=-=)'.!Associative, according to '(=-=)'/!Commutative, according to '(=-=)'0!Commutative, according to '(=-=)'1– dictionary built from the – methods.2;Monoid dictionary for an unwrapped endomorphism. See also 1 and ›.3MHomomorphism properties with respect to given monoid dictionaries. See also monoidMorphism.4The unary function f is idempotent, i.e.,  f . f == f5A binary function op is idempotent, i.e., x op x == x , for all x6A binary function op is has an idempotent element x , i.e., x op x == x>Generate n arbitrary values?!Produce n values from a generatorO œ žŸ!"#$%&'()*+,-./0123456789:;<=>? ¡@ABCDEFGHIJKLMNOPQRSTU4  !"#$%&'()*+,-./0123456789:;<=>?4 !"#$%'()*+,-.0/123456789:;<& >?=K œ žŸ!"#$%&'()*+,-./0123456789:;<=>? ¡@ABCDEFGHIJKLMNOPQRSTU4(c) David Sankel 2008BSD3david@sankelsoftware.com experimentalNoneVbIs the given function commutative when restricted to the same value but possibly different times?WbIs the given function associative when restricted to the same value but possibly different times?XyDelay a value's availability by the given duration in seconds. Note that the delay happens only on the first evaluation.Y+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.¢VW£XYVWXYWVXY¢VW£XYNone¤Never yield an answer. Like ¥] or 'error "whatever"', but don't raise an error, and don't consume computational resources.¦ Block foreverZ[¤¦Z[Z[Z[¤¦Safe§¨§¨§¨None\]\]\]\] None ^CGenerates a 'non space' character, i.e. any ascii except ' ', '\t', '\n' and '\r'._8Generates any whitespace character, including new lines.`0Generates a whitespace charecter, not a newline.aGenerates either a '\n' or '\r'.b)Generates any lower case alpha character.c)Generates any upper case alpha character.dGenerates a digit character.e&Generates one or other of '(' and ')'.f&Generates one or other of '[' and ']'.g&Generates one or other of '{' and '}'.hGenerates one of ©, ª, «, ¬, ­, ®, '|' and #. ^_`a¯bcdefgh ^_`abcdefgh ^_`abcdefgh ^_`a¯bcdefgh (c) Conal Elliott 2008BSD3conal@conal.net experimentalNone:DOQRTiTotal ordering. gen a ought to generate values b satisfying a rel b fairly often.jTotal orderingk— 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 blThe semantic function () for a is an k.mProperties to check that the – ad satisfies the monoid properties. The argument value is ignored and is present only for its type.n*Monoid homomorphism properties. See also 3.oThe semantic function () for a is a n.qProperties to check that the ° m# satisfies the functor properties.r°- morphism (natural transformation) propertiessThe semantic function () for f is a r.tProperties to check that the ± m& satisfies the applicative propertiesu± morphism propertiesvThe semantic function () for f is an u.wProperties to check that the ² m satisfies the monad propertiesx*Law for monads that are also instances of °.z² morphism properties± morphism properties{The semantic function () for f is a z.|4Laws for MonadPlus instances with left distribution.}-Laws for MonadPlus instances with left catch.~Check Alternative Monoid lawsijklmnopqrstuvwxyz{|}~€ijklmnopqrstuvwxyz{|}~€ijklmnoqrsptuvwz{xy€|}~ijklmnopqrstuvwxyz{|}~€ Safe‚ƒ„…†‡‚ƒ„…†‡‚„…ƒ†‡‚ƒ„…†‡ 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 valuesŽGenerate nondecreasing values1Generate an infinite list of nondecreasing values$Generate increasing towards infinity‘.Generate an infinite list of increasing values’Generate nondecreasing values“1Generate an infinite list of nondecreasing valuesˆ‰Š‹³´µŒŽ‘’“ ˆ‰Š‹ŒŽ‘’“ ‰ˆŠ‹ŒŽ’‘“ˆ‰Š‹³´µŒŽ‘’“ Safe”•”•”•”•None& \]^_`abcdefgh‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•¶ !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmno p q r s t u v w x y z { | } ~  € ‚ ƒ „ … † ‡ ˆ ‰ Š ‹ Œ Ž ‘ ’ “ ” • – — ˜ ™ š › œ ž Ÿ   ¡ ¢ £ ¤ ¥ ¦ §¨©ª«¬­¨®¯¨°±«¬²¨³´#µ¶·¸¹º»¼¨½¾¿ÀÁ¨®Â¨°Ã¨®Ä¨®Å«¬Æ«¬Ç Ȩ©ɨ©ʨ©Ë Ì Í ÎÏ%checkers-0.4.7-GB0fvxAQ7AsHraq90XiDc7Test.QuickCheck.CheckersTest.QuickCheck.UtilsTest.QuickCheck.Instances.TupleTest.QuickCheck.Instances.MaybeTest.QuickCheck.Instances.ArrayTest.QuickCheck.LaterTest.QuickCheck.BottomsTest.QuickCheck.Instances.EqTest.QuickCheck.Instances.CharTest.QuickCheck.ClassesTest.QuickCheck.Instances.NumTest.QuickCheck.Instances.ListTest.QuickCheck.Instances.OrdControl.Monad.ExtensionsTest.QuickCheck.Instances*QuickCheck-2.10.0.1-ALuGysu7txTB2VnkPyDuTqTest.QuickCheck.Property.&.isAssociativeBy isAssociativeisCommutableBy isCommutable isTotalOrder>*<>**<>***<>****<maybeGen$fCoArbitraryArray$fArbitraryArrayModel1model1ModelmodelMonoidDBinRelEqProp=-=TOrdTNumTFracTBinopUnop TestBatchTestunbatch checkBatch quickBatch verboseBatchgenR involutioninverseLinverseeqeqModels reflexive transitive symmetric antiSymmetricleftIdrightIdbothIdisAssoccommutesisCommutmonoidD endoMonoidD homomorphism idempotent idempotent2idemElemmeqmeq1meq2meq3meq4meq5arbitrarySatisfyingarbsgens $fTestable(,) $fTestable[] $fModel(,)(,) $fModel[][]$fModelDoubleDouble$fModelFloatFloat $fModelIntInt$fModelCharChar$fModelBoolBool $fEqProp(->)$fEqPropEither $fEqProp(,,,) $fEqProp(,,) $fEqProp(,) $fEqPropMaybe $fEqProp[]$fEqPropDouble $fEqPropFloat $fEqPropInt $fEqPropChar $fEqPropBool $fEqProp() isCommutTimes isAssocTimesdelay delayForeverbottom infiniteComp notEqualTonotOneofnonSpace whitespacespacenewline lowerAlpha upperAlphanumeric parenthesisbracketbraceoperatorordRelord ordMorphism semanticOrdmonoidmonoidMorphismsemanticMonoid functorMonoidfunctorfunctorMorphismsemanticFunctor applicativeapplicativeMorphismsemanticApplicativemonad monadFunctormonadApplicative monadMorphism semanticMonad monadPlusmonadOr alternativearrow arrowChoice traversable nonNegativepositive nonPositivenegativenonZerononZero_nonEmptyanyList infiniteList setLength increasing increasingInf nondecreasingnondecreasingInf decreasing decreasingInf nonincreasingnonincreasingInf greaterThanlessThanbaseGHC.BaseMonoidghc-prim GHC.ClassesOrdGHC.NumNumGHC.Real FractionalEq Data.MonoidEndopadToquick'verbose'randgeneratedelayP eventuallyhangGHC.Err undefinedhangIO satisfiesMif'*/-+<>lettersFunctor ApplicativeMonadsumA monotonic_ monotonic