Control.Monad.Logic.Sequence.Internal.ScheduledQueue

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

Based on: "Simple and Efficient Purely Functional Queues and Deques", Chris Okasaki, Journal of Functional Programming 1995

Documentation

data Queue a

A scheduled Banker's Queue, as described by Okasaki.

Instances

Foldable Queue

Defined in Control.Monad.Logic.Sequence.Internal.ScheduledQueue

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

Defined in Control.Monad.Logic.Sequence.Internal.ScheduledQueue

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)

Functor Queue

Defined in Control.Monad.Logic.Sequence.Internal.ScheduledQueue

Methods

fmap :: (a -> b) -> Queue a -> Queue b

(<$) :: a -> Queue b -> Queue a

Sequence Queue

Defined in Control.Monad.Logic.Sequence.Internal.ScheduledQueue

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

fromList :: [c] -> Queue c