Revision Sets Performance
robin clowers
robin.clowers at gmail.com
Tue Aug 17 22:34:02 UTC 2010
I’m a developer on CodePlex.com, and we recently started looking at using
rev sets to allow our users to view the revisions in a branch. To get
paging support, the query became quite complex, so we ran some performance
testing and found it was pretty cpu intensive (compared to other mercurial
commands we use). I was wondering if there is a better way to get this
information, and if there is any plan to optimize these functions?
I realize this is never going to be on par with simpler commands, I just
want to make sure I'm not missing something.
For example, this is how we are getting the second set of 10 revisions for a
given branch:
log -r "limit(reverse(limit(branch('branchName') or
ancestors(branch('branchName ')), 20)), 10)"
Thanks,
Robin
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.mercurial-scm.org/pipermail/mercurial/attachments/20100817/974091e4/attachment.html>
More information about the Mercurial
mailing list