anchor.diff: -% @copyright 2011 Zuse Institute Berlin
  +% @copyright 2011,2012 Zuse Institute Berlin
   %
   %   Licensed under the Apache License, Version 2.0 (the "License");
   %   you may not use this file except in compliance with the License.
  
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: %% @author Maik Lange <malange@informatik.hu-berlin.de>
  %% @doc    Approximate Reconciliation Tree (ART) implementation
  %%         Represents a packed merkle tree.
  %% @end
  %% @reference
  %%         2002 - J.Byers, J.Considine, M.Mitzenmachen
  %%              Fast Approximate Reconcilication of Set Differences
  %%              - BU Computer Science TR
  %% @end
  