Schedule
Related Doc:
package zio
A schedule that recurs forever, collecting all inputs into a list.
A schedule that recurs forever, collecting all inputs into a list.
A schedule that will recur forever with no delay, returning the decision from the steps.
A schedule that will recur forever with no delay, returning the decision
from the steps. You can chain this onto the end of schedules to find out
what their decision is, e.g. Schedule.recurs(5) >>> Schedule.decision.
A schedule that will recur forever with no delay, returning the duration between steps.
A schedule that will recur forever with no delay, returning the duration
between steps. You can chain this onto the end of schedules to find out
what their delay is, e.g. Schedule.spaced(1.second) >>> Schedule.delay.
A new schedule derived from the specified schedule which adds the delay specified as output to the existing duration.
A new schedule derived from the specified schedule which adds the delay specified as output to the existing duration.
A schedule that recurs for until the input value becomes applicable to partial function and then map that value with given function.
A schedule that recurs for until the input value becomes applicable to partial function and then map that value with given function.
A schedule that recurs for until the predicate evaluates to true.
A schedule that recurs for until the predicate evaluates to true.
A schedule that recurs for as long as the predicate evaluates to true.
A schedule that recurs for as long as the predicate evaluates to true.
A schedule that always recurs, but will wait a certain amount between
repetitions, given by base * factor.pow(n), where n is the number of
repetitions so far.
A schedule that always recurs, but will wait a certain amount between
repetitions, given by base * factor.pow(n), where n is the number of
repetitions so far. Returns the current duration between recurrences.
A schedule that always recurs, increasing delays by summing the preceding two delays (similar to the fibonacci sequence).
A schedule that always recurs, increasing delays by summing the preceding two delays (similar to the fibonacci sequence). Returns the current duration between recurrences.
A schedule that recurs forever, producing a count of inputs.
A schedule that recurs forever, producing a count of inputs. Not in alphabetic order because other vals below depend on it.
A schedule that recurs forever, mapping input values through the specified function.
A schedule that recurs forever, mapping input values through the specified function.
A schedule that recurs forever, returning each input as the output.
A schedule that recurs forever, returning each input as the output.
A schedule that always recurs, but will repeat on a linear time
interval, given by base * n where n is the number of
repetitions so far.
A schedule that always recurs, but will repeat on a linear time
interval, given by base * n where n is the number of
repetitions so far. Returns the current duration between recurrences.
A schedule that recurs forever, dumping input values to the specified sink, and returning those same values unmodified.
A schedule that recurs forever, dumping input values to the specified sink, and returning those same values unmodified.
A schedule that never executes.
A schedule that never executes. Note that negating this schedule does not produce a schedule that executes.
A schedule that executes once.
A schedule that executes once.
A schedule that recurs the specified number of times.
A schedule that recurs the specified number of times. Returns the number of repetitions so far.
If 0 or negative numbers are given, the operation is not done at all so
that in (op: IO[E, A]).repeat(Schedule.recurs(0)) , op is not done at all.
A schedule that waits for the specified amount of time between each input.
A schedule that waits for the specified amount of time between each input. Returns the number of inputs so far.
|action|-----interval-----|action|-----interval-----|action|
A schedule that recurs forever, returning the constant for every output.
A schedule that recurs forever, returning the constant for every output.
A schedule that recurs forever, returning the constant for every output (by-name version).
A schedule that recurs forever, returning the constant for every output (by-name version).
A schedule that always recurs without delay, and computes the output through recured application of a function to a base value.
A schedule that always recurs without delay, and computes the output through recured application of a function to a base value.
A schedule that always recurs without delay, and computes the output through recured application of a function to a base value.
A schedule that always recurs without delay, and computes the output through recured application of a function to a base value.