Module CCInt64
Int64
Helpers for 64-bit integers.
This module provides operations on the type int64 of signed 64-bit integers. Unlike the built-in int type, the type int64 is guaranteed to be exactly 64-bit wide on all platforms. All arithmetic operations over int64 are taken modulo 264.
Performance notice: values of type int64 occupy more memory space than values of type int, and arithmetic operations on int64 are generally slower than those on int. Use int64 only when the application requires exact 64-bit arithmetic.
- since
- 0.13
Documentation for the standard Int64 module
include module type of sig ... end
val neg : int64 -> int64val add : int64 -> int64 -> int64val sub : int64 -> int64 -> int64val mul : int64 -> int64 -> int64val div : int64 -> int64 -> int64
val unsigned_rem : int64 -> int64 -> int64val succ : int64 -> int64val pred : int64 -> int64val abs : int64 -> int64val max_int : int64val min_int : int64
val logand : int64 -> int64 -> int64val logor : int64 -> int64 -> int64val logxor : int64 -> int64 -> int64
val shift_left : int64 -> int -> int64val shift_right : int64 -> int -> int64val shift_right_logical : int64 -> int -> int64val of_int : int -> int64val to_int : int64 -> int
val hash : t -> inthash xcomputes the hash ofx. LikeStdlib.abs (to_int x).
val sign : t -> intsign xreturn0ifx = 0,-1ifx < 0and1ifx > 0. Same ascompare x zero.- since
- 3.0
val pow : t -> t -> tpow base exponentreturnsbaseraised to the power ofexponent.pow x y = x^yfor positive integersxandy. RaisesInvalid_argumentifx = y = 0ory< 0.- since
- 0.11
val floor_div : t -> t -> tfloor_div x nis integer division rounding towards negative infinity. It satisfiesx = m * floor_div x n + rem x n.- since
- 3.0
type 'a printer= Stdlib.Format.formatter -> 'a -> unittype 'a random_gen= Stdlib.Random.State.t -> 'atype 'a iter= ('a -> unit) -> unit
val range_by : step:t -> t -> t -> t iterrange_by ~step i jiterates on integers fromitojincluded, where the difference between successive elements isstep. Use a negativestepfor a decreasing list.- raises Invalid_argument
if
step=0.
- since
- 3.0
val range : t -> t -> t iterrange i jiterates on integers fromitojincluded . It works both for decreasing and increasing ranges.- since
- 3.0
val range' : t -> t -> t iterrange' i jis likerangebut the second boundjis excluded. For instancerange' 0 5 = Iter.of_list [0;1;2;3;4].- since
- 3.0
val random : t -> t random_genval random_small : t random_genval random_range : t -> t -> t random_gen
Conversion
val of_string : string -> t optionof_string sis the safe version ofof_string_exn. Likeof_string_exn, but returnNoneinstead of raising.
val of_string_exn : string -> tof_string_exn sconverts the given stringsinto a 64-bit integer. Alias toInt64.of_string. The string is read in decimal (by default, or if the string begins with0u) or in hexadecimal, octal or binary if the string begins with0x,0oor0brespectively.The
0uprefix reads the input as an unsigned integer in the range[0, 2*CCInt64.max_int+1]. If the input exceedsCCInt64.max_intit is converted to the signed integerCCInt64.min_int + input - CCInt64.max_int - 1.The
_(underscore) character can appear anywhere in the string and is ignored. RaiseFailure "Int64.of_string"if the given string is not a valid representation of an integer, or if the integer represented exceeds the range of integers representable in typeint64.
val to_string_binary : t -> stringto_string_binary xreturns the string representation of the integerx, in binary.- since
- 3.0
Printing
Infix Operators
module Infix : sig ... endinclude module type of Infix
val (/) : t -> t -> tx / yis the integer quotient ofxandy. Integer division. RaiseDivision_by_zeroif the second argumentyis zero. This division rounds the real quotient of its arguments towards zero, as specified forStdlib.(/).
val (mod) : t -> t -> tx mod yis the integer remainder ofx / y. Ify <> zero, the result ofx mod ysatisfies the following properties:zero <= x mod y < abs yandx = ((x / y) * y) + (x mod y). Ify = 0,x mod yraisesDivision_by_zero.
val (lsl) : t -> int -> tx lsl yshiftsxto the left byybits, filling in with zeroes. The result is unspecified ify < 0ory >= 64.
val (lsr) : t -> int -> tx lsr yshiftsxto the right byybits. This is a logical shift: zeroes are inserted in the vacated bits regardless of the sign ofx. The result is unspecified ify < 0ory >= 64.