type-indexed-queues-0.1.0.1: Queues with verified and unverified versions.

Safe HaskellNone
LanguageHaskell2010

Data.Queue.Pairing

Description

Pairing heaps.

Synopsis

Documentation

data Pairing a Source #

A simple, unchecked pairing heap.

Constructors

E 
T a [Pairing a] 

Instances

Functor Pairing Source # 

Methods

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

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

Foldable Pairing Source # 

Methods

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

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

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

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

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

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

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

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

toList :: Pairing a -> [a] #

null :: Pairing a -> Bool #

length :: Pairing a -> Int #

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

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

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

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

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

Traversable Pairing Source # 

Methods

traverse :: Applicative f => (a -> f b) -> Pairing a -> f (Pairing b) #

sequenceA :: Applicative f => Pairing (f a) -> f (Pairing a) #

mapM :: Monad m => (a -> m b) -> Pairing a -> m (Pairing b) #

sequence :: Monad m => Pairing (m a) -> m (Pairing a) #

Generic1 Pairing Source # 

Associated Types

type Rep1 (Pairing :: * -> *) :: * -> * #

Methods

from1 :: Pairing a -> Rep1 Pairing a #

to1 :: Rep1 Pairing a -> Pairing a #

Ord a => MeldableQueue Pairing a Source # 

Methods

merge :: Pairing a -> Pairing a -> Pairing a Source #

fromFoldable :: Foldable f => f a -> Pairing a Source #

Ord a => Queue Pairing a Source # 

Methods

minView :: Pairing a -> Maybe (a, Pairing a) Source #

insert :: a -> Pairing a -> Pairing a Source #

empty :: Pairing a Source #

singleton :: a -> Pairing a Source #

toList :: Pairing a -> [a] Source #

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

heapSort :: p Pairing -> [a] -> [a] Source #

Ord a => Eq (Pairing a) Source # 

Methods

(==) :: Pairing a -> Pairing a -> Bool #

(/=) :: Pairing a -> Pairing a -> Bool #

Data a => Data (Pairing a) Source # 

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Pairing a -> c (Pairing a) #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Pairing a) #

toConstr :: Pairing a -> Constr #

dataTypeOf :: Pairing a -> DataType #

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (Pairing a)) #

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Pairing a)) #

gmapT :: (forall b. Data b => b -> b) -> Pairing a -> Pairing a #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Pairing a -> r #

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Pairing a -> r #

gmapQ :: (forall d. Data d => d -> u) -> Pairing a -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Pairing a -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Pairing a -> m (Pairing a) #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Pairing a -> m (Pairing a) #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Pairing a -> m (Pairing a) #

Ord a => Ord (Pairing a) Source # 

Methods

compare :: Pairing a -> Pairing a -> Ordering #

(<) :: Pairing a -> Pairing a -> Bool #

(<=) :: Pairing a -> Pairing a -> Bool #

(>) :: Pairing a -> Pairing a -> Bool #

(>=) :: Pairing a -> Pairing a -> Bool #

max :: Pairing a -> Pairing a -> Pairing a #

min :: Pairing a -> Pairing a -> Pairing a #

(Read a, Ord a) => Read (Pairing a) Source # 
(Show a, Ord a) => Show (Pairing a) Source # 

Methods

showsPrec :: Int -> Pairing a -> ShowS #

show :: Pairing a -> String #

showList :: [Pairing a] -> ShowS #

Generic (Pairing a) Source # 

Associated Types

type Rep (Pairing a) :: * -> * #

Methods

from :: Pairing a -> Rep (Pairing a) x #

to :: Rep (Pairing a) x -> Pairing a #

Ord a => Monoid (Pairing a) Source # 

Methods

mempty :: Pairing a #

mappend :: Pairing a -> Pairing a -> Pairing a #

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

NFData a => NFData (Pairing a) Source # 

Methods

rnf :: Pairing a -> () #

type Rep1 Pairing Source # 
type Rep1 Pairing = D1 (MetaData "Pairing" "Data.Queue.Pairing" "type-indexed-queues-0.1.0.1-GPaLldpmb1Q20PpM0x8M72" False) ((:+:) (C1 (MetaCons "E" PrefixI False) U1) (C1 (MetaCons "T" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) ((:.:) [] (Rec1 Pairing))))))
type Rep (Pairing a) Source # 
type Rep (Pairing a) = D1 (MetaData "Pairing" "Data.Queue.Pairing" "type-indexed-queues-0.1.0.1-GPaLldpmb1Q20PpM0x8M72" False) ((:+:) (C1 (MetaCons "E" PrefixI False) U1) (C1 (MetaCons "T" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [Pairing a])))))