package base
- Overview
- No Docs
You can search for identifiers within the package.
in-package search v0.2.0
- Infix operators and constants
- Other common functions
- Successor and predecessor functions
- Exponentiation
- Bit-wise logical operations
- Bit-shifting operations
- Increment and decrement functions for integer references
- Conversion functions to related integer types
- Arithmetic with overflow
- Conversion functions
- Random generation
Install
dune-project
Dependency
Authors
Maintainers
Sources
sha256=0aa8fa8778412c67c38d40e9859bfa5871c4f9c25991f09fea201ae6aaf1d0d9
md5=7150e848a730369a2549d01645fb6c72
doc/base/Base/Int63/index.html
Module Base.Int63
63-bit integers.
The size of Int63 is always 63 bits. On a 64-bit platform it is just an int (63-bits), and on a 32-bit platform it is an int64 wrapped to respect the semantics of 63-bit integers.
Because Int63 has different representations on 32-bit and 64-bit platforms, marshalling Int63 will not work between 32-bit and 64-bit platforms -- unmarshal will segfault.
In 64-bit architectures, we expose type t = private int so that the compiler can omit caml_modify when dealing with record fields holding Int63.t.
Code should not explicitly make use of the private, e.g., via (i :> int), since such code will not compile on 32-bit platforms.
include Sexpable.S with type t := t
include Identifiable.S with type t := t
val hash_fold_t : Hash.state -> t -> Hash.stateval hash : t -> Hash.hash_valueinclude Comparable.S with type t := t
include Comparisons.S with type t := t
compare 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.tinclude Comparator.S with type t := t
val comparator : (t, comparator_witness) Comparator.comparatorval validate_lbound : min:t Maybe_bound.t -> t Validate.checkval validate_ubound : max:t Maybe_bound.t -> t Validate.checkval validate_bound :
min:t Maybe_bound.t ->
max:t Maybe_bound.t ->
t Validate.checkinclude Pretty_printer.S with type t := t
val pp : Formatter.t -> t -> unitinclude Comparable.With_zero with type t := t
val validate_positive : t Validate.checkval validate_non_negative : t Validate.checkval validate_negative : t Validate.checkval validate_non_positive : t Validate.checkval is_positive : t -> boolval is_non_negative : t -> boolval is_negative : t -> boolval is_non_positive : t -> boolval sign : t -> Base__.Sign0.tReturns Neg, Zero, or Pos in a way consistent with the above functions.
module Hex : sig ... endval to_string_hum : ?delimiter:char -> t -> stringdelimiter is an underscore by default.
Infix operators and constants
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 y);The 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.
Other common functions
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.
| `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.
Successor and predecessor functions
Exponentiation
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.
Bit-wise logical operations
These are identical to land, lor, etc. except they're not infix and have different names.
val popcount : t -> intReturns the number of 1 bits in the binary representation of the input.
Bit-shifting operations
The results are unspecified for negative shifts and shifts >= num_bits.
Increment and decrement functions for integer references
Conversion functions to related integer types
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_float_unchecked : float -> 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.
The 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
val ceil_log2 : t -> intceil_log2 x returns the ceiling of log-base-2 of x, and raises if x <= 0.
val is_pow2 : t -> boolis_pow2 x returns true iff x is a power of 2. is_pow2 raises if x <= 0.
module O : sig ... endA sub-module designed to be opened to make working with ints more convenient.
Arithmetic with overflow
Unlike the usual operations, these never overflow, preferring instead to raise.
module Overflow_exn : sig ... endConversion functions
val of_int : int -> tval to_int : t -> int optionval of_nativeint : nativeint -> t optionval to_nativeint : t -> nativeint optionTruncating conversions
These functions return the least-significant bits of the input. In cases where optional conversions return Some x, truncating conversions return x.
val to_int_trunc : t -> intval of_nativeint_trunc : nativeint -> tval to_nativeint_trunc : t -> nativeintRandom generation
val random : ?state:Random.State.t -> t -> trandom ~state bound returns a random integer between 0 (inclusive) and bound (exclusive). bound must be greater than 0.
The default ~state is Random.State.default.
val random_incl : ?state:Random.State.t -> t -> t -> trandom_incl ~state lo hi returns a random integer between lo (inclusive) and hi (inclusive). Raises if lo > hi.
The default ~state is Random.State.default.
val floor_log2 : t -> intfloor_log2 x returns the floor of log-base-2 of x, and raises if x <= 0.
- Infix operators and constants
- Other common functions
- Successor and predecessor functions
- Exponentiation
- Bit-wise logical operations
- Bit-shifting operations
- Increment and decrement functions for integer references
- Conversion functions to related integer types
- Arithmetic with overflow
- Conversion functions
- Random generation