úÎmYd!T      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSNone 3<DFQTVXþ*A set of laws associated with a typeclass.+Name of the typeclass whose laws are testedPairs of law name and property¶A convenience function for working testing properties in GHCi. See the test suite of this library for an example of how to integrate multiple properties into larger test suite.VA convenience function for checking multiple typeclass instances of multiple types.Tests the following properties: Partial Isomorphismdecode . encode "a JustEncoding Equals Valuedecode . encode "a Just . toJSON9Note that in the second propertiy, the type of decode is ByteString -> Value, not ByteString -> aTests the following properties: Partial IsomorphismfromList . toList "a idLength Preservation&fromList xs "a fromListN (length xs) xsNote:2 This property test is only available when using base-4.7 or newer. Tests the following properties:  Associativea <> (b <> c) "a (a <> b) <> c Tests the following properties:  Transitivea == b "' b == c !Ò a == c Symmetrica == b !Ò b == a Reflexivea == aûSome of these properties involve implication. In the case that the left hand side of the implication arrow does not hold, we do not retry. Consequently, these properties only end up being useful when the data type has a small number of inhabitants. Tests the following properties:  Antisymmetry@a "d b "' b "d a !Ò a = b  Transitivitya "d b "' b "d c !Ò a "d cTotality a "d b "( a > b Tests the following properties:  Associative1mappend a (mappend b c) "a mappend (mappend a b) c Left Identitymappend mempty a "a aRight Identitymappend a mempty "a a Tests everything from  monoidProps plus the following:  Commutativemappend a b "a mappend b aTests the following properties: Quotient Remainder(quot x y) * y + (rem x y) "a xDivision Modulus(div x y) * y + (mod x y) "a xInteger RoundtripfromInteger (toInteger x) "a xTests the following properties: Conjunction Idempotence n .&. n "a nDisjunction Idempotence n .|. n "a nDouble Complementcomplement (complement n) "a nSet BitsetBit n i "a n .|. bit i Clear Bit'clearBit n i "a n .&. complement (bit i)Complement Bit!complementBit n i "a xor n (bit i) Clear ZeroclearBit zeroBits i "a zeroBitsSet ZerosetBit zeroBits i "a bit i Test ZerotestBit zeroBits i "a FalsePop ZeropopCount zeroBits "a 0Count Leading Zeros of Zero,countLeadingZeros zeroBits "a finiteBitSize "¥Count Trailing Zeros of Zero-countTrailingZeros zeroBits "a finiteBitSize "¥#All of the useful instances of the T typeclass also have UL instances, so these property tests actually require that instance as well.Note:2 This property test is only available when using base-4.7 or newer. Test that a V instance obey the several laws.'Tests the following functor properties: IdentityW X "a X Compositionfmap (f . g) "a W f . W gConst(<$) "a W Y+Tests the following alternative properties: IdentityZ [ x "a x x [ Z "a x Associativitya [ (b [ c) "a (a [ b) [ c) +Tests the following applicative properties: Identity\ X ] v "a v Composition\ (.) ] u ] v ] w "a u ] (v ] w) Homomorphism\ f ] \ x "a \ (f x) Interchangeu ] \ y "a \ (^ y) ] u LiftA2 (1)(]) "a _ X#Tests the following alt properties:  Associativity(a <!> b) <!> c "a a <!> (b <!> c)Left Distributivity@f ` (a <!> b) = (f ` a) <!> (f ` b)'Tests the following monadic properties:  Left Identitya a b k "a k aRight Identitym b a "a m Associativitym b (\x -> k x b h) "a (m b k) b hReturn\ "a aAp(]) "a cTests the following d properties: foldfold "a e XfoldMape f "a f (g . f) hfoldrf f z t "a appEndo (e (Endo . f) t ) zfoldr'foldr' f z0 xs = let f' k x z = k i f x z in j f' X xs z0foldr1k! f t "a let Just (xs,x) = unsnoc (l t) in f f x xsfoldlj f z t "a appEndo (getDual (e (Dual . Endo . m f) t)) zfoldl'foldl' f z0 xs "a let f' x k z = k i f z x in f f' X xs z0foldl1n f t "a let x : xs = l t in j f x xstoListo "a f (:) []nullp "a f (Y (Y q)) rlengths "a getSum . foldMap (Y (Sum 1))%Note that this checks to ensure that foldl' and foldr' are suitably strict.Tests the following t properties:  Naturalityt . u f = u (t . f)) for every applicative transformation tIdentityu Identity = Identity Compositionu (Compose . W g . f) = Compose . W (u g) . u fSequence Naturalityt . v = v . W t) for every applicative transformation tSequence Identityv . W Identity = IdentitySequence Compositionv . W Compose = Compose . W v . vfoldMape = wfmapW = x Where an applicative transformation is a function 1t :: (Applicative f, Applicative g) => f a -> g apreserving the y operations, i.e. Identity: t (\ x) = \ xDistributivity: t (x ] y) = t x ] t yTests the following z properties: Identity{ X X "a XFirst Identity| X "a XSecond Identity} X "a XBifunctor Composition{ f g "a | f . } g NoteH: This property test is only available when this package is built with  base-4.9+ or transformers-0.5+./Element is type name paired with typeclass laws~destination pointer source arrayoffset into source arraynumber of prims to copydestination arrayoffset into destination array source arrayoffset into source arraynumber of bytes to copy€destination arrayoffset into destination array source arrayoffset into source arraynumber of bytes to copy    ‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š›œžŸ ¡¢£¤¥¦§None FQTVcÓRProperty for the generate^ function, which builds a container of a given length by applying a function to each index. Kinput element typefoldr functionLinput element typefoldl functionMinput element typemonadic foldl functionNinput element typeoutput element type map functionOinput element typeoutput element typeindexed map functionPinput element typeoutput element typemonadic indexed map functionQinput element typeoutput element typetraverse functionRinput element typeSinput element type KLMNOPQRS KLMNOPQRS¨      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXVWYZ[\V]^V]_V]`V]aV]bV]cV]dV]eV]fVghV]iV]jV]kVlmVlnVloV]pV]qV]rVlsVltVuvV]wVlxVlvVlyz{|z{}Vl~V€VV‚VƒV„V]…V†‡V†ˆV†‰V†Š‹ŒŽŽ‘‘’’““””•–——˜™™š›œžžŸŸ  ¡¡¢¢£¤¥¦§/quickcheck-classes-0.4.5-3jjEIvvjAkuJkwP63cf8sSTest.QuickCheck.ClassesTest.QuickCheck.Classes.IsListLaws lawsTypeclasslawsProperties lawsCheck lawsCheckManyjsonLaws isListLaws showReadLaws semigroupLawseqLawsordLaws monoidLawscommutativeMonoidLaws integralLawsbitsLawsprimLaws storableLaws functorLawsalternativeLawsapplicativeLawsaltLaws monadLaws foldableLawstraversableLaws bifunctorLaws$fMonoidStatus$fSemigroupStatus $fMonoidAp $fSemigroupAp$fTraversableTriple$fFoldableTriple$fApplicativeTriple$fFunctorTriple$fArbitraryTriple$fArbitrary1Triple $fShow1Triple $fEq1Triple$fArbitraryChooseSecond$fShowChooseSecond$fArbitraryChooseFirst$fShowChooseFirst$fArbitraryLastNothing$fShowLastNothing$fArbitraryBottom $fShowBottom$fArbitraryApply $fShowApply $fMonoidApply$fSemigroupApply $fEqApply$fArbitraryApply2 $fShowApply2 $fEqApply2$fArbitraryLinearEquation$fShowLinearEquation$fArbitraryLinearEquationM$fShowLinearEquationM$fEqLinearEquationM$fArbitraryEquation$fShowEquation$fArbitraryEquationTwo$fShowEquationTwo$fArbitraryBitIndex$fIsListPrimArray $fEqPrimArray $fShowTriple $fEqTriple$fEqChooseSecond$fEqChooseFirst$fEqLastNothing $fEqBottom$fEqLinearEquation $fEqEquation$fEqEquationTwo foldrProp foldlProp foldlMPropmapPropimapProp imapMProp traverseProp generateProp generateMPropbase Data.BitsBits FiniteBits(primitive-0.6.2.0-EI3NK1Xfv9zEcRtyXK2EwZData.Primitive.TypesPrimGHC.Basefmapidconstempty<|>pure<*>$liftA2 Data.Functor<$>return>>=ap Data.FoldableFoldablefoldMapfoldrmappendmempty$!foldlfoldr1GHC.ExtstoListflipfoldl1nullghc-prim GHC.TypesFalseTruelengthData.Traversable Traversabletraverse sequenceAfoldMapDefault fmapDefault ApplicativeData.Bifunctor BifunctorbimapfirstsecondcopyPrimArrayToPtrcopyMutablePrimArray copyPrimArrayMutablePrimArray PrimArrayBitIndex EquationTwoEquationLinearEquationMLinearEquation_linearEquationLinear_linearEquationConstantApply2 getApply2ApplygetApplyBottomBottomUndefined BottomValue LastNothing ChooseFirst ChooseSecondTripleApgetApStatusBadGood