Returns all combinations of a list of list. Taken from package liquid-fixpoint and adjusted to use NonEmpty.

Satisfies: allCombinations :: xss:[[a]] -> [{v:[a]| len v == len xss}]

Interleaves two lists, taking elements alternately from each. The result ends when the first list is exhausted. If the second list runs out first, the remaining head of the first list is appended.

>>> interleave [1,2,3] [10,20,30]
[1,10,2,20,3,30]
>>> interleave [1,2,3] [10]
[1,10,2]

insertAt x n xs inserts x at index n into xs. Returns Nothing for invalid indices.

removeAt n xs removes the element at index n. Returns Nothing for invalid indices.

Update nth element of a list, if it exists. O(min index n).

Precondition: the index is >= 0. (Copied from Agda.Utils.List and adjusted for monadicity)

A variant of (%=) that only updates the field when the function returns Just. If the function returns Nothing, the field is left unchanged.

Returns whether the given integer lies inside the inclusive interval.