Safe Haskell	None
Language	Haskell2010

Data.Foldable1

Documentation

class Foldable f => Foldable1 f where #

Minimal complete definition

foldMap1 | toNonEmpty

Methods

fold1 :: Semigroup a => f a -> a #

foldMap1 :: Semigroup b => (a -> b) -> f a -> b #

foldr1 :: (a -> a -> a) -> f a -> a #

foldl1 :: (a -> a -> a) -> f a -> a #

foldr1' :: (a -> a -> a) -> f a -> a #

foldl1' :: (a -> a -> a) -> f a -> a #

toNonEmpty :: f a -> NonEmpty a #

maximum :: Ord a => f a -> a #

minimum :: Ord a => f a -> a #

Instances

Foldable1 Identity #
Instance details Defined in Data.Foldable1 Methods fold1 :: Semigroup a => Identity a -> a # foldMap1 :: Semigroup b => (a -> b) -> Identity a -> b # foldr1 :: (a -> a -> a) -> Identity a -> a # foldl1 :: (a -> a -> a) -> Identity a -> a # foldr1' :: (a -> a -> a) -> Identity a -> a # foldl1' :: (a -> a -> a) -> Identity a -> a # toNonEmpty :: Identity a -> NonEmpty a # maximum :: Ord a => Identity a -> a # minimum :: Ord a => Identity a -> a #
Foldable1 NonEmpty #
Instance details Defined in Data.Foldable1 Methods fold1 :: Semigroup a => NonEmpty a -> a # foldMap1 :: Semigroup b => (a -> b) -> NonEmpty a -> b # foldr1 :: (a -> a -> a) -> NonEmpty a -> a # foldl1 :: (a -> a -> a) -> NonEmpty a -> a # foldr1' :: (a -> a -> a) -> NonEmpty a -> a # foldl1' :: (a -> a -> a) -> NonEmpty a -> a # toNonEmpty :: NonEmpty a -> NonEmpty a # maximum :: Ord a => NonEmpty a -> a # minimum :: Ord a => NonEmpty a -> a #
Foldable1 ((,) a) #
Instance details Defined in Data.Foldable1 Methods fold1 :: Semigroup a0 => (a, a0) -> a0 # foldMap1 :: Semigroup b => (a0 -> b) -> (a, a0) -> b # foldr1 :: (a0 -> a0 -> a0) -> (a, a0) -> a0 # foldl1 :: (a0 -> a0 -> a0) -> (a, a0) -> a0 # foldr1' :: (a0 -> a0 -> a0) -> (a, a0) -> a0 # foldl1' :: (a0 -> a0 -> a0) -> (a, a0) -> a0 # toNonEmpty :: (a, a0) -> NonEmpty a0 # maximum :: Ord a0 => (a, a0) -> a0 # minimum :: Ord a0 => (a, a0) -> a0 #
Foldable1 f => Foldable1 (Reverse f) #
Instance details Defined in Data.Foldable1 Methods fold1 :: Semigroup a => Reverse f a -> a # foldMap1 :: Semigroup b => (a -> b) -> Reverse f a -> b # foldr1 :: (a -> a -> a) -> Reverse f a -> a # foldl1 :: (a -> a -> a) -> Reverse f a -> a # foldr1' :: (a -> a -> a) -> Reverse f a -> a # foldl1' :: (a -> a -> a) -> Reverse f a -> a # toNonEmpty :: Reverse f a -> NonEmpty a # maximum :: Ord a => Reverse f a -> a # minimum :: Ord a => Reverse f a -> a #
Foldable1 f => Foldable1 (Backwards f) #
Instance details Defined in Data.Foldable1 Methods fold1 :: Semigroup a => Backwards f a -> a # foldMap1 :: Semigroup b => (a -> b) -> Backwards f a -> b # foldr1 :: (a -> a -> a) -> Backwards f a -> a # foldl1 :: (a -> a -> a) -> Backwards f a -> a # foldr1' :: (a -> a -> a) -> Backwards f a -> a # foldl1' :: (a -> a -> a) -> Backwards f a -> a # toNonEmpty :: Backwards f a -> NonEmpty a # maximum :: Ord a => Backwards f a -> a # minimum :: Ord a => Backwards f a -> a #
(Foldable1 f, Foldable1 g) => Foldable1 (Product f g) #
Instance details Defined in Data.Foldable1 Methods fold1 :: Semigroup a => Product f g a -> a # foldMap1 :: Semigroup b => (a -> b) -> Product f g a -> b # foldr1 :: (a -> a -> a) -> Product f g a -> a # foldl1 :: (a -> a -> a) -> Product f g a -> a # foldr1' :: (a -> a -> a) -> Product f g a -> a # foldl1' :: (a -> a -> a) -> Product f g a -> a # toNonEmpty :: Product f g a -> NonEmpty a # maximum :: Ord a => Product f g a -> a # minimum :: Ord a => Product f g a -> a #
(Foldable1 f, Foldable1 g) => Foldable1 (Sum f g) #
Instance details Defined in Data.Foldable1 Methods fold1 :: Semigroup a => Sum f g a -> a # foldMap1 :: Semigroup b => (a -> b) -> Sum f g a -> b # foldr1 :: (a -> a -> a) -> Sum f g a -> a # foldl1 :: (a -> a -> a) -> Sum f g a -> a # foldr1' :: (a -> a -> a) -> Sum f g a -> a # foldl1' :: (a -> a -> a) -> Sum f g a -> a # toNonEmpty :: Sum f g a -> NonEmpty a # maximum :: Ord a => Sum f g a -> a # minimum :: Ord a => Sum f g a -> a #
(Foldable1 f, Foldable1 g) => Foldable1 (Compose f g) #
Instance details Defined in Data.Foldable1 Methods fold1 :: Semigroup a => Compose f g a -> a # foldMap1 :: Semigroup b => (a -> b) -> Compose f g a -> b # foldr1 :: (a -> a -> a) -> Compose f g a -> a # foldl1 :: (a -> a -> a) -> Compose f g a -> a # foldr1' :: (a -> a -> a) -> Compose f g a -> a # foldl1' :: (a -> a -> a) -> Compose f g a -> a # toNonEmpty :: Compose f g a -> NonEmpty a # maximum :: Ord a => Compose f g a -> a # minimum :: Ord a => Compose f g a -> a #

intercalate :: (Foldable1 f, Semigroup a) => a -> f a -> a #

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

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