Hoogle Search

Within LTS Haskell 24.9 (ghc-9.10.2)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. reflexivityOnArbitrary :: (Show a, Arbitrary a) => (a -> a -> Bool) -> Property

   genvalidity-sydtest	Test.Syd.Validity.Relations.Reflexivity

   reflexivityOnArbitrary ((<=) :: Int -> Int -> Bool)
   

   reflexivityOnArbitrary ((==) :: Int -> Int -> Bool)
   

   reflexivityOnArbitrary ((>=) :: Int -> Int -> Bool)
   

   reflexivityOnArbitrary (Data.List.isPrefixOf :: [Int] -> [Int] -> Bool)
   

   reflexivityOnArbitrary (Data.List.isSuffixOf :: [Int] -> [Int] -> Bool)
   

   reflexivityOnArbitrary (Data.List.isInfixOf :: [Int] -> [Int] -> Bool)
   

2. symmetryOnArbitrary :: (Show a, Arbitrary a) => (a -> a -> Bool) -> Property

   genvalidity-sydtest	Test.Syd.Validity.Relations.Symmetry

   symmetryOnArbitrary ((==) :: Int -> Int -> Bool)
   

   symmetryOnArbitrary ((/=) :: Int -> Int -> Bool)
   

3. transitivityOnArbitrary :: (Show a, Arbitrary a) => (a -> a -> Bool) -> Property

   genvalidity-sydtest	Test.Syd.Validity.Relations.Transitivity

   transitivityOnArbitrary ((>) :: Int -> Int -> Bool)
   

   transitivityOnArbitrary ((>=) :: Int -> Int -> Bool)
   

   transitivityOnArbitrary ((==) :: Int -> Int -> Bool)
   

   transitivityOnArbitrary ((<=) :: Int -> Int -> Bool)
   

   transitivityOnArbitrary ((<) :: Int -> Int -> Bool)
   

   transitivityOnArbitrary (Data.List.isPrefixOf :: [Int] -> [Int] -> Bool)
   

   transitivityOnArbitrary (Data.List.isSuffixOf :: [Int] -> [Int] -> Bool)
   

   transitivityOnArbitrary (Data.List.isInfixOf :: [Int] -> [Int] -> Bool)
   

4. showReadRoundTripOnArbitrary :: (Show a, Eq a, Read a, Arbitrary a) => Property

   genvalidity-sydtest	Test.Syd.Validity.Show

   showReadRoundTripOnArbitrary @Double
   

5. showReadSpecOnArbitrary :: (Show a, Eq a, Read a, Typeable a, Arbitrary a) => Spec

   genvalidity-sydtest	Test.Syd.Validity.Show

   Standard test spec for properties of Show and Read instances for arbitrary values Example usage:

   showReadSpecOnArbitrary @Double
   

6. package generic-arbitrary

   Generic implementation for QuickCheck's Arbitrary Generic implementations of methods of the Arbitrary class from the QuickCheck library. The approach taken here can lead to diverging instances for mutually recursive types but is safe for simply recursive ones and guarantees flat distribution for constructors of sum-types.

7. class Finite self a ~ finite => GArbitrary self (a :: Type -> Type) (finite :: Bool)

   generic-arbitrary	Test.QuickCheck.Arbitrary.Generic

   Generic arbitrary. Parameters are: * self: the ADT we generating instance for * a: some part of the `Rep self` * finite: Is a finite? Infinite type has no finite values (like Stream)

8. newtype GenericArbitrary a

   generic-arbitrary	Test.QuickCheck.Arbitrary.Generic

   Newtype for DerivingVia Usage:

   data Foo = Foo
   { _fooX :: X
   , _fooY :: Y
   } deriving (Generic)
   deriving (Arbitrary) via GenericArbitrary Foo
   

9. GenericArbitrary :: a -> GenericArbitrary a

   generic-arbitrary	Test.QuickCheck.Arbitrary.Generic

   No documentation available.

10. genericArbitrary :: forall a (ga :: Type -> Type) (some :: Bool) . (Generic a, GArbitrary a ga some, ga ~ Rep a) => Gen a

    generic-arbitrary	Test.QuickCheck.Arbitrary.Generic

    No documentation available.

Page 45 of many | Previous | Next