Pandora.Paradigm.Inventory.State

Documentation

newtype State s a

Effectful computation with a variable

Constructors

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

Instances

Monad (State s)

Defined in Pandora.Paradigm.Inventory.State

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

(||=) :: Interpreted u => (Primary (State s) a -> Primary u b) -> State s a -> u b

(=||) :: Interpreted u => (State s a -> u b) -> Primary (State s) a -> Primary u b

(<$||=) :: (Covariant j (->) (->), Interpreted u) => (Primary (State s) a -> Primary u b) -> (j := State s a) -> j := u b

(<$$||=) :: (Covariant j (->) (->), Covariant k (->) (->), Interpreted u) => (Primary (State s) a -> Primary u b) -> ((j :. k) := State s a) -> (j :. k) := u b

(<$$$||=) :: (Covariant j (->) (->), Covariant k (->) (->), Covariant l (->) (->), Interpreted u) => (Primary (State s) a -> Primary u b) -> ((j :. (k :. l)) := State s a) -> (j :. (k :. l)) := u b

(<$$$$||=) :: (Covariant j (->) (->), Covariant k (->) (->), Covariant l (->) (->), Covariant m (->) (->), Interpreted u) => (Primary (State s) a -> Primary u b) -> ((j :. (k :. (l :. m))) := State s a) -> (j :. (k :. (l :. m))) := u b

(=||$>) :: (Covariant j (->) (->), Interpreted u) => (State s a -> u b) -> (j := Primary (State s) a) -> j := Primary u b

(=||$$>) :: (Covariant j (->) (->), Covariant k (->) (->), Interpreted u) => (State s a -> u b) -> ((j :. k) := Primary (State s) a) -> (j :. k) := Primary u b

(=||$$$>) :: (Covariant j (->) (->), Covariant k (->) (->), Covariant l (->) (->), Interpreted u) => (State s a -> u b) -> ((j :. (k :. l)) := Primary (State s) a) -> (j :. (k :. l)) := Primary u b

(=||$$$$>) :: (Covariant j (->) (->), Covariant k (->) (->), Covariant l (->) (->), Covariant m (->) (->), Interpreted u) => (State s a -> u b) -> ((j :. (k :. (l :. m))) := Primary (State s) a) -> (j :. (k :. (l :. m))) := Primary u b

Monadic (State s)

Defined in Pandora.Paradigm.Inventory.State

Methods

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

Semimonoidal (State s :: Type -> Type) ((->) :: Type -> Type -> Type) (:*:) (:*:)

Defined in Pandora.Paradigm.Inventory.State

Methods

multiply_ :: forall (a :: k) (b :: k). (State s a :*: State s b) -> State s (a :*: b)

Adjoint (Store s) (State s) ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type)

Defined in Pandora.Paradigm.Inventory

Methods

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

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

Pointable (State s) ((->) :: Type -> Type -> Type)

Defined in Pandora.Paradigm.Inventory.State

Methods

point :: a -> State s a

Bindable (State s) ((->) :: Type -> Type -> Type)

Defined in Pandora.Paradigm.Inventory.State

Methods

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

Covariant (State s) ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type)

Defined in Pandora.Paradigm.Inventory.State

Methods

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

Invariant (Flip State r)

Defined in Pandora.Paradigm.Inventory.State

Methods

(<$<) :: (a -> b) -> (b -> a) -> Flip State r a -> Flip State r b

invmap :: (a -> b) -> (b -> a) -> Flip State r a -> Flip State r 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 s

Modify stored value with a function

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

Replace current value with another one

reconcile :: (Bindable t (->), Stateful s t, Adaptable u t) => (s -> u s) -> t s

type Memorable s t = (Pointable t (->), Semimonoidal t (->) (:*:) (:*:), Stateful s t)

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