Hoogle Search

Within LTS Haskell 24.53 (ghc-9.10.3)

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

Exact lookup

1. map :: (WindowsChar -> WindowsChar) -> WindowsString -> WindowsString

   os-string	System.OsString.Windows

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

2. map :: (Storable a, Storable b) => (a -> b) -> Vector a -> Vector b

   storablevector	Data.StorableVector

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

3. map :: (Storable x, Storable y) => (x -> y) -> Vector x -> Vector y

   storablevector	Data.StorableVector.Lazy

   No documentation available.

4. map :: (Storable x, Storable y) => (x -> y) -> Vector x -> Vector y

   storablevector	Data.StorableVector.Lazy.Pattern

   No documentation available.

5. map :: (Size size, Storable x, Storable y) => (x -> y) -> Vector size x -> Vector size y

   storablevector	Data.StorableVector.Lazy.Typed

   No documentation available.

6. map :: TextualMonoid t => (Char -> Char) -> t -> t

   monoid-subclasses	Data.Monoid.Textual

   Equivalent to map from Data.List with a Char -> Char function. Preserves all non-character data.

   map f == concatMap (singleton . f)
   

7. map :: Ord b => (a -> b) -> NonEmptySet a -> NonEmptySet b

   Cabal-syntax	Distribution.Compat.NonEmptySet

   No documentation available.

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

   Cabal-syntax	Distribution.Compat.Prelude

   No documentation available.

9. map :: C sh => (a -> b) -> Array sh a -> Array sh b

   comfort-array	Data.Array.Comfort.Boxed

   No documentation available.

10. map :: C sh => (a -> b) -> Array sh a -> Array sh b

    comfort-array	Data.Array.Comfort.Boxed.Unchecked

    No documentation available.

Page 10 of many | Previous | Next