Mercurial > hg
changeset 18093:9c76da468a19
rebase: use lazy ancestor membership testing
For a repository with over 400,000 commits, rebasing one revision near tip,
this avoids one walk up the DAG, speeding the operation up by around 0.8
seconds.
| author | Siddharth Agarwal <sid0@fb.com> |
|---|---|
| date | Mon, 17 Dec 2012 20:51:21 -0800 |
| parents | ff36650e4238 |
| children | 8ceabb34f1cb |
| files | hgext/rebase.py |
| diffstat | 1 files changed, 3 insertions(+), 4 deletions(-) [+] |
line wrap: on
line diff
--- a/hgext/rebase.py Mon Dec 17 20:43:37 2012 -0800 +++ b/hgext/rebase.py Mon Dec 17 20:51:21 2012 -0800 @@ -214,8 +214,8 @@ else: originalwd, target, state = result if collapsef: - targetancestors = set(repo.changelog.ancestors([target])) - targetancestors.add(target) + targetancestors = repo.changelog.ancestors([target], + inclusive=True) external = checkexternal(repo, state, targetancestors) if keepbranchesf: @@ -233,8 +233,7 @@ # Rebase if not targetancestors: - targetancestors = set(repo.changelog.ancestors([target])) - targetancestors.add(target) + targetancestors = repo.changelog.ancestors([target], inclusive=True) # Keep track of the current bookmarks in order to reset them later currentbookmarks = repo._bookmarks.copy()