← Back to branch summary

~bzr-pqm/bzr/bzr.dev

« back to all changes in this revision

Viewing changes to bzrlib/tests/test_btree_index.py

  • Committer: Martin Pool
  • Date: 2010-08-18 07:25:22 UTC
  • mto: This revision was merged to the branch mainline in revision 5383.
  • Revision ID: mbp@sourcefrog.net-20100818072522-uk3gsazoia3l3s0a
Start adding 'what's new in 2.3'

Show diffs side-by-side

added added

removed removed

Lines of Context:
bzrlib/tests/test_btree_index.py
1
 
# Copyright (C) 2008-2011 Canonical Ltd
 
1
# Copyright (C) 2008, 2009, 2010 Canonical Ltd
2
2
#
3
3
# This program is free software; you can redistribute it and/or modify
4
4
# it under the terms of the GNU General Public License as published by
31
31
    )
32
32
from bzrlib.tests import (
33
33
    TestCaseWithTransport,
34
 
    scenarios,
 
34
    condition_isinstance,
 
35
    multiply_tests,
 
36
    split_suite_by_condition,
35
37
    )
36
38
 
37
39
 
38
 
load_tests = scenarios.load_tests_apply_scenarios
39
 
 
40
 
 
41
 
def btreeparser_scenarios():
 
40
def load_tests(standard_tests, module, loader):
 
41
    # parameterise the TestBTreeNodes tests
 
42
    node_tests, others = split_suite_by_condition(standard_tests,
 
43
        condition_isinstance(TestBTreeNodes))
42
44
    import bzrlib._btree_serializer_py as py_module
43
45
    scenarios = [('python', {'parse_btree': py_module})]
44
46
    if compiled_btreeparser_feature.available():
45
 
        scenarios.append(('C', 
46
 
            {'parse_btree': compiled_btreeparser_feature.module}))
47
 
    return scenarios
 
47
        scenarios.append(('C', {'parse_btree':
 
48
                                compiled_btreeparser_feature.module}))
 
49
    return multiply_tests(node_tests, scenarios, others)
48
50
 
49
51
 
50
52
compiled_btreeparser_feature = tests.ModuleAvailableFeature(
51
 
    'bzrlib._btree_serializer_pyx')
 
53
                                'bzrlib._btree_serializer_pyx')
52
54
 
53
55
 
54
56
class BTreeTestCase(TestCaseWithTransport):
214
216
        leaf1_bytes = zlib.decompress(leaf1)
215
217
        sorted_node_keys = sorted(node[0] for node in nodes)
216
218
        node = btree_index._LeafNode(leaf1_bytes, 1, 0)
217
 
        self.assertEqual(231, len(node))
218
 
        self.assertEqual(sorted_node_keys[:231], node.all_keys())
 
219
        self.assertEqual(231, len(node.keys))
 
220
        self.assertEqual(sorted_node_keys[:231], sorted(node.keys))
219
221
        leaf2_bytes = zlib.decompress(leaf2)
220
222
        node = btree_index._LeafNode(leaf2_bytes, 1, 0)
221
 
        self.assertEqual(400 - 231, len(node))
222
 
        self.assertEqual(sorted_node_keys[231:], node.all_keys())
 
223
        self.assertEqual(400 - 231, len(node.keys))
 
224
        self.assertEqual(sorted_node_keys[231:], sorted(node.keys))
223
225
 
224
226
    def test_last_page_rounded_1_layer(self):
225
227
        builder = btree_index.BTreeBuilder(key_elements=1, reference_lists=0)
239
241
        leaf2 = content[74:]
240
242
        leaf2_bytes = zlib.decompress(leaf2)
241
243
        node = btree_index._LeafNode(leaf2_bytes, 1, 0)
242
 
        self.assertEqual(10, len(node))
 
244
        self.assertEqual(10, len(node.keys))
243
245
        sorted_node_keys = sorted(node[0] for node in nodes)
244
 
        self.assertEqual(sorted_node_keys, node.all_keys())
 
246
        self.assertEqual(sorted_node_keys, sorted(node.keys))
245
247
 
246
248
    def test_last_page_not_rounded_2_layer(self):
247
249
        builder = btree_index.BTreeBuilder(key_elements=1, reference_lists=0)
261
263
        leaf2 = content[8192:]
262
264
        leaf2_bytes = zlib.decompress(leaf2)
263
265
        node = btree_index._LeafNode(leaf2_bytes, 1, 0)
264
 
        self.assertEqual(400 - 231, len(node))
 
266
        self.assertEqual(400 - 231, len(node.keys))
265
267
        sorted_node_keys = sorted(node[0] for node in nodes)
266
 
        self.assertEqual(sorted_node_keys[231:], node.all_keys())
 
268
        self.assertEqual(sorted_node_keys[231:], sorted(node.keys))
267
269
 
268
270
    def test_three_level_tree_details(self):
269
271
        # The left most pointer in the second internal node in a row should
300
302
        # in the second node it points at
301
303
        pos = index._row_offsets[2] + internal_node2.offset + 1
302
304
        leaf = index._get_leaf_nodes([pos])[pos]
303
 
        self.assertTrue(internal_node2.keys[0] in leaf)
 
305
        self.assertTrue(internal_node2.keys[0] in leaf.keys)
304
306
 
305
307
    def test_2_leaves_2_2(self):
306
308
        builder = btree_index.BTreeBuilder(key_elements=2, reference_lists=2)
726
728
        nodes = dict(index._read_nodes([0]))
727
729
        self.assertEqual([0], nodes.keys())
728
730
        node = nodes[0]
729
 
        self.assertEqual([('key',)], node.all_keys())
 
731
        self.assertEqual([('key',)], node.keys.keys())
730
732
        self.assertEqual([('get', 'index')], trans._activity)
731
733
 
732
734
    def test__read_nodes_no_size_multiple_pages(self):
796
798
    def test_eq_ne(self):
797
799
        # two indices are equal when constructed with the same parameters:
798
800
        t1 = transport.get_transport('trace+' + self.get_url(''))
799
 
        t2 = self.get_transport()
 
801
        t2 = transport.get_transport(self.get_url(''))
800
802
        self.assertTrue(
801
803
            btree_index.BTreeGraphIndex(t1, 'index', None) ==
802
804
            btree_index.BTreeGraphIndex(t1, 'index', None))
1110
1112
        min_l2_key = l2.min_key
1111
1113
        max_l1_key = l1.max_key
1112
1114
        self.assertTrue(max_l1_key < min_l2_key)
1113
 
        parents_min_l2_key = l2[min_l2_key][1][0]
 
1115
        parents_min_l2_key = l2.keys[min_l2_key][1][0]
1114
1116
        self.assertEqual((l1.max_key,), parents_min_l2_key)
1115
1117
        # Now, whatever key we select that would fall on the second page,
1116
1118
        # should give us all the parents until the page break
1129
1131
        parent_map = {}
1130
1132
        search_keys = index._find_ancestors([max_l1_key], 0, parent_map,
1131
1133
                                            missing_keys)
1132
 
        self.assertEqual(l1.all_keys(), sorted(parent_map))
 
1134
        self.assertEqual(sorted(l1.keys), sorted(parent_map))
1133
1135
        self.assertEqual(set(), missing_keys)
1134
1136
        self.assertEqual(set(), search_keys)
1135
1137
 
1151
1153
        for node in nodes:
1152
1154
            builder.add_node(*node)
1153
1155
        stream = builder.finish()
1154
 
        trans = self.get_transport()
 
1156
        trans = transport.get_transport(self.get_url())
1155
1157
        size = trans.put_file('index', stream)
1156
1158
        index = btree_index.BTreeGraphIndex(trans, 'index', size)
1157
1159
        self.assertEqual(500, index.key_count())
1183
1185
 
1184
1186
class TestBTreeNodes(BTreeTestCase):
1185
1187
 
1186
 
    scenarios = btreeparser_scenarios()
1187
 
 
1188
1188
    def setUp(self):
1189
1189
        BTreeTestCase.setUp(self)
1190
1190
        self.overrideAttr(btree_index, '_btree_serializer', self.parse_btree)
1205
1205
            ("2222222222222222222222222222222222222222",): ("value:2", ()),
1206
1206
            ("3333333333333333333333333333333333333333",): ("value:3", ()),
1207
1207
            ("4444444444444444444444444444444444444444",): ("value:4", ()),
1208
 
            }, dict(node.all_items()))
 
1208
            }, node.keys)
1209
1209
 
1210
1210
    def test_LeafNode_2_2(self):
1211
1211
        node_bytes = ("type=leaf\n"
1225
1225
            ('11', '33'): ('value:3',
1226
1226
                ((('11', 'ref22'),), (('11', 'ref22'), ('11', 'ref22')))),
1227
1227
            ('11', '44'): ('value:4', ((), (('11', 'ref00'),)))
1228
 
            }, dict(node.all_items()))
 
1228
            }, node.keys)
1229
1229
 
1230
1230
    def test_InternalNode_1(self):
1231
1231
        node_bytes = ("type=internal\n"
1266
1266
            ('11', '33'): ('value:3',
1267
1267
                ((('11', 'ref22'),), (('11', 'ref22'), ('11', 'ref22')))),
1268
1268
            ('11', '44'): ('value:4', ((), (('11', 'ref00'),)))
1269
 
            }, dict(node.all_items()))
 
1269
            }, node.keys)
1270
1270
 
1271
1271
    def assertFlattened(self, expected, key, value, refs):
1272
1272
        flat_key, flat_line = self.parse_btree._flatten_node(