Data.Profunctor.Traversing

Contents

• Strong in terms of Traversing
• Choice in terms of Traversing

Synopsis

• class (Choice p, Strong p) => Traversing p where
  • traverse' :: Traversable f => p a b -> p (f a) (f b)
  • wander :: (forall f. Applicative f => (a -> f b) -> s -> f t) -> p a b -> p s t
• newtype CofreeTraversing p a b = CofreeTraversing {
  • runCofreeTraversing :: forall f. Traversable f => p (f a) (f b)
  }
• data FreeTraversing p a b where
  • FreeTraversing :: Traversable f => (f y -> b) -> p x y -> (a -> f x) -> FreeTraversing p a b
• firstTraversing :: Traversing p => p a b -> p (a, c) (b, c)
• secondTraversing :: Traversing p => p a b -> p (c, a) (c, b)
• leftTraversing :: Traversing p => p a b -> p (Either a c) (Either b c)
• rightTraversing :: Traversing p => p a b -> p (Either c a) (Either c b)

Documentation

FreeTraversing -| CofreeTraversing

Strong in terms of Traversing

Choice in terms of Traversing