anchor.diff:                      )
               end,
               rt_set_nodes(RT, Nodes);
  -        false ->
  +        {value, ExistingEntry} ->
  +            % Always update a sticky entry, as that information was send from ring
  +            % maintenance.
               case Type of
                   sticky -> % update entry
                       StickyEntry = rt_get_node(node:id(Entry), RT),
  
positive.code:     % only add the entry if it doesn't exist yet or if it is a sticky node. If its a
      % stickynode, RM told us about a new neighbour -> if the neighbour was already added
      % as a normal node, convert it to a sticky node now.
      case gb_trees:lookup(node:id(Entry), get_rt_tree(RT)) =:= none of
          true ->
              % change the type to 'sticky' if the node is between the neighbors of the source
              % node
              AdaptedType = case Type of
  
negative.code:                                         intervals:in(node:id(Entry), Interval2)
                              end;
                          false ->
                              % Only two nodes are existing in the ring (otherwise, Pred == Succ
                              % means there is a bug somewhere!). When two nodes are in the
                              % system, another third node will be either the successor or
                              % predecessor of the source node when added.
                              true
  