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.

  1. map :: forall s k a b . (a -> b) -> HashMap s k a -> HashMap s k b

    refined-containers Data.HashMap.Strict.Refined

    Apply a function to all values in a map. The set of keys remains the same.

  2. map :: forall s a b . (Hashable b, KnownHashSet s a) => (Element s a -> b) -> SomeHashSetWith (MapProof 'Hashed s a b) b

    refined-containers Data.HashSet.Refined

    Apply the given function to each element of the set and collect the results. Note that the resulting set can be smaller.

  3. map :: forall s a b . (a -> b) -> IntMap s a -> IntMap s b

    refined-containers Data.IntMap.Refined

    Apply a function to all values in a map. The set of keys remains the same.

  4. map :: forall s a b . (a -> b) -> IntMap s a -> IntMap s b

    refined-containers Data.IntMap.Strict.Refined

    Apply a function to all values in a map. The set of keys remains the same.

  5. map :: KnownIntSet s => (Element s -> Int) -> SomeIntSetWith (MapProof 'Int s Int Int)

    refined-containers Data.IntSet.Refined

    Apply the given function to each element of the set and collect the results. Note that the resulting set can be smaller.

  6. map :: forall s k a b . (a -> b) -> Map s k a -> Map s k b

    refined-containers Data.Map.Refined

    Apply a function to all values in a map. The set of keys remains the same.

  7. map :: forall s k a b . (a -> b) -> Map s k a -> Map s k b

    refined-containers Data.Map.Strict.Refined

    Apply a function to all values in a map. The set of keys remains the same.

  8. map :: forall s a b . (Ord b, KnownSet s a) => (Element s a -> b) -> SomeSetWith (MapProof 'Regular s a b) b

    refined-containers Data.Set.Refined

    Apply the given function to each element of the set and collect the results. Note that the resulting set can be smaller.

  9. map :: MonadUnliftIO m => (a -> b) -> InputStream a -> m (InputStream b)

    unliftio-streams UnliftIO.Streams.Combinators

    No documentation available.

  10. map :: (a -> b) -> [a] -> [b]

    xmonad-contrib XMonad.Prelude

    map f xs is the list obtained by applying f to each element of xs, i.e., 

    map f [x1, x2, ..., xn] == [f x1, f x2, ..., f xn]
map f [x1, x2, ...] == [f x1, f x2, ...]
    this means that map id == id

    Examples

    >>> map (+1) [1, 2, 3]
[2,3,4]

    >>> map id [1, 2, 3]
[1,2,3]

    >>> map (\n -> 3 * n + 1) [1, 2, 3]
[4,7,10]

Page 47 of many | Previous | Next