Haskell Core Libraries (base package) Parent Contents Index

Data.List Portability portable Stability provisional Maintainer libraries@haskell.org

Description

Operations on lists.

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]

unfoldr :: (b -> Maybe (a, b)) -> b -> [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])

map :: (a -> b) -> [a] -> [b]

(++) :: [a] -> [a] -> [a]

concat :: [[a]] -> [a]

filter :: (a -> Bool) -> [a] -> [a]

head :: [a] -> a

last :: [a] -> a

tail :: [a] -> [a]

init :: [a] -> [a]

null :: [a] -> Bool

length :: [a] -> Int

(!!) :: [a] -> Int -> a

foldl :: (a -> b -> a) -> a -> [b] -> a

foldl' :: (a -> b -> a) -> a -> [b] -> a

foldl1 :: (a -> a -> a) -> [a] -> a

scanl :: (a -> b -> a) -> a -> [b] -> [a]

scanl1 :: (a -> a -> a) -> [a] -> [a]

foldr :: (a -> b -> b) -> b -> [a] -> b

foldr1 :: (a -> a -> a) -> [a] -> a

scanr :: (a -> b -> b) -> b -> [a] -> [b]

scanr1 :: (a -> a -> a) -> [a] -> [a]

iterate :: (a -> a) -> a -> [a]

repeat :: a -> [a]

replicate :: Int -> a -> [a]

cycle :: [a] -> [a]

take :: Int -> [b] -> [b]

drop :: Int -> [b] -> [b]

splitAt :: Int -> [b] -> ([b], [b])

takeWhile :: (a -> Bool) -> [a] -> [a]

dropWhile :: (a -> Bool) -> [a] -> [a]

span :: (a -> Bool) -> [a] -> ([a], [a])

break :: (a -> Bool) -> [a] -> ([a], [a])

lines :: String -> [String]

words :: String -> [String]

unlines :: [String] -> String

unwords :: [String] -> String

reverse :: [a] -> [a]

and :: [Bool] -> Bool

or :: [Bool] -> Bool

any :: (a -> Bool) -> [a] -> Bool

all :: (a -> Bool) -> [a] -> Bool

elem :: (Eq a) => a -> [a] -> Bool

notElem :: (Eq a) => a -> [a] -> Bool

lookup :: (Eq a) => a -> [(a, b)] -> Maybe b

sum :: (Num a) => [a] -> a

product :: (Num a) => [a] -> a

maximum :: (Ord a) => [a] -> a

minimum :: (Ord a) => [a] -> a

concatMap :: (a -> [b]) -> [a] -> [b]

zip :: [a] -> [b] -> [(a, b)]

zip3 :: [a] -> [b] -> [c] -> [(a, b, c)]

zipWith :: (a -> b -> c) -> [a] -> [b] -> [c]

zipWith3 :: (a -> b -> c -> d) -> [a] -> [b] -> [c] -> [d]

unzip :: [(a, b)] -> ([a], [b])

unzip3 :: [(a, b, c)] -> ([a], [b], [c])

Produced by Haddock version 0.4