File: test_difference.py

package info (click to toggle)
diffoscope 297%2Bdeb13u1
  • links: PTS, VCS
  • area: main
  • in suites: trixie-proposed-updates
  • size: 11,304 kB
  • sloc: python: 17,173; sh: 114; makefile: 97; xml: 36; javascript: 2
file content (145 lines) | stat: -rw-r--r-- 4,839 bytes parent folder | download | duplicates (5)
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
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
#
# diffoscope: in-depth comparison of files, archives, and directories
#
# Copyright © 2015 Jérémy Bobbio <lunar@debian.org>
# Copyright © 2016-2020 Chris Lamb <lamby@debian.org>
#
# diffoscope is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# diffoscope is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with diffoscope.  If not, see <https://www.gnu.org/licenses/>.

import io
import itertools
import pytest

from diffoscope.config import Config
from diffoscope.difference import Difference


def assert_size(diff, size):
    assert size == diff.size()
    assert size == sum(d.size_self() for d in diff.traverse_breadth())
    g = itertools.count()
    assert size == sum(
        d.size_self() for d in diff.traverse_heapq(lambda x, _: next(g))
    )


def assert_algebraic_properties(d, size):
    assert d.equals(d.get_reverse().get_reverse())
    assert d.get_reverse().size() == d.size() == size


def test_too_much_input_for_diff(monkeypatch):
    monkeypatch.setattr(Config(), "max_diff_input_lines", 20)
    too_long_text_a = io.StringIO("a\n" * 21)
    too_long_text_b = io.StringIO("b\n" * 21)
    difference = Difference.from_text_readers(
        too_long_text_a, too_long_text_b, "a", "b"
    )
    assert "[ Too much input for diff " in difference.unified_diff
    assert_algebraic_properties(difference, 342)


def test_too_long_diff_block_lines(monkeypatch):
    monkeypatch.setattr(Config(), "enforce_constraints", False)
    monkeypatch.setattr(Config(), "max_diff_block_lines_saved", 10)
    too_long_text_a = io.StringIO("a\n" * 21)
    too_long_text_b = io.StringIO("b\n" * 21)
    difference = Difference.from_text_readers(
        too_long_text_a, too_long_text_b, "a", "b"
    )
    assert "[ 11 lines removed ]" in difference.unified_diff
    assert_algebraic_properties(difference, 124)


def test_size_updates():
    d = Difference("path1", "path2", unified_diff="0123456789")
    assert_size(d, 20)
    d.add_details(
        [Difference("path1/a", "path2/a", unified_diff="0123456789")]
    )
    assert_size(d, 44)
    d.add_comment("lol1")
    assert_size(d, 48)


def test_traverse_heapq():
    d0 = Difference("path1/a", "path2/a", unified_diff="0")
    d1 = Difference("path1/b", "path2/b", unified_diff="012")
    d2 = Difference("path1/c", "path2/c", unified_diff="01")
    d0.add_details(
        [
            Difference("path1/a/1", "path2/a/1", unified_diff="012345678"),
            Difference("path1/a/2", "path2/a/2", unified_diff="0123"),
            Difference("path1/a/3", "path2/a/3", unified_diff="012"),
        ]
    )
    d1.add_details(
        [
            Difference("path1/b/1", "path2/b/1", unified_diff="01234567"),
            Difference("path1/b/2", "path2/b/2", unified_diff="01234"),
            Difference("path1/b/3", "path2/b/3", unified_diff="012345"),
        ]
    )
    d2.add_details(
        [
            Difference("path1/c/1", "path2/c/1", unified_diff="01"),
            Difference("path1/c/2", "path2/c/2", unified_diff="0123456789"),
            Difference("path1/c/3", "path2/c/3", unified_diff="0123456"),
        ]
    )
    diff = Difference("path1", "path2", unified_diff="0123456789")
    diff.add_details([d0, d1, d2])
    # traverse nodes in depth order, but at a given depth traverse the nodes
    # there from smallest diff (counted non-recursively) to largest

    def f(node, parscore):
        depth = parscore[0] + 1 if parscore else 0
        return depth, node.size_self()

    assert_size(diff, 284)
    results = [d.source1[6:] for d in diff.traverse_heapq(f)]
    assert results == [
        "",
        "a",
        "c",
        "b",
        "c/1",
        "a/3",
        "a/2",
        "b/2",
        "b/3",
        "c/3",
        "b/1",
        "a/1",
        "c/2",
    ]


def test_non_str_arguments_to_source1_source2():
    for x in ((None, "str"), ("str", None)):
        a = io.StringIO("a")
        b = io.StringIO("b")

        with pytest.raises(TypeError):
            Difference.from_text_readers(a, b, *x)


def test_adjust_diff_context(monkeypatch):
    monkeypatch.setattr(Config(), "diff_context", 2)
    a = io.StringIO("".join(str(i) + "\n" for i in range(20)))
    b = io.StringIO(
        "".join(str(i if i != 10 else "x") + "\n" for i in range(20))
    )
    difference = Difference.from_text_readers(a, b, "a", "b")
    assert difference.unified_diff.count("\n") == 7