module Id : Core.Identifiablemodule Status : sig ... endmodule Queue : sig ... endmodule On_disk_spool : sig ... endinclude sig ... endval bin_t : t Bin_prot.Type_class.tval bin_read_t : t Bin_prot.Read.readerval __bin_read_t__ : (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.tval t_of_sexp : Sexplib.Sexp.t ‑> tval sexp_of_t : t ‑> Sexplib.Sexp.tinclude Core.Comparable.S with type t := tinclude Core_kernel__.Comparable_intf.S_commoninclude Base.Comparable_intf.Sinclude Base.Comparable_intf.Polymorphic_compareascending 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.tinclude Base.Comparator.S with type t := tval comparator : (t, comparator_witness) Base.Comparator.comparatorinclude Base.Comparable_intf.Validate 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 : Core_kernel__.Comparable_intf.Polymorphic_compare with type t := tmodule Map : Core_kernel__.Core_map.S with type Key.t = t with type Key.comparator_witness = comparator_witnessmodule Set : Core_kernel__.Core_set.S with type Elt.t = t with type Elt.comparator_witness = comparator_witnessinclude Core.Hashable.S with type t := tinclude Core.Hashable.Commonval hash : t ‑> Core_kernel__.Import.intval compare : t ‑> t ‑> Core_kernel__.Import.intval hashable : t Core.Hashable.Hashtbl.Hashable.tmodule Table : Core.Hashable.Hashtbl.S with type key = tmodule Hash_set : Core_kernel.Hash_set.S with type elt = tmodule Hash_queue : Core_kernel.Hash_queue.S with type Key.t = tval spool_date : t ‑> Core.Time.tval last_relay_attempt : t ‑> (Core.Time.t * Core.Error.t) optionval parent_id : t ‑> Types.Envelope.Id.tval flows : t ‑> Mail_log.Flows.tval time_on_spool : t ‑> Core.Time.Span.tval next_hop_choices : t ‑> Types.Address.t listval size_of_file : t ‑> Core.Byte_units.t Core.Or_error.t Async.Deferred.tval create : On_disk_spool.t ‑> log:Mail_log.t ‑> initial_status:Status.t ‑> Types.Envelope_with_next_hop.t ‑> flows:Mail_log.Flows.t ‑> original_msg:Types.Envelope.t ‑> t Core.Or_error.t Async.Deferred.tval load : On_disk_spool.Entry.t ‑> t Core.Or_error.t Async.Deferred.tval load_with_envelope : On_disk_spool.Entry.t ‑> (t * Types.Envelope.t) Core.Or_error.t Async.Deferred.tval send : t ‑> log:Mail_log.t ‑> config:Client_config.t ‑> unit Core.Or_error.t Async.Deferred.tval map_envelope : t ‑> f:(Types.Envelope.t ‑> Types.Envelope.t) ‑> unit Core.Or_error.t Async.Deferred.tval freeze : t ‑> log:Mail_log.t ‑> unit Core.Or_error.t Async.Deferred.tval mark_for_send_now : retry_intervals:Core.Time.Span.t list ‑> t ‑> log:Mail_log.t ‑> unit Core.Or_error.t Async.Deferred.tval remove : t ‑> log:Mail_log.t ‑> unit Core.Or_error.t Async.Deferred.t