Rev 3105: If you are going to figure out what the simple set is, use it. in http://bzr.arbash-meinel.com/branches/bzr/0.93-dev/graph_update

[John Arbash Meinel]

At http://bzr.arbash-meinel.com/branches/bzr/0.93-dev/graph_update

------------------------------------------------------------
revno: 3105
revision-id:john at arbash-meinel.com-20071214213212-lenfp7aijj71i3ne
parent: john at arbash-meinel.com-20071214212912-e9qgqb2z44k6nr01
committer: John Arbash Meinel <john at arbash-meinel.com>
branch nick: graph_update
timestamp: Fri 2007-12-14 15:32:12 -0600
message:
  If you are going to figure out what the simple set is, use it.
modified:
  bzrlib/graph.py                graph_walker.py-20070525030359-y852guab65d4wtn0-1
-------------- next part --------------
=== modified file 'bzrlib/graph.py'
--- a/bzrlib/graph.py	2007-12-14 21:29:12 +0000
+++ b/bzrlib/graph.py	2007-12-14 21:32:12 +0000
@@ -511,7 +511,8 @@
         left_searcher = searchers[0]
         right_searcher = searchers[1]
         unique = left_searcher.seen.symmetric_difference(right_searcher.seen)
-        self._remove_simple_descendants(unique, self.get_parent_map(unique))
+        unique = self._remove_simple_descendants(unique,
+                    self.get_parent_map(unique))
         # TODO: jam 20071214 Would it be possible to seed these searchers with
         #       the revisions that we have already seen on each side?
         #       Maybe something like: