true, if equal(f1, f2)
is known to be equivalent to f1 == f2
Produce a state value that executes the predecessor (pred
) on each spin and executing the given function on the current value.
Produce a state value that executes the predecessor (pred
) on each spin and executing the given function on the current value. This is useful to implement decremental looping. Evaluating the state value requires a beginning to decrement from.
The function to execute on each spin of the state value.
Produce a value that starts at the maximum (if it exists) and decrements through a state value with the given mapping function.
Produce a value that starts at the maximum (if it exists) and decrements through a state value with the given mapping function. This is useful to implement decremental looping.
The function to execute on each spin of the state value.
The mapping function.
Produce a value that starts at the maximum (if it exists) and decrements through a state value with the given binding function.
Produce a value that starts at the maximum (if it exists) and decrements through a state value with the given binding function. This is useful to implement decremental looping.
The function to execute on each spin of the state value.
The binding function.
Produce a value that starts at zero (Monoid.zero
) and decrements through a state value with the given mapping function.
Produce a value that starts at zero (Monoid.zero
) and decrements through a state value with the given mapping function. This is useful to implement decremental looping.
The function to execute on each spin of the state value.
The mapping function.
The implementation of the zero function from which to start.
Produce a value that starts at zero (Monoid.zero
) and decrements through a state value with the given binding function.
Produce a value that starts at zero (Monoid.zero
) and decrements through a state value with the given binding function. This is useful to implement decremental looping.
The function to execute on each spin of the state value.
The binding function.
The implementation of the zero function from which to start.
Moves to the predecessor, unless at the minimum.
Moves to the predecessor, unless at the minimum.
Produce a state value that executes the successor (succ
) on each spin and executing the given function on the current value.
Produce a state value that executes the successor (succ
) on each spin and executing the given function on the current value. This is useful to implement incremental looping. Evaluating the state value requires a beginning to increment from.
The function to execute on each spin of the state value.
Produce a value that starts at the minimum (if it exists) and increments through a state value with the given mapping function.
Produce a value that starts at the minimum (if it exists) and increments through a state value with the given mapping function. This is useful to implement incremental looping.
The function to execute on each spin of the state value.
The mapping function.
Produce a value that starts at the minimum (if it exists) and increments through a state value with the given binding function.
Produce a value that starts at the minimum (if it exists) and increments through a state value with the given binding function. This is useful to implement incremental looping.
The function to execute on each spin of the state value.
The binding function.
Produce a value that starts at zero (Monoid.zero
) and increments through a state value with the given mapping function.
Produce a value that starts at zero (Monoid.zero
) and increments through a state value with the given mapping function. This is useful to implement incremental looping.
The function to execute on each spin of the state value.
The mapping function.
The implementation of the zero function from which to start.
Produce a value that starts at zero (Monoid.zero
) and increments through a state value with the given binding function.
Produce a value that starts at zero (Monoid.zero
) and increments through a state value with the given binding function. This is useful to implement incremental looping.
The function to execute on each spin of the state value.
The binding function.
The implementation of the zero function from which to start.
Moves to the successor, unless at the maximum.
Moves to the successor, unless at the maximum.
Order.fromScalaOrdering(toScalaOrdering).order(x, y)
this.order(x, y)