[a] -> a

head :: [a] -> a
base Prelude, base Data.List
Extract the first element of a list, which must be non-empty.
last :: [a] -> a
base Prelude, base Data.List
Extract the last element of a list, which must be finite and non-empty.
foldl1 :: (a -> a -> a) -> [a] -> a
base Prelude, base Data.List
foldl1 is a variant of foldl that has no starting value argument, and thus must be applied to non-empty lists.
foldr1 :: (a -> a -> a) -> [a] -> a
base Prelude, base Data.List
foldr1 is a variant of foldr that has no starting value argument, and thus must be applied to non-empty lists.
foldl1' :: (a -> a -> a) -> [a] -> a
base Data.List
A strict version of foldl1
maximumBy :: (a -> a -> Ordering) -> [a] -> a
base Data.List
The maximumBy function takes a comparison function and a list and returns the greatest element of the list by the comparison function. The list must be finite and non-empty.
minimumBy :: (a -> a -> Ordering) -> [a] -> a
base Data.List
The minimumBy function takes a comparison function and a list and returns the least element of the list by the comparison function. The list must be finite and non-empty.
(!!) :: [a] -> Int -> a
base Prelude, base Data.List
List index (subscript) operator, starting from 0. It is an instance of the more general Data.List.genericIndex, which takes an index of any integral type.
buf_concat :: BufferOp a -> [a] -> a
HTTP Network.BufferType
genericIndex :: Integral a => [b] -> a -> b
base Data.List
The genericIndex function is an overloaded version of !!, which accepts any Integral value as the index.
maximum :: Ord a => [a] -> a
base Prelude, base Data.List
maximum returns the maximum value from a list, which must be non-empty, finite, and of an ordered type. It is a special case of maximumBy, which allows the programmer to supply their own comparison function.
minimum :: Ord a => [a] -> a
base Prelude, base Data.List
minimum returns the minimum value from a list, which must be non-empty, finite, and of an ordered type. It is a special case of minimumBy, which allows the programmer to supply their own comparison function.
product :: Num a => [a] -> a
base Prelude, base Data.List
The product function computes the product of a finite list of numbers.
sum :: Num a => [a] -> a
base Prelude, base Data.List
The sum function computes the sum of a finite list of numbers.
mconcat :: Monoid a => [a] -> a
base Data.Monoid
the :: Eq a => [a] -> a
base GHC.Exts
the ensures that all the elements of the list are identical and then returns that unique element
elements :: [a] -> Gen a
QuickCheck Test.QuickCheck.Gen, QuickCheck Test.QuickCheck
Generates one of the given values. The input list must be non-empty.
growingElements :: [a] -> Gen a
QuickCheck Test.QuickCheck.Gen, QuickCheck Test.QuickCheck
Takes a list of elements of increasing size, and chooses among an initial segment of the list. The size of this initial segment increases with the size parameter. The input list must be non-empty.
listToMaybe :: [a] -> Maybe a
base Data.Maybe
The listToMaybe function returns Nothing on an empty list or Just a of the list.
NonEmpty :: [a] -> NonEmptyList a
QuickCheck Test.QuickCheck.Modifiers, QuickCheck Test.QuickCheck

Show more results