Module Email_address
module Domain : sig ... endval sexp_of_t : t -> Ppx_sexp_conv_lib.Sexp.tval compare : t -> t -> intval hash_fold_t : Base.Hash.state -> t -> Base.Hash.stateval hash : t -> Base.Hash.hash_value
val create : ?prefix:string -> ?domain:Domain.t -> string -> tval of_string : ?default_domain:string -> string -> t Core_kernel.Or_error.tval of_string_exn : ?default_domain:string -> string -> tval list_of_string : ?default_domain:string -> string -> t list Core_kernel.Or_error.tval list_of_string_exn : ?default_domain:string -> string -> t listval to_string : t -> stringval list_to_header_value : t list -> stringval local_part : t -> stringval set_local_part : t -> string -> tval domain : t -> Domain.t optionval set_domain : t -> Domain.t option -> tval address_part : ?brackets:bool -> ?lowercase_domain:bool -> t -> tval address_part_string : ?brackets:bool -> ?lowercase_domain:bool -> t -> stringval set_address_part : t -> string -> t Core_kernel.Or_error.tset_address_partexpects an email address without prefix or angle brackets e.g. USER@DOMAIN.
val prefix : t -> string optionval set_prefix : t -> string option -> tset_prefixwill remove angle brackets if givenNone, otherwise angle brackets are added before the given prefix.
val arg_type : t Core_kernel.Command.Arg_type.t
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 -> 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_witnessinclude Core_kernel.Hashable.S_plain with type t := t
include Core_kernel.Hashable.Common
val compare : t -> t -> Core_kernel__.Import.intval hash_fold_t : Base.Hash.state -> t -> Base.Hash.stateval hash : t -> Base.Hash.hash_value
val hashable : t Core_kernel.Hashtbl.Hashable.t
module Table : Core_kernel.Hashtbl.S_plain with type key = tmodule Hash_set : Core_kernel.Hash_set.S_plain with type elt = tmodule Hash_queue : Core_kernel.Hash_queue.S with type key = tmodule Caseless : sig ... endmodule Stable : sig ... end