Hi,
On Thu, 24 May 2007, Junio C Hamano wrote:
This adds a hardcoded slop value (1 day) to the cut-off
heuristics to work this kind of problem around.
Sounds sensible. (ACK.)
I think the algorithm could be made a bit smarter by deepening the graph
on demand as a new commit is asked to be named (this would require
rewriting of name_rev() function not to recurse itself but use a
traversal list like revision.c traverser does), but that would be a
separate issue.
I also wanted to make the decorator (optionally) smarter, to actually do
something like name_rev on demand, which would be much faster than (and
coloured, in contrast to) `git log | git -p name-rev --stdin`.
Ciao,
Dscho