Fri, 26 Jul 2013 15:42:10 -0500 revsingle: fix silly API issue (issue2992) stable
Matt Mackall <mpm@selenic.com> [Fri, 26 Jul 2013 15:42:10 -0500] rev 19509
revsingle: fix silly API issue (issue2992)
Fri, 26 Jul 2013 15:05:48 -0500 Added signature for changeset f0d7721d7322 stable
Matt Mackall <mpm@selenic.com> [Fri, 26 Jul 2013 15:05:48 -0500] rev 19508
Added signature for changeset f0d7721d7322
Fri, 26 Jul 2013 15:05:46 -0500 Added tag 2.7-rc for changeset f0d7721d7322 stable
Matt Mackall <mpm@selenic.com> [Fri, 26 Jul 2013 15:05:46 -0500] rev 19507
Added tag 2.7-rc for changeset f0d7721d7322
Thu, 25 Jul 2013 21:00:03 +0200 i18n-it: do not translate rst syntax stable 2.7-rc
Simon Heimberg <simohe@besonet.ch> [Thu, 25 Jul 2013 21:00:03 +0200] rev 19506
i18n-it: do not translate rst syntax ".. container::" and ".. note::" are rst syntax and therefore must not be translated.
Fri, 26 Jul 2013 14:44:13 +0100 convert: handle changeset sorting errors without traceback (issue3961) stable
Frank Kingswood <frank@kingswood-consulting.co.uk> [Fri, 26 Jul 2013 14:44:13 +0100] rev 19505
convert: handle changeset sorting errors without traceback (issue3961)
Thu, 25 Jul 2013 14:43:15 -0700 ancestor.deepest: ignore ninteresting while building result (issue3984) stable
Siddharth Agarwal <sid0@fb.com> [Thu, 25 Jul 2013 14:43:15 -0700] rev 19504
ancestor.deepest: ignore ninteresting while building result (issue3984) ninteresting indicates the number of non-zero elements in the interesting array, not the number of elements in the final list. Since elements in interesting can stand for more than one gca, limiting the number of results to ninteresting is an error. Tests for issue3984 are included.
Thu, 25 Jul 2013 17:35:53 +0800 ancestor.deepest: decrement ninteresting correctly (issue3984) stable
Wei, Elson <elson.wei@gmail.com> [Thu, 25 Jul 2013 17:35:53 +0800] rev 19503
ancestor.deepest: decrement ninteresting correctly (issue3984) The invariant this code tries to hold is that ninteresting is the number of non-zero elements in the interesting array. interesting[nsp] is incremented at the same time as interesting[sp] is decremented. So if interesting[nsp] was previously 0, ninteresting shouldn't be decremented.
Thu, 25 Jul 2013 14:20:37 -0700 ancestor.deepest: sort revs in C version stable
Siddharth Agarwal <sid0@fb.com> [Thu, 25 Jul 2013 14:20:37 -0700] rev 19502
ancestor.deepest: sort revs in C version This isn't strictly necessary, but it makes the code more consistent with the Python version.
Thu, 25 Jul 2013 10:44:51 -0400 check-code: add a check for the next() builtin, which was new in 2.6 stable
Augie Fackler <raf@durin42.com> [Thu, 25 Jul 2013 10:44:51 -0400] rev 19501
check-code: add a check for the next() builtin, which was new in 2.6
Thu, 25 Jul 2013 10:42:36 -0400 mq: rename next() to nextpatch() to avoid confusing a future check-code patch stable
Augie Fackler <raf@durin42.com> [Thu, 25 Jul 2013 10:42:36 -0400] rev 19500
mq: rename next() to nextpatch() to avoid confusing a future check-code patch next() is a builtin starting in 2.6, so it's also nice to avoid shadowing the builtin.
(0) -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip