Mon, 24 Feb 2014 22:42:14 +0100 revlog: introduce commonancestors method for getting all common ancestor heads
Mads Kiilerich <madski@unity3d.com> [Mon, 24 Feb 2014 22:42:14 +0100] rev 20557
revlog: introduce commonancestors method for getting all common ancestor heads
Mon, 24 Feb 2014 22:42:14 +0100 localrepo: commit: avoid calling expensive ancestor function when p1 is nullrev
Mads Kiilerich <madski@unity3d.com> [Mon, 24 Feb 2014 22:42:14 +0100] rev 20556
localrepo: commit: avoid calling expensive ancestor function when p1 is nullrev
Mon, 24 Feb 2014 22:42:13 +0100 ancestors: remove unnecessary handling of 'left'
Mads Kiilerich <madski@unity3d.com> [Mon, 24 Feb 2014 22:42:13 +0100] rev 20555
ancestors: remove unnecessary handling of 'left' If one of the initial nodes also is an ancestor then that most be the only ancestor. There is no need for additional bookkeeping.
Mon, 24 Feb 2014 22:42:13 +0100 parsers: remove unreachable and invalid code in index_ancestors
Mads Kiilerich <madski@unity3d.com> [Mon, 24 Feb 2014 22:42:13 +0100] rev 20554
parsers: remove unreachable and invalid code in index_ancestors The function normally returns a list. Returning a single element instead of a list with one element would be weird.
Thu, 13 Feb 2014 14:27:12 -0800 cmdutil: implemented new lazy increasingwindows
Lucas Moscovicz <lmoscovicz@fb.com> [Thu, 13 Feb 2014 14:27:12 -0800] rev 20553
cmdutil: implemented new lazy increasingwindows Now log can work in a lazy way and get results as soon as they are processed. Performance Benchmarking: $ time hg log -l1 -qr "branch(default)" 0:9117c6561b0b real 0m2.303s user 0m2.252s sys 0m0.048s $ time ./hg log -l1 -qr "branch(default)" 0:9117c6561b0b real 0m0.238s user 0m0.199s sys 0m0.037s
Thu, 20 Feb 2014 10:15:38 -0800 revset: added __nonzero__ method to lazyset
Lucas Moscovicz <lmoscovicz@fb.com> [Thu, 20 Feb 2014 10:15:38 -0800] rev 20552
revset: added __nonzero__ method to lazyset Now it doesn't have to go through all the set and can return lazily as soon as it finds one element.
(0) -10000 -3000 -1000 -300 -100 -30 -10 -6 +6 +10 +30 +100 +300 +1000 +3000 +10000 +30000 tip