Foundation.Collection

zip takes two collections and returns a collections of corresponding pairs. If one input collection is short, excess elements of the longer collection are discarded.

Like zip, but works with 3 collections.

Like zip, but works with 4 collections.

Like zip, but works with 5 collections.

Like zip, but works with 6 collections.

Like zip, but works with 7 collections.

unzip transforms a collection of pairs into a collection of first components and a collection of second components.

Like unzip, but works on a collection of 3-element tuples.

Like unzip, but works on a collection of 4-element tuples.

Like unzip, but works on a collection of 5-element tuples.

Like unzip, but works on a collection of 6-element tuples.

Like unzip, but works on a collection of 7-element tuples.

Left-associative fold of a structure.

In the case of lists, foldl, when applied to a binary operator, a starting value (typically the left-identity of the operator), and a list, reduces the list using the binary operator, from left to right:

foldl f z [x1, x2, ..., xn] == (...((z `f` x1) `f` x2) `f`...) `f` xn

Note that to produce the outermost application of the operator the entire input list must be traversed. This means that foldl' will diverge if given an infinite list.

Note that Foundation only provides foldl', a strict version of foldl because the lazy version is seldom useful.

Left-associative fold of a structure with strict application of the operator.

Right-associative fold of a structure.

foldr f z [x1, x2, ..., xn] == x1 `f` (x2 `f` ... (xn `f` z)...)

Right-associative fold of a structure, but with strict application of the operator.

Left associative strict fold.

Right associative lazy fold.

Map each element of a structure to an action, evaluate these actions from left to right, and collect the results. For a version that ignores the results see traverse_.

Evaluate each actions of the given collections, from left to right, and collect the results. For a version that ignores the results, see Foundation.Collection.sequenceA_

Map each element of the collection to an action, evaluate these actions from left to right, and collect the results. For a version that ignores the results see mapM_.

Evaluate each actions of the given collections, from left to right, and collect the results. For a version that ignores the results, see Foundation.Collection.sequence_

Check if a collection is empty

Length of a collection (number of Element c)

Check if a collection contains a specific element

This is the inverse of notElem.

Check if a collection does *not* contain a specific element

This is the inverse of elem.

Get the maximum element of a collection

Get the minimum element of a collection

Determine is any elements of the collection satisfy the predicate

Determine is all elements of the collection satisfy the predicate

Take the first @n elements of a collection

Take the last @n elements of a collection

Drop the first @n elements of a collection

Drop the last @n elements of a collection

Split the collection at the @n'th elements

Split the collection at the @n'th elements from the end

Split on a specific elements returning a list of colletion

Split a collection when the predicate return true

Split a collection when the predicate return true starting from the end of the collection

Split a collection at the given element

Return the longest prefix in the collection that satisfy the predicate

Return the longest prefix in the collection that satisfy the predicate

The intersperse function takes an element and a list and `intersperses' that element between the elements of the list. For example,

intersperse ',' "abcde" == "a,b,c,d,e"

intercalate xs xss is equivalent to (mconcat (intersperse xs xss)). It inserts the list xs in between the lists in xss and concatenates the result.

Split a collection while the predicate return true

Split a collection while the predicate return true starting from the end of the collection

Filter all the elements that satisfy the predicate

Partition the elements that satisfy the predicate and those that don't

Reverse a collection

Decompose a collection into its first element and the remaining collection. If the collection is empty, returns Nothing.

Decompose a collection into a collection without its last element, and the last element If the collection is empty, returns Nothing.

Prepend an element to an ordered collection

Append an element to an ordered collection

Find an element in an ordered collection

Sort an ordered collection using the specified order function

Create a collection with a single element

get the first element of a non-empty collection

get the last element of a non-empty collection

Extract the elements after the first element of a non-empty collection.

Extract the elements before the last element of a non-empty collection.

Create a collection where the element in parameter is repeated N time

Takes two collections and returns True iff the first collection is a prefix of the second.

Takes two collections and returns True iff the first collection is a suffix of the second.

Takes two collections and returns True iff the first collection is an infix of the second.

Try to strip a prefix from a collection

Try to strip a suffix from a collection

zipWith generalises zip by zipping with the function given as the first argument, instead of a tupling function. For example, zipWith (+) is applied to two collections to produce the collection of corresponding sums.

Like zipWith, but works with 3 collections.

Like zipWith, but works with 4 collections.

Like zipWith, but works with 5 collections.

Like zipWith, but works with 6 collections.

Like zipWith, but works with 7 collections.