anchor.diff:          true -> set_should_dump(EmptyRT);
           _ -> EmptyRT
       end,
  -    update_entries(Neighbors, RT)
  -    .
  +    update_entries(Neighbors, RT).
   
   %% @doc Hashes the key to the identifier space.
   -spec hash_key(client_key()) -> key().
  
positive.code:     end
      .
  
  %% @doc Set up a set of subscriptions from a routing table
  -spec add_fd(RT :: rt())  -> ok.
  add_fd(#rt_t{} = RT) ->
      NewPids = to_pid_list(RT),
      fd:subscribe(NewPids).
  
  %% @doc Update subscriptions
  -spec update_fd(OldRT :: rt(), NewRT :: rt()) -> ok.
  update_fd(OldRT, OldRT) -> ok;
  update_fd(#rt_t{} = OldRT, #rt_t{} = NewRT) ->
      OldPids = to_pid_list(OldRT),
      NewPids = to_pid_list(NewRT),
      fd:update_subscriptions(OldPids, NewPids).
  
  %% userdevguide-end rt_frtchord:check
  
negative.code:     Node = #rt_entry{type=sticky} = rt_get_node(EntryKey, RT),
      NewNode = Node#rt_entry{type=normal},
      UpdatedTree = gb_trees:enter(EntryKey, NewNode, get_rt_tree(RT)),
      RT#rt_t{nodes=UpdatedTree}.
  
  
  -spec rt_entry_from(Node::node:node_type(), Type :: entry_type(),
                      PredId :: key_t(), SuccId :: key_t()) -> rt_entry().
  rt_entry_from(Node, Type, PredId, SuccId) ->
      #rt_entry{node=Node , type=Type , adjacent_fingers={PredId, SuccId}}.
  
  % @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.
  