Time module.
module Span : Core_kernel__.Time_ns_intf.Spaninclude sig ... endval hash_fold_t : Base.Hash.state ‑> t ‑> Base.Hash.stateval hash : t ‑> Base.Hash.hash_valueval typerep_of_t : t Typerep_lib.Std.Typerep.tval typename_of_t : t Typerep_lib.Std.Typename.tval bin_t : t Bin_prot.Type_class.tval bin_read_t : t Bin_prot.Read.readerval __bin_read_t__ : (Core_kernel__.Import.int ‑> t) Bin_prot.Read.readerval bin_reader_t : t Bin_prot.Type_class.readerval bin_size_t : t Bin_prot.Size.sizerval bin_write_t : t Bin_prot.Write.writerval bin_writer_t : t Bin_prot.Type_class.writerval bin_shape_t : Bin_prot.Shape.tinclude Core_kernel__.Import.Comparisons.S with type t := tmodule Alternate_sexp : sig ... endNote that we expose a sexp format that is not the one exposed in Core.
val min_value : tval max_value : tval now : Core_kernel__.Import.unit ‑> tval to_int63_ns_since_epoch : t ‑> Core_kernel.Int63.tval of_int63_ns_since_epoch : Core_kernel.Int63.t ‑> tval to_int_ns_since_epoch : t ‑> Core_kernel__.Import.intWill raise on 32-bit platforms. Consider to_int63_ns_since_epoch instead.
val of_int_ns_since_epoch : Core_kernel__.Import.int ‑> tval next_multiple : ?can_equal_after:Core_kernel__.Import.bool ‑> base:t ‑> after:t ‑> interval:Span.t ‑> Core_kernel__.Import.unit ‑> tnext_multiple ~base ~after ~interval returns the smallest time of the form:
time = base + k * intervalwhere 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 ‑> tmodule Utc : sig ... endmodule Stable : sig ... end