Prime -> 2010
[haskell-report.git] / report / lib-hdrs / List.hs
1 module List (
2 elemIndex, elemIndices,
3 find, findIndex, findIndices,
4 nub, nubBy, delete, deleteBy, (\\), deleteFirstsBy,
5 union, unionBy, intersect, intersectBy,
6 intersperse, transpose, partition, group, groupBy,
7 inits, tails, isPrefixOf, isSuffixOf,
8 mapAccumL, mapAccumR,
9 sort, sortBy, insert, insertBy, maximumBy, minimumBy,
10 genericLength, genericTake, genericDrop,
11 genericSplitAt, genericIndex, genericReplicate,
12 zip4, zip5, zip6, zip7,
13 zipWith4, zipWith5, zipWith6, zipWith7,
14 unzip4, unzip5, unzip6, unzip7, unfoldr,
15
16 -- ...and what the Prelude exports
17 -- []((:), []), -- This is built-in syntax
18 map, (++), concat, filter,
19 head, last, tail, init, null, length, (!!),
20 foldl, foldl1, scanl, scanl1, foldr, foldr1, scanr, scanr1,
21 iterate, repeat, replicate, cycle,
22 take, drop, splitAt, takeWhile, dropWhile, span, break,
23 lines, words, unlines, unwords, reverse, and, or,
24 any, all, elem, notElem, lookup,
25 sum, product, maximum, minimum, concatMap,
26 zip, zip3, zipWith, zipWith3, unzip, unzip3
27 ) where
28
29 infix 5 \\
30
31 elemIndex :: Eq a => a -> [a] -> Maybe Int
32 elemIndices :: Eq a => a -> [a] -> [Int]
33 find :: (a -> Bool) -> [a] -> Maybe a
34 findIndex :: (a -> Bool) -> [a] -> Maybe Int
35 findIndices :: (a -> Bool) -> [a] -> [Int]
36 nub :: Eq a => [a] -> [a]
37 nubBy :: (a -> a -> Bool) -> [a] -> [a]
38 delete :: Eq a => a -> [a] -> [a]
39 deleteBy :: (a -> a -> Bool) -> a -> [a] -> [a]
40 (\\) :: Eq a => [a] -> [a] -> [a]
41 deleteFirstsBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]
42 union :: Eq a => [a] -> [a] -> [a]
43 unionBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]
44