Module Flambda2_terms.Apply_cont_expr

The representation of the application of a continuation. In the zero-arity case this is just "goto".

type t
include Expr_std.S with type t := t
include Flambda2_nominal.Contains_names.S with type t := 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 args : t -> Flambda2_term_basics.Simple.t list
val trap_action : t -> Trap_action.t option
val debuginfo : t -> Debuginfo.t
val with_continuation : t -> Flambda2_identifiers.Continuation.t -> t
val with_continuation_and_args : t -> Flambda2_identifiers.Continuation.t -> args:Flambda2_term_basics.Simple.t list -> t
val update_args : t -> args:Flambda2_term_basics.Simple.t list -> t
val with_debuginfo : t -> dbg:Debuginfo.t -> t
val is_raise : t -> bool
val is_goto : t -> bool
val clear_trap_action : t -> t
val to_one_arg_without_trap_action : t -> Flambda2_term_basics.Simple.t option

Note that compare ignores the Debuginfo.t.

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 Map : Flambda2_algorithms.Container_types_intf.Map with type key = t and module Set = Set