Data.Stack

A simple stack type. Very similar to an ordinary list, but with a more specialized API.

Documentation

data Stack a

The usual stack data structure.

Constructors

Empty

a :< (Stack a)

Instances

Functor Stack

Foldable Stack

IsList (Stack a)

Eq a => Eq (Stack a)

Ord a => Ord (Stack a)

Show a => Show (Stack a)

Pretty a => Pretty (Stack a)

Monoid (Stack a)

NFData a => NFData (Stack a)

type Item (Stack a) = a

forEachPop :: [x] -> Stack a -> Maybe ([a], Stack a)

For each list element, pop one element off the stack. Fail if not enough elements are on the stack.

(<>>) :: [a] -> Stack a -> Stack a

Push a list of items onto the stack. The first item will be at the top of the stack.

span :: (a -> Bool) -> Stack a -> (Stack a, Stack a)

Like span for lists.