Rev 3111: We had been relying on a bad side effect, 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: 3111
revision-id:john at arbash-meinel.com-20071220184915-vf7uo3xk18aj5sd3
parent: john at arbash-meinel.com-20071220182347-1mdusirdx7c5yn04
committer: John Arbash Meinel <john at arbash-meinel.com>
branch nick: graph_update
timestamp: Thu 2007-12-20 12:49:15 -0600
message:
  We had been relying on a bad side effect,
  Now we properly update the common walker for it to start
  searching the tips of the other searchers once we
  find nodes to be in common.
modified:
  bzrlib/graph.py                graph_walker.py-20070525030359-y852guab65d4wtn0-1
-------------- next part --------------
=== modified file 'bzrlib/graph.py'
--- a/bzrlib/graph.py	2007-12-20 18:23:47 +0000
+++ b/bzrlib/graph.py	2007-12-20 18:49:15 +0000
@@ -429,6 +429,7 @@
                     # Make sure to put all seen ancestors into the common set. This
                     # will allow the common_walker to jump past them.
                     new_common.update(stopped)
+                    common_walker.start_searching(stopped)
                     common_walker.seen.update(seen_ancestors)
             for searcher in searchers.itervalues():
                 next_to_search.update(searcher.will_search())