Hoogle Search
Within LTS Haskell 24.37 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
mapMaybe :: (a -> Maybe b) -> Patricia a -> Patricia bradix-tree Data.Patricia.Word.Lazy Apply a function to every value in the tree and create one out of Just values.
mapMaybeWithKey :: (Word -> a -> Maybe b) -> Patricia a -> Patricia bradix-tree Data.Patricia.Word.Lazy Apply a function to every value in the tree and create a tree out of Just results.
mapWithKey :: (Word -> a -> b) -> Patricia a -> Patricia bradix-tree Data.Patricia.Word.Lazy Apply a function to every value in the tree.
map' :: (a -> b) -> Patricia a -> Patricia bradix-tree Data.Patricia.Word.Strict Apply a function to every value in the tree. New values are evaluated to WHNF.
mapEither :: (a -> Either b c) -> Patricia a -> Split b cradix-tree Data.Patricia.Word.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 :: (Word -> a -> Either b c) -> Patricia a -> Split b cradix-tree Data.Patricia.Word.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) -> Patricia a -> Patricia bradix-tree Data.Patricia.Word.Strict Apply a function to every value in the tree and create one out of Just values. The Maybe is evaluated to WHNF.
mapMaybeWithKey :: (Word -> a -> Maybe b) -> Patricia a -> Patricia bradix-tree Data.Patricia.Word.Strict Apply a function to every value in the tree and create a tree out of Just results. The Maybe is evaluated to WHNF.
mapWithKey :: (Word -> a -> b) -> Patricia a -> Patricia bradix-tree Data.Patricia.Word.Strict Apply a function to every value in the tree.
mapWithKey' :: (Word -> a -> b) -> Patricia a -> Patricia bradix-tree Data.Patricia.Word.Strict Apply a function to every value in the tree. New values are evaluated to WHNF.