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:             end,
              % update failure detector:
              case ReportToFD of
                  true -> NewPids = to_pid_list(NewRT),
                          OldPids = to_pid_list(OldRT),
                          fd:update_subscriptions(OldPids, NewPids);
                  _ -> ok
              end
      end
      .
  %% userdevguide-end rt_frtchord:check
  
  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
  
negative.code:     case nodelist:node(OldNeighbors) =:= nodelist:node(NewNeighbors) of
          true -> % source node didn't change
              % update the sticky nodes: delete old nodes and add new nodes
              {ok, remove_and_ping_entries(NewNeighbors, OldRT)}
              ;
          _Else -> % source node changed, rebuild the complete table
              {trigger_rebuild, OldRT} % XXX this triggers init_stabilize
  