Hoogle Search
Within LTS Haskell 24.18 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
mapMaybe :: (a -> Maybe b) -> Radix1Tree a -> Radix1Tree bradix-tree Data.Radix1Tree.Word8.Lazy Apply a function to every value in the tree and create one out of Just values.
mapMaybeWithKey :: (Build1 -> a -> Maybe b) -> Radix1Tree a -> Radix1Tree bradix-tree Data.Radix1Tree.Word8.Lazy Apply a function to every value in the tree and create one out of Just values.
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.
mapMaybe :: (a -> Maybe b) -> RadixTree a -> RadixTree bradix-tree Data.RadixTree.Word8.Lazy Apply a function to every value in the tree and create one out of Just values.
mapMaybeWithKey :: (Build -> a -> Maybe b) -> RadixTree a -> RadixTree bradix-tree Data.RadixTree.Word8.Lazy Apply a function to every value in the tree and create one out of Just values.
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.
mapMaybe :: forall b a . (a -> Maybe b) -> Slist a -> Slist bslist Slist The Maybe version of map which can throw out elements. If appliying the given function returns Nothing, no element is added on to the result list. If it is Just b, then b is included in the result list.
>>> maybeEven x = if even x then Just x else Nothing >>> s = cons 1 $ cons 2 $ one 3
>>> mapMaybe maybeEven s Slist {sList = [2], sSize = Size 1}If we map the Just constructor, the entire list should be returned:>>> mapMaybe Just s Slist {sList = [1,2,3], sSize = Size 3}mapMaybe :: forall b a . (a -> Maybe b) -> Slist a -> Slist bslist Slist.Maybe The Maybe version of map which can throw out elements. If appliying the given function returns Nothing, no element is added on to the result list. If it is Just b, then b is included in the result list.
>>> maybeEven x = if even x then Just x else Nothing >>> s = cons 1 $ cons 2 $ one 3
>>> mapMaybe maybeEven s Slist {sList = [2], sSize = Size 1}If we map the Just constructor, the entire list should be returned:>>> mapMaybe Just s Slist {sList = [1,2,3], sSize = Size 3}