haskell98-1.0.1.1: Compatibility with Haskell 98Source codeContentsIndex
List
Synopsis
elemIndex :: Eq a => a -> [a] -> Maybe Int
elemIndices :: Eq a => a -> [a] -> [Int]
find :: (a -> Bool) -> [a] -> Maybe a
findIndex :: (a -> Bool) -> [a] -> Maybe Int
findIndices :: (a -> Bool) -> [a] -> [Int]
nub :: Eq a => [a] -> [a]
nubBy :: (a -> a -> Bool) -> [a] -> [a]
delete :: Eq a => a -> [a] -> [a]
deleteBy :: (a -> a -> Bool) -> a -> [a] -> [a]
(\\) :: Eq a => [a] -> [a] -> [a]
deleteFirstsBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]
union :: Eq a => [a] -> [a] -> [a]
unionBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]
intersect :: Eq a => [a] -> [a] -> [a]
intersectBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]
intersperse :: a -> [a] -> [a]
transpose :: [[a]] -> [[a]]
partition :: (a -> Bool) -> [a] -> ([a], [a])
group :: Eq a => [a] -> [[a]]
groupBy :: (a -> a -> Bool) -> [a] -> [[a]]
inits :: [a] -> [[a]]
tails :: [a] -> [[a]]
isPrefixOf :: Eq a => [a] -> [a] -> Bool
isSuffixOf :: Eq a => [a] -> [a] -> Bool
mapAccumL :: (acc -> x -> (acc, y)) -> acc -> [x] -> (acc, [y])
mapAccumR :: (acc -> x -> (acc, y)) -> acc -> [x] -> (acc, [y])
sort :: Ord a => [a] -> [a]
sortBy :: (a -> a -> Ordering) -> [a] -> [a]
insert :: Ord a => a -> [a] -> [a]
insertBy :: (a -> a -> Ordering) -> a -> [a] -> [a]
maximumBy :: (a -> a -> Ordering) -> [a] -> a
minimumBy :: (a -> a -> Ordering) -> [a] -> a
genericLength :: Num i => [b] -> i
genericTake :: Integral i => i -> [a] -> [a]
genericDrop :: Integral i => i -> [a] -> [a]
genericSplitAt :: Integral i => i -> [b] -> ([b], [b])
genericIndex :: Integral a => [b] -> a -> b
genericReplicate :: Integral i => i -> a -> [a]
zip4 :: [a] -> [b] -> [c] -> [d] -> [(a, b, c, d)]
zip5 :: [a] -> [b] -> [c] -> [d] -> [e] -> [(a, b, c, d, e)]
zip6 :: [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [(a, b, c, d, e, f)]
zip7 :: [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [g] -> [(a, b, c, d, e, f, g)]
zipWith4 :: (a -> b -> c -> d -> e) -> [a] -> [b] -> [c] -> [d] -> [e]
zipWith5 :: (a -> b -> c -> d -> e -> f) -> [a] -> [b] -> [c] -> [d] -> [e] -> [f]
zipWith6 :: (a -> b -> c -> d -> e -> f -> g) -> [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [g]
zipWith7 :: (a -> b -> c -> d -> e -> f -> g -> h) -> [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [g] -> [h]
unzip4 :: [(a, b, c, d)] -> ([a], [b], [c], [d])
unzip5 :: [(a, b, c, d, e)] -> ([a], [b], [c], [d], [e])
unzip6 :: [(a, b, c, d, e, f)] -> ([a], [b], [c], [d], [e], [f])
unzip7 :: [(a, b, c, d, e, f, g)] -> ([a], [b], [c], [d], [e], [f], [g])
unfoldr :: (b -> Maybe (a, b)) -> b -> [a]
map :: (a -> b) -> [a] -> [b]
(++) :: [a] -> [a] -> [a]
concat
filter
head
last
tail
init
null
length
!!
foldl
foldl1 :: (a -> a -> a) -> [a] -> a
scanl
scanl1
foldr :: (a -> b -> b) -> b -> [a] -> b
foldr1
scanr
scanr1
iterate
repeat
replicate
cycle
take
drop
splitAt
takeWhile
dropWhile
span
break
lines :: String -> [String]
words :: String -> [String]
unlines :: [String] -> String
unwords :: [String] -> String
reverse
and
or
any
all
elem
notElem
lookup
sum :: Num a => [a] -> a
product :: Num a => [a] -> a
maximum :: Ord a => [a] -> a
minimum :: Ord a => [a] -> a
concatMap
zip
zip3
zipWith
zipWith3
unzip
unzip3
Documentation
elemIndex :: Eq a => a -> [a] -> Maybe IntSource
The elemIndex function returns the index of the first element in the given list which is equal (by ==) to the query element, or Nothing if there is no such element.
elemIndices :: Eq a => a -> [a] -> [Int]Source
The elemIndices function extends elemIndex, by returning the indices of all elements equal to the query element, in ascending order.
find :: (a -> Bool) -> [a] -> Maybe aSource
The find function takes a predicate and a list and returns the first element in the list matching the predicate, or Nothing if there is no such element.
findIndex :: (a -> Bool) -> [a] -> Maybe IntSource
The findIndex function takes a predicate and a list and returns the index of the first element in the list satisfying the predicate, or Nothing if there is no such element.
findIndices :: (a -> Bool) -> [a] -> [Int]Source
The findIndices function extends findIndex, by returning the indices of all elements satisfying the predicate, in ascending order.
nub :: Eq a => [a] -> [a]Source
The nub function removes duplicate elements from a list. In particular, it keeps only the first occurrence of each element. (The name nub means `essence'.) It is a special case of nubBy, which allows the programmer to supply their own equality test.
nubBy :: (a -> a -> Bool) -> [a] -> [a]Source
The nubBy function behaves just like nub, except it uses a user-supplied equality predicate instead of the overloaded == function.
delete :: Eq a => a -> [a] -> [a]Source

delete x removes the first occurrence of x from its list argument. For example,

delete 'a' "banana" == "bnana"

It is a special case of deleteBy, which allows the programmer to supply their own equality test.

deleteBy :: (a -> a -> Bool) -> a -> [a] -> [a]Source
The deleteBy function behaves like delete, but takes a user-supplied equality predicate.
(\\) :: Eq a => [a] -> [a] -> [a]Source

The \\ function is list difference ((non-associative). In the result of xs \\ ys, the first occurrence of each element of ys in turn (if any) has been removed from xs. Thus

(xs ++ ys) \\ xs == ys.

It is a special case of deleteFirstsBy, which allows the programmer to supply their own equality test.

deleteFirstsBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]Source
The deleteFirstsBy function takes a predicate and two lists and returns the first list with the first occurrence of each element of the second list removed.
union :: Eq a => [a] -> [a] -> [a]Source

The union function returns the list union of the two lists. For example,

"dog" `union` "cow" == "dogcw"

Duplicates, and elements of the first list, are removed from the the second list, but if the first list contains duplicates, so will the result. It is a special case of unionBy, which allows the programmer to supply their own equality test.

unionBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]Source
The unionBy function is the non-overloaded version of union.
intersect :: Eq a => [a] -> [a] -> [a]Source

The intersect function takes the list intersection of two lists. For example,

[1,2,3,4] `intersect` [2,4,6,8] == [2,4]

If the first list contains duplicates, so will the result.

[1,2,2,3,4] `intersect` [6,4,4,2] == [2,2,4]

It is a special case of intersectBy, which allows the programmer to supply their own equality test.

intersectBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]Source
The intersectBy function is the non-overloaded version of intersect.
intersperse :: a -> [a] -> [a]Source

The intersperse function takes an element and a list and `intersperses' that element between the elements of the list. For example,

intersperse ',' "abcde" == "a,b,c,d,e"
transpose :: [[a]] -> [[a]]Source

The transpose function transposes the rows and columns of its argument. For example,

transpose [[1,2,3],[4,5,6]] == [[1,4],[2,5],[3,6]]
partition :: (a -> Bool) -> [a] -> ([a], [a])Source

The partition function takes a predicate a list and returns the pair of lists of elements which do and do not satisfy the predicate, respectively; i.e.,

partition p xs == (filter p xs, filter (not . p) xs)
group :: Eq a => [a] -> [[a]]Source

The group function takes a list and returns a list of lists such that the concatenation of the result is equal to the argument. Moreover, each sublist in the result contains only equal elements. For example,

group "Mississippi" = ["M","i","ss","i","ss","i","pp","i"]

It is a special case of groupBy, which allows the programmer to supply their own equality test.

groupBy :: (a -> a -> Bool) -> [a] -> [[a]]Source
The groupBy function is the non-overloaded version of group.
inits :: [a] -> [[a]]Source

The inits function returns all initial segments of the argument, shortest first. For example,

inits "abc" == ["","a","ab","abc"]
tails :: [a] -> [[a]]Source

The tails function returns all final segments of the argument, longest first. For example,

tails "abc" == ["abc", "bc", "c",""]
isPrefixOf :: Eq a => [a] -> [a] -> BoolSource
The isPrefixOf function takes two lists and returns True iff the first list is a prefix of the second.
isSuffixOf :: Eq a => [a] -> [a] -> BoolSource
The isSuffixOf function takes two lists and returns True iff the first list is a suffix of the second. Both lists must be finite.
mapAccumL :: (acc -> x -> (acc, y)) -> acc -> [x] -> (acc, [y])Source
The mapAccumL function behaves like a combination of map and foldl; it applies a function to each element of a list, passing an accumulating parameter from left to right, and returning a final value of this accumulator together with the new list.
mapAccumR :: (acc -> x -> (acc, y)) -> acc -> [x] -> (acc, [y])Source
The mapAccumR function behaves like a combination of map and foldr; it applies a function to each element of a list, passing an accumulating parameter from right to left, and returning a final value of this accumulator together with the new list.
sort :: Ord a => [a] -> [a]Source
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.
sortBy :: (a -> a -> Ordering) -> [a] -> [a]Source
The sortBy function is the non-overloaded version of sort.
insert :: Ord a => a -> [a] -> [a]Source
The insert function takes an element and a list and inserts the element into the list at the last position where it is still less than or equal to the next element. In particular, if the list is sorted before the call, the result will also be sorted. It is a special case of insertBy, which allows the programmer to supply their own comparison function.
insertBy :: (a -> a -> Ordering) -> a -> [a] -> [a]Source
The non-overloaded version of insert.
maximumBy :: (a -> a -> Ordering) -> [a] -> aSource
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] -> aSource
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.
genericLength :: Num i => [b] -> iSource
The genericLength function is an overloaded version of length. In particular, instead of returning an Int, it returns any type which is an instance of Num. It is, however, less efficient than length.
genericTake :: Integral i => i -> [a] -> [a]Source
The genericTake function is an overloaded version of take, which accepts any Integral value as the number of elements to take.
genericDrop :: Integral i => i -> [a] -> [a]Source
The genericDrop function is an overloaded version of drop, which accepts any Integral value as the number of elements to drop.
genericSplitAt :: Integral i => i -> [b] -> ([b], [b])Source
The genericSplitAt function is an overloaded version of splitAt, which accepts any Integral value as the position at which to split.
genericIndex :: Integral a => [b] -> a -> bSource
The genericIndex function is an overloaded version of !!, which accepts any Integral value as the index.
genericReplicate :: Integral i => i -> a -> [a]Source
The genericReplicate function is an overloaded version of replicate, which accepts any Integral value as the number of repetitions to make.
zip4 :: [a] -> [b] -> [c] -> [d] -> [(a, b, c, d)]Source
The zip4 function takes four lists and returns a list of quadruples, analogous to zip.
zip5 :: [a] -> [b] -> [c] -> [d] -> [e] -> [(a, b, c, d, e)]Source
The zip5 function takes five lists and returns a list of five-tuples, analogous to zip.
zip6 :: [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [(a, b, c, d, e, f)]Source
The zip6 function takes six lists and returns a list of six-tuples, analogous to zip.
zip7 :: [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [g] -> [(a, b, c, d, e, f, g)]Source
The zip7 function takes seven lists and returns a list of seven-tuples, analogous to zip.
zipWith4 :: (a -> b -> c -> d -> e) -> [a] -> [b] -> [c] -> [d] -> [e]Source
The zipWith4 function takes a function which combines four elements, as well as four lists and returns a list of their point-wise combination, analogous to zipWith.
zipWith5 :: (a -> b -> c -> d -> e -> f) -> [a] -> [b] -> [c] -> [d] -> [e] -> [f]Source
The zipWith5 function takes a function which combines five elements, as well as five lists and returns a list of their point-wise combination, analogous to zipWith.
zipWith6 :: (a -> b -> c -> d -> e -> f -> g) -> [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [g]Source
The zipWith6 function takes a function which combines six elements, as well as six lists and returns a list of their point-wise combination, analogous to zipWith.
zipWith7 :: (a -> b -> c -> d -> e -> f -> g -> h) -> [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [g] -> [h]Source
The zipWith7 function takes a function which combines seven elements, as well as seven lists and returns a list of their point-wise combination, analogous to zipWith.
unzip4 :: [(a, b, c, d)] -> ([a], [b], [c], [d])Source
The unzip4 function takes a list of quadruples and returns four lists, analogous to unzip.
unzip5 :: [(a, b, c, d, e)] -> ([a], [b], [c], [d], [e])Source
The unzip5 function takes a list of five-tuples and returns five lists, analogous to unzip.
unzip6 :: [(a, b, c, d, e, f)] -> ([a], [b], [c], [d], [e], [f])Source
The unzip6 function takes a list of six-tuples and returns six lists, analogous to unzip.
unzip7 :: [(a, b, c, d, e, f, g)] -> ([a], [b], [c], [d], [e], [f], [g])Source
The unzip7 function takes a list of seven-tuples and returns seven lists, analogous to unzip.
unfoldr :: (b -> Maybe (a, b)) -> b -> [a]Source

The unfoldr function is a `dual' to foldr: while foldr reduces a list to a summary value, unfoldr builds a list from a seed value. The function takes the element and returns Nothing if it is done producing the list or returns Just (a,b), in which case, a is a prepended to the list and b is used as the next element in a recursive call. For example,

iterate f == unfoldr (\x -> Just (x, f x))

In some cases, unfoldr can undo a foldr operation:

unfoldr f' (foldr f z xs) == xs

if the following holds:

f' (f x y) = Just (x,y) f' z = Nothing

A simple use of unfoldr:

unfoldr (\b -> if b == 0 then Nothing else Just (b, b-1)) 10 [10,9,8,7,6,5,4,3,2,1]
map :: (a -> b) -> [a] -> [b]Source

map f xs is the list obtained by applying f to each element of xs, i.e.,

map f [x1, x2, ..., xn] == [f x1, f x2, ..., f xn] map f [x1, x2, ...] == [f x1, f x2, ...]
(++) :: [a] -> [a] -> [a]Source

Append two lists, i.e.,

[x1, ..., xm] ++ [y1, ..., yn] == [x1, ..., xm, y1, ..., yn] [x1, ..., xm] ++ [y1, ...] == [x1, ..., xm, y1, ...]

If the first list is not finite, the result is the first list.

concat
filter
head
last
tail
init
null
length
!!
foldl
foldl1 :: (a -> a -> a) -> [a] -> aSource
foldl1 is a variant of foldl that has no starting value argument, and thus must be applied to non-empty lists.
scanl
scanl1
foldr :: (a -> b -> b) -> b -> [a] -> bSource

foldr, applied to a binary operator, a starting value (typically the right-identity of the operator), and a list, reduces the list using the binary operator, from right to left:

foldr f z [x1, x2, ..., xn] == x1 `f` (x2 `f` ... (xn `f` z)...)
foldr1
scanr
scanr1
iterate
repeat
replicate
cycle
take
drop
splitAt
takeWhile
dropWhile
span
break
lines :: String -> [String]Source
lines breaks a string up into a list of strings at newline characters. The resulting strings do not contain newlines.
words :: String -> [String]Source
words breaks a string up into a list of words, which were delimited by white space.
unlines :: [String] -> StringSource
unlines is an inverse operation to lines. It joins lines, after appending a terminating newline to each.
unwords :: [String] -> StringSource
unwords is an inverse operation to words. It joins words with separating spaces.
reverse
and
or
any
all
elem
notElem
lookup
sum :: Num a => [a] -> aSource
The sum function computes the sum of a finite list of numbers.
product :: Num a => [a] -> aSource
The product function computes the product of a finite list of numbers.
maximum :: Ord a => [a] -> aSource
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] -> aSource
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.
concatMap
zip
zip3
zipWith
zipWith3
unzip
unzip3
Produced by Haddock version 2.6.0