Iterate until a Nothing is produced

Apply function until Nothing is produced, and return last produced value.

Apply monadic function until Nothing is produced, and return last produced value.

Apply function until a Left.

Like find, but instead of taking an a -> Bool, takes an a -> Maybe b and returns the first success.

Strict (!!)

Strict drop

A tuple of the same item twice

scanl generalized to all Traversable.

scanr generalized to all Traversable.

Lazily find the first repeated item.

Repeat a function until you get the same result twice.

Flood fill from a starting set

Flood fill from a starting set, counting the number of steps

Count the number of items in a container where the predicate is true.

Build a frequency map

Look up a count from a frequency map, defaulting to zero if item is not foudn

Build a list of descending frequencies. Ties are sorted.

Build a reverse frequency map

Collect all possible single-item perturbations from a given perturbing function.

perturbations (\i -> [i - 1, i + 1]) [0,10,100]

[ [-1,10,100]

, [ 1,10,100] , [ 0, 9,100] , [ 0,11,100] , [ 0,10, 99] , [ 0,10,101] ]

Clear out characters not matching a predicate

foldMap, but in parallel.

foldMap1, but in parallel.

Fold for computing mean and variance

Get the key-value pair corresponding to the maximum value in the map

Get the key-value pair corresponding to the maximum value in the map, with a custom comparing function.

'maximumVal' == 'maximumValBy' 'compare'

Get the key-value pair corresponding to the minimum value in the map

Get the key-value pair corresponding to the minimum value in the map, with a custom comparing function.

'minimumVal' == 'minimumValBy' 'compare'

Version of maximumVal for nonempty maps.

Version of maximumValBy for nonempty maps.

Version of minimumVal for nonempty maps.

Version of minimumValBy for nonempty maps.

Delete a potential value from a Finite.

Parse a letter into a number 0 to 25. Returns False if lowercase and True if uppercase.

Prism for a Char as (Bool, Finite 26), where the Finite is the letter parsed as a number from 0 to 25, and the Bool is lowercase (False) or uppercase (True).

Caeser shift, preserving case. If you have an Int or Integer, convert into Finite using modulo.

Use a stream of tokens a as the underlying parser stream. Note that error messages for parser errors are going necessarily to be wonky.

Parse a stream of tokens s purely, returning Either

Parse a stream of tokens s purely

Parse a stream of tokens s over an underlying monad, returning Either

Parse a stream of tokens s over an underlying monad

Skip every result until this token matches

2D Coordinate

Treat as complex number multiplication. useful for rotations

Lattice points for line between points, not including endpoints

dirPoint but with inverted y axis

Multiply headings, taking North as straight, East as clockwise turn, West as counter-clockwise turn, and South as reverse.

Should be a commutative group; it's essentially complex number multiplication like mulPoint, with North = 1, West = i. The identity is North and the inverse is the opposite direction.

Find the minimum and maximum x and y from a collection of points.

Returns V2 (V2 xMin yMin) (V2 xMax yMax).

A version of boundingBox that works for normal possibly-empty lists.

It's Point, but with a newtype wrapper so we have an Ord that sorts by y first, then x