| Sun, 26 Nov 2017 10:34:46 -0500 |
Pierre-Yves David |
stablesort: write a flat version of the algorithm
|
| Sat, 25 Nov 2017 18:53:23 -0500 |
Pierre-Yves David |
stablesort: simplify processing of non-merge changesets
|
| Sat, 25 Nov 2017 18:42:23 -0500 |
Pierre-Yves David |
stablesort: extract a '_revsfrom' method
|
| Sun, 10 Dec 2017 01:48:32 +0100 |
Pierre-Yves David |
stablerange: use the new cache object in the 'mergepoint' version
|
| Sat, 25 Nov 2017 18:31:37 -0500 |
Pierre-Yves David |
stablesort: introduce a cache object
|
| Sat, 25 Nov 2017 16:05:09 -0500 |
Pierre-Yves David |
stablesort: start implementing more advanced version of headstart sorting
|
| Sun, 10 Dec 2017 01:38:48 +0100 |
Pierre-Yves David |
stablerange: make use of the limit argument in 'mergepoint'
|
| Sun, 10 Dec 2017 01:33:39 +0100 |
Pierre-Yves David |
stablerange: introduce a smarte version of stablerange for 'mergepoint'
|
| Sun, 10 Dec 2017 01:26:40 +0100 |
Pierre-Yves David |
stablerange: introduce an intermediary abstract class for caching
|
| Sun, 10 Dec 2017 01:06:16 +0100 |
Pierre-Yves David |
stablerange: introduce a basic-mergepoint method
|
| Sun, 26 Nov 2017 11:58:35 -0500 |
Pierre-Yves David |
stablesort: add a new test to check for fully independant branches
|
| Sat, 25 Nov 2017 17:37:37 -0500 |
Pierre-Yves David |
stablesort: add a --limit argument
|
| Sat, 25 Nov 2017 15:14:50 -0500 |
Pierre-Yves David |
stablesort: introduce a mergepoint based method focused on head
|
| Sat, 25 Nov 2017 04:09:17 -0500 |
Pierre-Yves David |
stablesort: introduce a "mergepoint" method
|
| Sun, 10 Dec 2017 00:20:06 +0100 |
Pierre-Yves David |
stablerange: fallback to a more naive approach to find subrange
|
