Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. fromDistinctDescList :: [a] -> Set a

   containers	Data.Set

   Build a set from a descending list of distinct elements in linear time. The precondition (input list is strictly descending) is not checked.

2. fromList :: Ord a => [a] -> Set a

   containers	Data.Set

   Create a set from a list of elements. If the elements are ordered, a linear-time implementation is used.

3. toAscList :: Set a -> [a]

   containers	Data.Set

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

4. toDescList :: Set a -> [a]

   containers	Data.Set

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

5. toList :: Set a -> [a]

   containers	Data.Set

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

6. fromAscList :: Eq a => [a] -> Set a

   containers	Data.Set.Internal

   Build a set from an ascending list in linear time. The precondition (input list is ascending) is not checked.

7. fromDescList :: Eq a => [a] -> Set a

   containers	Data.Set.Internal

   Build a set from a descending list in linear time. The precondition (input list is descending) is not checked.

8. fromDistinctAscList :: [a] -> Set a

   containers	Data.Set.Internal

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

9. fromDistinctDescList :: [a] -> Set a

   containers	Data.Set.Internal

   Build a set from a descending list of distinct elements in linear time. The precondition (input list is strictly descending) is not checked.

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

    containers	Data.Set.Internal

    Create a set from a list of elements. If the elements are ordered, a linear-time implementation is used.

Page 46 of many | Previous | Next