Sun, 04 Mar 2018 07:39:46 -0800 setdiscovery: remove initialsamplesize from a condition
Martin von Zweigbergk <martinvonz@google.com> [Sun, 04 Mar 2018 07:39:46 -0800] rev 36716
setdiscovery: remove initialsamplesize from a condition It seems more direct to compare the actual sample size. That way we can change the sample taken earlier in the code without breaking the condition. Differential Revision: https://phab.mercurial-scm.org/D2644
Sun, 04 Mar 2018 07:37:08 -0800 setdiscovery: back out changeset 5cfdf6137af8 (issue5809)
Martin von Zweigbergk <martinvonz@google.com> [Sun, 04 Mar 2018 07:37:08 -0800] rev 36715
setdiscovery: back out changeset 5cfdf6137af8 (issue5809) As explained in the bug report, this commit caused a performance regression. The problem occurs when the local repo has very many heads. Before 5cfdf6137af8, we used to get the remote's list of heads and if these heads mostly overlapped with the local repo's heads, we would mark these common heads as common, which would greatly reduce the size of the set of undecided nodes. Note that a similar problem existed before 5cfdf6137af8: If the local repo had very many heads and the server just had a few (or many heads from a disjoint set), we would do the same kind of slow discovery as we would with 5cfdf6137af8 in the case where local and remote repos share a large set of common nodes. For now, we just back out 5cfdf6137af8. We should improve the discovery in the "local has many heads, remote has few heads" case, but let's do that after backing this out. Differential Revision: https://phab.mercurial-scm.org/D2643
Sun, 04 Mar 2018 13:04:12 -0500 hgweb: fix up trailing slash detection on Python 3
Augie Fackler <augie@google.com> [Sun, 04 Mar 2018 13:04:12 -0500] rev 36714
hgweb: fix up trailing slash detection on Python 3 Fixes a couple of hgweb tests. Differential Revision: https://phab.mercurial-scm.org/D2661
Sun, 04 Mar 2018 13:03:22 -0500 hgweb: convert req.form to bytes for all keys and values
Augie Fackler <augie@google.com> [Sun, 04 Mar 2018 13:03:22 -0500] rev 36713
hgweb: convert req.form to bytes for all keys and values This is just going to be a lot cleaner for our internals. Differential Revision: https://phab.mercurial-scm.org/D2660
Sun, 04 Mar 2018 12:33:15 -0500 templater: show repr of string we're rejecting
Augie Fackler <augie@google.com> [Sun, 04 Mar 2018 12:33:15 -0500] rev 36712
templater: show repr of string we're rejecting I feel like this should make it a little easier to hunt down problems. Differential Revision: https://phab.mercurial-scm.org/D2659
Sun, 04 Mar 2018 12:21:01 -0500 webutil: some %d instead of %s love on ints
Augie Fackler <augie@google.com> [Sun, 04 Mar 2018 12:21:01 -0500] rev 36711
webutil: some %d instead of %s love on ints Differential Revision: https://phab.mercurial-scm.org/D2658
Sun, 04 Mar 2018 12:17:02 -0500 py3: whitelist three more cases
Augie Fackler <augie@google.com> [Sun, 04 Mar 2018 12:17:02 -0500] rev 36710
py3: whitelist three more cases Differential Revision: https://phab.mercurial-scm.org/D2657
Sun, 04 Mar 2018 12:08:53 -0500 archival: our filenames are bytes, not strs
Augie Fackler <augie@google.com> [Sun, 04 Mar 2018 12:08:53 -0500] rev 36709
archival: our filenames are bytes, not strs Differential Revision: https://phab.mercurial-scm.org/D2656
Sun, 04 Mar 2018 12:08:37 -0500 archival: tar file modes need to be sysstrs
Augie Fackler <augie@google.com> [Sun, 04 Mar 2018 12:08:37 -0500] rev 36708
archival: tar file modes need to be sysstrs Differential Revision: https://phab.mercurial-scm.org/D2655
Sun, 04 Mar 2018 12:08:19 -0500 archival: fsdecode paths before passing to tar or zip objects
Augie Fackler <augie@google.com> [Sun, 04 Mar 2018 12:08:19 -0500] rev 36707
archival: fsdecode paths before passing to tar or zip objects Both of these traffic in unicodes for filenames on Python 3, and inspection of the tarfile module shows that it uses the filesystem encoding, so fsdecode is the right choice. Differential Revision: https://phab.mercurial-scm.org/D2654
(0) -30000 -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 tip