Module Flambda2_kinds.Flambda_kind
Kinds and subkinds of Flambda types.
module Naked_number_kind : sig ... endtype t = private | Value(*OCaml values, either immediates or pointers.
*)| Naked_number of Naked_number_kind.t(*The kind of unboxed numbers and untagged immediates.
*)| Region(*Values which have been introduced by Flambda and are never accessible at the source language level (for example sets of closures).
*)| Rec_info(*Recursion depths of identifiers. Like
*)Region, not accessible at the source level, but also not accessible at run time.
The kinds themselves.
type kind = tval value : tConstructors for the various kinds.
val naked_number : Naked_number_kind.t -> tval naked_immediate : tval naked_float32 : tval naked_float : tval naked_int8 : tval naked_int16 : tval naked_int32 : tval naked_int64 : tval naked_nativeint : tval naked_vec128 : tval naked_vec256 : tval naked_vec512 : tval region : tval rec_info : tval is_value : t -> boolval is_naked_float : t -> boolinclude Flambda2_algorithms.Container_types.S with type t := t
module T : Flambda2_algorithms.Container_types_intf.Thing with type t = tinclude Flambda2_algorithms.Container_types_intf.Thing with type t := T.t
include Hashtbl.HashedType with type t := T.t
val hash : 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 Map.OrderedType with type t := T.t
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 -> unitmodule Set : Flambda2_algorithms.Container_types_intf.Set with type elt = tmodule Mixed_block_lambda_shape = Mixed_block_shapemodule Mixed_block_shape : sig ... endmodule Scannable_block_shape : sig ... endmodule Block_shape : sig ... endmodule Standard_int : sig ... endmodule Boxable_number : sig ... endThese kinds are those of the numbers for which a tailored boxed representation exists.
module With_subkind : sig ... endmodule Flat_suffix_element : sig ... endmodule Standard_int_or_float : sig ... end