Module CCNativeint
Nativeint
Helpers for processor-native integers
This module provides operations on the type nativeint of signed 32-bit integers (on 32-bit platforms) or signed 64-bit integers (on 64-bit platforms). This integer type has exactly the same width as that of a pointer type in the C compiler. All arithmetic operations over nativeint are taken modulo 232 or 264 depending on the word size of the architecture.
Performance notice: values of type nativeint occupy more memory space than values of type int, and arithmetic operations on nativeint are generally slower than those on int. Use nativeint only when the application requires the extra bit of precision over the int type.
- since
- 2.1
Documentation for the standard Nativeint module
include module type of sig ... end
val neg : nativeint -> nativeintval add : nativeint -> nativeint -> nativeintval sub : nativeint -> nativeint -> nativeintval mul : nativeint -> nativeint -> nativeintval div : nativeint -> nativeint -> nativeint
val unsigned_rem : nativeint -> nativeint -> nativeintval succ : nativeint -> nativeintval pred : nativeint -> nativeintval abs : nativeint -> nativeintval size : intval max_int : nativeintval min_int : nativeint
val logand : nativeint -> nativeint -> nativeintval logor : nativeint -> nativeint -> nativeintval logxor : nativeint -> nativeint -> nativeint
val shift_left : nativeint -> int -> nativeintval shift_right : nativeint -> int -> nativeintval shift_right_logical : nativeint -> int -> nativeintval of_int : int -> nativeintval to_int : nativeint -> 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 native integer. Alias toNativeint.of_string. Convert the given string to a native integer. 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*CCNativeint.max_int+1]. If the input exceedsCCNativeint.max_intit is converted to the signed integerCCInt64.min_int + input - CCNativeint.max_int - 1.Raise
Failure "Nativeint.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 typenativeint.
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. The result is unspecified ify < 0ory >= bitsize, wherebitsizeis32on a 32-bit platform and64on a 64-bit platform.
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 >= bitsize.