blob: b5168dd7094fd1629705f162e897ec3bad369755 [file] [log] [blame]
Barry Warsaw04f357c2002-07-23 19:04:11 +00001import difflib
Martin v. Löwise064b412004-08-29 16:34:40 +00002from test.test_support import run_unittest, findfile
Neal Norwitze7dfe212003-07-01 14:59:46 +00003import unittest
Raymond Hettinger43d790c2003-07-16 04:34:56 +00004import doctest
Gustavo Niemeyer548148812006-01-31 18:34:13 +00005import sys
Neal Norwitze7dfe212003-07-01 14:59:46 +00006
7class TestSFbugs(unittest.TestCase):
8
9 def test_ratio_for_null_seqn(self):
10 # Check clearing of SF bug 763023
11 s = difflib.SequenceMatcher(None, [], [])
12 self.assertEqual(s.ratio(), 1)
13 self.assertEqual(s.quick_ratio(), 1)
14 self.assertEqual(s.real_quick_ratio(), 1)
15
Brett Cannond2c5b4b2004-07-10 23:54:07 +000016 def test_comparing_empty_lists(self):
17 # Check fix for bug #979794
18 group_gen = difflib.SequenceMatcher(None, [], []).get_grouped_opcodes()
Georg Brandla18af4e2007-04-21 15:47:16 +000019 self.assertRaises(StopIteration, next, group_gen)
Brett Cannond2c5b4b2004-07-10 23:54:07 +000020 diff_gen = difflib.unified_diff([], [])
Georg Brandla18af4e2007-04-21 15:47:16 +000021 self.assertRaises(StopIteration, next, diff_gen)
Brett Cannond2c5b4b2004-07-10 23:54:07 +000022
Martin v. Löwise064b412004-08-29 16:34:40 +000023patch914575_from1 = """
24 1. Beautiful is beTTer than ugly.
25 2. Explicit is better than implicit.
26 3. Simple is better than complex.
27 4. Complex is better than complicated.
28"""
29
30patch914575_to1 = """
31 1. Beautiful is better than ugly.
32 3. Simple is better than complex.
33 4. Complicated is better than complex.
34 5. Flat is better than nested.
35"""
36
37patch914575_from2 = """
38\t\tLine 1: preceeded by from:[tt] to:[ssss]
39 \t\tLine 2: preceeded by from:[sstt] to:[sssst]
40 \t \tLine 3: preceeded by from:[sstst] to:[ssssss]
41Line 4: \thas from:[sst] to:[sss] after :
42Line 5: has from:[t] to:[ss] at end\t
43"""
44
45patch914575_to2 = """
46 Line 1: preceeded by from:[tt] to:[ssss]
47 \tLine 2: preceeded by from:[sstt] to:[sssst]
48 Line 3: preceeded by from:[sstst] to:[ssssss]
49Line 4: has from:[sst] to:[sss] after :
Tim Peters48bd7f32004-08-29 22:38:38 +000050Line 5: has from:[t] to:[ss] at end
Martin v. Löwise064b412004-08-29 16:34:40 +000051"""
52
53patch914575_from3 = """line 0
541234567890123456789012345689012345
55line 1
56line 2
57line 3
Tim Peters48bd7f32004-08-29 22:38:38 +000058line 4 changed
59line 5 changed
60line 6 changed
Martin v. Löwise064b412004-08-29 16:34:40 +000061line 7
62line 8 subtracted
63line 9
641234567890123456789012345689012345
65short line
66just fits in!!
67just fits in two lines yup!!
68the end"""
69
70patch914575_to3 = """line 0
711234567890123456789012345689012345
72line 1
73line 2 added
74line 3
Tim Peters48bd7f32004-08-29 22:38:38 +000075line 4 chanGEd
76line 5a chanGed
77line 6a changEd
Martin v. Löwise064b412004-08-29 16:34:40 +000078line 7
79line 8
80line 9
811234567890
82another long line that needs to be wrapped
83just fitS in!!
84just fits in two lineS yup!!
85the end"""
86
87class TestSFpatches(unittest.TestCase):
88
89 def test_html_diff(self):
90 # Check SF patch 914575 for generating HTML differences
91 f1a = ((patch914575_from1 + '123\n'*10)*3)
92 t1a = (patch914575_to1 + '123\n'*10)*3
93 f1b = '456\n'*10 + f1a
94 t1b = '456\n'*10 + t1a
95 f1a = f1a.splitlines()
96 t1a = t1a.splitlines()
97 f1b = f1b.splitlines()
98 t1b = t1b.splitlines()
99 f2 = patch914575_from2.splitlines()
100 t2 = patch914575_to2.splitlines()
101 f3 = patch914575_from3
102 t3 = patch914575_to3
103 i = difflib.HtmlDiff()
104 j = difflib.HtmlDiff(tabsize=2)
105 k = difflib.HtmlDiff(wrapcolumn=14)
Tim Peters48bd7f32004-08-29 22:38:38 +0000106
Martin v. Löwise064b412004-08-29 16:34:40 +0000107 full = i.make_file(f1a,t1a,'from','to',context=False,numlines=5)
108 tables = '\n'.join(
109 [
Tim Peters48bd7f32004-08-29 22:38:38 +0000110 '<h2>Context (first diff within numlines=5(default))</h2>',
Martin v. Löwise064b412004-08-29 16:34:40 +0000111 i.make_table(f1a,t1a,'from','to',context=True),
Tim Peters48bd7f32004-08-29 22:38:38 +0000112 '<h2>Context (first diff after numlines=5(default))</h2>',
Martin v. Löwise064b412004-08-29 16:34:40 +0000113 i.make_table(f1b,t1b,'from','to',context=True),
Tim Peters48bd7f32004-08-29 22:38:38 +0000114 '<h2>Context (numlines=6)</h2>',
Martin v. Löwise064b412004-08-29 16:34:40 +0000115 i.make_table(f1a,t1a,'from','to',context=True,numlines=6),
Tim Peters48bd7f32004-08-29 22:38:38 +0000116 '<h2>Context (numlines=0)</h2>',
Martin v. Löwise064b412004-08-29 16:34:40 +0000117 i.make_table(f1a,t1a,'from','to',context=True,numlines=0),
Tim Peters48bd7f32004-08-29 22:38:38 +0000118 '<h2>Same Context</h2>',
Martin v. Löwise064b412004-08-29 16:34:40 +0000119 i.make_table(f1a,f1a,'from','to',context=True),
Tim Peters48bd7f32004-08-29 22:38:38 +0000120 '<h2>Same Full</h2>',
Martin v. Löwise064b412004-08-29 16:34:40 +0000121 i.make_table(f1a,f1a,'from','to',context=False),
122 '<h2>Empty Context</h2>',
123 i.make_table([],[],'from','to',context=True),
124 '<h2>Empty Full</h2>',
125 i.make_table([],[],'from','to',context=False),
126 '<h2>tabsize=2</h2>',
127 j.make_table(f2,t2),
128 '<h2>tabsize=default</h2>',
129 i.make_table(f2,t2),
130 '<h2>Context (wrapcolumn=14,numlines=0)</h2>',
131 k.make_table(f3.splitlines(),t3.splitlines(),context=True,numlines=0),
132 '<h2>wrapcolumn=14,splitlines()</h2>',
133 k.make_table(f3.splitlines(),t3.splitlines()),
134 '<h2>wrapcolumn=14,splitlines(True)</h2>',
135 k.make_table(f3.splitlines(True),t3.splitlines(True)),
136 ])
137 actual = full.replace('</body>','\n%s\n</body>' % tables)
138 # temporarily uncomment next three lines to baseline this test
139 #f = open('test_difflib_expect.html','w')
140 #f.write(actual)
141 #f.close()
142 expect = open(findfile('test_difflib_expect.html')).read()
Tim Peters48bd7f32004-08-29 22:38:38 +0000143
144
Martin v. Löwise064b412004-08-29 16:34:40 +0000145 self.assertEqual(actual,expect)
146
Gustavo Niemeyer548148812006-01-31 18:34:13 +0000147 def test_recursion_limit(self):
148 # Check if the problem described in patch #1413711 exists.
149 limit = sys.getrecursionlimit()
150 old = [(i%2 and "K:%d" or "V:A:%d") % i for i in range(limit*2)]
151 new = [(i%2 and "K:%d" or "V:B:%d") % i for i in range(limit*2)]
152 difflib.SequenceMatcher(None, old, new).get_opcodes()
153
154
Thomas Wouters49fd7fa2006-04-21 10:40:58 +0000155def test_main():
156 difflib.HtmlDiff._default_prefix = 0
157 Doctests = doctest.DocTestSuite(difflib)
158 run_unittest(TestSFpatches, TestSFbugs, Doctests)
Raymond Hettinger43d790c2003-07-16 04:34:56 +0000159
Thomas Wouters49fd7fa2006-04-21 10:40:58 +0000160if __name__ == '__main__':
161 test_main()