Parameter Make.1-Time
type underlying
type t
= private underlying
include Bin_prot.Binable.S with type t := t
include Bin_prot.Binable.S_only_functions with type t := t
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Write.writer
val bin_read_t : t Bin_prot.Read.reader
val __bin_read_t__ : (int -> t) Bin_prot.Read.reader
This function only needs implementation if
t
exposed to be a polymorphic variant. Despite what the type reads, this does *not* produce a function after reading; instead it takes the constructor tag (int) before reading and reads the rest of the variantt
afterwards.
val bin_shape_t : Bin_prot.Shape.t
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
val compare : t -> t -> Core_kernel__.Import.int
val hash_fold_t : Base.Hash.state -> t -> Base.Hash.state
val hash : t -> Base.Hash.hash_value
include Typerep_lib.Typerepable.S with type t := t
val typerep_of_t : t Typerep_lib.Std_internal.Typerep.t
val typename_of_t : t Typerep_lib.Typename.t
module Span : Core_kernel__.Span_intf.S with type underlying = underlying
module Ofday : Core_kernel__.Ofday_intf.S with type underlying := underlying and module Span := Span
include Core_kernel__.Time0_intf.Basic with type t := t and module Span := Span
module Span : Core_kernel__.Span_intf.S
module Replace_polymorphic_compare : Core_kernel.Comparable.Polymorphic_compare with type t := t
include Core_kernel.Comparable.S_common with type t := t and module Replace_polymorphic_compare := Replace_polymorphic_compare
include Base.Comparable.S
include Base__.Comparable_intf.Polymorphic_compare
val ascending : t -> t -> int
ascending
is identical tocompare
.descending x y = ascending y x
. These are intended to be mnemonic when used likeList.sort ~compare:ascending
andList.sort ~cmp:descending
, since they cause the list to be sorted in ascending or descending order, respectively.
val descending : t -> t -> int
val between : t -> low:t -> high:t -> bool
between t ~low ~high
meanslow <= t <= high
val clamp_exn : t -> min:t -> max:t -> t
clamp_exn t ~min ~max
returnst'
, the closest value tot
such thatbetween t' ~low:min ~high:max
is true.Raises if
not (min <= max)
.
val clamp : t -> min:t -> max:t -> t Base.Or_error.t
include Base.Comparator.S with type t := t
val comparator : (t, comparator_witness) Base.Comparator.comparator
include Base__.Comparable_intf.Validate with type t := t
val validate_lbound : min:t Base.Maybe_bound.t -> t Base.Validate.check
val validate_ubound : max:t Base.Maybe_bound.t -> t Base.Validate.check
val validate_bound : min:t Base.Maybe_bound.t -> max:t Base.Maybe_bound.t -> t Base.Validate.check
module Replace_polymorphic_compare : Core_kernel__.Comparable_intf.Polymorphic_compare with type t := t
module Date_and_ofday : sig ... end with type absolute := t
Equivalent to a
Date.t
and anOfday.t
with no time zone. ADate_and_ofday.t
does not correspond to a single, unambiguous point in time.
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 smallesttime
of the form:time = base + k * interval
where
k >= 0
andtime > after
. It is an error ifinterval <= 0
.Supplying
~can_equal_after:true
allows the result to satisfytime >= after
.
val prev_multiple : ?can_equal_before:Core_kernel__.Import.bool -> base:t -> before:t -> interval:Span.t -> Core_kernel__.Import.unit -> t
prev_multiple ~base ~before ~interval
returns the largesttime
of the form:time = base + k * interval
where
k >= 0
andtime < before
. It is an error ifinterval <= 0
.Supplying
~can_equal_before:true
allows the result to satisfytime <= before
.
val now : Core_kernel__.Import.unit -> t