:: Ord a => [a] -> [a]

sort :: (Ord a) => [a] -> [a]
base DA.List
The `sort` function implements a stable sorting algorithm. It is a special case of `sortBy`, which allows the programmer to supply their own comparison function. Elements are arranged from lowest to highest, keeping duplicates in the order they appeared in the input (a stable sort).
dedup :: (Ord a) => [a] -> [a]
base DA.List
`dedup l` removes duplicate elements from a list. In particular, it keeps only the first occurence of each element. It is a special case of `dedupBy`, which allows the programmer to supply their own equality test. `dedup` is called `nub` in Haskell.
dedupSort :: (Ord a) => [a] -> [a]
base DA.List
The `dedupSort` function sorts and removes duplicate elements from a list. In particular, it keeps only the first occurrence of each element.
toList :: Foldable t => t a -> [a]
base DA.Foldable
List of elements of a structure, from left to right.
head :: (ActionFail m) => [a] -> m a
base DA.List.Total
last :: (ActionFail m) => [a] -> m a
base DA.List.Total
from1 :: Generic1 f rep => f a -> rep a
base DA.Generics
Convert from the datatype to its representation
to1 :: Generic1 f rep => rep a -> f a
base DA.Generics
Convert from the representation to the datatype
cv :: Conv a b => a x -> b x
base DA.Upgrade
isom :: Iso a b => a x -> b x
base DA.Upgrade
tail :: (ActionFail m) => [a] -> m [a]
base DA.List.Total
init :: (ActionFail m) => [a] -> m [a]
base DA.List.Total