[PATCH 0 of 5] shrink-revlog: v4: pluggable sort algorithms

[Benoit Boissinot]

On Thu, Mar 11, 2010 at 07:43:42PM -0500, Greg Ward wrote:
> On Wed, Mar 10, 2010 at 3:09 AM, Benoit Boissinot
> <benoit.boissinot at ens-lyon.org> wrote:
> > pushed, thanks!
> 
> Hooray!  So happy to get that off my plate.
> 
> > (I think we should get rid of branchsort)
> 
> Ahh, I see you did that.  Now, how about snappier names for
> 'reversepostorder' and 'postorderreverse'?  I can't remember which is
> which, so I doubt anyone other than you can.
> 
> Idea: rename 'reversepostorder' (the well-behaved default) to
> 'parentdelta', since it simulates what we would get if revlog had
> parent deltas now.  And rename 'postorderreverse' to 'experimental',
> since that's exactly what it is: sometimes better, sometimes worse,
> and unstable.

It's very easy to make it stable, just sort by hash the children lists.
That's the only reason the other algorithm is stable.

But, it would be even better to understand what makes it better, i.e. in
what order should the children/parents be chosen.

cheers,

Benoit

-- 
:wq