Int.SS is a generic interface for fixed-size integers.
include Sexplib0.Sexpable.S__stack with type t := tinclude Sexplib0.Sexpable.Of_sexp with type t := tinclude Sexplib0.Sexpable.Sexp_of__stack with type t := tval t_sexp_grammar : t Sexplib0.Sexp_grammar.t @@ portableinclude Floatable.S_local_input with type t := tval of_float : float @ local -> tval to_float : t @ local -> floatinclude Identifiable.S__local__portable with type t := tinclude Ppx_hash_lib.Hashable.S_any with type t := tval hash_fold_t : t Ppx_hash_lib.hash_foldval hash : t -> Ppx_hash_lib.Std.Hash.hash_valueinclude Sexplib0.Sexpable.S with type t := tinclude Sexplib0.Sexpable.Of_sexp with type t := tval t_of_sexp : Sexplib0.Sexp.t -> tinclude Sexplib0.Sexpable.Sexp_of with type t := tval sexp_of_t : t -> Sexplib0.Sexp.tinclude Stringable.S with type t := tinclude Comparable.S__local__portable with type t := tinclude Comparisons.S__local with type t := tcompare t1 t2 returns 0 if t1 is equal to t2, a negative integer if t1 is less than t2, and a positive integer if t1 is greater than t2.
ascending is identical to compare. descending x y = ascending y x. These are intended to be mnemonic when used like List.sort ~compare:ascending and List.sort ~cmp:descending, since they cause the list to be sorted in ascending or descending order, respectively.
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 Or_error.t @@ portableinclude Comparator.S__portable with type t := tval comparator : (t, comparator_witness) Comparator.T.comparatorinclude Pretty_printer.S with type t := tval pp : Formatter.t -> t -> unitval hashable : t Hashable.tinclude Stringable.S_local_input with type t := tval of_string : string @ local -> tval to_string : t @ local -> stringinclude Invariant.S with type t := tval invariant : t -> unitmodule Hex : sig ... endmodule Binary : sig ... endval of_string_opt : string @ local -> t optionval to_string_hum : ?delimiter:char -> t @ local -> stringdelimiter is an underscore by default.
val zero : tval one : tval minus_one : tNegation
There are two pairs of integer division and remainder functions, /% and %, and / and rem. They both satisfy the same equation relating the quotient and the remainder:
x = (x /% y * y) + (x % y);
x = (x / y * y) + rem x yThe functions return the same values if x and y are positive. They all raise if y = 0.
The functions differ if x < 0 or y < 0.
If y < 0, then % and /% raise, whereas / and rem do not.
x % y always returns a value between 0 and y - 1, even when x < 0. On the other hand, rem x y returns a negative value if and only if x < 0; that value satisfies abs (rem x y) <= abs y - 1.
round rounds an int to a multiple of a given to_multiple_of argument, according to a direction dir, with default dir being `Nearest. round will raise if to_multiple_of <= 0. If the result overflows (too far positive or too far negative), round returns an incorrect result.
| `Down | rounds toward Int.neg_infinity | | `Up | rounds toward Int.infinity | | `Nearest | rounds to the nearest multiple, or `Up in case of a tie | | `Zero | rounds toward zero |
Here are some examples for round ~to_multiple_of:10 for each direction:
| `Down | {10 .. 19} --> 10 | { 0 ... 9} --> 0 | {-10 ... -1} --> -10 |
| `Up | { 1 .. 10} --> 10 | {-9 ... 0} --> 0 | {-19 .. -10} --> -10 |
| `Zero | {10 .. 19} --> 10 | {-9 ... 9} --> 0 | {-19 .. -10} --> -10 |
| `Nearest | { 5 .. 14} --> 10 | {-5 ... 4} --> 0 | {-15 ... -6} --> -10 |For convenience and performance, there are variants of round with dir hard-coded. If you are writing performance-critical code you should use these.
Returns the absolute value of the argument. May be negative if the input is min_value.
Like abs, but for locally-allocated values. If the argument is already positive, then this is the identity (as is abs itself).
pow base exponent returns base raised to the power of exponent. It is OK if base <= 0. pow raises if exponent < 0, or an integer overflow would occur.
These are identical to land, lor, etc. except they're not infix and have different names.
Returns the number of 1 bits in the binary representation of the input.
The results are unspecified for negative shifts and shifts >= num_bits.
val of_int32_exn : int32 -> tval to_int32_exn : t -> int32val of_int64_exn : int64 -> tval to_int64 : t -> int64val of_nativeint_exn : nativeint -> tval to_nativeint_exn : t -> nativeintval of_local_int32_exn : int32 @ local -> t @ localval to_local_int32_exn : t @ local -> int32 @ localval of_local_int64_exn : int64 @ local -> t @ localval to_local_int64 : t @ local -> int64 @ localval of_local_nativeint_exn : nativeint @ local -> t @ localval to_local_nativeint_exn : t @ local -> nativeint @ localval of_float_unchecked : float @ local -> tof_float_unchecked truncates the given floating point number to an integer, rounding towards zero. The result is unspecified if the argument is nan or falls outside the range of representable integers.
module Summable : sig ... endval num_bits : tThe number of bits available in this integer type. Note that the integer representations are signed.
val max_value : tThe largest representable integer.
val min_value : tThe smallest representable integer.
Shifts right, filling in with zeroes, which will not preserve the sign of the input.
ceil_pow2 x returns the smallest power of 2 that is greater than or equal to x. The implementation may only be called for x > 0. Example: ceil_pow2 17 = 32
floor_pow2 x returns the largest power of 2 that is less than or equal to x. The implementation may only be called for x > 0. Example: floor_pow2 17 = 16
ceil_log2 x returns the ceiling of log-base-2 of x, and raises if x <= 0.
floor_log2 x returns the floor of log-base-2 of x, and raises if x <= 0.
val is_pow2 : t @ local -> boolis_pow2 x returns true iff x is a power of 2. is_pow2 raises if x <= 0.
Returns the number of leading zeros in the binary representation of the input, as an integer between 0 and one less than num_bits.
The results are unspecified for t = 0.
Returns the number of trailing zeros in the binary representation of the input, as an integer between 0 and one less than num_bits.
The results are unspecified for t = 0.
module O : sig ... endA sub-module designed to be opened to make working with ints more convenient.