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.

Exact lookup

1. toList :: Word64Set -> [Key]

   ghc-lib-parser	GHC.Data.Word64Set.Internal

   Convert the set to a list of elements. Subject to list fusion.

2. fromList :: Ord k => [(k, v)] -> OMap k v

   ordered-containers	Data.Map.Ordered

   If a key appears multiple times, the first occurrence is used for ordering and the last occurrence is used for its value. The library author welcomes comments on whether this default is sane.

3. toAscList :: OMap k v -> [(k, v)]

   ordered-containers	Data.Map.Ordered

   Return key-value pairs in order of increasing key.

4. fromList :: Ord k => [(k, v)] -> OMap k v

   ordered-containers	Data.Map.Ordered.Strict

   If a key appears multiple times, the first occurrence is used for ordering and the last occurrence is used for its value. The library author welcomes comments on whether this default is sane.

5. toAscList :: OMap k v -> [(k, v)]

   ordered-containers	Data.Map.Ordered.Strict

   Return key-value pairs in order of increasing key.

6. fromList :: Ord a => [a] -> OSet a

   ordered-containers	Data.Set.Ordered

   If a value occurs multiple times, only the first occurrence is used.

7. toAscList :: OSet a -> [a]

   ordered-containers	Data.Set.Ordered

   Returns values in ascending order. (Use toList to return them in insertion order.)

8. fromAscList :: [a] -> MaxQueue a

   pqueue	Data.PQueue.Max

   Constructs a priority queue from an ascending list. Warning: Does not check the precondition.

9. fromDescList :: [a] -> MaxQueue a

   pqueue	Data.PQueue.Max

   Constructs a priority queue from a descending list. Warning: Does not check the precondition.

10. fromList :: Ord a => [a] -> MaxQueue a

    pqueue	Data.PQueue.Max

    Constructs a priority queue from an unordered list.

Page 120 of many | Previous | Next