As an outside observer, this argument is basically akin to "it's easy
to fly, you just need some faerie dust". Basically, you're dismissing
the entire complexity of the problem by saying "oh, that's easy, just
use some cached data" without any proof that this would work, or any
sample code, or really any evidence at all. Given that the path
simplification can be arbitrarily complex (I can pass any set of paths
I want), I don't believe that you can just use "a bit of cached
information" for this. If you did rely on cached information, said
information would probably be orders of magnitude larger than the
object graph itself (for repos with lots of files).
He's not saying it changes what commits are shown, he's saying it has
a performance impact - topo order has to post-process the graph. For a
quick demonstration, run `time sh -c 'git log | head'` vs `time sh -c
'git log --topo-order | head'`.
-Kevin Ballard
--
Kevin Ballard
http://kevin.sb.orgkevin@sb.orghttp://www.tildesoft.com
--
To unsubscribe from this list: send the line "unsubscribe git" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html