Set_of_closures (p.oxcaml-compiler.5.2.0minus39.doc.compiler-libs.optcomp.Flambda2_terms.Set_of

type t

include Expr_std.S with type t := t

include Flambda2_nominal.Contains_names.S with type t := t

val free_names : t -> Flambda2_nominal.Name_occurrences.t

Compute the free names of a term. Such computation covers all kinds of bindable names (variables, continuations, ...)

val apply_renaming : t -> Flambda2_nominal.Renaming.t -> t

Apply a renaming throughout a term.

include Flambda2_nominal.Contains_ids.S with type t := t

val ids_for_export : t -> Flambda2_nominal.Ids_for_export.t

Gather all table identifiers to export them.

val is_empty : t -> bool

val create : 
  value_slots:
    Flambda2_term_basics.Simple.t Flambda2_identifiers.Value_slot.Map.t ->
  Flambda2_bound_identifiers.Alloc_mode.For_allocations.t ->
  Function_declarations.t ->
  t

Create a set of closures given the code for its functions and the closure variables.

val function_decls : t -> Function_declarations.t

The function declarations associated with the set of closures.

val value_slots : 
  t ->
  Flambda2_term_basics.Simple.t Flambda2_identifiers.Value_slot.Map.t

The values of each value slot (the environment, or captured variables).

val is_closed : t -> bool

Returns true iff the given set of closures has no value slots.

val alloc_mode : t -> Flambda2_bound_identifiers.Alloc_mode.For_allocations.t

val filter_function_declarations : 
  t ->
  f:
    (Flambda2_identifiers.Function_slot.t ->
      Function_declarations.code_id_in_function_declaration ->
      bool) ->
  t

include Flambda2_algorithms.Container_types.S 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
    with type key = t
     and module Set = Set