Data.Lens

united :: forall a. Lens' a Unit

There is a Unit in everything.

second :: forall p c b a. Strong p => p b c -> p (Tuple a b) (Tuple a c)

right :: forall p c b a. Choice p => p b c -> p (Either a b) (Either a c)

left :: forall p c b a. Choice p => p a b -> p (Either a c) (Either b c)

first :: forall p c b a. Strong p => p a b -> p (Tuple a c) (Tuple b c)

_Right :: forall c b a. Prism (Either c a) (Either c b) a b

Prism for the Right constructor of Either.

_Nothing :: forall b a. Prism (Maybe a) (Maybe b) Unit Unit

Prism for the Nothing constructor of Maybe.

_Left :: forall c b a. Prism (Either a c) (Either b c) a b

Prism for the Left constructor of Either.

_Just :: forall b a. Prism (Maybe a) (Maybe b) a b

Prism for the Just constructor of Maybe.

_2 :: forall c b a. Lens (Tuple c a) (Tuple c b) a b

Lens for the second component of a Tuple.

_1 :: forall c b a. Lens (Tuple a c) (Tuple b c) a b

Lens for the first component of a Tuple.

unfolded :: forall b a t s r. Monoid r => (s -> Maybe (Tuple a s)) -> Fold r s t a b

Builds a Fold using an unfold.

toListOfOn :: forall b a t s. s -> Fold (Endo Function (List a)) s t a b -> List a

Synonym for toListOf, reversed.

toListOf :: forall b a t s. Fold (Endo Function (List a)) s t a b -> s -> List a

Collects the foci of a Fold into a list.

sumOf :: forall b a t s. Semiring a => Fold (Additive a) s t a b -> s -> a

The sum of all foci of a Fold.

sequenceOf_ :: forall b a t s f. Applicative f => Fold (Endo Function (f Unit)) s t (f a) b -> s -> f Unit

Sequence the foci of a Fold, pulling out an Applicative, and ignore the result. If you need the result, see sequenceOf for Traversals.

replicated :: forall r t b a. Monoid r => Int -> Fold r a b a t

Replicates the elements of a fold.

productOf :: forall b a t s. Semiring a => Fold (Multiplicative a) s t a b -> s -> a

The product of all foci of a Fold.

previewOn :: forall b a t s. s -> Fold (First a) s t a b -> Maybe a

Synonym for preview, flipped.

preview :: forall b a t s. Fold (First a) s t a b -> s -> Maybe a

Previews the first value of a fold, if there is any.

orOf :: forall b a t s. HeytingAlgebra a => Fold (Disj a) s t a b -> s -> a

The disjunction of all foci of a Fold.

notElemOf :: forall b a t s. Eq a => Fold (Conj Boolean) s t a b -> a -> s -> Boolean

Whether a Fold not contains a given element.

minimumOf :: forall b a t s. Ord a => Fold (Endo Function (Maybe a)) s t a b -> s -> Maybe a

The minimum of all foci of a Fold, if there is any.

maximumOf :: forall b a t s. Ord a => Fold (Endo Function (Maybe a)) s t a b -> s -> Maybe a

The maximum of all foci of a Fold, if there is any.

lengthOf :: forall b a t s. Fold (Additive Int) s t a b -> s -> Int

The number of foci of a Fold.

lastOf :: forall b a t s. Fold (Last a) s t a b -> s -> Maybe a

The last focus of a Fold, if there is any.

itraverseOf_ :: forall r b a t s f i. Applicative f => IndexedFold (Endo Function (f Unit)) i s t a b -> (i -> a -> f r) -> s -> f Unit

Traverse the foci of an IndexedFold, discarding the results.

itoListOf :: forall b a t s i. IndexedFold (Endo Function (List (Tuple i a))) i s t a b -> s -> List (Tuple i a)

Collects the foci of an IndexedFold into a list.

ifoldrOf :: forall r b a t s i. IndexedFold (Endo Function r) i s t a b -> (i -> a -> r -> r) -> r -> s -> r

Right fold over an IndexedFold.

ifoldlOf :: forall r b a t s i. IndexedFold (Dual (Endo Function r)) i s t a b -> (i -> r -> a -> r) -> r -> s -> r

Left fold over an IndexedFold.

ifoldMapOf :: forall b a t s i r. IndexedFold r i s t a b -> (i -> a -> r) -> s -> r

Fold map over an IndexedFold.

ianyOf :: forall r b a t s i. HeytingAlgebra r => IndexedFold (Disj r) i s t a b -> (i -> a -> r) -> s -> r

Whether any focus of an IndexedFold satisfies a predicate.

iallOf :: forall r b a t s i. HeytingAlgebra r => IndexedFold (Conj r) i s t a b -> (i -> a -> r) -> s -> r

Whether all foci of an IndexedFold satisfy a predicate.

hasn't :: forall r b a t s. HeytingAlgebra r => Fold (Conj r) s t a b -> s -> r

Determines whether a Fold does not have a focus.

has :: forall r b a t s. HeytingAlgebra r => Fold (Disj r) s t a b -> s -> r

Determines whether a Fold has at least one focus.

foldrOf :: forall r b a t s. Fold (Endo Function r) s t a b -> (a -> r -> r) -> r -> s -> r

Right fold over a Fold.

foldlOf :: forall r b a t s. Fold (Dual (Endo Function r)) s t a b -> (r -> a -> r) -> r -> s -> r

Left fold over a Fold.

folded :: forall r t b a g. Monoid r => Foldable g => Fold r (g a) b a t

Folds over a Foldable container.

foldOf :: forall b a t s. Fold a s t a b -> s -> a

Folds all foci of a Fold to one. Note that this is the same as view.

foldMapOf :: forall r b a t s. Fold r s t a b -> (a -> r) -> s -> r

Maps and then folds all foci of a Fold.

firstOf :: forall b a t s. Fold (First a) s t a b -> s -> Maybe a

The first focus of a Fold, if there is any. Synonym for preview.

findOf :: forall b a t s. Fold (Endo Function (Maybe a)) s t a b -> (a -> Boolean) -> s -> Maybe a

Find the first focus of a Fold that satisfies a predicate, if there is any.

filtered :: forall a p. Choice p => (a -> Boolean) -> Optic' p a a

Filters on a predicate.

elemOf :: forall b a t s. Eq a => Fold (Disj Boolean) s t a b -> a -> s -> Boolean

Whether a Fold contains a given element.

anyOf :: forall r b a t s. HeytingAlgebra r => Fold (Disj r) s t a b -> (a -> r) -> s -> r

Whether any focus of a Fold satisfies a predicate.

andOf :: forall b a t s. HeytingAlgebra a => Fold (Conj a) s t a b -> s -> a

The conjunction of all foci of a Fold.

allOf :: forall r b a t s. HeytingAlgebra r => Fold (Conj r) s t a b -> (a -> r) -> s -> r

Whether all foci of a Fold satisfy a predicate.

Operator alias for Data.Lens.Fold.previewOn (left-associative / precedence 8)

Operator alias for Data.Lens.Fold.toListOfOn (left-associative / precedence 8)

viewOn :: forall b a t s. s -> AGetter s t a b -> a

Synonym for view, flipped.

view :: forall b a t s. AGetter s t a b -> s -> a

View the focus of a Getter.

use :: forall m b a t s. MonadState s m => Getter s t a b -> m a

View the focus of a Getter in the state of a monad.

to :: forall b a t s. (s -> a) -> Getter s t a b

Convert a function into a getter.

takeBoth :: forall d c b a t s. AGetter s t a b -> AGetter s t c d -> Getter s t (Tuple a c) (Tuple b d)

Combine two getters.

iview :: forall b a t s i. IndexedFold (Tuple i a) i s t a b -> s -> Tuple i a

View the focus of a Getter and its index.

iuse :: forall m b a t s i. MonadState s m => IndexedFold (Tuple i a) i s t a b -> m (Tuple i a)

View the focus of a Getter and its index in the state of a monad.

cloneGetter :: forall b a t s. AGetter s t a b -> Getter s t a b

Operator alias for Data.Lens.Getter.viewOn (left-associative / precedence 8)

type Grate' s a = Grate s s a a

type Grate s t a b = forall p. Closed p => Optic p s t a b

A grate (http://r6research.livejournal.com/28050.html)

zipWithOf :: forall b a t s. Optic Zipping s t a b -> (a -> a -> b) -> s -> s -> t

zipFWithOf :: forall b a t s f. Optic (Costar f) s t a b -> (f a -> b) -> (f s -> t)

collectOf :: forall b a t s f. Optic (Star f) s t a b -> (a -> f b) -> s -> f t

withIso :: forall r b a t s. AnIso s t a b -> ((s -> a) -> (b -> t) -> r) -> r

Extracts the pair of morphisms from an isomorphism.

under :: forall b a t s. AnIso s t a b -> (t -> s) -> b -> a

uncurried :: forall f e d c b a. Iso (a -> b -> c) (d -> e -> f) (Tuple a b -> c) (Tuple d e -> f)

re :: forall b a t s p. Optic (Re p a b) s t a b -> Optic p b a t s

Reverses an optic.

non :: forall a. Eq a => a -> Iso' (Maybe a) a

If a1 is obtained from a by removing a single value, then Maybe a1 is isomorphic to a.

iso :: forall b a t s. (s -> a) -> (b -> t) -> Iso s t a b

Create an Iso from a pair of morphisms.

flipped :: forall f e d c b a. Iso (a -> b -> c) (d -> e -> f) (b -> a -> c) (e -> d -> f)

curried :: forall f e d c b a. Iso (Tuple a b -> c) (Tuple d e -> f) (a -> b -> c) (d -> e -> f)

cloneIso :: forall b a t s. AnIso s t a b -> Iso s t a b

Extracts an Iso from AnIso.

auf :: forall p r e b a t s. Profunctor p => AnIso s t a b -> (p r a -> e -> b) -> p r s -> e -> t

au :: forall e b a t s. AnIso s t a b -> ((b -> t) -> e -> s) -> e -> a

withLens :: forall r b a t s. ALens s t a b -> ((s -> a) -> (s -> b -> t) -> r) -> r

lens' :: forall b a t s. (s -> Tuple a (b -> t)) -> Lens s t a b

lens :: forall b a t s. (s -> a) -> (s -> b -> t) -> Lens s t a b

Create a Lens from a getter/setter pair.

> species = lens _.species $ _ {species = _}
> view species {species : "bovine"}
"bovine"

> _2 = lens Tuple.snd $ \(Tuple keep _) new -> Tuple keep new

Note: _2 is predefined in Data.Lens.Tuple.

cloneLens :: forall b a t s. ALens s t a b -> Lens s t a b

withPrism :: forall r b a t s. APrism s t a b -> ((b -> t) -> (s -> Either t a) -> r) -> r

review :: forall b a t s. Review s t a b -> b -> t

Create the "whole" corresponding to a specific "part":

review solidFocus Color.white == Solid Color.white

prism' :: forall a s. (a -> s) -> (s -> Maybe a) -> Prism' s a

Create a Prism from a constructor and a matcher function that produces a Maybe:

solidFocus :: Prism' Fill Color
solidFocus = prism' Solid case _ of
  Solid color -> Just color
  _ -> Nothing

prism :: forall b a t s. (b -> t) -> (s -> Either t a) -> Prism s t a b

Create a Prism from a constructor and a matcher function that produces an Either:

solidFocus :: Prism' Fill Color
solidFocus = prism Solid case _ of
  Solid color -> Right color
  anotherCase -> Left anotherCase

Note: The matcher function returns a result wrapped in Either t to allow for type-changing prisms in the case where the input does not match.

only :: forall a. Eq a => a -> Prism a a Unit Unit

only focuses not just on a case, but a specific value of that case.

solidWhiteFocus :: Prism' Fill Unit
solidWhiteFocus = only $ Solid Color.white

is      solidWhiteFocus (Solid Color.white) == true
preview solidWhiteFocus (Solid Color.white) == Just unit
review  solidWhiteFocus unit                == Solid Color.white

Note: only depends on Eq. Strange definitions of (==) (for example, that it counts any Fill as being equal to Solid Color.white) will create a prism that violates the preview-review law.

nearly :: forall a. a -> (a -> Boolean) -> Prism' a Unit

nearly is a variant of only. Like only, nearly produces a prism that matches a single value. Unlike only, it uses a predicate you supply instead of depending on class Eq:

solidWhiteFocus :: Prism' Fill Unit
solidWhiteFocus = nearly (Solid Color.white) predicate
  where
    predicate candidate =
      color.toHexString == Color.white.toHexString

matching :: forall b a t s. APrism s t a b -> s -> Either t a

isn't :: forall r b a t s. HeytingAlgebra r => APrism s t a b -> s -> r

Ask if preview prism would produce a Nothing.

is :: forall r b a t s. HeytingAlgebra r => APrism s t a b -> s -> r

Ask if preview prism would produce a Just.

clonePrism :: forall b a t s. APrism s t a b -> Prism s t a b

subOver :: forall a t s. Ring a => Setter s t a a -> a -> s -> t

subModifying :: forall m a s. MonadState s m => Ring a => Setter' s a -> a -> m Unit

setJust :: forall b a t s. Setter s t a (Maybe b) -> b -> s -> t

set :: forall b a t s. Setter s t a b -> b -> s -> t

Set the foci of a Setter to a constant value.

over :: forall b a t s. Setter s t a b -> (a -> b) -> s -> t

Apply a function to the foci of a Setter.

mulOver :: forall a t s. Semiring a => Setter s t a a -> a -> s -> t

mulModifying :: forall m a s. MonadState s m => Semiring a => Setter' s a -> a -> m Unit

modifying :: forall m b a s. MonadState s m => Setter s s a b -> (a -> b) -> m Unit

Modify the foci of a Setter in a monadic state.

iover :: forall b a t s i. IndexedSetter i s t a b -> (i -> a -> b) -> s -> t

Apply a function to the foci of a Setter that may vary with the index.

divOver :: forall a t s. EuclideanRing a => Setter s t a a -> a -> s -> t

divModifying :: forall m a s. MonadState s m => EuclideanRing a => Setter' s a -> a -> m Unit

disjOver :: forall a t s. HeytingAlgebra a => Setter s t a a -> a -> s -> t

disjModifying :: forall m a s. MonadState s m => HeytingAlgebra a => Setter' s a -> a -> m Unit

conjOver :: forall a t s. HeytingAlgebra a => Setter s t a a -> a -> s -> t

conjModifying :: forall m a s. MonadState s m => HeytingAlgebra a => Setter' s a -> a -> m Unit

assignJust :: forall m b a s. MonadState s m => Setter s s a (Maybe b) -> b -> m Unit

assign :: forall m b a s. MonadState s m => Setter s s a b -> b -> m Unit

Set the foci of a Setter in a monadic state to a constant value.

appendOver :: forall a t s. Semigroup a => Setter s t a a -> a -> s -> t

appendModifying :: forall m a s. MonadState s m => Semigroup a => Setter' s a -> a -> m Unit

addOver :: forall a t s. Semiring a => Setter s t a a -> a -> s -> t

addModifying :: forall m a s. MonadState s m => Semiring a => Setter' s a -> a -> m Unit

Operator alias for Data.Lens.Setter.disjOver (right-associative / precedence 4)

Operator alias for Data.Lens.Setter.disjModifying (non-associative / precedence 4)

Operator alias for Data.Lens.Setter.setJust (right-associative / precedence 4)

Operator alias for Data.Lens.Setter.assignJust (non-associative / precedence 4)

Operator alias for Data.Lens.Setter.appendOver (right-associative / precedence 4)

Operator alias for Data.Lens.Setter.appendModifying (non-associative / precedence 4)

Operator alias for Data.Lens.Setter.divOver (right-associative / precedence 4)

Operator alias for Data.Lens.Setter.divModifying (non-associative / precedence 4)

Operator alias for Data.Lens.Setter.set (right-associative / precedence 4)

Operator alias for Data.Lens.Setter.assign (non-associative / precedence 4)

Operator alias for Data.Lens.Setter.subOver (right-associative / precedence 4)

Operator alias for Data.Lens.Setter.subModifying (non-associative / precedence 4)

Operator alias for Data.Lens.Setter.addOver (right-associative / precedence 4)

Operator alias for Data.Lens.Setter.addModifying (non-associative / precedence 4)

Operator alias for Data.Lens.Setter.appendOver (right-associative / precedence 4)

Operator alias for Data.Lens.Setter.appendModifying (non-associative / precedence 4)

Operator alias for Data.Lens.Setter.mulOver (right-associative / precedence 4)

Operator alias for Data.Lens.Setter.mulModifying (non-associative / precedence 4)

Operator alias for Data.Lens.Setter.conjOver (right-associative / precedence 4)

Operator alias for Data.Lens.Setter.conjModifying (non-associative / precedence 4)

Operator alias for Data.Lens.Setter.over (right-associative / precedence 4)

Operator alias for Data.Lens.Setter.modifying (non-associative / precedence 4)

traversed :: forall b a t. Traversable t => Traversal (t a) (t b) a b

A Traversal for the elements of a Traversable functor.

over traversed negate [1, 2, 3] == [-1,-2,-3]
over traversed negate (Just 3) == Just -3

traverseOf :: forall b a t s f. Optic (Star f) s t a b -> (a -> f b) -> s -> f t

Turn a pure profunctor Traversal into a lens-like Traversal.

sequenceOf :: forall a t s f. Optic (Star f) s t (f a) a -> s -> f t

Sequence the foci of an optic, pulling out an "effect". If you do not need the result, see sequenceOf_ for Folds.

sequenceOf traversed has the same result as Data.Traversable.sequence:

sequenceOf traversed (Just [1, 2]) == [Just 1, Just 2]
sequence             (Just [1, 2]) == [Just 1, Just 2]

An example with effects:

> array = [random, random]
> :t array
Array (Eff ... Number)

> effect = sequenceOf traversed array
> :t effect
Eff ... (Array Number)

> effect >>= logShow
[0.15556037108154985,0.28500369615270515]
unit

itraverseOf :: forall b a t s i f. IndexedOptic (Star f) i s t a b -> (i -> a -> f b) -> s -> f t

Turn a pure profunctor IndexedTraversal into a lens-like IndexedTraversal.

failover :: forall b a t s f. Alternative f => Optic (Star (Tuple (Disj Boolean))) s t a b -> (a -> b) -> s -> f t

Tries to map over a Traversal; returns empty if the traversal did not have any new focus.

elementsOf :: forall a t s i p. Wander p => IndexedTraversal i s t a a -> (i -> Boolean) -> IndexedOptic p i s t a a

Traverse elements of an IndexedTraversal whose index satisfy a predicate.

element :: forall a t s p. Wander p => Int -> Traversal s t a a -> Optic p s t a a

Combine an index and a traversal to narrow the focus to a single element. Compare to Data.Lens.Index.

set     (element 2 traversed) 8888 [0, 0, 3] == [0, 0, 8888]
preview (element 2 traversed)      [0, 0, 3] == Just 3

The resulting traversal is called an affine traversal, which means that the traversal focuses on one or zero (if the index is out of range) results.

type Traversal' s a = Traversal s s a a

type Traversal s t a b = forall p. Wander p => Optic p s t a b

A traversal.

newtype Tagged a b

Constructors

• Tagged b

Instances

• Newtype (Tagged a b) _
• (Eq b) => Eq (Tagged a b)
• Eq1 (Tagged a)
• (Ord b) => Ord (Tagged a b)
• Ord1 (Tagged a)
• Functor (Tagged a)
• Profunctor Tagged
• Choice Tagged
• Costrong Tagged
• Closed Tagged
• Foldable (Tagged a)
• Traversable (Tagged a)

data Shop a b s t

The Shop profunctor characterizes a Lens.

Constructors

• Shop (s -> a) (s -> b -> t)

Instances

• Profunctor (Shop a b)
• Strong (Shop a b)

type Setter' s a = Setter s s a a

type Setter s t a b = Optic Function s t a b

A setter.

type Review' s a = Review s s a a

type Review s t a b = Optic Tagged s t a b

A review.

newtype Re p s t a b

Constructors

• Re (p b a -> p t s)

Instances

• Newtype (Re p s t a b) _
• (Profunctor p) => Profunctor (Re p s t)
• (Choice p) => Cochoice (Re p s t)
• (Cochoice p) => Choice (Re p s t)
• (Strong p) => Costrong (Re p s t)
• (Costrong p) => Strong (Re p s t)

type Prism' s a = Prism s s a a

type Prism s t a b = forall p. Choice p => Optic p s t a b

A prism.

type Optic' p s a = Optic p s s a a

type Optic p s t a b = p a b -> p s t

A general-purpose Data.Lens.

data Market a b s t

The Market profunctor characterizes a Prism.

Constructors

• Market (b -> t) (s -> Either t a)

Instances

• Functor (Market a b s)
• Profunctor (Market a b)
• Choice (Market a b)

type Lens' s a = Lens s s a a

Lens' is a specialization of Lens. An optic of type Lens' can change only the value of its focus, not its type. As an example, consider the Lens _2, which has this type:

_2 :: forall s t a b. Lens (Tuple s a) (Tuple t b) a b 

_2 can produce a Tuple Int String from a Tuple Int Int:

set _2 "NEW" (Tuple 1 2) == (Tuple 1 "NEW")

If we specialize _2's type with Lens', the following will not type check:

set (_2 :: Lens' (Tuple Int Int) Int) "NEW" (Tuple 1 2)
           ^^^^^^^^^^^^^^^^^^^^^^^^^

See Data.Lens.Getter and Data.Lens.Setter for functions and operators frequently used with lenses.

type Lens s t a b = forall p. Strong p => Optic p s t a b

Given a type whose "focus element" always exists, a lens provides a convenient way to view, set, and transform that element.

For example, _2 is a tuple-specific Lens available from Data.Lens, so:

over _2 String.length $ Tuple "ignore" "four" == Tuple "ignore" 4

Note the result has a different type than the original tuple. That is, the four Lens type variables have been narrowed to:

• s is Tuple String String
• t is Tuple String Int
• a is String
• b is Int

See Data.Lens.Getter and Data.Lens.Setter for functions and operators frequently used with lenses.

type Iso' s a = Iso s s a a

type Iso s t a b = forall p. Profunctor p => Optic p s t a b

A generalized isomorphism.

type IndexedTraversal' i s a = IndexedTraversal i s s a a

type IndexedTraversal i s t a b = forall p. Wander p => IndexedOptic p i s t a b

An indexed traversal.

type IndexedSetter' i s a = IndexedSetter i s s a a

type IndexedSetter i s t a b = IndexedOptic Function i s t a b

An indexed setter.

type IndexedOptic' p i s a = IndexedOptic p i s s a a

type IndexedOptic p i s t a b = Indexed p i a b -> p s t

An indexed optic.

type IndexedGetter' i s a = IndexedGetter i s s a a

type IndexedGetter i s t a b = IndexedFold a i s t a b

An indexed getter.

type IndexedFold' r i s a = IndexedFold r i s s a a

type IndexedFold r i s t a b = IndexedOptic (Forget r) i s t a b

An indexed fold.

newtype Indexed p i s t

Profunctor used for IndexedOptics.

Constructors

• Indexed (p (Tuple i s) t)

Instances

• Newtype (Indexed p i s t) _
• (Profunctor p) => Profunctor (Indexed p i)
• (Strong p) => Strong (Indexed p i)
• (Choice p) => Choice (Indexed p i)
• (Wander p) => Wander (Indexed p i)

type Getter' s a = Getter s s a a

type Getter s t a b = forall r. Fold r s t a b

A getter.

newtype Forget r a b

Profunctor that forgets the b value and returns (and accumulates) a value of type r.

Forget r is isomorphic to Star (Const r), but can be given a Cochoice instance.

Constructors

• Forget (a -> r)

Instances

• Newtype (Forget r a b) _
• (Semigroup r) => Semigroup (Forget r a b)
• (Monoid r) => Monoid (Forget r a b)
• Profunctor (Forget r)
• (Monoid r) => Choice (Forget r)
• Strong (Forget r)
• Cochoice (Forget r)
• (Monoid r) => Wander (Forget r)

type Fold' r s a = Fold r s s a a

type Fold r s t a b = Optic (Forget r) s t a b

A fold.

data Exchange a b s t

The Exchange profunctor characterizes an Iso.

Constructors

• Exchange (s -> a) (b -> t)

Instances

• Functor (Exchange a b s)
• Profunctor (Exchange a b)

type AnIso' s a = AnIso s s a a

type AnIso s t a b = Optic (Exchange a b) s t a b

type APrism' s a = APrism s s a a

type APrism s t a b = Optic (Market a b) s t a b

type ALens' s a = ALens s s a a

type ALens s t a b = Optic (Shop a b) s t a b

type AGetter' s a = AGetter s s a a

type AGetter s t a b = Fold a s t a b

class (Strong p, Choice p) <= Wander p  where

Class for profunctors that support polymorphic traversals.

Members

• wander :: forall b a t s. (forall f. Applicative f => (a -> f b) -> s -> f t) -> p a b -> p s t

Instances

• Wander Function
• (Applicative f) => Wander (Star f)