← 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: Andrew Bennetts
  • Date: 2010-07-29 11:17:57 UTC
  • mfrom: (5050.3.17 2.2)
  • mto: This revision was merged to the branch mainline in revision 5365.
  • Revision ID: andrew.bennetts@canonical.com-20100729111757-018h3pcefo7z0dnq
Merge lp:bzr/2.2 into lp:bzr.

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,
35
 
    )
36
 
from bzrlib.tests import (
37
 
    features,
38
 
    )
39
 
 
40
 
 
41
 
load_tests = scenarios.load_tests_apply_scenarios
42
 
 
43
 
 
44
 
def btreeparser_scenarios():
 
34
    condition_isinstance,
 
35
    multiply_tests,
 
36
    split_suite_by_condition,
 
37
    )
 
38
 
 
39
 
 
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))
45
44
    import bzrlib._btree_serializer_py as py_module
46
45
    scenarios = [('python', {'parse_btree': py_module})]
47
46
    if compiled_btreeparser_feature.available():
48
 
        scenarios.append(('C', 
49
 
            {'parse_btree': compiled_btreeparser_feature.module}))
50
 
    return scenarios
51
 
 
52
 
 
53
 
compiled_btreeparser_feature = features.ModuleAvailableFeature(
54
 
    'bzrlib._btree_serializer_pyx')
 
47
        scenarios.append(('C', {'parse_btree':
 
48
                                compiled_btreeparser_feature.module}))
 
49
    return multiply_tests(node_tests, scenarios, others)
 
50
 
 
51
 
 
52
compiled_btreeparser_feature = tests.ModuleAvailableFeature(
 
53
                                'bzrlib._btree_serializer_pyx')
55
54
 
56
55
 
57
56
class BTreeTestCase(TestCaseWithTransport):
217
216
        leaf1_bytes = zlib.decompress(leaf1)
218
217
        sorted_node_keys = sorted(node[0] for node in nodes)
219
218
        node = btree_index._LeafNode(leaf1_bytes, 1, 0)
220
 
        self.assertEqual(231, len(node))
221
 
        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))
222
221
        leaf2_bytes = zlib.decompress(leaf2)
223
222
        node = btree_index._LeafNode(leaf2_bytes, 1, 0)
224
 
        self.assertEqual(400 - 231, len(node))
225
 
        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))
226
225
 
227
226
    def test_last_page_rounded_1_layer(self):
228
227
        builder = btree_index.BTreeBuilder(key_elements=1, reference_lists=0)
242
241
        leaf2 = content[74:]
243
242
        leaf2_bytes = zlib.decompress(leaf2)
244
243
        node = btree_index._LeafNode(leaf2_bytes, 1, 0)
245
 
        self.assertEqual(10, len(node))
 
244
        self.assertEqual(10, len(node.keys))
246
245
        sorted_node_keys = sorted(node[0] for node in nodes)
247
 
        self.assertEqual(sorted_node_keys, node.all_keys())
 
246
        self.assertEqual(sorted_node_keys, sorted(node.keys))
248
247
 
249
248
    def test_last_page_not_rounded_2_layer(self):
250
249
        builder = btree_index.BTreeBuilder(key_elements=1, reference_lists=0)
264
263
        leaf2 = content[8192:]
265
264
        leaf2_bytes = zlib.decompress(leaf2)
266
265
        node = btree_index._LeafNode(leaf2_bytes, 1, 0)
267
 
        self.assertEqual(400 - 231, len(node))
 
266
        self.assertEqual(400 - 231, len(node.keys))
268
267
        sorted_node_keys = sorted(node[0] for node in nodes)
269
 
        self.assertEqual(sorted_node_keys[231:], node.all_keys())
 
268
        self.assertEqual(sorted_node_keys[231:], sorted(node.keys))
270
269
 
271
270
    def test_three_level_tree_details(self):
272
271
        # The left most pointer in the second internal node in a row should
281
280
 
282
281
        for node in nodes:
283
282
            builder.add_node(*node)
284
 
        t = transport.get_transport_from_url('trace+' + self.get_url(''))
 
283
        t = transport.get_transport('trace+' + self.get_url(''))
285
284
        size = t.put_file('index', self.time(builder.finish))
286
285
        del builder
287
286
        index = btree_index.BTreeGraphIndex(t, 'index', size)
303
302
        # in the second node it points at
304
303
        pos = index._row_offsets[2] + internal_node2.offset + 1
305
304
        leaf = index._get_leaf_nodes([pos])[pos]
306
 
        self.assertTrue(internal_node2.keys[0] in leaf)
 
305
        self.assertTrue(internal_node2.keys[0] in leaf.keys)
307
306
 
308
307
    def test_2_leaves_2_2(self):
309
308
        builder = btree_index.BTreeBuilder(key_elements=2, reference_lists=2)
608
607
        for key, value, references in nodes:
609
608
            builder.add_node(key, value, references)
610
609
        stream = builder.finish()
611
 
        trans = transport.get_transport_from_url('trace+' + self.get_url())
 
610
        trans = transport.get_transport('trace+' + self.get_url())
612
611
        size = trans.put_file('index', stream)
613
612
        return btree_index.BTreeGraphIndex(trans, 'index', size)
614
613
 
649
648
        self.assertEqual(0, len(index._leaf_node_cache))
650
649
 
651
650
    def test_trivial_constructor(self):
652
 
        t = transport.get_transport_from_url('trace+' + self.get_url(''))
 
651
        t = transport.get_transport('trace+' + self.get_url(''))
653
652
        index = btree_index.BTreeGraphIndex(t, 'index', None)
654
653
        # Checks the page size at load, but that isn't logged yet.
655
654
        self.assertEqual([], t._activity)
656
655
 
657
656
    def test_with_size_constructor(self):
658
 
        t = transport.get_transport_from_url('trace+' + self.get_url(''))
 
657
        t = transport.get_transport('trace+' + self.get_url(''))
659
658
        index = btree_index.BTreeGraphIndex(t, 'index', 1)
660
659
        # Checks the page size at load, but that isn't logged yet.
661
660
        self.assertEqual([], t._activity)
662
661
 
663
662
    def test_empty_key_count_no_size(self):
664
663
        builder = btree_index.BTreeBuilder(key_elements=1, reference_lists=0)
665
 
        t = transport.get_transport_from_url('trace+' + self.get_url(''))
 
664
        t = transport.get_transport('trace+' + self.get_url(''))
666
665
        t.put_file('index', builder.finish())
667
666
        index = btree_index.BTreeGraphIndex(t, 'index', None)
668
667
        del t._activity[:]
675
674
 
676
675
    def test_empty_key_count(self):
677
676
        builder = btree_index.BTreeBuilder(key_elements=1, reference_lists=0)
678
 
        t = transport.get_transport_from_url('trace+' + self.get_url(''))
 
677
        t = transport.get_transport('trace+' + self.get_url(''))
679
678
        size = t.put_file('index', builder.finish())
680
679
        self.assertEqual(72, size)
681
680
        index = btree_index.BTreeGraphIndex(t, 'index', size)
691
690
        nodes = self.make_nodes(35, 2, 2)
692
691
        for node in nodes:
693
692
            builder.add_node(*node)
694
 
        t = transport.get_transport_from_url('trace+' + self.get_url(''))
 
693
        t = transport.get_transport('trace+' + self.get_url(''))
695
694
        size = t.put_file('index', builder.finish())
696
695
        index = btree_index.BTreeGraphIndex(t, 'index', size)
697
696
        del t._activity[:]
723
722
 
724
723
    def test__read_nodes_no_size_one_page_reads_once(self):
725
724
        self.make_index(nodes=[(('key',), 'value', ())])
726
 
        trans = transport.get_transport_from_url('trace+' + self.get_url())
 
725
        trans = transport.get_transport('trace+' + self.get_url())
727
726
        index = btree_index.BTreeGraphIndex(trans, 'index', None)
728
727
        del trans._activity[:]
729
728
        nodes = dict(index._read_nodes([0]))
730
729
        self.assertEqual([0], nodes.keys())
731
730
        node = nodes[0]
732
 
        self.assertEqual([('key',)], node.all_keys())
 
731
        self.assertEqual([('key',)], node.keys.keys())
733
732
        self.assertEqual([('get', 'index')], trans._activity)
734
733
 
735
734
    def test__read_nodes_no_size_multiple_pages(self):
737
736
        index.key_count()
738
737
        num_pages = index._row_offsets[-1]
739
738
        # Reopen with a traced transport and no size
740
 
        trans = transport.get_transport_from_url('trace+' + self.get_url())
 
739
        trans = transport.get_transport('trace+' + self.get_url())
741
740
        index = btree_index.BTreeGraphIndex(trans, 'index', None)
742
741
        del trans._activity[:]
743
742
        nodes = dict(index._read_nodes([0]))
748
747
        nodes = self.make_nodes(160, 2, 2)
749
748
        for node in nodes:
750
749
            builder.add_node(*node)
751
 
        t = transport.get_transport_from_url('trace+' + self.get_url(''))
 
750
        t = transport.get_transport('trace+' + self.get_url(''))
752
751
        size = t.put_file('index', builder.finish())
753
752
        self.assertEqual(17692, size)
754
753
        index = btree_index.BTreeGraphIndex(t, 'index', size)
764
763
        nodes = self.make_nodes(45, 2, 2)
765
764
        for node in nodes:
766
765
            builder.add_node(*node)
767
 
        t = transport.get_transport_from_url('trace+' + self.get_url(''))
 
766
        t = transport.get_transport('trace+' + self.get_url(''))
768
767
        size = t.put_file('index', builder.finish())
769
768
        index = btree_index.BTreeGraphIndex(t, 'index', size)
770
769
        del t._activity[:]
780
779
        nodes = self.make_nodes(80, 2, 2)
781
780
        for node in nodes:
782
781
            builder.add_node(*node)
783
 
        t = transport.get_transport_from_url('trace+' + self.get_url(''))
 
782
        t = transport.get_transport('trace+' + self.get_url(''))
784
783
        size = t.put_file('index', builder.finish())
785
784
        # Root page, 2 leaf pages
786
785
        self.assertEqual(9339, size)
798
797
 
799
798
    def test_eq_ne(self):
800
799
        # two indices are equal when constructed with the same parameters:
801
 
        t1 = transport.get_transport_from_url('trace+' + self.get_url(''))
802
 
        t2 = self.get_transport()
 
800
        t1 = transport.get_transport('trace+' + self.get_url(''))
 
801
        t2 = transport.get_transport(self.get_url(''))
803
802
        self.assertTrue(
804
803
            btree_index.BTreeGraphIndex(t1, 'index', None) ==
805
804
            btree_index.BTreeGraphIndex(t1, 'index', None))
833
832
 
834
833
    def test_iter_all_only_root_no_size(self):
835
834
        self.make_index(nodes=[(('key',), 'value', ())])
836
 
        t = transport.get_transport_from_url('trace+' + self.get_url(''))
 
835
        t = transport.get_transport('trace+' + self.get_url(''))
837
836
        index = btree_index.BTreeGraphIndex(t, 'index', None)
838
837
        del t._activity[:]
839
838
        self.assertEqual([(('key',), 'value')],
850
849
        nodes = self.make_nodes(10000, 2, 2)
851
850
        for node in nodes:
852
851
            builder.add_node(*node)
853
 
        t = transport.get_transport_from_url('trace+' + self.get_url(''))
 
852
        t = transport.get_transport('trace+' + self.get_url(''))
854
853
        size = t.put_file('index', builder.finish())
855
854
        self.assertEqual(1303220, size, 'number of expected bytes in the'
856
855
                                        ' output changed')
905
904
        nodes = self.make_nodes(160, 2, 2)
906
905
        for node in nodes:
907
906
            builder.add_node(*node)
908
 
        t = transport.get_transport_from_url('trace+' + self.get_url(''))
 
907
        t = transport.get_transport('trace+' + self.get_url(''))
909
908
        size = t.put_file('index', builder.finish())
910
909
        del builder
911
910
        index = btree_index.BTreeGraphIndex(t, 'index', size)
1113
1112
        min_l2_key = l2.min_key
1114
1113
        max_l1_key = l1.max_key
1115
1114
        self.assertTrue(max_l1_key < min_l2_key)
1116
 
        parents_min_l2_key = l2[min_l2_key][1][0]
 
1115
        parents_min_l2_key = l2.keys[min_l2_key][1][0]
1117
1116
        self.assertEqual((l1.max_key,), parents_min_l2_key)
1118
1117
        # Now, whatever key we select that would fall on the second page,
1119
1118
        # should give us all the parents until the page break
1132
1131
        parent_map = {}
1133
1132
        search_keys = index._find_ancestors([max_l1_key], 0, parent_map,
1134
1133
                                            missing_keys)
1135
 
        self.assertEqual(l1.all_keys(), sorted(parent_map))
 
1134
        self.assertEqual(sorted(l1.keys), sorted(parent_map))
1136
1135
        self.assertEqual(set(), missing_keys)
1137
1136
        self.assertEqual(set(), search_keys)
1138
1137
 
1154
1153
        for node in nodes:
1155
1154
            builder.add_node(*node)
1156
1155
        stream = builder.finish()
1157
 
        trans = self.get_transport()
 
1156
        trans = transport.get_transport(self.get_url())
1158
1157
        size = trans.put_file('index', stream)
1159
1158
        index = btree_index.BTreeGraphIndex(trans, 'index', size)
1160
1159
        self.assertEqual(500, index.key_count())
1186
1185
 
1187
1186
class TestBTreeNodes(BTreeTestCase):
1188
1187
 
1189
 
    scenarios = btreeparser_scenarios()
1190
 
 
1191
1188
    def setUp(self):
1192
1189
        BTreeTestCase.setUp(self)
1193
1190
        self.overrideAttr(btree_index, '_btree_serializer', self.parse_btree)
1208
1205
            ("2222222222222222222222222222222222222222",): ("value:2", ()),
1209
1206
            ("3333333333333333333333333333333333333333",): ("value:3", ()),
1210
1207
            ("4444444444444444444444444444444444444444",): ("value:4", ()),
1211
 
            }, dict(node.all_items()))
 
1208
            }, node.keys)
1212
1209
 
1213
1210
    def test_LeafNode_2_2(self):
1214
1211
        node_bytes = ("type=leaf\n"
1228
1225
            ('11', '33'): ('value:3',
1229
1226
                ((('11', 'ref22'),), (('11', 'ref22'), ('11', 'ref22')))),
1230
1227
            ('11', '44'): ('value:4', ((), (('11', 'ref00'),)))
1231
 
            }, dict(node.all_items()))
 
1228
            }, node.keys)
1232
1229
 
1233
1230
    def test_InternalNode_1(self):
1234
1231
        node_bytes = ("type=internal\n"
1269
1266
            ('11', '33'): ('value:3',
1270
1267
                ((('11', 'ref22'),), (('11', 'ref22'), ('11', 'ref22')))),
1271
1268
            ('11', '44'): ('value:4', ((), (('11', 'ref00'),)))
1272
 
            }, dict(node.all_items()))
 
1269
            }, node.keys)
1273
1270
 
1274
1271
    def assertFlattened(self, expected, key, value, refs):
1275
1272
        flat_key, flat_line = self.parse_btree._flatten_node(
1354
1351
        BTreeGraphIndex with the recommended information.
1355
1352
        """
1356
1353
        index = btree_index.BTreeGraphIndex(
1357
 
            transport.get_transport_from_url('memory:///'),
1358
 
            'test-index', size=size)
 
1354
            transport.get_transport('memory:///'), 'test-index', size=size)
1359
1355
        if recommended_pages is not None:
1360
1356
            index._recommended_pages = recommended_pages
1361
1357
        return index