Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

  1. firstEitherT :: forall (m :: Type -> Type) x y a . Functor m => (x -> y) -> EitherT x m a -> EitherT y m a

    transformers-either Control.Monad.Trans.Either

    Map the Left unwrapped computation using the given function.

  2. firstExtensionError :: ErrorCode

    xmonad-contrib XMonad.Config.Prime

    No documentation available.

  3. firstTok :: Foldable f => f t -> t

    yi-mode-javascript Yi.Syntax.JavaScript

    No documentation available.

  4. deleteFirstsBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]

    base Data.List

    The deleteFirstsBy function takes a predicate and two lists and returns the first list with the first occurrence of each element of the second list removed. This is the non-overloaded version of (\\). 

    (\\) == deleteFirstsBy (==)
    The second list must be finite, but the first may be infinite.

    Examples

    >>> deleteFirstsBy (>) [1..10] [3, 4, 5]
[4,5,6,7,8,9,10]

    >>> deleteFirstsBy (/=) [1..10] [1, 3, 5]
[4,5,6,7,8,9,10]

  5. getFirst :: First a -> Maybe a

    base Data.Monoid

    No documentation available.

  6. getFirst :: First a -> a

    base Data.Semigroup

    No documentation available.

  7. compactGetFirstBlock# :: Compact# -> State# RealWorld -> (# State# RealWorld, Addr#, Word# #)

    base GHC.Base

    Returns the address and the utilized size (in bytes) of the first compact block of a CNF.

  8. compactGetFirstBlock# :: Compact# -> State# RealWorld -> (# State# RealWorld, Addr#, Word# #)

    base GHC.Exts

    Returns the address and the utilized size (in bytes) of the first compact block of a CNF.

  9. contramapFirstWhenMatched :: forall b a (f :: Type -> Type) y z . (b -> a) -> WhenMatched f a y z -> WhenMatched f b y z

    containers Data.IntMap.Internal

    Map contravariantly over a WhenMatched f _ y z.

  10. contramapFirstWhenMatched :: forall b a (f :: Type -> Type) y z . (b -> a) -> WhenMatched f a y z -> WhenMatched f b y z

    containers Data.IntMap.Merge.Lazy

    Map contravariantly over a WhenMatched f _ y z.

Page 36 of many | Previous | Next