anchor.diff:                          case entry_exists(Key, Acc) of
                               true -> Acc;
                               false -> 
  -                                io:format("Adding normal entry ~p~n", [Entry]),
                                   add_normal_entry(Entry, Acc)
                           end
                   end,
  -                LocalRT, get_rt_tree(RT)
  -            );
  +                To, get_rt_tree(From)
  +            )
  +            ;
  +
           false -> LocalRT
       end,
       rt_loop:set_rt(State, NewRT)
  
positive.code:     SizeOfRT = get_size(IntermediateRT),
      MaxEntries = maximum_entries(),
      if SizeOfRT >= MaxEntries ->
              io:format("Have to filter...~nRT:~p~n", [IntermediateRT]),
              AllowedNodes = [N || N <- gb_trees:values(get_rt_tree(RT)),
                  not is_sticky(N) and not is_source(N)],
              NewRT = entry_filtering(IntermediateRT, AllowedNodes),
              io:format("NewRT:~p~n", [NewRT]),
              NewRT;
         true -> IntermediateRT
      end.
  
  
negative.code: 
  -spec successor_node(RT :: rt(), Node :: rt_entry()) -> rt_entry().
  successor_node(RT, Node) ->
      try gb_trees:get(adjacent_succ(Node), get_rt_tree(RT)) catch
           error:function_clause -> exit('stale adjacent fingers')
      end.
  
  -spec spacing(Node :: rt_entry(), RT :: rt()) -> float().
  spacing(Node, RT) ->
  