Safe Haskell | Trustworthy |
---|---|
Language | Haskell2010 |
Space-efficient queues with amortized \( O(\log n) \) operations. These directly use an underlying array-based implementation, without doing any special optimization for the first few and last few elements of the queue.
Documentation
Instances
Functor Queue Source # | |
Foldable Queue Source # | |
Defined in Data.CompactSequence.Queue.Simple fold :: Monoid m => Queue m -> 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 # | |
IsList (Queue a) Source # | |
Eq a => Eq (Queue a) Source # | |
Ord a => Ord (Queue a) Source # | |
Defined in Data.CompactSequence.Queue.Simple | |
Show a => Show (Queue a) Source # | |
Semigroup (Queue a) Source # | |
Monoid (Queue a) Source # | |
type Item (Queue a) Source # | |
Defined in Data.CompactSequence.Queue.Simple |