Ocaml_typing.IdentSourceinclude Ocaml_utils.Identifiable.S with type t := tinclude Ocaml_utils.Identifiable.Thing with type t := T.tinclude Hashtbl.HashedType with type t := T.tA 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.tSame as print except that it will also add a "n" suffix if the scope of the argument is n.
Creates an identifier with the same name as the input, a fresh stamp, and no scope.
Compare identifiers by binding location. Two identifiers are the same either if they are both non-persistent and have been created by the same call to create_*, or if they are both persistent and have the same name.
Get the value of the current stamp (the stamp of the last created identifier). Used to flush identifier-based caches when backtracking.