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.

Exact lookup

1. map :: (a -> b) -> RadixTree a -> RadixTree b

   radix-tree	Data.RadixTree.Word8.Strict

   Apply a function to every value in the tree.

2. map :: (a -> b) -> RAList a -> RAList b

   ral	Data.RAList

   >>> map toUpper (fromList ['a'..'f'])
   fromList "ABCDEF"
   

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

   ral	Data.RAList.NonEmpty

   >>> map toUpper (fromNonEmpty ('a' :| ['b'..'f']))
   fromNonEmpty ('A' :| "BCDEF")
   

4. map :: forall a b (n :: Bin) . (a -> b) -> RAVec n a -> RAVec n b

   ral	Data.RAVec

   No documentation available.

5. map :: forall a b (m :: BinP) . (a -> b) -> NERAVec m a -> NERAVec m b

   ral	Data.RAVec.NonEmpty

   No documentation available.

6. map :: forall a b (n :: Nat) . (a -> b) -> Tree n a -> Tree n b

   ral	Data.RAVec.Tree

   >>> map not $ Node (Leaf True) (Leaf False)
   Node (Leaf False) (Leaf True)
   

7. map :: forall a b (n :: Nat) . SNatI n => (a -> b) -> Tree n a -> Tree n b

   ral	Data.RAVec.Tree.DF

   >>> map not $ Node (Leaf True) (Leaf False)
   Node (Leaf False) (Leaf True)
   

8. map :: (Word8 -> Word8) -> ByteString -> ByteString

   rawfilepath	Data.ByteString.RawFilePath

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

9. map :: Ord k => (a -> b) -> RMap k a -> RMap k b

   rec-def	Data.Recursive.Map

   RM.get (RM.map (applyFun f) m) === M.map (applyFun f) (RM.get m)
   

10. map :: (Char -> Char) -> Rope -> Rope

    rope-utf16-splay	Data.Rope.UTF16

    Map over the characters of a rope

Page 41 of many | Previous | Next