anchor.diff:  
   % @doc Add a sticky entry to the routing table
   -spec add_sticky_entry(Entry :: node:node_type(), rt()) -> rt().
  -add_sticky_entry(Entry, RT) ->
  -   add_entry(Entry, sticky, RT).
  +add_sticky_entry(Entry, RT) -> add_entry(Entry, sticky, RT).
   
   % @doc Add the source entry to the routing table
   -spec add_source_entry(Entry :: node:node_type(), rt()) -> rt().
  
positive.code:                     _Else -> Node = rt_entry_node(V),
                          gb_trees:enter(node:id(Node), Node, Acc)
                  end
          end, gb_trees:empty(),get_rt_tree(RT))
      .
  %% userdevguide-end rt_frtchord:export_rt_to_dht_node
  
  %% userdevguide-begin rt_frtchord:to_list
  
negative.code: %% @doc Converts the internal RT to the external RT used by the dht_node.
  %% The external routing table is optimized to speed up ?RT:next_hop/2. For this, it is
  %%  only a gb_tree with keys being node ids and values being of type node:node_type().
  -spec export_rt_to_dht_node_helper(rt()) -> external_rt().
  export_rt_to_dht_node_helper(RT) ->
      % From each rt_entry, we extract only the field "node" and add it to the tree
      % under the node id. The source node is filtered.
      util:gb_trees_foldl(
  