foldable1-classes-compat-0.1: Compatibility package for the Foldable1 and Bifoldable1 type classes

Data.Foldable1

Description

A class of non-empty data structures that can be folded to a summary value.

Synopsis

# Documentation

class Foldable t => Foldable1 t where Source #

Non-empty data structures that can be folded.

Minimal complete definition

Methods

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

Combine the elements of a structure using a semigroup.

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

Map each element of the structure to a semigroup, and combine the results.

>>> foldMap1 Sum (1 :| [2, 3, 4])
Sum {getSum = 10}


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

A variant of foldMap1 that is strict in the accumulator.

>>> foldMap1' Sum (1 :| [2, 3, 4])
Sum {getSum = 10}


toNonEmpty :: t a -> NonEmpty a Source #

List of elements of a structure, from left to right.

>>> toNonEmpty (Identity 2)
2 :| []


maximum :: Ord a => t a -> a Source #

The largest element of a non-empty structure.

>>> maximum (32 :| [64, 8, 128, 16])
128


minimum :: Ord a => t a -> a Source #

The least element of a non-empty structure.

>>> minimum (32 :| [64, 8, 128, 16])
8


head :: t a -> a Source #

The first element of a non-empty structure.

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


last :: t a -> a Source #

The last element of a non-empty structure.

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


foldrMap1 :: (a -> b) -> (a -> b -> b) -> t a -> b Source #

Generalized foldr1.

foldlMap1' :: (a -> b) -> (b -> a -> b) -> t a -> b Source #

Generalized foldl1'.

foldlMap1 :: (a -> b) -> (b -> a -> b) -> t a -> b Source #

Generalized foldl1.

foldrMap1' :: (a -> b) -> (a -> b -> b) -> t a -> b Source #

Generalized foldr1'.

#### Instances

Instances details
 Source # Instance detailsDefined in Data.Foldable1 Methodsfold1 :: Semigroup m => Complex m -> m Source #foldMap1 :: Semigroup m => (a -> m) -> Complex a -> m Source #foldMap1' :: Semigroup m => (a -> m) -> Complex a -> m Source #maximum :: Ord a => Complex a -> a Source #minimum :: Ord a => Complex a -> a Source #head :: Complex a -> a Source #last :: Complex a -> a Source #foldrMap1 :: (a -> b) -> (a -> b -> b) -> Complex a -> b Source #foldlMap1' :: (a -> b) -> (b -> a -> b) -> Complex a -> b Source #foldlMap1 :: (a -> b) -> (b -> a -> b) -> Complex a -> b Source #foldrMap1' :: (a -> b) -> (a -> b -> b) -> Complex a -> b Source # Source # Instance detailsDefined in Data.Foldable1 Methodsfold1 :: Semigroup m => Identity m -> m Source #foldMap1 :: Semigroup m => (a -> m) -> Identity a -> m Source #foldMap1' :: Semigroup m => (a -> m) -> Identity a -> m Source #maximum :: Ord a => Identity a -> a Source #minimum :: Ord a => Identity a -> a Source #head :: Identity a -> a Source #last :: Identity a -> a Source #foldrMap1 :: (a -> b) -> (a -> b -> b) -> Identity a -> b Source #foldlMap1' :: (a -> b) -> (b -> a -> b) -> Identity a -> b Source #foldlMap1 :: (a -> b) -> (b -> a -> b) -> Identity a -> b Source #foldrMap1' :: (a -> b) -> (a -> b -> b) -> Identity a -> b Source # Source # Instance detailsDefined in Data.Foldable1 Methodsfold1 :: Semigroup m => Down m -> m Source #foldMap1 :: Semigroup m => (a -> m) -> Down a -> m Source #foldMap1' :: Semigroup m => (a -> m) -> Down a -> m Source #maximum :: Ord a => Down a -> a Source #minimum :: Ord a => Down a -> a Source #head :: Down a -> a Source #last :: Down a -> a Source #foldrMap1 :: (a -> b) -> (a -> b -> b) -> Down a -> b Source #foldlMap1' :: (a -> b) -> (b -> a -> b) -> Down a -> b Source #foldlMap1 :: (a -> b) -> (b -> a -> b) -> Down a -> b Source #foldrMap1' :: (a -> b) -> (a -> b -> b) -> Down a -> b Source # Source # Instance detailsDefined in Data.Foldable1 Methodsfold1 :: Semigroup m => First m -> m Source #foldMap1 :: Semigroup m => (a -> m) -> First a -> m Source #foldMap1' :: Semigroup m => (a -> m) -> First a -> m Source #maximum :: Ord a => First a -> a Source #minimum :: Ord a => First a -> a Source #head :: First a -> a Source #last :: First a -> a Source #foldrMap1 :: (a -> b) -> (a -> b -> b) -> First a -> b Source #foldlMap1' :: (a -> b) -> (b -> a -> b) -> First a -> b Source #foldlMap1 :: (a -> b) -> (b -> a -> b) -> First a -> b Source #foldrMap1' :: (a -> b) -> (a -> b -> b) -> First a -> b Source # Source # Instance detailsDefined in Data.Foldable1 Methodsfold1 :: Semigroup m => Last m -> m Source #foldMap1 :: Semigroup m => (a -> m) -> Last a -> m Source #foldMap1' :: Semigroup m => (a -> m) -> Last a -> m Source #maximum :: Ord a => Last a -> a Source #minimum :: Ord a => Last a -> a Source #head :: Last a -> a Source #last :: Last a -> a Source #foldrMap1 :: (a -> b) -> (a -> b -> b) -> Last a -> b Source #foldlMap1' :: (a -> b) -> (b -> a -> b) -> Last a -> b Source #foldlMap1 :: (a -> b) -> (b -> a -> b) -> Last a -> b Source #foldrMap1' :: (a -> b) -> (a -> b -> b) -> Last a -> b Source # Source # Instance detailsDefined in Data.Foldable1 Methodsfold1 :: Semigroup m => Max m -> m Source #foldMap1 :: Semigroup m => (a -> m) -> Max a -> m Source #foldMap1' :: Semigroup m => (a -> m) -> Max a -> m Source #toNonEmpty :: Max a -> NonEmpty a Source #maximum :: Ord a => Max a -> a Source #minimum :: Ord a => Max a -> a Source #head :: Max a -> a Source #last :: Max a -> a Source #foldrMap1 :: (a -> b) -> (a -> b -> b) -> Max a -> b Source #foldlMap1' :: (a -> b) -> (b -> a -> b) -> Max a -> b Source #foldlMap1 :: (a -> b) -> (b -> a -> b) -> Max a -> b Source #foldrMap1' :: (a -> b) -> (a -> b -> b) -> Max a -> b Source # Source # Instance detailsDefined in Data.Foldable1 Methodsfold1 :: Semigroup m => Min m -> m Source #foldMap1 :: Semigroup m => (a -> m) -> Min a -> m Source #foldMap1' :: Semigroup m => (a -> m) -> Min a -> m Source #toNonEmpty :: Min a -> NonEmpty a Source #maximum :: Ord a => Min a -> a Source #minimum :: Ord a => Min a -> a Source #head :: Min a -> a Source #last :: Min a -> a Source #foldrMap1 :: (a -> b) -> (a -> b -> b) -> Min a -> b Source #foldlMap1' :: (a -> b) -> (b -> a -> b) -> Min a -> b Source #foldlMap1 :: (a -> b) -> (b -> a -> b) -> Min a -> b Source #foldrMap1' :: (a -> b) -> (a -> b -> b) -> Min a -> b Source # Source # Instance detailsDefined in Data.Foldable1 Methodsfold1 :: Semigroup m => Dual m -> m Source #foldMap1 :: Semigroup m => (a -> m) -> Dual a -> m Source #foldMap1' :: Semigroup m => (a -> m) -> Dual a -> m Source #maximum :: Ord a => Dual a -> a Source #minimum :: Ord a => Dual a -> a Source #head :: Dual a -> a Source #last :: Dual a -> a Source #foldrMap1 :: (a -> b) -> (a -> b -> b) -> Dual a -> b Source #foldlMap1' :: (a -> b) -> (b -> a -> b) -> Dual a -> b Source #foldlMap1 :: (a -> b) -> (b -> a -> b) -> Dual a -> b Source #foldrMap1' :: (a -> b) -> (a -> b -> b) -> Dual a -> b Source # Source # Instance detailsDefined in Data.Foldable1 Methodsfold1 :: Semigroup m => Product m -> m Source #foldMap1 :: Semigroup m => (a -> m) -> Product a -> m Source #foldMap1' :: Semigroup m => (a -> m) -> Product a -> m Source #maximum :: Ord a => Product a -> a Source #minimum :: Ord a => Product a -> a Source #head :: Product a -> a Source #last :: Product a -> a Source #foldrMap1 :: (a -> b) -> (a -> b -> b) -> Product a -> b Source #foldlMap1' :: (a -> b) -> (b -> a -> b) -> Product a -> b Source #foldlMap1 :: (a -> b) -> (b -> a -> b) -> Product a -> b Source #foldrMap1' :: (a -> b) -> (a -> b -> b) -> Product a -> b Source # Source # Instance detailsDefined in Data.Foldable1 Methodsfold1 :: Semigroup m => Sum m -> m Source #foldMap1 :: Semigroup m => (a -> m) -> Sum a -> m Source #foldMap1' :: Semigroup m => (a -> m) -> Sum a -> m Source #toNonEmpty :: Sum a -> NonEmpty a Source #maximum :: Ord a => Sum a -> a Source #minimum :: Ord a => Sum a -> a Source #head :: Sum a -> a Source #last :: Sum a -> a Source #foldrMap1 :: (a -> b) -> (a -> b -> b) -> Sum a -> b Source #foldlMap1' :: (a -> b) -> (b -> a -> b) -> Sum a -> b Source #foldlMap1 :: (a -> b) -> (b -> a -> b) -> Sum a -> b Source #foldrMap1' :: (a -> b) -> (a -> b -> b) -> Sum a -> b Source # Source # Instance detailsDefined in Data.Foldable1 Methodsfold1 :: Semigroup m => Par1 m -> m Source #foldMap1 :: Semigroup m => (a -> m) -> Par1 a -> m Source #foldMap1' :: Semigroup m => (a -> m) -> Par1 a -> m Source #maximum :: Ord a => Par1 a -> a Source #minimum :: Ord a => Par1 a -> a Source #head :: Par1 a -> a Source #last :: Par1 a -> a Source #foldrMap1 :: (a -> b) -> (a -> b -> b) -> Par1 a -> b Source #foldlMap1' :: (a -> b) -> (b -> a -> b) -> Par1 a -> b Source #foldlMap1 :: (a -> b) -> (b -> a -> b) -> Par1 a -> b Source #foldrMap1' :: (a -> b) -> (a -> b -> b) -> Par1 a -> b Source # Source # Instance detailsDefined in Data.Foldable1 Methodsfold1 :: Semigroup m => Tree m -> m Source #foldMap1 :: Semigroup m => (a -> m) -> Tree a -> m Source #foldMap1' :: Semigroup m => (a -> m) -> Tree a -> m Source #maximum :: Ord a => Tree a -> a Source #minimum :: Ord a => Tree a -> a Source #head :: Tree a -> a Source #last :: Tree a -> a Source #foldrMap1 :: (a -> b) -> (a -> b -> b) -> Tree a -> b Source #foldlMap1' :: (a -> b) -> (b -> a -> b) -> Tree a -> b Source #foldlMap1 :: (a -> b) -> (b -> a -> b) -> Tree a -> b Source #foldrMap1' :: (a -> b) -> (a -> b -> b) -> Tree a -> b Source # Source # Instance detailsDefined in Data.Foldable1 Methodsfold1 :: Semigroup m => NonEmpty m -> m Source #foldMap1 :: Semigroup m => (a -> m) -> NonEmpty a -> m Source #foldMap1' :: Semigroup m => (a -> m) -> NonEmpty a -> m Source #maximum :: Ord a => NonEmpty a -> a Source #minimum :: Ord a => NonEmpty a -> a Source #head :: NonEmpty a -> a Source #last :: NonEmpty a -> a Source #foldrMap1 :: (a -> b) -> (a -> b -> b) -> NonEmpty a -> b Source #foldlMap1' :: (a -> b) -> (b -> a -> b) -> NonEmpty a -> b Source #foldlMap1 :: (a -> b) -> (b -> a -> b) -> NonEmpty a -> b Source #foldrMap1' :: (a -> b) -> (a -> b -> b) -> NonEmpty a -> b Source # Source # Instance detailsDefined in Data.Foldable1 Methodsfold1 :: Semigroup m => Solo m -> m Source #foldMap1 :: Semigroup m => (a -> m) -> Solo a -> m Source #foldMap1' :: Semigroup m => (a -> m) -> Solo a -> m Source #maximum :: Ord a => Solo a -> a Source #minimum :: Ord a => Solo a -> a Source #head :: Solo a -> a Source #last :: Solo a -> a Source #foldrMap1 :: (a -> b) -> (a -> b -> b) -> Solo a -> b Source #foldlMap1' :: (a -> b) -> (b -> a -> b) -> Solo a -> b Source #foldlMap1 :: (a -> b) -> (b -> a -> b) -> Solo a -> b Source #foldrMap1' :: (a -> b) -> (a -> b -> b) -> Solo a -> b Source # Source # Instance detailsDefined in Data.Foldable1 Methodsfold1 :: Semigroup m => V1 m -> m Source #foldMap1 :: Semigroup m => (a -> m) -> V1 a -> m Source #foldMap1' :: Semigroup m => (a -> m) -> V1 a -> m Source #toNonEmpty :: V1 a -> NonEmpty a Source #maximum :: Ord a => V1 a -> a Source #minimum :: Ord a => V1 a -> a Source #head :: V1 a -> a Source #last :: V1 a -> a Source #foldrMap1 :: (a -> b) -> (a -> b -> b) -> V1 a -> b Source #foldlMap1' :: (a -> b) -> (b -> a -> b) -> V1 a -> b Source #foldlMap1 :: (a -> b) -> (b -> a -> b) -> V1 a -> b Source #foldrMap1' :: (a -> b) -> (a -> b -> b) -> V1 a -> b Source # Foldable1 f => Foldable1 (Lift f) Source # Instance detailsDefined in Data.Foldable1 Methodsfold1 :: Semigroup m => Lift f m -> m Source #foldMap1 :: Semigroup m => (a -> m) -> Lift f a -> m Source #foldMap1' :: Semigroup m => (a -> m) -> Lift f a -> m Source #toNonEmpty :: Lift f a -> NonEmpty a Source #maximum :: Ord a => Lift f a -> a Source #minimum :: Ord a => Lift f a -> a Source #head :: Lift f a -> a Source #last :: Lift f a -> a Source #foldrMap1 :: (a -> b) -> (a -> b -> b) -> Lift f a -> b Source #foldlMap1' :: (a -> b) -> (b -> a -> b) -> Lift f a -> b Source #foldlMap1 :: (a -> b) -> (b -> a -> b) -> Lift f a -> b Source #foldrMap1' :: (a -> b) -> (a -> b -> b) -> Lift f a -> b Source # Foldable1 ((,) a) Source # Instance detailsDefined in Data.Foldable1 Methodsfold1 :: Semigroup m => (a, m) -> m Source #foldMap1 :: Semigroup m => (a0 -> m) -> (a, a0) -> m Source #foldMap1' :: Semigroup m => (a0 -> m) -> (a, a0) -> m Source #toNonEmpty :: (a, a0) -> NonEmpty a0 Source #maximum :: Ord a0 => (a, a0) -> a0 Source #minimum :: Ord a0 => (a, a0) -> a0 Source #head :: (a, a0) -> a0 Source #last :: (a, a0) -> a0 Source #foldrMap1 :: (a0 -> b) -> (a0 -> b -> b) -> (a, a0) -> b Source #foldlMap1' :: (a0 -> b) -> (b -> a0 -> b) -> (a, a0) -> b Source #foldlMap1 :: (a0 -> b) -> (b -> a0 -> b) -> (a, a0) -> b Source #foldrMap1' :: (a0 -> b) -> (a0 -> b -> b) -> (a, a0) -> b Source # Foldable1 f => Foldable1 (Ap f) Source # Instance detailsDefined in Data.Foldable1 Methodsfold1 :: Semigroup m => Ap f m -> m Source #foldMap1 :: Semigroup m => (a -> m) -> Ap f a -> m Source #foldMap1' :: Semigroup m => (a -> m) -> Ap f a -> m Source #toNonEmpty :: Ap f a -> NonEmpty a Source #maximum :: Ord a => Ap f a -> a Source #minimum :: Ord a => Ap f a -> a Source #head :: Ap f a -> a Source #last :: Ap f a -> a Source #foldrMap1 :: (a -> b) -> (a -> b -> b) -> Ap f a -> b Source #foldlMap1' :: (a -> b) -> (b -> a -> b) -> Ap f a -> b Source #foldlMap1 :: (a -> b) -> (b -> a -> b) -> Ap f a -> b Source #foldrMap1' :: (a -> b) -> (a -> b -> b) -> Ap f a -> b Source # Foldable1 f => Foldable1 (Alt f) Source # Instance detailsDefined in Data.Foldable1 Methodsfold1 :: Semigroup m => Alt f m -> m Source #foldMap1 :: Semigroup m => (a -> m) -> Alt f a -> m Source #foldMap1' :: Semigroup m => (a -> m) -> Alt f a -> m Source #toNonEmpty :: Alt f a -> NonEmpty a Source #maximum :: Ord a => Alt f a -> a Source #minimum :: Ord a => Alt f a -> a Source #head :: Alt f a -> a Source #last :: Alt f a -> a Source #foldrMap1 :: (a -> b) -> (a -> b -> b) -> Alt f a -> b Source #foldlMap1' :: (a -> b) -> (b -> a -> b) -> Alt f a -> b Source #foldlMap1 :: (a -> b) -> (b -> a -> b) -> Alt f a -> b Source #foldrMap1' :: (a -> b) -> (a -> b -> b) -> Alt f a -> b Source # Foldable1 f => Foldable1 (Rec1 f) Source # Instance detailsDefined in Data.Foldable1 Methodsfold1 :: Semigroup m => Rec1 f m -> m Source #foldMap1 :: Semigroup m => (a -> m) -> Rec1 f a -> m Source #foldMap1' :: Semigroup m => (a -> m) -> Rec1 f a -> m Source #toNonEmpty :: Rec1 f a -> NonEmpty a Source #maximum :: Ord a => Rec1 f a -> a Source #minimum :: Ord a => Rec1 f a -> a Source #head :: Rec1 f a -> a Source #last :: Rec1 f a -> a Source #foldrMap1 :: (a -> b) -> (a -> b -> b) -> Rec1 f a -> b Source #foldlMap1' :: (a -> b) -> (b -> a -> b) -> Rec1 f a -> b Source #foldlMap1 :: (a -> b) -> (b -> a -> b) -> Rec1 f a -> b Source #foldrMap1' :: (a -> b) -> (a -> b -> b) -> Rec1 f a -> b Source # Source # Instance detailsDefined in Data.Foldable1 Methodsfold1 :: Semigroup m => Tagged b m -> m Source #foldMap1 :: Semigroup m => (a -> m) -> Tagged b a -> m Source #foldMap1' :: Semigroup m => (a -> m) -> Tagged b a -> m Source #toNonEmpty :: Tagged b a -> NonEmpty a Source #maximum :: Ord a => Tagged b a -> a Source #minimum :: Ord a => Tagged b a -> a Source #head :: Tagged b a -> a Source #last :: Tagged b a -> a Source #foldrMap1 :: (a -> b0) -> (a -> b0 -> b0) -> Tagged b a -> b0 Source #foldlMap1' :: (a -> b0) -> (b0 -> a -> b0) -> Tagged b a -> b0 Source #foldlMap1 :: (a -> b0) -> (b0 -> a -> b0) -> Tagged b a -> b0 Source #foldrMap1' :: (a -> b0) -> (a -> b0 -> b0) -> Tagged b a -> b0 Source # Foldable1 f => Foldable1 (Backwards f) Source # Instance detailsDefined in Data.Foldable1 Methodsfold1 :: Semigroup m => Backwards f m -> m Source #foldMap1 :: Semigroup m => (a -> m) -> Backwards f a -> m Source #foldMap1' :: Semigroup m => (a -> m) -> Backwards f a -> m Source #toNonEmpty :: Backwards f a -> NonEmpty a Source #maximum :: Ord a => Backwards f a -> a Source #minimum :: Ord a => Backwards f a -> a Source #head :: Backwards f a -> a Source #last :: Backwards f a -> a Source #foldrMap1 :: (a -> b) -> (a -> b -> b) -> Backwards f a -> b Source #foldlMap1' :: (a -> b) -> (b -> a -> b) -> Backwards f a -> b Source #foldlMap1 :: (a -> b) -> (b -> a -> b) -> Backwards f a -> b Source #foldrMap1' :: (a -> b) -> (a -> b -> b) -> Backwards f a -> b Source # Foldable1 f => Foldable1 (IdentityT f) Source # Instance detailsDefined in Data.Foldable1 Methodsfold1 :: Semigroup m => IdentityT f m -> m Source #foldMap1 :: Semigroup m => (a -> m) -> IdentityT f a -> m Source #foldMap1' :: Semigroup m => (a -> m) -> IdentityT f a -> m Source #toNonEmpty :: IdentityT f a -> NonEmpty a Source #maximum :: Ord a => IdentityT f a -> a Source #minimum :: Ord a => IdentityT f a -> a Source #head :: IdentityT f a -> a Source #last :: IdentityT f a -> a Source #foldrMap1 :: (a -> b) -> (a -> b -> b) -> IdentityT f a -> b Source #foldlMap1' :: (a -> b) -> (b -> a -> b) -> IdentityT f a -> b Source #foldlMap1 :: (a -> b) -> (b -> a -> b) -> IdentityT f a -> b Source #foldrMap1' :: (a -> b) -> (a -> b -> b) -> IdentityT f a -> b Source # Foldable1 f => Foldable1 (Reverse f) Source # Instance detailsDefined in Data.Foldable1 Methodsfold1 :: Semigroup m => Reverse f m -> m Source #foldMap1 :: Semigroup m => (a -> m) -> Reverse f a -> m Source #foldMap1' :: Semigroup m => (a -> m) -> Reverse f a -> m Source #toNonEmpty :: Reverse f a -> NonEmpty a Source #maximum :: Ord a => Reverse f a -> a Source #minimum :: Ord a => Reverse f a -> a Source #head :: Reverse f a -> a Source #last :: Reverse f a -> a Source #foldrMap1 :: (a -> b) -> (a -> b -> b) -> Reverse f a -> b Source #foldlMap1' :: (a -> b) -> (b -> a -> b) -> Reverse f a -> b Source #foldlMap1 :: (a -> b) -> (b -> a -> b) -> Reverse f a -> b Source #foldrMap1' :: (a -> b) -> (a -> b -> b) -> Reverse f a -> b Source # (Foldable1 f, Foldable1 g) => Foldable1 (Product f g) Source # It would be enough for either half of a product to be Foldable1. Other could be Foldable. Instance detailsDefined in Data.Foldable1 Methodsfold1 :: Semigroup m => Product f g m -> m Source #foldMap1 :: Semigroup m => (a -> m) -> Product f g a -> m Source #foldMap1' :: Semigroup m => (a -> m) -> Product f g a -> m Source #toNonEmpty :: Product f g a -> NonEmpty a Source #maximum :: Ord a => Product f g a -> a Source #minimum :: Ord a => Product f g a -> a Source #head :: Product f g a -> a Source #last :: Product f g a -> a Source #foldrMap1 :: (a -> b) -> (a -> b -> b) -> Product f g a -> b Source #foldlMap1' :: (a -> b) -> (b -> a -> b) -> Product f g a -> b Source #foldlMap1 :: (a -> b) -> (b -> a -> b) -> Product f g a -> b Source #foldrMap1' :: (a -> b) -> (a -> b -> b) -> Product f g a -> b Source # (Foldable1 f, Foldable1 g) => Foldable1 (Sum f g) Source # Instance detailsDefined in Data.Foldable1 Methodsfold1 :: Semigroup m => Sum f g m -> m Source #foldMap1 :: Semigroup m => (a -> m) -> Sum f g a -> m Source #foldMap1' :: Semigroup m => (a -> m) -> Sum f g a -> m Source #toNonEmpty :: Sum f g a -> NonEmpty a Source #maximum :: Ord a => Sum f g a -> a Source #minimum :: Ord a => Sum f g a -> a Source #head :: Sum f g a -> a Source #last :: Sum f g a -> a Source #foldrMap1 :: (a -> b) -> (a -> b -> b) -> Sum f g a -> b Source #foldlMap1' :: (a -> b) -> (b -> a -> b) -> Sum f g a -> b Source #foldlMap1 :: (a -> b) -> (b -> a -> b) -> Sum f g a -> b Source #foldrMap1' :: (a -> b) -> (a -> b -> b) -> Sum f g a -> b Source # (Foldable1 f, Foldable1 g) => Foldable1 (f :*: g) Source # Instance detailsDefined in Data.Foldable1 Methodsfold1 :: Semigroup m => (f :*: g) m -> m Source #foldMap1 :: Semigroup m => (a -> m) -> (f :*: g) a -> m Source #foldMap1' :: Semigroup m => (a -> m) -> (f :*: g) a -> m Source #toNonEmpty :: (f :*: g) a -> NonEmpty a Source #maximum :: Ord a => (f :*: g) a -> a Source #minimum :: Ord a => (f :*: g) a -> a Source #head :: (f :*: g) a -> a Source #last :: (f :*: g) a -> a Source #foldrMap1 :: (a -> b) -> (a -> b -> b) -> (f :*: g) a -> b Source #foldlMap1' :: (a -> b) -> (b -> a -> b) -> (f :*: g) a -> b Source #foldlMap1 :: (a -> b) -> (b -> a -> b) -> (f :*: g) a -> b Source #foldrMap1' :: (a -> b) -> (a -> b -> b) -> (f :*: g) a -> b Source # (Foldable1 f, Foldable1 g) => Foldable1 (f :+: g) Source # Instance detailsDefined in Data.Foldable1 Methodsfold1 :: Semigroup m => (f :+: g) m -> m Source #foldMap1 :: Semigroup m => (a -> m) -> (f :+: g) a -> m Source #foldMap1' :: Semigroup m => (a -> m) -> (f :+: g) a -> m Source #toNonEmpty :: (f :+: g) a -> NonEmpty a Source #maximum :: Ord a => (f :+: g) a -> a Source #minimum :: Ord a => (f :+: g) a -> a Source #head :: (f :+: g) a -> a Source #last :: (f :+: g) a -> a Source #foldrMap1 :: (a -> b) -> (a -> b -> b) -> (f :+: g) a -> b Source #foldlMap1' :: (a -> b) -> (b -> a -> b) -> (f :+: g) a -> b Source #foldlMap1 :: (a -> b) -> (b -> a -> b) -> (f :+: g) a -> b Source #foldrMap1' :: (a -> b) -> (a -> b -> b) -> (f :+: g) a -> b Source # (Foldable1 f, Foldable1 g) => Foldable1 (Compose f g) Source # Instance detailsDefined in Data.Foldable1 Methodsfold1 :: Semigroup m => Compose f g m -> m Source #foldMap1 :: Semigroup m => (a -> m) -> Compose f g a -> m Source #foldMap1' :: Semigroup m => (a -> m) -> Compose f g a -> m Source #toNonEmpty :: Compose f g a -> NonEmpty a Source #maximum :: Ord a => Compose f g a -> a Source #minimum :: Ord a => Compose f g a -> a Source #head :: Compose f g a -> a Source #last :: Compose f g a -> a Source #foldrMap1 :: (a -> b) -> (a -> b -> b) -> Compose f g a -> b Source #foldlMap1' :: (a -> b) -> (b -> a -> b) -> Compose f g a -> b Source #foldlMap1 :: (a -> b) -> (b -> a -> b) -> Compose f g a -> b Source #foldrMap1' :: (a -> b) -> (a -> b -> b) -> Compose f g a -> b Source # (Foldable1 f, Foldable1 g) => Foldable1 (f :.: g) Source # Instance detailsDefined in Data.Foldable1 Methodsfold1 :: Semigroup m => (f :.: g) m -> m Source #foldMap1 :: Semigroup m => (a -> m) -> (f :.: g) a -> m Source #foldMap1' :: Semigroup m => (a -> m) -> (f :.: g) a -> m Source #toNonEmpty :: (f :.: g) a -> NonEmpty a Source #maximum :: Ord a => (f :.: g) a -> a Source #minimum :: Ord a => (f :.: g) a -> a Source #head :: (f :.: g) a -> a Source #last :: (f :.: g) a -> a Source #foldrMap1 :: (a -> b) -> (a -> b -> b) -> (f :.: g) a -> b Source #foldlMap1' :: (a -> b) -> (b -> a -> b) -> (f :.: g) a -> b Source #foldlMap1 :: (a -> b) -> (b -> a -> b) -> (f :.: g) a -> b Source #foldrMap1' :: (a -> b) -> (a -> b -> b) -> (f :.: g) a -> b Source # Foldable1 f => Foldable1 (M1 i c f) Source # Instance detailsDefined in Data.Foldable1 Methodsfold1 :: Semigroup m => M1 i c f m -> m Source #foldMap1 :: Semigroup m => (a -> m) -> M1 i c f a -> m Source #foldMap1' :: Semigroup m => (a -> m) -> M1 i c f a -> m Source #toNonEmpty :: M1 i c f a -> NonEmpty a Source #maximum :: Ord a => M1 i c f a -> a Source #minimum :: Ord a => M1 i c f a -> a Source #head :: M1 i c f a -> a Source #last :: M1 i c f a -> a Source #foldrMap1 :: (a -> b) -> (a -> b -> b) -> M1 i c f a -> b Source #foldlMap1' :: (a -> b) -> (b -> a -> b) -> M1 i c f a -> b Source #foldlMap1 :: (a -> b) -> (b -> a -> b) -> M1 i c f a -> b Source #foldrMap1' :: (a -> b) -> (a -> b -> b) -> M1 i c f a -> b Source #

foldr1 :: Foldable1 t => (a -> a -> a) -> t a -> a Source #

Right-associative fold of a structure.

In the case of lists, foldr1, when applied to a binary operator, and a list, reduces the list using the binary operator, from right to left:

foldr1 f [x1, x2, ..., xn] == x1 f (x2 f ... (xn1 f xn )...)

Note that, since the head of the resulting expression is produced by an application of the operator to the first element of the list, foldr1 can produce a terminating expression from an infinite list.

For a general Foldable1 structure this should be semantically identical to,

foldr1 f = foldr1 f . toNonEmpty

foldr1' :: Foldable1 t => (a -> a -> a) -> t a -> a Source #

Right-associative fold of a structure, but with strict application of the operator.

foldl1 :: Foldable1 t => (a -> a -> a) -> t a -> a Source #

Left-associative fold of a structure.

In the case of lists, foldl1, when applied to a binary operator, and a list, reduces the list using the binary operator, from left to right:

foldl1 f [x1, x2, ..., xn] == (...((x1 f x2) f...) f xn

Note that to produce the outermost application of the operator the entire input list must be traversed. This means that foldl1 will diverge if given an infinite list.

Also note that if you want an efficient left-fold, you probably want to use foldl1' instead of foldl1. The reason for this is that latter does not force the "inner" results (e.g. x1 f x2 in the above example) before applying them to the operator (e.g. to (f x3)). This results in a thunk chain $$\mathcal{O}(n)$$ elements long, which then must be evaluated from the outside-in.

For a general Foldable1 structure this should be semantically identical to,

foldl1 f z = foldl1 f . toNonEmpty

foldl1' :: Foldable1 t => (a -> a -> a) -> t a -> a Source #

Left-associative fold of a structure but with strict application of the operator.

This ensures that each step of the fold is forced to weak head normal form before being applied, avoiding the collection of thunks that would otherwise occur. This is often what you want to strictly reduce a finite list to a single, monolithic result (e.g. length).

For a general Foldable1 structure this should be semantically identical to,

foldl1' f z = foldl1 f . toNonEmpty

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

Insert an m between each pair of t m.

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

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


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

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

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

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

foldrMapM1 :: (Foldable1 t, Monad m) => (a -> m b) -> (a -> b -> m b) -> t a -> m b Source #

Map variant of foldrM1.

foldlMapM1 :: (Foldable1 t, Monad m) => (a -> m b) -> (b -> a -> m b) -> t a -> m b Source #

Map variant of foldlM1.

maximumBy :: Foldable1 t => (a -> a -> Ordering) -> t a -> a Source #

The largest element of a non-empty structure with respect to the given comparison function.

minimumBy :: Foldable1 t => (a -> a -> Ordering) -> t a -> a Source #

The least element of a non-empty structure with respect to the given comparison function.