Mirror/zeek
1
0
Fork 0
mirror of https://github.com/zeek/zeek.git synced 2025-10-13 20:18:20 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 3

Fix modding.

Browse source
This commit is contained in:
Matthias Vallentin 2013-06-06 13:21:27 -07:00
parent f211b856c9
commit 7ce986e31f
1 changed files with 4 additions and 4 deletions
Download patch file Download diff file Expand all files Collapse all files

8
src/BloomFilter.cc
View file

@ -188,13 +188,13 @@ bool BasicBloomFilter::DoUnserialize(UnserialInfo* info)
void BasicBloomFilter::AddImpl(const HashPolicy::HashVector& h) void BasicBloomFilter::AddImpl(const HashPolicy::HashVector& h)
{ {
for ( size_t i = 0; i < h.size(); ++i ) for ( size_t i = 0; i < h.size(); ++i )
bits_->Set(h[i] % h.size()); bits_->Set(h[i] % bits_->Size());
} }
size_t BasicBloomFilter::CountImpl(const HashPolicy::HashVector& h) const size_t BasicBloomFilter::CountImpl(const HashPolicy::HashVector& h) const
{ {
for ( size_t i = 0; i < h.size(); ++i ) for ( size_t i = 0; i < h.size(); ++i )
if ( ! (*bits_)[h[i] % h.size()] ) if ( ! (*bits_)[h[i] % bits_->Size()] )
return 0; return 0;
return 1; return 1;
} }
@ -233,7 +233,7 @@ bool CountingBloomFilter::DoUnserialize(UnserialInfo* info)
void CountingBloomFilter::AddImpl(const HashPolicy::HashVector& h) void CountingBloomFilter::AddImpl(const HashPolicy::HashVector& h)
{ {
for ( size_t i = 0; i < h.size(); ++i ) for ( size_t i = 0; i < h.size(); ++i )
cells_->Increment(h[i] % h.size(), 1); cells_->Increment(h[i] % cells_->Size(), 1);
} }
size_t CountingBloomFilter::CountImpl(const HashPolicy::HashVector& h) const size_t CountingBloomFilter::CountImpl(const HashPolicy::HashVector& h) const
@ -242,7 +242,7 @@ size_t CountingBloomFilter::CountImpl(const HashPolicy::HashVector& h) const
std::numeric_limits<CounterVector::size_type>::max(); std::numeric_limits<CounterVector::size_type>::max();
for ( size_t i = 0; i < h.size(); ++i ) for ( size_t i = 0; i < h.size(); ++i )
{ {
CounterVector::size_type cnt = cells_->Count(h[i] % h.size()); CounterVector::size_type cnt = cells_->Count(h[i] % cells_->Size());
if ( cnt < min ) if ( cnt < min )
min = cnt; min = cnt;
} }