Function is_prime

LuaSTGPlus/string2enum.py:27–33

(n)

        return key[idx]

def is_prime(n):
    if n <= 1:
        return False
    for i in range(2, int(math.sqrt(n)) + 1):
        if n % i == 0:
            return False
    return True

class union_set:
    def __init__(self, count):