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

Data.Sequence.Queue

Description

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

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

Documentation

module Data.SequenceClass

data Queue a #

Instances

Functor Queue #
Methods fmap :: (a -> b) -> Queue a -> Queue b # (<$) :: a -> Queue b -> Queue a #
Foldable Queue #
Methods 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 # 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 #
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) #
Sequence Queue #
Methods empty :: Queue c # singleton :: c -> Queue c # (><) :: Queue c -> Queue c -> Queue c # viewl :: Queue c -> ViewL Queue c # viewr :: Queue c -> ViewR Queue c # (\|>) :: Queue c -> c -> Queue c # (<\|) :: c -> Queue c -> Queue c #