Copyright	(c) Edward Kmett 2017
License	BSD2
Maintainer	Edward Kmett <ekmett@gmail.com>
Stability	experimental
Portability	non-portable
Safe Haskell	None
Language	Haskell2010

Coda.Relative.Queue

Description

Okasaki real-time queue modified for O(1) rel

Documentation

Instances

Relative a => IsList (Queue a) Source #
Associated Types type Item (Queue a) :: * # Methods fromList :: [Item (Queue a)] -> Queue a # fromListN :: Int -> [Item (Queue a)] -> Queue a # toList :: Queue a -> [Item (Queue a)] #
(Eq a, Relative a) => Eq (Queue a) Source #
Methods (==) :: Queue a -> Queue a -> Bool # (/=) :: Queue a -> Queue a -> Bool #
(Ord a, Relative a) => Ord (Queue a) Source #
Methods compare :: Queue a -> Queue a -> Ordering # (<) :: Queue a -> Queue a -> Bool # (<=) :: Queue a -> Queue a -> Bool # (>) :: Queue a -> Queue a -> Bool # (>=) :: Queue a -> Queue a -> Bool # max :: Queue a -> Queue a -> Queue a # min :: Queue a -> Queue a -> Queue a #
(Read a, Relative a) => Read (Queue a) Source #
Methods readsPrec :: Int -> ReadS (Queue a) # readList :: ReadS [Queue a] # readPrec :: ReadPrec (Queue a) # readListPrec :: ReadPrec [Queue a] #
(Show a, Relative a) => Show (Queue a) Source #
Methods showsPrec :: Int -> Queue a -> ShowS # show :: Queue a -> String # showList :: [Queue a] -> ShowS #
AsEmpty (Queue a) Source #
Methods _Empty :: Prism' (Queue a) ()
Default (Queue a) Source #
Methods def :: Queue a
Relative (Queue a) Source #
Methods rel :: Delta -> Queue a -> Queue a Source #
(Relative a, Relative b) => Cons (Queue a) (Queue b) a b Source #
Methods _Cons :: Prism (Queue a) (Queue b) (a, Queue a) (b, Queue b)
type Item (Queue a) Source #
type Item (Queue a) = a