Hoogle Search

Within LTS Haskell 24.41 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. mapMaybe :: (a -> Maybe b) -> Patricia a -> Patricia b

   radix-tree	Data.Patricia.Word.Lazy

   Apply a function to every value in the tree and create one out of Just values.

2. mapMaybeWithKey :: (Word -> a -> Maybe b) -> Patricia a -> Patricia b

   radix-tree	Data.Patricia.Word.Lazy

   Apply a function to every value in the tree and create a tree out of Just results.

3. mapMaybe :: (a -> Maybe b) -> Patricia a -> Patricia b

   radix-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.

4. mapMaybeWithKey :: (Word -> a -> Maybe b) -> Patricia a -> Patricia b

   radix-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.

5. mapMaybe :: (a -> Maybe b) -> Radix1Tree a -> Radix1Tree b

   radix-tree	Data.Radix1Tree.Word8.Lazy

   Apply a function to every value in the tree and create one out of Just values.

6. mapMaybeWithKey :: (Build1 -> a -> Maybe b) -> Radix1Tree a -> Radix1Tree b

   radix-tree	Data.Radix1Tree.Word8.Lazy

   Apply a function to every value in the tree and create one out of Just values.

7. mapMaybe :: (a -> Maybe b) -> Radix1Tree a -> Radix1Tree b

   radix-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.

8. mapMaybeWithKey :: (Build1 -> a -> Maybe b) -> Radix1Tree a -> Radix1Tree b

   radix-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.

9. mapMaybe :: (a -> Maybe b) -> RadixTree a -> RadixTree b

   radix-tree	Data.RadixTree.Word8.Lazy

   Apply a function to every value in the tree and create one out of Just values.

10. mapMaybeWithKey :: (Build -> a -> Maybe b) -> RadixTree a -> RadixTree b

    radix-tree	Data.RadixTree.Word8.Lazy

    Apply a function to every value in the tree and create one out of Just values.

Page 57 of many | Previous | Next