uint

bitwise and

bitwise or

bitwise xor

add two unsigned ints

NYI make faster: https://en.wikipedia.org/wiki/Multiplication_algorithm#Computational_complexity_of_multiplication
multiply these unsigned ints

subtract other from this unsigned int

divide these unsigned ints

modulo
returns the remainder of the division

exponentation operator:
this uint to the power of other

this uint as an i64

this uint as an i32

shift right

shift left

this uint as an u8

this uint as an u32

this uint as an u64

this uint as an int

the highest 1 bit in this integer
example: uint 0 => 0
example: uint 1 => 1
example: uint 8 => 4

does this uint fit in 32 bits?

does this uint fit in 64 bits?

total order

equality: are these unsigned integers equal?