Safe Haskell | Trustworthy |
---|---|

Language | Haskell2010 |

Space-efficient stacks with amortized \( O(\log n) \) operations. These directly use an underlying array-based implementation, without doing any special optimization for the very top of the stack.

# Documentation

## Instances

Functor Stack Source # | |

Foldable Stack Source # | |

Defined in Data.CompactSequence.Stack.Simple fold :: Monoid m => Stack m -> m # foldMap :: Monoid m => (a -> m) -> Stack a -> m # foldr :: (a -> b -> b) -> b -> Stack a -> b # foldr' :: (a -> b -> b) -> b -> Stack a -> b # foldl :: (b -> a -> b) -> b -> Stack a -> b # foldl' :: (b -> a -> b) -> b -> Stack a -> b # foldr1 :: (a -> a -> a) -> Stack a -> a # foldl1 :: (a -> a -> a) -> Stack a -> a # elem :: Eq a => a -> Stack a -> Bool # maximum :: Ord a => Stack a -> a # minimum :: Ord a => Stack a -> a # | |

Traversable Stack Source # | |

IsList (Stack a) Source # | |

Eq a => Eq (Stack a) Source # | |

Ord a => Ord (Stack a) Source # | |

Defined in Data.CompactSequence.Stack.Simple | |

Show a => Show (Stack a) Source # | |

Semigroup (Stack a) Source # | |

Monoid (Stack a) Source # | |

type Item (Stack a) Source # | |

Defined in Data.CompactSequence.Stack.Simple |