anchor.diff:                              false -> add_normal_entry(rt_entry_node(Entry), Acc)
                           end
                   end,
  -                LocalRT, get_rt_tree(RT));
  -
  -        false -> LocalRT
  +                OldRT, get_rt_tree(RT));
  +
  +        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:
  
positive.code:     NewRT = case ?RT:rt_lookup_node(node:id(NewNode), OldRT) of
          none -> RT = ?RT:add_normal_entry(NewNode, OldRT),
                  ?RT:check(OldRT, RT, rt_loop:get_neighb(State), true),
                  RT;
          _Else ->  OldRT
      end,
  
      rt_loop:set_rt(State, NewRT)
      ;
  
  
negative.code: rt_get_node(NodeId, RT)  -> gb_trees:get(NodeId, get_rt_tree(RT)).
  
  % @doc Similar to rt_get_node/2, but doesn't crash when the id doesn't exist
  -spec rt_lookup_node(NodeId :: key(), RT :: rt()) -> {value, rt_entry()} | none.
  rt_lookup_node(NodeId, RT) -> gb_trees:lookup(NodeId, get_rt_tree(RT)).
  
  % @doc Get the id of a given node
  