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 :: (Build1 -> a -> b) -> Radix1Tree a -> Radix1Tree bradix-tree Data.Radix1Tree.Word8.Lazy Apply a function to every value in the tree.
map' :: (a -> b) -> Radix1Tree a -> Radix1Tree bradix-tree Data.Radix1Tree.Word8.Strict Apply a function to every value in the tree.
mapEither :: (a -> Either b c) -> Radix1Tree a -> Split1 b cradix-tree Data.Radix1Tree.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 :: (Build1 -> a -> Either b c) -> Radix1Tree a -> Split1 b cradix-tree Data.Radix1Tree.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) -> Radix1Tree a -> Radix1Tree bradix-tree Data.Radix1Tree.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 :: (Build1 -> a -> Maybe b) -> Radix1Tree a -> Radix1Tree bradix-tree Data.Radix1Tree.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 :: (Build1 -> a -> b) -> Radix1Tree a -> Radix1Tree bradix-tree Data.Radix1Tree.Word8.Strict Apply a function to every value in the tree.
mapWithKey' :: (Build1 -> a -> b) -> Radix1Tree a -> Radix1Tree bradix-tree Data.Radix1Tree.Word8.Strict Apply a function to every value in the tree.
mapEither :: (a -> Either b c) -> RadixTree a -> (RadixTree b, RadixTree c)radix-tree Data.RadixTree.Word8.Lazy Apply a function to every value in the tree and create two trees, one out of Left results and one out of Right ones.
mapEitherWithKey :: (Build -> a -> Either b c) -> RadixTree a -> (RadixTree b, RadixTree c)radix-tree Data.RadixTree.Word8.Lazy Apply a function to every value in the tree and create two trees, one out of Left results and one out of Right ones.