Re: concurrency suggestions for Gnus

[Andy Moreton]

On Tue 08 Feb 2011, Miles Bader wrote:

> Ted Zlatanov <address@hidden> writes:
>> Tom> If we went the "lock anything" route, I would suggest a weak hash table
>> Tom> for locks, instead of putting the lock into the object.
>>
>> A bloom filter would guarantee no false negatives, which as you noted is
>> the vast majority of the cases, requires very little space per element
>
> A bloom filter...?!
>
> http://www.graphics.cornell.edu/pubs/1995/SSZG95.html
>
> -miles

Not that sort of bloom :-)

    http://en.wikipedia.org/wiki/Bloom_filter

    AndyM