tkX       ! " #$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTU 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 { | } ~  Safe-Inferred Safe-Inferred Safe-Inferred>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-Inferred Safe-Inferred     Safe-Inferred Safe-Inferred 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 valuesGenerate nondecreasing values1Generate an infinite list of nondecreasing values$Generate increasing towards infinity.Generate an infinite list of increasing valuesGenerate nondecreasing values1Generate an infinite list of nondecreasing values  NoneNever yield an answer. Like ] or 'error "whatever"', but don't raise an error, and don't consume computational resources. Block forever (c) Andy Gill 2001/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimentalportable Safe-Inferred !" !" !" !"(c) Conal Elliott 2007,2008BSD3conal@conal.net experimentalNone 23468BM$#Like %! but for unary type constructors.' Explicit 7 dictionary. Doesn't have to correspond to an actual  instance, though see F.)RTypes 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 annotations0*Unary function, handy for type annotations1Named batch of tests2 Named test3-Flatten a test batch for inclusion in another4Run a batch of tests. See 5 and 6.5Check a batch tersely.6Check a batch verbosely.8f is a left inverse of g . See also 9.9f is a left and right inverse of g . See also 8.: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 '(=-=)'A0Has a given right identity, according to '(=-=)'B9Has a given left and right identity, according to '(=-=)'C!Associative, according to '(=-=)'D!Commutative, according to '(=-=)'E!Commutative, according to '(=-=)'F dictionary built from the  methods.G;Monoid dictionary for an unwrapped endomorphism. See also F and .HMHomomorphism properties with respect to given monoid dictionaries. See also monoidMorphism.IThe unary function f is idempotent, i.e.,  f . f == fJA binary function op is idempotent, i.e., x op x == x , for all xKA binary function op is has an idempotent element x , i.e., x op x == xSGenerate n arbitrary valuesT!Produce n values from a generatorM#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRST3#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRST32134560/789.-,+)*:(<=>?@ABCED'FGHIJK%&LMNOPQ;#$STRI#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRST* NoneUVUVUVUV None WCGenerates a 'non space' character, i.e. any ascii except ' ', '\t', '\n' and '\r'.X8Generates any whitespace character, including new lines.Y0Generates a whitespace charecter, not a newline.ZGenerates either a '\n' or '\r'.[)Generates any lower case alpha character.\)Generates any upper case alpha character.]Generates a digit character.^&Generates one or other of '(' and ')'._&Generates one or other of '[' and ']'.`&Generates one or other of '{' and '}'.aGenerates one of , , , , , , '|' and '#'. WXYZ[\]^_`a WXYZ[\]^_`a WXYZ[\]^_`a WXYZ[\]^_`a (c) Conal Elliott 2008BSD3conal@conal.net experimentalNone3=HJKMbTotal ordering. gen a ought to generate values b satisfying a rel b fairly often.cTotal orderingd 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 beThe semantic function (&) for a is an d.fProperties to check that the  ad satisfies the monoid properties. The argument value is ignored and is present only for its type.g*Monoid homomorphism properties. See also H.hThe semantic function (&) for a is a g.jProperties to check that the  m# satisfies the functor properties.k- morphism (natural transformation) propertieslThe semantic function ($) for f is a k.mProperties to check that the  m satisfies the monad propertiesn morphism propertiesoThe semantic function ($) for f is an n.pProperties to check that the  m satisfies the monad propertiesq*Law for monads that are also instances of .s morphism properties morphism propertiestThe semantic function ($) for f is a s.u4Laws for MonadPlus instances with left distribution.v-Laws for MonadPlus instances with left catch.wCheck Alternative Monoid lawsbcdefghijklmnopqrstuvwxyzbcdefghijklmnopqrstuvwxyzbcdefghjklimnopstqrxyzuvwbcdefghijklmnopqrstuvwxyzNone& UVWXYZ[\]^_`a (c) David Sankel 2008BSD3david@sankelsoftware.com experimentalNone{bIs the given function commutative when restricted to the same value but possibly different times?|bIs the given function associative when restricted to the same value but possibly different times?}yDelay a value's 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 hang8 from unamb, but replicated to avoid mutual dependency.CTODO: Remove when this module is moved into the unamb-test package.{|}~{|}~|{}~{|}~ !"#$%&'()*+,-./ 0 1 2 3 456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdef g h i j k l m n o p q r s t u v w x y z { | } ~  9  checkers-0.4.3Test.QuickCheck.CheckersTest.QuickCheck.Instances.ArrayTest.QuickCheck.Instances.TupleTest.QuickCheck.Instances.OrdTest.QuickCheck.Instances.NumTest.QuickCheck.Instances.MaybeTest.QuickCheck.Instances.ListTest.QuickCheck.BottomsTest.QuickCheck.UtilsTest.QuickCheck.Instances.EqTest.QuickCheck.Instances.CharTest.QuickCheck.ClassesTest.QuickCheck.LaterControl.Monad.ExtensionsTest.QuickCheck.InstancesQuickCheck-2.8.1Test.QuickCheck.Property.&.$fCoArbitraryArray$fArbitraryArray>*<>**<>***<>****< greaterThanlessThan nonNegativepositive nonPositivenegativenonZerononZero_maybeGennonEmptyanyList infiniteList setLength increasing increasingInf nondecreasingnondecreasingInf decreasing decreasingInf nonincreasingnonincreasingInfbottom infiniteCompisAssociativeBy 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 monadPlusmonadOr alternativearrow arrowChoice traversable isCommutTimes isAssocTimesdelay delayForever satisfiesMif'sumA monotonic_ monotonichangbaseGHC.Err undefinedhangIO Data.MonoidMonoidghc-prim GHC.ClassesOrdGHC.NumNumGHC.Real FractionalEqEndopadToquick'verbose'randgenerate $fTestable(,) $fTestable[] $fModel(,)(,) $fModel[][]$fModelDoubleDouble$fModelFloatFloat $fModelIntInt$fModelCharChar$fModelBoolBool $fEqProp(->)$fEqPropEither $fEqProp(,,,) $fEqProp(,,) $fEqProp(,) $fEqPropMaybe $fEqProp[]$fEqPropDouble $fEqPropFloat $fEqPropInt $fEqPropChar $fEqPropBool*/-+<>lettersGHC.BaseFunctorControl.Applicative ApplicativeMonaddelayP eventually