Hoogle Search

Within LTS Haskell 24.61 (ghc-9.10.3)

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

Exact lookup

1. fromAscList :: Eq a => NonEmpty a -> NESet a

   nonempty-containers	Data.Set.NonEmpty

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

2. fromDescList :: Eq a => NonEmpty a -> NESet a

   nonempty-containers	Data.Set.NonEmpty

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

3. fromDistinctAscList :: NonEmpty a -> NESet a

   nonempty-containers	Data.Set.NonEmpty

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

4. fromDistinctDescList :: NonEmpty a -> NESet a

   nonempty-containers	Data.Set.NonEmpty

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

5. fromList :: Ord a => NonEmpty a -> NESet a

   nonempty-containers	Data.Set.NonEmpty

   O(n*log n). Create a set from a list of elements.

6. toAscList :: NESet a -> NonEmpty a

   nonempty-containers	Data.Set.NonEmpty

   O(n). Convert the set to an ascending non-empty list of elements.

7. toDescList :: NESet a -> NonEmpty a

   nonempty-containers	Data.Set.NonEmpty

   O(n). Convert the set to a descending non-empty list of elements.

8. toList :: NESet a -> NonEmpty a

   nonempty-containers	Data.Set.NonEmpty

   O(n). Convert the set to a non-empty list of elements.

9. fromList :: Ord a => NonEmpty a -> NESet a

   nonempty-containers	Data.Set.NonEmpty.Internal

   O(n*log n). Create a set from a list of elements.

10. toList :: NESet a -> NonEmpty a

    nonempty-containers	Data.Set.NonEmpty.Internal

    O(n). Convert the set to a non-empty list of elements.

Page 139 of many | Previous | Next