Packagers: nightly builds?

Benoit Boissinot benoit.boissinot at ens-lyon.org
Mon Jan 26 15:47:55 CST 2009


On Mon, Jan 26, 2009 at 10:17:46PM +0100, Gilles Moris wrote:
> On Mon January 26 2009 10:54:20 Benoit Boissinot wrote:
> > > It is better to use the largest number of rev from a given changeset, otherwise
> > > a backout can give a shortcut that will lead to non monotonic numbers. This is
> > > why I used this convention in the nearest extension.
> > 
> > Could you draw a little picture explaining this? I'm not sure I
> > understood.
> > 
> 
> Suppose you have a linear history with A tagged as Tag
> 
> A(Tag)---B---C---D---E
> 
> The distance from A to E is 4 and you will annotate your version as Tag.4
> 
> Now imagine B is wrong and you want to backout it as B' and merge it back in F.
> 
> A(Tag)---B---C---D---E---F
>           \             /
>            B'----------/
> 
> Now the smallest distance is A-B-B'-F which is 3, which will give you Tag.3
> This can give the impression that it is an earlier version. With the longest
> distance, it gives you Tag.5.
> 
> May be by <number of descendants> you meant from the rev 0. But you will face
> the same kind of problem at the tree level. Or I did not understood what you
> meant by <number of descendants> ?

Hum sorry, I meant number of ancestors :/

Benoit
-- 
:wq


More information about the Mercurial-devel mailing list