i64

bitwise and, or and xor operations

division and remainder with check for div-by-zero

conversion to float

this i64 as an i32

would negation -thiz cause an overflow?

would addition thiz + other cause an overflow or underflow?

would subtraction thiz - other cause an overflow or underflow?

would multiplication thiz * other cause an overflow or underflow?

neg, add, sub, mul with wrap-around semantics

shift operations (signed)

this i64 as an i8

this i64 as an u8

this i64 as an u16

this i64 as an u32

this i64 as an u64

this i64 as an u128

this i64 as an int

casting bit representation to unsigned

find the highest 1 bit in this integer and return integer with
this single bit set or 0 if this is 0.

count the number of trailing zeros in this integer.

count the number of 1 bits in the binary representation of this
integer.

this i64 as an i16

this i64 as an uint

maximum

total order

minimum

equality

create hash code from this number

identity element for 'infix +'

identity element for 'infix *'

returns the number in whose bit representation all bits are ones