module Int: BatInttypet =int
val zero : int0.val one : int1.val minus_one : int-1.val neg : int -> intval add : int -> int -> intval (+) : int -> int -> intval sub : int -> int -> intval (-) : int -> int -> intval mul : int -> int -> intval ( * ) : int -> int -> intval div : int -> int -> intPervasives.(/).Division_by_zero if the second argument is zero.val (/) : int -> int -> intPervasives.(/).Division_by_zero if the second argument is zero.val rem : int -> int -> inty is not zero, the result
of Int.rem x y satisfies the following property:
x = Int.add (Int.mul (Int.div x y) y) (Int.rem x y).Division_by_zero if the second argument is zero.val modulo : int -> int -> intmodulo a b computes the remainder of the integer
division of a by b. This is defined only if b <> 0.
The result of modulo a b is a number m between
0 and abs ( b - 1 ) if a >= 0 or between ~- ( abs ( b - 1 ) )
if a < 0 and such that a * k + (abs b) = m,
for some k.
val pow : int -> int -> intpow a b computes ab.Invalid_argument when b is negative.val ( ** ) : int -> int -> inta ** b computes abval (<>) : int -> int -> bool
val (>) : int -> int -> bool
val (<) : int -> int -> bool
val (>=) : int -> int -> bool
val (<=) : int -> int -> bool
val (=) : int -> int -> bool
val min_num : intval max_num : intval succ : int -> intInt.succ x is Int.add x Int.one.val pred : int -> intInt.pred x is Int.sub x Int.one.val abs : int -> intmin_num. In that case, abs min_num = min_num.val of_float : float -> intInt.min_int, Int.max_int].val to_float : int -> floatval of_string : string -> int0x, 0o or 0b
respectively.Invalid_argument if the given string is not
a valid representation of an integer, or if the integer represented
exceeds the range of integers representable in type int.val to_string : int -> stringval min : int -> int -> intmin from the
standard library.val max : int -> int -> intmin from the
standard library.val mid : int -> int -> intmid a b returns floor((a+b)/2), but done
correctly to compensate for numeric overflows. The result is an
integer that lies between a and b and is as equidistant from
both as possible.val popcount : int -> intval copysign : int -> int -> intcopysign n o multiplies o by the "sign" of n, i.e. it returns either:0 if n=0o if n>0-o if n<0val operations : int BatNumber.numeric
val (--) : t -> t -> t BatEnum.t
5 -- 10 is the enumeration 5,6,7,8,9,10.
10 -- 5 is the empty enumeration
val (---) : t -> t -> t BatEnum.t
5 --- 10 is the enumeration 5,6,7,8,9,10.
10 --- 5 is the enumeration 10,9,8,7,6,5.
val of_int : int -> int
val to_int : int -> intmodule Infix:BatNumber.Infixwith type bat__infix_t = t
module Compare:BatNumber.Comparewith type bat__compare_t = t
val print : 'a BatInnerIO.output -> int -> unitval print_hex : 'a BatInnerIO.output -> int -> unitval compare : t -> t -> intPervasives.compare. Along with the type t, this function compare
allows the module Int to be passed as argument to the functors
Set.Make and Map.Make.val equal : t -> t -> boolHashedType.val ord : t -> t -> BatOrd.order
module Safe_int:sig..end