
import unittest
import user_code
import ast
import re   
import importlib
import csv
import unittest
import importlib

class TestTask(unittest.TestCase):
    def test_sum_first_last_many_elements(self):
        import user_code
        importlib.reload(user_code)
        result = user_code.sum_first_last((1, 2, 3, 4, 5))
        _dynamic_test(
            self,
            result == 6,
            "Returns correct sum for (1, 2, 3, 4, 5)",
            f"Expected 6, got {result} for input (1, 2, 3, 4, 5)"
        )

    def test_sum_first_last_two_elements(self):
        import user_code
        importlib.reload(user_code)
        result = user_code.sum_first_last((10, 20))
        _dynamic_test(
            self,
            result == 30,
            "Returns correct sum for (10, 20)",
            f"Expected 30, got {result} for input (10, 20)"
        )

    def test_sum_first_last_single_element(self):
        import user_code
        importlib.reload(user_code)
        result = user_code.sum_first_last((7,))
        _dynamic_test(
            self,
            result == 14,
            "Returns double value for (7,)",
            f"Expected 14, got {result} for input (7,)"
        )

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
    # Collect all assignment nodes to modify
    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 nothing to change, return unmodified code
    if not assign_nodes:
        return code

    # Perform replacements for all matching assignments (from last to first to not break line offsets)
    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

if __name__ == "__main__":
    unittest.main()


test_main.py

In this course, you will learn advanced topics such as function arguments, iterators, generators, closures, and decorators. Dozens of practice exercises will help you grasp these topics.

Explore the art of packing and unpacking lists, tuples, and dictionaries to write more expressive and efficient Python code.

Delve into the world of higher-order functions, passing functions as arguments, and writing concise anonymous functions with lambda.

Unravel the mysteries of variable scope, and learn how nested functions and closures enable powerful encapsulation.

Delve into Python's iteration protocol, custom iterators, and generator functions for efficient data processing.

Challenge: Unpacking Tuple Elements

Solução