Time module.
module Span : Core_kernel__.Time_ns_intf.Span
include sig ... end
val hash_fold_t : Base.Hash.state ‑> t ‑> Base.Hash.state
val hash : t ‑> Base.Hash.hash_value
val typerep_of_t : t Typerep_lib.Std.Typerep.t
val typename_of_t : t Typerep_lib.Std.Typename.t
val bin_t : t Bin_prot.Type_class.t
val bin_read_t : t Bin_prot.Read.reader
val __bin_read_t__ : (Core_kernel__.Import.int ‑> t) Bin_prot.Read.reader
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Write.writer
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_shape_t : Bin_prot.Shape.t
include Core_kernel__.Import.Comparisons.S with type t := t
module Alternate_sexp : sig ... end
Note that we expose a sexp format that is not the one exposed in Core
.
val min_value : t
val max_value : t
val now : Core_kernel__.Import.unit ‑> t
val to_int_ns_since_epoch : t ‑> Core_kernel__.Import.int
Will raise on 32-bit platforms. Consider to_int63_ns_since_epoch
instead.
val of_int_ns_since_epoch : Core_kernel__.Import.int ‑> t
val next_multiple : ?can_equal_after:Core_kernel__.Import.bool ‑> base:t ‑> after:t ‑> interval:Span.t ‑> Core_kernel__.Import.unit ‑> t
next_multiple ~base ~after ~interval
returns the smallest time
of the form:
time = base + k * interval
where k >= 0
and time > after
. It is an error if interval <= 0
.
Supplying ~can_equal_after:true
allows the result to satisfy time >= after
.
Overflows silently.
val random : ?state:Core_kernel__.Import.Random.State.t ‑> Core_kernel__.Import.unit ‑> t
module Utc : sig ... end
module Stable : sig ... end