On Jan 15, 2008 12:34 AM, Jan Engelhardt <jengelh@computergmbh.de> wrote:You need two complete revisions walk for this, one from the newest to oldset to compute the 'precedes' and one from the oldest to newest to compute the 'follows', so I would say it's more suitable used together with --topo-order option of git log that already does a walk, at least the slowdown is hidden in this case. Anyhow being able to compute precedes/following info in timely fashion and with low memory consumption is quite not trivial code, I have implemented for qgit long time ago and I remember gave a kook at the gitk code for reference also if at the end my implementation it's a bit different (less memory used but slightly more complicated). Just to give an idea of timing, on my new and awesome ;-) laptop loading full Linux tree it takes 3316ms, then calculating precedes/follows info (indexing the tree) it takes 233ms. Perhaps the slowest part is to load refs info, you need this to know what sha a tag/branch has and is a prerequisite to indexing, also if refs are compacted it takes almost 1 second on my PC because there is heavy disk activity in any case. Marco - 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
| H. Peter Anvin | Re: [rft] s2ram wakeup moves to .c, could fix few machines |
| Greg Kroah-Hartman | [PATCH 002/196] Chinese: rephrase English introduction in HOWTO |
| Ingo Molnar | [patch] PID namespace design bug, workaround |
| Tarkan Erimer | Re: Dual-Licensing Linux Kernel with GPL V2 and GPL V3 |
git: | |
| Eric Dumazet | Re: Multicast packet loss |
| Gerrit Renker | [PATCH 27/37] dccp: Integration of dynamic feature activation - part 2 (server side) |
| David Miller | [GIT]: Networking |
| Jarek Poplawski | Re: [PATCH] pkt_sched: Destroy gen estimators under rtnl_lock(). |
