Data.List.CyclingSublists

Allows to split lists into sublists with some patterns by quantity.

Documentation

intoRegularSublists :: [Int] -> [a] -> [[a]]

Splits the input second argument into sublists each one containing the n elements where the number is taken as the sequential element in the first argument starting from the left to the right. If the number is less than 1 then the corresponding sublist is empty. If all the elements in the first argument are less than 1 then returns an infinite lazy list of [] as its elements (probably not the needed case). When all the elements of the first argument ends and there are elements in the second argument being not already processed then the function reinitializes itself with the prior first argument and the rest of the unprocessed elements in the second argument. This leads to the *cycling behaviour*.

Similar functions are in the list-grouping and split packages, but they do not have cycling behaviour and have another realization.

intoRegularSublistsM

Arguments

:: Monad m

=> (a -> m [Int])

A monadic function to obtain the argument for the regularization.

-> a

An initial element (seed) for the monadic function.

-> [b]

A list to be splitted into the sublists.

-> m [[b]]

A monadic variant of the intoRegularSublists where the first argument is taken from the monadic function.

intoRegularSublistsA

Arguments

:: Applicative f

=> (a -> f [Int])

An Applicative function to obtain the argument for the regularization.

-> a

An initial element (seed) for the applicative function.

-> [b]

A list to be splitted into the sublists.

-> f [[b]]

An Applicative variant of the intoRegularSublists where the first argument is taken from the applicative function.