कोडिंग कार्यप्रवाह · मॉर्टन ग्रिड अनुक्रमण

def morton2(x, y, bits):
    if type(bits) is not int or not 1 <= bits <= 16:
        raise ValueError("bits.range")
    if any(type(v) is not int or not 0 <= v < (1 << bits)
           for v in (x, y)):
        raise ValueError("coordinate.range")
    result = 0
    for i in range(bits):
        result |= ((x >> i) & 1) << (2 * i)
        result |= ((y >> i) & 1) << (2 * i + 1)
    return result