module Id : Core.Identifiable
module Status : sig ... end
module Queue : sig ... end
module On_disk_spool : sig ... end
include sig ... end
val bin_t : t Bin_prot.Type_class.t
val bin_read_t : t Bin_prot.Read.reader
val __bin_read_t__ : (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
val t_of_sexp : Sexplib.Sexp.t ‑> t
val sexp_of_t : t ‑> Sexplib.Sexp.t
include Core.Comparable.S 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
module Map : Core_kernel__.Core_map.S with type Key.t = t with type Key.comparator_witness = comparator_witness
module Set : Core_kernel__.Core_set.S with type Elt.t = t with type Elt.comparator_witness = comparator_witness
include Core.Hashable.S with type t := t
include Core.Hashable.Common
val hash : t ‑> Core_kernel__.Import.int
val compare : t ‑> t ‑> Core_kernel__.Import.int
val hashable : t Core.Hashable.Hashtbl.Hashable.t
module Table : Core.Hashable.Hashtbl.S with type key = t
module Hash_set : Core_kernel.Hash_set.S with type elt = t
module Hash_queue : Core_kernel.Hash_queue.S with type Key.t = t
val spool_date : t ‑> Core.Time.t
val last_relay_attempt : t ‑> (Core.Time.t * Core.Error.t) option
val parent_id : t ‑> Types.Envelope.Id.t
val flows : t ‑> Mail_log.Flows.t
val time_on_spool : t ‑> Core.Time.Span.t
val next_hop_choices : t ‑> Types.Address.t list
val size_of_file : t ‑> Core.Byte_units.t Core.Or_error.t Async.Deferred.t
val 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.t
val load : On_disk_spool.Entry.t ‑> t Core.Or_error.t Async.Deferred.t
val load_with_envelope : On_disk_spool.Entry.t ‑> (t * Types.Envelope.t) Core.Or_error.t Async.Deferred.t
val send : t ‑> log:Mail_log.t ‑> config:Client_config.t ‑> unit Core.Or_error.t Async.Deferred.t
val map_envelope : t ‑> f:(Types.Envelope.t ‑> Types.Envelope.t) ‑> unit Core.Or_error.t Async.Deferred.t
val freeze : t ‑> log:Mail_log.t ‑> unit Core.Or_error.t Async.Deferred.t
val mark_for_send_now : retry_intervals:Core.Time.Span.t list ‑> t ‑> log:Mail_log.t ‑> unit Core.Or_error.t Async.Deferred.t
val remove : t ‑> log:Mail_log.t ‑> unit Core.Or_error.t Async.Deferred.t