Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

Exact lookup

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

2. mapWithKey :: (Build1 -> a -> b) -> Radix1Tree a -> Radix1Tree b

   radix-tree	Data.Radix1Tree.Word8.Strict

   Apply a function to every value in the tree.

3. mapWithKey' :: (Build1 -> a -> b) -> Radix1Tree a -> Radix1Tree b

   radix-tree	Data.Radix1Tree.Word8.Strict

   Apply a function to every value in the tree.

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

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

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

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

8. mapWithKey :: (Build -> a -> b) -> RadixTree a -> RadixTree b

   radix-tree	Data.RadixTree.Word8.Lazy

   Apply a function to every value in the tree.

9. map' :: (a -> b) -> RadixTree a -> RadixTree b

   radix-tree	Data.RadixTree.Word8.Strict

   Apply a function to every value in the tree.

10. mapEither :: (a -> Either b c) -> RadixTree a -> Split b c

    radix-tree	Data.RadixTree.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.

Page 315 of many | Previous | Next