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.
fromList :: NonEmpty a -> NESeq anonempty-containers Data.Sequence.NonEmpty.Internal Create a sequence from a finite list of elements. There is a function toNonEmpty in the opposite direction for all instances of the Foldable1 class, including NESeq.
fromAscList :: Eq a => NonEmpty a -> NESet anonempty-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./
fromDescList :: Eq a => NonEmpty a -> NESet anonempty-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.
fromDistinctAscList :: NonEmpty a -> NESet anonempty-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.
fromDistinctDescList :: NonEmpty a -> NESet anonempty-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.
fromList :: Ord a => NonEmpty a -> NESet anonempty-containers Data.Set.NonEmpty O(n*log n). Create a set from a list of elements.
toAscList :: NESet a -> NonEmpty anonempty-containers Data.Set.NonEmpty O(n). Convert the set to an ascending non-empty list of elements.
toDescList :: NESet a -> NonEmpty anonempty-containers Data.Set.NonEmpty O(n). Convert the set to a descending non-empty list of elements.
toList :: NESet a -> NonEmpty anonempty-containers Data.Set.NonEmpty O(n). Convert the set to a non-empty list of elements.
fromList :: Ord a => NonEmpty a -> NESet anonempty-containers Data.Set.NonEmpty.Internal O(n*log n). Create a set from a list of elements.