Module `Int_ids.Code_id_or_name`

type t = private Flambda2_algorithms.Table_by_int_id.Id.t

include Flambda2_algorithms.Container_types.S_plus_iterator with type t := t

module T : Flambda2_algorithms.Container_types_intf.Thing with type t = t

include Flambda2_algorithms.Container_types_intf.Thing with type t := T.t

include Hashtbl.HashedType with type t := T.t

val equal : T.t -> T.t -> bool

The equality predicate used to compare keys.

val hash : T.t -> int

A 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.t

val compare : T.t -> T.t -> int

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 : Format.formatter -> T.t -> unit

module Set : Flambda2_algorithms.Container_types_intf.Set with type elt = t

module Map : 
  Flambda2_algorithms.Container_types_intf.Map_plus_iterator
    with type key = t
     and module Set = Set

val datalog_column_id : ('a Map.t, t, 'a) Flambda2_datalog.Datalog.Column.id

val code_id : Code_id.t -> t

val name : Name.t -> t

val var : Variable.t -> t

val symbol : Symbol.t -> t

val pattern_match : 
  t ->
  code_id:(Code_id.t -> 'a) ->
  var:(Variable.t -> 'a) ->
  symbol:(Symbol.t -> 'a) ->
  'a

Module Int_ids.Code_id_or_name

Module `Int_ids.Code_id_or_name`