Documentation

Count the number of elements in a foldable value that satisfy a predicate.

Count the number of elements in a foldable value that satisfy a predicate.

Return true when the whole list is comprised of equal elements.

>>> same [1,1,1]
True
>>> same []
True
>>> same [1]
True
>>> same [1,1,2]
False

Returns a list of ways to select an element from a list without replacement.

>>> pickOne []
[]
>>> pickOne [1]
[(1,[])]
>>> pickOne [1,2,3]
[(1,[2,3]),(2,[1,3]),(3,[1,2])]

Implementation of nub that uses Ord for efficiency.

Compute the minimum element of a list or return Nothing if it is empty.

>>> minimumMaybe []
Nothing
>>> minimumMaybe [2,1,3]
Just 1

Compute the maximum element of a list or return Nothing if it is empty.

>>> maximumMaybe []
Nothing
>>> maximumMaybe [2,1,3]
Just 3

Compute the number of occurrences of the elements in a given list.

>>> counts "bababc"
fromList [('a',2),('b',3),('c',1)]

Compose a list of functions together

>>> compose [ (1:), (2:), (3:) ] []
[1,2,3]

Split list into chunks. The last chunk might be incomplete.

>>> chunks 3 [1..9]
[[1,2,3],[4,5,6],[7,8,9]]

>>> chunks 3 [1..7]
[[1,2,3],[4,5,6],[7]]

>>> chunks 3 []
[]

Löb's theorem

https://github.com/quchen/articles/blob/master/loeb-moeb.md https://en.wikipedia.org/wiki/L%C3%B6b%27s_theorem

löb generalized over fmap

Index an array returning Nothing if the index is out of bounds.

Apply a function n times strictly.

Apply a function n times strictly.

Given a list of constraints such that each constraint identifies a unique variable and the set of assignments it can have, this computes assignments of those variables such that no two input variables are assigned the same value.

>>> uniqueAssignment [Set.fromList "ab", Set.fromList "bc"]
["ab","ac","bc"]

Convert a big-endian list of digits to a single number.

>>> fromDigits 10 [1,2,3,4]
1234

>>> fromDigits 2 [12]
12

>>> fromDigits 10 []
0

Convert a number to a list of digits in a given radix.

>>> toDigits 2 12
[1,1,0,0]

>>> toDigits 10 1234
[1,2,3,4]

>>> toDigits 10 0
[]

Efficient exponentiation using an associative operator

>>> power (+) 1 10
10

>>> power (*) 2 10
1024 

Helper for putting declarations into scope for future Template Haskell expressions. In particular this gets used so that the format quasiquoter can see data types that it might want to parse.

Partial sums of a list.

partialSums = map sum . inits

>>> partialSums [1..3]
[0,1,3,6]

Binary search for the largest value satisfying a predicate. Finds the largest value when the predicate switches from True to False. There should only be one such point in the range.