[Int] -> Int

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.
length :: [a] -> Int
base Prelude, base Data.List
O(n). length returns the length of a finite list as an Int. It is an instance of the more general Data.List.genericLength, the result type of which may be any kind of number.
ListItem :: Int -> Node
HUnit Test.HUnit.Base
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.
bfsn :: Graph gr => [Node] -> gr a b -> [Node]
fgl Data.Graph.Inductive.Query.BFS
dfs :: Graph gr => [Node] -> gr a b -> [Node]
fgl Data.Graph.Inductive.Query.DFS
rdfs :: Graph gr => [Node] -> gr a b -> [Node]
fgl Data.Graph.Inductive.Query.DFS
udfs :: Graph gr => [Node] -> gr a b -> [Node]
fgl Data.Graph.Inductive.Query.DFS
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.

Show more results