ParameterParameter.t carries a unique Variable.t used as function parameter. It can also carry annotations about the usage of the variable.
type parameter = tval wrap : Variable.t -> tMake a parameter from a variable with default attributes
val var : t -> Variable.tval rename : ?current_compilation_unit:Compilation_unit.t -> t -> tRename the inner variable of the parameter
val map_var : (Variable.t -> Variable.t) -> t -> tmodule T : Identifiable.Thing with type t = tmodule Set : sig ... endinclude Identifiable.S with type t := t and module T := T and module Set := Setinclude Identifiable.Thing with type t := T.tinclude Hashtbl.HashedType with type t := T.tval hash : 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 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.tA 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 -> unitval print : Stdlib.Format.formatter -> T.t -> unitmodule Map : Identifiable.Map with module T := Tmodule Tbl : Identifiable.Tbl with module T := Tmodule List : sig ... end