Module Flambda.Static_const_or_code
include Flambda2_algorithms.Container_types.S
with type t := Flambda2_terms.Flambda.Static_const_or_code.t
module T :
Flambda2_algorithms.Container_types_intf.Thing
with type t = Flambda2_terms.Flambda.Static_const_or_code.tinclude Flambda2_algorithms.Container_types_intf.Thing
with type t := Flambda2_terms.Flambda.Static_const_or_code.T.t
include Stdlib.Hashtbl.HashedType
with type t := Flambda2_terms.Flambda.Static_const_or_code.T.t
val equal :
Flambda2_terms.Flambda.Static_const_or_code.T.t ->
Flambda2_terms.Flambda.Static_const_or_code.T.t ->
boolThe equality predicate used to compare keys.
val hash : Flambda2_terms.Flambda.Static_const_or_code.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 := Flambda2_terms.Flambda.Static_const_or_code.T.t
val compare :
Flambda2_terms.Flambda.Static_const_or_code.T.t ->
Flambda2_terms.Flambda.Static_const_or_code.T.t ->
intA 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.
module Set :
Flambda2_algorithms.Container_types_intf.Set
with type elt = Flambda2_terms.Flambda.Static_const_or_code.tmodule Map :
Flambda2_algorithms.Container_types_intf.Map
with type key = Flambda2_terms.Flambda.Static_const_or_code.t
and module Set = Flambda2_terms.Flambda.Static_const_or_code.Setinclude Flambda2_nominal.Contains_names.S
with type t := Flambda2_terms.Flambda.Static_const_or_code.t
val free_names :
Flambda2_terms.Flambda.Static_const_or_code.t ->
Flambda2_nominal.Name_occurrences.tCompute the free names of a term. Such computation covers all kinds of bindable names (variables, continuations, ...)
val apply_renaming :
Flambda2_terms.Flambda.Static_const_or_code.t ->
Flambda2_nominal.Renaming.t ->
Flambda2_terms.Flambda.Static_const_or_code.tApply a renaming throughout a term.
include Flambda2_nominal.Contains_ids.S
with type t := Flambda2_terms.Flambda.Static_const_or_code.t
val ids_for_export :
Flambda2_terms.Flambda.Static_const_or_code.t ->
Flambda2_nominal.Ids_for_export.tGather all table identifiers to export them.
val print :
Stdlib.Format.formatter ->
Flambda2_terms.Flambda.Static_const_or_code.t ->
unitval is_fully_static : Flambda2_terms.Flambda.Static_const_or_code.t -> boolval is_block : Flambda2_terms.Flambda.Static_const_or_code.t -> boolval is_set_of_closures : Flambda2_terms.Flambda.Static_const_or_code.t -> boolval is_code : Flambda2_terms.Flambda.Static_const_or_code.t -> boolval deleted_code : Flambda2_terms.Flambda.Static_const_or_code.tval create_static_const :
Flambda2_terms.Static_const.t ->
Flambda2_terms.Flambda.Static_const_or_code.t