A schedule that recurs forever, collecting all inputs into a list.
A schedule that recurs until the condition f fails, collecting all inputs into a list.
A schedule that recurs until the effectful condition f fails, collecting all inputs into a list.
A schedule that recurs as long as the condition f holds, collecting all inputs into a list.
A schedule that recurs as long as the effectful condition holds, collecting all inputs into a list.
A new schedule derived from the specified schedule which transforms the delays into effectful sleeps.
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 is equal.
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 is equal.
A schedule that recurs for as long as the effectful predicate evaluates to true.
A schedule that will recur until the specified duration elapses.
A schedule that will recur until the specified duration elapses. Returns the total elapsed time.
A schedule that recurs forever without delay.
A schedule that recurs forever without delay. Returns the elapsed time since the schedule began.
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 on a fixed interval.
A schedule that recurs on a fixed interval. Returns the number of repetitions of the schedule so far.
If the action run between updates takes longer than the interval, then the action will be run immediately, but re-runs will not "pile up".
|---------interval---------|---------interval---------| |action| |action|
A schedule that recurs forever, producing a count of repeats: 0, 1, 2, ...
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 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 waits forever when updating or initializing.
A schedule that executes once.
A schedule that sleeps for random duration that is uniformly distributed in the given range.
A schedule that sleeps for random duration that is uniformly distributed in the given range. The schedules output is the duration it has slept on the last update, or 0 if it hasn't updated yet.
A schedule that sleeps for random duration that is normally distributed.
A schedule that sleeps for random duration that is normally distributed. The schedules output is the duration it has slept on the last update, or 0 if it hasn't updated yet.
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 repeated at all so
that in (op: IO[E, A]).repeat(Schedule.recurs(0))
, op is only done once and repeated 0 times.
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 always fails.
A schedule that recurs forever, returning the constant for every output.
A schedule that recurs forever, dumping input values to the specified sink, and returning those same values unmodified.
A schedule that recurs forever, dumping output values to the specified sink, and returning those same values unmodified.
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.