Packages

o

scalaz.zio

Schedule

object Schedule extends Schedule_Functions

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Schedule
  2. Schedule_Functions
  3. Serializable
  4. Serializable
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. type ConformsR[A] = ConformsR1[A]
    Definition Classes
    Schedule → Schedule_Functions
  2. sealed trait ConformsR1[A] extends AnyRef
    Annotations
    @implicitNotFound("The environment type of all Schedule methods must be Any. If you want to use an environment, please use ZSchedule.")

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. implicit val ConformsAnyProof: ConformsR1[Any]
    Definition Classes
    Schedule → Schedule_Functions
  5. final def apply[R, S, A, B](initial0: ZIO[R, Nothing, S], update0: (A, S) ⇒ ZIO[R, Nothing, Decision[S, B]])(implicit arg0: ConformsR[R]): ZSchedule[R, A, B]
    Definition Classes
    Schedule_Functions
  6. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  7. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws(classOf[java.lang.CloneNotSupportedException])
  8. final def collect[A]: Schedule[A, List[A]]

    A schedule that recurs forever, collecting all inputs into a list.

    A schedule that recurs forever, collecting all inputs into a list.

    Definition Classes
    Schedule_Functions
  9. final val decision: Schedule[Any, Boolean]

    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.

    Definition Classes
    Schedule_Functions
  10. final val delay: Schedule[Any, Duration]

    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.

    Definition Classes
    Schedule_Functions
  11. final def delayed[R, A](s: ZSchedule[R, A, Duration])(implicit arg0: ConformsR[R]): ZSchedule[R, A, Duration]

    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.

    Definition Classes
    Schedule_Functions
  12. final def doUntil[A](f: (A) ⇒ Boolean): Schedule[A, A]

    A schedule that recurs for until the predicate evaluates to true.

    A schedule that recurs for until the predicate evaluates to true.

    Definition Classes
    Schedule_Functions
  13. final def doWhile[A](f: (A) ⇒ Boolean): Schedule[A, A]

    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.

    Definition Classes
    Schedule_Functions
  14. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  15. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  16. final def exponential(base: Duration, factor: Double = 2.0): Schedule[Any, Duration]

    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.

    Definition Classes
    Schedule_Functions
  17. final def fibonacci(one: Duration): Schedule[Any, Duration]

    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.

    Definition Classes
    Schedule_Functions
  18. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  19. final val forever: Schedule[Any, Int]

    A schedule that recurs forever, producing a count of inputs.

    A schedule that recurs forever, producing a count of inputs.

    Definition Classes
    Schedule_Functions
  20. final def fromFunction[A, B](f: (A) ⇒ B): Schedule[A, B]

    A schedule that recurs forever, mapping input values through the specified function.

    A schedule that recurs forever, mapping input values through the specified function.

    Definition Classes
    Schedule_Functions
  21. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  22. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  23. final def identity[A]: Schedule[A, A]

    A schedule that recurs forever, returning each input as the output.

    A schedule that recurs forever, returning each input as the output.

    Definition Classes
    Schedule_Functions
  24. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  25. final def linear(base: Duration): Schedule[Any, Duration]

    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.

    Definition Classes
    Schedule_Functions
  26. final def logInput[R, A](f: (A) ⇒ ZIO[R, Nothing, Unit])(implicit arg0: ConformsR[R]): ZSchedule[R, A, A]

    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.

    Definition Classes
    Schedule_Functions
  27. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  28. final val never: Schedule[Any, Nothing]

    A schedule that never executes.

    A schedule that never executes. Note that negating this schedule does not produce a schedule that executes.

    Definition Classes
    Schedule_Functions
  29. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  30. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  31. final val once: Schedule[Any, Unit]

    A schedule that executes once.

    A schedule that executes once.

    Definition Classes
    Schedule_Functions
  32. final def recurs(n: Int): Schedule[Any, Int]

    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.

    Definition Classes
    Schedule_Functions
  33. final def spaced(interval: Duration): Schedule[Any, Int]

    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|

    Definition Classes
    Schedule_Functions
  34. final def succeed[A](a: A): Schedule[Any, A]

    A schedule that recurs forever, returning the constant for every output.

    A schedule that recurs forever, returning the constant for every output.

    Definition Classes
    Schedule_Functions
  35. final def succeedLazy[A](a: ⇒ A): Schedule[Any, A]

    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).

    Definition Classes
    Schedule_Functions
  36. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  37. def toString(): String
    Definition Classes
    AnyRef → Any
  38. final def unfold[A](a: ⇒ A)(f: (A) ⇒ A): Schedule[Any, A]

    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.

    Definition Classes
    Schedule_Functions
  39. final def unfoldM[R, A](a: ZIO[R, Nothing, A])(f: (A) ⇒ ZIO[R, Nothing, A])(implicit arg0: ConformsR[R]): ZSchedule[R, Any, A]

    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.

    Definition Classes
    Schedule_Functions
  40. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  41. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  42. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws(classOf[java.lang.InterruptedException])

Inherited from Schedule_Functions

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped