Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

Exact lookup

1. map :: forall (m :: Type -> Type) a b . Monad m => (a -> b) -> Pipe m a b

   streamly-core	Streamly.Internal.Data.Pipe

   Lift a pure function to a Pipe.

2. map :: forall (m :: Type -> Type) a b . Monad m => (a -> b) -> Stream m a -> Stream m b

   streamly-core	Streamly.Internal.Data.Stream

   No documentation available.

3. map :: forall (m :: Type -> Type) a b . Monad m => (a -> b) -> Stream m a -> Stream m b

   streamly-core	Streamly.Internal.Data.Stream

   No documentation available.

4. map :: forall a b (m :: Type -> Type) . (a -> b) -> StreamK m a -> StreamK m b

   streamly-core	Streamly.Internal.Data.StreamK

   No documentation available.

5. map :: forall (m :: Type -> Type) b c a . Functor m => (b -> c) -> Unfold m a b -> Unfold m a c

   streamly-core	Streamly.Internal.Data.Unfold

   Map a function on the output of the unfold (the type b).

   >>> map f = Unfold.map2 (const f)
   

   Pre-release

6. map :: forall (m :: Type -> Type) a b . Monad m => (a -> b) -> Stream m a -> Stream m b

   vector-stream	Data.Stream.Monadic

   Map a function over a Stream

7. map :: Nat -> (Nat -> LocalId -> Exp) -> Exp -> Exp

   Agda	Agda.Compiler.JS.Substitution

   No documentation available.

8. map :: Ord b => (a -> b) -> Bag a -> Bag b

   Agda	Agda.Utils.Bag

   O(n).

9. map :: (a -> b) -> NonEmpty a -> NonEmpty b

   Agda	Agda.Utils.List1

   Map a function over a NonEmpty stream.

10. map :: (AsEnumSet a, AsEnumSet b) => (a -> b) -> EnumSet a -> EnumSet b

    bitwise-enum	Data.Enum.Set

    O(n). map f s is the set obtained by applying f to each element of s. It's worth noting that the size of the result may be smaller if, for some (x,y), x /= y && f x == f y

Page 25 of many | Previous | Next