Module Ident
include Identifiable.S with type t := t
module T : Identifiable.Thing with type t = tinclude Identifiable.Thing with type t := T.t
include Stdlib.Hashtbl.HashedType with type t := t
val hash : 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 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.nancorrectly - (
(==),Hashtbl.hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
- (
include Stdlib.Map.OrderedType with type t := t
val compare : t -> t -> intA total ordering function over the keys. This is a two-argument function
fsuch thatf e1 e2is zero if the keyse1ande2are equal,f e1 e2is strictly negative ife1is smaller thane2, andf e1 e2is strictly positive ife1is greater thane2. Example: a suitable ordering function is the generic structural comparison functionStdlib.compare.
val output : Stdlib.out_channel -> t -> unitval print : Stdlib.Format.formatter -> t -> unit
module Set : Identifiable.Set with module T := Tmodule Map : Identifiable.Map with module T := Tmodule Tbl : Identifiable.Tbl with module T := Tval print_with_scope : Stdlib.Format.formatter -> t -> unitSame as
printexcept that it will also add a "n" suffix if the scope of the argument isn.
val create_scoped : scope:int -> string -> tval create_local : string -> tval create_persistent : string -> tval create_predef : string -> tval rename : t -> tCreates an identifier with the same name as the input, a fresh stamp, and no scope. @raises
Fatal_errorif called on a persistent / predef ident.
val name : t -> stringval unique_name : t -> stringval unique_toplevel_name : t -> stringval persistent : t -> boolval same : t -> t -> boolCompare 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.
val compare : t -> t -> intval global : t -> boolval is_predef : t -> boolval scope : t -> intval lowest_scope : intval highest_scope : intval reinit : unit -> unit
val empty : 'a tblval add : t -> 'a -> 'a tbl -> 'a tblval find_same : t -> 'a tbl -> 'aval find_name : string -> 'a tbl -> t * 'aval find_all : string -> 'a tbl -> (t * 'a) listval fold_name : (t -> 'a -> 'b -> 'b) -> 'a tbl -> 'b -> 'bval fold_all : (t -> 'a -> 'b -> 'b) -> 'a tbl -> 'b -> 'bval iter : (t -> 'a -> unit) -> 'a tbl -> unitval remove : t -> 'a tbl -> 'a tblval make_key_generator : unit -> t -> t