Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

  1. (<$>!) :: BEncode a => (a -> b) -> BKey -> Get b

    bencoding Data.BEncode

    Shorthand for: f <$> field (req k).

  2. (<$>?) :: BEncode a => (Maybe a -> b) -> BKey -> Get b

    bencoding Data.BEncode

    Shorthand for: f <$> optional (field (req k)).

  3. (<<$>>) :: (a -> b) -> a -> b

    semigroupoids Data.Bifunctor.Apply

    No documentation available.

  4. (<<$>>) :: (a -> b) -> a -> b

    bifunctors Data.Biapplicative

    No documentation available.

  5. (<<$>>) :: (Functor f, Functor g) => (a -> b) -> f (g a) -> f (g b)

    relude Relude.Functor.Fmap

    Alias for fmap . fmap. Convenient to work with two nested Functors. 

    >>> negate <<$>> Just [1,2,3]
Just [-1,-2,-3]

  6. (%<$>) :: forall a b (f :: Type -> Type) (t1 :: a ~> b) (t2 :: f a) . SFunctor f => Sing t1 -> Sing t2 -> Sing (Apply (Apply ((<$>@#@$) :: TyFun (a ~> b) (f a ~> f b) -> Type) t1) t2)

    singletons-base Control.Applicative.Singletons

    No documentation available.

  7. (%<$>) :: forall a b (f :: Type -> Type) (t1 :: a ~> b) (t2 :: f a) . SFunctor f => Sing t1 -> Sing t2 -> Sing (Apply (Apply ((<$>@#@$) :: TyFun (a ~> b) (f a ~> f b) -> Type) t1) t2)

    singletons-base Data.Functor.Singletons

    No documentation available.

  8. (%<$>) :: forall a b (f :: Type -> Type) (t1 :: a ~> b) (t2 :: f a) . SFunctor f => Sing t1 -> Sing t2 -> Sing (Apply (Apply ((<$>@#@$) :: TyFun (a ~> b) (f a ~> f b) -> Type) t1) t2)

    singletons-base Prelude.Singletons

    No documentation available.

  9. (<<$>>) :: (Functor f, Functor g) => (a -> b) -> f (g a) -> f (g b)

    protolude Protolude.Functor

    No documentation available.

  10. (:<$>:) :: (b -> a) -> f b -> Post a (f :: Type -> Type) b

    functor-combinators Data.HFunctor.Route

    No documentation available.

Page 10 of many | Previous | Next