From: Junio C Hamano <gitster@pobox.com>
Date: Thu, 30 Aug 2012 03:53:49 GMT
Subject: Re: [PATCH 3/3] name-rev: --weight option (WIP)
Message-ID: <7vharlujaq.fsf@alter.siamese.dyndns.org>
In-Reply-To: <20120830033611.GA32268@sigill.intra.peff.net>

Jeff King <peff@peff.net> writes:

> I wonder if you can
> define the weight as a recursive function of the parents.

I do not think we can.  A merge Z between X (that has N commits
behind it) and Y (that has M commits behind it) has at most N+M+1
commits behind it (counting itself), but we cannot tell how many
among these N and M are shared.

> That would double-count "A" and "B" in this example. But maybe there is
> a clever way to define it that avoids that.

We've dealt with this issue long time ago when we optimized the
bisection count, which involves exactly the same issue.