Module Global_module.Parameter_name
val of_string : string -> Global_module.Parameter_name.tval to_string : Global_module.Parameter_name.t -> stringinclude Identifiable.S with type t := Global_module.Parameter_name.t
module T : Identifiable.Thing with type t = Global_module.Parameter_name.tinclude Identifiable.Thing with type t := Global_module.Parameter_name.T.t
include Stdlib.Hashtbl.HashedType
with type t := Global_module.Parameter_name.T.t
val equal :
Global_module.Parameter_name.T.t ->
Global_module.Parameter_name.T.t ->
boolThe equality predicate used to compare keys.
val hash : Global_module.Parameter_name.T.t -> intA 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 handlingStdlib.nancorrectly - (
(==),hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
include Stdlib.Map.OrderedType with type t := Global_module.Parameter_name.T.t
val compare :
Global_module.Parameter_name.T.t ->
Global_module.Parameter_name.T.t ->
intA 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 : Stdlib.out_channel -> Global_module.Parameter_name.T.t -> unitval print : Stdlib.Format.formatter -> Global_module.Parameter_name.T.t -> unitmodule Set : Identifiable.Set with module T := Global_module.Parameter_name.Tmodule Map : Identifiable.Map with module T := Global_module.Parameter_name.Tmodule Tbl : Identifiable.Tbl with module T := Global_module.Parameter_name.T