Refactor Monolith

拆分大函数

≈ 25 min · python-decomposition python-functions · Open in WolfCode

A 12-line function that does three jobs. Split it into three named one-job helpers + a thin orchestrator. Behavior must be preserved.

Before — the monolith

Works, but tangled

import math

def analyze_number_OLD(n):
    is_even = (n % 2 == 0)
    if n < 2:
        is_prime = False
    else:
        is_prime = True
        for i in range(2, int(math.sqrt(n)) + 1):
            if n % i == 0:
                is_prime = False
                break
    total = 0
    for c in str(abs(n)):
        total += int(c)
    return {"n": n, "even": is_even, "prime": is_prime, "digit_sum": total}

print(analyze_number_OLD(12))
print(analyze_number_OLD(17))

Loading Python runtime (~5 MB, one-time)…

After — three helpers + thin describe

Python · runnable

import math

def is_even(n):
    return n % 2 == 0

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

def digit_sum(n):
    total = 0
    for c in str(abs(n)):
        total += int(c)
    return total

def describe(n):
    return {
        "n": n,
        "even": is_even(n),
        "prime": is_prime(n),
        "digit_sum": digit_sum(n),
    }

for x in [12, 17, -42, 1, 0]:
    print(describe(x))

Loading Python runtime (~5 MB, one-time)…