Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.c++ > #123882
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Newsgroups | comp.lang.c++ |
| Subject | Re: A perfect generic bloom filter |
| Date | 2026-05-24 03:15 -0700 |
| Organization | A noiseless patient Spider |
| Message-ID | <10uuj3f$ect8$1@dont-email.me> (permalink) |
| References | <10ul249$89if$1@raubtier-asyl.eternal-september.org> <10umgnh$k3kl$1@dont-email.me> <10uqnrn$1o9hj$1@redfloyd.dont-email.me> <10urpqj$198f0$1@dont-email.me> |
On 5/23/2026 1:51 AM, boltar@caprica.universe wrote: > On Fri, 22 May 2026 16:11:50 -0700 > red floyd <no.spam.here@its.invalid> gabbled: >> On 5/21/2026 1:45 AM, boltar@caprica.universe wrote: >>> On Wed, 20 May 2026 21:30:22 +0200 >>> Bonita Montero <Bonita.Montero@gmail.com> gabbled: >>>> The cool thing about this class is that in contrast to the C++ contai- >>>> ners which need a hasher it needs multiple hashers as any Bloom filter. >>> >>> Had to google wtf a bloom filter is. Seems like a remarkably complicated >>> way to partially replace a hash lookup. >>> >> According to Wikipedia, it's for data sets that are too big for a hash >> lookup. > > That makes little sense. If you don't have enough memory for the hash table > then you're certainly not going to have enough for the data itself unless > each data is shorter than the hash value. > Think of a finite hash table that handles collisions by linking into a stack, queue, or something... Or try a rehash with a state in the node...
Back to comp.lang.c++ | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
A perfect generic bloom filter Bonita Montero <Bonita.Montero@gmail.com> - 2026-05-20 21:30 +0200
Re: A perfect generic bloom filter Bonita Montero <Bonita.Montero@gmail.com> - 2026-05-21 09:46 +0200
Re: A perfect generic bloom filter boltar@caprica.universe - 2026-05-21 08:45 +0000
Re: A perfect generic bloom filter Bonita Montero <Bonita.Montero@gmail.com> - 2026-05-22 08:34 +0200
Re: A perfect generic bloom filter boltar@caprica.universe - 2026-05-22 09:15 +0000
Re: A perfect generic bloom filter Bonita Montero <Bonita.Montero@gmail.com> - 2026-05-22 11:34 +0200
Re: A perfect generic bloom filter red floyd <no.spam.here@its.invalid> - 2026-05-22 16:11 -0700
Re: A perfect generic bloom filter boltar@caprica.universe - 2026-05-23 08:51 +0000
Re: A perfect generic bloom filter "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2026-05-24 03:15 -0700
Re: A perfect generic bloom filter Bonita Montero <Bonita.Montero@gmail.com> - 2026-05-24 18:35 +0200
csiph-web