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.

Exact lookup

1. toDescList :: Word64Set -> [Key]

   ghc-lib-parser	GHC.Data.Word64Set

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

2. toList :: Word64Set -> [Key]

   ghc-lib-parser	GHC.Data.Word64Set

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

3. fromAscList :: [Key] -> Word64Set

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

   Build a set from an ascending list of elements. The precondition (input list is ascending) is not checked.

4. fromDistinctAscList :: [Key] -> Word64Set

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

   Build a set from an ascending list of distinct elements. The precondition (input list is strictly ascending) is not checked.

5. fromList :: [Key] -> Word64Set

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

   Create a set from a list of integers.

6. toAscList :: Word64Set -> [Key]

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

   Convert the set to an ascending list of elements. Subject to list fusion.

7. toDescList :: Word64Set -> [Key]

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

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

8. toList :: Word64Set -> [Key]

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

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

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

   pqueue	Data.PQueue.Max

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

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

    pqueue	Data.PQueue.Max

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

Page 120 of many | Previous | Next