Re: Improving Gnus speed

[Dan Christensen <jdc@uwo.ca>]

Francis Moreau <francis.moro@gmail.com> writes:

> But why are there so many calls to gnus-thread-total-score and
> gnus-thread-sort-by-most-recent-date knowing that my group contains only
> 1298 articles ?

The way thread sorting works is that not only are the threads sorted,
but the children of each article are also sorted using the same
function.  So it gets called recursively a lot of times.  That's
why a change I made to cache the parsed date/time info makes such
a bit difference.

>  gnus-thread-sort-by-most-recent-date    4348        31.652889000  0.0072798732
>  gnus-thread-total-score-1               82494       17.134565999  0.0002077068
>  gnus-thread-sort-by-total-score         8697        3.4791829999  0.0004000440

On the other hand, I'm still not sure why the above functions are called
that many times.  I wonder if the recursion is going one level deeper
than necessary?  Or if the overall sorting as well as the sorting of
children can be accomplished in a unified way, without repeating so
much work?  E.g., maybe first each thread could be traversed, and on
the way back up from the leaves to the root, you propagate to each
node the most recent date seen by any of the children, storing this
as some extra data with each article.  Then you just sort using this
stored data.

> Also do you know why the fetching process is so long (~ 7secs) specially
> since the group contains only cached articles ?

Sorry, I don't know anything about that.

Dan