Module Flambda2_identifiers.Code_id_or_name
include module type of struct include Flambda2_identifiers.Int_ids.Code_id_or_name end
type t = private Flambda2_algorithms.Table_by_int_id.Id.tinclude Flambda2_algorithms.Container_types.S_plus_iterator
with type t := Flambda2_identifiers.Code_id_or_name.t
include Flambda2_algorithms.Container_types_intf.Thing with type t := T.t
include Stdlib.Hashtbl.HashedType with type t := T.t
val 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 handlingStdlib.nancorrectly - (
(==),hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
include Stdlib.Map.OrderedType with type t := T.t
A 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 : Stdlib.Format.formatter -> T.t -> unitmodule Set = Flambda2_identifiers.Int_ids.Code_id_or_name.Setmodule Map = Flambda2_identifiers.Int_ids.Code_id_or_name.Mapval datalog_column_id :
('a Map.t, Flambda2_identifiers.Code_id_or_name.t, 'a)
Flambda2_datalog.Datalog.Column.idval pattern_match :
Flambda2_identifiers.Code_id_or_name.t ->
code_id:(Flambda2_identifiers.Int_ids.Code_id.t -> 'a) ->
var:(Flambda2_identifiers.Int_ids.Variable.t -> 'a) ->
symbol:(Flambda2_identifiers.Int_ids.Symbol.t -> 'a) ->
'aval pattern_match' :
Flambda2_identifiers.Code_id_or_name.t ->
code_id:(Flambda2_identifiers.Code_id.t -> 'a) ->
name:(Flambda2_identifiers.Name.t -> 'a) ->
'a