Hoogle Search

Within LTS Haskell 24.51 (ghc-9.10.3)

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

Exact lookup

1. bifoldMap1 :: (Bifoldable1 t, Semigroup m) => (a -> m) -> (b -> m) -> t a b -> m

   semigroupoids	Data.Semigroup.Bifoldable

   No documentation available.

2. bifoldMapDefault1 :: (Bifoldable1 t, Monoid m) => (a -> m) -> (b -> m) -> t a b -> m

   semigroupoids	Data.Semigroup.Bifoldable

   Usable default for foldMap, but only if you define bifoldMap1 yourself

3. bifoldMap1Default :: (Bitraversable1 t, Semigroup m) => (a -> m) -> (b -> m) -> t a b -> m

   semigroupoids	Data.Semigroup.Bitraversable

   No documentation available.

4. foldMap1 :: (Foldable1 t, Semigroup m) => (a -> m) -> t a -> m

   semigroupoids	Data.Semigroup.Foldable

   Map each element of the structure to a semigroup, and combine the results with (<>). This fold is right-associative and lazy in the accumulator. For strict left-associative folds consider foldMap1' instead.

   >>> foldMap1 (:[]) (1 :| [2, 3, 4])
   [1,2,3,4]
   

5. foldMapDefault1 :: (Foldable1 t, Monoid m) => (a -> m) -> t a -> m

   semigroupoids	Data.Semigroup.Foldable

   Usable default for foldMap, but only if you define foldMap1 yourself

6. gfoldMap1 :: (Foldable1 (Rep1 t), Generic1 t, Semigroup m) => (a -> m) -> t a -> m

   semigroupoids	Data.Semigroup.Foldable

   Generic foldMap1. Caveats are the same as for gfold1.

7. intercalateMap1 :: (Foldable1 t, Semigroup m) => m -> (a -> m) -> t a -> m

   semigroupoids	Data.Semigroup.Foldable

   Insert m between each pair of m derived from a.

   >>> intercalateMap1 " " show $ True :| [False, True]
   "True False True"
   

   >>> intercalateMap1 " " show $ True :| []
   "True"
   

8. bifoldMap1 :: (Bifoldable1 t, Semigroup m) => (a -> m) -> (b -> m) -> t a b -> m

   semigroupoids	Data.Semigroup.Foldable.Class

   No documentation available.

9. foldMap1 :: (Foldable1 t, Semigroup m) => (a -> m) -> t a -> m

   semigroupoids	Data.Semigroup.Foldable.Class

   Map each element of the structure to a semigroup, and combine the results with (<>). This fold is right-associative and lazy in the accumulator. For strict left-associative folds consider foldMap1' instead.

   >>> foldMap1 (:[]) (1 :| [2, 3, 4])
   [1,2,3,4]
   

10. foldMap1Default :: (Traversable1 f, Semigroup m) => (a -> m) -> f a -> m

    semigroupoids	Data.Semigroup.Traversable

    Default implementation of foldMap1 given an implementation of Traversable1.

Page 436 of many | Previous | Next