Hoogle Search

Within LTS Haskell 24.16 (ghc-9.10.3)

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

Exact lookup

1. map :: (Ord v1, Ord v2) => (v1 -> v2) -> Multiset v1 -> Multiset v2

   more-containers	Data.Multiset

   Maps on the multiset's values.

2. map :: (Char -> Char) -> NonEmptyText -> NonEmptyText

   non-empty-text	Data.NonEmptyText

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

3. map :: (Char -> Char) -> CharSet -> CharSet

   parser-regex	Data.CharSet

   Map a function over all Chars in a set.

4. map :: (Char -> Char) -> CharSet -> CharSet

   parser-regex	Regex.Internal.CharSet

   Map a function over all Chars in a set.

5. map :: (a -> b) -> FoldList a -> FoldList b

   pinch	Pinch.Internal.FoldList

   Applies the given function to all elements in the FoldList. Note that the function is applied lazily when the results are requested. If the results of the same FoldList are requested multiple times, the function will be called multiple times on the same elements.

6. map :: (a -> b) -> Queue a -> Queue b

   queues	Queue

   Apply a function to every element in a queue.

7. map :: (a -> b) -> EphemeralQueue a -> EphemeralQueue b

   queues	Queue.Ephemeral

   Apply a function to every element in a queue.

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

   radix-tree	Data.Patricia.Word.Lazy

   Apply a function to every value in the tree.

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

   radix-tree	Data.Patricia.Word.Strict

   Apply a function to every value in the tree.

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

    radix-tree	Data.Radix1Tree.Word8.Lazy

    Apply a function to every value in the tree.

Page 28 of many | Previous | Next