Flambda2_identifiers.Variableinclude module type of struct include Int_ids.Variable endtype t = private Flambda2_algorithms.Table_by_int_id.Id.ttype exported = Int_ids.Variable.exportedinclude Flambda2_algorithms.Container_types.S_plus_iterator with type t := tmodule T = Int_ids.Variable.Tinclude Flambda2_algorithms.Container_types_intf.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 print : Format.formatter -> T.t -> unitmodule Set = Int_ids.Variable.Setmodule Map = Int_ids.Variable.Mapmodule Lmap = Int_ids.Variable.Lmapval create : ?user_visible:unit -> string -> Flambda2_kinds.Flambda_kind.t -> tval compilation_unit : t -> Compilation_unit.tval name : t -> stringval name_stamp : t -> intval kind : t -> Flambda2_kinds.Flambda_kind.tval user_visible : t -> boolval create_with_same_name_as_ident :
?user_visible:unit ->
Ident.t ->
Flambda2_kinds.Flambda_kind.t ->
trename always returns a variable with a compilation unit set to that of the current unit, not the unit of the variable passed in.
val unique_name : t -> stringval raw_name : t -> string