Control.Monad.Par.AList

List that support constant-time append (sometimes called join-lists).

O(1) an empty AList

O(1) a singleton AList

O(1) prepend an element

O(n) take the head element of an AList

NB. linear-time, because the list might look like this:

(((... `append` a) `append` b) `append` c)

O(n) take the tail element of an AList

O(n) find the length of an AList

O(n) returns True if the AList is empty

O(1) Append two ALists

O(n) converts an AList to an ordinary list

O(1) convert an ordinary list to an AList

Convert an ordinary list, but do so using Append and ASing rather than AList

The usual map operation.

A parMap over an AList can result in more balanced parallelism than the default parMap over Traversable data types. parMap :: NFData b => (a -> b) -> AList a -> Par (AList b)

Build a balanced AList in parallel, constructing each element as a function of its index. The threshold argument provides control over the degree of parallelism. It indicates under what number of elements the build process should switch from parallel to serial.

Variant of parBuildThresh in which the element-construction function is itself a Par computation.

"Auto-partitioning" version of parBuildThresh that chooses the threshold based on the size of the range and the number of processors..

like parBuild, but the construction function is monadic

Balance the tree representation of an AList.