prelude-compat-0.0.0.1: Provide Prelude and Data.List with fixed content across GHC versions

Safe HaskellSafe
LanguageHaskell98

Data.List2010

Documentation

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

(++) :: [a] -> [a] -> [a] infixr 5 Source

(\\) :: Eq a => [a] -> [a] -> [a] infix 5 Source

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

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

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

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

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

cycle :: [a] -> [a] Source

delete :: Eq a => a -> [a] -> [a] Source

deleteBy :: (a -> a -> Bool) -> a -> [a] -> [a] Source

deleteFirstsBy :: (a -> a -> Bool) -> [a] -> [a] -> [a] Source

drop :: Int -> [a] -> [a] Source

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

elem :: Eq a => a -> [a] -> Bool Source

elemIndex :: Eq a => a -> [a] -> Maybe Int Source

elemIndices :: Eq a => a -> [a] -> [Int] Source

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

find :: (a -> Bool) -> [a] -> Maybe a Source

findIndex :: (a -> Bool) -> [a] -> Maybe Int Source

findIndices :: (a -> Bool) -> [a] -> [Int] Source

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

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

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

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

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

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

genericDrop :: Integral i => i -> [a] -> [a] Source

genericIndex :: Integral a => [b] -> a -> b Source

genericLength :: Num i => [b] -> i Source

genericReplicate :: Integral i => i -> a -> [a] Source

genericSplitAt :: Integral i => i -> [b] -> ([b], [b]) Source

genericTake :: Integral i => i -> [a] -> [a] Source

group :: Eq a => [a] -> [[a]] Source

groupBy :: (a -> a -> Bool) -> [a] -> [[a]] Source

head :: [a] -> a Source

init :: [a] -> [a] Source

inits :: [a] -> [[a]] Source

insert :: Ord a => a -> [a] -> [a] Source

insertBy :: (a -> a -> Ordering) -> a -> [a] -> [a] Source

intercalate :: [a] -> [[a]] -> [a] Source

intersect :: Eq a => [a] -> [a] -> [a] Source

intersectBy :: (a -> a -> Bool) -> [a] -> [a] -> [a] Source

intersperse :: a -> [a] -> [a] Source

isInfixOf :: Eq a => [a] -> [a] -> Bool Source

isPrefixOf :: Eq a => [a] -> [a] -> Bool Source

isSuffixOf :: Eq a => [a] -> [a] -> Bool Source

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

last :: [a] -> a Source

length :: [a] -> Int Source

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

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

mapAccumL :: (acc -> x -> (acc, y)) -> acc -> [x] -> (acc, [y]) Source

mapAccumR :: (acc -> x -> (acc, y)) -> acc -> [x] -> (acc, [y]) Source

maximum :: Ord a => [a] -> a Source

maximumBy :: (a -> a -> Ordering) -> [a] -> a Source

minimum :: Ord a => [a] -> a Source

minimumBy :: (a -> a -> Ordering) -> [a] -> a Source

notElem :: Eq a => a -> [a] -> Bool Source

nub :: Eq a => [a] -> [a] Source

nubBy :: (a -> a -> Bool) -> [a] -> [a] Source

null :: [a] -> Bool Source

or :: [Bool] -> Bool Source

partition :: (a -> Bool) -> [a] -> ([a], [a]) Source

permutations :: [a] -> [[a]] Source

product :: Num a => [a] -> a Source

repeat :: a -> [a] Source

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

reverse :: [a] -> [a] Source

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

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

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

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

sort :: Ord a => [a] -> [a] Source

sortBy :: (a -> a -> Ordering) -> [a] -> [a] Source

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

splitAt :: Int -> [a] -> ([a], [a]) Source

stripPrefix :: Eq a => [a] -> [a] -> Maybe [a] Source

subsequences :: [a] -> [[a]] Source

sum :: Num a => [a] -> a Source

tail :: [a] -> [a] Source

tails :: [a] -> [[a]] Source

take :: Int -> [a] -> [a] Source

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

transpose :: [[a]] -> [[a]] Source

unfoldr :: (b -> Maybe (a, b)) -> b -> [a] Source

union :: Eq a => [a] -> [a] -> [a] Source

unionBy :: (a -> a -> Bool) -> [a] -> [a] -> [a] Source

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

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

unzip4 :: [(a, b, c, d)] -> ([a], [b], [c], [d]) Source

unzip5 :: [(a, b, c, d, e)] -> ([a], [b], [c], [d], [e]) Source

unzip6 :: [(a, b, c, d, e, f)] -> ([a], [b], [c], [d], [e], [f]) Source

unzip7 :: [(a, b, c, d, e, f, g)] -> ([a], [b], [c], [d], [e], [f], [g]) Source

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

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

zip4 :: [a] -> [b] -> [c] -> [d] -> [(a, b, c, d)] Source

zip5 :: [a] -> [b] -> [c] -> [d] -> [e] -> [(a, b, c, d, e)] Source

zip6 :: [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [(a, b, c, d, e, f)] Source

zip7 :: [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [g] -> [(a, b, c, d, e, f, g)] Source

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

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

zipWith4 :: (a -> b -> c -> d -> e) -> [a] -> [b] -> [c] -> [d] -> [e] Source

zipWith5 :: (a -> b -> c -> d -> e -> f) -> [a] -> [b] -> [c] -> [d] -> [e] -> [f] Source

zipWith6 :: (a -> b -> c -> d -> e -> f -> g) -> [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [g] Source

zipWith7 :: (a -> b -> c -> d -> e -> f -> g -> h) -> [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [g] -> [h] Source