← 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: Robert Collins
  • Date: 2010-06-28 02:41:22 UTC
  • mto: This revision was merged to the branch mainline in revision 5324.
  • Revision ID: robertc@robertcollins.net-20100628024122-g951fzp74f3u6wst
Sanity check that new_trace_file in pop_log_file is valid, and also fix a test that monkey patched get_terminal_encoding.

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
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,
 
33
    condition_isinstance,
 
34
    multiply_tests,
 
35
    split_suite_by_condition,
35
36
    )
36
 
 
37
 
 
38
 
load_tests = scenarios.load_tests_apply_scenarios
39
 
 
40
 
 
41
 
def btreeparser_scenarios():
 
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))
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
278
280
 
279
281
        for node in nodes:
280
282
            builder.add_node(*node)
281
 
        t = transport.get_transport('trace+' + self.get_url(''))
282
 
        size = t.put_file('index', self.time(builder.finish))
 
283
        transport = get_transport('trace+' + self.get_url(''))
 
284
        size = transport.put_file('index', self.time(builder.finish))
283
285
        del builder
284
 
        index = btree_index.BTreeGraphIndex(t, 'index', size)
 
286
        index = btree_index.BTreeGraphIndex(transport, 'index', size)
285
287
        # Seed the metadata, we're using internal calls now.
286
288
        index.key_count()
287
289
        self.assertEqual(3, len(index._row_lengths),
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)
407
409
        self.assertEqual(None, builder._backing_indices[2])
408
410
        self.assertEqual(16, builder._backing_indices[3].key_count())
409
411
        # Now finish, and check we got a correctly ordered tree
410
 
        t = self.get_transport('')
411
 
        size = t.put_file('index', builder.finish())
412
 
        index = btree_index.BTreeGraphIndex(t, 'index', size)
 
412
        transport = self.get_transport('')
 
413
        size = transport.put_file('index', builder.finish())
 
414
        index = btree_index.BTreeGraphIndex(transport, 'index', size)
413
415
        nodes = list(index.iter_all_entries())
414
416
        self.assertEqual(sorted(nodes), nodes)
415
417
        self.assertEqual(16, len(nodes))
605
607
        for key, value, references in nodes:
606
608
            builder.add_node(key, value, references)
607
609
        stream = builder.finish()
608
 
        trans = transport.get_transport('trace+' + self.get_url())
 
610
        trans = get_transport('trace+' + self.get_url())
609
611
        size = trans.put_file('index', stream)
610
612
        return btree_index.BTreeGraphIndex(trans, 'index', size)
611
613
 
646
648
        self.assertEqual(0, len(index._leaf_node_cache))
647
649
 
648
650
    def test_trivial_constructor(self):
649
 
        t = transport.get_transport('trace+' + self.get_url(''))
650
 
        index = btree_index.BTreeGraphIndex(t, 'index', None)
 
651
        transport = get_transport('trace+' + self.get_url(''))
 
652
        index = btree_index.BTreeGraphIndex(transport, 'index', None)
651
653
        # Checks the page size at load, but that isn't logged yet.
652
 
        self.assertEqual([], t._activity)
 
654
        self.assertEqual([], transport._activity)
653
655
 
654
656
    def test_with_size_constructor(self):
655
 
        t = transport.get_transport('trace+' + self.get_url(''))
656
 
        index = btree_index.BTreeGraphIndex(t, 'index', 1)
 
657
        transport = get_transport('trace+' + self.get_url(''))
 
658
        index = btree_index.BTreeGraphIndex(transport, 'index', 1)
657
659
        # Checks the page size at load, but that isn't logged yet.
658
 
        self.assertEqual([], t._activity)
 
660
        self.assertEqual([], transport._activity)
659
661
 
660
662
    def test_empty_key_count_no_size(self):
661
663
        builder = btree_index.BTreeBuilder(key_elements=1, reference_lists=0)
662
 
        t = transport.get_transport('trace+' + self.get_url(''))
663
 
        t.put_file('index', builder.finish())
664
 
        index = btree_index.BTreeGraphIndex(t, 'index', None)
665
 
        del t._activity[:]
666
 
        self.assertEqual([], t._activity)
 
664
        transport = get_transport('trace+' + self.get_url(''))
 
665
        transport.put_file('index', builder.finish())
 
666
        index = btree_index.BTreeGraphIndex(transport, 'index', None)
 
667
        del transport._activity[:]
 
668
        self.assertEqual([], transport._activity)
667
669
        self.assertEqual(0, index.key_count())
668
670
        # The entire index should have been requested (as we generally have the
669
671
        # size available, and doing many small readvs is inappropriate).
670
672
        # We can't tell how much was actually read here, but - check the code.
671
 
        self.assertEqual([('get', 'index')], t._activity)
 
673
        self.assertEqual([('get', 'index')], transport._activity)
672
674
 
673
675
    def test_empty_key_count(self):
674
676
        builder = btree_index.BTreeBuilder(key_elements=1, reference_lists=0)
675
 
        t = transport.get_transport('trace+' + self.get_url(''))
676
 
        size = t.put_file('index', builder.finish())
 
677
        transport = get_transport('trace+' + self.get_url(''))
 
678
        size = transport.put_file('index', builder.finish())
677
679
        self.assertEqual(72, size)
678
 
        index = btree_index.BTreeGraphIndex(t, 'index', size)
679
 
        del t._activity[:]
680
 
        self.assertEqual([], t._activity)
 
680
        index = btree_index.BTreeGraphIndex(transport, 'index', size)
 
681
        del transport._activity[:]
 
682
        self.assertEqual([], transport._activity)
681
683
        self.assertEqual(0, index.key_count())
682
684
        # The entire index should have been read, as 4K > size
683
685
        self.assertEqual([('readv', 'index', [(0, 72)], False, None)],
684
 
                         t._activity)
 
686
            transport._activity)
685
687
 
686
688
    def test_non_empty_key_count_2_2(self):
687
689
        builder = btree_index.BTreeBuilder(key_elements=2, reference_lists=2)
688
690
        nodes = self.make_nodes(35, 2, 2)
689
691
        for node in nodes:
690
692
            builder.add_node(*node)
691
 
        t = transport.get_transport('trace+' + self.get_url(''))
692
 
        size = t.put_file('index', builder.finish())
693
 
        index = btree_index.BTreeGraphIndex(t, 'index', size)
694
 
        del t._activity[:]
695
 
        self.assertEqual([], t._activity)
 
693
        transport = get_transport('trace+' + self.get_url(''))
 
694
        size = transport.put_file('index', builder.finish())
 
695
        index = btree_index.BTreeGraphIndex(transport, 'index', size)
 
696
        del transport._activity[:]
 
697
        self.assertEqual([], transport._activity)
696
698
        self.assertEqual(70, index.key_count())
697
699
        # The entire index should have been read, as it is one page long.
698
700
        self.assertEqual([('readv', 'index', [(0, size)], False, None)],
699
 
            t._activity)
 
701
            transport._activity)
700
702
        self.assertEqual(1173, size)
701
703
 
702
704
    def test_with_offset_no_size(self):
720
722
 
721
723
    def test__read_nodes_no_size_one_page_reads_once(self):
722
724
        self.make_index(nodes=[(('key',), 'value', ())])
723
 
        trans = transport.get_transport('trace+' + self.get_url())
 
725
        trans = get_transport('trace+' + self.get_url())
724
726
        index = btree_index.BTreeGraphIndex(trans, 'index', None)
725
727
        del trans._activity[:]
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):
734
736
        index.key_count()
735
737
        num_pages = index._row_offsets[-1]
736
738
        # Reopen with a traced transport and no size
737
 
        trans = transport.get_transport('trace+' + self.get_url())
 
739
        trans = get_transport('trace+' + self.get_url())
738
740
        index = btree_index.BTreeGraphIndex(trans, 'index', None)
739
741
        del trans._activity[:]
740
742
        nodes = dict(index._read_nodes([0]))
745
747
        nodes = self.make_nodes(160, 2, 2)
746
748
        for node in nodes:
747
749
            builder.add_node(*node)
748
 
        t = transport.get_transport('trace+' + self.get_url(''))
749
 
        size = t.put_file('index', builder.finish())
 
750
        transport = get_transport('trace+' + self.get_url(''))
 
751
        size = transport.put_file('index', builder.finish())
750
752
        self.assertEqual(17692, size)
751
 
        index = btree_index.BTreeGraphIndex(t, 'index', size)
752
 
        del t._activity[:]
753
 
        self.assertEqual([], t._activity)
 
753
        index = btree_index.BTreeGraphIndex(transport, 'index', size)
 
754
        del transport._activity[:]
 
755
        self.assertEqual([], transport._activity)
754
756
        self.assertEqual(320, index.key_count())
755
757
        # The entire index should not have been read.
756
758
        self.assertEqual([('readv', 'index', [(0, 4096)], False, None)],
757
 
                         t._activity)
 
759
            transport._activity)
758
760
 
759
761
    def test_validate_one_page(self):
760
762
        builder = btree_index.BTreeBuilder(key_elements=2, reference_lists=2)
761
763
        nodes = self.make_nodes(45, 2, 2)
762
764
        for node in nodes:
763
765
            builder.add_node(*node)
764
 
        t = transport.get_transport('trace+' + self.get_url(''))
765
 
        size = t.put_file('index', builder.finish())
766
 
        index = btree_index.BTreeGraphIndex(t, 'index', size)
767
 
        del t._activity[:]
768
 
        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)
769
771
        index.validate()
770
772
        # The entire index should have been read linearly.
771
773
        self.assertEqual([('readv', 'index', [(0, size)], False, None)],
772
 
                         t._activity)
 
774
            transport._activity)
773
775
        self.assertEqual(1488, size)
774
776
 
775
777
    def test_validate_two_pages(self):
777
779
        nodes = self.make_nodes(80, 2, 2)
778
780
        for node in nodes:
779
781
            builder.add_node(*node)
780
 
        t = transport.get_transport('trace+' + self.get_url(''))
781
 
        size = t.put_file('index', builder.finish())
 
782
        transport = get_transport('trace+' + self.get_url(''))
 
783
        size = transport.put_file('index', builder.finish())
782
784
        # Root page, 2 leaf pages
783
785
        self.assertEqual(9339, size)
784
 
        index = btree_index.BTreeGraphIndex(t, 'index', size)
785
 
        del t._activity[:]
786
 
        self.assertEqual([], t._activity)
 
786
        index = btree_index.BTreeGraphIndex(transport, 'index', size)
 
787
        del transport._activity[:]
 
788
        self.assertEqual([], transport._activity)
787
789
        index.validate()
788
790
        # The entire index should have been read linearly.
789
 
        self.assertEqual(
790
 
            [('readv', 'index', [(0, 4096)], False, None),
791
 
             ('readv', 'index', [(4096, 4096), (8192, 1147)], False, None)],
792
 
            t._activity)
 
791
        self.assertEqual([('readv', 'index', [(0, 4096)], False, None),
 
792
            ('readv', 'index', [(4096, 4096), (8192, 1147)], False, None)],
 
793
            transport._activity)
793
794
        # XXX: TODO: write some badly-ordered nodes, and some pointers-to-wrong
794
795
        # node and make validate find them.
795
796
 
796
797
    def test_eq_ne(self):
797
798
        # two indices are equal when constructed with the same parameters:
798
 
        t1 = transport.get_transport('trace+' + self.get_url(''))
799
 
        t2 = self.get_transport()
800
 
        self.assertTrue(
801
 
            btree_index.BTreeGraphIndex(t1, 'index', None) ==
802
 
            btree_index.BTreeGraphIndex(t1, 'index', None))
803
 
        self.assertTrue(
804
 
            btree_index.BTreeGraphIndex(t1, 'index', 20) ==
805
 
            btree_index.BTreeGraphIndex(t1, 'index', 20))
806
 
        self.assertFalse(
807
 
            btree_index.BTreeGraphIndex(t1, 'index', 20) ==
808
 
            btree_index.BTreeGraphIndex(t2, 'index', 20))
809
 
        self.assertFalse(
810
 
            btree_index.BTreeGraphIndex(t1, 'inde1', 20) ==
811
 
            btree_index.BTreeGraphIndex(t1, 'inde2', 20))
812
 
        self.assertFalse(
813
 
            btree_index.BTreeGraphIndex(t1, 'index', 10) ==
814
 
            btree_index.BTreeGraphIndex(t1, 'index', 20))
815
 
        self.assertFalse(
816
 
            btree_index.BTreeGraphIndex(t1, 'index', None) !=
817
 
            btree_index.BTreeGraphIndex(t1, 'index', None))
818
 
        self.assertFalse(
819
 
            btree_index.BTreeGraphIndex(t1, 'index', 20) !=
820
 
            btree_index.BTreeGraphIndex(t1, 'index', 20))
821
 
        self.assertTrue(
822
 
            btree_index.BTreeGraphIndex(t1, 'index', 20) !=
823
 
            btree_index.BTreeGraphIndex(t2, 'index', 20))
824
 
        self.assertTrue(
825
 
            btree_index.BTreeGraphIndex(t1, 'inde1', 20) !=
826
 
            btree_index.BTreeGraphIndex(t1, 'inde2', 20))
827
 
        self.assertTrue(
828
 
            btree_index.BTreeGraphIndex(t1, 'index', 10) !=
829
 
            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))
830
831
 
831
832
    def test_iter_all_only_root_no_size(self):
832
833
        self.make_index(nodes=[(('key',), 'value', ())])
833
 
        t = transport.get_transport('trace+' + self.get_url(''))
834
 
        index = btree_index.BTreeGraphIndex(t, 'index', None)
835
 
        del t._activity[:]
 
834
        trans = get_transport('trace+' + self.get_url(''))
 
835
        index = btree_index.BTreeGraphIndex(trans, 'index', None)
 
836
        del trans._activity[:]
836
837
        self.assertEqual([(('key',), 'value')],
837
838
                         [x[1:] for x in index.iter_all_entries()])
838
 
        self.assertEqual([('get', 'index')], t._activity)
 
839
        self.assertEqual([('get', 'index')], trans._activity)
839
840
 
840
841
    def test_iter_all_entries_reads(self):
841
842
        # iterating all entries reads the header, then does a linear
847
848
        nodes = self.make_nodes(10000, 2, 2)
848
849
        for node in nodes:
849
850
            builder.add_node(*node)
850
 
        t = transport.get_transport('trace+' + self.get_url(''))
851
 
        size = t.put_file('index', builder.finish())
 
851
        transport = get_transport('trace+' + self.get_url(''))
 
852
        size = transport.put_file('index', builder.finish())
852
853
        self.assertEqual(1303220, size, 'number of expected bytes in the'
853
854
                                        ' output changed')
854
855
        page_size = btree_index._PAGE_SIZE
855
856
        del builder
856
 
        index = btree_index.BTreeGraphIndex(t, 'index', size)
857
 
        del t._activity[:]
858
 
        self.assertEqual([], t._activity)
 
857
        index = btree_index.BTreeGraphIndex(transport, 'index', size)
 
858
        del transport._activity[:]
 
859
        self.assertEqual([], transport._activity)
859
860
        found_nodes = self.time(list, index.iter_all_entries())
860
861
        bare_nodes = []
861
862
        for node in found_nodes:
882
883
        readv_request[-1] = (readv_request[-1][0], 1303220 % page_size)
883
884
        expected = [('readv', 'index', [(0, page_size)], False, None),
884
885
             ('readv',  'index', readv_request, False, None)]
885
 
        if expected != t._activity:
 
886
        if expected != transport._activity:
886
887
            self.assertEqualDiff(pprint.pformat(expected),
887
888
                                 pprint.pformat(transport._activity))
888
889
 
902
903
        nodes = self.make_nodes(160, 2, 2)
903
904
        for node in nodes:
904
905
            builder.add_node(*node)
905
 
        t = transport.get_transport('trace+' + self.get_url(''))
906
 
        size = t.put_file('index', builder.finish())
 
906
        transport = get_transport('trace+' + self.get_url(''))
 
907
        size = transport.put_file('index', builder.finish())
907
908
        del builder
908
 
        index = btree_index.BTreeGraphIndex(t, 'index', size)
909
 
        del t._activity[:]
910
 
        self.assertEqual([], t._activity)
 
909
        index = btree_index.BTreeGraphIndex(transport, 'index', size)
 
910
        del transport._activity[:]
 
911
        self.assertEqual([], transport._activity)
911
912
        # search for one key
912
913
        found_nodes = list(index.iter_entries([nodes[30][0]]))
913
914
        bare_nodes = []
921
922
        # Should have read the root node, then one leaf page:
922
923
        self.assertEqual([('readv', 'index', [(0, 4096)], False, None),
923
924
             ('readv',  'index', [(8192, 4096), ], False, None)],
924
 
            t._activity)
 
925
            transport._activity)
925
926
 
926
927
    def test_iter_key_prefix_1_element_key_None(self):
927
928
        index = self.make_index()
1110
1111
        min_l2_key = l2.min_key
1111
1112
        max_l1_key = l1.max_key
1112
1113
        self.assertTrue(max_l1_key < min_l2_key)
1113
 
        parents_min_l2_key = l2[min_l2_key][1][0]
 
1114
        parents_min_l2_key = l2.keys[min_l2_key][1][0]
1114
1115
        self.assertEqual((l1.max_key,), parents_min_l2_key)
1115
1116
        # Now, whatever key we select that would fall on the second page,
1116
1117
        # should give us all the parents until the page break
1129
1130
        parent_map = {}
1130
1131
        search_keys = index._find_ancestors([max_l1_key], 0, parent_map,
1131
1132
                                            missing_keys)
1132
 
        self.assertEqual(l1.all_keys(), sorted(parent_map))
 
1133
        self.assertEqual(sorted(l1.keys), sorted(parent_map))
1133
1134
        self.assertEqual(set(), missing_keys)
1134
1135
        self.assertEqual(set(), search_keys)
1135
1136
 
1151
1152
        for node in nodes:
1152
1153
            builder.add_node(*node)
1153
1154
        stream = builder.finish()
1154
 
        trans = self.get_transport()
 
1155
        trans = get_transport(self.get_url())
1155
1156
        size = trans.put_file('index', stream)
1156
1157
        index = btree_index.BTreeGraphIndex(trans, 'index', size)
1157
1158
        self.assertEqual(500, index.key_count())
1183
1184
 
1184
1185
class TestBTreeNodes(BTreeTestCase):
1185
1186
 
1186
 
    scenarios = btreeparser_scenarios()
1187
 
 
1188
1187
    def setUp(self):
1189
1188
        BTreeTestCase.setUp(self)
1190
1189
        self.overrideAttr(btree_index, '_btree_serializer', self.parse_btree)
1205
1204
            ("2222222222222222222222222222222222222222",): ("value:2", ()),
1206
1205
            ("3333333333333333333333333333333333333333",): ("value:3", ()),
1207
1206
            ("4444444444444444444444444444444444444444",): ("value:4", ()),
1208
 
            }, dict(node.all_items()))
 
1207
            }, node.keys)
1209
1208
 
1210
1209
    def test_LeafNode_2_2(self):
1211
1210
        node_bytes = ("type=leaf\n"
1225
1224
            ('11', '33'): ('value:3',
1226
1225
                ((('11', 'ref22'),), (('11', 'ref22'), ('11', 'ref22')))),
1227
1226
            ('11', '44'): ('value:4', ((), (('11', 'ref00'),)))
1228
 
            }, dict(node.all_items()))
 
1227
            }, node.keys)
1229
1228
 
1230
1229
    def test_InternalNode_1(self):
1231
1230
        node_bytes = ("type=internal\n"
1266
1265
            ('11', '33'): ('value:3',
1267
1266
                ((('11', 'ref22'),), (('11', 'ref22'), ('11', 'ref22')))),
1268
1267
            ('11', '44'): ('value:4', ((), (('11', 'ref00'),)))
1269
 
            }, dict(node.all_items()))
 
1268
            }, node.keys)
1270
1269
 
1271
1270
    def assertFlattened(self, expected, key, value, refs):
1272
1271
        flat_key, flat_line = self.parse_btree._flatten_node(
1350
1349
        This doesn't actually create anything on disk, it just primes a
1351
1350
        BTreeGraphIndex with the recommended information.
1352
1351
        """
1353
 
        index = btree_index.BTreeGraphIndex(
1354
 
            transport.get_transport('memory:///'), 'test-index', size=size)
 
1352
        index = btree_index.BTreeGraphIndex(get_transport('memory:///'),
 
1353
                                            'test-index', size=size)
1355
1354
        if recommended_pages is not None:
1356
1355
            index._recommended_pages = recommended_pages
1357
1356
        return index