Mirror/zeek
1
0
Fork 0
mirror of https://github.com/zeek/zeek.git synced 2025-10-06 00:28:21 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 2

Update deprecated ValManager::GetCount usages

Browse source
This commit is contained in:
Jon Siwek 2020-04-07 23:27:02 -07:00
parent 0ddac4abcf
commit 93f4c5871b
89 changed files with 830 additions and 844 deletions
Download patch file Download diff file Expand all files Collapse all files

4
src/probabilistic/bloom-filter.bif
View file

@ -180,9 +180,9 @@ function bloomfilter_lookup%(bf: opaque of bloomfilter, x: any%): count
reporter->Error("incompatible Bloom filter types");
else
return val_mgr->GetCount(static_cast<uint64_t>(bfv->Count(x)));
return val_mgr->Count(static_cast<uint64_t>(bfv->Count(x)));
return val_mgr->GetCount(0);
return val_mgr->Count(0);
%}
## Removes all elements from a Bloom filter. This function resets all bits in

8
src/probabilistic/top-k.bif
View file

@ -74,7 +74,7 @@ function topk_count%(handle: opaque of topk, value: any%): count
%{
assert(handle);
probabilistic::TopkVal* h = (probabilistic::TopkVal*) handle;
return val_mgr->GetCount(h->GetCount(value));
return val_mgr->Count(h->GetCount(value));
%}
## Get the maximal overestimation for count.
@ -94,7 +94,7 @@ function topk_epsilon%(handle: opaque of topk, value: any%): count
%{
assert(handle);
probabilistic::TopkVal* h = (probabilistic::TopkVal*) handle;
return val_mgr->GetCount(h->GetEpsilon(value));
return val_mgr->Count(h->GetEpsilon(value));
%}
## Get the number of elements this data structure is supposed to track (given
@ -113,7 +113,7 @@ function topk_size%(handle: opaque of topk%): count
%{
assert(handle);
probabilistic::TopkVal* h = (probabilistic::TopkVal*) handle;
return val_mgr->GetCount(h->GetSize());
return val_mgr->Count(h->GetSize());
%}
## Get the sum of all counts of all elements in the data structure.
@ -133,7 +133,7 @@ function topk_sum%(handle: opaque of topk%): count
%{
assert(handle);
probabilistic::TopkVal* h = (probabilistic::TopkVal*) handle;
return val_mgr->GetCount(h->GetSum());
return val_mgr->Count(h->GetSum());
%}
## Merge the second top-k data structure into the first.