Hoogle Search

Within LTS Haskell 24.67 (ghc-9.10.3)

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

  1. sequenceA :: (Mappable collection, Applicative f) => collection (f a) -> f (collection a)

    foundation Foundation.Collection

    Evaluate each actions of the given collections, from left to right, and collect the results. For a version that ignores the results, see sequenceA_

  2. deepseq :: NormalForm a => a -> b -> b

    foundation Foundation.Primitive

    No documentation available.

  3. geq :: (Generic a, Eq (Rep a ())) => a -> a -> Bool

    generic-data Generic.Data

    Generic (==).

    instance Eq MyType where
    (==) = geq
    

  4. gliftEq :: (Generic1 f, Eq1 (Rep1 f)) => (a -> b -> Bool) -> f a -> f b -> Bool

    generic-data Generic.Data

    Generic liftEq.

  5. gsequenceA :: (Generic1 f, GTraversable (Rep1 f), Applicative m) => f (m a) -> m (f a)

    generic-data Generic.Data

    Generic sequenceA.

    instance Traversable MyTypeF where
    sequenceA = gsequenceA
    
    See also gtraverse.

  6. geq :: (Generic a, Eq (Rep a ())) => a -> a -> Bool

    generic-data Generic.Data.Internal.Prelude

    Generic (==).

    instance Eq MyType where
    (==) = geq
    

  7. gliftEq :: (Generic1 f, Eq1 (Rep1 f)) => (a -> b -> Bool) -> f a -> f b -> Bool

    generic-data Generic.Data.Internal.Prelude

    Generic liftEq.

  8. gsequenceA :: (Generic1 f, Traversable (Rep1 f), Applicative m) => f (m a) -> m (f a)

    generic-data Generic.Data.Internal.Prelude

    Deprecated: This definition has been replaced with gsequenceA.

  9. gsequenceA :: (Generic1 f, GTraversable (Rep1 f), Applicative m) => f (m a) -> m (f a)

    generic-data Generic.Data.Internal.Traversable

    Generic sequenceA.

    instance Traversable MyTypeF where
    sequenceA = gsequenceA
    
    See also gtraverse.

  10. ArithSeqOrigin :: ArithSeqInfo GhcRn -> CtOrigin

    ghc-typelits-presburger GHC.TypeLits.Presburger.Compat

    No documentation available.

Page 487 of many | Previous | Next