[PATCH 0 of 2] rebase: make computation of detach set faster

Siddharth Agarwal sid0 at fb.com
Wed Nov 21 03:15:25 UTC 2012

Previous message (by thread): [PATCH 2 of 2] run-tests: add a --compiler option
Next message (by thread): [PATCH 1 of 2] ancestor: a new algorithm for ancestors of a not in b that is faster when a and b are close
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

I'd like to ask for feedback for this patchset. In particular:
- are there any simple generalizations we can make?
- should we expose this to revsets?

Previous message (by thread): [PATCH 2 of 2] run-tests: add a --compiler option
Next message (by thread): [PATCH 1 of 2] ancestor: a new algorithm for ancestors of a not in b that is faster when a and b are close
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

More information about the Mercurial-devel mailing list