greg/bloomerl
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

Minor fix

Browse source
This commit is contained in:
Gregory Burd 2012-06-23 16:11:02 +01:00
parent f59214e55b
commit 17cb87ca42
1 changed files with 6 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

7
src/bloom.erl
View file

@ -67,7 +67,7 @@ add_element(Key, #bloom{keys=Keys, n=N, bitmap=Bitmap} = B) when Keys < N ->
Idxs = calc_idxs(Key, B),
Bitmap0 = set_bits(Bitmap, Idxs),
case Bitmap0 == Bitmap of
true -> B; % Don't increment key count for duplicates.
true -> B#bloom{bitmap=Bitmap0}; % Don't increment key count for duplicates.
false -> B#bloom{bitmap=Bitmap0, keys=Keys+1}
end.
@ -82,6 +82,11 @@ set_bits(Bin, [Idx | Idxs]) ->
Byte0 = Byte bor Mask,
set_bits(<<Pre/binary, Byte0:8, Post/binary>>, Idxs).
%set_bits(Bin, [Idx | Idxs]) ->
% <<Pre:Idx/bitstring, _:1/bitstring, Post/bitstring>> = Bin,
% set_bits(<<Pre/bitstring, 1:1, Post/bitstring>>, Idxs).
%% @internal
%% @doc Find the optimal bitmap size and number of hashes.
%TODO -spec(non_neg_integer(), number()) -> non_neg_integer().