Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

Exact lookup

1. map :: Hashable b => (a -> b) -> HashSet a -> HashSet b

   unordered-containers	Data.HashSet

   Transform this set by applying a function to every value. The resulting set may be smaller than the source.

   >>> HashSet.map show (HashSet.fromList [1,2,3])
   HashSet.fromList ["1","2","3"]
   

2. map :: Hashable b => (a -> b) -> HashSet a -> HashSet b

   unordered-containers	Data.HashSet.Internal

   Transform this set by applying a function to every value. The resulting set may be smaller than the source.

   >>> HashSet.map show (HashSet.fromList [1,2,3])
   HashSet.fromList ["1","2","3"]
   

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

   conduit	Data.Conduit.Combinators

   Apply a transformation to all values in a stream. Subject to fusion

4. map :: forall (m :: Type -> Type) a b . Monad m => (a -> b) -> ConduitT a b m ()

   conduit	Data.Conduit.List

   Apply a transformation to all values in a stream. Subject to fusion Since 0.3.0

5. map :: FoldCase s2 => (s1 -> s2) -> CI s1 -> CI s2

   case-insensitive	Data.CaseInsensitive

   Transform the original string-like value but keep it case insensitive.

6. map :: (MonadGen m, Ord k) => Range Int -> m (k, v) -> m (Map k v)

   hedgehog	Hedgehog.Gen

   Generates a map using a Range to determine the length. This may fail to generate anything if the keys produced by the generator do not account for a large enough number of unique items to satify the required map size.

7. map :: (MonadGen m, Ord k) => Range Int -> m (k, v) -> m (Map k v)

   hedgehog	Hedgehog.Internal.Gen

   Generates a map using a Range to determine the length. This may fail to generate anything if the keys produced by the generator do not account for a large enough number of unique items to satify the required map size.

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

   base-compat	Data.List.NonEmpty.Compat

   Map a function over a NonEmpty stream.

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

   dlist	Data.DList

   map f xs is the DList obtained by applying f to each element of xs. <math>(length (toList xs)). map obeys the law:

   toList (map f xs) = map f (toList xs)
   

10. map :: (a -> b) -> DNonEmpty a -> DNonEmpty b

    dlist	Data.DList.DNonEmpty

    map f xs is the DNonEmpty obtained by applying f to each element of xs. <math>(length (toNonEmpty xs)). map obeys the law:

    toNonEmpty (map f xs) = map f (toNonEmpty xs)
    

Page 16 of many | Previous | Next