Module Global_module.Name

type t = private {
  1. head : string;
  2. args : argument list;
}
and argument = t Argument.t
include Ocaml_utils.Identifiable.S with type t := t
module T : Ocaml_utils.Identifiable.Thing with type t = t
include Ocaml_utils.Identifiable.Thing with type t := T.t
include Hashtbl.HashedType with type t := T.t
val equal : T.t -> T.t -> bool

The equality predicate used to compare keys.

val hash : T.t -> int

A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

  • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
  • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
  • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
include Map.OrderedType with type t := T.t
val compare : T.t -> T.t -> int

A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

val output : out_channel -> T.t -> unit
val print : Format.formatter -> T.t -> unit
module Set : Ocaml_utils.Identifiable.Set with module T := T
module Map : Ocaml_utils.Identifiable.Map with module T := T
module Tbl : Ocaml_utils.Identifiable.Tbl with module T := T
val create : string -> argument list -> (t, t duplicate) Result.t
val create_exn : string -> argument list -> t
val create_no_args : string -> t
val of_parameter_name : Parameter_name.t -> t
val to_string : t -> string
val find_in_parameter_map : t -> 'a Parameter_name.Map.t -> 'a option
val mem_parameter_set : t -> Parameter_name.Set.t -> bool