Copyright	(C) 2011-2015 Edward Kmett
License	BSD-style (see the file LICENSE)
Maintainer	Edward Kmett <ekmett@gmail.com>
Stability	provisional
Portability	portable
Safe Haskell	Safe
Language	Haskell98

Data.Semigroup.Foldable

Description

Synopsis

Documentation

class Foldable t => Foldable1 t where #

Methods

fold1 :: Semigroup m => t m -> m #

foldMap1 :: Semigroup m => (a -> m) -> t a -> m #

toNonEmpty :: t a -> NonEmpty a #

Instances

Foldable1 V1 #
Methods fold1 :: Semigroup m => V1 m -> m # foldMap1 :: Semigroup m => (a -> m) -> V1 a -> m # toNonEmpty :: V1 a -> NonEmpty a #
Foldable1 Par1 #
Methods fold1 :: Semigroup m => Par1 m -> m # foldMap1 :: Semigroup m => (a -> m) -> Par1 a -> m # toNonEmpty :: Par1 a -> NonEmpty a #
Foldable1 Identity #
Methods fold1 :: Semigroup m => Identity m -> m # foldMap1 :: Semigroup m => (a -> m) -> Identity a -> m # toNonEmpty :: Identity a -> NonEmpty a #
Foldable1 NonEmpty #
Methods fold1 :: Semigroup m => NonEmpty m -> m # foldMap1 :: Semigroup m => (a -> m) -> NonEmpty a -> m # toNonEmpty :: NonEmpty a -> NonEmpty a #
Foldable1 Complex #
Methods fold1 :: Semigroup m => Complex m -> m # foldMap1 :: Semigroup m => (a -> m) -> Complex a -> m # toNonEmpty :: Complex a -> NonEmpty a #
Foldable1 Tree #
Methods fold1 :: Semigroup m => Tree m -> m # foldMap1 :: Semigroup m => (a -> m) -> Tree a -> m # toNonEmpty :: Tree a -> NonEmpty a #
Foldable1 f => Foldable1 (Rec1 f) #
Methods fold1 :: Semigroup m => Rec1 f m -> m # foldMap1 :: Semigroup m => (a -> m) -> Rec1 f a -> m # toNonEmpty :: Rec1 f a -> NonEmpty a #
Foldable1 ((,) a) #
Methods fold1 :: Semigroup m => (a, m) -> m # foldMap1 :: Semigroup m => (a -> m) -> (a, a) -> m # toNonEmpty :: (a, a) -> NonEmpty a #
Foldable1 f => Foldable1 (Lift f) #
Methods fold1 :: Semigroup m => Lift f m -> m # foldMap1 :: Semigroup m => (a -> m) -> Lift f a -> m # toNonEmpty :: Lift f a -> NonEmpty a #
(Foldable1 f, Foldable1 g) => Foldable1 ((:+:) f g) #
Methods fold1 :: Semigroup m => (f :+: g) m -> m # foldMap1 :: Semigroup m => (a -> m) -> (f :+: g) a -> m # toNonEmpty :: (f :+: g) a -> NonEmpty a #
(Foldable1 f, Foldable1 g) => Foldable1 ((:*:) f g) #
Methods fold1 :: Semigroup m => (f :: g) m -> m # foldMap1 :: Semigroup m => (a -> m) -> (f :: g) a -> m # toNonEmpty :: (f :*: g) a -> NonEmpty a #
(Foldable1 f, Foldable1 g) => Foldable1 ((:.:) f g) #
Methods fold1 :: Semigroup m => (f :.: g) m -> m # foldMap1 :: Semigroup m => (a -> m) -> (f :.: g) a -> m # toNonEmpty :: (f :.: g) a -> NonEmpty a #
Bifoldable1 p => Foldable1 (Join * p) #
Methods fold1 :: Semigroup m => Join * p m -> m # foldMap1 :: Semigroup m => (a -> m) -> Join * p a -> m # toNonEmpty :: Join * p a -> NonEmpty a #
Foldable1 m => Foldable1 (IdentityT * m) #
Methods fold1 :: Semigroup m => IdentityT * m m -> m # foldMap1 :: Semigroup m => (a -> m) -> IdentityT * m a -> m # toNonEmpty :: IdentityT * m a -> NonEmpty a #
Foldable1 (Tagged * a) #
Methods fold1 :: Semigroup m => Tagged * a m -> m # foldMap1 :: Semigroup m => (a -> m) -> Tagged * a a -> m # toNonEmpty :: Tagged * a a -> NonEmpty a #
Foldable1 f => Foldable1 (Reverse * f) #
Methods fold1 :: Semigroup m => Reverse * f m -> m # foldMap1 :: Semigroup m => (a -> m) -> Reverse * f a -> m # toNonEmpty :: Reverse * f a -> NonEmpty a #
Foldable1 f => Foldable1 (Backwards * f) #
Methods fold1 :: Semigroup m => Backwards * f m -> m # foldMap1 :: Semigroup m => (a -> m) -> Backwards * f a -> m # toNonEmpty :: Backwards * f a -> NonEmpty a #
Foldable1 f => Foldable1 (M1 i c f) #
Methods fold1 :: Semigroup m => M1 i c f m -> m # foldMap1 :: Semigroup m => (a -> m) -> M1 i c f a -> m # toNonEmpty :: M1 i c f a -> NonEmpty a #
(Foldable1 f, Foldable1 g) => Foldable1 (Sum * f g) #
Methods fold1 :: Semigroup m => Sum * f g m -> m # foldMap1 :: Semigroup m => (a -> m) -> Sum * f g a -> m # toNonEmpty :: Sum * f g a -> NonEmpty a #
(Foldable1 f, Foldable1 g) => Foldable1 (Product * f g) #
Methods fold1 :: Semigroup m => Product * f g m -> m # foldMap1 :: Semigroup m => (a -> m) -> Product * f g a -> m # toNonEmpty :: Product * f g a -> NonEmpty a #
(Foldable1 f, Foldable1 g) => Foldable1 (Compose * * f g) #
Methods fold1 :: Semigroup m => Compose * * f g m -> m # foldMap1 :: Semigroup m => (a -> m) -> Compose * * f g a -> m # toNonEmpty :: Compose * * f g a -> NonEmpty a #
Foldable1 g => Foldable1 (Joker * * g a) #
Methods fold1 :: Semigroup m => Joker * * g a m -> m # foldMap1 :: Semigroup m => (a -> m) -> Joker * * g a a -> m # toNonEmpty :: Joker * * g a a -> NonEmpty a #

intercalate1 :: (Foldable1 t, Semigroup m) => m -> t m -> m #

Insert an m between each pair of 't m'. Equivalent to intercalateMap1 with id as the second argument.

>>> intercalate1 ", " $ "hello" :| ["how", "are", "you"]
"hello, how, are, you"

>>> intercalate1 ", " $ "hello" :| []
"hello"

>>> intercalate1 mempty $ "I" :| ["Am", "Fine", "You?"]
"IAmFineYou?"

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

Insert m between each pair of m derived from a.

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

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

traverse1_ :: (Foldable1 t, Apply f) => (a -> f b) -> t a -> f () #

for1_ :: (Foldable1 t, Apply f) => t a -> (a -> f b) -> f () #

sequenceA1_ :: (Foldable1 t, Apply f) => t (f a) -> f () #

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

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

asum1 :: (Foldable1 t, Alt m) => t (m a) -> m a #

foldrM1 :: (Foldable1 t, Monad m) => (a -> a -> m a) -> t a -> m a #

Monadic fold over the elements of a non-empty structure, associating to the right, i.e. from right to left.

let g = (=<<) . f
in foldrM1 f (x1 :| [x2, ..., xn]) == x1 `g` (x2 `g` ... (xn-1 `f` xn)...)

foldlM1 :: (Foldable1 t, Monad m) => (a -> a -> m a) -> t a -> m a #

Monadic fold over the elements of a non-empty structure, associating to the left, i.e. from left to right.

let g = flip $ (=<<) . f
in foldlM1 f (x1 :| [x2, ..., xn]) == (...((x1 `f` x2) `g` x2) `g`...) `g` xn