jon.recoil.org

Module Flambda_kind.Standard_int_or_float

type t =
  1. | Tagged_immediate
  2. | Naked_immediate
  3. | Naked_float32
  4. | Naked_float
  5. | Naked_int8
  6. | Naked_int16
  7. | Naked_int32
  8. | Naked_int64
  9. | Naked_nativeint

The same as Standard_int, but also permitting naked floats.

val of_standard_int : Standard_int.t -> t
val to_kind : t -> kind
val to_kind_with_subkind : t -> With_subkind.t
val print_lowercase : Format.formatter -> t -> unit
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