Module Flambda2_terms.Exn_continuation
Exception continuations for function calls, etc.
We allow exception handlers that have not only the exception bucket argument but also a sequence of "extra arguments".
include Flambda2_algorithms.Container_types.S
with type t := Flambda2_terms.Exn_continuation.t
module T :
Flambda2_algorithms.Container_types_intf.Thing
with type t = Flambda2_terms.Exn_continuation.tinclude Flambda2_algorithms.Container_types_intf.Thing
with type t := Flambda2_terms.Exn_continuation.T.t
include Stdlib.Hashtbl.HashedType
with type t := Flambda2_terms.Exn_continuation.T.t
val equal :
Flambda2_terms.Exn_continuation.T.t ->
Flambda2_terms.Exn_continuation.T.t ->
boolThe equality predicate used to compare keys.
val hash : Flambda2_terms.Exn_continuation.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.Exn_continuation.T.t
val compare :
Flambda2_terms.Exn_continuation.T.t ->
Flambda2_terms.Exn_continuation.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.Exn_continuation.tmodule Map :
Flambda2_algorithms.Container_types_intf.Map
with type key = Flambda2_terms.Exn_continuation.t
and module Set = Flambda2_terms.Exn_continuation.Setinclude Flambda2_terms.Expr_std.S
with type t := Flambda2_terms.Exn_continuation.t
val print :
Stdlib.Format.formatter ->
Flambda2_terms.Exn_continuation.t ->
unitinclude Flambda2_nominal.Contains_names.S
with type t := Flambda2_terms.Exn_continuation.t
val free_names :
Flambda2_terms.Exn_continuation.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.Exn_continuation.t ->
Flambda2_nominal.Renaming.t ->
Flambda2_terms.Exn_continuation.tApply a renaming throughout a term.
include Flambda2_nominal.Contains_ids.S
with type t := Flambda2_terms.Exn_continuation.t
val ids_for_export :
Flambda2_terms.Exn_continuation.t ->
Flambda2_nominal.Ids_for_export.tGather all table identifiers to export them.
val create :
exn_handler:Flambda2_identifiers.Continuation.t ->
extra_args:
(Flambda2_term_basics.Simple.t * Flambda2_kinds.Flambda_kind.With_subkind.t)
list ->
Flambda2_terms.Exn_continuation.tCreate an exception continuation.
val exn_handler :
Flambda2_terms.Exn_continuation.t ->
Flambda2_identifiers.Continuation.tThe exception handler itself.
val extra_args :
Flambda2_terms.Exn_continuation.t ->
(Flambda2_term_basics.Simple.t * Flambda2_kinds.Flambda_kind.With_subkind.t)
listAny extra arguments together with their kinds.
val arity :
Flambda2_terms.Exn_continuation.t ->
[> `Unarized ] Flambda2_kinds.Flambda_arity.tThe arity of the given exception continuation, taking into account both the exception bucket argument and any extra_args.
val with_exn_handler :
Flambda2_terms.Exn_continuation.t ->
Flambda2_identifiers.Continuation.t ->
Flambda2_terms.Exn_continuation.tval without_extra_args :
Flambda2_terms.Exn_continuation.t ->
Flambda2_terms.Exn_continuation.t