ANN: hg graphlog extension

Joel Rosdahl joel at rosdahl.net
Sun Apr 1 10:26:42 CDT 2007


Joel Rosdahl <joel at rosdahl.net> writes:

> Matt Mackall <mpm at selenic.com> writes:
>
>> [...]
>> Can you comment some on the performance characteristics of the graph
>> algorithm?
>>
>> In my handy kernel repo with 50000 revs, I get:
>>
>> hg glog -q > /dev/null -> 24.7 seconds
>> hg log -q > /dev/null -> 5.6 seconds
>
> I haven't tried to optimize it at all yet, but the time to print one
> entry should be O(n), where n is the number of ongoing edges. In the
> <http://www.kernel.org/hg/linux-2.6> repo, there seems to be about
> 45 ongoing edges on average.
>
> I'll take a look at some optimizations some day soon.

Done. Current performance in the linux-2.6 repo on my box:

hg glog -q > /dev/null # --> 8.0 seconds
hg log -q > /dev/null # --> 4.1 seconds

-- 
Regards,
Joel Rosdahl <joel at rosdahl.net>
Key BB845E97; fingerprint 9F4B D780 6EF4 5700 778D  8B22 0064 F9FF BB84 5E97


More information about the Mercurial mailing list