úÎ léeˆ{      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQR S T U V 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  {|{|?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.     }Never yield an answer. Like ~ or 'error whatever', but  don't raise an error, and don'#t consume computational resources. Block forever     AGenerates a non-empty list with the contents generated using its  argument. FGenerates any list (possibly empty) with the contents generated using  its argument. FGenerates 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 values 2Generate an infinite list of nondecreasing values %Generate increasing towards infinity /Generate an infinite list of increasing values Generate nondecreasing values 2Generate an infinite list of nondecreasing values   portable experimentallibraries@haskell.org experimentalconal@conal.net$ Like "" but for unary type constructors. $ Explicit € dictionary. Doesn't have to correspond to an  actual € instance, though see C. &ATypes 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 annotations -+Unary function, handy for type annotations .Named batch of tests / Named test 0.Flatten a test batch for inclusion in another 1Run a batch of tests. See 2 and 3. 2Check a batch tersely. 3Check a batch verbosely. 5f is a left inverse of g . See also 6. 6f is a left and right inverse of g . See also 5. 7For „ types as & types 9Reflexive 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 '(=-=)' >)Has a given right identity, according to '(=-=)' ?2Has a given left and right identity, according to '(=-=)' @Associative, according to '(=-=)' ACommutative, according to '(=-=)' BCommutative, according to '(=-=)' C€ dictionary built from the € methods. D;Monoid dictionary for an unwrapped endomorphism. See also C  and …†. ECHomomorphism properties with respect to given monoid dictionaries.  See also monoidMorphism. FThe unary function f is idempotent, i.e.,  f . f == f GA binary function op is idempotent, i.e., x op x == x , for all x HA binary function op is has an idempotent element x, i.e.,  x op x == x PGenerate n arbitrary values Q"Produce n values from a generator 3‡ !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQ2/.0123-,456+*)(&'7%9:;<=>?@BA$CDEFGH"#IJKLMN8 !PQO2 !!"##$%&''()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQ RSRSRS T Generates a ' non space'" character, i.e. any ascii except  ' ', '\t', '\n' and '\r'. U9Generates any whitespace character, including new lines. V1Generates a whitespace charecter, not a newline. WGenerates either a '\n' or '\r'. X*Generates any lower case alpha character. Y*Generates any upper case alpha character. ZGenerates a digit character. [Generates one or other of '(' and ')'. \Generates one or other of '[' and ']'. ]Generates one or other of '{' and '}'. ^Generates one of ˆ, ‰, Š, ‹, Œ, , '|' and '#'. TUVWXYZ[\]^ TUVWXYZ[\]^ TUVWXYZ[\]^  experimentalconal@conal.net_Total ordering. gen a ought to generate values b satisfying a  rel b fairly often. `Total ordering a morphism properties. h is an  morphism iff:  a <= b = h a <= h b  " h (a `min` b) = h a `min` h b " h (a `max` b) = h a `max` h b bThe semantic function (#) for a is an a . cProperties to check that the € a satisfies the monoid H properties. The argument value is ignored and is present only for its  type. d*Monoid homomorphism properties. See also E. fThe semantic function (#) for a is a d . gProperties to check that the Ž m satisfies the functor  properties. hŽ. morphism (natural transformation) properties iThe semantic function (!) for f is a h . jProperties to check that the  m satisfies the monad  properties k morphism properties lThe semantic function (!) for f is an k . mProperties to check that the  m satisfies the monad properties n*Law for monads that are also instances of Ž. p morphism properties  morphism properties qThe semantic function (!) for f is a p . r5Laws for MonadPlus instances with left distribution. s.Laws for MonadPlus instances with left catch. _`abcdefghijklmnopqrstuv_`abcdeghifjklmpqnotuvrs_`abcdefghijklmnopqrstuv& RSTUVWXYZ[\]^  experimentaldavid@sankelsoftware.comwDIs the given function commutative when restricted to the same value  but possibly different times? xDIs the given function associative when restricted to the same value  but possibly different times? y Delay a value'1s availability by the given duration in seconds. ; Note that the delay happens only on the first evaluation. z+A value that is never available. Rerun of hang from unamb, but ( replicated to avoid mutual dependency. DTODO: Remove when this module is moved into the unamb-test package. wxyzxwyzwxyz‘ !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijk l m n o p q r s t u v w x y z { | } ~  € ‚ ƒ „ … † ‡ ˆ ‰ Š ‹ Œ Ž ‘ ’ “ ” • –—˜™š›œžŸ ¡œ¢££¤¥¦ž§ ¨ž©žªœ«œ¬­®¯­°± checkers-0.2Test.QuickCheck.Instances.TupleTest.QuickCheck.Instances.OrdTest.QuickCheck.Instances.NumTest.QuickCheck.BottomsTest.QuickCheck.Instances.ListTest.QuickCheck.Instances.MaybeTest.QuickCheck.UtilsTest.QuickCheck.CheckersTest.QuickCheck.Instances.EqTest.QuickCheck.Instances.CharTest.QuickCheck.ClassesTest.QuickCheck.LaterControl.Monad.ExtensionsTest.QuickCheck.Instances.WordTest.QuickCheck.Instances.IntTest.QuickCheck.Instances.ArraybasePreludeTest.QuickCheck.Applicative Data.MonoidData.OrdData.Eq Control.MonadControl.ApplicativeTest.QuickCheck.Instances>*<>**<>***<>****< greaterThanlessThan nonNegativepositive nonPositivenegativenonZerononZero_bottom infiniteCompnonEmptyanyList infiniteList setLength increasing increasingInf nondecreasingnondecreasingInf decreasing decreasingInf nonincreasingnonincreasingInfmaybeGenisAssociativeBy isAssociativeisCommutableBy isCommutable isTotalOrderModel1model1ModelmodelMonoidDBinRelEqProp=-=TOrdTNumTFracTBinopUnop TestBatchTestunbatch checkBatch quickBatch verboseBatchgenRinverseLinverseeqeqModels reflexive transitive symmetric antiSymmetricleftIdrightIdbothIdisAssoccommutesisCommutmonoidD endoMonoidD homomorphism idempotent idempotent2idemElemmeqmeq1meq2meq3meq4meq5arbitrarySatisfyingarbsgens notEqualTonotOneofnonSpace whitespacespacenewline lowerAlpha upperAlphanumeric parenthesisbracketbraceoperatorordRelord ordMorphism semanticOrdmonoidmonoidMorphismsemanticMonoid functorMonoidfunctorfunctorMorphismsemanticFunctor applicativeapplicativeMorphismsemanticApplicativemonad monadFunctormonadApplicative monadMorphism semanticMonad monadPlusmonadOrarrow arrowChoice traversable isCommutTimes isAssocTimesdelay delayForever satisfiesMif'hangGHC.Err undefinedhangIOMonoid GHC.ClassesOrdGHC.NumNumGHC.Real FractionalEqEndoQuickCheck-2.1.0.1Test.QuickCheck.Property.&.*/-+<>GHC.BaseFunctor ApplicativeMonad