5-r/      !"#$%&'()*+,-.None2:BOT*A set of laws associated with a typeclass.+Name of the typeclass whose laws are testedPairs of law name and propertyA 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 IsomorphismfromList . toList "a idLength Preservation&fromList xs "a fromListN (length xs) xs 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 == aSome 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:  Transitivea "d b "' b "d c ! a "d c Comparable 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 a Test that a / instance obey the several laws.+Tests the following applicative properties: Identity0 1 "a 1 Compositionfmap (f . g) "a 0 f . 0 gConst(<$) "a 0 2+Tests the following applicative properties: Identity3 1 4 v "a v Composition3 (.) 4 u 4 v 4 w "a u 4 (v 4 w) Homomorphism3 f 4 3 x "a 3 (f x) Interchangeu 4 3 y "a 3 (5 y) 4 u LiftA2 (1)(4) "a 6 1'Tests the following monadic properties:  Left Identity7 a 8 k "a k aRight Identitym 8 7 "a m Associativitym 8 (\x -> k x 8 h) "a (m 8 k) 8 hReturn3 "a 7Ap(4) "a 9Tests the following : properties: fold; "a < 1foldMap< f "a = (> . f) ?foldr= f z t "a @ (< (A . f) t ) zfoldr'B f z0 xs = let f' k x z = k C f x z in D f' 1 xs z0foldlD f z t "a @ (E (< (F . A . G f) t)) zfoldl'H f z0 xs = let f' x k z = k C f z x in = f' 1 xs z0toListI "a = (:) []nullJ "a = (2 (2 K)) LlengthM "a getSum . foldMap (2 (N 1))%Note that this checks to ensure that foldl' and foldr' are suitably strict.wOPQRSTUVWXYZ[\]^_`abcdefg/Element is type name paired with typeclass lawsh ijklmnopqrstuvwxyz{|}~ !"#$%&'  eOPQRSTUVWXYZ[\]^_`abcdefgh ijklmnopqrstuvwxyz{|}~ !"#$%&'      !"#$%&'()*+,-./01234534634734834934:34;34<34=34>3?@3?A3?B3?C34D34E3FG3FH3?I34J3?K3FL3FM34N3?O3?P3?QRSTRSU3?V3FWXXYYZZ[[\]^^_`abccddeefghijklmnopqrstuvwxyz{|}~/quickcheck-classes-0.3.1-GDhtWyxgEZhAGDbJjsFg0zTest.QuickCheck.ClassesLaws lawsTypeclasslawsProperties lawsCheck lawsCheckManyjsonLaws isListLaws showReadLaws semigroupLawseqLawsordLaws monoidLawscommutativeMonoidLawsprimLaws storableLaws functorLawsapplicativeLaws monadLaws foldableLaws$fArbitraryApply $fShowApply$fArbitraryEquationTwo$fShowEquationTwo$fArbitraryEquation$fShowEquation$fArbitraryLinearEquation$fArbitraryLinearEquationM$fShowLinearEquationM$fEqLinearEquationM $fEqApply$fArbitraryBottom$fArbitraryLastNothing$fArbitraryChooseFirst$fArbitraryChooseSecond $fShowBottom$fShowLastNothing$fShowChooseSecond$fShowChooseFirst$fMonoidStatus$fEqChooseSecond$fEqChooseFirst$fEqLastNothing $fEqBottom$fEqLinearEquation $fEqEquation$fEqEquationTwo(primitive-0.6.2.0-4578caNkWQ54Gt1mxLF2YhData.Primitive.TypesPrimbaseGHC.Basefmapidconstpure<*>$liftA2return>>=ap Data.FoldableFoldablefoldfoldMapfoldrmappendmempty Data.MonoidappEndoEndofoldr'$!foldlgetDualDualflipfoldl'toListnullghc-prim GHC.TypesFalseTruelengthSum EquationTwoEquationLinearEquationMLinearEquation_linearEquationLinear_linearEquationConstantApplygetApplyBottomBottomUndefined BottomValue LastNothing ChooseFirst ChooseSecondStatusBadGood foldlMapMisListPartialIsomorphismisListLengthPreservationshowReadPartialIsomorphismjsonEncodingEqualsValuejsonEncodingPartialIsomorphism eqTransitive ordTransitive ordComparable eqSymmetric eqReflexivesemigroupAssociativemonoidAssociativemonoidLeftIdentitymonoidRightIdentitymonoidCommutativeprimListByteArray primListAddrprimSetGetByteArrayprimGetSetByteArrayprimSetSetByteArrayprimSetGetAddrprimGetSetAddrstorableSetGetstorableGetSet storableListarrayEqfoldableLawsInternalfoldableFoldl'foldableFoldr' bottomToMaybe maybeToBottomrunLinearEquationrunLinearEquationM showLinearshowLinearList runEquationrunEquationTwofunctorIdentityfunc1func2functorComposition functorConstapplicativeIdentityapplicativeCompositionapplicativeHomomorphismapplicativeInterchangeapplicativeLiftA2_1monadLeftIdentitymonadRightIdentitymonadAssociativity monadReturnmonadApmyForAllShrink