Packages

object Schedule extends Serializable

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

Type Members

  1. sealed trait Decision[-Env, -In, +Out] extends AnyRef
  2. final case class Driver[-Env, -In, +Out](next: (In) ⇒ ZIO[Env, None.type, Out], last: IO[NoSuchElementException, Out], reset: UIO[Unit]) extends Product with Serializable
  3. type Interval = OffsetDateTime
  4. final class ProvideSomeLayer[Env0 <: Has[_], -Env, -In, +Out] extends AnyVal
  5. type StepFunction[-Env, -In, +Out] = (OffsetDateTime, In) ⇒ ZIO[Env, Nothing, Decision[Env, In, Out]]

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. def apply[Env, In, Out](step: StepFunction[Env, In, Out]): Schedule[Env, In, Out]

    Constructs a new schedule from the specified step function.

  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  7. def collectAll[A]: Schedule[Any, A, Chunk[A]]

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

  8. def collectUntil[A](f: (A) ⇒ Boolean): Schedule[Any, A, Chunk[A]]

    A schedule that recurs until the condition f fails, collecting all inputs into a list.

  9. def collectUntilM[Env, A](f: (A) ⇒ URIO[Env, Boolean]): Schedule[Env, A, Chunk[A]]

    A schedule that recurs until the effectful condition f fails, collecting all inputs into a list.

  10. def collectWhile[A](f: (A) ⇒ Boolean): Schedule[Any, A, Chunk[A]]

    A schedule that recurs as long as the condition f holds, collecting all inputs into a list.

  11. def collectWhileM[Env, A](f: (A) ⇒ URIO[Env, Boolean]): Schedule[Env, A, Chunk[A]]

    A schedule that recurs as long as the effectful condition holds, collecting all inputs into a list.

  12. val count: Schedule[Any, Any, Long]

    A schedule that always recurs, which counts the number of recurrences.

  13. def dayOfMonth(day: Int): Schedule[Any, Any, Long]

    Cron-like schedule that recurs every specified day of month.

    Cron-like schedule that recurs every specified day of month. Won't recur on months containing less days than specified in day param.

    It triggers at zero hour of the day. Producing a count of repeats: 0, 1, 2.

    NOTE: day parameter is validated lazily. Must be in range 1...31.

  14. def dayOfWeek(day: Int): Schedule[Any, Any, Long]

    Cron-like schedule that recurs every specified day of each week.

    Cron-like schedule that recurs every specified day of each week. It triggers at zero hour of the week. Producing a count of repeats: 0, 1, 2.

    NOTE: day parameter is validated lazily. Must be in range 1 (Monday)...7 (Sunday).

  15. def delayed[Env, In, Out](schedule: Schedule[Env, In, Duration]): Schedule[Env, In, Duration]

    Takes a schedule that produces a delay, and returns a new schedule that uses this delay to further delay intervals in the resulting schedule.

  16. def duration(duration: Duration): Schedule[Any, Any, Duration]

    A schedule that can recur one time, the specified amount of time into the future.

  17. val elapsed: Schedule[Any, Any, Duration]

    A schedule that occurs everywhere, which returns the total elapsed duration since the first step.

  18. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  19. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  20. def exponential(base: Duration, factor: Double = 2.0): Schedule[Any, 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.

  21. def fibonacci(one: Duration): Schedule[Any, 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.

  22. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  23. def fixed(interval: Duration): Schedule[Any, Any, Long]

    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-----|-----interval-----|
|---------action--------||action|-----|action|-----------|

  24. val forever: Schedule[Any, Any, Long]

    A schedule that always recurs, producing a count of repeats: 0, 1, 2.

  25. def fromDuration(duration: Duration): Schedule[Any, Any, Duration]

    A schedule that recurs once with the specified delay.

  26. def fromDurations(duration: Duration, durations: Duration*): Schedule[Any, Any, Duration]

    A schedule that recurs once for each of the specified durations, delaying each time for the length of the specified duration.

    A schedule that recurs once for each of the specified durations, delaying each time for the length of the specified duration. Returns the length of the current duration between recurrences.

  27. def fromFunction[A, B](f: (A) ⇒ B): Schedule[Any, A, B]

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

  28. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  29. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  30. def hourOfDay(hour: Int): Schedule[Any, Any, Long]

    Cron-like schedule that recurs every specified hour of each day.

    Cron-like schedule that recurs every specified hour of each day. It triggers at zero minute of the hour. Producing a count of repeats: 0, 1, 2.

    NOTE: hour parameter is validated lazily. Must be in range 0...23.

  31. def identity[A]: Schedule[Any, A, A]

    A schedule that always recurs, which returns inputs as outputs.

  32. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  33. def linear(base: Duration): Schedule[Any, 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.

  34. def maxOffsetDateTime(l: OffsetDateTime, r: OffsetDateTime): OffsetDateTime
  35. def minOffsetDateTime(l: OffsetDateTime, r: OffsetDateTime): OffsetDateTime
  36. def minuteOfHour(minute: Int): Schedule[Any, Any, Long]

    Cron-like schedule that recurs every specified minute of each hour.

    Cron-like schedule that recurs every specified minute of each hour. It triggers at zero second of the minute. Producing a count of repeats: 0, 1, 2.

    NOTE: minute parameter is validated lazily. Must be in range 0...59.

  37. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  38. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  39. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  40. val once: Schedule[Any, Any, Unit]

    A schedule that recurs one time.

  41. def recurUntil[A, B](pf: PartialFunction[A, B]): Schedule[Any, A, Option[B]]

    A schedule that recurs for until the input value becomes applicable to partial function and then map that value with given function.

  42. def recurUntil[A](f: (A) ⇒ Boolean): Schedule[Any, A, A]

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

  43. def recurUntilEquals[A](a: ⇒ A): Schedule[Any, A, A]

    A schedule that recurs for until the predicate is equal.

  44. def recurUntilM[Env, A](f: (A) ⇒ URIO[Env, Boolean]): Schedule[Env, A, A]

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

  45. def recurWhile[A](f: (A) ⇒ Boolean): Schedule[Any, A, A]

    A schedule that recurs for as long as the predicate evaluates to true.

  46. def recurWhileEquals[A](a: ⇒ A): Schedule[Any, A, A]

    A schedule that recurs for as long as the predicate is equal.

  47. def recurWhileM[Env, A](f: (A) ⇒ URIO[Env, Boolean]): Schedule[Env, A, A]

    A schedule that recurs for as long as the effectful predicate evaluates to true.

  48. def recurs(n: Int): Schedule[Any, Any, Long]

    A schedule spanning all time, which can be stepped only the specified number of times before it terminates.

  49. def recurs(n: Long): Schedule[Any, Any, Long]

    A schedule spanning all time, which can be stepped only the specified number of times before it terminates.

  50. def secondOfMinute(second: Int): Schedule[Any, Any, Long]

    Cron-like schedule that recurs every specified second of each minute.

    Cron-like schedule that recurs every specified second of each minute. It triggers at zero nanosecond of the second. Producing a count of repeats: 0, 1, 2.

    NOTE: second parameter is validated lazily. Must be in range 0...59.

  51. def spaced(duration: Duration): Schedule[Any, Any, Long]

    Returns a schedule that recurs continuously, each repetition spaced the specified duration from the last run.

  52. val stop: Schedule[Any, Any, Unit]

    A schedule that does not recur, it just stops.

  53. def succeed[A](a: ⇒ A): Schedule[Any, Any, A]

    Returns a schedule that repeats one time, producing the specified constant value.

  54. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  55. def toString(): String
    Definition Classes
    AnyRef → Any
  56. def unfold[A](a: ⇒ A)(f: (A) ⇒ A): Schedule[Any, Any, A]

    Unfolds a schedule that repeats one time from the specified state and iterator.

  57. def unwrap[R, A, B](zio: ZIO[R, Nothing, Schedule[R, A, B]]): Schedule[R, A, B]

    Extracts a Schedule out of an effect.

  58. def upTo(duration: Duration): Schedule[Any, Any, Duration]

    A schedule that recurs during the given duration

  59. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  60. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  61. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  62. def windowed(interval: Duration): Schedule[Any, Any, Long]

    A schedule that divides the timeline to interval-long windows, and sleeps until the nearest window boundary every time it recurs.

    A schedule that divides the timeline to interval-long windows, and sleeps until the nearest window boundary every time it recurs.

    For example, windowed(10.seconds) would produce a schedule as follows: 

         10s        10s        10s       10s
|----------|----------|----------|----------|
|action------|sleep---|act|-sleep|action----|

  63. object Decision
  64. object StepFunction

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped