definitive-base-2.6.3: A small Prelude wrapper to simplify my own Haskell developments

Safe HaskellNone
LanguageHaskell2010

Data.Queue

Documentation

data Front Source #

Instances

data Back Source #

Instances

newtype DeQue a Source #

Constructors

DeQue ([a], [a]) 

Instances

Traversable DeQue Source # 

Methods

sequence :: Applicative f => DeQue (f a) -> f (DeQue a) Source #

Foldable DeQue Source # 

Methods

fold :: Monoid m => DeQue m -> m Source #

Functor DeQue Source # 

Methods

map :: (a -> b) -> DeQue a -> DeQue b Source #

Monoid (DeQue a) Source # 

Methods

zero :: DeQue a Source #

Semigroup (DeQue a) Source # 

Methods

(+) :: DeQue a -> DeQue a -> DeQue a Source #

newtype Queue push pop a Source #

Constructors

Queue 

Fields

Instances

(Direction push, Direction pop) => Stream a (Queue push pop a) Source # 

Methods

uncons :: Queue push pop a -> Maybe (a, Queue push pop a) Source #

cons :: a -> Queue push pop a -> Queue push pop a Source #

Traversable (Queue push pop) Source # 

Methods

sequence :: Applicative f => Queue push pop (f a) -> f (Queue push pop a) Source #

Foldable (Queue push pop) Source # 

Methods

fold :: Monoid m => Queue push pop m -> m Source #

Functor (Queue push pop) Source # 

Methods

map :: (a -> b) -> Queue push pop a -> Queue push pop b Source #

Monoid (Queue push pop a) Source # 

Methods

zero :: Queue push pop a Source #

Semigroup (Queue push pop a) Source # 

Methods

(+) :: Queue push pop a -> Queue push pop a -> Queue push pop a Source #

c'queue :: Constraint push -> Constraint pop -> Constraint (Queue push pop a) Source #

c'front :: Constraint Front Source #

c'back :: Constraint Back Source #

queue :: Queue x y a -> Queue s t a Source #

class Direction t where Source #

Minimal complete definition

isFront

Methods

isFront :: t -> Bool Source #

Instances