Hoogle Search
Within LTS Haskell 24.28 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
fromList :: HeapItem pol item => [item] -> Heap pol itemheap Data.Heap O(n log n). Build a Heap from the given items. Assuming you have a sorted list, you probably want to use fromDescList or fromAscList, they are faster than this function.
toAscList :: HeapItem pol item => Heap pol item -> [item]heap Data.Heap O(n log n). List the items of the Heap in ascending order of priority.
toDescList :: HeapItem pol item => Heap pol item -> [item]heap Data.Heap O(n log n). List the items of the Heap in descending order of priority. Note that this function is not especially efficient (it is implemented in terms of reverse and toAscList), it is provided as a counterpart of the efficient fromDescList function.
toList :: HeapItem pol item => Heap pol item -> [item]heap Data.Heap O(n log n). List all items of the Heap in no specific order.
sqlSetCmdList :: MonadState SqlInsert m => SQL -> [SQL] -> m ()hpqtypes-extras Database.PostgreSQL.PQTypes.SQL.Builder No documentation available.
sqlSetList :: (MonadState SqlInsert m, Show a, ToSQL a) => SQL -> [a] -> m ()hpqtypes-extras Database.PostgreSQL.PQTypes.SQL.Builder No documentation available.
sqlSetListWithDefaults :: (MonadState SqlInsert m, Show a, ToSQL a) => SQL -> [Maybe a] -> m ()hpqtypes-extras Database.PostgreSQL.PQTypes.SQL.Builder No documentation available.
module Data.
IndexedListLiterals No documentation available.
-
indexed-list-literals Data.IndexedListLiterals A type class which allows you to write tuples which can be transformed to and from a list the length of the list is also provided as a Nat
-
indexed-list-literals Data.IndexedListLiterals > fromList [1,2,3] :: Maybe (Int, Int, Int) Just (1,2,3)
> fromList ["word","up"] :: Maybe (String, String, String) Nothing
> fromList ['z'] :: Maybe (Only Char) Just (Only 'z')