Hoogle Search
Within LTS Haskell 24.39 (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.Lazy Apply a function to every value in the tree.
map' :: (a -> b) -> RadixTree a -> RadixTree bradix-tree Data.RadixTree.Word8.Strict Apply a function to every value in the tree.
mapEither :: (a -> Either b c) -> RadixTree a -> Split b cradix-tree Data.RadixTree.Word8.Strict Apply a function to every value in the tree and create two trees, one out of Left results and one out of Right ones. The Either is evaluated to WHNF.
mapEitherWithKey :: (Build -> a -> Either b c) -> RadixTree a -> Split b cradix-tree Data.RadixTree.Word8.Strict Apply a function to every value in the tree and create two trees, one out of Left results and one out of Right ones. The Either is evaluated to WHNF.
mapMaybe :: (a -> Maybe b) -> RadixTree a -> RadixTree bradix-tree Data.RadixTree.Word8.Strict Apply a function to every value in the tree and create one out of Just values. The Maybe is evaluated to WHNF.
mapMaybeWithKey :: (Build -> a -> Maybe b) -> RadixTree a -> RadixTree bradix-tree Data.RadixTree.Word8.Strict Apply a function to every value in the tree and create one out of Just values. The Maybe is evaluated to WHNF.
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.