Thu, 21 Dec 2017 00:34:31 +0100 Pierre-Yves David stablesort: expose the cache through the repository
Wed, 29 Nov 2017 10:38:52 -0500 Pierre-Yves David stablesort: implement an ondisk cache
Wed, 20 Dec 2017 23:45:11 +0100 Pierre-Yves David stablesort: realign a misaligned continue
Wed, 20 Dec 2017 23:42:28 +0100 Pierre-Yves David stablesort: remove some dead code
Wed, 20 Dec 2017 23:08:31 +0100 Pierre-Yves David stablesort: abstract all cache access
Mon, 18 Dec 2017 20:04:50 +0100 Pierre-Yves David stablerange: use first merge cache to skip over linear section
Wed, 20 Dec 2017 20:46:10 +0100 Pierre-Yves David stablerange: add a new 'firstmerge' cache
Wed, 20 Dec 2017 20:17:11 +0100 Pierre-Yves David stablerange: drop unused `until` utility
Wed, 20 Dec 2017 19:47:19 +0100 Pierre-Yves David stablerange: use cached size data instead of walking the graph
Wed, 20 Dec 2017 17:56:38 +0100 Pierre-Yves David stablesort: record previous segment size in the jump
Wed, 20 Dec 2017 17:59:14 +0100 Pierre-Yves David stablesort: move jump recording inside the exclusive function
Wed, 20 Dec 2017 17:49:41 +0100 Pierre-Yves David stablerange: compute jump size after jump retrieval only
Sun, 10 Dec 2017 03:49:48 +0100 Pierre-Yves David stablesort: warm jump cache more efficiently
Sun, 10 Dec 2017 03:39:56 +0100 Pierre-Yves David stablesort: use a regular dict for jumps
Wed, 20 Dec 2017 15:51:05 +0100 Pierre-Yves David stablerange: use the jump information for faster iteration
(0) -3000 -1000 -300 -100 -15 +15 +100 +300 +1000 tip