Module Flambda2_terms.Set_of_closures
include Flambda2_terms.Expr_std.S
with type t := Flambda2_terms.Set_of_closures.t
include Flambda2_nominal.Contains_names.S
with type t := Flambda2_terms.Set_of_closures.t
val free_names :
Flambda2_terms.Set_of_closures.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.Set_of_closures.t ->
Flambda2_nominal.Renaming.t ->
Flambda2_terms.Set_of_closures.tApply a renaming throughout a term.
include Flambda2_nominal.Contains_ids.S
with type t := Flambda2_terms.Set_of_closures.t
val ids_for_export :
Flambda2_terms.Set_of_closures.t ->
Flambda2_nominal.Ids_for_export.tGather all table identifiers to export them.
val is_empty : Flambda2_terms.Set_of_closures.t -> boolval create :
value_slots:
Flambda2_term_basics.Simple.t Flambda2_identifiers.Value_slot.Map.t ->
Flambda2_term_basics.Alloc_mode.For_allocations.t ->
Flambda2_terms.Function_declarations.t ->
Flambda2_terms.Set_of_closures.tCreate a set of closures given the code for its functions and the closure variables.
val function_decls :
Flambda2_terms.Set_of_closures.t ->
Flambda2_terms.Function_declarations.tThe function declarations associated with the set of closures.
val value_slots :
Flambda2_terms.Set_of_closures.t ->
Flambda2_term_basics.Simple.t Flambda2_identifiers.Value_slot.Map.tThe values of each value slot (the environment, or captured variables).
val is_closed : Flambda2_terms.Set_of_closures.t -> boolReturns true iff the given set of closures has no value slots.
val alloc_mode :
Flambda2_terms.Set_of_closures.t ->
Flambda2_term_basics.Alloc_mode.For_allocations.tval filter_function_declarations :
Flambda2_terms.Set_of_closures.t ->
f:
(Flambda2_identifiers.Function_slot.t ->
Flambda2_terms.Function_declarations.code_id_in_function_declaration ->
bool) ->
Flambda2_terms.Set_of_closures.tinclude Flambda2_algorithms.Container_types.S
with type t := Flambda2_terms.Set_of_closures.t
module T :
Flambda2_algorithms.Container_types_intf.Thing
with type t = Flambda2_terms.Set_of_closures.tinclude Flambda2_algorithms.Container_types_intf.Thing
with type t := Flambda2_terms.Set_of_closures.T.t
include Stdlib.Hashtbl.HashedType
with type t := Flambda2_terms.Set_of_closures.T.t
val equal :
Flambda2_terms.Set_of_closures.T.t ->
Flambda2_terms.Set_of_closures.T.t ->
boolThe equality predicate used to compare keys.
val hash : Flambda2_terms.Set_of_closures.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.Set_of_closures.T.t
val compare :
Flambda2_terms.Set_of_closures.T.t ->
Flambda2_terms.Set_of_closures.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.
val print :
Stdlib.Format.formatter ->
Flambda2_terms.Set_of_closures.T.t ->
unitmodule Set :
Flambda2_algorithms.Container_types_intf.Set
with type elt = Flambda2_terms.Set_of_closures.tmodule Map :
Flambda2_algorithms.Container_types_intf.Map
with type key = Flambda2_terms.Set_of_closures.t
and module Set = Flambda2_terms.Set_of_closures.Set