anchor.diff:  
   % faster than lists:foldl
   p_add_list(Hfs, BFSize, Acc, [Item | Items]) ->
  -    Pos = apply(element(1, Hfs), apply_val_rem, [Hfs, Item, BFSize]),
  +    Pos = ?REP_HFS:apply_val_rem(Hfs, Item, BFSize),
       p_add_list(Hfs, BFSize, set_Bits(Acc, Pos), Items);
   p_add_list(_Hfs, _BFSize, Acc, []) -> 
       Acc.    
  
positive.code:                size = Size,
                 hfs = Hfs,
                 items_count = NumItems } = Bloom) -> 
      HCount = apply(element(1, Hfs), size, [Hfs]),
      [{filter_bit_size, Size},
       {struct_byte_size, byte_size(term_to_binary(Bloom))},
       {hash_fun_num, HCount},
  
negative.code: % @doc returns true if the bloom filter contains item
  -spec is_element_(bloom_filter_t(), key()) -> boolean().
  is_element_(#bloom{size = BFSize, hfs = Hfs, filter = Filter}, Item) -> 
      Positions = ?REP_HFS:apply_val_rem(Hfs, Item, BFSize),
      check_Bits(Filter, Positions).
  
  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
  