Tue, 10 Jul 2018 15:17:05 -0700 revlog: early return in _slicechunk when span is already small enough
Boris Feld <boris.feld@octobus.net> [Tue, 10 Jul 2018 15:17:05 -0700] rev 38635
revlog: early return in _slicechunk when span is already small enough If the full span is smaller than the minimum gap size we'll consider, we know we won't do any slicing and we can return earlier.
Tue, 19 Jun 2018 15:03:58 +0200 revlog: early return in _slicechunk when density is already good
Paul Morelle <paul.morelle@octobus.net> [Tue, 19 Jun 2018 15:03:58 +0200] rev 38634
revlog: early return in _slicechunk when density is already good We don't need to do anything if we know we won't enter the second while loop. Save the overhead of the first loop by returning earlier.
Tue, 10 Jul 2018 02:33:43 +0200 sparse-read: discard gap below 65K only
Boris Feld <boris.feld@octobus.net> [Tue, 10 Jul 2018 02:33:43 +0200] rev 38633
sparse-read: discard gap below 65K only Testing on actual data shows that 65K is more efficient in both time and memory than 256K.
(0) -30000 -10000 -3000 -1000 -300 -100 -30 -10 -3 +3 +10 +30 +100 +300 +1000 +3000 +10000 tip