Data.Queue.Leftist

Leftist heaps.

Documentation

data Leftist a

A simple, unchecked, weight-biased leftist heap. Based on implementation from here.

Constructors

Leaf

Node !Int a (Leftist a) (Leftist a)

Instances

Functor Leftist

Methods

fmap :: (a -> b) -> Leftist a -> Leftist b

(<$) :: a -> Leftist b -> Leftist a

Foldable Leftist

Methods

fold :: Monoid m => Leftist m -> m

foldMap :: Monoid m => (a -> m) -> Leftist a -> m

foldr :: (a -> b -> b) -> b -> Leftist a -> b

foldr' :: (a -> b -> b) -> b -> Leftist a -> b

foldl :: (b -> a -> b) -> b -> Leftist a -> b

foldl' :: (b -> a -> b) -> b -> Leftist a -> b

foldr1 :: (a -> a -> a) -> Leftist a -> a

foldl1 :: (a -> a -> a) -> Leftist a -> a

toList :: Leftist a -> [a]

null :: Leftist a -> Bool

length :: Leftist a -> Int

elem :: Eq a => a -> Leftist a -> Bool

maximum :: Ord a => Leftist a -> a

minimum :: Ord a => Leftist a -> a

sum :: Num a => Leftist a -> a

product :: Num a => Leftist a -> a

Traversable Leftist

Methods

traverse :: Applicative f => (a -> f b) -> Leftist a -> f (Leftist b)

sequenceA :: Applicative f => Leftist (f a) -> f (Leftist a)

mapM :: Monad m => (a -> m b) -> Leftist a -> m (Leftist b)

sequence :: Monad m => Leftist (m a) -> m (Leftist a)

Generic1 Leftist

Associated Types

type Rep1 (Leftist :: * -> *) :: * -> *

Methods

from1 :: Leftist a -> Rep1 Leftist a

to1 :: Rep1 Leftist a -> Leftist a

Ord a => MeldableQueue Leftist a

Methods

merge :: Leftist a -> Leftist a -> Leftist a

fromFoldable :: Foldable f => f a -> Leftist a

Ord a => Queue Leftist a

Methods

minView :: Leftist a -> Maybe (a, Leftist a)

insert :: a -> Leftist a -> Leftist a

empty :: Leftist a

singleton :: a -> Leftist a

toList :: Leftist a -> [a]

fromList :: [a] -> Leftist a

heapSort :: p Leftist -> [a] -> [a]

Ord a => Eq (Leftist a)

Methods

(==) :: Leftist a -> Leftist a -> Bool

(/=) :: Leftist a -> Leftist a -> Bool

Data a => Data (Leftist a)

Methods

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

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

toConstr :: Leftist a -> Constr

dataTypeOf :: Leftist a -> DataType

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

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

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

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

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

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

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

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

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

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

Ord a => Ord (Leftist a)

Methods

compare :: Leftist a -> Leftist a -> Ordering

(<) :: Leftist a -> Leftist a -> Bool

(<=) :: Leftist a -> Leftist a -> Bool

(>) :: Leftist a -> Leftist a -> Bool

(>=) :: Leftist a -> Leftist a -> Bool

max :: Leftist a -> Leftist a -> Leftist a

min :: Leftist a -> Leftist a -> Leftist a

(Read a, Ord a) => Read (Leftist a)

Methods

readsPrec :: Int -> ReadS (Leftist a)

readList :: ReadS [Leftist a]

readPrec :: ReadPrec (Leftist a)

readListPrec :: ReadPrec [Leftist a]

(Show a, Ord a) => Show (Leftist a)

Methods

showsPrec :: Int -> Leftist a -> ShowS

show :: Leftist a -> String

showList :: [Leftist a] -> ShowS

Generic (Leftist a)

Associated Types

type Rep (Leftist a) :: * -> *

Methods

from :: Leftist a -> Rep (Leftist a) x

to :: Rep (Leftist a) x -> Leftist a

Ord a => Monoid (Leftist a)

Methods

mempty :: Leftist a

mappend :: Leftist a -> Leftist a -> Leftist a

mconcat :: [Leftist a] -> Leftist a

NFData a => NFData (Leftist a)

Methods

rnf :: Leftist a -> ()

type Rep1 Leftist

type Rep1 Leftist = D1 (MetaData "Leftist" "Data.Queue.Leftist" "type-indexed-queues-0.2.0.0-8uqeMba477nJxPUanpLvxV" False) ((:+:) (C1 (MetaCons "Leaf" PrefixI False) U1) (C1 (MetaCons "Node" PrefixI False) ((:*:) ((:*:) (S1 (MetaSel (Nothing Symbol) SourceUnpack SourceStrict DecidedUnpack) (Rec0 Int)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1)) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec1 Leftist)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec1 Leftist))))))

type Rep (Leftist a)

type Rep (Leftist a) = D1 (MetaData "Leftist" "Data.Queue.Leftist" "type-indexed-queues-0.2.0.0-8uqeMba477nJxPUanpLvxV" False) ((:+:) (C1 (MetaCons "Leaf" PrefixI False) U1) (C1 (MetaCons "Node" PrefixI False) ((:*:) ((:*:) (S1 (MetaSel (Nothing Symbol) SourceUnpack SourceStrict DecidedUnpack) (Rec0 Int)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a))) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Leftist a))) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Leftist a)))))))

zygoLeftist :: b1 -> (Int -> a -> b1 -> b1 -> b1) -> b -> (Int -> a -> b1 -> b -> b1 -> b -> b) -> Leftist a -> b

A zygomorphism over the heap. Useful for checking shape properties.