include Core_kernel__.Day_of_week_intf.Day_of_week
include sig ... end
val t_of_sexp : Sexplib.Sexp.t ‑> t
val sexp_of_t : t ‑> Sexplib.Sexp.t
val hash_fold_t : Ppx_hash_lib.Std.Hash.state ‑> t ‑> Ppx_hash_lib.Std.Hash.state
val hash : t ‑> Ppx_hash_lib.Std.Hash.hash_value
val compare : t ‑> t ‑> Core_kernel__.Import.int
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 Comparable.S_binable with type t := t
include Core_kernel__.Comparable_intf.S_common
include Base.Comparable_intf.S
include Base.Comparable_intf.Polymorphic_compare
ascending
is identical to compare
. descending x y = ascending y x
. These are
intended to be mnemonic when used like List.sort ~cmp:ascending
and List.sort
~cmp:descending
, since they cause the list to be sorted in ascending or descending
order, respectively.
clamp_exn t ~min ~max
returns t'
, the closest value to t
such that
between 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
include Core_kernel__.Comparable_intf.Map_and_set_binable with type t := t with type comparator_witness := comparator_witness
include Comparator.S with type t := t
val comparator : (t, comparator_witness) Comparator.comparator
module Map : Core_kernel__.Core_map.S_binable with type Key.t = t with type Key.comparator_witness = comparator_witness
module Set : Core_kernel__.Core_set.S_binable with type Elt.t = t with type Elt.comparator_witness = comparator_witness
include Hashable.S_binable with type t := t
val hash : t ‑> Core_kernel__.Import.int
val hashable : t Hashable.Hashtbl.Hashable.t
module Table : Hashable.Hashtbl.S_binable with type key = t
module Hash_set : Hash_set.S_binable with type elt = t
module Hash_queue : Hash_queue.S with type Key.t = t
of_string s
accepts three-character abbreviations and full day names
with any capitalization, and strings of the integers 0-6.
include Core_kernel__.Import.Stringable.S with type t := t
val of_string : string ‑> t
val to_string : t ‑> string
val to_string_long : t ‑> Core_kernel__.Import.string
Capitalized full day names rather than all-caps 3-letter abbreviations
val of_int_exn : Core_kernel__.Import.int ‑> t
These use the same mapping as Unix.tm_wday
: 0 <-> Sun, ... 6 <-> Sat
val of_int : Core_kernel__.Import.int ‑> t Core_kernel__.Import.option
val to_int : t ‑> Core_kernel__.Import.int
val iso_8601_weekday_number : t ‑> Core_kernel__.Import.int
As per ISO 8601, Mon->1, Tue->2, ... Sun->7
val shift : t ‑> Core_kernel__.Import.int ‑> t
This goes forward (or backward) the specified number of weekdays
val num_days : from:t ‑> to_:t ‑> Core_kernel__.Import.int
num_days ~from ~to_
gives the number of days that must elapse from a from
to get
to a to_
, i.e. the smallest non-negative number i
such that shift from i = to_
.
val is_sun_or_sat : t ‑> Core_kernel__.Import.bool
val all : t Core_kernel__.Import.list
module Stable : sig ... end