include module type of sig ... end
type ('a, 'b) t
= ('a, 'b) Core__Schedule.t
=
| In_zone : Core__.Import_time.Time.Zone.t * (unzoned, 'b0) t ‑> (zoned, 'b0) t |
| Tag : 'b1 * ('a0, 'b1) t ‑> ('a0, 'b1) t |
| And : ('a1, 'b2) t list ‑> ('a1, 'b2) t |
| Or : ('a2, 'b3) t list ‑> ('a2, 'b3) t |
| Not : ('a3, 'b4) t ‑> ('a3, 'b4) t |
| If_then_else : (('a4, 'b5) t * ('a4, 'b5) t * ('a4, 'b5) t) ‑> ('a4, 'b5) t |
| Shift : Core__.Import_time.Time.Span.t * ('a5, 'b6) t ‑> ('a5, 'b6) t |
| Between : (Inclusive_exclusive.t * Core__.Import_time.Time.Ofday.t) * (Inclusive_exclusive.t * Core__.Import_time.Time.Ofday.t) ‑> (unzoned, 'b7) t |
| At : Core__.Import_time.Time.Ofday.t list ‑> (unzoned, 'b8) t |
| Secs : int list ‑> (unzoned, 'b9) t |
| Mins : int list ‑> (unzoned, 'b10) t |
| Hours : int list ‑> (unzoned, 'b11) t |
| Weekdays : Core__.Import.Day_of_week.t list ‑> (unzoned, 'b12) t |
| Days : int list ‑> (unzoned, 'b13) t |
| Weeks : int list ‑> (unzoned, 'b14) t |
| Months : Core__.Import.Month.t list ‑> (unzoned, 'b15) t |
| On : Core__.Import.Date.t list ‑> (unzoned, 'b16) t |
| Before : (Inclusive_exclusive.t * (Core__.Import.Date.t * Core__.Import_time.Time.Ofday.t)) ‑> (unzoned, 'b17) t |
| After : (Inclusive_exclusive.t * (Core__.Import.Date.t * Core__.Import_time.Time.Ofday.t)) ‑> (unzoned, 'b18) t |
| Always : ('a6, 'b19) t |
| Never : ('a7, 'b20) t |
module Stable = Core__Schedule.Stable
val includes : (zoned, 'b) t ‑> Core__.Import_time.Time.t ‑> bool
val tags : (zoned, 'tag) t ‑> Core__.Import_time.Time.t ‑> [ `Included of 'tag list | `Not_included ]
val all_tags : (zoned, 'tag) t ‑> tag_comparator:('tag, 'cmp) Core__.Import.Comparator.t ‑> ('tag, 'cmp) Core__.Import.Set.t
val fold_tags : (zoned, 'tag) t ‑> init:'m ‑> f:('m ‑> 'tag ‑> 'm) ‑> Core__.Import_time.Time.t ‑> 'm option
module Event = Core__Schedule.Event
type ('tag, 'a) emit
= ('tag, 'a) Core__Schedule.emit
=
| Transitions : ('tag0, [ `Enter of Core__.Import_time.Time.t * 'tag0 list | `Leave of Core__.Import_time.Time.t | `No_change_until_at_least of [ `In_range | `Out_of_range ] * Core__.Import_time.Time.t ]) emit |
| Transitions_and_tag_changes : ('tag1 ‑> 'tag1 ‑> bool) ‑> ('tag1, [ `Change_tags of Core__.Import_time.Time.t * 'tag1 list | `Enter of Core__.Import_time.Time.t * 'tag1 list | `Leave of Core__.Import_time.Time.t | `No_change_until_at_least of [ `In_range | `Out_of_range ] * Core__.Import_time.Time.t ]) emit |
val to_endless_sequence : (zoned, 'tag) t ‑> start_time:Core__.Import_time.Time.t ‑> emit:('tag, 'a) emit ‑> [ `Started_in_range of 'tag list * 'a Core__.Import.Sequence.t | `Started_out_of_range of 'a Core__.Import.Sequence.t ]
val next_enter_between : (zoned, 'tag) t ‑> Core__.Import_time.Time.t ‑> Core__.Import_time.Time.t ‑> Core__.Import_time.Time.t option
val next_leave_between : (zoned, 'tag) t ‑> Core__.Import_time.Time.t ‑> Core__.Import_time.Time.t ‑> Core__.Import_time.Time.t option
type ('tag, 'output) pipe_emit
=
| Transitions : ('tag, 'tag Event.transition) pipe_emit |
| Transitions_and_tag_changes : ('tag ‑> 'tag ‑> bool) ‑> ('tag, [ 'tag Event.transition | 'tag Event.tag_change ]) pipe_emit |
in Transitions_and_tag_changes
equality for the tag type must be given
val to_pipe : (zoned, 'tag) t ‑> start_time:Core.Time.t ‑> emit:('tag, 'output) pipe_emit ‑> ?time_source:Import.Time_source.t ‑> unit ‑> [ `Started_in_range of 'tag list * 'output Import.Pipe.Reader.t | `Started_out_of_range of 'output Import.Pipe.Reader.t ]
to_pipe t ~start_time ~emit ?stop ()
produces a pipe containing the events from
to_endless_sequence ~start_time t ~emit
, with `No_change_until_at_least
filtered
out and each event added only at or after its scheduled time.
val next_event : (zoned, 'tag) t ‑> event:[ `Enter | `Leave ] ‑> stop:unit Import.Deferred.t ‑> ?time_source:Import.Time_source.t ‑> ?after:Core.Time.t ‑> unit ‑> Core.Time.t Import.Deferred.t
next_event t ~event ~stop ~after ()
waits for the time of the next event matching
event
in t
starting at time after
. At that time, the resulting deferred is
determined and filled with the time of the event.
If stop
becomes determined before the next event, the resulting deferred is never
filled and the computation to find the next event stops. If the caller intends to
never use the returned deferred stop should be filled or the background computation
will continue to keep the deferred alive until the event occurs.
This function is a good choice for handling a single event during the run of a
program, like scheduling shutdown. If the intention is to follow along with all
events in a schedule it is preferable to call to_pipe
or to_endless_sequence
(in the non-async module).
val every_enter_without_pushback : (zoned, _) t ‑> ?time_source:Import.Time_source.t ‑> ?start:Core.Time.t ‑> ?stop:unit Import.Deferred.t ‑> ?continue_on_error:bool ‑> ?start_in_range_is_enter:bool ‑> unit every_enter_callback ‑> unit
every_enter_without_pushback t ~start ~stop ~continue_on_error ~start_in_range_is_enter f
calls f
for each contiguous block of time in t
starting at start
and continuing
until stop
becomes determined.
For each block of time with start time enter
and end time leave_time
, f
is
called with f ~enter ~leave
, where leave
is a deferred that becomes determined at
leave_time
with the value leave_time
.
If includes t start && start_in_range_is_enter
, then f
will be called as soon as
possible after start
with enter = start
. Otherwise, f
will not be called for
any block of time that includes start
.
If continue_on_error = false
and f
(or any async job started by f
) raises an
error, f
will no longer be called, and all undetermined leave
deferreds will
remain unfulfilled.
If stop
is fulfilled then no further calls to f
will be made and all undetermined
leave
deferreds will remain unfulfilled.
val every_enter : (zoned, _) t ‑> ?time_source:Import.Time_source.t ‑> ?start:Core.Time.t ‑> ?stop:unit Import.Deferred.t ‑> ?continue_on_error:bool ‑> ?start_in_range_is_enter:bool ‑> ?on_pushback:unit every_enter_callback ‑> unit Import.Deferred.t every_enter_callback ‑> unit
Like every_enter_without_pushback
, except allows at most one call of f
to be in
flight at a time. If the schedule would cause f
to be invoked again before the prior
call has finished, then it invokes on_pushback
instead (if provided).
val every_tag_change_without_pushback : (zoned, 'tag) t ‑> ?time_source:Import.Time_source.t ‑> ?start:Core.Time.t ‑> ?stop:unit Import.Deferred.t ‑> ?continue_on_error:bool ‑> ?start_in_range_is_enter:bool ‑> tag_equal:('tag ‑> 'tag ‑> bool) ‑> (tags:'tag list ‑> unit every_enter_callback) ‑> unit
every_tag_change t f
calls f
for each contiguous block of time in t
where the
set of tags in effect remains stable (according to tag_equal).
Moving from a range where the schedule is not in effect to one where it is in effect with no tags is considered a tag change.
For each block of time tagged with tags
and start time enter
and end time
leave_time
, f
is called with f ~tags ~enter ~leave
, where leave
is a deferred
that becomes determined at leave_time
with the value leave_time
.
stop
, continue_on_error
, and start_in_range_is_enter
act as documented in
every_enter
.
val every_tag_change : (zoned, 'tag) t ‑> ?time_source:Import.Time_source.t ‑> ?start:Core.Time.t ‑> ?stop:unit Import.Deferred.t ‑> ?continue_on_error:bool ‑> ?start_in_range_is_enter:bool ‑> ?on_pushback:(tags:'tag list ‑> unit every_enter_callback) ‑> tag_equal:('tag ‑> 'tag ‑> bool) ‑> (tags:'tag list ‑> unit Import.Deferred.t every_enter_callback) ‑> unit
Like every_tag_change_without_pushback
, but pushes back in the same manner as
every_enter
.