Pandora.Paradigm.Structure.Stack

Documentation

type Stack = UT Covariant Covariant (Twister Maybe) Maybe

Linear data structure that serves as a collection of elements

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

top :: Stack a :-. Maybe a

pop :: Stack ~> Stack

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

linearize :: Traversable t => t ~> Stack

Transform any traversable structure into a stack

Orphan instances

Covariant 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 (a <-| Stack) -> 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

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

Methods

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

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

Avoidable Stack

Methods

empty :: Stack a

Pointable Stack

Methods

point :: a |-> Stack

Traversable 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

Semigroup (Stack a)

Methods

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

Monoid (Stack a)

Methods

zero :: Stack a

Setoid a => Setoid (Stack a)

Methods

(==) :: Stack a -> Stack a -> Boolean

(/=) :: Stack a -> Stack a -> Boolean