Re: [PATCH v4 0/4] Add --no-ahead-behind to status
- Date: Tue, 9 Jan 2018 09:29:31 -0500
- From: Derrick Stolee <stolee@xxxxxxxxx>
- Subject: Re: [PATCH v4 0/4] Add --no-ahead-behind to status
On 1/9/2018 8:15 AM, Johannes Schindelin wrote:
On Tue, 9 Jan 2018, Jeff King wrote:
On Mon, Jan 08, 2018 at 03:04:20PM -0500, Jeff Hostetler wrote:
I was thinking about something similar to the logic we use today
about whether to start reporting progress on other long commands.
That would mean you could still get the ahead/behind values if you
aren't that far behind but would only get "different" if that
calculation gets too expensive (which implies the actual value isn't
going to be all that helpful anyway).
After a off-line conversation with the others I'm going to look into
a version that is limited to n commits rather than be completely on or
off. I think if you are for example less than 100 a/b then those numbers
have value; if you are past n, then they have much less value.
I'd rather do it by a fixed limit than by time to ensure that output
is predictable on graph shape and not on system load.
I like this direction a lot. I had hoped we could say "100+ commits
How about "100+ commits apart" instead?
Unfortunately, we can _never_ guarantee more than 1 commit ahead/behind
unless we walk to the merge base (or have generation numbers). For
example, suppose the 101st commit in each history has a parent that in
the recent history of the other commit. (There must be merge commits to
make this work without creating cycles, but the ahead/behind counts
could be much lower than the number of walked commits.)
but I don't think we can do so accurately without generation numbers.
Even with generation numbers, it is not possible to say whether two given
commits reflect diverging branches or have an ancestor-descendant
relationship (or in graph speak: whether they are comparable).
If you walk commits using a priority queue where the priority is the
generation number, then you can know that you have walked all reachable
commits with generation greater than X, so you know among those commits
which are comparable or not.
For this to work accurately, you must walk from both tips to a
generation lower than each. It does not help the case where one branch
is 100,000+ commits ahead, where most of those commits have higher
generation number than the behind commit.
It could potentially make it possible to cut off the commit traversal, but
I do not even see how that would be possible.
The only thing you could say for sure is that two different commits with
the same generation number are for sure "uncomparable", i.e. reflect
E.g., the case I mentioned at the bottom of this mail:
I haven't thought too hard on it, but I suspect with generation numbers
you could bound it and at least say "100+ ahead" or "100+ behind".
If you have walked 100 commits and still have not found a merge base,
there is no telling whether one start point is the ancestor of the other.
All you can say is that there are more than 100 commits in the
You would not even be able to say that the *shortest* path between those
two start points is longer than 100 commits, you can construct
pathological DAGs pretty easily.
Even if you had generation numbers, and one commit's generation number
was, say, 17, and the other one's was 17,171, you could not necessarily
assume that the 17 one is the ancestor of the 17,171 one, all you can say
that it is not possible the other way round.
This is why we cannot _always_ use generation numbers, but they do help
in some cases.
But I don't think you can approximate both ahead and behind together
without finding the actual merge base.
But even still, finding small answers quickly and accurately and punting
to "really far, I didn't bother to compute it" on the big ones would be
an improvement over always punting.
Indeed. The longer I think about it, the more I like the "100+ commits
Again, I strongly suggest we drop this approach because it will be more
pain than it is worth.