Hoogle Search

Within LTS Haskell 24.46 (ghc-9.10.3)

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

Exact lookup

1. foldMap :: Monoid m => (a -> m) -> Patricia a -> m

   radix-tree	Data.Patricia.Word.Lazy

   Map each element in the tree to a monoid and combine the results.

2. foldMapWithKey :: Monoid m => (Word -> a -> m) -> Patricia a -> m

   radix-tree	Data.Patricia.Word.Lazy

   Map each element in the tree to a monoid and combine the results.

3. foldMap :: Monoid m => (a -> m) -> Patricia a -> m

   radix-tree	Data.Patricia.Word.Strict

   Map each element in the tree to a monoid and combine the results.

4. foldMapWithKey :: Monoid m => (Word -> a -> m) -> Patricia a -> m

   radix-tree	Data.Patricia.Word.Strict

   Map each element in the tree to a monoid and combine the results.

5. foldMap :: Monoid m => (a -> m) -> Radix1Tree a -> m

   radix-tree	Data.Radix1Tree.Word8.Lazy

   Map each element in the tree to a monoid and combine the results.

6. foldMapWithKey :: Monoid m => (Build1 -> a -> m) -> Radix1Tree a -> m

   radix-tree	Data.Radix1Tree.Word8.Lazy

   Map each element in the tree to a monoid and combine the results.

7. foldMap :: Monoid m => (a -> m) -> Radix1Tree a -> m

   radix-tree	Data.Radix1Tree.Word8.Strict

   Map each element in the tree to a monoid and combine the results.

8. foldMapWithKey :: Monoid m => (Build1 -> a -> m) -> Radix1Tree a -> m

   radix-tree	Data.Radix1Tree.Word8.Strict

   Map each element in the tree to a monoid and combine the results.

9. foldMap :: Monoid m => (a -> m) -> RadixTree a -> m

   radix-tree	Data.RadixTree.Word8.Lazy

   Map each element in the tree to a monoid and combine the results.

10. foldMapWithKey :: Monoid m => (Build -> a -> m) -> RadixTree a -> m

    radix-tree	Data.RadixTree.Word8.Lazy

    Map each element in the tree to a monoid and combine the results.

Page 1207 of many | Previous | Next