Matt Mackall <mpm@selenic.com> [Thu, 26 Mar 2009 13:54:44 -0500] rev 7890
util: split out posix, windows, and win32 modules
John Mulligan <phlogistonjohn@asynchrono.us> [Sat, 14 Mar 2009 10:46:48 -0400] rev 7889
patchbomb: option to set the name of bundle attachment (issue1452)
specifying --bundlename=NAME will create a "NAME.hg" attachment
Matt Mackall <mpm@selenic.com> [Tue, 24 Mar 2009 16:41:41 -0500] rev 7888
Merge with -stable
Greg Ward <gerg-hg@gerg.ca> [Mon, 23 Mar 2009 15:04:26 -0400] rev 7887
Typo fix in help.
Tobias Bell <tobias.bell@gmail.com> [Sun, 22 Mar 2009 20:59:03 +0100] rev 7886
i18n: add German translation
* Most basic commands are translated
* hgext/alias.py
* hgext/acl.py
* hgext/fetch.py
* help topics
* urls
* dates
* patterns
* diffs
433 translated messages, 1350 untranslated messages.
Translators:
* Tobias Bell
* Fabian Kreutz (fabian DOT kreutz AT qvantel.com)
* Lutz Horn (lutz DOT horn AT fastmail DOT fm)
Please report issues to http://bitbucket.org/tobidope/i18n-german-translation/issues/
or to the mailing list.
Dongsheng Song <dongsheng.song@gmail.com> [Fri, 20 Mar 2009 14:28:48 +0800] rev 7885
i18n: updated Chinese translation
Stefano Tortarolo <stefano.tortarolo@gmail.com> [Tue, 10 Mar 2009 19:16:16 +0100] rev 7884
i18n: update italian translation
Nicolas Dumazet <nicdumz.commits@gmail.com> [Mon, 23 Mar 2009 15:32:29 +0100] rev 7883
revlog: faster hash computation when one of the parent node is null
Because we often compute sha1(nullid), it's interesting to copy a precomputed
hash of nullid instead of computing everytime the same hash. Similarly, when
one of the parents is null, we can avoid a < comparison (sort).
Overall, this change adds a string equality comparison on each hash() call,
but when p2 is null, we drop one string < comparison, and copy a hash instead
of computing it. Since it is common to have revisions with only one parent,
this change makes hash() 25% faster when cloning a big repository.
Nicolas Dumazet <nicdumz.commits@gmail.com> [Mon, 23 Mar 2009 15:36:30 +0100] rev 7882
ancestor: caching the parent list to improve performance
When computing the DAG depth, we walk through all ancestors: this commit adds
memoization during that first step. Then, the memorized parents are fetched
from a dict instead of calling parents() on each vertex.
This tweak, according to Kcachegrind, improves ancestor() performance by 16%
when cloning a big repository.
Dirkjan Ochtman <dirkjan@ochtman.nl> [Mon, 23 Mar 2009 13:49:16 +0100] rev 7881
kill another trailing space