← Back to branch summary

~bzr-pqm/bzr/bzr.dev

« back to all changes in this revision

Viewing changes to bzrlib/tests/test_graph.py

remove all trailing whitespace from bzr source

Show diffs side-by-side

added added

removed removed

Lines of Context:
bzrlib/tests/test_graph.py
237
237
                    'e':['d'], 'f':['e'], 'g':['f'], 'h':['d'], 'i':['g'],
238
238
                    'j':['h'], 'k':['h', 'i'], 'l':['k'], 'm':['l'], 'n':['m'],
239
239
                    'o':['n'], 'p':['o'], 'q':['p'], 'r':['q'], 's':['r'],
240
 
                    't':['i', 's'], 'u':['s', 'j'], 
 
240
                    't':['i', 's'], 'u':['s', 'j'],
241
241
                    }
242
242
 
243
243
# Graph where different walkers will race to find the common and uncommon
700
700
 
701
701
    def test_is_ancestor_boundary(self):
702
702
        """Ensure that we avoid searching the whole graph.
703
 
        
 
703
 
704
704
        This requires searching through b as a common ancestor, so we
705
705
        can identify that e is common.
706
706
        """
726
726
        # 'a' is not in the ancestry of 'c', and 'g' is a ghost
727
727
        expected['g'] = None
728
728
        self.assertEqual(expected, dict(graph.iter_ancestry(['a', 'c'])))
729
 
        expected.pop('a') 
 
729
        expected.pop('a')
730
730
        self.assertEqual(expected, dict(graph.iter_ancestry(['c'])))
731
731
 
732
732
    def test_filter_candidate_lca(self):
834
834
 
835
835
    def _run_heads_break_deeper(self, graph_dict, search):
836
836
        """Run heads on a graph-as-a-dict.
837
 
        
 
837
 
838
838
        If the search asks for the parents of 'deeper' the test will fail.
839
839
        """
840
840
        class stub(object):