← 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: 2009-10-29 06:11:23 UTC
  • mto: This revision was merged to the branch mainline in revision 4776.
  • Revision ID: mbp@sourcefrog.net-20091029061123-vyjm0si2r97rgsp2
one more the the

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 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
27
27
    lru_cache,
28
28
    osutils,
29
29
    tests,
30
 
    transport,
31
30
    )
32
31
from bzrlib.tests import (
33
32
    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():
 
33
    condition_isinstance,
 
34
    multiply_tests,
 
35
    split_suite_by_condition,
 
36
    )
 
37
from bzrlib.transport import get_transport
 
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
 
    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')
 
46
    if CompiledBtreeParserFeature.available():
 
47
        # Is there a way to do this that gets missing feature failures rather
 
48
        # than no indication to the user?
 
49
        import bzrlib._btree_serializer_pyx as c_module
 
50
        scenarios.append(('C', {'parse_btree': c_module}))
 
51
    return multiply_tests(node_tests, scenarios, others)
 
52
 
 
53
 
 
54
class _CompiledBtreeParserFeature(tests.Feature):
 
55
    def _probe(self):
 
56
        try:
 
57
            import bzrlib._btree_serializer_pyx
 
58
        except ImportError:
 
59
            return False
 
60
        return True
 
61
 
 
62
    def feature_name(self):
 
63
        return 'bzrlib._btree_serializer_pyx'
 
64
 
 
65
CompiledBtreeParserFeature = _CompiledBtreeParserFeature()
55
66
 
56
67
 
57
68
class BTreeTestCase(TestCaseWithTransport):
60
71
 
61
72
    def setUp(self):
62
73
        TestCaseWithTransport.setUp(self)
63
 
        self.overrideAttr(btree_index, '_RESERVED_HEADER_BYTES', 100)
 
74
        self._original_header = btree_index._RESERVED_HEADER_BYTES
 
75
        def restore():
 
76
            btree_index._RESERVED_HEADER_BYTES = self._original_header
 
77
        self.addCleanup(restore)
 
78
        btree_index._RESERVED_HEADER_BYTES = 100
64
79
 
65
80
    def make_nodes(self, count, key_elements, reference_lists):
66
81
        """Generate count*key_elements sample nodes."""
100
115
 
101
116
    def shrink_page_size(self):
102
117
        """Shrink the default page size so that less fits in a page."""
103
 
        self.overrideAttr(btree_index, '_PAGE_SIZE')
 
118
        old_page_size = btree_index._PAGE_SIZE
 
119
        def cleanup():
 
120
            btree_index._PAGE_SIZE = old_page_size
 
121
        self.addCleanup(cleanup)
104
122
        btree_index._PAGE_SIZE = 2048
105
123
 
106
124
 
143
161
        temp_file = builder.finish()
144
162
        content = temp_file.read()
145
163
        del temp_file
146
 
        self.assertEqual(131, len(content))
 
164
        self.assertEqual(158, len(content))
147
165
        self.assertEqual(
148
166
            "B+Tree Graph Index 2\nnode_ref_lists=0\nkey_elements=1\nlen=5\n"
149
167
            "row_lengths=1\n",
167
185
        temp_file = builder.finish()
168
186
        content = temp_file.read()
169
187
        del temp_file
170
 
        self.assertEqual(238, len(content))
 
188
        self.assertEqual(264, len(content))
171
189
        self.assertEqual(
172
190
            "B+Tree Graph Index 2\nnode_ref_lists=2\nkey_elements=2\nlen=10\n"
173
191
            "row_lengths=1\n",
217
235
        leaf1_bytes = zlib.decompress(leaf1)
218
236
        sorted_node_keys = sorted(node[0] for node in nodes)
219
237
        node = btree_index._LeafNode(leaf1_bytes, 1, 0)
220
 
        self.assertEqual(231, len(node))
221
 
        self.assertEqual(sorted_node_keys[:231], node.all_keys())
 
238
        self.assertEqual(231, len(node.keys))
 
239
        self.assertEqual(sorted_node_keys[:231], sorted(node.keys))
222
240
        leaf2_bytes = zlib.decompress(leaf2)
223
241
        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())
 
242
        self.assertEqual(400 - 231, len(node.keys))
 
243
        self.assertEqual(sorted_node_keys[231:], sorted(node.keys))
226
244
 
227
245
    def test_last_page_rounded_1_layer(self):
228
246
        builder = btree_index.BTreeBuilder(key_elements=1, reference_lists=0)
233
251
        temp_file = builder.finish()
234
252
        content = temp_file.read()
235
253
        del temp_file
236
 
        self.assertEqual(155, len(content))
 
254
        self.assertEqual(181, len(content))
237
255
        self.assertEqual(
238
256
            "B+Tree Graph Index 2\nnode_ref_lists=0\nkey_elements=1\nlen=10\n"
239
257
            "row_lengths=1\n",
242
260
        leaf2 = content[74:]
243
261
        leaf2_bytes = zlib.decompress(leaf2)
244
262
        node = btree_index._LeafNode(leaf2_bytes, 1, 0)
245
 
        self.assertEqual(10, len(node))
 
263
        self.assertEqual(10, len(node.keys))
246
264
        sorted_node_keys = sorted(node[0] for node in nodes)
247
 
        self.assertEqual(sorted_node_keys, node.all_keys())
 
265
        self.assertEqual(sorted_node_keys, sorted(node.keys))
248
266
 
249
267
    def test_last_page_not_rounded_2_layer(self):
250
268
        builder = btree_index.BTreeBuilder(key_elements=1, reference_lists=0)
264
282
        leaf2 = content[8192:]
265
283
        leaf2_bytes = zlib.decompress(leaf2)
266
284
        node = btree_index._LeafNode(leaf2_bytes, 1, 0)
267
 
        self.assertEqual(400 - 231, len(node))
 
285
        self.assertEqual(400 - 231, len(node.keys))
268
286
        sorted_node_keys = sorted(node[0] for node in nodes)
269
 
        self.assertEqual(sorted_node_keys[231:], node.all_keys())
 
287
        self.assertEqual(sorted_node_keys[231:], sorted(node.keys))
270
288
 
271
289
    def test_three_level_tree_details(self):
272
290
        # The left most pointer in the second internal node in a row should
281
299
 
282
300
        for node in nodes:
283
301
            builder.add_node(*node)
284
 
        t = transport.get_transport('trace+' + self.get_url(''))
285
 
        size = t.put_file('index', self.time(builder.finish))
 
302
        transport = get_transport('trace+' + self.get_url(''))
 
303
        size = transport.put_file('index', self.time(builder.finish))
286
304
        del builder
287
 
        index = btree_index.BTreeGraphIndex(t, 'index', size)
 
305
        index = btree_index.BTreeGraphIndex(transport, 'index', size)
288
306
        # Seed the metadata, we're using internal calls now.
289
307
        index.key_count()
290
308
        self.assertEqual(3, len(index._row_lengths),
303
321
        # in the second node it points at
304
322
        pos = index._row_offsets[2] + internal_node2.offset + 1
305
323
        leaf = index._get_leaf_nodes([pos])[pos]
306
 
        self.assertTrue(internal_node2.keys[0] in leaf)
 
324
        self.assertTrue(internal_node2.keys[0] in leaf.keys)
307
325
 
308
326
    def test_2_leaves_2_2(self):
309
327
        builder = btree_index.BTreeBuilder(key_elements=2, reference_lists=2)
341
359
        # Test the parts of the index that take up memory are doing so
342
360
        # predictably.
343
361
        self.assertEqual(1, len(builder._nodes))
 
362
        self.assertEqual(1, len(builder._keys))
344
363
        self.assertIs(None, builder._nodes_by_key)
345
364
        builder.add_node(*nodes[1])
346
365
        self.assertEqual(0, len(builder._nodes))
 
366
        self.assertEqual(0, len(builder._keys))
347
367
        self.assertIs(None, builder._nodes_by_key)
348
368
        self.assertEqual(1, len(builder._backing_indices))
349
369
        self.assertEqual(2, builder._backing_indices[0].key_count())
350
370
        # now back to memory
351
371
        builder.add_node(*nodes[2])
352
372
        self.assertEqual(1, len(builder._nodes))
 
373
        self.assertEqual(1, len(builder._keys))
353
374
        self.assertIs(None, builder._nodes_by_key)
354
375
        # And spills to a second backing index combing all
355
376
        builder.add_node(*nodes[3])
356
377
        self.assertEqual(0, len(builder._nodes))
 
378
        self.assertEqual(0, len(builder._keys))
357
379
        self.assertIs(None, builder._nodes_by_key)
358
380
        self.assertEqual(2, len(builder._backing_indices))
359
381
        self.assertEqual(None, builder._backing_indices[0])
362
384
        builder.add_node(*nodes[4])
363
385
        builder.add_node(*nodes[5])
364
386
        self.assertEqual(0, len(builder._nodes))
 
387
        self.assertEqual(0, len(builder._keys))
365
388
        self.assertIs(None, builder._nodes_by_key)
366
389
        self.assertEqual(2, len(builder._backing_indices))
367
390
        self.assertEqual(2, builder._backing_indices[0].key_count())
410
433
        self.assertEqual(None, builder._backing_indices[2])
411
434
        self.assertEqual(16, builder._backing_indices[3].key_count())
412
435
        # Now finish, and check we got a correctly ordered tree
413
 
        t = self.get_transport('')
414
 
        size = t.put_file('index', builder.finish())
415
 
        index = btree_index.BTreeGraphIndex(t, 'index', size)
 
436
        transport = self.get_transport('')
 
437
        size = transport.put_file('index', builder.finish())
 
438
        index = btree_index.BTreeGraphIndex(transport, 'index', size)
416
439
        nodes = list(index.iter_all_entries())
417
440
        self.assertEqual(sorted(nodes), nodes)
418
441
        self.assertEqual(16, len(nodes))
425
448
        # Test the parts of the index that take up memory are doing so
426
449
        # predictably.
427
450
        self.assertEqual(1, len(builder._nodes))
 
451
        self.assertEqual(1, len(builder._keys))
428
452
        self.assertIs(None, builder._nodes_by_key)
429
453
        builder.add_node(*nodes[1])
430
454
        self.assertEqual(0, len(builder._nodes))
 
455
        self.assertEqual(0, len(builder._keys))
431
456
        self.assertIs(None, builder._nodes_by_key)
432
457
        self.assertEqual(1, len(builder._backing_indices))
433
458
        self.assertEqual(2, builder._backing_indices[0].key_count())
434
459
        # now back to memory
435
460
        builder.add_node(*nodes[2])
436
461
        self.assertEqual(1, len(builder._nodes))
 
462
        self.assertEqual(1, len(builder._keys))
437
463
        self.assertIs(None, builder._nodes_by_key)
438
464
        # And spills to a second backing index but doesn't combine
439
465
        builder.add_node(*nodes[3])
440
466
        self.assertEqual(0, len(builder._nodes))
 
467
        self.assertEqual(0, len(builder._keys))
441
468
        self.assertIs(None, builder._nodes_by_key)
442
469
        self.assertEqual(2, len(builder._backing_indices))
443
470
        for backing_index in builder._backing_indices:
446
473
        builder.add_node(*nodes[4])
447
474
        builder.add_node(*nodes[5])
448
475
        self.assertEqual(0, len(builder._nodes))
 
476
        self.assertEqual(0, len(builder._keys))
449
477
        self.assertIs(None, builder._nodes_by_key)
450
478
        self.assertEqual(3, len(builder._backing_indices))
451
479
        for backing_index in builder._backing_indices:
510
538
        builder.add_node(*nodes[0])
511
539
        # Test the parts of the index that take up memory are doing so
512
540
        # predictably.
 
541
        self.assertEqual(1, len(builder._keys))
513
542
        self.assertEqual(1, len(builder._nodes))
514
543
        self.assertIs(None, builder._nodes_by_key)
515
544
        builder.add_node(*nodes[1])
 
545
        self.assertEqual(0, len(builder._keys))
516
546
        self.assertEqual(0, len(builder._nodes))
517
547
        self.assertIs(None, builder._nodes_by_key)
518
548
        self.assertEqual(1, len(builder._backing_indices))
521
551
        old = dict(builder._get_nodes_by_key()) #Build up the nodes by key dict
522
552
        builder.add_node(*nodes[2])
523
553
        self.assertEqual(1, len(builder._nodes))
 
554
        self.assertEqual(1, len(builder._keys))
524
555
        self.assertIsNot(None, builder._nodes_by_key)
525
556
        self.assertNotEqual({}, builder._nodes_by_key)
526
557
        # We should have a new entry
528
559
        # And spills to a second backing index combing all
529
560
        builder.add_node(*nodes[3])
530
561
        self.assertEqual(0, len(builder._nodes))
 
562
        self.assertEqual(0, len(builder._keys))
531
563
        self.assertIs(None, builder._nodes_by_key)
532
564
        self.assertEqual(2, len(builder._backing_indices))
533
565
        self.assertEqual(None, builder._backing_indices[0])
536
568
        builder.add_node(*nodes[4])
537
569
        builder.add_node(*nodes[5])
538
570
        self.assertEqual(0, len(builder._nodes))
 
571
        self.assertEqual(0, len(builder._keys))
539
572
        self.assertIs(None, builder._nodes_by_key)
540
573
        self.assertEqual(2, len(builder._backing_indices))
541
574
        self.assertEqual(2, builder._backing_indices[0].key_count())
608
641
        for key, value, references in nodes:
609
642
            builder.add_node(key, value, references)
610
643
        stream = builder.finish()
611
 
        trans = transport.get_transport('trace+' + self.get_url())
 
644
        trans = get_transport('trace+' + self.get_url())
612
645
        size = trans.put_file('index', stream)
613
646
        return btree_index.BTreeGraphIndex(trans, 'index', size)
614
647
 
615
 
    def make_index_with_offset(self, ref_lists=1, key_elements=1, nodes=[],
616
 
                               offset=0):
617
 
        builder = btree_index.BTreeBuilder(key_elements=key_elements,
618
 
                                           reference_lists=ref_lists)
619
 
        builder.add_nodes(nodes)
620
 
        transport = self.get_transport('')
621
 
        # NamedTemporaryFile dies on builder.finish().read(). weird.
622
 
        temp_file = builder.finish()
623
 
        content = temp_file.read()
624
 
        del temp_file
625
 
        size = len(content)
626
 
        transport.put_bytes('index', (' '*offset)+content)
627
 
        return btree_index.BTreeGraphIndex(transport, 'index', size=size,
628
 
                                           offset=offset)
629
 
 
630
648
    def test_clear_cache(self):
631
649
        nodes = self.make_nodes(160, 2, 2)
632
650
        index = self.make_index(ref_lists=2, key_elements=2, nodes=nodes)
649
667
        self.assertEqual(0, len(index._leaf_node_cache))
650
668
 
651
669
    def test_trivial_constructor(self):
652
 
        t = transport.get_transport('trace+' + self.get_url(''))
653
 
        index = btree_index.BTreeGraphIndex(t, 'index', None)
 
670
        transport = get_transport('trace+' + self.get_url(''))
 
671
        index = btree_index.BTreeGraphIndex(transport, 'index', None)
654
672
        # Checks the page size at load, but that isn't logged yet.
655
 
        self.assertEqual([], t._activity)
 
673
        self.assertEqual([], transport._activity)
656
674
 
657
675
    def test_with_size_constructor(self):
658
 
        t = transport.get_transport('trace+' + self.get_url(''))
659
 
        index = btree_index.BTreeGraphIndex(t, 'index', 1)
 
676
        transport = get_transport('trace+' + self.get_url(''))
 
677
        index = btree_index.BTreeGraphIndex(transport, 'index', 1)
660
678
        # Checks the page size at load, but that isn't logged yet.
661
 
        self.assertEqual([], t._activity)
 
679
        self.assertEqual([], transport._activity)
662
680
 
663
681
    def test_empty_key_count_no_size(self):
664
682
        builder = btree_index.BTreeBuilder(key_elements=1, reference_lists=0)
665
 
        t = transport.get_transport('trace+' + self.get_url(''))
666
 
        t.put_file('index', builder.finish())
667
 
        index = btree_index.BTreeGraphIndex(t, 'index', None)
668
 
        del t._activity[:]
669
 
        self.assertEqual([], t._activity)
 
683
        transport = get_transport('trace+' + self.get_url(''))
 
684
        transport.put_file('index', builder.finish())
 
685
        index = btree_index.BTreeGraphIndex(transport, 'index', None)
 
686
        del transport._activity[:]
 
687
        self.assertEqual([], transport._activity)
670
688
        self.assertEqual(0, index.key_count())
671
689
        # The entire index should have been requested (as we generally have the
672
690
        # size available, and doing many small readvs is inappropriate).
673
691
        # We can't tell how much was actually read here, but - check the code.
674
 
        self.assertEqual([('get', 'index')], t._activity)
 
692
        self.assertEqual([('get', 'index')], transport._activity)
675
693
 
676
694
    def test_empty_key_count(self):
677
695
        builder = btree_index.BTreeBuilder(key_elements=1, reference_lists=0)
678
 
        t = transport.get_transport('trace+' + self.get_url(''))
679
 
        size = t.put_file('index', builder.finish())
 
696
        transport = get_transport('trace+' + self.get_url(''))
 
697
        size = transport.put_file('index', builder.finish())
680
698
        self.assertEqual(72, size)
681
 
        index = btree_index.BTreeGraphIndex(t, 'index', size)
682
 
        del t._activity[:]
683
 
        self.assertEqual([], t._activity)
 
699
        index = btree_index.BTreeGraphIndex(transport, 'index', size)
 
700
        del transport._activity[:]
 
701
        self.assertEqual([], transport._activity)
684
702
        self.assertEqual(0, index.key_count())
685
703
        # The entire index should have been read, as 4K > size
686
704
        self.assertEqual([('readv', 'index', [(0, 72)], False, None)],
687
 
                         t._activity)
 
705
            transport._activity)
688
706
 
689
707
    def test_non_empty_key_count_2_2(self):
690
708
        builder = btree_index.BTreeBuilder(key_elements=2, reference_lists=2)
691
709
        nodes = self.make_nodes(35, 2, 2)
692
710
        for node in nodes:
693
711
            builder.add_node(*node)
694
 
        t = transport.get_transport('trace+' + self.get_url(''))
695
 
        size = t.put_file('index', builder.finish())
696
 
        index = btree_index.BTreeGraphIndex(t, 'index', size)
697
 
        del t._activity[:]
698
 
        self.assertEqual([], t._activity)
 
712
        transport = get_transport('trace+' + self.get_url(''))
 
713
        size = transport.put_file('index', builder.finish())
 
714
        index = btree_index.BTreeGraphIndex(transport, 'index', size)
 
715
        del transport._activity[:]
 
716
        self.assertEqual([], transport._activity)
699
717
        self.assertEqual(70, index.key_count())
700
718
        # The entire index should have been read, as it is one page long.
701
719
        self.assertEqual([('readv', 'index', [(0, size)], False, None)],
702
 
            t._activity)
703
 
        self.assertEqual(1173, size)
704
 
 
705
 
    def test_with_offset_no_size(self):
706
 
        index = self.make_index_with_offset(key_elements=1, ref_lists=1,
707
 
                                            offset=1234,
708
 
                                            nodes=self.make_nodes(200, 1, 1))
709
 
        index._size = None # throw away the size info
710
 
        self.assertEqual(200, index.key_count())
711
 
 
712
 
    def test_with_small_offset(self):
713
 
        index = self.make_index_with_offset(key_elements=1, ref_lists=1,
714
 
                                            offset=1234,
715
 
                                            nodes=self.make_nodes(200, 1, 1))
716
 
        self.assertEqual(200, index.key_count())
717
 
 
718
 
    def test_with_large_offset(self):
719
 
        index = self.make_index_with_offset(key_elements=1, ref_lists=1,
720
 
                                            offset=123456,
721
 
                                            nodes=self.make_nodes(200, 1, 1))
722
 
        self.assertEqual(200, index.key_count())
 
720
            transport._activity)
 
721
        self.assertEqual(1199, size)
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('trace+' + self.get_url())
 
725
        trans = 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('trace+' + self.get_url())
 
739
        trans = 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('trace+' + self.get_url(''))
752
 
        size = t.put_file('index', builder.finish())
 
750
        transport = get_transport('trace+' + self.get_url(''))
 
751
        size = transport.put_file('index', builder.finish())
753
752
        self.assertEqual(17692, size)
754
 
        index = btree_index.BTreeGraphIndex(t, 'index', size)
755
 
        del t._activity[:]
756
 
        self.assertEqual([], t._activity)
 
753
        index = btree_index.BTreeGraphIndex(transport, 'index', size)
 
754
        del transport._activity[:]
 
755
        self.assertEqual([], transport._activity)
757
756
        self.assertEqual(320, index.key_count())
758
757
        # The entire index should not have been read.
759
758
        self.assertEqual([('readv', 'index', [(0, 4096)], False, None)],
760
 
                         t._activity)
 
759
            transport._activity)
761
760
 
762
761
    def test_validate_one_page(self):
763
762
        builder = btree_index.BTreeBuilder(key_elements=2, reference_lists=2)
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('trace+' + self.get_url(''))
768
 
        size = t.put_file('index', builder.finish())
769
 
        index = btree_index.BTreeGraphIndex(t, 'index', size)
770
 
        del t._activity[:]
771
 
        self.assertEqual([], t._activity)
 
766
        transport = get_transport('trace+' + self.get_url(''))
 
767
        size = transport.put_file('index', builder.finish())
 
768
        index = btree_index.BTreeGraphIndex(transport, 'index', size)
 
769
        del transport._activity[:]
 
770
        self.assertEqual([], transport._activity)
772
771
        index.validate()
773
772
        # The entire index should have been read linearly.
774
773
        self.assertEqual([('readv', 'index', [(0, size)], False, None)],
775
 
                         t._activity)
776
 
        self.assertEqual(1488, size)
 
774
            transport._activity)
 
775
        self.assertEqual(1514, size)
777
776
 
778
777
    def test_validate_two_pages(self):
779
778
        builder = btree_index.BTreeBuilder(key_elements=2, reference_lists=2)
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('trace+' + self.get_url(''))
784
 
        size = t.put_file('index', builder.finish())
 
782
        transport = get_transport('trace+' + self.get_url(''))
 
783
        size = transport.put_file('index', builder.finish())
785
784
        # Root page, 2 leaf pages
786
785
        self.assertEqual(9339, size)
787
 
        index = btree_index.BTreeGraphIndex(t, 'index', size)
788
 
        del t._activity[:]
789
 
        self.assertEqual([], t._activity)
 
786
        index = btree_index.BTreeGraphIndex(transport, 'index', size)
 
787
        del transport._activity[:]
 
788
        self.assertEqual([], transport._activity)
790
789
        index.validate()
791
790
        # The entire index should have been read linearly.
792
 
        self.assertEqual(
793
 
            [('readv', 'index', [(0, 4096)], False, None),
794
 
             ('readv', 'index', [(4096, 4096), (8192, 1147)], False, None)],
795
 
            t._activity)
 
791
        self.assertEqual([('readv', 'index', [(0, 4096)], False, None),
 
792
            ('readv', 'index', [(4096, 4096), (8192, 1147)], False, None)],
 
793
            transport._activity)
796
794
        # XXX: TODO: write some badly-ordered nodes, and some pointers-to-wrong
797
795
        # node and make validate find them.
798
796
 
799
797
    def test_eq_ne(self):
800
798
        # two indices are equal when constructed with the same parameters:
801
 
        t1 = transport.get_transport('trace+' + self.get_url(''))
802
 
        t2 = self.get_transport()
803
 
        self.assertTrue(
804
 
            btree_index.BTreeGraphIndex(t1, 'index', None) ==
805
 
            btree_index.BTreeGraphIndex(t1, 'index', None))
806
 
        self.assertTrue(
807
 
            btree_index.BTreeGraphIndex(t1, 'index', 20) ==
808
 
            btree_index.BTreeGraphIndex(t1, 'index', 20))
809
 
        self.assertFalse(
810
 
            btree_index.BTreeGraphIndex(t1, 'index', 20) ==
811
 
            btree_index.BTreeGraphIndex(t2, 'index', 20))
812
 
        self.assertFalse(
813
 
            btree_index.BTreeGraphIndex(t1, 'inde1', 20) ==
814
 
            btree_index.BTreeGraphIndex(t1, 'inde2', 20))
815
 
        self.assertFalse(
816
 
            btree_index.BTreeGraphIndex(t1, 'index', 10) ==
817
 
            btree_index.BTreeGraphIndex(t1, 'index', 20))
818
 
        self.assertFalse(
819
 
            btree_index.BTreeGraphIndex(t1, 'index', None) !=
820
 
            btree_index.BTreeGraphIndex(t1, 'index', None))
821
 
        self.assertFalse(
822
 
            btree_index.BTreeGraphIndex(t1, 'index', 20) !=
823
 
            btree_index.BTreeGraphIndex(t1, 'index', 20))
824
 
        self.assertTrue(
825
 
            btree_index.BTreeGraphIndex(t1, 'index', 20) !=
826
 
            btree_index.BTreeGraphIndex(t2, 'index', 20))
827
 
        self.assertTrue(
828
 
            btree_index.BTreeGraphIndex(t1, 'inde1', 20) !=
829
 
            btree_index.BTreeGraphIndex(t1, 'inde2', 20))
830
 
        self.assertTrue(
831
 
            btree_index.BTreeGraphIndex(t1, 'index', 10) !=
832
 
            btree_index.BTreeGraphIndex(t1, 'index', 20))
 
799
        transport1 = get_transport('trace+' + self.get_url(''))
 
800
        transport2 = get_transport(self.get_url(''))
 
801
        self.assertTrue(
 
802
            btree_index.BTreeGraphIndex(transport1, 'index', None) ==
 
803
            btree_index.BTreeGraphIndex(transport1, 'index', None))
 
804
        self.assertTrue(
 
805
            btree_index.BTreeGraphIndex(transport1, 'index', 20) ==
 
806
            btree_index.BTreeGraphIndex(transport1, 'index', 20))
 
807
        self.assertFalse(
 
808
            btree_index.BTreeGraphIndex(transport1, 'index', 20) ==
 
809
            btree_index.BTreeGraphIndex(transport2, 'index', 20))
 
810
        self.assertFalse(
 
811
            btree_index.BTreeGraphIndex(transport1, 'inde1', 20) ==
 
812
            btree_index.BTreeGraphIndex(transport1, 'inde2', 20))
 
813
        self.assertFalse(
 
814
            btree_index.BTreeGraphIndex(transport1, 'index', 10) ==
 
815
            btree_index.BTreeGraphIndex(transport1, 'index', 20))
 
816
        self.assertFalse(
 
817
            btree_index.BTreeGraphIndex(transport1, 'index', None) !=
 
818
            btree_index.BTreeGraphIndex(transport1, 'index', None))
 
819
        self.assertFalse(
 
820
            btree_index.BTreeGraphIndex(transport1, 'index', 20) !=
 
821
            btree_index.BTreeGraphIndex(transport1, 'index', 20))
 
822
        self.assertTrue(
 
823
            btree_index.BTreeGraphIndex(transport1, 'index', 20) !=
 
824
            btree_index.BTreeGraphIndex(transport2, 'index', 20))
 
825
        self.assertTrue(
 
826
            btree_index.BTreeGraphIndex(transport1, 'inde1', 20) !=
 
827
            btree_index.BTreeGraphIndex(transport1, 'inde2', 20))
 
828
        self.assertTrue(
 
829
            btree_index.BTreeGraphIndex(transport1, 'index', 10) !=
 
830
            btree_index.BTreeGraphIndex(transport1, 'index', 20))
833
831
 
834
832
    def test_iter_all_only_root_no_size(self):
835
833
        self.make_index(nodes=[(('key',), 'value', ())])
836
 
        t = transport.get_transport('trace+' + self.get_url(''))
837
 
        index = btree_index.BTreeGraphIndex(t, 'index', None)
838
 
        del t._activity[:]
 
834
        trans = get_transport('trace+' + self.get_url(''))
 
835
        index = btree_index.BTreeGraphIndex(trans, 'index', None)
 
836
        del trans._activity[:]
839
837
        self.assertEqual([(('key',), 'value')],
840
838
                         [x[1:] for x in index.iter_all_entries()])
841
 
        self.assertEqual([('get', 'index')], t._activity)
 
839
        self.assertEqual([('get', 'index')], trans._activity)
842
840
 
843
841
    def test_iter_all_entries_reads(self):
844
842
        # iterating all entries reads the header, then does a linear
850
848
        nodes = self.make_nodes(10000, 2, 2)
851
849
        for node in nodes:
852
850
            builder.add_node(*node)
853
 
        t = transport.get_transport('trace+' + self.get_url(''))
854
 
        size = t.put_file('index', builder.finish())
 
851
        transport = get_transport('trace+' + self.get_url(''))
 
852
        size = transport.put_file('index', builder.finish())
855
853
        self.assertEqual(1303220, size, 'number of expected bytes in the'
856
854
                                        ' output changed')
857
855
        page_size = btree_index._PAGE_SIZE
858
856
        del builder
859
 
        index = btree_index.BTreeGraphIndex(t, 'index', size)
860
 
        del t._activity[:]
861
 
        self.assertEqual([], t._activity)
 
857
        index = btree_index.BTreeGraphIndex(transport, 'index', size)
 
858
        del transport._activity[:]
 
859
        self.assertEqual([], transport._activity)
862
860
        found_nodes = self.time(list, index.iter_all_entries())
863
861
        bare_nodes = []
864
862
        for node in found_nodes:
885
883
        readv_request[-1] = (readv_request[-1][0], 1303220 % page_size)
886
884
        expected = [('readv', 'index', [(0, page_size)], False, None),
887
885
             ('readv',  'index', readv_request, False, None)]
888
 
        if expected != t._activity:
 
886
        if expected != transport._activity:
889
887
            self.assertEqualDiff(pprint.pformat(expected),
890
888
                                 pprint.pformat(transport._activity))
891
889
 
905
903
        nodes = self.make_nodes(160, 2, 2)
906
904
        for node in nodes:
907
905
            builder.add_node(*node)
908
 
        t = transport.get_transport('trace+' + self.get_url(''))
909
 
        size = t.put_file('index', builder.finish())
 
906
        transport = get_transport('trace+' + self.get_url(''))
 
907
        size = transport.put_file('index', builder.finish())
910
908
        del builder
911
 
        index = btree_index.BTreeGraphIndex(t, 'index', size)
912
 
        del t._activity[:]
913
 
        self.assertEqual([], t._activity)
 
909
        index = btree_index.BTreeGraphIndex(transport, 'index', size)
 
910
        del transport._activity[:]
 
911
        self.assertEqual([], transport._activity)
914
912
        # search for one key
915
913
        found_nodes = list(index.iter_entries([nodes[30][0]]))
916
914
        bare_nodes = []
924
922
        # Should have read the root node, then one leaf page:
925
923
        self.assertEqual([('readv', 'index', [(0, 4096)], False, None),
926
924
             ('readv',  'index', [(8192, 4096), ], False, None)],
927
 
            t._activity)
 
925
            transport._activity)
928
926
 
929
927
    def test_iter_key_prefix_1_element_key_None(self):
930
928
        index = self.make_index()
1113
1111
        min_l2_key = l2.min_key
1114
1112
        max_l1_key = l1.max_key
1115
1113
        self.assertTrue(max_l1_key < min_l2_key)
1116
 
        parents_min_l2_key = l2[min_l2_key][1][0]
 
1114
        parents_min_l2_key = l2.keys[min_l2_key][1][0]
1117
1115
        self.assertEqual((l1.max_key,), parents_min_l2_key)
1118
1116
        # Now, whatever key we select that would fall on the second page,
1119
1117
        # should give us all the parents until the page break
1132
1130
        parent_map = {}
1133
1131
        search_keys = index._find_ancestors([max_l1_key], 0, parent_map,
1134
1132
                                            missing_keys)
1135
 
        self.assertEqual(l1.all_keys(), sorted(parent_map))
 
1133
        self.assertEqual(sorted(l1.keys), sorted(parent_map))
1136
1134
        self.assertEqual(set(), missing_keys)
1137
1135
        self.assertEqual(set(), search_keys)
1138
1136
 
1154
1152
        for node in nodes:
1155
1153
            builder.add_node(*node)
1156
1154
        stream = builder.finish()
1157
 
        trans = self.get_transport()
 
1155
        trans = get_transport(self.get_url())
1158
1156
        size = trans.put_file('index', stream)
1159
1157
        index = btree_index.BTreeGraphIndex(trans, 'index', size)
1160
1158
        self.assertEqual(500, index.key_count())
1186
1184
 
1187
1185
class TestBTreeNodes(BTreeTestCase):
1188
1186
 
1189
 
    scenarios = btreeparser_scenarios()
 
1187
    def restore_parser(self):
 
1188
        btree_index._btree_serializer = self.saved_parser
1190
1189
 
1191
1190
    def setUp(self):
1192
1191
        BTreeTestCase.setUp(self)
1193
 
        self.overrideAttr(btree_index, '_btree_serializer', self.parse_btree)
 
1192
        self.saved_parser = btree_index._btree_serializer
 
1193
        self.addCleanup(self.restore_parser)
 
1194
        btree_index._btree_serializer = self.parse_btree
1194
1195
 
1195
1196
    def test_LeafNode_1_0(self):
1196
1197
        node_bytes = ("type=leaf\n"
1208
1209
            ("2222222222222222222222222222222222222222",): ("value:2", ()),
1209
1210
            ("3333333333333333333333333333333333333333",): ("value:3", ()),
1210
1211
            ("4444444444444444444444444444444444444444",): ("value:4", ()),
1211
 
            }, dict(node.all_items()))
 
1212
            }, node.keys)
1212
1213
 
1213
1214
    def test_LeafNode_2_2(self):
1214
1215
        node_bytes = ("type=leaf\n"
1228
1229
            ('11', '33'): ('value:3',
1229
1230
                ((('11', 'ref22'),), (('11', 'ref22'), ('11', 'ref22')))),
1230
1231
            ('11', '44'): ('value:4', ((), (('11', 'ref00'),)))
1231
 
            }, dict(node.all_items()))
 
1232
            }, node.keys)
1232
1233
 
1233
1234
    def test_InternalNode_1(self):
1234
1235
        node_bytes = ("type=internal\n"
1269
1270
            ('11', '33'): ('value:3',
1270
1271
                ((('11', 'ref22'),), (('11', 'ref22'), ('11', 'ref22')))),
1271
1272
            ('11', '44'): ('value:4', ((), (('11', 'ref00'),)))
1272
 
            }, dict(node.all_items()))
 
1273
            }, node.keys)
1273
1274
 
1274
1275
    def assertFlattened(self, expected, key, value, refs):
1275
1276
        flat_key, flat_line = self.parse_btree._flatten_node(
1307
1308
    def test_exists(self):
1308
1309
        # This is just to let the user know if they don't have the feature
1309
1310
        # available
1310
 
        self.requireFeature(compiled_btreeparser_feature)
 
1311
        self.requireFeature(CompiledBtreeParserFeature)
1311
1312
 
1312
1313
 
1313
1314
class TestMultiBisectRight(tests.TestCase):
1353
1354
        This doesn't actually create anything on disk, it just primes a
1354
1355
        BTreeGraphIndex with the recommended information.
1355
1356
        """
1356
 
        index = btree_index.BTreeGraphIndex(
1357
 
            transport.get_transport('memory:///'), 'test-index', size=size)
 
1357
        index = btree_index.BTreeGraphIndex(get_transport('memory:///'),
 
1358
                                            'test-index', size=size)
1358
1359
        if recommended_pages is not None:
1359
1360
            index._recommended_pages = recommended_pages
1360
1361
        return index