Packages

object Schedule extends Scheduler with ScheduleInstances with PredefinedSchedules with Combinators

Linear Supertypes
Combinators, PredefinedSchedules, ScheduleInstances, Scheduler, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Schedule
  2. Combinators
  3. PredefinedSchedules
  4. ScheduleInstances
  5. Scheduler
  6. AnyRef
  7. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. type Aux[F[+_], S, A, B] = Schedule[F, A, B] { type State = S }
  2. type Combine[A] = (A, A) ⇒ A
  3. final case class Decision[S, +B](continue: Boolean, delay: FiniteDuration, state: S, result: B) extends Product with Serializable
  4. final case class Init[S](delay: FiniteDuration, state: S) extends Product with Serializable

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 after[F[+_], A, B](S: Schedule[F, A, B], delay: FiniteDuration)(implicit arg0: Functor[F]): Schedule[F, A, B]
    Definition Classes
    Combinators
  5. def after[F[+_]](delay: FiniteDuration)(implicit arg0: Monad[F]): Schedule[F, Any, Int]
    Definition Classes
    PredefinedSchedules
  6. def apply[F[+_], S, A, B](initial0: F[Init[S]], update0: (A, S) ⇒ F[Decision[S, B]]): Aux[F, S, A, B]
  7. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  8. implicit val bifunctorForDecision: Bifunctor[Decision]
    Definition Classes
    ScheduleInstances
  9. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native() @HotSpotIntrinsicCandidate()
  10. def collect[F[+_], A](implicit arg0: Monad[F]): Schedule[F, A, List[A]]
    Definition Classes
    PredefinedSchedules
  11. def combine[F[+_], A, A1 <: A, B, C](S1: Schedule[F, A, B], S2: Schedule[F, A1, C])(cont: Combine[Boolean])(delay: Combine[FiniteDuration])(implicit arg0: Apply[F]): Schedule[F, A1, (B, C)]
    Definition Classes
    Combinators
  12. def compose[F[+_], A, B, C](S1: Schedule[F, A, B], S2: Schedule[F, B, C])(implicit arg0: Monad[F]): Schedule[F, A, C]
    Definition Classes
    Combinators
  13. def continueOn[F[+_]](b: Boolean)(implicit arg0: Monad[F]): Schedule[F, Boolean, Int]
    Definition Classes
    PredefinedSchedules
  14. def delayFromOut[F[+_], A](S: Schedule[F, A, FiniteDuration])(implicit arg0: Functor[F]): Schedule[F, A, FiniteDuration]
    Definition Classes
    Combinators
  15. def elapsed[F[+_]](implicit arg0: Functor[F], arg1: Timer[F]): Aux[F, (Long, Long), Any, FiniteDuration]
    Definition Classes
    PredefinedSchedules
  16. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  17. implicit def eqForDecision[S, B](implicit arg0: Eq[S], arg1: Eq[B]): Eq[Decision[S, B]]
    Definition Classes
    ScheduleInstances
  18. implicit def eqForInit[S](implicit arg0: Eq[S]): Eq[Init[S]]
    Definition Classes
    ScheduleInstances
  19. implicit def eqForSchedule[F[+_], S, A, B](implicit eqFI: Eq[F[Init[S]]], eqASFD: Eq[(A, S) ⇒ F[Decision[S, B]]]): Eq[Aux[F, S, A, B]]
    Definition Classes
    ScheduleInstances
  20. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  21. def exponential[F[+_]](unit: FiniteDuration, base: Double = 2.0)(implicit arg0: Applicative[F]): Schedule[F, Any, FiniteDuration]
    Definition Classes
    PredefinedSchedules
  22. def fibonacci[F[+_]](one: FiniteDuration)(implicit arg0: Applicative[F]): Schedule[F, Any, FiniteDuration]
    Definition Classes
    PredefinedSchedules
  23. def fixed[F[+_]](interval: FiniteDuration)(implicit arg0: Monad[F], arg1: Timer[F]): Schedule[F, Any, FiniteDuration]
    Definition Classes
    PredefinedSchedules
  24. def fold[F[+_], A, B, Z](S: Schedule[F, A, B])(z: Z)(c: (Z, B) ⇒ Z)(implicit arg0: Functor[F]): Schedule[F, A, Z]
    Definition Classes
    Combinators
  25. def forever[F[+_]](implicit arg0: Applicative[F]): Schedule[F, Any, Int]
    Definition Classes
    PredefinedSchedules
  26. implicit val functorForInit: Functor[Init]
    Definition Classes
    ScheduleInstances
  27. implicit def functorForSchedule[F[+_], S, A](implicit arg0: Functor[F]): Functor[[δ$5$]Schedule[F, A, δ$5$] { type State = S }]
    Definition Classes
    ScheduleInstances
  28. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  29. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  30. def identity[F[+_], A](implicit arg0: Applicative[F]): Schedule[F, A, A]
    Definition Classes
    PredefinedSchedules
  31. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  32. def linear[F[+_]](unit: FiniteDuration)(implicit arg0: Applicative[F]): Schedule[F, Any, FiniteDuration]
    Definition Classes
    PredefinedSchedules
  33. def mapDecision[F[+_], A, B](S: Schedule[F, A, B])(f: (Decision[State, B]) ⇒ Decision[State, B])(implicit arg0: Functor[F]): Schedule[F, A, B]
    Definition Classes
    Combinators
  34. def mapInit[F[+_], A, B](S: Schedule[F, A, B])(f: (Init[State]) ⇒ Init[State])(implicit arg0: Functor[F]): Schedule[F, A, B]
    Definition Classes
    Combinators
  35. def maxFor[F[+_]](timeCap: FiniteDuration)(implicit arg0: Monad[F], arg1: Timer[F]): Schedule[F, Any, FiniteDuration]
    Definition Classes
    PredefinedSchedules
  36. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  37. def never[F[+_]](implicit arg0: Async[F]): Schedule[F, Any, Nothing]
    Definition Classes
    PredefinedSchedules
  38. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  39. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  40. def occurs[F[+_]](times: Int)(implicit arg0: Monad[F]): Schedule[F, Any, Int]
    Definition Classes
    PredefinedSchedules
  41. def onDecision[F[+_], A, B](S: Schedule[F, A, B])(f: (Decision[State, B]) ⇒ F[Unit])(implicit arg0: Monad[F]): Schedule[F, A, B]
    Definition Classes
    Combinators
  42. implicit def profunctorForSchedule[F[+_], S](implicit arg0: Functor[F]): Profunctor[[γ$1$, δ$2$]Schedule[F, γ$1$, δ$2$] { type State = S }]
    Definition Classes
    ScheduleInstances
  43. def reconsider[F[+_], A, B](S: Schedule[F, A, B])(f: (Decision[State, B]) ⇒ Boolean)(implicit arg0: Functor[F]): Schedule[F, A, B]
    Definition Classes
    Combinators
  44. implicit def relaxedFunctorForSchedule[F[+_], A](implicit arg0: Functor[F]): Functor[[γ$6$]Schedule[F, A, γ$6$]] { def map[B, C](fa: com.emarsys.scheduler.Schedule[F,A,B])(f: B => C): com.emarsys.scheduler.Schedule[F,A,C]{type State = fa.State} }
    Definition Classes
    ScheduleInstances
  45. implicit def relaxedProfunctorForSchedule[F[+_]](implicit arg0: Functor[F]): Profunctor[[β$3$, γ$4$]Schedule[F, β$3$, γ$4$]]
    Definition Classes
    ScheduleInstances
  46. def retry[E, F[+_], A, B](F: F[A], policy: Schedule[F, E, B])(implicit arg0: MonadError[F, E], arg1: Timer[F]): F[A]
    Definition Classes
    Scheduler
  47. def run[F[+_], A, B](F: F[A], schedule: Schedule[F, A, B])(implicit arg0: Monad[F], arg1: Timer[F]): F[B]
    Definition Classes
    Scheduler
  48. def sequence[F[+_], A, B, C](S1: Schedule[F, A, B], S2: Schedule[F, A, C])(implicit arg0: Monad[F]): Aux[F, Either[State, State], A, Either[B, C]]
    Definition Classes
    Combinators
  49. def space[F[+_], A, B](S: Schedule[F, A, B], interval: FiniteDuration)(implicit arg0: Functor[F]): Schedule[F, A, B]
    Definition Classes
    Combinators
  50. def spaced[F[+_]](interval: FiniteDuration)(implicit arg0: Monad[F]): Schedule[F, Any, Int]
    Definition Classes
    PredefinedSchedules
  51. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  52. def timing[F[+_]](implicit arg0: Functor[F], arg1: Timer[F]): Aux[F, (Long, Long), Any, (Long, Long)]
    Definition Classes
    PredefinedSchedules
  53. def toString(): String
    Definition Classes
    AnyRef → Any
  54. def unfold[F[+_], B](zero: ⇒ B)(f: (B) ⇒ B)(implicit arg0: Applicative[F]): Aux[F, B, Any, B]
    Definition Classes
    PredefinedSchedules
  55. def unfoldM[F[+_], B](zero: F[B])(f: (B) ⇒ F[B])(implicit arg0: Functor[F]): Aux[F, B, Any, B]
    Definition Classes
    PredefinedSchedules
  56. def untilInput[F[+_], A](p: (A) ⇒ Boolean)(implicit arg0: Monad[F]): Schedule[F, A, Int]
    Definition Classes
    PredefinedSchedules
  57. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  58. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  59. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  60. def whileInput[F[+_], A](p: (A) ⇒ Boolean)(implicit arg0: Monad[F]): Schedule[F, A, Int]
    Definition Classes
    PredefinedSchedules

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] ) @Deprecated @deprecated
    Deprecated

    (Since version ) see corresponding Javadoc for more information.

Inherited from Combinators

Inherited from PredefinedSchedules

Inherited from ScheduleInstances

Inherited from Scheduler

Inherited from AnyRef

Inherited from Any

Ungrouped