Rev 3094: make preload_parents a private function. 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: 3094
revision-id:john at arbash-meinel.com-20071207201053-p3emvva8std6r4b3
parent: john at arbash-meinel.com-20071207173216-9gt7vfve0qzi6exr
committer: John Arbash Meinel <john at arbash-meinel.com>
branch nick: graph_update
timestamp: Fri 2007-12-07 14:10:53 -0600
message:
  make preload_parents a private function.
modified:
  bzrlib/graph.py                graph_walker.py-20070525030359-y852guab65d4wtn0-1
-------------- next part --------------
=== modified file 'bzrlib/graph.py'
--- a/bzrlib/graph.py	2007-12-07 17:32:16 +0000
+++ b/bzrlib/graph.py	2007-12-07 20:10:53 +0000
@@ -239,7 +239,7 @@
             if len(active_searchers) == 0:
                 return border_ancestors, common_ancestors, [s.seen for s in
                                                             searchers]
-            parents = self.preload_parents(next_to_search)
+            parents = self._preload_parents(next_to_search)
             new_common = common_searcher.step(parents)
             if new_common:
                 common_ancestors.update(new_common)
@@ -270,7 +270,7 @@
             for searcher in active_searchers:
                 next_to_search.update(searcher.will_search())
 
-    def preload_parents(self, keys):
+    def _preload_parents(self, keys):
         """Call get_parents() for all of the keys we will need.
 
         :return: A dictionary mapping key => parents
@@ -307,7 +307,7 @@
         active_searchers = dict(searchers)
         # The first parents we will be accessing are just the candidate_heads,
         # so ask the parents provider to pull them up
-        parents = self.preload_parents(candidate_heads)
+        parents = self._preload_parents(candidate_heads)
 
         # skip over the actual candidate for each searcher, and figure out what
         # the next nodes are going to be.
@@ -322,7 +322,7 @@
         # accessing all history.
         common_walker = self._make_breadth_first_searcher([])
         while len(active_searchers) > 0:
-            parents = self.preload_parents(next_to_search)
+            parents = self._preload_parents(next_to_search)
             ancestors = set()
             # advance searches
             new_common = common_walker.step(parents)