Fri, 19 Feb 2010 02:23:38 +0100 i18n: mark more strings for translation stable
Benoit Boissinot <benoit.boissinot@ens-lyon.org> [Fri, 19 Feb 2010 02:23:38 +0100] rev 10510
i18n: mark more strings for translation
Fri, 19 Feb 2010 02:11:37 +0100 shrink-revlog: remove unneeded imports and useless code stable
Benoit Boissinot <benoit.boissinot@ens-lyon.org> [Fri, 19 Feb 2010 02:11:37 +0100] rev 10509
shrink-revlog: remove unneeded imports and useless code
Fri, 19 Feb 2010 02:07:13 +0100 shrink-revlog: add strings for translation / import _ before using it stable
Benoit Boissinot <benoit.boissinot@ens-lyon.org> [Fri, 19 Feb 2010 02:07:13 +0100] rev 10508
shrink-revlog: add strings for translation / import _ before using it
Thu, 18 Feb 2010 16:51:39 -0500 ui: unset ui.slash when HGPLAIN is set stable
Brodie Rao <me+hg@dackz.net> [Thu, 18 Feb 2010 16:51:39 -0500] rev 10507
ui: unset ui.slash when HGPLAIN is set
Thu, 18 Feb 2010 16:50:49 -0500 ui: suppress aliases when HGPLAIN is set stable
Brodie Rao <me+hg@dackz.net> [Thu, 18 Feb 2010 16:50:49 -0500] rev 10506
ui: suppress aliases when HGPLAIN is set
Mon, 15 Feb 2010 15:25:29 -0500 merge: fix --preview to show all nodes that will be merged (issue2043). stable
Greg Ward <greg-hg@gerg.ca> [Mon, 15 Feb 2010 15:25:29 -0500] rev 10505
merge: fix --preview to show all nodes that will be merged (issue2043). Formerly, it omitted nodes that were not descendants of the least common ancestor of the two merge parents, even though those nodes contribute to the merge. The new algorithm uses revlog.findmissing() instead of ancestor() + nodesbetween().
Mon, 15 Feb 2010 15:07:21 -0500 test-merge-default: make content of test repo clearer. stable
Greg Ward <greg-hg@gerg.ca> [Mon, 15 Feb 2010 15:07:21 -0500] rev 10504
test-merge-default: make content of test repo clearer. Makes it easier to understand and modify the test. (issue2043).
(0) -10000 -3000 -1000 -300 -100 -30 -10 -7 +7 +10 +30 +100 +300 +1000 +3000 +10000 +30000 tip