utility-ht-0.0.5.1: Various small helper functions for Lists, Maybes, Tuples, FunctionsSource codeContentsIndex
Data.List.Match
Synopsis
take :: [b] -> [a] -> [a]
drop :: [b] -> [a] -> [a]
splitAt :: [b] -> [a] -> ([a], [a])
replicate :: [a] -> b -> [b]
compareLength :: [a] -> [b] -> Ordering
lessOrEqualLength :: [a] -> [b] -> Bool
shorterList :: [a] -> [a] -> [a]
Documentation
take :: [b] -> [a] -> [a]Source
Make a list as long as another one
drop :: [b] -> [a] -> [a]Source
Drop as many elements as the first list is long
splitAt :: [b] -> [a] -> ([a], [a])Source
replicate :: [a] -> b -> [b]Source
compareLength :: [a] -> [b] -> OrderingSource
Compare the length of two lists over different types. It is equivalent to (compare (length xs) (length ys)) but more efficient.
lessOrEqualLength :: [a] -> [b] -> BoolSource
lessOrEqualLength x y is almost the same as compareLength x y <= EQ, but lessOrEqualLength [] undefined = True, whereas compareLength [] undefined <= EQ = undefined.
shorterList :: [a] -> [a] -> [a]Source
Returns the shorter one of two lists. It works also for infinite lists as much as possible. E.g. shortList (shorterList (repeat 1) (repeat 2)) [1,2,3] can be computed. The trick is, that the skeleton of the resulting list is constructed using zipWith without touching the elements. The contents is then computed (only) if requested.
Produced by Haddock version 2.4.2