Core_kernel.Day_of_weekProvides a variant type for days of the week (Mon, Tue, etc.) and convenience functions for converting these days into other formats, like seconds since the epoch.
include Bin_prot.Binable.S with type t := tinclude Bin_prot.Binable.S_only_functions with type t := tval bin_size_t : t Bin_prot.Size.sizerval bin_write_t : t Bin_prot.Write.writerval bin_read_t : t Bin_prot.Read.readerval __bin_read_t__ : (int -> t) Bin_prot.Read.readerThis 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 variant t afterwards.
val bin_shape_t : Bin_prot.Shape.tval bin_writer_t : t Bin_prot.Type_class.writerval bin_reader_t : t Bin_prot.Type_class.readerval bin_t : t Bin_prot.Type_class.tval compare : t -> t -> Base.Int.tval hash_fold_t : Base.Hash.state -> t -> Base.Hash.stateval hash : t -> Base.Hash.hash_valueval quickcheck_generator : t Base_quickcheck.Generator.tval quickcheck_observer : t Base_quickcheck.Observer.tval quickcheck_shrinker : t Base_quickcheck.Shrinker.tinclude Ppx_sexp_conv_lib.Sexpable.S with type t := tval t_of_sexp : Sexplib0.Sexp.t -> tval sexp_of_t : t -> Sexplib0.Sexp.tinclude Comparable.S_binable with type t := tinclude Base.Comparable.S with type t := tinclude Base.Comparisons.S with type t := tcompare t1 t2 returns 0 if t1 is equal to t2, a negative integer if t1 is less than t2, and a positive integer if t1 is greater than t2.
ascending is identical to compare. descending x y = ascending y x. These are intended to be mnemonic when used like List.sort ~compare: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.tinclude Base.Comparator.S with type t := tval validate_lbound : min:t Base.Maybe_bound.t -> t Base.Validate.checkval validate_ubound : max:t Base.Maybe_bound.t -> t Base.Validate.checkval validate_bound : min:t Base.Maybe_bound.t -> max:t Base.Maybe_bound.t -> t Base.Validate.checkmodule Replace_polymorphic_compare : Base.Comparable.Polymorphic_compare with type t := tinclude Comparator.S with type t := t with type comparator_witness := comparator_witnessval comparator : (t, comparator_witness) Comparator.comparatormodule Map : Map.S_binable with type Key.t = t with type Key.comparator_witness = comparator_witnessmodule Set : Set.S_binable with type Elt.t = t with type Elt.comparator_witness = comparator_witnessinclude Hashable.S_binable with type t := tval hash_fold_t : Base.Hash.state -> t -> Base.Hash.stateval hash : t -> Base.Hash.hash_valueval hashable : t Hashtbl.Hashable.tmodule Table : Hashtbl.S_binable with type key = tmodule Hash_set : Hash_set.S_binable with type elt = tmodule Hash_queue : Hash_queue.S with type key = tof_string s accepts three-character abbreviations and full day names with any capitalization, and strings of the integers 0-6.
val to_string_long : t -> Base.String.tCapitalized full day names rather than all-caps 3-letter abbreviations.
val of_int_exn : Base.Int.t -> tThese use the same mapping as Unix.tm_wday: 0 <-> Sun, ... 6 <-> Sat
val of_int : Base.Int.t -> t Base.Option.tval to_int : t -> Base.Int.tval iso_8601_weekday_number : t -> Base.Int.tAs per ISO 8601, Mon->1, Tue->2, ... Sun->7
val shift : t -> Base.Int.t -> tshift goes forward (or backward) the specified number of weekdays.
val num_days : from:t -> to_:t -> Base.Int.tnum_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 -> Base.Bool.tval all : t Base.List.tval weekdays : t Base.List.t Mon; Tue; Wed; Thu; Fri
val weekends : t Base.List.t Sat; Sun
module Stable : sig ... end