Pandora.Paradigm.Structure.Stack

Documentation

data Stack a

Linear data structure that serves as a collection of elements

Instances

Covariant Stack

Defined in Pandora.Paradigm.Structure.Stack

Methods

(<$>) :: (a -> b) -> Stack a -> Stack b

comap :: (a -> b) -> Stack a -> Stack b

(<$) :: a -> Stack b -> Stack a

($>) :: Stack a -> b -> Stack b

void :: Stack a -> Stack ()

loeb :: Stack (Stack a -> a) -> Stack a

(<&>) :: Stack a -> (a -> b) -> Stack b

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

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

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

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

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

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

Applicative Stack

Defined in Pandora.Paradigm.Structure.Stack

Methods

(<*>) :: Stack (a -> b) -> Stack a -> Stack b

apply :: Stack (a -> b) -> Stack a -> Stack b

(*>) :: Stack a -> Stack b -> Stack b

(<*) :: Stack a -> Stack b -> Stack a

forever :: Stack a -> Stack b

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

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

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

Alternative Stack

Defined in Pandora.Paradigm.Structure.Stack

Methods

(<+>) :: Stack a -> Stack a -> Stack a

alter :: Stack a -> Stack a -> Stack a

Avoidable Stack

Defined in Pandora.Paradigm.Structure.Stack

Methods

empty :: Stack a

Pointable Stack

Defined in Pandora.Paradigm.Structure.Stack

Methods

point :: a -> Stack a

Traversable Stack

Defined in Pandora.Paradigm.Structure.Stack

Methods

(->>) :: (Pointable u, Applicative u) => Stack a -> (a -> u b) -> (u :.: Stack) >< b

traverse :: (Pointable u, Applicative u) => (a -> u b) -> Stack a -> (u :.: Stack) >< b

sequence :: (Pointable u, Applicative u) => (Stack :.: u) a -> (u :.: Stack) >< a

(->>>) :: (Pointable u, Applicative u, Traversable v) => ((v :.: Stack) >< a) -> (a -> u b) -> (u :.: (v :.: Stack)) >< b

(->>>>) :: (Pointable u, Applicative u, Traversable v, Traversable w) => ((w :.: (v :.: Stack)) >< a) -> (a -> u b) -> (u :.: (w :.: (v :.: Stack))) >< b

(->>>>>) :: (Pointable u, Applicative u, Traversable v, Traversable w, Traversable j) => ((j :.: (w :.: (v :.: Stack))) >< a) -> (a -> u b) -> (u :.: (j :.: (w :.: (v :.: Stack)))) >< b

Composition Stack

Defined in Pandora.Paradigm.Structure.Stack

Associated Types

type Primary Stack a :: Type

Methods

unwrap :: Stack a -> Primary Stack a

type Primary Stack a

Defined in Pandora.Paradigm.Structure.Stack

type Primary Stack a = (Maybe :.: Twister Maybe) >< a

push :: a -> Stack a -> Stack a

top :: Stack ~> Maybe

pop :: Stack ~> Stack

filter :: Predicate a -> Stack a -> Stack a

linearize :: Traversable t => t ~> Stack

Transform any traversable structure into a stack