**Collinearity** means that three or more points lie on a single straight line. In other words, if you can draw a straight line that passes through all the given points without changing direction, those points are collinear.

Definition


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

class TestTask(unittest.TestCase):
    def test_true_collinear_diagonal(self):
        import user_code
        importlib.reload(user_code)
        result = user_code.are_collinear((0, 0), (1, 1), (2, 2))
        _dynamic_test(
            self,
            result is True,
            "Correctly returns True for diagonal collinear points.",
            f"Expected True for (0,0), (1,1), (2,2), got {result}.",
        )

    def test_false_non_collinear(self):
        import user_code
        importlib.reload(user_code)
        result = user_code.are_collinear((0, 0), (1, 2), (2, 1))
        _dynamic_test(
            self,
            result is False,
            "Correctly returns False for non-collinear points.",
            f"Expected False for (0,0), (1,2), (2,1), got {result}.",
        )

    def test_true_horizontal(self):
        import user_code
        importlib.reload(user_code)
        result = user_code.are_collinear((1, 5), (3, 5), (100, 5))
        _dynamic_test(
            self,
            result is True,
            "Correctly returns True for horizontal collinear points.",
            f"Expected True for (1,5), (3,5), (100,5), got {result}.",
        )

    def test_true_vertical(self):
        import user_code
        importlib.reload(user_code)
        result = user_code.are_collinear((2, -3), (2, 0), (2, 99))
        _dynamic_test(
            self,
            result is True,
            "Correctly returns True for vertical collinear points.",
            f"Expected True for (2,-3), (2,0), (2,99), got {result}.",
        )

    def test_true_negative_coords(self):
        import user_code
        importlib.reload(user_code)
        result = user_code.are_collinear((-1, -2), (-2, -4), (-3, -6))
        _dynamic_test(
            self,
            result is True,
            "Correctly returns True for negative collinear points.",
            f"Expected True for (-1,-2), (-2,-4), (-3,-6), got {result}.",
        )

    def test_false_mixed_coords(self):
        import user_code
        importlib.reload(user_code)
        result = user_code.are_collinear((-2, 1), (0, 0), (1, 2))
        _dynamic_test(
            self,
            result is False,
            "Correctly returns False for mixed coordinate non-collinear points.",
            f"Expected False for (-2,1), (0,0), (1,2), got {result}.",
        )

    def test_true_all_same_point(self):
        import user_code
        importlib.reload(user_code)
        result = user_code.are_collinear((5, 5), (5, 5), (5, 5))
        _dynamic_test(
            self,
            result is True,
            "Correctly returns True when all points are identical.",
            f"Expected True for (5,5), (5,5), (5,5), got {result}.",
        )

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

Learn the fundamentals of geometric modelling using Python. Explore how to represent, manipulate, and approximate geometric figures programmatically. This course covers basic shapes, transformations, and practical approximation techniques, making geometric concepts accessible and interactive.

Get started with the core concepts of geometric modelling and how Python can be used to represent and manipulate basic shapes.

Delve into geometric transformations such as translation, rotation, and scaling, and see how they affect shapes in Python.

Learn how to approximate curves and complex shapes using polygons and other techniques in Python.

Challenge: Collinearity of Points

Solución