anchor.diff:          -> bloom_filter().
   new_fpr(MaxItems, FPR, Hfs) ->
       Size = resize(calc_least_size(MaxItems, FPR), 8),
  -    new_(Size, MaxItems, Hfs).
  +    new_(Size, Hfs).
   
   %% @doc Creates a new bloom filter with the default (optimal) hash function set
   %%      based on the given probability of a single false positive (P1E, i.e.
   %%      false positive absolute count).
   -spec new_p1e(MaxItems::non_neg_integer(), P1E::float()) -> bloom_filter().
  -new_p1e(MaxItems = 0, _P1E) ->
  +new_p1e(_MaxItems = 0, _P1E) ->
       Hfs = ?REP_HFS:new(1),
  -    new_(8, MaxItems, Hfs);
  +    new_(8, Hfs);
   new_p1e(MaxItems, P1E) ->
       new_fpr(MaxItems, _FPR = P1E / MaxItems).
   
  
positive.code: -spec new_bpi(MaxItems::non_neg_integer(), BitsPerItem::float(), ?REP_HFS:hfs())
          -> bloom_filter().
  new_bpi(MaxItems, BitPerItem, Hfs) ->
      new_(resize(util:ceil(BitPerItem * MaxItems), 8), MaxItems, Hfs).
  
  %% @doc Creates a new bloom filter.
  -spec new_(BitSize::pos_integer(), MaxItems::non_neg_integer(), ?REP_HFS:hfs()) -> bloom_filter().
  new_(BitSize, MaxItems, Hfs) when (BitSize rem 8) =:= 0 ->
      #bloom{
             size = BitSize,
             max_items = MaxItems,
             hfs = Hfs,
             items_count = 0
            };
  new_(BitSize, MaxItems, Hfs) ->
      new_(resize(BitSize, 8), MaxItems, Hfs).
  
  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
  
  
negative.code: %%      false positive absolute count
  -spec new_p1e(MaxItems::non_neg_integer(), P1E::float(), ?REP_HFS:hfs())
          -> bloom_filter().
  new_p1e(_MaxItems = 0, _P1E, Hfs) ->
      new_(8, Hfs);
  new_p1e(MaxItems, P1E, Hfs) ->
      new_fpr(MaxItems, _FPR = P1E / MaxItems, Hfs).
  
  