Module Spool.Event
type spool_event= [ `Spooled | `Delivered | `Frozen | `Removed | `Unfrozen | `Recovered of [ `From_quarantined | `From_removed ] | `Quarantined of [ `Reason of Async_smtp__.Quarantine_reason.t ] ] * Message_id.t * Async_smtp_types.Smtp_envelope.Info.t
val sexp_of_spool_event : spool_event -> Ppx_sexp_conv_lib.Sexp.t
type t= Core.Time.t * [ `Spool_event of spool_event | `Ping ]
val sexp_of_t : t -> Ppx_sexp_conv_lib.Sexp.t
include Core.Comparable.S_plain with type t := t
include Core_kernel__.Comparable_intf.S_common
include Base.Comparable.S
include Base__.Comparable_intf.Polymorphic_compare
val ascending : t -> t -> intascendingis identical tocompare.descending x y = ascending y x. These are intended to be mnemonic when used likeList.sort ~compare:ascendingandList.sort ~cmp:descending, since they cause the list to be sorted in ascending or descending order, respectively.
val descending : t -> t -> intval between : t -> low:t -> high:t -> boolbetween t ~low ~highmeanslow <= t <= high
val clamp_exn : t -> min:t -> max:t -> tclamp_exn t ~min ~maxreturnst', the closest value totsuch thatbetween t' ~low:min ~high:maxis 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.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.check
module Replace_polymorphic_compare : Core_kernel__.Comparable_intf.Polymorphic_compare with type t := tmodule Map : Core_kernel.Map.S_plain with type Key.t = t with type Key.comparator_witness = comparator_witnessmodule Set : Core_kernel.Set.S_plain with type Elt.t = t with type Elt.comparator_witness = comparator_witnessval to_string : t -> string