deque-0.1: Double-ended queue

Safe HaskellNone
LanguageHaskell2010

Deque

Synopsis

Documentation

data Deque a Source #

Constructors

Deque [a] [a] 

Instances

Functor Deque Source # 

Methods

fmap :: (a -> b) -> Deque a -> Deque b #

(<$) :: a -> Deque b -> Deque a #

Foldable Deque Source # 

Methods

fold :: Monoid m => Deque m -> m #

foldMap :: Monoid m => (a -> m) -> Deque a -> m #

foldr :: (a -> b -> b) -> b -> Deque a -> b #

foldr' :: (a -> b -> b) -> b -> Deque a -> b #

foldl :: (b -> a -> b) -> b -> Deque a -> b #

foldl' :: (b -> a -> b) -> b -> Deque a -> b #

foldr1 :: (a -> a -> a) -> Deque a -> a #

foldl1 :: (a -> a -> a) -> Deque a -> a #

toList :: Deque a -> [a] #

null :: Deque a -> Bool #

length :: Deque a -> Int #

elem :: Eq a => a -> Deque a -> Bool #

maximum :: Ord a => Deque a -> a #

minimum :: Ord a => Deque a -> a #

sum :: Num a => Deque a -> a #

product :: Num a => Deque a -> a #

Monoid (Deque a) Source # 

Methods

mempty :: Deque a #

mappend :: Deque a -> Deque a -> Deque a #

mconcat :: [Deque a] -> Deque a #

fromList :: [a] -> Deque a Source #

O(1).

shiftRight :: Deque a -> Deque a Source #

O(1), occasionally O(n).

shiftLeft :: Deque a -> Deque a Source #

O(1), occasionally O(n).

cons :: a -> Deque a -> Deque a Source #

O(1).

snoc :: a -> Deque a -> Deque a Source #

O(1).

uncons :: Deque a -> Maybe (a, Deque a) Source #

O(1), occasionally O(n).

unsnoc :: Deque a -> Maybe (a, Deque a) Source #

O(1), occasionally O(n).

prepend :: Deque a -> Deque a -> Deque a Source #

O(n).

reverse :: Deque a -> Deque a Source #

O(1).

tail :: Deque a -> Deque a Source #

O(1), occasionally O(n).

init :: Deque a -> Deque a Source #

O(1), occasionally O(n).