Module Int64_uSource

Utilities for unboxed int64s. This module is mostly a copy of Base's Int64 module, but with much functionality missing because it can't yet be implemented for unboxed int64s or unboxed types generally.

It's part of the same family of libraries as `lib/float_u`, `lib/nativeint_u`, and `lib/int32_u`. They share similar project structures, conventions, and tests.

Sourceval globalize : t @ local -> t
include Ppx_quickcheck_runtime.Quickcheckable.S with type t := t
Sourceval quickcheck_generator : t Base_quickcheck.Generator.t
Sourceval quickcheck_observer : t Base_quickcheck.Observer.t
Sourceval quickcheck_shrinker : t Base_quickcheck.Shrinker.t
Sourcemodule Boxed = Base.Int64

These definitions are available. They're included from O below.

  external box : int64# -> (int64[@local_opt]) = "%box_int64"
  external unbox : (int64[@local_opt]) -> int64# = "%unbox_int64"

Synonyms for box and unbox.

Sourceval to_int64 : Base.int64# -> Base.int64 @@ portable
Sourceval of_int64 : Base.int64 -> Base.int64# @@ portable

Int_intf.S inlined

Sourceval of_float : Base.float# -> t @@ portable [@@zero_alloc]
Sourceval to_float : t -> Base.float# @@ portable [@@zero_alloc]

Inlined from Intable

Sourceval of_int_exn : Base.int -> t @@ portable [@@zero_alloc]
Sourceval to_int_exn : t -> Base.int @@ portable [@@zero_alloc]

Inlined from Identifiable

Inlined from Sexpable

Sourceval sexp_of_t : t -> Base.Sexp.t @@ portable
Sourceval t_of_sexp : Base.Sexp.t -> t @@ portable
Sourceval t_sexp_grammar : t Sexplib0.Sexp_grammar.t @@ portable

For bin_io

include Bin_prot.Binable.S__local with type t := t
include Bin_prot.Binable.S_only_functions__local with type t := t
include sig ... end
Sourceval bin_size_t : t Bin_prot.Size.sizer
Sourceval bin_write_t : t Bin_prot.Write.writer
Sourceval bin_read_t : t Bin_prot.Read.reader
Sourceval __bin_read_t__ : t Bin_prot.Read.vtag_reader

This function only needs implementation if t exposed to be a polymorphic variant. Despite what the type reads, this does *not* produce a function after reading; instead it takes the constructor tag (int) before reading and reads the rest of the variant t afterwards.

Sourceval bin_shape_t : Bin_prot.Shape.t

For hash

include Ppx_hash_lib.Hashable.S with type t := t

From Typerep

Sourceval typerep_of_t : t Typerep_lib.Std.Typerep.t @@ portable

Inlined from Stringable

Sourceval of_string : Base.string @ local -> t @@ portable
Sourceval to_string : t -> Base.string @@ portable
Sourceval equal : t -> t -> Base.bool @@ portable [@@zero_alloc]
Sourceval compare : t -> t -> Base.int @@ portable [@@zero_alloc]

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.

Sourceval min : t -> t -> t @@ portable [@@zero_alloc]
Sourceval max : t -> t -> t @@ portable [@@zero_alloc]
Sourceval ascending : t -> t -> Base.int @@ portable [@@zero_alloc]

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.

Sourceval descending : t -> t -> Base.int @@ portable [@@zero_alloc]
Sourceval between : t -> low:t -> high:t -> Base.bool @@ portable [@@zero_alloc]

between t ~low ~high means low <= t <= high

Sourceval clamp_exn : t -> min:t -> max:t -> t @@ portable [@@zero_alloc]

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).

Sourceval clamp_unchecked : t -> min:t -> max:t -> t @@ portable [@@zero_alloc]

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

Undefined result if not (min <= max).

Inlined from Pretty_printer

Sourceval pp : Base.Formatter.t -> t -> Base.unit @@ portable

Inlined from Comparable.With_zero

Sourceval is_positive : t -> Base.bool @@ portable [@@zero_alloc]
Sourceval is_non_negative : t -> Base.bool @@ portable [@@zero_alloc]
Sourceval is_negative : t -> Base.bool @@ portable [@@zero_alloc]
Sourceval is_non_positive : t -> Base.bool @@ portable [@@zero_alloc]
Sourceval sign : t -> Base.Sign.t @@ portable [@@zero_alloc]

Returns Neg, Zero, or Pos in a way consistent with the above functions.

Sourceval invariant : t -> Base.unit @@ portable [@@zero_alloc]

Inlined from Invariant.S

Sourceval to_string_hum : ?delimiter:Base.char -> t -> Base.string @@ portable

delimiter is an underscore by default.

Infix operators and constants

Sourceval one : t @@ portable
Sourceval minus_one : t @@ portable
Sourceval rem : t -> t -> t @@ portable [@@zero_alloc]

Other common functions

Inlined from Round

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.

Sourceval round : ?dir:[ `Zero | `Nearest | `Up | `Down ] -> t -> to_multiple_of:t -> t @@ portable
Sourceval round_down : t -> to_multiple_of:t -> t @@ portable [@@zero_alloc]
Sourceval round_up : t -> to_multiple_of:t -> t @@ portable [@@zero_alloc]
Sourceval round_nearest : t -> to_multiple_of:t -> t @@ portable [@@zero_alloc]

Successor and predecessor functions

Sourceval succ : t -> t @@ portable [@@zero_alloc]
Sourceval pred : t -> t @@ portable [@@zero_alloc]

Exponentiation

Sourceval pow : t -> t -> t @@ portable [@@zero_alloc]

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

Sourceval bit_and : t -> t -> t @@ portable [@@zero_alloc]

These are identical to land, lor, etc. except they're not infix and have different names.

Sourceval bit_or : t -> t -> t @@ portable [@@zero_alloc]
Sourceval bit_xor : t -> t -> t @@ portable [@@zero_alloc]
Sourceval bit_not : t -> t @@ portable [@@zero_alloc]
Sourceval popcount : t -> t @@ portable [@@zero_alloc]

Returns 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.

Sourceval shift_left : t -> Base.int -> t @@ portable [@@zero_alloc]

Shifts left, filling in with zeroes.

Sourceval shift_right : t -> Base.int -> t @@ portable [@@zero_alloc]

Shifts right, preserving the sign of the input.

Increment and decrement functions for integer references

Sourceval of_int32_exn : Base.int32 -> t @@ portable [@@zero_alloc]
Sourceval to_int32_exn : t -> Base.int32 @@ portable
Sourceval of_int64_exn : Base.int64 -> t @@ portable [@@zero_alloc]
Sourceval of_nativeint_exn : Base.nativeint -> t @@ portable
Sourceval to_nativeint_exn : t -> Base.nativeint @@ portable
Sourceval of_float_unchecked : Base.float# -> t @@ portable [@@zero_alloc]

of_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.

Sourceval num_bits : Base.int64 @@ portable

The number of bits available in this integer type. Note that the integer representations are signed.

Sourceval max_value : t @@ portable

The largest representable integer.

Sourceval min_value : t @@ portable

The smallest representable integer.

Sourceval shift_right_logical : t -> Base.int -> t @@ portable [@@zero_alloc]

Shifts right, filling in with zeroes, which will not preserve the sign of the input.

Sourceval ceil_pow2 : t -> t @@ portable [@@zero_alloc]

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

Sourceval floor_pow2 : t -> t @@ portable [@@zero_alloc]

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

Sourceval ceil_log2 : t -> t @@ portable [@@zero_alloc]

ceil_log2 x returns the ceiling of log-base-2 of x, and raises if x <= 0.

Sourceval floor_log2 : t -> t @@ portable [@@zero_alloc]

floor_log2 x returns the floor of log-base-2 of x, and raises if x <= 0.

Sourceval is_pow2 : t -> Base.bool @@ portable [@@zero_alloc]

is_pow2 x returns true iff x is a power of 2. is_pow2 raises if x <= 0.

Sourceval clz : t -> t @@ portable [@@zero_alloc]

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.

Sourceval ctz : t -> t @@ portable [@@zero_alloc]

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.

Sourceval range : t -> f:(t -> Base.unit) @ local -> Base.unit @@ portable

range n ~f runs f i for 0 <= i < n. Analogous to python's for x in range(n).

Sourceval range_rev : t -> f:(t -> Base.unit) @ local -> Base.unit @@ portable

range_rev n ~f runs f i for 0 <= i < n, but in reverse. Analogous to python's for x in reversed(range(n)).

Sourceval for_loop : start_incl:t -> end_excl:t -> f:(t -> Base.unit) @ local -> Base.unit @@ portable

Runs f i for start_incl <= i < end_excl. "C for loop" semantics.

Sourceval for_loop_incl : start_incl:t -> end_incl:t -> f:(t -> Base.unit) @ local -> Base.unit @@ portable

Runs f i for start_incl <= i <= end_incl. "OCaml for loop" semantics, and generates less efficient code than for_loop.

Sourcemodule O : sig ... end

A sub-module designed to be opened to make working with ints more convenient.

Sourceval (+) : t -> t -> t [@@zero_alloc]
Sourceval (-) : t -> t -> t [@@zero_alloc]
Sourceval (*) : t -> t -> t [@@zero_alloc]
Sourceval (/) : t -> t -> t [@@zero_alloc]
Sourceval (~-) : t -> t [@@zero_alloc]
Sourceval (**) : t -> t -> t

Integer exponentiation

Sourceval (=) : t -> t -> Base.bool [@@zero_alloc]
Sourceval (<>) : t -> t -> Base.bool [@@zero_alloc]
Sourceval (<) : t -> t -> Base.bool [@@zero_alloc]
Sourceval (>) : t -> t -> Base.bool [@@zero_alloc]
Sourceval (<=) : t -> t -> Base.bool [@@zero_alloc]
Sourceval (>=) : t -> t -> Base.bool [@@zero_alloc]
Sourceval (land) : t -> t -> t [@@zero_alloc]

Same as bit_and/or/xor/not

Sourceval (lor) : t -> t -> t [@@zero_alloc]
Sourceval (lxor) : t -> t -> t [@@zero_alloc]
Sourceval lnot : t -> t [@@zero_alloc]
Sourceval abs : t -> t [@@zero_alloc]

Returns the absolute value of the argument. May be negative if the input is min_value.

Sourceval neg : t -> t [@@zero_alloc]

Negation

Sourceval zero : t

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.

Sourceval (%) : t -> t -> t [@@zero_alloc]
Sourceval (/%) : t -> t -> t [@@zero_alloc]
Sourceval (//) : t -> t -> Base.float# [@@zero_alloc]

Float division of integers.

Sourceval (lsl) : t -> Base.int -> t [@@zero_alloc]

Same as shift_left

Sourceval (asr) : t -> Base.int -> t [@@zero_alloc]

Same as shift_right.

Sourceval (lsr) : t -> Base.int -> t [@@zero_alloc]

Same as shift_right_logical.

Conversion functions

Sourceval of_int : Base.int -> t @@ portable [@@zero_alloc]
Sourceval of_int32 : Base.int32 -> t @@ portable [@@zero_alloc]
Sourceval to_int : t -> Base.int Base.option @@ portable
Sourceval to_int32 : t -> Base.int32 Base.option @@ portable
Sourceval of_nativeint : Base.nativeint -> t @@ portable [@@zero_alloc]
Sourceval to_nativeint : t -> Base.nativeint Base.option @@ portable
Sourceval of_bool : Base.bool -> t @@ portable [@@zero_alloc]

Truncating conversions

These functions return the least-significant bits of the input. In cases where optional conversions return Some x, truncating conversions return x.

Sourceval to_int_trunc : t -> Base.int @@ portable [@@zero_alloc]
Sourceval to_int32_trunc : t -> Base.int32 @@ portable
Sourceval to_nativeint_trunc : t -> Base.nativeint @@ portable

Low-level float conversions

Sourceval bits_of_float : Base.float# -> t @@ portable [@@zero_alloc]
Sourceval float_of_bits : t -> Base.float# @@ portable [@@zero_alloc]

Byte- and bit-swap operations

See Int's byte swap section for a description of Base's approach to exposing byte swap primitives.

As of writing, these operations do not sign extend unnecessarily on 64 bit machines, unlike their int32 counterparts, and hence, are more performant. See the Int32 module for more details of the overhead entailed by the int32 byteswap functions.

Sourceval bswap16 : t -> t @@ portable [@@zero_alloc]
Sourceval bswap32 : t -> t @@ portable [@@zero_alloc]
Sourceval bswap48 : t -> t @@ portable [@@zero_alloc]
Sourceval bswap64 : t -> t @@ portable [@@zero_alloc]
Sourceval rev_bits : t -> t @@ portable [@@zero_alloc]

Reverses the bits.

Sourceval select : Base.bool -> t -> t -> t @@ portable [@@zero_alloc]

Branchless, as Bool.select.

Indexing into an array

Sourcemodule Array_index : sig ... end
Sourcemodule Iarray_index : sig ... end

An array of _ : bits64

Sourcemodule Array : sig ... end
Sourcemodule Stable : sig ... end
Sourcemodule Ref : sig ... end
Sourcemodule Hex_unsigned : sig ... end

Prints -#0x1L as 0xffffffffffffffff, not -0x1.

Sourcemodule Option : sig ... end

This allows us to represent t option without allocating for Some _ tags. Some min_value is not representable because its representation would overlap with the representation of None.