Copyright | (c) Atze van der Ploeg 2014 |
---|---|
License | BSD-style |
Maintainer | atzeus@gmail.org |
Stability | provisional |
Portability | portable |
Safe Haskell | Safe-Inferred |
Language | Haskell2010 |
Synopsis
- module Data.SequenceClass
- data Queue a
Documentation
module Data.SequenceClass
A queue.
Instances
Functor Queue Source # | |
Foldable Queue Source # | |
Defined in Data.Sequence.Queue.Internal fold :: Monoid m => Queue m -> m # foldMap :: Monoid m => (a -> m) -> Queue a -> m # foldMap' :: Monoid m => (a -> m) -> Queue a -> m # foldr :: (a -> b -> b) -> b -> Queue a -> b # foldr' :: (a -> b -> b) -> b -> Queue a -> b # foldl :: (b -> a -> b) -> b -> Queue a -> b # foldl' :: (b -> a -> b) -> b -> Queue a -> b # foldr1 :: (a -> a -> a) -> Queue a -> a # foldl1 :: (a -> a -> a) -> Queue a -> a # elem :: Eq a => a -> Queue a -> Bool # maximum :: Ord a => Queue a -> a # minimum :: Ord a => Queue a -> a # | |
Traversable Queue Source # | |
Show1 Queue Source # | |
Sequence Queue Source # | |
Eq a => Eq (Queue a) Source # | |
Ord a => Ord (Queue a) Source # | |
Defined in Data.Sequence.Queue.Internal | |
Read a => Read (Queue a) Source # | |
Show a => Show (Queue a) Source # | |
Semigroup (Queue a) Source # | |
Monoid (Queue a) Source # | |