h$+&       ! " #$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~                                                        Safe-InferredNone Safe-Inferred Safe-Inferred Safe-Inferred    Safe-InferredS checkersGenerates a non-empty list with the contents generated using its argument. checkersGenerates any list (possibly empty) with the contents generated using its argument.checkersGenerates 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-Inferred Safe-Inferredcheckers>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 experimentalportable Safe-Inferred  !" !"(c) Conal Elliott 2007,2008BSD3conal@conal.net experimentalNone9>?%#checkersLike %! but for unary type constructors.'checkers Explicit 7 dictionary. Doesn't have to correspond to an actual  instance, though see H.)checkersTypes 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 another5checkersCheck 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 `=` 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 *Ccheckers)Has a given right identity, according to *Dcheckers2Has a given left and right identity, according to *EcheckersAssociative, according to *FcheckersCommutative, according to *GcheckersCommutative, according to *Hcheckers dictionary built from the  methods.Icheckers;Monoid dictionary for an unwrapped endomorphism. See also H and .JcheckersHomomorphism 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 experimentalNonecheckersIs the given function commutative when restricted to the same value but possibly different times?checkersIs the given function associative when restricted to the same value but possibly different times?checkersDelay a value's availability by the given duration in seconds. Note that the delay happens only on the first evaluation.checkers+A value that is never available. Rerun of hang8 from unamb, but replicated to avoid mutual dependency.TODO: Remove when this module is moved into the unamb-test package. None None checkersGenerates a 'non space' character, i.e. any ascii except ' ', 't', 'n' and 'r'.checkers8Generates any whitespace character, including new lines.checkers0Generates a whitespace charecter, not a newline.checkersGenerates either a 'n' or 'r'.checkers)Generates any lower case alpha character.checkers)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 #.  None2&  (c) Conal Elliott 2008BSD3conal@conal.net experimentalNone?&#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:  a <= b = h a <= h b h (a `min` b) = h a `min` h b h (a `max` b) = h a `max` h bcheckersThe semantic function (&) for a is an .checkersProperties to check that the  a satisfies the monoid properties. The argument value is ignored and is present only for its type.checkersProperties to check that the  a 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) propertiescheckersThe semantic function ($) for f is a .checkersProperties to check that the  m satisfies the apply propertiescheckers morphism propertiescheckersThe semantic function ($) for f is an .checkersProperties to check that the  m& satisfies the applicative propertiescheckers morphism propertiescheckersThe semantic function ($) for f is an .checkersProperties to check that the  m satisfies the bind propertiescheckers morphism propertiescheckersThe semantic function ($) for f is a .checkersProperties to check that the  m satisfies the monad propertiescheckers*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 propertiescheckersThe semantic function ($) for f is a .checkers4Laws for MonadPlus instances with left distribution.checkers-Laws for MonadPlus instances with left catch.checkersCheck Alt Semigroup lawcheckersCheck Alternative Monoid laws checkers Note that ! doesn't check the strictness of ,  and . checkers&& !"#$%&'()*+,-./ 0 1 2 3 456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~                                                       %checkers-0.5.7-9PT3tfUdn9IHrLPyONjIazTest.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.14.2-6vGnep5JveBx6Bsl9Nf1tTest.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[] $fGEqPropV1 $fGEqPropU1 $fGEqProp:+: $fGEqProp:*: $fGEqPropM1 $fEqProp-> $fEqPropProxy $fEqPropConst$fEqPropIdentity$fEqPropProduct $fEqPropSum$fEqPropCompose$fEqPropEither $fEqProp(,,,) $fEqProp(,,) $fEqProp(,) $fEqPropMaybe$fEqPropZipList$fEqPropNonEmpty $fEqProp[] $fEqPropAp $fEqPropAlt$fEqPropProduct0 $fEqPropSum0 $fEqPropAny $fEqPropAll $fEqPropEndo $fEqPropDual $fEqPropLast $fEqPropFirst $fEqPropMax $fEqPropMin $fEqPropRatio$fEqPropComplex$fEqPropInteger$fEqPropDouble $fEqPropFloat $fEqPropInt$fEqPropOrdering $fEqPropChar $fEqPropBool $fEqProp() $fGEqPropK1 $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 bifoldablebifoldableBifunctor satisfiesMif'baseGHC.BaseMonoidghc-prim GHC.ClassesOrdGHC.NumNumGHC.Real FractionalEqData.Semigroup.InternalEndo*/-+<> SemigroupFunctor*semigroupoids-5.3.7-7QWsfMRZ3AC5p6BEp1RaRwData.Functor.Bind.ClassApply ApplicativeMonad Data.Foldablefoldl'foldr'foldMap'