Simple, extensible reducers.
Construct a reducer from the given function, where the first and second arguments are the left and right inputs respectively.
Combine two values with a reducer.
Flip the left and right inputs to a reducer.
Reduce over a collection. The initial state is split off of the collection. The accumulator is the reducer's left input.
Apply an operation to the right input of a reducer.
Add the right float to the left float.
Divide the left float by the right float.
Multiply the right float by the left float.
Put the left float to the power of the right float.
Subtract the right float from the left float.
Add the right int to the left int.
Divide the left integer by the right integer.
Multiply the right integer by the left integer.
Put the left integer to the power of the right integer.
Subtract the right int from the left int.
Append the right array to the left array.
Append the right list to the left list.
Keep the larger input, according to the given sorter.
Keep the smaller input, according to the given sorter.
Append the right string to the left string.
Pass the filter if one filter passes.
Pass the filter if both filters pass.
Sort by both the left and right filter, deferring to the left.
Reduce an array from the left.
Reduce an array from the right.
Reduce a string from the left.
Reduce a list from the left.
Keep all Just values, reducing if both are present.
Keep all Ok values, reducing if both are present.
Keep all Err values, reducing if both are present.
Combines two of the same thing. Equivalent to a
Foldwhere the accumulator and input share the same type.