Explanation of wrap-around in Java

wrap_java_e_nao_so.py

"""

Doc: 

https://docs.oracle.com/javase/specs/jls/se7/html/jls-15.html#jls-15.18.2

If an integer addition overflows, then the result is the low-order bits of the mathematical sum as represented in some sufficiently large two's-complement format.

"""


ma = 7
mi = -8

def wrap(x):
    slots = ma - mi + 1
    
    while x > ma or x < mi:
        if x > ma:
            x -= slots
        if x < mi:
            x += slots
    return x
        

print(wrap(mi-1))
print(wrap(ma+1))

print(wrap(mi))
print(wrap(-mi))
print(wrap(-wrap(-mi)))