Hoogle Search

Within LTS Haskell 24.11 (ghc-9.10.2)

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

Exact lookup

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

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

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

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

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

   rope-utf16-splay	Data.Rope.UTF16

   Map over the characters of a rope

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

   rope-utf16-splay	Data.Rope.UTF16.Internal

   Map over the characters of a rope

7. map :: (Measured v a, Measured w b) => (a -> b) -> SplayTree v a -> SplayTree w b

   rope-utf16-splay	Data.SplayTree

   No documentation available.

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

   rrb-vector	Data.RRBVector

   Apply the function to every element.

   >>> map (+ 1) (fromList [1, 2, 3])
   fromList [2,3,4]
   

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

   sample-frame-np	Sound.Frame.NumericPrelude.Stereo

   No documentation available.

10. map :: forall (f :: Type -> Type) (n :: Nat) a b . (CFreeMonoid f, Dom f a, Dom f b) => (a -> b) -> Sized f n a -> Sized f n b

    sized	Data.Sized

    Map function. Since 0.7.0.0

Page 41 of many | Previous | Next