Fri, 15 Apr 2011 16:15:28 +0200 opener: use %r in format string for abort
Adrian Buehlmann <adrian@cadifra.com> [Fri, 15 Apr 2011 16:15:28 +0200] rev 13943
opener: use %r in format string for abort
Sat, 16 Apr 2011 01:05:56 +0900 wireproto: allow unbundle with hashed heads parameter (issue2126)
Shuhei Takahashi <takahashi.shuhei@gmail.com> [Sat, 16 Apr 2011 01:05:56 +0900] rev 13942
wireproto: allow unbundle with hashed heads parameter (issue2126) Current wire protocol of unbundle sends the list of all heads in the remote repository to avoid race condition. This causes "URL too long" error on HTTP server when the repository has many heads. This change allows clients to send SHA1 hash of sorted head hashes instead. Also, this introduces "unbundlehash" capability to inform them that the server accepts hashed heads parameter.
Fri, 15 Apr 2011 23:46:59 -0500 merge with stable
Matt Mackall <mpm@selenic.com> [Fri, 15 Apr 2011 23:46:59 -0500] rev 13941
merge with stable
Fri, 15 Apr 2011 23:45:41 -0500 encoding: avoid localstr when a string can be encoded losslessly (issue2763) stable
Matt Mackall <mpm@selenic.com> [Fri, 15 Apr 2011 23:45:41 -0500] rev 13940
encoding: avoid localstr when a string can be encoded losslessly (issue2763) localstr's hash method exists to prevent bogus matching on lossy local encodings. For instance, we don't want 'caf?' to match 'café' in an ASCII locale. But when café can be losslessly encoded in the local charset, we can simply use a normal string and avoid the hashing trick. This avoids using localstr's hash method, which would prevent a match between
Fri, 15 Apr 2011 20:35:59 -0500 merge with stable
Matt Mackall <mpm@selenic.com> [Fri, 15 Apr 2011 20:35:59 -0500] rev 13939
merge with stable
Fri, 15 Apr 2011 20:07:44 +0300 revset: optimize stringset when subset == entire repo
Idan Kamara <idankk86@gmail.com> [Fri, 15 Apr 2011 20:07:44 +0300] rev 13938
revset: optimize stringset when subset == entire repo if range(len(repo)) is passed to stringset and x is a valid rev (checked before) then x is guaranteed to be in subset, we can check for that by comparing the lengths of the sets
(0) -10000 -3000 -1000 -300 -100 -30 -10 -6 +6 +10 +30 +100 +300 +1000 +3000 +10000 +30000 tip