Module Email_address
module Domain : sig ... end
val sexp_of_t : t -> Ppx_sexp_conv_lib.Sexp.t
val compare : t -> t -> int
val hash_fold_t : Base.Hash.state -> t -> Base.Hash.state
val hash : t -> Base.Hash.hash_value
val create : ?prefix:string -> ?domain:Domain.t -> string -> t
val of_string : ?default_domain:string -> string -> t Core_kernel.Or_error.t
val of_string_exn : ?default_domain:string -> string -> t
val list_of_string : ?default_domain:string -> string -> t list Core_kernel.Or_error.t
val list_of_string_exn : ?default_domain:string -> string -> t list
val to_string : t -> string
val list_to_header_value : t list -> string
val local_part : t -> string
val set_local_part : t -> string -> t
val domain : t -> Domain.t option
val set_domain : t -> Domain.t option -> t
val address_part : ?brackets:bool -> ?lowercase_domain:bool -> t -> t
val address_part_string : ?brackets:bool -> ?lowercase_domain:bool -> t -> string
val set_address_part : t -> string -> t Core_kernel.Or_error.t
set_address_part
expects an email address without prefix or angle brackets e.g. USER@DOMAIN.
val prefix : t -> string option
val set_prefix : t -> string option -> t
set_prefix
will remove angle brackets if givenNone
, otherwise angle brackets are added before the given prefix.
include Core_kernel.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 -> int
ascending
is identical tocompare
.descending x y = ascending y x
. These are intended to be mnemonic when used likeList.sort ~compare:ascending
andList.sort ~cmp:descending
, since they cause the list to be sorted in ascending or descending order, respectively.
val descending : t -> t -> int
val between : t -> low:t -> high:t -> bool
between t ~low ~high
meanslow <= t <= high
val clamp_exn : t -> min:t -> max:t -> t
clamp_exn t ~min ~max
returnst'
, the closest value tot
such thatbetween 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.Map.S_plain with type Key.t = t with type Key.comparator_witness = comparator_witness
module Set : Core_kernel.Set.S_plain with type Elt.t = t with type Elt.comparator_witness = comparator_witness
include Core_kernel.Hashable.S_plain with type t := t
include Core_kernel.Hashable.Common
val compare : t -> t -> Core_kernel__.Import.int
val hash_fold_t : Base.Hash.state -> t -> Base.Hash.state
val hash : t -> Base.Hash.hash_value
val hashable : t Core_kernel.Hashtbl.Hashable.t
module Table : Core_kernel.Hashtbl.S_plain with type key = t
module Hash_set : Core_kernel.Hash_set.S_plain with type elt = t
module Hash_queue : Core_kernel.Hash_queue.S with type Key.t = t
module Caseless : sig ... end
module Stable : sig ... end