Module Core.Timing_wheel_float.Interval_num

module Span : sig ... end
type t = private Core_kernel.Timing_wheel_ns_intf.Int63.t
include sig ... end
val sexp_of_t : t ‑> Sexplib.Sexp.t
include Core_kernel.Comparable.S with type t := t
include Core_kernel__.Comparable_intf.S_common
include Base.Comparable_intf.S
include Base.Comparable_intf.Polymorphic_compare
include Base.Polymorphic_compare_intf.Infix
type t
val (>=) : t ‑> t ‑> bool
val (<=) : t ‑> t ‑> bool
val (=) : t ‑> t ‑> bool
val (>) : t ‑> t ‑> bool
val (<) : t ‑> t ‑> bool
val (<>) : t ‑> t ‑> bool
val equal : t ‑> t ‑> bool
val compare : t ‑> t ‑> int

-1 means "less than", 0 means "equal", 1 means "greater than", and other values should not be returned

val min : t ‑> t ‑> t
val max : t ‑> t ‑> t
val ascending : t ‑> t ‑> int

ascending is identical to compare. descending x y = ascending y x. These are intended to be mnemonic when used like List.sort ~cmp:ascending and List.sort ~cmp:descending, since they cause the list to be sorted in ascending or descending order, respectively.

val descending : t ‑> t ‑> int
val between : t ‑> low:t ‑> high:t ‑> bool
val clamp_exn : t ‑> min:t ‑> max:t ‑> t

clamp_exn t ~min ~max returns t', the closest value to t such that between t' ~low:min ~high:max is true.

Raises if not (min <= max).

val clamp : t ‑> min:t ‑> max:t ‑> t Base.Or_error.t
include Base.Comparator.S with type t := t
type t
type comparator_witness
include Base.Comparable_intf.Validate with type t := t
type t
val validate_lbound : min:t Base.Maybe_bound.t ‑> t Base.Validate.check
val validate_ubound : max:t Base.Maybe_bound.t ‑> t Base.Validate.check
val validate_bound : min:t Base.Maybe_bound.t ‑> max:t Base.Maybe_bound.t ‑> t Base.Validate.check
include Core_kernel.Hashable.S with type t := t
include Core_kernel.Hashable.Common
type t
val hash : t ‑> Core_kernel__.Import.int
val compare : t ‑> t ‑> Core_kernel__.Import.int
module Hash_set : Core_kernel.Hash_set.S with type elt = t
val max : t ‑> t ‑> t
val min : t ‑> t ‑> t
val zero : t
val one : t
val min_value : t
val max_value : t
val max_representable : t

To avoid issues with arithmetic overflow, the implementation restricts interval numbers to be <= max_representable, where:


        max_representable = 1 lsl Level_bits.max_num_bits - 1
val of_int63 : Core_kernel.Timing_wheel_ns_intf.Int63.t ‑> t
val to_int63 : t ‑> Core_kernel.Timing_wheel_ns_intf.Int63.t
val of_int : Core_kernel__.Import.int ‑> t
val to_int_exn : t ‑> Core_kernel__.Import.int
val add : t ‑> Span.t ‑> t
val sub : t ‑> Span.t ‑> t
val diff : t ‑> t ‑> Span.t
val succ : t ‑> t
val pred : t ‑> t
val rem : t ‑> Span.t ‑> Span.t