Hoogle Search
Within LTS Haskell 24.34 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
mapWithKey :: (Build -> a -> b) -> RadixTree a -> RadixTree bradix-tree Data.RadixTree.Word8.Strict Apply a function to every value in the tree.
mapWithKey' :: (Build -> a -> b) -> RadixTree a -> RadixTree bradix-tree Data.RadixTree.Word8.Strict Apply a function to every value in the tree.
map' :: forall a b (n :: Nat) (m :: BinP) . (a -> b) -> NERAVec' n m a -> NERAVec' n m bral Data.RAVec.NonEmpty No documentation available.
map2 :: (a -> b -> c) -> Signal a -> Signal b -> Signal cramus Ramus.Signal No documentation available.
map3 :: (a -> b -> c -> d) -> Signal a -> Signal b -> Signal c -> Signal dramus Ramus.Signal No documentation available.
map4 :: (a -> b -> c -> d -> e) -> Signal a -> Signal b -> Signal c -> Signal d -> Signal eramus Ramus.Signal No documentation available.
-
ramus Ramus.Signal No documentation available.
mapAccumL :: (acc -> Word8 -> (acc, Word8)) -> acc -> ByteString -> (acc, ByteString)rawfilepath Data.ByteString.RawFilePath The mapAccumL function behaves like a combination of map and foldl; it applies a function to each element of a ByteString, passing an accumulating parameter from left to right, and returning a final value of this accumulator together with the new ByteString.
mapAccumR :: (acc -> Word8 -> (acc, Word8)) -> acc -> ByteString -> (acc, ByteString)rawfilepath Data.ByteString.RawFilePath The mapAccumR function behaves like a combination of map and foldr; it applies a function to each element of a ByteString, passing an accumulating parameter from right to left, and returning a final value of this accumulator together with the new ByteString.
mapWithKey :: Ord k => (k -> a -> b) -> RMap k a -> RMap k brec-def Data.Recursive.Map RM.get (RM.mapWithKey (applyFun2 f) m) === M.mapWithKey (applyFun2 f) (RM.get m)