Wed, 29 Nov 2017 10:38:52 -0500 stablesort: implement an ondisk cache
Pierre-Yves David <pierre-yves.david@octobus.net> [Wed, 29 Nov 2017 10:38:52 -0500] rev 3337
stablesort: implement an ondisk cache Persisting the cache on disk will be important for large repositories.
Wed, 20 Dec 2017 23:45:11 +0100 stablesort: realign a misaligned continue
Pierre-Yves David <pierre-yves.david@octobus.net> [Wed, 20 Dec 2017 23:45:11 +0100] rev 3336
stablesort: realign a misaligned continue We should make a better use of the jump cache now.
Wed, 20 Dec 2017 23:42:28 +0100 stablesort: remove some dead code
Pierre-Yves David <pierre-yves.david@octobus.net> [Wed, 20 Dec 2017 23:42:28 +0100] rev 3335
stablesort: remove some dead code This closure is no longer in use.
Wed, 20 Dec 2017 23:08:31 +0100 stablesort: abstract all cache access
Pierre-Yves David <pierre-yves.david@octobus.net> [Wed, 20 Dec 2017 23:08:31 +0100] rev 3334
stablesort: abstract all cache access This prepare an on disk version of the cache
Mon, 18 Dec 2017 20:04:50 +0100 stablerange: use first merge cache to skip over linear section
Pierre-Yves David <pierre-yves.david@octobus.net> [Mon, 18 Dec 2017 20:04:50 +0100] rev 3333
stablerange: use first merge cache to skip over linear section If we are to skip over a large section of the range, skipping everything until the first merge seems like a good idea.
Wed, 20 Dec 2017 20:46:10 +0100 stablerange: add a new 'firstmerge' cache
Pierre-Yves David <pierre-yves.david@octobus.net> [Wed, 20 Dec 2017 20:46:10 +0100] rev 3332
stablerange: add a new 'firstmerge' cache This cache store the first merge ancestors of a changesets. This is useful to avoid iteration over the changelog when building stablerange.
Wed, 20 Dec 2017 20:17:11 +0100 stablerange: drop unused `until` utility
Pierre-Yves David <pierre-yves.david@octobus.net> [Wed, 20 Dec 2017 20:17:11 +0100] rev 3331
stablerange: drop unused `until` utility We no longer needs this function.
(0) -3000 -1000 -300 -100 -30 -10 -7 +7 +10 +30 +100 +300 +1000 tip