Wed, 11 Jul 2018 00:35:01 -0700 revlog: add function to slice chunk down to a given size
Boris Feld <boris.feld@octobus.net> [Wed, 11 Jul 2018 00:35:01 -0700] rev 38642
revlog: add function to slice chunk down to a given size It is possible to encounter situations where the slicing based on density did not achieve chunk smaller than the 4*textlength limit. To avoid extra memory consumption in those cases, we need to be able to break down chunk to a given size. Actual caller comes in the next changesets.
Tue, 10 Jul 2018 11:53:36 +0200 revlog: extract density based slicing into its own function
Boris Feld <boris.feld@octobus.net> [Tue, 10 Jul 2018 11:53:36 +0200] rev 38641
revlog: extract density based slicing into its own function We are going to introduce another slicing step. We start by extracting the existing one into its own function.
Tue, 10 Jul 2018 10:34:33 +0200 revlog: document and test _slicechunk
Boris Feld <boris.feld@octobus.net> [Tue, 10 Jul 2018 10:34:33 +0200] rev 38640
revlog: document and test _slicechunk
Tue, 10 Jul 2018 10:18:46 +0200 revlog: add a doctest for _segmentspan
Boris Feld <boris.feld@octobus.net> [Tue, 10 Jul 2018 10:18:46 +0200] rev 38639
revlog: add a doctest for _segmentspan
Tue, 10 Jul 2018 10:04:44 +0200 revlog: add a doctest to _trimchunk
Boris Feld <boris.feld@octobus.net> [Tue, 10 Jul 2018 10:04:44 +0200] rev 38638
revlog: add a doctest to _trimchunk
Tue, 10 Jul 2018 10:04:31 +0200 revlog: introduce a tiny mock of a revlog class
Boris Feld <boris.feld@octobus.net> [Tue, 10 Jul 2018 10:04:31 +0200] rev 38637
revlog: introduce a tiny mock of a revlog class This will be used in various function doctest added in the next changesets. The class seems small enough to live in the module directly.
Thu, 17 May 2018 15:10:36 +0200 revlog: _segmentspan computes the byte span of a segment
Paul Morelle <paul.morelle@octobus.net> [Thu, 17 May 2018 15:10:36 +0200] rev 38636
revlog: _segmentspan computes the byte span of a segment Refactor out this code to be used somewhere else in a next changeset
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 -10 +10 +100 +300 +1000 +3000 +10000 tip