# Hoogle Search

1. base 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, ...]
```

2. base Data.List

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, ...]
```

3. base Data.List.NonEmpty

Map a function over a NonEmpty stream.

4. base GHC.List

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, ...]
```

5. base GHC.OldList

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, ...]
```

6. bytestring Data.ByteString

O(n) map f xs is the ByteString obtained by applying f to each element of xs.

7. bytestring Data.ByteString.Char8

O(n) map f xs is the ByteString obtained by applying f to each element of xs

8. bytestring Data.ByteString.Lazy

O(n) map f xs is the ByteString obtained by applying f to each element of xs.

9. bytestring Data.ByteString.Lazy.Char8

O(n) map f xs is the ByteString obtained by applying f to each element of xs

10. text Data.Text

O(n) map f t is the Text obtained by applying f to each element of t. Example:

```>>> let message = pack "I am not angry. Not at all."

>>> T.map (\c -> if c == '.' then '!' else c) message
"I am not angry! Not at all!"
```
Subject to fusion. Performs replacement on invalid scalar values.

Page 1 of many | Next