anchor.diff:                      _Else -> Node = rt_entry_node(V),
                           gb_trees:enter(node:id(Node), Node, Acc)
                   end
  -        end, gb_trees:empty(),get_rt_tree(RT))
  -    .
  +        end, gb_trees:empty(),get_rt_tree(RT)).
  +
  +-spec export_rt_to_dht_node(rt(), Neighbors::nodelist:neighborhood()) -> external_rt().
  +export_rt_to_dht_node(RT, _Neighbors) ->
  +    export_rt_to_dht_node_helper(RT).
   %% userdevguide-end rt_frtchord:export_rt_to_dht_node
   
   %% userdevguide-begin rt_frtchord:to_list
  
positive.code: 
          false -> OldRT
      end,
      ?RT:check(OldRT, RT, rt_loop:get_neighb(State), true),
      rt_loop:set_rt(State, NewRT);
  
  % lookup a random key chosen with a pdf:
  
negative.code: 
      % convert former neighboring nodes to normal nodes and add sticky nodes
      FilteredRT = lists:foldl(fun sticky_entry_to_normal_node/2, RT, ConvertNodesIds),
      NewRT = sets:fold(fun add_sticky_entry/2, FilteredRT, ToBeAddedNodes),
      check_helper(RT, NewRT, true),
      NewRT
      .
  
  %% userdevguide-begin rt_frtchord:update
  