Hoogle Search
Within LTS Haskell 24.40 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
mapQ :: (a -> b, b -> a) -> Quantification a -> Quantification bquickcheck-dynamic Test.QuickCheck.DynamicLogic.Quantify Quantification is not a Functor, since it also keeps track of the range of the generators. However, if you have two functions to :: a -> b from :: b -> a satisfying from . to = id you can go from a quantification over a to one over b. Note that the from function need only be defined on the image of to.
mapEither :: (a -> Either b c) -> Patricia a -> (Patricia b, Patricia c)radix-tree Data.Patricia.Word.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 :: (Word -> a -> Either b c) -> Patricia a -> (Patricia b, Patricia c)radix-tree Data.Patricia.Word.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.
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.