Pandora.Paradigm.Structure.Stack

Documentation

type Stack = Maybe <:.> Construction Maybe

Linear data structure that serves as a collection of elements

pop :: Stack ~> Stack

delete :: Setoid a => a -> Stack a -> Stack a

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

linearize :: Traversable t => t ~> Stack

Transform any traversable structure into a stack

forward :: Zipper Stack a -> Maybe (Zipper Stack a)

backward :: Zipper Stack a -> Maybe (Zipper Stack a)

Orphan instances

Insertable Stack

Methods

insert :: a -> Stack a -> Stack a

Set Stack

Methods

member :: Setoid a => a -> Stack a -> Boolean

Insertable (Construction Maybe)

Methods

insert :: a -> Construction Maybe a -> Construction Maybe a

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

Focusable (Head :: Type -> Location Type) Stack

Associated Types

type Focusing Head Stack a :: Type

Methods

focusing :: Tagged Head (Stack a) :-. Focusing Head Stack a

Focusable (Head :: Type -> Location Type) (Construction Maybe)

Associated Types

type Focusing Head (Construction Maybe) a :: Type

Methods

focusing :: Tagged Head (Construction Maybe a) :-. Focusing Head (Construction Maybe) a

Covariant (Delta <:.> Stack)

Methods

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

comap :: (a -> b) -> (Delta <:.> Stack) a -> (Delta <:.> Stack) b

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

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

void :: (Delta <:.> Stack) a -> (Delta <:.> Stack) ()

loeb :: (Delta <:.> Stack) (a <-| (Delta <:.> Stack)) -> (Delta <:.> Stack) a

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

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

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

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

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

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

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