Data.List.HT

This function is lazier than the one suggested in the Haskell 98 report. It is inits undefined = [] : undefined, in contrast to Data.List.inits undefined = undefined.

This function is lazier than the one suggested in the Haskell 98 report. It is tails undefined = ([] : undefined) : undefined, in contrast to Data.List.tails undefined = undefined.

This function compares adjacent elements of a list. If two adjacent elements satisfy a relation then they are put into the same sublist. Example:

>>> groupBy (<) "abcdebcdef"["abcde","bcdef"]

In contrast to that Data.List.groupBy compares the head of each sublist with each candidate for this sublist. This yields

>>> List.groupBy (<) "abcdebcdef"["abcdebcdef"]

The second b is compared with the leading a. Thus it is put into the same sublist as a.

The sublists are never empty. Thus the more precise result type would be [(a,[a])].

Like standard unzip but more lazy. It is Data.List.unzip undefined == undefined, but unzip undefined == (undefined, undefined).

Data.List.partition of GHC 6.2.1 fails on infinite lists. But this one does not.

It is Data.List.span f undefined = undefined, whereas span f undefined = (undefined, undefined).

It is Data.List.span f undefined = undefined, whereas span f undefined = (undefined, undefined).

Split the list at the occurrences of a separator into sub-lists. Remove the separators. This is somehow a generalization of lines and words. But note the differences:

>>> words "a  a"["a","a"]>>> chop (' '==) "a  a"["a","","a"]

>>> lines "a\n\na"["a","","a"]>>> chop ('\n'==) "a\n\na"["a","","a"]

>>> lines "a\n"["a"]>>> chop ('\n'==) "a\n"["a",""]

Like break, but splits after the matching element.

prop> forAllPredicates $ \p xs -> uncurry (++) (breakAfter p xs) == xs

Take all elements until one matches. The matching element is returned, too. This is the key difference to takeWhile (not . p). It holds:

prop> forAllPredicates $ \p xs -> takeUntil p xs == fst (breakAfter p xs)

Split the list after each occurence of a terminator. Keep the terminator. There is always a list for the part after the last terminator. It may be empty. See package non-empty for more precise result type.

prop> forAllPredicates $ \p xs -> concat (segmentAfter p xs) == xs

prop> forAllPredicates $ \p xs -> length (filter p xs) == length (tail (segmentAfter p xs))

prop> forAllPredicates $ \p -> all (p . last) . init . segmentAfter p

prop> forAllPredicates $ \p -> all (all (not . p) . init) . init . segmentAfter p

This test captures both infinitely many groups and infinitely big groups:

prop> forAllPredicates $ \p x -> flip seq True . (!!100) . concat . segmentAfter p . cycle . (x:)

Split the list before each occurence of a leading character. Keep these characters. There is always a list for the part before the first leading character. It may be empty. See package non-empty for more precise result type.

>>> segmentBefore isUpper "AbcdXyz"["","Abcd","Xyz"]>>> segmentBefore isUpper "kAbcdXYZ"["k","Abcd","X","Y","Z"]

prop> forAllPredicates $ \p xs -> concat (segmentBefore p xs) == xs

prop> forAllPredicates $ \p xs -> length (filter p xs) == length (tail (segmentBefore p xs))

prop> forAllPredicates $ \p -> all (p . head) . tail . segmentBefore p

prop> forAllPredicates $ \p -> all (all (not . p) . tail) . tail . segmentBefore p

prop> forAllPredicates $ \p x -> flip seq True . (!!100) . concat . segmentBefore p . cycle . (x:)

removeEach xs represents a list of sublists of xs, where each element of xs is removed and the removed element is separated. It seems to be much simpler to achieve with zip xs (map (flip List.delete xs) xs), but the implementation of removeEach does not need the Eq instance and thus can also be used for lists of functions.

See also the proposal http://www.haskell.org/pipermail/libraries/2008-February/009270.html

>>> removeEach "abc"[('a',"bc"),('b',"ac"),('c',"ab")]>>> removeEach "a"[('a',"")]>>> removeEach ""[]

It holds splitLast xs == (init xs, last xs), but splitLast is more efficient if the last element is accessed after the initial ones, because it avoids memoizing list.

prop> \(NonEmpty xs) -> splitLast (xs::String)  ==  (init xs, last xs)

Should be prefered to head and tail.

Should be prefered to init and last.

prop> \xs -> maybe True ((init xs, last xs) == ) (viewR (xs::String))

Should be prefered to head and tail.

Should be prefered to init and last.

prop> \xs -> switchR True (\ixs lxs -> ixs == init xs && lxs == last xs) (xs::String)

dropRev n is like reverse . drop n . reverse but it is lazy enough to work for infinite lists, too.

prop> \n xs -> dropRev n (xs::String) == reverse (drop n (reverse xs))

takeRev n is like reverse . take n . reverse but it is lazy enough to work for infinite lists, too.

prop> \n xs -> takeRev n (xs::String) == reverse (take n (reverse xs))

splitAtRev n xs == (dropRev n xs, takeRev n xs).

prop> \n xs -> splitAtRev n (xs::String) == (dropRev n xs, takeRev n xs)

prop> \n xs -> (xs::String) == uncurry (++) (splitAtRev n xs)

maybePrefixOf xs ys is Just zs if xs is a prefix of ys, where zs is ys without the prefix xs. Otherwise it is Nothing. It is the same as Data.List.stripPrefix.

>>> maybePrefixOf "abc" "abcdef"Just "def">>> maybePrefixOf "def" "abcdef"Nothing

Partition a list into elements which evaluate to Just or Nothing by f.

prop> forAllMaybeFn $ \f xs -> partitionMaybe f xs == (mapMaybe f xs, filter (isNothing . f) xs)

prop> forAllPredicates $ \p xs -> partition p xs == partitionMaybe (\x -> toMaybe (p x) x) xs

This is the cousin of takeWhile analogously to catMaybes being the cousin of filter.

>>> takeWhileJust [Just 'a', Just 'b', Nothing, Just 'c']"ab"

Example: Keep the heads of sublists until an empty list occurs.

>>> takeWhileJust $ map (fmap fst . viewL) ["abc","def","","xyz"]"ad"

For consistency with takeWhile, partitionMaybe and dropWhileNothing it should have been:

takeWhileJust_ :: (a -> Maybe b) -> a -> [b]

However, both variants are interchangeable:

takeWhileJust_ f == takeWhileJust . map f
takeWhileJust == takeWhileJust_ id

keep every k-th value from the list

>>> sieve 6 ['a'..'z']"agmsy"

>>> sliceHorizontal 6 ['a'..'z']["agmsy","bhntz","ciou","djpv","ekqw","flrx"]

prop> \(NonEmpty xs) -> QC.forAll (QC.choose (1, length xs)) $ \n -> sliceHorizontal n xs == transpose (sliceVertical n (xs::String))

prop> \(NonEmpty xs) -> QC.forAll (QC.choose (1, length xs)) $ \n -> sliceVertical  n xs == transpose (sliceHorizontal n (xs::String))

The properties do not hold for empty lists because of:

>>> sliceHorizontal 4 ([]::[Int])[[],[],[],[]]

prop src dst xs -> replace src dst xs == multiReplace (src,dst)

Transform

[[00,01,02,...],          [[00],
 [10,11,12,...],   -->     [10,01],
 [20,21,22,...],           [20,11,02],
 ...]                      ...]

With concat . shear you can perform a Cantor diagonalization, that is an enumeration of all elements of the sub-lists where each element is reachable within a finite number of steps. It is also useful for polynomial multiplication (convolution).

Transform

[[00,01,02,...],          [[00],
 [10,11,12,...],   -->     [01,10],
 [20,21,22,...],           [02,11,20],
 ...]                      ...]

It's like shear but the order of elements in the sub list is reversed. Its implementation seems to be more efficient than that of shear. If the order does not matter, better choose shearTranspose.

prop> \xs -> shearTranspose xs  ==  map reverse (shear (xs::[String]))

Operate on each combination of elements of the first and the second list. In contrast to the list instance of Monad.liftM2 it holds the results in a list of lists.

prop> \xs ys -> let f x y = (x::Char,y::Int) in concat (outerProduct f xs ys)  ==  liftM2 f xs ys

Take while first predicate holds, then continue taking while second predicate holds, and so on.

rotate left

Given two lists that are ordered (i.e. p x y holds for subsequent x and y) mergeBy them into a list that is ordered, again.

>>> mergeBy (<=) "agh" "begz""abegghz"

This function combines every pair of neighbour elements in a list with a certain function.

>>> mapAdjacent (<=) ""[]>>> mapAdjacent (<=) "a"[]>>> mapAdjacent (<=) "aba"[True,False]>>> mapAdjacent (,) "abc"[('a','b'),('b','c')]

prop> \x xs -> mapAdjacent subtract (scanl (+) x xs) == (xs::[Integer])

Enumerate without Enum context. For Enum equivalent to enumFrom.

>>> range 0 :: [Integer][]>>> range 1 :: [Integer][0]>>> range 8 :: [Integer][0,1,2,3,4,5,6,7]

prop> \(NonNegative n) -> length (range n :: [Integer]) == n

For an associative operation op this computes iterateAssociative op a = iterate (op a) a but it is even faster than map (powerAssociative op a a) [0..] since it shares temporary results.

The idea is: From the list map (powerAssociative op a a) [0,(2*n)..] we compute the list map (powerAssociative op a a) [0,n..], and iterate that until n==1.

prop> \x -> equating (take 1000) (List.iterate (x+) x) (iterateAssociative (+) (x::Integer))

This is equal to iterateAssociative. The idea is the following: The list we search is the fixpoint of the function: "Square all elements of the list, then spread it and fill the holes with successive numbers of their left neighbour." This also preserves log n applications per value. However it has a space leak, because for the value with index n all elements starting at div n 2 must be kept.

prop> \x -> equating (take 1000) (List.iterate (x+) x) (iterateLeaky (+) (x::Integer))