Re: Restricting frequency of 'g'

[Richard Riley <rileyrg@googlemail.com>]

Lars Magne Ingebrigtsen <larsi@gnus.org> writes:

> "Jason L Tibbitts III" <tibbs@math.uh.edu> writes:
>
>> Actually I've been looking for something like that for quite some time.
>> For most of my reading, there's really no point in bothering to visit a
>> high-traffic group until it has a quantity of articles in it.
>
> Yes, I can see attraction of something like that.  Russ' implementation
> is based on scanning frequency, while the Mark Plaksin's is based more
> on the number of articles in the group, and Ted's is based on not
> showing the details of how many articles there are unread.
>
> So we seem to have at least three different approaches to the same
> idea.  It could be that this is the sort of thing that's difficult to
> provide, but requires that people just write their own variations to fit
> their own needs.

Hmm. Interesting take. With three different versions already in
existence it would suggest its not that difficult to provide, but more
difficult to choose a "best fit" solution.