type t
type parameter = t
val wrap : Variable.t -> t
Make a parameter from a variable with default attributes
val var : t -> Variable.t
val rename : ?current_compilation_unit:Compilation_unit.t -> t -> t
Rename the inner variable of the parameter
val map_var : (Variable.t -> Variable.t) -> t -> t
module T : Identifiable.Thing with type t = t
module Set : sig ... end
include Identifiable.S with type t := t and module T := T and module Set := Set
include Identifiable.Thing with type t := T.t
include Stdlib.Hashtbl.HashedType with type t := T.t
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 byhash
. Examples: suitable (equal
,hash
) pairs for arbitrary key types include- (
(=)
,Hashtbl
.hash) for comparing objects by structure (provided objects do not contain floats) - (
(fun x y -> compare x y = 0)
,Hashtbl
.hash) for comparing objects by structure and handlingStdlib.nan
correctly - (
(==)
,Hashtbl
.hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
- (
include Stdlib.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 thatf e1 e2
is zero if the keyse1
ande2
are equal,f e1 e2
is strictly negative ife1
is smaller thane2
, andf e1 e2
is strictly positive ife1
is greater thane2
. Example: a suitable ordering function is the generic structural comparison functionStdlib.compare
.
val output : Stdlib.out_channel -> T.t -> unit
val print : Stdlib.Format.formatter -> T.t -> unit
module Map : Identifiable.Map with module T := T
module Tbl : Identifiable.Tbl with module T := T
module List : sig ... end