anchor.diff:  %% @author Maik Lange <malange@informatik.hu-berlin.de>
   %% @doc    Approximate Reconciliation Tree (ART) implementation
   %%         Represents a packed merkle tree.
  -%%         SRC: 2002 - J.Byers, J.Considine, M.Mitzenmachen
  +%% @end
  +%% @reference
  +%%         2002 - J.Byers, J.Considine, M.Mitzenmachen
   %%              Fast Approximate Reconcilication of Set Differences
   %%              - BU Computer Science TR
   %% @end
  
positive.code:     InnerBF = ?REP_BLOOM:new(InnerCount, proplists:get_value(inner_bf_fpr, Config)),
      LeafBF = ?REP_BLOOM:new(LeafCount, proplists:get_value(leaf_bf_fpr, Config)),
      {IBF, LBF} = fill_bloom(merkle_tree:iterator(Tree), InnerBF, LeafBF),
      ?TRACE("INNER=~p~nLeaf=~p", [?REP_BLOOM:print(IBF), 
                                   ?REP_BLOOM:print(LBF)]),    
      {art, Config, merkle_tree:get_interval(Tree), IBF, LBF}.    
  
  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
  
negative.code: 
  -spec lookup(merkle_tree:mt_node(), art()) -> boolean().
  lookup(Node, Art) ->
      lookup_cf([{Node, get_correction_factor(Art)}], Art).
  
  -spec lookup_cf([{Node, CF}], Art) -> Result when
      is_subtype(Art,    art()),
      is_subtype(Node,   merkle_tree:mt_node()),
      is_subtype(CF,     non_neg_integer()),        %correction factor
      is_subtype(Result, boolean()).
  lookup_cf([], _Art) ->
      true;
  lookup_cf([{Node, 0} | L], {art, _Conf, _I, IBF, LBF} = Art) ->
  