Schedule

abstract val initial: IO[Nothing, State]

The initial state of the schedule.

abstract val update: (A, State) ⇒ IO[Nothing, Decision[State, B]]

Updates the schedule based on a new input and the current state.

final def !=(arg0: Any): Boolean

final def ##(): Int

final def &&[A1 <: A, C](that: Schedule[A1, C]): Schedule[A1, (B, C)]

Returns a new schedule that continues only as long as both schedules continue, using the maximum of the delays of the two schedules.

final def *>[A1 <: A, C](that: Schedule[A1, C]): Schedule[A1, C]

The same as &&, but ignores the left output.

final def <*[A1 <: A, C](that: Schedule[A1, C]): Schedule[A1, B]

The same as &&, but ignores the right output.

final def <<<[C](that: Schedule[C, A]): Schedule[C, B]

A backwards version of >>>.

final def <>[A1 <: A, B1 >: B](that: Schedule[A1, B1]): Schedule[A1, B1]

The same as <||>, but merges the output.

final def <||>[A1 <: A, C](that: Schedule[A1, C]): Schedule[A1, Either[B, C]]

Returns a new schedule that first executes this schedule to completion, and then executes the specified schedule to completion.

final def ==(arg0: Any): Boolean

final def >>>[C](that: Schedule[B, C]): Schedule[A, C]

Returns the composition of this schedule and the specified schedule, by piping the output of this one into the input of the other, and summing delays produced by both.

final def andThen[A1 <: A, C](that: Schedule[A1, C]): Schedule[A1, Either[B, C]]

An alias for <||>

final def asInstanceOf[T0]: T0

final def both[A1 <: A, C](that: Schedule[A1, C]): Schedule[A1, (B, C)]

A named alias for &&.

final def bothWith[A1 <: A, C, D](that: Schedule[A1, C])(f: (B, C) ⇒ D): Schedule[A1, D]

The same as both followed by map.

final def check[A1 <: A, C](test: (A1, B) ⇒ IO[Nothing, Boolean]): Schedule[A1, B]

Peeks at the state produced by this schedule, executes some action, and then continues the schedule or not based on the specified state predicate.

def clone(): AnyRef

final def collect: Schedule[A, List[B]]

Returns a new schedule that collects the outputs of this one into a list.

final def combineWith[A1 <: A, C](that: Schedule[A1, C])(g: (Boolean, Boolean) ⇒ Boolean, f: (Duration, Duration) ⇒ Duration): Schedule[A1, (B, C)]

final def compose[C](that: Schedule[C, A]): Schedule[C, B]

An alias for <<<

final def const[C](c: ⇒ C): Schedule[A, C]

Returns a new schedule that maps this schedule to a constant output.

final def contramap[A1](f: (A1) ⇒ A): Schedule[A1, B]

Returns a new schedule that deals with a narrower class of inputs than this schedule.

final def delayed(f: (Duration) ⇒ Duration): Schedule[A, B]

Returns a new schedule with the specified pure modification applied to each delay produced by this schedule.

final def dimap[A1, C](f: (A1) ⇒ A, g: (B) ⇒ C): Schedule[A1, C]

Returns a new schedule that contramaps the input and maps the output.

final def either[A1 <: A, C](that: Schedule[A1, C]): Schedule[A1, (B, C)]

A named alias for ||.

final def eitherWith[A1 <: A, C, D](that: Schedule[A1, C])(f: (B, C) ⇒ D): Schedule[A1, D]

The same as either followed by map.

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def fold[Z](z: Z)(f: (Z, B) ⇒ Z): Schedule[A, Z]

Returns a new schedule that folds over the outputs of this one.

final def foldM[Z](z: IO[Nothing, Z])(f: (Z, B) ⇒ IO[Nothing, Z]): Schedule[A, Z]

Returns a new schedule that effectfully folds over the outputs of this one.

final def getClass(): Class[_]

def hashCode(): Int

final def initialized[A1 <: A](f: (IO[Nothing, State]) ⇒ IO[Nothing, State]): Schedule[A1, B]

Returns a new schedule with the specified initial state transformed by the specified initial transformer.

final def isInstanceOf[T0]: Boolean

final def jittered(min: Double, max: Double): Schedule[A, B]

Applies random jitter to the schedule bounded by the specified factors.

final def jittered: Schedule[A, B]

Applies random jitter to the schedule bounded by the factors 0.0 and 1.0.

final def logInput[A1 <: A](f: (A1) ⇒ IO[Nothing, Unit]): Schedule[A1, B]

Sends every input value to the specified sink.

final def logOutput(f: (B) ⇒ IO[Nothing, Unit]): Schedule[A, B]

Sends every output value to the specified sink.

final def loop: Schedule[A, B]

Returns a new schedule that loops this one forever, resetting the state when this schedule is done.

final def map[A1 <: A, C](f: (B) ⇒ C): Schedule[A1, C]

Returns a new schedule that maps over the output of this one.

final def modifyDelay(f: (B, Duration) ⇒ IO[Nothing, Duration]): Schedule[A, B]

Returns a new schedule with the specified effectful modification applied to each delay produced by this schedule.

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def onDecision[A1 <: A](f: (A1, Decision[State, B]) ⇒ IO[Nothing, Unit]): Schedule[A1, B]

A new schedule that applies the current one but runs the specified effect for every decision of this schedule.

final def reconsider[A1 <: A, B1 >: B](f: (A1, Decision[State, B]) ⇒ Decision[State, B1]): Schedule[A1, B1]

Returns a new schedule that reconsiders the decision made by this schedule.

final def reconsiderM[A1 <: A, B1 >: B](f: (A1, Decision[State, B]) ⇒ IO[Nothing, Decision[State, B1]]): Schedule[A1, B1]

Returns a new schedule that effectfully reconsiders the decision made by this schedule.

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def unary_!: Schedule[A, B]

Returns a new schedule that inverts the decision to continue.

final def untilInput[A1 <: A](f: (A1) ⇒ Boolean): Schedule[A1, B]

Returns a new schedule that continues the schedule only until the predicate is satisfied on the input of the schedule.

final def untilValue(f: (B) ⇒ Boolean): Schedule[A, B]

Returns a new schedule that continues the schedule only until the predicate is satisfied on the output value of the schedule.

final def updated[A1 <: A, B1 >: B](f: ((A, State) ⇒ IO[Nothing, Decision[State, B]]) ⇒ (A1, State) ⇒ IO[Nothing, Decision[State, B1]]): Schedule[A1, B1]

Returns a new schedule with the update function transformed by the specified update transformer.

final def void: Schedule[A, Unit]

Returns a new schedule that maps this schedule to a Unit output.

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

final def whileInput[A1 <: A](f: (A1) ⇒ Boolean): Schedule[A1, B]

Returns a new schedule that continues this schedule so long as the predicate is satisfied on the input of the schedule.

final def whileValue(f: (B) ⇒ Boolean): Schedule[A, B]

Returns a new schedule that continues this schedule so long as the predicate is satisfied on the output value of the schedule.

final def ||[A1 <: A, C](that: Schedule[A1, C]): Schedule[A1, (B, C)]

Returns a new schedule that continues as long as either schedule continues, using the minimum of the delays of the two schedules.