Hoogle Search

Within LTS Haskell 24.25 (ghc-9.10.3)

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

  1. arbitraryBSn :: Int -> Gen ByteString

    haskoin-core Haskoin.Util.Arbitrary.Util

    Arbitrary strict ByteString of a given length

  2. arbitraryMaybe :: Gen a -> Gen (Maybe a)

    haskoin-core Haskoin.Util.Arbitrary.Util

    Generate a Maybe from a Gen a

  3. arbitraryNetwork :: Gen Network

    haskoin-core Haskoin.Util.Arbitrary.Util

    Generate an Network

  4. arbitraryUTCTime :: Gen UTCTime

    haskoin-core Haskoin.Util.Arbitrary.Util

    Arbitrary UTCTime that generates dates after 01 Jan 1970 01:00:00 CET

  5. arbitraryQ :: Arbitrary a => Quantification a

    quickcheck-dynamic Test.QuickCheck.DynamicLogic.Quantify

    Pack up an Arbitrary instance as a Quantification. Treats all values as being in range.

  6. arbitraryAction :: StateModel state => VarContext -> state -> Gen (Any (Action state))

    quickcheck-dynamic Test.QuickCheck.StateModel

    Generator for Action depending on state.

  7. arbitraryVar :: Typeable a => VarContext -> Gen (Var a)

    quickcheck-dynamic Test.QuickCheck.StateModel.Variables

    No documentation available.

  8. arbitrarySteppable :: (Steppable (->) t f, Functor f) => (Gen t -> Gen (f t)) -> Gen t

    yaya-quickcheck Yaya.QuickCheck.Fold

    No documentation available.

  9. class CoArbitrary a

    QuickCheck Test.QuickCheck

    Used for random generation of functions. You should consider using Fun instead, which can show the generated functions as strings. If you are using a recent GHC, there is a default definition of coarbitrary using genericCoarbitrary, so if your type has a Generic instance it's enough to say

    instance CoArbitrary MyType
    
    You should only use genericCoarbitrary for data types where equality is structural, i.e. if you can't have two different representations of the same value. An example where it's not safe is sets implemented using binary search trees: the same set can be represented as several different trees. Here you would have to explicitly define coarbitrary s = coarbitrary (toList s).

  10. applyArbitrary2 :: (Arbitrary a, Arbitrary b) => (a -> b -> r) -> Gen r

    QuickCheck Test.QuickCheck

    Apply a binary function to random arguments.

Page 24 of many | Previous | Next