#
#
# patch "revision.cc"
#  from [e5aa240e16df288d32284a9679bf86053ea139a1]
#    to [1f59a74d1b24591e9b6c87e09281f6b67f98e9db]
#
============================================================
--- revision.cc	e5aa240e16df288d32284a9679bf86053ea139a1
+++ revision.cc	1f59a74d1b24591e9b6c87e09281f6b67f98e9db
@@ -450,6 +450,10 @@ accumulate_strict_ancestors(revision_id 
 // removes items from the candidate set to occasionally rescan the candidate
 // set to get a new minimum height (perhaps, whenever we remove the minimum
 // height candidate).
+//
+// Note: The strategy outlined above does only work well for small sets of
+// candidates, because of the overhead induced by fetching heights for all
+// members of the set.
 void
 erase_ancestors_and_failures(std::set<revision_id> & candidates,
                              is_failure & p,