Hoogle Search

Within LTS Haskell 24.45 (ghc-9.10.3)

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

Exact lookup

1. map :: (Char -> Char) -> Text -> Text

   rio	RIO.Text.Lazy

   O(n) map f t is the Text obtained by applying f to each element of t. Performs replacement on invalid scalar values.

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

   rio	RIO.Vector

   No documentation available.

3. map :: (a -> b) -> Vector a -> Vector b

   rio	RIO.Vector.Boxed

   No documentation available.

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

   rio	RIO.Vector.Storable

   No documentation available.

5. map :: (Unbox a, Unbox b) => (a -> b) -> Vector a -> Vector b

   rio	RIO.Vector.Unboxed

   No documentation available.

6. 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.

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

   storablevector	Data.StorableVector.Lazy

   No documentation available.

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

   storablevector	Data.StorableVector.Lazy.Pattern

   No documentation available.

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

   storablevector	Data.StorableVector.Lazy.Typed

   No documentation available.

10. 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)
    

Page 9 of many | Previous | Next