-- Hoogle documentation, generated by Haddock
-- See Hoogle, http://www.haskell.org/hoogle/


-- | Double-ended queue
--   
--   An implementation of double-ended queue (aka Dequeue or Deque) based
--   on the head-tail linked list.
@package deque
@version 0.1

module Deque
data Deque a
Deque :: [a] -> [a] -> Deque a

-- | <i>O(1)</i>.
fromList :: [a] -> Deque a

-- | <i>O(1)</i>, occasionally <i>O(n)</i>.
shiftRight :: Deque a -> Deque a

-- | <i>O(1)</i>, occasionally <i>O(n)</i>.
shiftLeft :: Deque a -> Deque a

-- | <i>O(1)</i>.
cons :: a -> Deque a -> Deque a

-- | <i>O(1)</i>.
snoc :: a -> Deque a -> Deque a

-- | <i>O(1)</i>, occasionally <i>O(n)</i>.
uncons :: Deque a -> Maybe (a, Deque a)

-- | <i>O(1)</i>, occasionally <i>O(n)</i>.
unsnoc :: Deque a -> Maybe (a, Deque a)

-- | <i>O(n)</i>.
prepend :: Deque a -> Deque a -> Deque a

-- | <i>O(1)</i>.
reverse :: Deque a -> Deque a

-- | <i>O(1)</i>, occasionally <i>O(n)</i>.
tail :: Deque a -> Deque a

-- | <i>O(1)</i>, occasionally <i>O(n)</i>.
init :: Deque a -> Deque a
instance GHC.Base.Functor Deque.Deque
instance GHC.Base.Monoid (Deque.Deque a)
instance Data.Foldable.Foldable Deque.Deque