comparison mercurial/discovery.py @ 17827:612db9d7e76a

obsolete: have `allsuccessors` takes a list of nodes Additional logic, used to detect mutable history troubles, will need to quickly compute successors of a whole set of changeset.
author Pierre-Yves David <pierre-yves.david@logilab.fr>
date Tue, 16 Oct 2012 15:49:58 +0200
parents 46e1a4e24225
children 83cb1a1a705d
comparison
equal deleted inserted replaced
17826:46e1a4e24225 17827:612db9d7e76a
296 newhs = set() 296 newhs = set()
297 for nh in candidate_newhs: 297 for nh in candidate_newhs:
298 if nh in repo and repo[nh].phase() <= phases.public: 298 if nh in repo and repo[nh].phase() <= phases.public:
299 newhs.add(nh) 299 newhs.add(nh)
300 else: 300 else:
301 for suc in obsolete.allsuccessors(repo.obsstore, nh): 301 for suc in obsolete.allsuccessors(repo.obsstore, [nh]):
302 if suc != nh and suc in allfuturecommon: 302 if suc != nh and suc in allfuturecommon:
303 discardedheads.add(nh) 303 discardedheads.add(nh)
304 break 304 break
305 else: 305 else:
306 newhs.add(nh) 306 newhs.add(nh)