← 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: Canonical.com Patch Queue Manager
  • Date: 2009-11-26 02:26:50 UTC
  • mfrom: (4792.5.5 cleanup)
  • Revision ID: pqm@pqm.ubuntu.com-20091126022650-zjeqb0su8ak4oi6s
(mbp) remove bzrlib.textui

Show diffs side-by-side

added added

removed removed

Lines of Context:
bzrlib/tests/test_btree_index.py
1
 
# Copyright (C) 2008, 2009, 2010 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
43
43
        condition_isinstance(TestBTreeNodes))
44
44
    import bzrlib._btree_serializer_py as py_module
45
45
    scenarios = [('python', {'parse_btree': py_module})]
46
 
    if compiled_btreeparser_feature.available():
47
 
        scenarios.append(('C', {'parse_btree':
48
 
                                compiled_btreeparser_feature.module}))
 
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}))
49
51
    return multiply_tests(node_tests, scenarios, others)
50
52
 
51
53
 
52
 
compiled_btreeparser_feature = tests.ModuleAvailableFeature(
53
 
                                'bzrlib._btree_serializer_pyx')
 
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()
54
66
 
55
67
 
56
68
class BTreeTestCase(TestCaseWithTransport):
59
71
 
60
72
    def setUp(self):
61
73
        TestCaseWithTransport.setUp(self)
62
 
        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
63
79
 
64
80
    def make_nodes(self, count, key_elements, reference_lists):
65
81
        """Generate count*key_elements sample nodes."""
99
115
 
100
116
    def shrink_page_size(self):
101
117
        """Shrink the default page size so that less fits in a page."""
102
 
        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)
103
122
        btree_index._PAGE_SIZE = 2048
104
123
 
105
124
 
340
359
        # Test the parts of the index that take up memory are doing so
341
360
        # predictably.
342
361
        self.assertEqual(1, len(builder._nodes))
 
362
        self.assertEqual(1, len(builder._keys))
343
363
        self.assertIs(None, builder._nodes_by_key)
344
364
        builder.add_node(*nodes[1])
345
365
        self.assertEqual(0, len(builder._nodes))
 
366
        self.assertEqual(0, len(builder._keys))
346
367
        self.assertIs(None, builder._nodes_by_key)
347
368
        self.assertEqual(1, len(builder._backing_indices))
348
369
        self.assertEqual(2, builder._backing_indices[0].key_count())
349
370
        # now back to memory
350
371
        builder.add_node(*nodes[2])
351
372
        self.assertEqual(1, len(builder._nodes))
 
373
        self.assertEqual(1, len(builder._keys))
352
374
        self.assertIs(None, builder._nodes_by_key)
353
375
        # And spills to a second backing index combing all
354
376
        builder.add_node(*nodes[3])
355
377
        self.assertEqual(0, len(builder._nodes))
 
378
        self.assertEqual(0, len(builder._keys))
356
379
        self.assertIs(None, builder._nodes_by_key)
357
380
        self.assertEqual(2, len(builder._backing_indices))
358
381
        self.assertEqual(None, builder._backing_indices[0])
361
384
        builder.add_node(*nodes[4])
362
385
        builder.add_node(*nodes[5])
363
386
        self.assertEqual(0, len(builder._nodes))
 
387
        self.assertEqual(0, len(builder._keys))
364
388
        self.assertIs(None, builder._nodes_by_key)
365
389
        self.assertEqual(2, len(builder._backing_indices))
366
390
        self.assertEqual(2, builder._backing_indices[0].key_count())
424
448
        # Test the parts of the index that take up memory are doing so
425
449
        # predictably.
426
450
        self.assertEqual(1, len(builder._nodes))
 
451
        self.assertEqual(1, len(builder._keys))
427
452
        self.assertIs(None, builder._nodes_by_key)
428
453
        builder.add_node(*nodes[1])
429
454
        self.assertEqual(0, len(builder._nodes))
 
455
        self.assertEqual(0, len(builder._keys))
430
456
        self.assertIs(None, builder._nodes_by_key)
431
457
        self.assertEqual(1, len(builder._backing_indices))
432
458
        self.assertEqual(2, builder._backing_indices[0].key_count())
433
459
        # now back to memory
434
460
        builder.add_node(*nodes[2])
435
461
        self.assertEqual(1, len(builder._nodes))
 
462
        self.assertEqual(1, len(builder._keys))
436
463
        self.assertIs(None, builder._nodes_by_key)
437
464
        # And spills to a second backing index but doesn't combine
438
465
        builder.add_node(*nodes[3])
439
466
        self.assertEqual(0, len(builder._nodes))
 
467
        self.assertEqual(0, len(builder._keys))
440
468
        self.assertIs(None, builder._nodes_by_key)
441
469
        self.assertEqual(2, len(builder._backing_indices))
442
470
        for backing_index in builder._backing_indices:
445
473
        builder.add_node(*nodes[4])
446
474
        builder.add_node(*nodes[5])
447
475
        self.assertEqual(0, len(builder._nodes))
 
476
        self.assertEqual(0, len(builder._keys))
448
477
        self.assertIs(None, builder._nodes_by_key)
449
478
        self.assertEqual(3, len(builder._backing_indices))
450
479
        for backing_index in builder._backing_indices:
509
538
        builder.add_node(*nodes[0])
510
539
        # Test the parts of the index that take up memory are doing so
511
540
        # predictably.
 
541
        self.assertEqual(1, len(builder._keys))
512
542
        self.assertEqual(1, len(builder._nodes))
513
543
        self.assertIs(None, builder._nodes_by_key)
514
544
        builder.add_node(*nodes[1])
 
545
        self.assertEqual(0, len(builder._keys))
515
546
        self.assertEqual(0, len(builder._nodes))
516
547
        self.assertIs(None, builder._nodes_by_key)
517
548
        self.assertEqual(1, len(builder._backing_indices))
520
551
        old = dict(builder._get_nodes_by_key()) #Build up the nodes by key dict
521
552
        builder.add_node(*nodes[2])
522
553
        self.assertEqual(1, len(builder._nodes))
 
554
        self.assertEqual(1, len(builder._keys))
523
555
        self.assertIsNot(None, builder._nodes_by_key)
524
556
        self.assertNotEqual({}, builder._nodes_by_key)
525
557
        # We should have a new entry
527
559
        # And spills to a second backing index combing all
528
560
        builder.add_node(*nodes[3])
529
561
        self.assertEqual(0, len(builder._nodes))
 
562
        self.assertEqual(0, len(builder._keys))
530
563
        self.assertIs(None, builder._nodes_by_key)
531
564
        self.assertEqual(2, len(builder._backing_indices))
532
565
        self.assertEqual(None, builder._backing_indices[0])
535
568
        builder.add_node(*nodes[4])
536
569
        builder.add_node(*nodes[5])
537
570
        self.assertEqual(0, len(builder._nodes))
 
571
        self.assertEqual(0, len(builder._keys))
538
572
        self.assertIs(None, builder._nodes_by_key)
539
573
        self.assertEqual(2, len(builder._backing_indices))
540
574
        self.assertEqual(2, builder._backing_indices[0].key_count())
611
645
        size = trans.put_file('index', stream)
612
646
        return btree_index.BTreeGraphIndex(trans, 'index', size)
613
647
 
614
 
    def make_index_with_offset(self, ref_lists=1, key_elements=1, nodes=[],
615
 
                               offset=0):
616
 
        builder = btree_index.BTreeBuilder(key_elements=key_elements,
617
 
                                           reference_lists=ref_lists)
618
 
        builder.add_nodes(nodes)
619
 
        transport = self.get_transport('')
620
 
        # NamedTemporaryFile dies on builder.finish().read(). weird.
621
 
        temp_file = builder.finish()
622
 
        content = temp_file.read()
623
 
        del temp_file
624
 
        size = len(content)
625
 
        transport.put_bytes('index', (' '*offset)+content)
626
 
        return btree_index.BTreeGraphIndex(transport, 'index', size=size,
627
 
                                           offset=offset)
628
 
 
629
648
    def test_clear_cache(self):
630
649
        nodes = self.make_nodes(160, 2, 2)
631
650
        index = self.make_index(ref_lists=2, key_elements=2, nodes=nodes)
701
720
            transport._activity)
702
721
        self.assertEqual(1173, size)
703
722
 
704
 
    def test_with_offset_no_size(self):
705
 
        index = self.make_index_with_offset(key_elements=1, ref_lists=1,
706
 
                                            offset=1234,
707
 
                                            nodes=self.make_nodes(200, 1, 1))
708
 
        index._size = None # throw away the size info
709
 
        self.assertEqual(200, index.key_count())
710
 
 
711
 
    def test_with_small_offset(self):
712
 
        index = self.make_index_with_offset(key_elements=1, ref_lists=1,
713
 
                                            offset=1234,
714
 
                                            nodes=self.make_nodes(200, 1, 1))
715
 
        self.assertEqual(200, index.key_count())
716
 
 
717
 
    def test_with_large_offset(self):
718
 
        index = self.make_index_with_offset(key_elements=1, ref_lists=1,
719
 
                                            offset=123456,
720
 
                                            nodes=self.make_nodes(200, 1, 1))
721
 
        self.assertEqual(200, index.key_count())
722
 
 
723
723
    def test__read_nodes_no_size_one_page_reads_once(self):
724
724
        self.make_index(nodes=[(('key',), 'value', ())])
725
725
        trans = get_transport('trace+' + self.get_url())
1184
1184
 
1185
1185
class TestBTreeNodes(BTreeTestCase):
1186
1186
 
 
1187
    def restore_parser(self):
 
1188
        btree_index._btree_serializer = self.saved_parser
 
1189
 
1187
1190
    def setUp(self):
1188
1191
        BTreeTestCase.setUp(self)
1189
 
        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
1190
1195
 
1191
1196
    def test_LeafNode_1_0(self):
1192
1197
        node_bytes = ("type=leaf\n"
1303
1308
    def test_exists(self):
1304
1309
        # This is just to let the user know if they don't have the feature
1305
1310
        # available
1306
 
        self.requireFeature(compiled_btreeparser_feature)
 
1311
        self.requireFeature(CompiledBtreeParserFeature)
1307
1312
 
1308
1313
 
1309
1314
class TestMultiBisectRight(tests.TestCase):