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.
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.
runReturningList :: (MonadBeam be m, FromBackendRow be x) => BeamSqlBackendSyntax be -> m [x]beam-core Database.Beam Run the given command, collect all the results, and return them as a list. May be more convenient than runReturningMany, but reads the entire result set into memory.
runReturningList :: (MonadBeam be m, FromBackendRow be x) => BeamSqlBackendSyntax be -> m [x]beam-core Database.Beam.Backend.SQL Run the given command, collect all the results, and return them as a list. May be more convenient than runReturningMany, but reads the entire result set into memory.
-
beam-core Database.Beam.Backend.SQL.BeamExtensions No documentation available.
-
beam-core Database.Beam.Backend.SQL.BeamExtensions No documentation available.