Hoogle Search

Within LTS Haskell 24.45 (ghc-9.10.3)

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

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

  2. mapWithKey :: (Word -> a -> b) -> Patricia a -> Patricia b

    radix-tree Data.Patricia.Word.Lazy

    Apply a function to every value in the tree.

  3. map' :: (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.

  4. mapEither :: (a -> Either b c) -> Patricia a -> Split b c

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

  5. mapEitherWithKey :: (Word -> a -> Either b c) -> Patricia a -> Split b c

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

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

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

  8. mapWithKey :: (Word -> a -> b) -> Patricia a -> Patricia b

    radix-tree Data.Patricia.Word.Strict

    Apply a function to every value in the tree.

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

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

Page 315 of many | Previous | Next