Data.ListLike.Base

The empty list

Creates a single-element list out of an element

Like (:) for lists: adds an element to the beginning of a list

Adds an element to the *end* of a ListLike.

Combines two lists. Like (++).

Extracts the first element of a ListLike.

Extract head and tail, return Nothing if empty

Extracts the last element of a ListLike.

Gives all elements after the head.

All elements of the list except the last one. See also inits.

Tests whether the list is empty.

Length of the list. See also genericLength.

Apply a function to each element, returning any other valid ListLike. rigidMap will always be at least as fast, if not faster, than this function and is recommended if it will work for your purposes. See also mapM.

Like map, but without the possibility of changing the type of the item. This can have performance benefits for things such as ByteStrings, since it will let the ByteString use its native low-level map implementation.

Reverse the elements in a list.

Add an item between each element in the structure

Flatten the structure.

Map a function over the items and concatenate the results. See also rigidConcatMap.

Like concatMap, but without the possibility of changing the type of the item. This can have performance benefits for some things such as ByteString.

True if any items satisfy the function

True if all items satisfy the function

The maximum value of the list

The minimum value of the list

Generate a structure with the specified length with every element set to the item passed in. See also genericReplicate

Takes the first n elements of the list. See also genericTake.

Drops the first n elements of the list. See also genericDrop

Equivalent to (take n xs, drop n xs). See also genericSplitAt.

Returns all elements at start of list that satisfy the function.

Drops all elements from the start of the list that satisfy the function.

Drops all elements from the end of the list that satisfy the function.

The equivalent of (takeWhile f xs, dropWhile f xs)

The equivalent of span (not . f)

Split a list into sublists, each which contains equal arguments. For order-preserving types, concatenating these sublists will produce the original list. See also groupBy.

All initial segments of the list, shortest first

All final segnemts, longest first

True when the first list is at the beginning of the second.

True when the first list is at the beginning of the second.

True when the first list is wholly containted within the second

Remove a prefix from a listlike if possible

Remove a suffix from a listlike if possible

True if the item occurs in the list

True if the item does not occur in the list

Take a function and return the first matching element, or Nothing if there is no such element.

Returns only the elements that satisfy the function.

Returns the lists that do and do not satisfy the function. Same as (filter p xs, filter (not . p) xs)

The element at 0-based index i. Raises an exception if i is out of bounds. Like (!!) for lists.

Returns the index of the element, if it exists.

Returns the indices of the matching elements. See also findIndices

Take a function and return the index of the first matching element, or Nothing if no element matches

Returns the indices of all elements satisfying the function

Evaluate each action in the sequence and collect the results

A map in monad space. Same as sequence . map

See also rigidMapM

Like mapM, but without the possibility of changing the type of the item. This can have performance benefits with some types.

Removes duplicate elements from the list. See also nubBy

Removes the first instance of the element from the list. See also deleteBy

List difference. Removes from the first list the first instance of each element of the second list. See (\\) and deleteFirstsBy

List union: the set of elements that occur in either list. Duplicate elements in the first list will remain duplicate. See also unionBy.

List intersection: the set of elements that occur in both lists. See also intersectBy

Sorts the list. On data types that do not preserve ordering, or enforce their own ordering, the result may not be what you expect. See also sortBy.

Inserts the element at the last place where it is still less than or equal to the next element. On data types that do not preserve ordering, or enforce their own ordering, the result may not be what you expect. On types such as maps, this may result in changing an existing item. See also insertBy.

Converts the structure to a list. This is logically equivolent to fromListLike, but may have a more optimized implementation. These two functions are now retired in favor of the methods of IsList, but they are retained here because some instances still use this implementation.

Generates the structure from a list.

Converts one ListLike to another. See also toList'. Default implementation is fromListLike = map id

Generic version of nub

Generic version of deleteBy

Generic version of deleteFirsts

Generic version of union

Generic version of intersect

Generic version of group.

Sort function taking a custom comparison function

Like insert, but with a custom comparison function

Length of the list

Generic version of take

Generic version of drop

Generic version of splitAt

Generic version of replicate

An infinite list of repeated calls of the function to args

An infinite list where each element is the same

Converts a finite list into a circular one