python-tcod/tests/test_path.py at 21.2.3 · libtcod/python-tcod · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
"""Tests for incremental pathfinding."""

import numpy as np
import pytest

import tcod.path


@pytest.mark.parametrize("shape", [(4, 7), (3, 4, 7)])
@pytest.mark.parametrize("order", ["C", "F"])
@pytest.mark.parametrize("value", [-3, 0, 3])
def test_add_root_after_resolve(shape: tuple[int, ...], order: str, value: int) -> None:
    graph = tcod.path.CustomGraph(shape, order=order)
    cost = np.ones(shape, dtype=np.int8)
    for axis in range(len(shape)):
        for direction in (-1, 1):
            edge = [0] * len(shape)
            edge[axis] = direction
            graph.add_edge(tuple(edge), cost=cost)

    pathfinder = tcod.path.Pathfinder(graph)
    origin = (0,) * len(shape)
    new_root = tuple(size - 1 for size in shape)
    pathfinder.add_root(origin)
    pathfinder.resolve()
    assert tuple(pathfinder.path_from(new_root)[-1]) == origin

    pathfinder.add_root(new_root, value=value)
    pathfinder.resolve()
    np.testing.assert_array_equal(pathfinder.path_from(new_root), [new_root])
    coordinates = np.indices(shape)
    expected = np.minimum(
        coordinates.sum(axis=0),
        sum(size - 1 - coordinates[axis] for axis, size in enumerate(shape)) + value,
    )
    np.testing.assert_array_equal(pathfinder.distance, expected)
    for index in np.ndindex(shape):
        path = pathfinder.path_from(index)
        root = tuple(path[-1])
        assert root in (origin, new_root)
        root_value = value if root == new_root else 0
        assert len(path) - 1 + root_value == expected[index]


@pytest.mark.parametrize("shape", [(4, 7), (3, 4, 7)])
@pytest.mark.parametrize("order", ["C", "F"])
@pytest.mark.parametrize("first_value", [-5, 3])
@pytest.mark.parametrize("relative_value", [-1, 0, 1, 20])
@pytest.mark.parametrize("partial", [False, True])
def test_add_root_preserves_better_distances(
    shape: tuple[int, ...], order: str, first_value: int, relative_value: int, partial: bool
) -> None:
    graph = tcod.path.CustomGraph(shape, order=order)
    cost = np.ones(shape, dtype=np.int8)
    for axis in range(len(shape)):
        for direction in (-1, 1):
            edge = [0] * len(shape)
            edge[axis] = direction
            graph.add_edge(tuple(edge), cost=cost)
    pathfinder = tcod.path.Pathfinder(graph)
    origin = (0,) * len(shape)
    new_root = tuple(size // 2 for size in shape)
    pathfinder.add_root(origin, value=first_value)
    pathfinder.resolve(new_root if partial else None)
    old_path = pathfinder.path_from(new_root).copy()
    old_distances = pathfinder.distance.copy()
    old_traversal = pathfinder.traversal.copy()
    value = int(old_distances[new_root]) + relative_value
    pathfinder.add_root(new_root, value=value)
    if relative_value >= 0:
        np.testing.assert_array_equal(pathfinder.distance, old_distances)
        np.testing.assert_array_equal(pathfinder.traversal, old_traversal)
        np.testing.assert_array_equal(pathfinder.path_from(new_root), old_path)
    else:
        assert pathfinder.distance[new_root] == value
        np.testing.assert_array_equal(pathfinder.path_from(new_root), [new_root])
    pathfinder.resolve()
    coordinates = np.indices(shape)
    expected = np.minimum(
        first_value + coordinates.sum(axis=0),
        value + sum(abs(new_root[axis] - coordinates[axis]) for axis in range(len(shape))),
    )
    np.testing.assert_array_equal(pathfinder.distance, expected)