Hoogle Search
Within LTS Haskell 24.36 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
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.
fromDescList :: [(k, a)] -> MinPQueue k apqueue Data.PQueue.Prio.Min Build a priority queue from a descending list of (key, value) pairs. The precondition is not checked.
fromList :: Ord k => [(k, a)] -> MinPQueue k apqueue Data.PQueue.Prio.Min Constructs a priority queue from an unordered list.
toAscList :: Ord k => MinPQueue k a -> [(k, a)]pqueue Data.PQueue.Prio.Min Return all (key, value) pairs in ascending order by key.
toDescList :: Ord k => MinPQueue k a -> [(k, a)]pqueue Data.PQueue.Prio.Min Return all (key, value) pairs in descending order by key.
toList :: Ord k => MinPQueue k a -> [(k, a)]pqueue Data.PQueue.Prio.Min Equivalent to toAscList. If the traversal order is irrelevant, consider using toListU.
toListU :: MinPQueue k a -> [(k, a)]pqueue Data.PQueue.Prio.Min Returns all (key, value) pairs in the queue in no particular order.
type
ChildList = MVar [Weak Statement]HDBC Database.HDBC.DriverUtils No documentation available.