Module `Int_ids.Simple`

type t = private Flambda2_algorithms.Table_by_int_id.Id.t

type exported

include Flambda2_algorithms.Container_types.S_plus_iterator
  with type t := Flambda2_identifiers.Int_ids.Simple.t

module T : 
  Flambda2_algorithms.Container_types_intf.Thing
    with type t = Flambda2_identifiers.Int_ids.Simple.t

include Flambda2_algorithms.Container_types_intf.Thing
  with type t := Flambda2_identifiers.Int_ids.Simple.T.t

include Stdlib.Hashtbl.HashedType
  with type t := Flambda2_identifiers.Int_ids.Simple.T.t

val equal : 
  Flambda2_identifiers.Int_ids.Simple.T.t ->
  Flambda2_identifiers.Int_ids.Simple.T.t ->
  bool

The equality predicate used to compare keys.

val hash : Flambda2_identifiers.Int_ids.Simple.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 Stdlib.Map.OrderedType
  with type t := Flambda2_identifiers.Int_ids.Simple.T.t

val compare : 
  Flambda2_identifiers.Int_ids.Simple.T.t ->
  Flambda2_identifiers.Int_ids.Simple.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 : 
  Stdlib.Format.formatter ->
  Flambda2_identifiers.Int_ids.Simple.T.t ->
  unit

module Set : 
  Flambda2_algorithms.Container_types_intf.Set
    with type elt = Flambda2_identifiers.Int_ids.Simple.t

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

val name : 
  Flambda2_identifiers.Int_ids.Name.t ->
  Flambda2_identifiers.Int_ids.Simple.t

val var : 
  Flambda2_identifiers.Int_ids.Variable.t ->
  Flambda2_identifiers.Int_ids.Simple.t

val vars : 
  Flambda2_identifiers.Int_ids.Variable.t list ->
  Flambda2_identifiers.Int_ids.Simple.t list

val symbol : 
  Flambda2_identifiers.Int_ids.Symbol.t ->
  Flambda2_identifiers.Int_ids.Simple.t

val const : 
  Flambda2_identifiers.Int_ids.Const.t ->
  Flambda2_identifiers.Int_ids.Simple.t

val coercion : 
  Flambda2_identifiers.Int_ids.Simple.t ->
  Flambda2_identifiers.Int_ids.Coercion.t

val with_coercion : 
  Flambda2_identifiers.Int_ids.Simple.t ->
  Flambda2_identifiers.Int_ids.Coercion.t ->
  Flambda2_identifiers.Int_ids.Simple.t

val has_coercion : Flambda2_identifiers.Int_ids.Simple.t -> bool

val pattern_match : 
  Flambda2_identifiers.Int_ids.Simple.t ->
  name:
    (Flambda2_identifiers.Int_ids.Name.t ->
      coercion:Flambda2_identifiers.Int_ids.Coercion.t ->
      'a) ->
  const:(Flambda2_identifiers.Int_ids.Const.t -> 'a) ->
  'a

val same : 
  Flambda2_identifiers.Int_ids.Simple.t ->
  Flambda2_identifiers.Int_ids.Simple.t ->
  bool

val export : 
  Flambda2_identifiers.Int_ids.Simple.t ->
  Flambda2_identifiers.Int_ids.Simple.exported

val import : 
  Flambda2_identifiers.Int_ids.Simple.exported ->
  Flambda2_identifiers.Int_ids.Simple.t

Module Int_ids.Simple

Module `Int_ids.Simple`