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

class TestTask(unittest.TestCase):
    def setUp(self):
        import user_code
        importlib.reload(user_code)
        self.triangle = [(1, 1), (4, 1), (2.5, 4)]
        self.angle = 90
        self.rotate_triangle = getattr(user_code, 'rotate_triangle', None)
        self.rotate_point = getattr(user_code, 'rotate_point', None)

    def test_returns_three_points(self):
        import user_code
        importlib.reload(user_code)
        func = getattr(user_code, 'rotate_triangle', None)
        _dynamic_test(
            self,
            callable(func),
            "rotate_triangle is defined and callable",
            "rotate_triangle is not defined or not callable",
        )
        result = func(self.triangle, self.angle)
        _dynamic_test(
            self,
            isinstance(result, list) and len(result) == 3,
            "Returned list contains three points",
            f"Returned value is not a list of three points: {result}",
        )

    def test_rotates_points_by_90(self):
        import user_code
        importlib.reload(user_code)
        func = getattr(user_code, 'rotate_triangle', None)
        rotate_point = getattr(user_code, 'rotate_point', None)
        result = func(self.triangle, self.angle)
        _dynamic_test(
            self,
            isinstance(result, list) and len(result) == 3,
            "Returned list contains three points after rotation",
            f"Returned value is not a list of three points: {result}",
        )
        for i, pt in enumerate(self.triangle):
            expected = rotate_point(pt, 90)
            actual = result[i]
            close = math.isclose(actual[0], expected[0], abs_tol=1e-7) and math.isclose(actual[1], expected[1], abs_tol=1e-7)
            _dynamic_test(
                self,
                close,
                f"Point {pt} is correctly rotated by 90 degrees",
                f"Point {pt} expected {expected}, got {actual}",
            )

    def test_order_of_points_preserved(self):
        import user_code
        importlib.reload(user_code)
        func = getattr(user_code, 'rotate_triangle', None)
        rotate_point = getattr(user_code, 'rotate_point', None)
        result = func(self.triangle, self.angle)
        _dynamic_test(
            self,
            isinstance(result, list) and len(result) == 3,
            "Returned list contains three points after rotation (order test)",
            f"Returned value is not a list of three points: {result}",
        )
        for i in range(3):
            expected = rotate_point(self.triangle[i], 90)
            actual = result[i]
            close = math.isclose(actual[0], expected[0], abs_tol=1e-7) and math.isclose(actual[1], expected[1], abs_tol=1e-7)
            _dynamic_test(
                self,
                close,
                f"Point {i} order and value preserved after rotation",
                f"Order or value mismatch at index {i}: expected {expected}, got {actual}",
            )

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

Lär dig grunderna i geometrisk modellering med Python. Utforska hur man representerar, manipulerar och approximerar geometriska figurer programmatiskt. Denna kurs täcker grundläggande former, transformationer och praktiska approximationstekniker, vilket gör geometriska koncept tillgängliga och interaktiva.

Kom igång med kärnbegreppen inom geometrisk modellering och hur Python kan användas för att representera och manipulera grundläggande former.

Fördjupa dig i geometriska transformationer såsom translation, rotation och skalning, och se hur de påverkar former i Python.

Lär dig hur du kan approximera kurvor och komplexa former med hjälp av polygoner och andra tekniker i Python.

Utmaning: Rotation

Lösning