Hoogle Search
Within LTS Haskell 24.6 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
toList :: Ord a => MinQueue a -> [a]pqueue Data.PQueue.Min Returns the elements of the priority queue in ascending order. Equivalent to toAscList. If the order of the elements is irrelevant, consider using toListU.
-
pqueue Data.PQueue.Min Returns the elements of the queue, in no particular order.
fromAscList :: [(k, a)] -> MaxPQueue k apqueue Data.PQueue.Prio.Max Build a priority queue from an ascending list of (key, value) pairs. The precondition is not checked.
fromDescList :: [(k, a)] -> MaxPQueue k apqueue Data.PQueue.Prio.Max Build a priority queue from a descending list of (key, value) pairs. The precondition is not checked.
fromList :: Ord k => [(k, a)] -> MaxPQueue k apqueue Data.PQueue.Prio.Max Build a priority queue from the list of (key, value) pairs.
toAscList :: Ord k => MaxPQueue k a -> [(k, a)]pqueue Data.PQueue.Prio.Max Return all (key, value) pairs in ascending order by key.
toDescList :: Ord k => MaxPQueue k a -> [(k, a)]pqueue Data.PQueue.Prio.Max Return all (key, value) pairs in descending order by key.
toList :: Ord k => MaxPQueue k a -> [(k, a)]pqueue Data.PQueue.Prio.Max Equivalent to toDescList. If the traversal order is irrelevant, consider using toListU.
toListU :: MaxPQueue k a -> [(k, a)]pqueue Data.PQueue.Prio.Max Returns all (key, value) pairs in the queue in no particular order.
fromAscList :: [(k, a)] -> MinPQueue k apqueue Data.PQueue.Prio.Min Build a priority queue from an ascending list of (key, value) pairs. The precondition is not checked.