Pandora.Pattern.Functor.Traversable

Documentation

class Covariant t => Traversable t where

Let f :: (Applicative t, Applicative g) => t a -> u a
Let p :: (Pointable t, Pointable g) => t a -> u a

When providing a new instance, you should ensure it satisfies the four laws:
* Naturality of traversing: g . traverse f ≡ traverse (g . f)
* Naturality of sequencing: f . sequence = sequence . comap f
* Preserving point: p (point x) ≡ point x
* Preserving apply: f (x <*> y) ≡ f x <*> f y

Minimal complete definition

(->>)

Methods

(->>) :: (Pointable u, Applicative u) => t a -> (a -> u b) -> (u :.: t) b

Infix version of traverse

traverse :: (Pointable u, Applicative u) => (a -> u b) -> t a -> (u :.: t) b

Prefix version of ->>

sequence :: (Pointable u, Applicative u) => (t :.: u) a -> (u :.: t) a

The dual of distribute

Instances

Traversable Wye

Defined in Pandora.Paradigm.Basis.Wye

Methods

(->>) :: (Pointable u, Applicative u) => Wye a -> (a -> u b) -> (u :.: Wye) b

traverse :: (Pointable u, Applicative u) => (a -> u b) -> Wye a -> (u :.: Wye) b

sequence :: (Pointable u, Applicative u) => (Wye :.: u) a -> (u :.: Wye) a

Traversable Edges

Defined in Pandora.Paradigm.Basis.Edges

Methods

(->>) :: (Pointable u, Applicative u) => Edges a -> (a -> u b) -> (u :.: Edges) b

traverse :: (Pointable u, Applicative u) => (a -> u b) -> Edges a -> (u :.: Edges) b

sequence :: (Pointable u, Applicative u) => (Edges :.: u) a -> (u :.: Edges) a

Traversable Identity

Defined in Pandora.Paradigm.Basis.Identity

Methods

(->>) :: (Pointable u, Applicative u) => Identity a -> (a -> u b) -> (u :.: Identity) b

traverse :: (Pointable u, Applicative u) => (a -> u b) -> Identity a -> (u :.: Identity) b

sequence :: (Pointable u, Applicative u) => (Identity :.: u) a -> (u :.: Identity) a

Traversable Maybe

Defined in Pandora.Paradigm.Basis.Maybe

Methods

(->>) :: (Pointable u, Applicative u) => Maybe a -> (a -> u b) -> (u :.: Maybe) b

traverse :: (Pointable u, Applicative u) => (a -> u b) -> Maybe a -> (u :.: Maybe) b

sequence :: (Pointable u, Applicative u) => (Maybe :.: u) a -> (u :.: Maybe) a

Traversable t => Traversable (Free t)

Defined in Pandora.Paradigm.Basis.Free

Methods

(->>) :: (Pointable u, Applicative u) => Free t a -> (a -> u b) -> (u :.: Free t) b

traverse :: (Pointable u, Applicative u) => (a -> u b) -> Free t a -> (u :.: Free t) b

sequence :: (Pointable u, Applicative u) => (Free t :.: u) a -> (u :.: Free t) a

Traversable t => Traversable (Jack t)

Defined in Pandora.Paradigm.Basis.Jack

Methods

(->>) :: (Pointable u, Applicative u) => Jack t a -> (a -> u b) -> (u :.: Jack t) b

traverse :: (Pointable u, Applicative u) => (a -> u b) -> Jack t a -> (u :.: Jack t) b

sequence :: (Pointable u, Applicative u) => (Jack t :.: u) a -> (u :.: Jack t) a

Traversable (Conclusion e)

Defined in Pandora.Paradigm.Basis.Conclusion

Methods

(->>) :: (Pointable u, Applicative u) => Conclusion e a -> (a -> u b) -> (u :.: Conclusion e) b

traverse :: (Pointable u, Applicative u) => (a -> u b) -> Conclusion e a -> (u :.: Conclusion e) b

sequence :: (Pointable u, Applicative u) => (Conclusion e :.: u) a -> (u :.: Conclusion e) a

Traversable t => Traversable (Cofree t)

Defined in Pandora.Paradigm.Basis.Cofree

Methods

(->>) :: (Pointable u, Applicative u) => Cofree t a -> (a -> u b) -> (u :.: Cofree t) b

traverse :: (Pointable u, Applicative u) => (a -> u b) -> Cofree t a -> (u :.: Cofree t) b

sequence :: (Pointable u, Applicative u) => (Cofree t :.: u) a -> (u :.: Cofree t) a

Traversable (Constant a :: Type -> Type)

Defined in Pandora.Paradigm.Basis.Constant

Methods

(->>) :: (Pointable u, Applicative u) => Constant a a0 -> (a0 -> u b) -> (u :.: Constant a) b

traverse :: (Pointable u, Applicative u) => (a0 -> u b) -> Constant a a0 -> (u :.: Constant a) b

sequence :: (Pointable u, Applicative u) => (Constant a :.: u) a0 -> (u :.: Constant a) a0

(Traversable (t u), Traversable u) => Traversable (Y t u)

Defined in Pandora.Paradigm.Junction.Transformer

Methods

(->>) :: (Pointable u0, Applicative u0) => Y t u a -> (a -> u0 b) -> (u0 :.: Y t u) b

traverse :: (Pointable u0, Applicative u0) => (a -> u0 b) -> Y t u a -> (u0 :.: Y t u) b

sequence :: (Pointable u0, Applicative u0) => (Y t u :.: u0) a -> (u0 :.: Y t u) a

(Traversable t, Traversable u) => Traversable (T t u)

Defined in Pandora.Paradigm.Junction.Transformer

Methods

(->>) :: (Pointable u0, Applicative u0) => T t u a -> (a -> u0 b) -> (u0 :.: T t u) b

traverse :: (Pointable u0, Applicative u0) => (a -> u0 b) -> T t u a -> (u0 :.: T t u) b

sequence :: (Pointable u0, Applicative u0) => (T t u :.: u0) a -> (u0 :.: T t u) a

(Traversable t, Traversable u) => Traversable (U Co Co t u)

Defined in Pandora.Paradigm.Junction.Composition

Methods

(->>) :: (Pointable u0, Applicative u0) => U Co Co t u a -> (a -> u0 b) -> (u0 :.: U Co Co t u) b

traverse :: (Pointable u0, Applicative u0) => (a -> u0 b) -> U Co Co t u a -> (u0 :.: U Co Co t u) b

sequence :: (Pointable u0, Applicative u0) => (U Co Co t u :.: u0) a -> (u0 :.: U Co Co t u) a

(Traversable t, Traversable u, Traversable v) => Traversable (UU Co Co Co t u v)

Defined in Pandora.Paradigm.Junction.Composition

Methods

(->>) :: (Pointable u0, Applicative u0) => UU Co Co Co t u v a -> (a -> u0 b) -> (u0 :.: UU Co Co Co t u v) b

traverse :: (Pointable u0, Applicative u0) => (a -> u0 b) -> UU Co Co Co t u v a -> (u0 :.: UU Co Co Co t u v) b

sequence :: (Pointable u0, Applicative u0) => (UU Co Co Co t u v :.: u0) a -> (u0 :.: UU Co Co Co t u v) a

(Traversable t, Traversable u, Traversable v, Traversable w) => Traversable (UUU Co Co Co Co t u v w)

Defined in Pandora.Paradigm.Junction.Composition

Methods

(->>) :: (Pointable u0, Applicative u0) => UUU Co Co Co Co t u v w a -> (a -> u0 b) -> (u0 :.: UUU Co Co Co Co t u v w) b

traverse :: (Pointable u0, Applicative u0) => (a -> u0 b) -> UUU Co Co Co Co t u v w a -> (u0 :.: UUU Co Co Co Co t u v w) b

sequence :: (Pointable u0, Applicative u0) => (UUU Co Co Co Co t u v w :.: u0) a -> (u0 :.: UUU Co Co Co Co t u v w) a