i16

bitwise and, or and xor operations

division and remainder with check for div-by-zero

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)

conversion to u32, i64 and u64, with range check

casting to unsigned, adding 1<<16 if negative

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

count the number of trailing zeros in this integer.

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

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