Safe Haskell | None |
---|---|
Language | Haskell2010 |
A simple stack type. Very similar to an ordinary list, but with a more specialized API.
Documentation
The usual stack data structure.
Functor Stack Source # | |
Foldable Stack Source # | |
IsList (Stack a) Source # | |
Eq a => Eq (Stack a) Source # | |
Ord a => Ord (Stack a) Source # | |
Show a => Show (Stack a) Source # | |
Semigroup (Stack a) Source # | |
Monoid (Stack a) Source # | |
Pretty a => Pretty (Stack a) Source # | |
NFData a => NFData (Stack a) Source # | |
type Item (Stack a) Source # | |
forEachPop :: [x] -> Stack a -> Maybe ([a], Stack a) Source #
For each list element, pop one element off the Stack
. Fail if not enough
elements are present.