Copyright	(c) Atze van der Ploeg 2014
License	BSD-style
Maintainer	atzeus@gmail.org
Stability	provisional
Portability	portable
Safe Haskell	Safe-Inferred
Language	Haskell2010

Data.Sequence.Queue

Description

A sequence, a queue, with amortized constant time: |>, and viewl.

A simplified version of Okasaki's implicit recursive slowdown queues. See purely functional data structures by Chris Okasaki section 8.4: Queues based on implicit recursive slowdown

Synopsis

module Data.SequenceClass
data Queue a

Documentation

module Data.SequenceClass

data Queue a Source #

A queue.

Instances

Instances details

Functor Queue Source #
Instance details Defined in Data.Sequence.Queue.Internal Methods fmap :: (a -> b) -> Queue a -> Queue b # (<$) :: a -> Queue b -> Queue a #
Foldable Queue Source #
Instance details Defined in Data.Sequence.Queue.Internal Methods 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 # toList :: Queue a -> [a] # null :: Queue a -> Bool # length :: Queue a -> Int # elem :: Eq a => a -> Queue a -> Bool # maximum :: Ord a => Queue a -> a # minimum :: Ord a => Queue a -> a # sum :: Num a => Queue a -> a # product :: Num a => Queue a -> a #
Traversable Queue Source #
Instance details Defined in Data.Sequence.Queue.Internal Methods traverse :: Applicative f => (a -> f b) -> Queue a -> f (Queue b) # sequenceA :: Applicative f => Queue (f a) -> f (Queue a) # mapM :: Monad m => (a -> m b) -> Queue a -> m (Queue b) # sequence :: Monad m => Queue (m a) -> m (Queue a) #
Show1 Queue Source #
Instance details Defined in Data.Sequence.Queue.Internal Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Queue a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Queue a] -> ShowS #
Sequence Queue Source #
Instance details Defined in Data.Sequence.Queue.Internal Methods empty :: Queue c Source # singleton :: c -> Queue c Source # (><) :: Queue c -> Queue c -> Queue c Source # viewl :: Queue c -> ViewL Queue c Source # viewr :: Queue c -> ViewR Queue c Source # (\|>) :: Queue c -> c -> Queue c Source # (<\|) :: c -> Queue c -> Queue c Source # fromList :: [c] -> Queue c Source #
Eq a => Eq (Queue a) Source #
Instance details Defined in Data.Sequence.Queue.Internal Methods (==) :: Queue a -> Queue a -> Bool # (/=) :: Queue a -> Queue a -> Bool #
Ord a => Ord (Queue a) Source #
Instance details Defined in Data.Sequence.Queue.Internal Methods compare :: Queue a -> Queue a -> Ordering # (<) :: Queue a -> Queue a -> Bool # (<=) :: Queue a -> Queue a -> Bool # (>) :: Queue a -> Queue a -> Bool # (>=) :: Queue a -> Queue a -> Bool # max :: Queue a -> Queue a -> Queue a # min :: Queue a -> Queue a -> Queue a #
Read a => Read (Queue a) Source #
Instance details Defined in Data.Sequence.Queue.Internal Methods readsPrec :: Int -> ReadS (Queue a) # readList :: ReadS [Queue a] # readPrec :: ReadPrec (Queue a) # readListPrec :: ReadPrec [Queue a] #
Show a => Show (Queue a) Source #
Instance details Defined in Data.Sequence.Queue.Internal Methods showsPrec :: Int -> Queue a -> ShowS # show :: Queue a -> String # showList :: [Queue a] -> ShowS #
Semigroup (Queue a) Source #
Instance details Defined in Data.Sequence.Queue.Internal Methods (<>) :: Queue a -> Queue a -> Queue a # sconcat :: NonEmpty (Queue a) -> Queue a # stimes :: Integral b => b -> Queue a -> Queue a #
Monoid (Queue a) Source #
Instance details Defined in Data.Sequence.Queue.Internal Methods mempty :: Queue a # mappend :: Queue a -> Queue a -> Queue a # mconcat :: [Queue a] -> Queue a #