i<a!      !"#$%&'()*+,-./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 { | } ~  ?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    experimentalconal@conal.netB !"Like $" but for unary type constructors. #$%& Explicit  dictionary. Doesn't have to correspond to an  actual  instance, though see E. '(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 0Named batch of tests 1 Named test 2.Flatten a test batch for inclusion in another 3Run a batch of tests. See 4 and 5. 4Check a batch tersely. 5Check a batch verbosely. 67f is a left inverse of g . See also 8. 8f is a left and right inverse of g . See also 7. 9For  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  rel fairly often. ?(Has a given left identity, according to '(=-=)' @)Has a given right identity, according to '(=-=)' A2Has a given left and right identity, according to '(=-=)' BAssociative, according to '(=-=)' CCommutative, according to '(=-=)' DCommutative, according to '(=-=)' E dictionary built from the  methods. F;Monoid dictionary for an unwrapped endomorphism. See also E  and . GCHomomorphism properties with respect to given monoid dictionaries.  See also monoidMorphism. HThe unary function f is idempotent, i.e.,  f . f == f IA binary function op is idempotent, i.e., x op x == x , for all x JA binary function op is has an idempotent element x, i.e.,  x op x == x KLMNOPQR.Generates a value that satisfies a predicate. S6Tries to generate a value that satisfies a predicate. TGenerate n arbitrary values U"Produce n values from a generator VProperty conjunction W= !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVW=102345W/.678-,+*()9';<=>?@ABDC&EFGHIJ$%KLMNOP:"#! RSTUVQ=  !"##$%%&'())*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYXYXYXY Z Generates a ' non space'" character, i.e. any ascii except  ' ', '\t', '\n' and '\r'. [9Generates any whitespace character, including new lines. \1Generates a whitespace charecter, not a newline. ]Generates either a '\n' or '\r'. ^*Generates any lower case alpha character. _*Generates any upper case alpha character. `Generates a digit character. aGenerates one or other of '(' and ')'. bGenerates one or other of '[' and ']'. cGenerates one or other of '{' and '}'. dGenerates one of , , , , , , '|' and '#'. Z[\]^_`abcd Z[\]^_`abcd Z[\]^_`abcd& XYZ[\]^_`abcd  experimentalconal@conal.neteTotal ordering. gen a ought to generate values b satisfying a  rel b fairly often. fTotal ordering gProperties to check that the  a satisfies the monoid H properties. The argument value is ignored and is present only for its  type. h*Monoid homomorphism properties. See also G. ijkProperties to check that the  m satisfies the functor  properties. l. morphism (natural transformation) properties mnProperties to check that the  m satisfies the monad  properties o morphism properties pqProperties to check that the  m satisfies the monad properties r*Law for monads that are also instances of . st morphism properties  morphism properties uv5Laws for MonadPlus instances with left distribution. w.Laws for MonadPlus instances with left catch. xyzefghijklmnopqrstuvwxyzefghiklmjnopqtursxyzvwefghijklmnopqrstuvwxyz  experimentaldavid@sankelsoftware.com{DIs the given function commutative when restricted to the same value  but possibly different times? |DIs the given function associative when restricted to the same value  but possibly different times? } Delay a value'1s availability by the given duration in seconds. ; Note that the delay happens only on the first evaluation. ~+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. {|}~|{}~{|}~ !"#$%&'()*+,--.//0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghi j k l m n o p q r s t u v w x y z { | } ~  6  checkers-0.1.2Test.QuickCheck.Instances.TupleTest.QuickCheck.BottomsTest.QuickCheck.Instances.OrdTest.QuickCheck.Instances.NumTest.QuickCheck.Instances.ListTest.QuickCheck.Instances.MaybeTest.QuickCheck.CheckersTest.QuickCheck.Instances.EqTest.QuickCheck.Instances.CharTest.QuickCheck.ClassesTest.QuickCheck.LaterTest.QuickCheck.Instances.WordTest.QuickCheck.Instances.IntTest.QuickCheck.Instances.ArrayControl.Monad.ExtensionsTest.QuickCheck.ApplicativeTest.QuickCheck.Instances>*<>**<>***<>****<bottom infiniteComp greaterThanlessThan nonNegativepositive nonPositivenegativenonZerononZero_nonEmptyanyList infiniteList setLength increasing increasingInf nondecreasingnondecreasingInf decreasing decreasingInf nonincreasingnonincreasingInfmaybeGen NonNegative unNonNegativeNonZero unNonZeroPositiveModel1model1ModelmodelMonoidDBinRelEqProp=-=TOrdTNumTFracTBinopUnop TestBatchTestunbatch checkBatch quickBatch verboseBatchgenRinverseLinverseeqeqModels reflexive transitive symmetric antiSymmetricleftIdrightIdbothIdisAssoccommutesisCommutmonoidD endoMonoidD homomorphism idempotent idempotent2idemElemmeqmeq1meq2meq3meq4meq5arbitrarySatisfyingsuchThat suchThatMaybearbsgens.&.probablisticPureCheck notEqualTonotOneofnonSpace whitespacespacenewline lowerAlpha upperAlphanumeric parenthesisbracketbraceoperatorordRelordmonoidmonoidMorphismsemanticMonoid functorMonoidfunctorfunctorMorphismsemanticFunctor applicativeapplicativeMorphismsemanticApplicativemonad monadFunctormonadApplicative monadMorphism semanticMonad monadPlusmonadOrarrow arrowChoice traversable isCommutTimes isAssocTimesdelay delayForeverhangbaseGHC.Err undefinedhangIO satisfiesMif'sumA monotonic_ monotonic Data.MonoidMonoid GHC.ClassesOrdGHC.NumNumGHC.Real FractionalpadToquick'verbose'EqEndoprobablisticPureTestsletters*/-+<>GHC.BaseFunctorControl.Applicative ApplicativeMonaddelayP eventually