import unittest
import user_code
import ast
import re   
import importlib

class TestTask(unittest.TestCase):
    def test_power_up_double(self):
        import user_code
        importlib.reload(user_code)
        power_up_double = getattr(user_code, 'power_up_double', None)
        _dynamic_test(
            self,
            callable(power_up_double),
            "power_up_double is a function",
            "power_up_double is not defined as a function",
        )
        result = power_up_double(10) if power_up_double else None
        _dynamic_test(
            self,
            result == 20,
            "power_up_double(10) returns 20",
            f"power_up_double(10) did not return 20, got {result}",
        )

    def test_power_up_triple(self):
        import user_code
        importlib.reload(user_code)
        power_up_triple = getattr(user_code, 'power_up_triple', None)
        _dynamic_test(
            self,
            callable(power_up_triple),
            "power_up_triple is a function",
            "power_up_triple is not defined as a function",
        )
        result = power_up_triple(5) if power_up_triple else None
        _dynamic_test(
            self,
            result == 15,
            "power_up_triple(5) returns 15",
            f"power_up_triple(5) did not return 15, got {result}",
        )

    def test_different_multipliers(self):
        import user_code
        importlib.reload(user_code)
        create_power_up = getattr(user_code, 'create_power_up', None)
        _dynamic_test(
            self,
            callable(create_power_up),
            "create_power_up is a function",
            "create_power_up is not defined as a function",
        )
        double = create_power_up(2) if create_power_up else None
        half = create_power_up(0.5) if create_power_up else None
        r1 = double(7) if double else None
        r2 = half(8) if half else None
        _dynamic_test(
            self,
            r1 == 14,
            "Function with multiplier 2 returns correct result (7 * 2 == 14)",
            f"Expected 14, got {r1} for create_power_up(2)(7)",
        )
        _dynamic_test(
            self,
            r2 == 4.0,
            "Function with multiplier 0.5 returns correct result (8 * 0.5 == 4.0)",
            f"Expected 4.0, got {r2} for create_power_up(0.5)(8)",
        )

    def test_independent_closures(self):
        import user_code
        importlib.reload(user_code)
        create_power_up = getattr(user_code, 'create_power_up', None)
        _dynamic_test(
            self,
            callable(create_power_up),
            "create_power_up is a function",
            "create_power_up is not defined as a function",
        )
        up5 = create_power_up(5) if create_power_up else None
        up10 = create_power_up(10) if create_power_up else None
        r1 = up5(2) if up5 else None
        r2 = up10(2) if up10 else None
        _dynamic_test(
            self,
            r1 == 10 and r2 == 20,
            "Each closure keeps its own multiplier",
            f"Expected up5(2)==10 and up10(2)==20, got {r1} and {r2}",
        )

def _dynamic_test(test_case, condition, success_message, failure_message):
    if condition:
        test_case._testMethodName = success_message
        test_case.assertTrue(True, success_message)
    else:
        test_case._testMethodName = failure_message
        test_case.fail(failure_message)

def normalize_text(text):
    text = text.lower()
    text = re.sub(r"\\s{2,}", " ", text)
    text = re.sub(r"\\s*([,:?])\\s*", r"\\1 ", text)
    return text.strip()

def change_var(code: str, var_name: str, value: str) -> str:
    tree = ast.parse(code)
    lines = code.splitlines()
    changed = False
    assign_nodes = [
        (i, node)
        for i, node in enumerate(tree.body)
        if isinstance(node, ast.Assign)
        and any(isinstance(target, ast.Name) and target.id == var_name for target in node.targets)
    ]
    if not assign_nodes:
        return code
    for i, node in reversed(assign_nodes):
        start_line = node.lineno - 1
        line = lines[start_line]
        indent = ' ' * (len(line) - len(line.lstrip()))
        lines[start_line] = f"{indent}{var_name} = {value}"
        next_line = len(lines)
        for next_node in tree.body[i+1:]:
            if hasattr(next_node, 'lineno'):
                next_line = next_node.lineno - 1
                break
        if next_line > start_line + 1:
            lines[start_line+1:next_line] = []
        changed = True
    return '\\n'.join(lines) if changed else code


test_main.py

パッキング／アンパッキング、柔軟な関数引数、高階関数、ラムダ、変数スコープ、クロージャ、イテレータ、デコレータを習得します。入門レベルのPythonコースを修了し、より効率的で表現力豊かかつ強力なコードを書きたい学習者向けに設計されています。

リスト、タプル、辞書のパッキングおよびアンパッキングの技術を探求し、より表現力が高く効率的なPythonコードの記述を目指します。

高階関数の世界、関数を引数として渡す方法、およびlambdaによる簡潔な無名関数の記述について深く学びます。

変数のスコープの謎を解き明かし、ネストされた関数とクロージャが強力なカプセル化をどのように実現するかを学びます。

Pythonのイテレーションプロトコル、カスタムイテレーター、ジェネレーター関数による効率的なデータ処理を深く学習します。

チャレンジ：ヒーローをパワーアップ

解答