Rev 3402: A few more minimal ancestry checks in http://bzr.arbash-meinel.com/branches/bzr/1.4-dev/find_unique_ancestors
John Arbash Meinel
john at arbash-meinel.com
Fri Apr 25 00:42:51 BST 2008
At http://bzr.arbash-meinel.com/branches/bzr/1.4-dev/find_unique_ancestors
------------------------------------------------------------
revno: 3402
revision-id: john at arbash-meinel.com-20080424233649-xyyjic178u9zuidd
parent: john at arbash-meinel.com-20080424230555-h2alm4wl2zc7e5l9
committer: John Arbash Meinel <john at arbash-meinel.com>
branch nick: find_unique_ancestors
timestamp: Thu 2008-04-24 18:36:49 -0500
message:
A few more minimal ancestry checks
modified:
bzrlib/tests/test_graph.py test_graph_walker.py-20070525030405-enq4r60hhi9xrujc-1
-------------- next part --------------
=== modified file 'bzrlib/tests/test_graph.py'
--- a/bzrlib/tests/test_graph.py 2008-04-24 23:05:55 +0000
+++ b/bzrlib/tests/test_graph.py 2008-04-24 23:36:49 +0000
@@ -1093,6 +1093,15 @@
[NULL_REVISION, 'a', 'b'])
self.assertFindUniqueAncestors(graph, ['e'], 'e', ['d'])
+ graph = self.make_breaking_graph(extended_history_shortcut,
+ ['b'])
+ self.assertFindUniqueAncestors(graph, ['f'], 'f', ['a', 'd'])
+
+ graph = self.make_breaking_graph(complex_shortcut,
+ ['a', 'b', 'c'])
+ self.assertFindUniqueAncestors(graph, ['h'], 'h', ['i'])
+ self.assertFindUniqueAncestors(graph, ['e', 'g', 'i'], 'i', ['h'])
+
def test_in_ancestry(self):
graph = self.make_graph(ancestry_1)
self.assertFindUniqueAncestors(graph, [], 'rev1', ['rev3'])
More information about the bazaar-commits
mailing list