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. contramapFirstWhenMatched :: forall b a (f :: Type -> Type) k y z . (b -> a) -> WhenMatched f k a y z -> WhenMatched f k b y z

    containers Data.Map.Internal

    Map contravariantly over a WhenMatched f k _ y z.

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

    containers Data.Map.Merge.Lazy

    Map contravariantly over a WhenMatched f k _ y z.

  3. periodFirstDay :: DayPeriod p => p -> Day

    time Data.Time.Calendar

    Returns the first Day in a period of days.

  4. weekFirstDay :: DayOfWeek -> Day -> Day

    time Data.Time.Calendar

    Returns the first day of a week containing the given Day. Examples: 

    >>> weekFirstDay Sunday (YearMonthDay 2022 02 21)
YearMonthDay 2022 2 20

    >>> weekFirstDay Monday (YearMonthDay 2022 02 21)
YearMonthDay 2022 2 21

    >>> weekFirstDay Tuesday (YearMonthDay 2022 02 21)
YearMonthDay 2022 2 15

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

    ghc-prim GHC.Prim

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

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

    ghc-prim GHC.PrimopWrappers

    No documentation available.

  7. rceFirstCleanupException :: ResourceCleanupException -> !SomeException

    resourcet Control.Monad.Trans.Resource

    The first cleanup exception. We keep this separate from rceOtherCleanupExceptions to prove that there's at least one (i.e., a non-empty list).

  8. rceFirstCleanupException :: ResourceCleanupException -> !SomeException

    resourcet Control.Monad.Trans.Resource.Internal

    The first cleanup exception. We keep this separate from rceOtherCleanupExceptions to prove that there's at least one (i.e., a non-empty list).

  9. unfirst :: Costrong p => p (a, d) (b, d) -> p a b

    profunctors Data.Profunctor

    Laws: 

    unfirst ≡ unsecond . dimap swap swap
lmap (,()) ≡ unfirst . rmap (,())
unfirst . lmap (second f) ≡ unfirst . rmap (second f)
unfirst . unfirst = unfirst . dimap assoc unassoc where
assoc ((a,b),c) = (a,(b,c))
unassoc (a,(b,c)) = ((a,b),c)

  10. unfirstCorep :: Corepresentable p => p (a, d) (b, d) -> p a b

    profunctors Data.Profunctor.Rep

    Default definition for unfirst given that p is Corepresentable.

Page 37 of many | Previous | Next