Module Flambda_kind.With_subkind
module Nullable : sig ... endmodule Non_null_value_subkind : sig ... endtype t = full_kindval create : kind -> Non_null_value_subkind.t -> Nullable.t -> tval non_null_value_subkind : t -> Non_null_value_subkind.tval nullable : t -> Nullable.tval has_useful_subkind_info : t -> boolval any_value : 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 boxed_float : tval boxed_int32 : tval boxed_int64 : tval boxed_nativeint : tval boxed_vec128 : tval tagged_immediate : tval rec_info : tval float_array : tval immediate_array : tval value_array : tval generic_array : tval unboxed_vec128_array : tval unboxed_vec256_array : tval unboxed_vec512_array : tval unboxed_product_array : tval float_block : num_fields:int -> tval of_naked_number_kind : Naked_number_kind.t -> tval naked_of_boxable_number : Boxable_number.t -> tval boxed_of_boxable_number : Boxable_number.t -> tval from_lambda_value_kind :
Lambda.value_kind ->
machine_width:Target_system.Machine_width.t ->
tval from_lambda_values_and_unboxed_numbers_only :
Lambda.layout ->
machine_width:Target_system.Machine_width.t ->
tinclude 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 = tval must_be_gc_scannable : t -> bool