Pandora.Paradigm.Inventory.State

Documentation

newtype State s a

Effectful computation with a variable

Constructors

State (((->) s :. (:*:) s) := a)

Instances

Covariant (State s)

Defined in Pandora.Paradigm.Inventory.State

Methods

(<$>) :: (a -> b) -> State s a -> State s b

comap :: (a -> b) -> State s a -> State s b

(<$) :: a -> State s b -> State s a

($>) :: State s a -> b -> State s b

void :: State s a -> State s ()

loeb :: State s (a <-| State s) -> State s a

(<&>) :: State s a -> (a -> b) -> State s b

(<$$>) :: Covariant u => (a -> b) -> ((State s :. u) := a) -> (State s :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((State s :. (u :. v)) := a) -> (State s :. (u :. v)) := b

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a -> b) -> ((State s :. (u :. (v :. w))) := a) -> (State s :. (u :. (v :. w))) := b

(<&&>) :: Covariant u => ((State s :. u) := a) -> (a -> b) -> (State s :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((State s :. (u :. v)) := a) -> (a -> b) -> (State s :. (u :. v)) := b

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((State s :. (u :. (v :. w))) := a) -> (a -> b) -> (State s :. (u :. (v :. w))) := b

Bindable (State s)

Defined in Pandora.Paradigm.Inventory.State

Methods

(>>=) :: State s a -> (a -> State s b) -> State s b

(=<<) :: (a -> State s b) -> State s a -> State s b

bind :: (a -> State s b) -> State s a -> State s b

join :: ((State s :. State s) := a) -> State s a

(>=>) :: (a -> State s b) -> (b -> State s c) -> a -> State s c

(<=<) :: (b -> State s c) -> (a -> State s b) -> a -> State s c

($>>=) :: Covariant u => ((u :. State s) := a) -> (a -> State s b) -> (u :. State s) := b

(<>>=) :: (State s b -> c) -> (a -> State s b) -> State s a -> c

Applicative (State s)

Defined in Pandora.Paradigm.Inventory.State

Methods

(<*>) :: State s (a -> b) -> State s a -> State s b

apply :: State s (a -> b) -> State s a -> State s b

(*>) :: State s a -> State s b -> State s b

(<*) :: State s a -> State s b -> State s a

forever :: State s a -> State s b

(<**>) :: Applicative u => ((State s :. u) := (a -> b)) -> ((State s :. u) := a) -> (State s :. u) := b

(<***>) :: (Applicative u, Applicative v) => ((State s :. (u :. v)) := (a -> b)) -> ((State s :. (u :. v)) := a) -> (State s :. (u :. v)) := b

(<****>) :: (Applicative u, Applicative v, Applicative w) => ((State s :. (u :. (v :. w))) := (a -> b)) -> ((State s :. (u :. (v :. w))) := a) -> (State s :. (u :. (v :. w))) := b

Pointable (State s)

Defined in Pandora.Paradigm.Inventory.State

Methods

point :: a |-> State s

Monad (State s)

Defined in Pandora.Paradigm.Inventory.State

Methods

(>>=-) :: State s a -> State s b -> State s a

(->>=) :: State s a -> State s b -> State s b

(-=<<) :: State s a -> State s b -> State s b

(=<<-) :: State s a -> State s b -> State s a

Interpreted (State s)

Defined in Pandora.Paradigm.Inventory.State

Associated Types

type Primary (State s) a

Methods

run :: State s a -> Primary (State s) a

unite :: Primary (State s) a -> State s a

Monadic (State s)

Defined in Pandora.Paradigm.Inventory.State

Methods

wrap :: forall (u :: Type -> Type). Pointable u => State s ~> (State s :> u)

Adjoint (Store s) (State s)

Defined in Pandora.Paradigm.Inventory

Methods

(-|) :: a -> (Store s a -> b) -> State s b

(|-) :: Store s a -> (a -> State s b) -> b

phi :: (Store s a -> b) -> a -> State s b

psi :: (a -> State s b) -> Store s a -> b

eta :: a -> (State s :. Store s) := a

epsilon :: ((Store s :. State s) := a) -> a

(-|$) :: Covariant v => v a -> (Store s a -> b) -> v (State s b)

($|-) :: Covariant v => v (Store s a) -> (a -> State s b) -> v b

type Schematic Monad (State s)

Defined in Pandora.Paradigm.Inventory.State

type Schematic Monad (State s) = ((->) s :: Type -> Type) <:<.>:> (:*:) s

type Primary (State s) a

Defined in Pandora.Paradigm.Inventory.State

type Primary (State s) a = (((->) s :: Type -> Type) :. (:*:) s) := a

type Stateful s = Adaptable (State s)

current :: Stateful s t => t s

Get current value

modify :: Stateful s t => (s -> s) -> t ()

Modify stored value with a function

replace :: Stateful s t => s -> t ()

Replace current value with another one

type Memorable s t = (Pointable t, Applicative t, Stateful s t)

fold :: (Traversable t, Memorable s u) => (a -> s -> s) -> t a -> u s