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. mapEitherWithKey :: (Build -> 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.

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

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

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

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

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

   radix-tree	Data.RadixTree.Word8.Strict

   Apply a function to every value in the tree.

5. mapWithKey' :: (Build -> a -> b) -> RadixTree a -> RadixTree b

   radix-tree	Data.RadixTree.Word8.Strict

   Apply a function to every value in the tree.

6. map' :: forall a b (n :: Nat) (m :: BinP) . (a -> b) -> NERAVec' n m a -> NERAVec' n m b

   ral	Data.RAVec.NonEmpty

   No documentation available.

7. map2 :: (a -> b -> c) -> Signal a -> Signal b -> Signal c

   ramus	Ramus.Signal

   No documentation available.

8. map3 :: (a -> b -> c -> d) -> Signal a -> Signal b -> Signal c -> Signal d

   ramus	Ramus.Signal

   No documentation available.

9. map4 :: (a -> b -> c -> d -> e) -> Signal a -> Signal b -> Signal c -> Signal d -> Signal e

   ramus	Ramus.Signal

   No documentation available.

10. map5 :: (a -> b -> c -> d -> e -> f) -> Signal a -> Signal b -> Signal c -> Signal d -> Signal e -> Signal f

    ramus	Ramus.Signal

    No documentation available.

Page 316 of many | Previous | Next