Tue, 14 Aug 2012 08:11:15 -0700 templatekw: merge, preferring the second implementation
Bryan O'Sullivan <bryano@fb.com> [Tue, 14 Aug 2012 08:11:15 -0700] rev 17358
templatekw: merge, preferring the second implementation
Tue, 10 Jul 2012 08:43:32 -0700 templatekw: add p1rev, p1node, p2rev, p2node keywords
epriestley <hg@yghe.net> [Tue, 10 Jul 2012 08:43:32 -0700] rev 17357
templatekw: add p1rev, p1node, p2rev, p2node keywords The {parents} template is cumbersome for some uses, as it does not show anything if there's only one "natural" parent and you can't use it to get the full 40 digit node hashes for parents unless you rely on the behavior of the --debug flag. Introduce four new template keywords: {p1rev}, {p2rev}, {p1node} and {p2node}. The "node" flavors of these always show full 40 digit hashes, but users can get the short version with a filter construction like '{p1node|short}'.
Mon, 13 Aug 2012 14:04:52 -0700 parsers: fix an integer size warning issued by clang
Bryan O'Sullivan <bryano@fb.com> [Mon, 13 Aug 2012 14:04:52 -0700] rev 17356
parsers: fix an integer size warning issued by clang
Tue, 10 Jul 2012 08:43:32 -0700 templatekw: add parent1, parent1node, parent2, parent2node keywords
epriestley <hg@yghe.net> [Tue, 10 Jul 2012 08:43:32 -0700] rev 17355
templatekw: add parent1, parent1node, parent2, parent2node keywords The {parents} template is cumbersome for some uses, as it does not show anything if there's only one "natural" parent and you can't use it to get the full 40 digit node hashes for parents unless you rely on the behavior of the --debug flag. Introduce four new template keywords: {parent1}, {parent2}, {parent1node} and {parent2node}. The "node" flavors of these always show full 40 digit hashes, but users can get the short version with a filter construction like '{parent1node|short}'.
Mon, 13 Aug 2012 11:49:55 -0700 Merge with crew-stable
Bryan O'Sullivan <bryano@fb.com> [Mon, 13 Aug 2012 11:49:55 -0700] rev 17354
Merge with crew-stable
Thu, 02 Aug 2012 19:10:45 +0400 revlog: don't try to partialmatch strings those length > 40 stable
sorcerer [Thu, 02 Aug 2012 19:10:45 +0400] rev 17353
revlog: don't try to partialmatch strings those length > 40 _partialmatch() does prefix matching against nodes. String passed to _partialmetch() actualy may be any string, not prefix only. For example, "e410be8603932e46a51298748a4b874739037fad or 300" is a good argument for _partialmatch(). When _partialmatch() searches using radix tree, index_partialmatch() C function shouldn't try to match too long strings.
(0) -10000 -3000 -1000 -300 -100 -30 -10 -6 +6 +10 +30 +100 +300 +1000 +3000 +10000 +30000 tip