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
|
# Copyright (C) 2008 Canonical Limited.
#
# This program is free software; you can redistribute it and/or modify
# it under the terms of the GNU General Public License version 2 as published
# by the Free Software Foundation.
#
# This program 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 this program; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
#
"""Tests for the pyrex extension of groupcompress"""
from bzrlib import tests
class _CompiledGroupCompress(tests.Feature):
def _probe(self):
try:
import bzrlib.plugins.groupcompress._groupcompress_c
except ImportError:
return False
else:
return True
def feature_name(self):
return 'bzrlib.plugins.groupcompress._groupcompress_c'
CompiledGroupCompress = _CompiledGroupCompress()
class TestCompiledEquivalenceTable(tests.TestCase):
"""Direct tests for the compiled Equivalence Table."""
_tests_need_features = [CompiledGroupCompress]
# These tests assume that hash(int) == int
# If that ever changes, we can simply change this code to use a custom
# class that has precomputed values returned from __hash__.
def setUp(self):
super(TestCompiledEquivalenceTable, self).setUp()
from bzrlib.plugins.groupcompress import _groupcompress_c
self._gc_module = _groupcompress_c
def test_minimum_hash_size(self):
eq = self._gc_module.EquivalenceTable([])
# We request at least 33% free space in the hash (to make collisions
# more bearable)
self.assertEqual(1024, eq._py_compute_minimum_hash_size(683))
self.assertEqual(2048, eq._py_compute_minimum_hash_size(684))
self.assertEqual(2048, eq._py_compute_minimum_hash_size(1000))
self.assertEqual(2048, eq._py_compute_minimum_hash_size(1024))
def test_recommended_hash_size(self):
eq = self._gc_module.EquivalenceTable([])
# We always recommend a minimum of 8k
self.assertEqual(8192, eq._py_compute_recommended_hash_size(10))
self.assertEqual(8192, eq._py_compute_recommended_hash_size(1000))
self.assertEqual(8192, eq._py_compute_recommended_hash_size(2000))
self.assertEqual(8192, eq._py_compute_recommended_hash_size(4000))
# And we recommend at least 50% free slots
self.assertEqual(8192, eq._py_compute_recommended_hash_size(4096))
self.assertEqual(16384, eq._py_compute_recommended_hash_size(4097))
def test__raw_lines(self):
eq = self._gc_module.EquivalenceTable([1, 2, 3])
self.assertEqual([(1, 1, 1, -1), (2, 2, 2, -1), (3, 3, 3, -1)],
eq._inspect_left_lines())
def test_build_hash(self):
eq = self._gc_module.EquivalenceTable([1, 2, 3])
# (size, [(offset, head_offset_in_lines, count)])
self.assertEqual((8192, [(1, 0, 1), (2, 1, 1), (3, 2, 1)]),
eq._inspect_hash_table())
def test_build_hash_with_duplicates(self):
eq = self._gc_module.EquivalenceTable([1, 2, 4, 0, 1, 4, 2, 4])
self.assertEqual([
(1, 1, 1, 4),
(2, 2, 2, 6),
(4, 4, 4, 5),
(0, 0, 0, -1),
(1, 1, 1, -1),
(4, 4, 4, 7),
(2, 2, 2, -1),
(4, 4, 4, -1),
], eq._inspect_left_lines())
# (hash_offset, head_offset_in_lines, count)
self.assertEqual((8192, [
(0, 3, 1),
(1, 0, 2),
(2, 1, 2),
(4, 2, 3),
]), eq._inspect_hash_table())
|