jon.recoil.org

Module Flambda2_identifiers.Code_id

include module type of struct include Int_ids.Code_id end
type exported = Int_ids.Code_id.exported
include Flambda2_algorithms.Container_types.S 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 = Int_ids.Code_id.Set
module Map = Int_ids.Code_id.Map
module Lmap = Int_ids.Code_id.Lmap
val initialise : unit -> unit
val create : name:string -> debug:Debuginfo.t -> Compilation_unit.t -> t
val get_compilation_unit : t -> Compilation_unit.t
val in_compilation_unit : t -> Compilation_unit.t -> bool
val is_imported : t -> bool
val linkage_name : t -> Linkage_name.t
val name : t -> string
val rename : t -> t
val invert_map : t Map.t -> t Map.t
val export : t -> exported
val import : exported -> t