pqueue-1.0.0: Reliable, persistent, fast priority queues.

Data.PQueue.Max

Contents

Synopsis

Documentation

data MaxQueue a Source

Instances

Ord a => Eq (MaxQueue a) 
Ord a => Ord (MaxQueue a) 

Construction

insert :: Ord a => a -> MaxQueue a -> MaxQueue aSource

Query

Maximum view

Traversal

Map

map :: Ord b => (a -> b) -> MaxQueue a -> MaxQueue bSource

mapMonotonic :: (a -> b) -> MaxQueue a -> MaxQueue bSource

Fold

foldr :: Ord a => (a -> b -> b) -> b -> MaxQueue a -> bSource

foldl :: Ord a => (b -> a -> b) -> b -> MaxQueue a -> bSource

Traverse

traverse :: (Applicative f, Ord a, Ord b) => (a -> f b) -> MaxQueue a -> f (MaxQueue b)Source

Subsets

Indexed

take :: Ord a => Int -> MaxQueue a -> [a]Source

drop :: Ord a => Int -> MaxQueue a -> MaxQueue aSource

splitAt :: Ord a => Int -> MaxQueue a -> ([a], MaxQueue a)Source

Predicates

takeWhile :: Ord a => (a -> Bool) -> MaxQueue a -> [a]Source

dropWhile :: Ord a => (a -> Bool) -> MaxQueue a -> MaxQueue aSource

span :: Ord a => (a -> Bool) -> MaxQueue a -> ([a], MaxQueue a)Source

break :: Ord a => (a -> Bool) -> MaxQueue a -> ([a], MaxQueue a)Source

Filter

filter :: Ord a => (a -> Bool) -> MaxQueue a -> MaxQueue aSource

partition :: Ord a => (a -> Bool) -> MaxQueue a -> (MaxQueue a, MaxQueue a)Source

List operations

Conversion from lists

fromList :: Ord a => [a] -> MaxQueue aSource

Conversion to lists

elems :: Ord a => MaxQueue a -> [a]Source

toList :: Ord a => MaxQueue a -> [a]Source

toDescList :: Ord a => MaxQueue a -> [a]Source

Conversion with MaxPQueue

Unordered operations

foldrU :: (a -> b -> b) -> b -> MaxQueue a -> bSource

foldlU :: (b -> a -> b) -> b -> MaxQueue a -> bSource

toListU :: Ord a => MaxQueue a -> [a]Source

Helper methods

seqSpine :: MaxQueue a -> b -> bSource