async_unix v0.9.0 · OCaml Package

async_unix

type t

The sexps and strings look like integers.

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__ : (Base.Int.t -> 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 hash_fold_t : 
  Ppx_hash_lib.Std.Hash.state ->
  t ->
  Ppx_hash_lib.Std.Hash.state

val t_of_sexp : Sexplib.Sexp.t -> t

val sexp_of_t : t -> Sexplib.Sexp.t

val typerep_of_t : t Typerep_lib.Std.Typerep.t

val typename_of_t : t Typerep_lib.Std.Typename.t

CAVEAT: Values created with of_float, of_sexp, or of_string may be equal to previously created values.

include Core_kernel.Comparable.S_binable with type t := t

include Base.Comparable_intf.S with type t := t

include Base.Comparable_intf.Polymorphic_compare with type t := t

include Base.Polymorphic_compare_intf.Infix with type t := t

val (>=) : t -> t -> bool

val (<=) : t -> t -> bool

val (=) : t -> t -> bool

val (>) : t -> t -> bool

val (<) : t -> t -> bool

val (<>) : t -> t -> bool

val equal : t -> t -> bool

val min : t -> t -> t

val max : t -> t -> t

val ascending : t -> t -> int

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.

val descending : t -> t -> int

val between : t -> low:t -> high:t -> bool

val clamp_exn : t -> min:t -> max:t -> t

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

type comparator_witness

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 : 
  Base.Comparable_intf.Polymorphic_compare with type t := t

include Core_kernel.Comparator.S
  with type t := t
  with type comparator_witness := comparator_witness

val comparator : (t, comparator_witness) Base.Comparator.comparator

module Map : 
  Core_kernel.Core_map_intf.S_binable
    with type Key.t = t
    with type Key.comparator_witness = comparator_witness

module Set : 
  Core_kernel.Core_set_intf.S_binable
    with type Elt.t = t
    with type Elt.comparator_witness = comparator_witness

include Core_kernel.Interfaces.Hashable with type t := t

include Core_kernel.Hashable.Common with type t := t

val hash : t -> Base.Int.t

val compare : t -> t -> Base.Int.t

val hashable : t Core_kernel.Hashable.Hashtbl.Hashable.t

module Table : Core_kernel.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

include Core_kernel.Interfaces.Intable with type t := t

val of_int_exn : int -> t

val to_int_exn : t -> int

include Core_kernel.Interfaces.Stringable with type t := t

val of_string : string -> t

val to_string : t -> string

val create : Base.Unit.t -> t

Always returns a value that is not equal to any other value created with create.

package async_unix