LightArrayRevolverScheduler
Related Docs:
object LightArrayRevolverScheduler
| package actor
Clock implementation is replaceable (for testing); the implementation must return a monotonically increasing series of Long nanoseconds.
Clock implementation is replaceable (for testing); the implementation must return a monotonically increasing series of Long nanoseconds.
Overridable for tests
Overridable for tests
The maximum supported task frequency of this scheduler, i.e.
The maximum supported task frequency of this scheduler, i.e. the inverse of the minimum time interval between executions of a recurring task, in Hz.
Schedules a Runnable to be run repeatedly with an initial delay and
a frequency.
Schedules a Runnable to be run repeatedly with an initial delay and
a frequency. E.g. if you would like the function to be run after 2
seconds and thereafter every 100ms you would set delay = Duration(2,
TimeUnit.SECONDS) and interval = Duration(100, TimeUnit.MILLISECONDS). If
the execution of the runnable takes longer than the interval, the
subsequent execution will start immediately after the prior one completes
(there will be no overlap of executions of the runnable). In such cases,
the actual execution interval will differ from the interval passed to this
method.
If the Runnable throws an exception the repeated scheduling is aborted,
i.e. the function will not be invoked any more.
IllegalArgumentException if the given delays exceed the maximum
reach (calculated as: delay / tickNanos > Int.MaxValue).
Java API
Schedules a Runnable to be run repeatedly with an initial delay and
a frequency.
Schedules a Runnable to be run repeatedly with an initial delay and
a frequency. E.g. if you would like the function to be run after 2
seconds and thereafter every 100ms you would set delay = Duration(2,
TimeUnit.SECONDS) and interval = Duration(100, TimeUnit.MILLISECONDS). If
the execution of the runnable takes longer than the interval, the
subsequent execution will start immediately after the prior one completes
(there will be no overlap of executions of the runnable). In such cases,
the actual execution interval will differ from the interval passed to this
method.
If the Runnable throws an exception the repeated scheduling is aborted,
i.e. the function will not be invoked any more.
IllegalArgumentException if the given delays exceed the maximum
reach (calculated as: delay / tickNanos > Int.MaxValue).
Java API
Schedules a function to be run repeatedly with an initial delay and a frequency.
Schedules a function to be run repeatedly with an initial delay and a frequency. E.g. if you would like the function to be run after 2 seconds and thereafter every 100ms you would set delay = Duration(2, TimeUnit.SECONDS) and interval = Duration(100, TimeUnit.MILLISECONDS). If the execution of the function takes longer than the interval, the subsequent execution will start immediately after the prior one completes (there will be no overlap of the function executions). In such cases, the actual execution interval will differ from the interval passed to this method.
If the function throws an exception the repeated scheduling is aborted, i.e. the function will not be invoked any more.
Scala API
Schedules a message to be sent repeatedly with an initial delay and frequency.
Schedules a message to be sent repeatedly with an initial delay and frequency. E.g. if you would like a message to be sent immediately and thereafter every 500ms you would set delay=Duration.Zero and interval=Duration(500, TimeUnit.MILLISECONDS)
Java API
Schedules a message to be sent repeatedly with an initial delay and frequency.
Schedules a message to be sent repeatedly with an initial delay and frequency. E.g. if you would like a message to be sent immediately and thereafter every 500ms you would set delay=Duration.Zero and interval=Duration(500, TimeUnit.MILLISECONDS)
Java & Scala API
Schedules a Runnable to be run once with a delay, i.e.
Schedules a Runnable to be run once with a delay, i.e. a time period that has to pass before the runnable is executed.
IllegalArgumentException if the given delays exceed the maximum
reach (calculated as: delay / tickNanos > Int.MaxValue).
Java & Scala API
Schedules a Runnable to be run once with a delay, i.e.
Schedules a Runnable to be run once with a delay, i.e. a time period that has to pass before the runnable is executed.
IllegalArgumentException if the given delays exceed the maximum
reach (calculated as: delay / tickNanos > Int.MaxValue).
Java & Scala API
Schedules a function to be run once with a delay, i.e.
Schedules a function to be run once with a delay, i.e. a time period that has to pass before the function is run.
IllegalArgumentException if the given delays exceed the maximum
reach (calculated as: delay / tickNanos > Int.MaxValue).
Scala API
Schedules a message to be sent once with a delay, i.e.
Schedules a message to be sent once with a delay, i.e. a time period that has to pass before the message is sent.
IllegalArgumentException if the given delays exceed the maximum
reach (calculated as: delay / tickNanos > Int.MaxValue).
Java API
Schedules a message to be sent once with a delay, i.e.
Schedules a message to be sent once with a delay, i.e. a time period that has to pass before the message is sent.
IllegalArgumentException if the given delays exceed the maximum
reach (calculated as: delay / tickNanos > Int.MaxValue).
Java & Scala API
Replaceable for testing.
Replaceable for testing.
Overridable for tests
Overridable for tests
This scheduler implementation is based on a revolving wheel of buckets, like Netty’s HashedWheelTimer, which it advances at a fixed tick rate and dispatches tasks it finds in the current bucket to their respective ExecutionContexts. The tasks are held in TaskHolders, which upon cancellation null out their reference to the actual task, leaving only this shell to be cleaned up when the wheel reaches that bucket next time. This enables the use of a simple linked list to chain the TaskHolders off the wheel.
Also noteworthy is that this scheduler does not obtain a current time stamp when scheduling single-shot tasks, instead it always rounds up the task delay to a full multiple of the TickDuration. This means that tasks are scheduled possibly one tick later than they could be (if checking that “now() + delay <= nextTick” were done).