anchor.diff:                  gb_trees:enter(SuccId, NewSucc, Tree))
       end,
   
  -    RT#rt_t{nodes=UpdatedTree}.
  +    RT#rt_t{nodes=UpdatedTree}
  +    .
   
   % @doc Create an rt_entry and return the entry together with the Pred und Succ node, where
   % the adjacent fingers are changed for each node.
  
positive.code:     LocalRT = rt_loop:get_rt(State),
      NewRT = case LocalRT =/= RT of
          true ->
              % Merge the smaller table into the bigger one
              % - add each entry from the other RT if it doesn't already exist
              % - entries to be added have to be normal entries
              {From, To} = case get_size(RT) < get_size(LocalRT) of
                  true -> {RT, LocalRT};
                  false -> {LocalRT, RT}
              end,
              util:gb_trees_foldl(
                  fun(Key, Entry, Acc) ->
                          %% TODO send an async message to check if entry is valid; if it
                          %isn't, delete it later
                          %% TODO if an entry exist, we might have to update the fingers
                          case entry_exists(Key, Acc) of
                              true -> Acc;
                              false -> 
                                  add_normal_entry(rt_entry_node(Entry), Acc)
                          end
                  end,
                  To, get_rt_tree(From)
              )
              ;
  
          false -> LocalRT
      end,
      rt_loop:set_rt(State, NewRT)
      ;
  
  
negative.code: 
      SizeOfRT = get_size(IntermediateRT),
      MaxEntries = maximum_entries(),
      case SizeOfRT >= MaxEntries of
          true ->
              AllowedNodes = [N || N <- gb_trees:values(get_rt_tree(IntermediateRT)),
                  not is_sticky(N) and not is_source(N)],
              NewRT = entry_filtering(IntermediateRT, AllowedNodes),
              %% only delete the subscription if the added node was not filtered;
              %otherwise, there isn't a subscription yet
              case rt_lookup_node(node:id(Entry), NewRT) of
                  none -> % the newly added node was filtered; do nothing
                      ok;
                  _Else ->
                      update_fd(RT, NewRT)
              end,
              NewRT
              ;
          false -> IntermediateRT
      end
      .
  
  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
  % RT and RT entry record accessors
  