anchor.diff:  -spec rt_get_nodes(RT :: rt()) -> [rt_entry()].
   rt_get_nodes(RT) -> gb_trees:values(get_rt_tree(RT)).
   
  -% @doc Set the treeof nodes of the routing table.
  +% @doc Set the tree of nodes of the routing table.
   -spec rt_set_nodes(RT :: rt(), Nodes :: rt_t_tree()) -> rt().
   rt_set_nodes(#rt_t{source=undefined}, _) -> erlang:error(source_node_undefined);
   rt_set_nodes(#rt_t{} = RT, Nodes) -> RT#rt_t{nodes=Nodes}.
  
positive.code: 
          false -> OldRT
      end,
      ?RT:check(OldRT, NewRT, rt_loop:get_neighb(State), true),
      rt_loop:set_rt(State, NewRT);
  
  % lookup a random key chosen with a pdf:
  
negative.code: 
  %% userdevguide-begin rt_frtchord:export_rt_to_dht_node
  %% @doc Converts the internal RT to the external RT used by the dht_node.
  %% The external routing table is optimized to speed up 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) ->
  