Hoogle Search
Within LTS Haskell 24.4 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
toAscList :: Ord a => MaxQueue a -> [a]pqueue Data.PQueue.Max Extracts the elements of the priority queue in ascending order.
toDescList :: Ord a => MaxQueue a -> [a]pqueue Data.PQueue.Max Extracts the elements of the priority queue in descending order.
toList :: Ord a => MaxQueue a -> [a]pqueue Data.PQueue.Max Returns the elements of the priority queue in ascending order. Equivalent to toDescList. If the order of the elements is irrelevant, consider using toListU.
-
pqueue Data.PQueue.Max Returns a list of the elements of the priority queue, in no particular order.
fromAscList :: [a] -> MinQueue apqueue Data.PQueue.Min Constructs a priority queue from an ascending list. Warning: Does not check the precondition. Performance note: Code using this function in a performance-sensitive context with an argument that is a "good producer" for list fusion should be compiled with -fspec-constr or -O2. For example, fromAscList . map f needs one of these options for best results.
fromDescList :: [a] -> MinQueue apqueue Data.PQueue.Min Constructs a priority queue from an descending list. Warning: Does not check the precondition.
fromList :: Ord a => [a] -> MinQueue apqueue Data.PQueue.Min Constructs a priority queue from an unordered list.
toAscList :: Ord a => MinQueue a -> [a]pqueue Data.PQueue.Min Extracts the elements of the priority queue in ascending order.
toDescList :: Ord a => MinQueue a -> [a]pqueue Data.PQueue.Min Extracts the elements of the priority queue in descending order.
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.