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. mapWithKey' :: (Word -> a -> b) -> Patricia a -> Patricia b

   radix-tree	Data.Patricia.Word.Strict

   Apply a function to every value in the tree. New values are evaluated to WHNF.

2. mapEither :: (a -> Either b c) -> Radix1Tree a -> (Radix1Tree b, Radix1Tree c)

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

3. mapEitherWithKey :: (Build1 -> a -> Either b c) -> Radix1Tree a -> (Radix1Tree b, Radix1Tree c)

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

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

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

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

   radix-tree	Data.Radix1Tree.Word8.Lazy

   Apply a function to every value in the tree.

7. map' :: (a -> b) -> Radix1Tree a -> Radix1Tree b

   radix-tree	Data.Radix1Tree.Word8.Strict

   Apply a function to every value in the tree.

8. mapEither :: (a -> Either b c) -> Radix1Tree a -> Split1 b c

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

9. mapEitherWithKey :: (Build1 -> a -> Either b c) -> Radix1Tree a -> Split1 b c

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

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

Page 314 of many | Previous | Next