cryogenian / purescript-optic

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

Module Documentation

Module Data.Tagged

Tagged

newtype Tagged s b
  = Tagged b

unTagged

unTagged :: forall s b. Tagged s b -> b

retag

retag :: forall s t b. Tagged s b -> Tagged t b

untag

untag :: forall s b. Tagged s b -> b

tagSelf

tagSelf :: forall b. b -> Tagged b b

untagSelf

untagSelf :: forall b. Tagged b b -> b

functorTagged

instance functorTagged :: Functor (Tagged s)

applyTagged

instance applyTagged :: Apply (Tagged s)

bindTagged

instance bindTagged :: Bind (Tagged s)

applicativeTagged

instance applicativeTagged :: Applicative (Tagged s)

monadTagged

instance monadTagged :: Monad (Tagged s)

extendTagged

instance extendTagged :: Extend (Tagged s)

comonadTagged

instance comonadTagged :: Comonad (Tagged s)

semigroupTagged

instance semigroupTagged :: (Semigroup b) => Semigroup (Tagged s b)

monoidTagged

instance monoidTagged :: (Monoid b) => Monoid (Tagged s b)

semigroupoidTagged

instance semigroupoidTagged :: Semigroupoid Tagged

foldableTagged

instance foldableTagged :: Foldable (Tagged s)

traversableTagged

instance traversableTagged :: Traversable (Tagged s)

bifunctorTagged

instance bifunctorTagged :: Bifunctor Tagged

biapplyTagged

instance biapplyTagged :: Biapply Tagged

biapplicativeTagged

instance biapplicativeTagged :: Biapplicative Tagged

bifoldableTagged

instance bifoldableTagged :: Bifoldable Tagged

bitraversableTagged

instance bitraversableTagged :: Bitraversable Tagged

profunctorTagged

instance profunctorTagged :: Profunctor Tagged

choiceTagged

instance choiceTagged :: Choice Tagged

Module Optic.Equality

simple

simple :: forall a. EqualityP a a

simply

simply :: forall p f s a r. (OpticP p f s a -> r) -> OpticP p f s a -> r

Module Optic.Extended

AnIso

type AnIso s t a b = OTE.AnIso s t a b

AnIsoP

type AnIsoP s a = OTE.AnIsoP s a

AReview

type AReview s t a b = OTE.AReview s t a b

AReviewP

type AReviewP t b = OTE.AReviewP t b

Equality

type Equality s t a b = OTE.Equality s t a b

EqualityP

type EqualityP s a = OTE.EqualityP s a

Iso

type Iso s t a b = OTE.Iso s t a b

IsoP

type IsoP s a = OTE.IsoP s a

LensLike

type LensLike f s t a b = OTE.LensLike f s t a b

LensLikeP

type LensLikeP f s a = OTE.LensLikeP f s a

Optic

type Optic p f s t a b = OTE.Optic p f s t a b

OpticP

type OpticP p f s a = OTE.OpticP p f s a

Over

type Over p f s t a b = OTE.Over p f s t a b

OverP

type OverP p f s a = OTE.OverP p f s a

Review

type Review s t a b = OTE.Review s t a b

ReviewP

type ReviewP t b = OTE.ReviewP t b

Traversal

type Traversal s t a b = OTE.Traversal s t a b

TraversalP

type TraversalP s a = OTE.TraversalP s a

Module Optic.Fold

filtered

filtered :: forall f a p. (Applicative f, Choice p) => (a -> Boolean) -> OpticP p f a a

foldOf

foldOf :: forall a s. Getting a s a -> s -> a

foldrOf

foldrOf :: forall r a s p. (Profunctor p) => Accessing p (Endo r) s a -> p a (r -> r) -> r -> s -> r

foldlOf

foldlOf :: forall r a s. Getting (Dual (Endo r)) s a -> (r -> a -> r) -> r -> s -> r

foldMapOf

foldMapOf :: forall r a s p. (Profunctor p) => Accessing p r s a -> p a r -> s -> r

has

has :: forall a s. Getting Any s a -> s -> Boolean

hasn't

hasn't :: forall a s. Getting All s a -> s -> Boolean

toListOf

toListOf :: forall a s. Getting (Endo [a]) s a -> s -> [a]

(^..)

(^..) :: forall a s. s -> Getting (Endo [a]) s a -> [a]

(^?)

(^?) :: forall a s. s -> Getting (First a) s a -> Maybe a

Module Optic.Iso

iso

iso :: forall f p s t a b. (Profunctor p, Functor f) => (s -> a) -> (b -> t) -> p a (f b) -> p s (f t)

from

from :: forall f p s t a b. (Profunctor p, Functor f) => AnIso s t a b -> p t (f s) -> p b (f a)

withIso

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

cloneIso

cloneIso :: forall f p s t a b. (Profunctor p, Functor f) => AnIso s t a b -> p a (f b) -> p s (f t)

au

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

auf

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

under

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

enum

enum :: forall a. (Enum a, Monoid a) => IsoP Number a

mapping

mapping :: forall f g p s t a b. (Functor f, Functor g, Profunctor p) => AnIso s t a b -> p (f a) (f (g b)) -> p (f s) (f (g t))

Module Optic.Monad

(#~)

(#~) :: forall a s. s -> State s a -> s

Module Optic.Review

(##)

(##) :: forall s t a b. AReview s t a b -> b -> t

re

re :: forall s t a b. AReview s t a b -> Getter b t

reuse

reuse :: forall m b a t s. (Monad m, MonadState b m) => AReview s t a b -> m t

reuses

reuses :: forall m b r a t s. (Monad m, MonadState b m) => AReview s t a b -> (t -> r) -> m r

relook

relook :: forall m b a t s. (Monad m, MonadReader b m) => AReview s t a b -> m t

relooks

relooks :: forall m b r a t s. (Monad m, MonadReader b m) => AReview s t a b -> (t -> r) -> m r

unto

unto :: forall p f s t a b. (Profunctor p, B.Bifunctor p, Functor f) => (b -> t) -> Optic p f s t a b

un

un :: forall p f s a. (Profunctor p, B.Bifunctor p, Functor f) => Getting a s a -> OpticP p f a s

Module Optic.Traversal

both

both :: forall b a r. (Bitraversable r) => Traversal (r a a) (r b b) a b

forOf

forOf :: forall p f s t a b. Over p f s t a b -> s -> p a (f b) -> f t

sequenceOf

sequenceOf :: forall p f s t a b. LensLike f s t (f b) b -> s -> f t

traverseOf

traverseOf :: forall p f s t a b. Over p f s t a b -> p a (f b) -> s -> f t

Module Optic.Internal.Iso

Exchange

data Exchange a b s t
  = Exchange (s -> a) (b -> t)

functorExchange

instance functorExchange :: Functor (Exchange a b s)

profunctorExchange

instance profunctorExchange :: Profunctor (Exchange a b)

Module Optic.Monad.Getter

use

use :: forall s a m. (Monad m, MonadState s m) => Getting a s a -> m a

look

look :: forall r a m. (Monad m, MonadReader r m) => Getting a r a -> m a

Module Optic.Monad.Setter

assign

assign :: forall b a m s. (Monad m, MonadState s m) => ASetter s s a b -> b -> m Unit

(%=)

(%=) :: forall p b a m s. (Monad m, MonadState s m, Profunctor p) => Setting p s s a b -> p a b -> m Unit

(.=)

(.=) :: forall b a m s. (Monad m, MonadState s m) => ASetter s s a b -> b -> m Unit

(+=)

(+=) :: forall s a m. (Monad m, MonadState s m, Num a) => ASetterP s a -> a -> m Unit

(-=)

(-=) :: forall s a m. (Monad m, MonadState s m, Num a) => ASetterP s a -> a -> m Unit

(*=)

(*=) :: forall s a m. (Monad m, MonadState s m, Num a) => ASetterP s a -> a -> m Unit

(//=)

(//=) :: forall s a m. (Monad m, MonadState s m, Num a) => ASetterP s a -> a -> m Unit

(||=)

(||=) :: forall s a m. (Monad m, MonadState s m, BoolLike a) => ASetterP s a -> a -> m Unit

(&&=)

(&&=) :: forall s a m. (Monad m, MonadState s m, BoolLike a) => ASetterP s a -> a -> m Unit

(<>=)

(<>=) :: forall s a m. (Monad m, MonadState s m, Semigroup a) => ASetterP s a -> a -> m Unit

(++=)

(++=) :: forall s a m. (Monad m, MonadState s m, Semigroup a) => ASetterP s a -> a -> m Unit

(?=)

(?=) :: forall b a m s. (Monad m, MonadState s m) => ASetter s s a (Maybe b) -> b -> m Unit

Module Optic.Types.Extended

AnIso

type AnIso s t a b = Exchange a b a (Identity b) -> Exchange a b s (Identity t)

AnIsoP

type AnIsoP s a = AnIso s s a a

AReview

type AReview s t a b = Optic Tagged Identity s t a b

AReviewP

type AReviewP t b = AReview t t b b

Equality

type Equality s t a b = forall f p. p a (f b) -> p s (f t)

EqualityP

type EqualityP s a = Equality s s a a

Iso

type Iso s t a b = forall p f. (Functor f, Profunctor p) => p a (f b) -> p s (f t)

IsoP

type IsoP s a = Iso s s a a

LensLike

type LensLike f s t a b = (a -> f b) -> s -> f t

LensLikeP

type LensLikeP f s a = LensLike f s s a a

Optic

type Optic p f s t a b = p a (f b) -> p s (f t)

OpticP

type OpticP p f s a = Optic p f s s a a

Over

type Over p f s t a b = p a (f b) -> s -> f t

OverP

type OverP p f s a = Over p f s s a a

Review

type Review s t a b = forall p f. (Bifunctor p, Profunctor p, Settable f) => Optic p f s t a b

ReviewP

type ReviewP t b = Review t t b b

Traversal

type Traversal s t a b = forall f. (Applicative f) => (a -> f b) -> s -> f t

TraversalP

type TraversalP s a = Traversal s s a a

About


Languages

Language:PureScript 87.9%Language:JavaScript 12.1%