Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. map :: (a -> b) -> Patricia a -> Patricia b

   radix-tree	Data.Patricia.Word.Lazy

   Apply a function to every value in the tree.

2. map :: (a -> b) -> Patricia a -> Patricia b

   radix-tree	Data.Patricia.Word.Strict

   Apply a function to every value in the tree.

3. map :: (a -> b) -> Radix1Tree a -> Radix1Tree b

   radix-tree	Data.Radix1Tree.Word8.Lazy

   Apply a function to every value in the tree.

4. map :: (a -> b) -> Radix1Tree a -> Radix1Tree b

   radix-tree	Data.Radix1Tree.Word8.Strict

   Apply a function to every value in the tree.

5. map :: (a -> b) -> RadixTree a -> RadixTree b

   radix-tree	Data.RadixTree.Word8.Lazy

   Apply a function to every value in the tree.

6. map :: (a -> b) -> RadixTree a -> RadixTree b

   radix-tree	Data.RadixTree.Word8.Strict

   Apply a function to every value in the tree.

7. map :: (a -> b) -> RAList a -> RAList b

   ral	Data.RAList

   >>> map toUpper (fromList ['a'..'f'])
   fromList "ABCDEF"
   

8. map :: (a -> b) -> NERAList a -> NERAList b

   ral	Data.RAList.NonEmpty

   >>> map toUpper (fromNonEmpty ('a' :| ['b'..'f']))
   fromNonEmpty ('A' :| "BCDEF")
   

9. map :: forall a b (n :: Bin) . (a -> b) -> RAVec n a -> RAVec n b

   ral	Data.RAVec

   No documentation available.

10. map :: forall a b (m :: BinP) . (a -> b) -> NERAVec m a -> NERAVec m b

    ral	Data.RAVec.NonEmpty

    No documentation available.

Page 40 of many | Previous | Next