Data.Semigroup.Traversable · semigroupoids-6.0.2

classclass (Foldable1 t, Traversable t) => Traversable1 (t :: Type -> Type) where

Methods

traverse1 :: Apply f => (a -> f b) -> t a -> f (t b)
sequence1 :: Apply f => t (f b) -> f (t b)

Instances30Traversable1, …

Traversable1 ComplexDefined in semigroupoids-6.0.2 · Data.Semigroup.Traversable.Class
Traversable1 FirstDefined in semigroupoids-6.0.2 · Data.Semigroup.Traversable.Class
Traversable1 LastDefined in semigroupoids-6.0.2 · Data.Semigroup.Traversable.Class
Traversable1 MaxDefined in semigroupoids-6.0.2 · Data.Semigroup.Traversable.Class
Traversable1 MinDefined in semigroupoids-6.0.2 · Data.Semigroup.Traversable.Class
Traversable1 TreeDefined in semigroupoids-6.0.2 · Data.Semigroup.Traversable.Class
Traversable1 NonEmptyDefined in semigroupoids-6.0.2 · Data.Semigroup.Traversable.Class
Traversable1 IdentityDefined in semigroupoids-6.0.2 · Data.Semigroup.Traversable.Class
Traversable1 DualDefined in semigroupoids-6.0.2 · Data.Semigroup.Traversable.Class
Traversable1 ProductDefined in semigroupoids-6.0.2 · Data.Semigroup.Traversable.Class
Traversable1 SumDefined in semigroupoids-6.0.2 · Data.Semigroup.Traversable.Class
Traversable1 Par1Defined in semigroupoids-6.0.2 · Data.Semigroup.Traversable.Class
Traversable1 V1Defined in semigroupoids-6.0.2 · Data.Semigroup.Traversable.Class
Traversable1 (Tuple2 a)Defined in semigroupoids-6.0.2 · Data.Semigroup.Traversable.Class
Traversable1 f => Traversable1 (Lift f)Defined in semigroupoids-6.0.2 · Data.Semigroup.Traversable.Class
Bitraversable1 p => Traversable1 (Join p)Defined in semigroupoids-6.0.2 · Data.Semigroup.Traversable.Class
Traversable1 (Tagged a)Defined in semigroupoids-6.0.2 · Data.Semigroup.Traversable.Class
Traversable1 f => Traversable1 (Alt f)Defined in semigroupoids-6.0.2 · Data.Semigroup.Traversable.Class
Traversable1 f => Traversable1 (Rec1 f)Defined in semigroupoids-6.0.2 · Data.Semigroup.Traversable.Class
Traversable1 f => Traversable1 (Backwards f)Defined in semigroupoids-6.0.2 · Data.Semigroup.Traversable.Class
Traversable1 f => Traversable1 (IdentityT f)Defined in semigroupoids-6.0.2 · Data.Semigroup.Traversable.Class
Traversable1 f => Traversable1 (Reverse f)Defined in semigroupoids-6.0.2 · Data.Semigroup.Traversable.Class
(Traversable1 f, Traversable1 g) => Traversable1 (Product f g)Defined in semigroupoids-6.0.2 · Data.Semigroup.Traversable.Class
(Traversable1 f, Traversable1 g) => Traversable1 (Sum f g)Defined in semigroupoids-6.0.2 · Data.Semigroup.Traversable.Class
(Traversable1 f, Traversable1 g) => Traversable1 (f :*: g)Defined in semigroupoids-6.0.2 · Data.Semigroup.Traversable.Class
(Traversable1 f, Traversable1 g) => Traversable1 (f :+: g)Defined in semigroupoids-6.0.2 · Data.Semigroup.Traversable.Class
Traversable1 f => Traversable1 (M1 i c f)Defined in semigroupoids-6.0.2 · Data.Semigroup.Traversable.Class
Traversable1 g => Traversable1 (Joker g a)Defined in semigroupoids-6.0.2 · Data.Semigroup.Traversable.Class
(Traversable1 f, Traversable1 g) => Traversable1 (Compose f g)Defined in semigroupoids-6.0.2 · Data.Semigroup.Traversable.Class
(Traversable1 f, Traversable1 g) => Traversable1 (f :.: g)Defined in semigroupoids-6.0.2 · Data.Semigroup.Traversable.Class

Defining Traversable1 instances

Defining Traversable1 instances for types with both Traversable1 and Traversable substructures can be done with traverse1Maybe, (<*.>), and (<.*>).

data Foo a = Foo (Maybe a) (Maybe a) a [a]
  deriving (Functor, Traversable, Foldable)
instance Traversable1 Foo where
  traverse1 f (Foo ma ma' a as) = Foo <$> traverseMaybe ma <*> traverseMaybe ma' <*.> f a <.*> traverseMaybe as
instance Foldable1 Foo where
  foldMap1 = foldMap1Default

valuetraverse1Maybe

:: (Traversable t, Apply f)
=> a -> f b
-> t a
-> MaybeApply f (t b)

Source#

Traverse a Traversable using Apply, getting the results back in a MaybeApply.

valuegtraverse1

:: (Traversable1 (Rep1 t), Apply f, Generic1 t)
=> a -> f b
-> t a
-> f (t b)

Source#

Generic traverse1. Caveats:

Will not compile if t is an empty constructor.
Will not compile if t has some fields that don't mention a, for example data Bar a = MkBar a Int

valuegsequence1

:: (Traversable1 (Rep1 t), Apply f, Generic1 t)
=> t (f b)
-> f (t b)

Source#

Generic sequence1. Caveats are the same for gtraverse1.

Default superclass instance helpers

valuefoldMap1Default :: (Traversable1 f, Semigroup m) => (a -> m) -> f a -> m

Source#

Default implementation of foldMap1 given an implementation of Traversable1.